• Bulletin of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.1087-1098
• /
• 2013

We find a $C^{\infty}$-continuous path of Riemannian metrics $g_t$ on $\mathbb{R}^k$, $k{\geq}3$, for $0{\leq}t{\leq}{\varepsilon}$ for some number ${\varepsilon}$ > 0 with the following property: $g_0$ is the Euclidean metric on $\mathbb{R}^k$, the scalar curvatures of $g_t$ are strictly decreasing in $t$ in the open unit ball and $g_t$ is isometric to the Euclidean metric in the complement of the ball. Furthermore we extend the discussion to the Fubini-Study metric in a similar way.

• Journal of the Korean Mathematical Society
• /
• v.41 no.2
• /
• pp.379-396
• /
• 2004

In this article, we study rotation surfaces in the 4-dimensional pseudo-Euclidean space E$_2$$^4$. Also, we obtain the complete classification theorems for the flat rotation surfaces with finite type Gauss map, pointwise 1-type Gauss map and an equation in terms of the mean curvature vector. In fact, we characterize the flat rotation surfaces of finite type immersion with the Gauss map and the mean curvature vector field, namely the Gauss map of finite type, pointwise 1-type Gauss map and some algebraic equations in terms of the Gauss map and the mean curvature vector field related to the Laplacian of the surfaces with respect to the induced metric.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.1
• /
• pp.5-12
• /
• 1995

In the case where the set of training vectors constitute clusters, the codevectors of the codebook which is used to compression for speech and images in the vector quantization are regarded as the central vectors of the clusters constituted by given training vectors. In this work, we consider the distribution of Euclidean distance obtaining in the process of searching for the minimum distance between vectors, and propose the method searching for the proper number of and the central vectors of clusters. And then, the proposed method shows more than the about 4[dB] SNR than the LBG algorithm and the competitive learning algorithm

• Journal of Communications and Networks
• /
• v.16 no.3
• /
• pp.249-257
• /
• 2014

This paper presents methods to the construction of regular and irregular low-density parity-check (LDPC) codes based on Euclidean geometries over the Galois field. Codes constructed by these methods have quasi-cyclic (QC) structure and large girth. By decomposing hyperplanes in Euclidean geometry, the proposed irregular LDPC codes have flexible column/row weights. Therefore, the degree distributions of proposed irregular LDPC codes can be optimized by technologies like the curve fitting in the extrinsic information transfer (EXIT) charts. Simulation results show that the proposed codes perform very well with an iterative decoding over the AWGN channel.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.1056-1064
• /
• 2003

The Euclidean steiner tree problem (ESTP) is to find a minimum-length euclidean interconnection of a set of points in the plane. It is well known that the solution to this problem will be the minimal spanning tree (MST) on some set steiner points, and the ESTP is NP-complete. The ESTP has received a lot of attention in the literature, and heuristic and optimal algorithms have been proposed. In real field, heuristic algorithms for ESTP are popular. A key performance measure of the algorithm for the ESTP is the reduction rate that is achieved by the difference between the objective value of the ESTP and that of the MST without steiner points. In recent survey for ESTP, the best heuristic algorithm showed around $3.14\%$ reduction in the performance measure. We present a evolution programming (EP) for ESTP based upon the Prim algorithm for the MST problem. The computational results show that the EP can generate better results than already known heuristic algorithms.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.157-172
• /
• 2015

We introduce a non-Euclidean metric for transportation systems with a defined minimum transportation cost (initial fare) and investigate the continuous single-facility Weber location problem based on this metric. The proposed algorithm uses the results for solving the Weber problem with Euclidean metric by Weiszfeld procedure as the initial point for a special local search procedure. The results of local search are then checked for optimality by calculating directional derivative of modified objective functions in finite number of directions. If the local search result is not optimal then algorithm solves constrained Weber problems with Euclidean metric to obtain the final result. An illustrative example is presented.

• The Mathematical Education
• /
• v.45 no.3 s.114
• /
• pp.367-373
• /
• 2006

This study suggests that it is necessary to prove that the values of three areas of a triangle, which are obtained by the multiplication of the respective base and its corresponding height, are the same. It also seeks to deeply understand the meaning of Area formula of triangles by exploring some questions raised in the analysis of the proof. Area formula of triangles expresses the invariance of congruence and additivity on one hand, and the uniqueness of parallel line, one of the characteristics of Euclidean geometry, on the other. This discussion can be applied to introducing and developing exploratory learning on area in that it revisits the ordinary thinking on area.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.127-135
• /
• 2000

This paper provides a new method of initializing neurons used in self-organizing neural networks and sequencing input nodes for applying to Euclidean traveling salesman problem. We use a general property that in any optimal solution for Euclidean traveling salesman problem, vertices located on the convex hull are visited in the order in which they appear on the convex hull boundary. We composite input nodes as number of convex hulls and initialize neurons as shape of the external convex hull. And then adapt input nodes as the convex hull unit and all convex hulls are adapted as same pattern, clockwise or counterclockwise. As a result of our experiments, we obtain l∼3 % improved solutions and these solutions can be used for initial solutions of any global search algorithms.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.3
• /
• pp.581-588
• /
• 2012

We find a $C^{\infty}$ one-parameter family of Riemannian metrics $g_t$ on $\mathbb{R}^3$ for $0{\leq}t{\leq}{\varepsilon}$ for some number ${\varepsilon}$ with the following property: $g_0$ is the Euclidean metric on $\mathbb{R}^3$, the scalar curvatures of $g_t$ are strictly decreasing in t in the open unit ball and $g_t$ is isometric to the Euclidean metric in the complement of the ball.

• Journal for History of Mathematics
• /
• v.33 no.3
• /
• pp.155-165
• /
• 2020

Pythagorean theorem is a proposition on the relationship between the lengths of three sides of a right triangle. It is well known that Pythagorean theorem for Euclidean geometry deforms into an interesting form in non-Euclidean geometry. In this paper, we investigate a new perspective that replaces right triangles with 'proper triangles' so that Pythagorean theorem extends to non-Euclidean geometries without any modification. This is seen from the perspective that a rectangle is an equiangular quadrilateral, and a right triangle is a half of a rectangle. Surprisingly, a proper triangle (defined by Paolo Maraner), which is a half of an equiangular quadrilateral, satisfies Pythagorean theorem in many geometries, including hyperbolic geometry and spherical geometry.