• Kyungpook Mathematical Journal
• /
• v.46 no.2
• /
• pp.211-217
• /
• 2006

In this paper, we have shown that the convergence of one-step, two-step and three-step iterations is equivalent, which are known as Mann, Ishikawa and Noor iteration procedures, for a special class of Lipschitzian operators defined in a closed, convex subset of an arbitrary Banach space.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.4
• /
• pp.219-232
• /
• 2002

In numerically controlled(NC) machining simulation, a Z-map has been used frequently for representing a workpiece. Since the Z-map is usually represented by a set of Z-axis aligned vectors, the machining process can be simulated through calculating the intersection points between the vectors and the surface swept by a machining tool. In this paper, we present an efficient method to calculate those intersection points when an APT-type tool moves along a linear tool path. Each of the intersection points can be expressed as the solution of a system of non-linear equations. We transform this system of equations into a single-variable equation, and calculate the candidate interval in which the unique solution exists. We prove the existence of a solution and its uniqueness in this candidate interval. Based on these characteristics, we can effectively apply numerical methods to finally calculate the solution of the non-linear equations within a given precision. The whole process of NC simulation can be achieved by updating the Z-map properly. Our method can provide more accurate results with a little more processing time, in comparison with the previous closed-form solution.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.1032-1043
• /
• 2015

ETRI's Co-Pilot project is aimed at the development of an automated vehicle that cooperates with a driver and interacts with other vehicles on the road while obeying traffic rules without collisions. This paper presents a core block within the Co-Pilot system; the block is named "Co-Pilot agent" and consists of several main modules, such as road map generation, decision-making, and trajectory generation. The road map generation builds road map data to provide enhanced and detailed map data. The decision-making, designed to serve situation assessment and behavior planning, evaluates a collision risk of traffic situations and determines maneuvers to follow a global path as well as to avoid collisions. The trajectory generation generates a trajectory to achieve the given maneuver by the decision-making module. The system is implemented in an open-source robot operating system to provide a reusable, hardware-independent software platform; it is then tested on a closed road with other vehicles in several scenarios similar to real road environments to verify that it works properly for cooperative driving with a driver and automated driving.

• Journal of the Korean Mathematical Society
• /
• v.38 no.5
• /
• pp.1069-1105
• /
• 2001

Regular maps and hypermaps are cellular decompositions of closed surfaces exhibiting the highest possible number of symmetries. The five Platonic solids present the most familar examples of regular maps. The gret dodecahedron, a 5-valent pentagonal regular map on the surface of genus 5 discovered by Kepler, is probably the first known non-spherical regular map. Modern history of regular maps goes back at least to Klein (1878) who described in [59] a regular map of type (3, 7) on the orientable surface of genus 3. In its early times, the study of regular maps was closely connected with group theory as one can see in Burnside’s famous monograph [19], and more recently in Coxeter’s and Moser’s book [25] (Chapter 8). The present-time interest in regular maps extends to their connection to Dyck\`s triangle groups, Riemann surfaces, algebraic curves, Galois groups and other areas, Many of these links are nicely surveyed in the recent papers of Jones [55] and Jones and Singerman [54]. The presented survey paper is based on the talk given by the author at the conference “Mathematics in the New Millenium”held in Seoul, October 2000. The idea was, on one hand side, to show the relationship of (regular) maps and hypermaps to the above mentioned fields of mathematics. On the other hand, we wanted to stress some ideas and results that are important for understanding of the nature of these interesting mathematical objects.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.20 no.5
• /
• pp.1591-1602
• /
• 1996

In operating the underwater engines such as encountered in exploring submarines, the dumping of the exhaust gas out of the engine requires a large portion of the total power, frequently amounting to 25-30% of the power generated. This unfavorable circumstance can be cured by liquefying the exhaust gas and storing it. In the present study, two liquefaction systems were simulated to enhance the overall efficiency; one is a closed cycle diesel engine and the other is a closed cycle LNG engine. The liquefied natural gas (LNG) is chosen as a fuel, not only because its use is economical but also because its cold energy can be utilized within the liquefaction system. Since a mixture of oxygen and carbon dioxide is used as an oxidizer, liquefying carbon dioxide is of major concern in this study. For further improving this system, the intercooling of the compressor is devised. The necessary power consumed for the liquefying system is examined in terms of the related properties such as pressure and temperature of the carbon dioxide vessel as a function of the amount of the exhaust gas which enters the compressor. The present study was successful to show that much gain in the power and reduction of the vessel pressure could be achieved in the case of the closed cycle LNG engine. The compression power of exhaust gas were observed remarkably lower, typically only 6.3% for the closed cycle diesel engine and 3.4% for the closed cycle LNG engine respectively, out of net engine power. For practicality, a design -purpose map of the operating parameters of the liquefaction systems was also presented.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.303-310
• /
• 2013

In this paper, we first show that $z_{{\kappa}X}:E_{cc}({\kappa}X){\rightarrow}{\kappa}X$ is $z^{\sharp}$-irreducible and that if $\mathcal{G}(E_{cc}({\beta}X))$ is a base for closed sets in ${\beta}X$, then $E_{cc}({\kappa}X)$ is $C^*$-embedded in $E_{cc}({\beta}X)$, where ${\kappa}X$ is the extension of X such that $vX{\subseteq}{\kappa}X{\subseteq}{\beta}X$ and ${\kappa}X$ is weakly Lindel$\ddot{o}$f. Using these, we will show that if $\mathcal{G}({\beta}X)$ is a base for closed sets in ${\beta}X$ and for any weakly Lindel$\ddot{o}$f space Y with $X{\subseteq}Y{\subseteq}{\kappa}X$, ${\kappa}X=Y$, then $kE_{cc}(X)=E_{cc}({\kappa}X)$ if and only if ${\beta}E_{cc}(X)=E_{cc}({\beta}X)$.

• Korean Journal of Remote Sensing
• /
• v.14 no.2
• /
• pp.129-136
• /
• 1998

This paper deals with a problem encountered in the course of constructing digital elevation model from a contour map. Deficiencies of widely used linear interpolation method is described, and an interpolation method for internal points of a single closed contour is proposed. Control points not on a plane are searched and interpolated. The method is applied to an artificial contour lines and real contour lines. The result shows natural and accurate reconstruction.

• Honam Mathematical Journal
• /
• v.33 no.4
• /
• pp.575-589
• /
• 2011

In order to examine the possibility of some topological structures into the fields of network science, telecommunications related to the future internet and a digitization, the paper studies the Marcus Wyse topological structure. Further, this paper develops the notions of lattice based Marcus Wyse continuity and lattice based Marcus Wyse homeomorphism which can be used for studying spaces $X{\subset}R^2$ in the Marcus Wyse topological approach. By using these two notions, we can study and classify lattice based simple closed Marcus Wyse curves.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.599-606
• /
• 2005

Novelty detection involves identifying novel patterns. They are not usually available during training. Even if they are, the data quantity imbalance leads to a low classification accuracy when a supervised learning scheme is employed. Thus, an unsupervised learning scheme is often employed ignoring those few novel patterns. In this paper, we propose two ways to make use of the few available novel patterns. First, a scheme to determine local thresholds for the Self Organizing Map boundary is proposed. Second, a modification of the Learning Vector Quantization learning rule is proposed so that allows one to keep codebook vectors as far from novel patterns as possible. Experimental results are quite promising.

• Journal of the Korean Mathematical Society
• /
• v.42 no.1
• /
• pp.129-134
• /
• 2005

Lpt X be a reduced Stein space and L a holomorphic line bundle on X. L is spanned by its global sections and the associated holomorphic map $h_L\;:\;X{\to}P(H^0(X, L)^{\ast})$ is an embedding. Choose any locally convex vector topology ${\tau}\;on\;H^0(X, L)^{\ast}$ stronger than the weak-topology. Here we prove that $h_L(X)$ is sequentially closed in $P(H^0(X, L)^{\ast})$ and arithmetically Cohen -Macaulay. i.e. for all integers $k{\ge}1$ the restriction map ${\rho}_k\;:\;H^0(P(H^0(X, L)^{\ast}),\;O_{P(H^0(X, L)^{\ast})}(k)){\to}H^0(h_L(X),O_{hL_(X)}(k)){\cong}H^0(X, L^{\otimes{k}})$ is surjective.