• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.657-661
• /
• 2010

We study a singular function which we call a generalized cylinder convex(concave) function induced from different generalized dyadic expansion systems on the unit interval. We show that the generalized cylinder convex(concave)function is a singular function and the length of its graph is 2. Using a local dimension set in the unit interval, we give some characterization of the distribution set using its derivative, which leads to that this singular function is nowhere differentiable in the sense of topological magnitude.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.2017-2022
• /
• 2004

Data association is a process that matches a recent observation with known data set, which is used for the localization of mobile robots. Edges in topological maps have rich information which can be used for the data association. However, no systematic approach on using the edge data for data association has been reported. This paper proposes a systematic way of utilizing the edge data for data association. First, we explain a Local Generalized Voronoi Angle(LGA) to represent the edge data in 1-dimension. Second, we suggest a key factor extraction procedure from the LGA to reduce the number by $2^7-2^8$ times, for computational efficiency using the wavelet transformation. Finally we propose a way of data association using the key factors of the LGA. Simulations show that the proposed data association algorithm yields higher probability for similar edges in computationally efficient manner.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.97-106
• /
• 1996

Existing CAD systems do not provide advanced functions for automatic checking design and drafting errors in mechanical drawings. If the knowledge of checking in mechanical ddrsfting can be implemented into computers, CAD systems could automatically check for design and drafting errors. This paper describes a method for systematic checking of dimension errors. such as deficiency and/or redundancy of dimension input-errors in dimension figures and symbols, etc. The logic for finding dimensional errors is written by using a proccedural language. A geometric model and a topological-graph model are used in this method. Checking for deficiency and redundancy of dimensions is based upon graph Theory.

• Journal of the Economic Geographical Society of Korea
• /
• v.10 no.4
• /
• pp.427-443
• /
• 2007

The purpose of this study is to investigate spacio-temporal structures of traffic flows on the subway network in the Metropolitan Seoul, and the relationships between topological structures of traffic flows and land use patterns. In particular we analyze in the topological structures of traffic flows on the subway network in time dimension as well as in spatial dimension. For the purpose, this study utilizes data mining techniques to the one day T-card transaction data of the last four years, which has developed for exploring the characteristics of traffic flows from large scale trip-transaction databases. The topological structures of traffic flows on the subway network has changed considerably during the last four years. The volumes of traffic flows, the travel time and stops per trip have increased until 2006 and decreased again in 2007. The results are visualized by utilizing GIS and analyzed, and thus the spatial patterns of traffic flows are analyzed. The spatial distribution patterns of trip origins and destinations show substantial differences among time zones during a day. We analyze the relationships between traffic flows at subway stops and the geographical variables reflecting land use around them. We obtain 6 log-linear functions from stepwise multiple regression analysis. We test multicollinearity among the variables and autocollelation for the residuals.

• Journal of the Korean Chemical Society
• /
• v.57 no.2
• /
• pp.176-203
• /
• 2013

In this work is induced a new topology of solutions of chemical equations by virtue of point-set topology in an abstract stoichiometrical space. Subgenerators of this topology are the coefficients of chemical reaction. Complex chemical reactions, as those of direct reduction of hematite with a carbon, often exhibit distinct properties which can be interpreted as higher level mathematical structures. Here we used a mathematical model that exploits the stoichiometric structure, which can be seen as a topology too, to derive an algebraic picture of chemical equations. This abstract expression suggests exploring the chemical meaning of topological concept. Topological models at different levels of realism can be used to generate a large number of reaction modifications, with a particular aim to determine their general properties. The more abstract the theory is, the stronger the cognitive power is.

• Honam Mathematical Journal
• /
• v.27 no.3
• /
• pp.477-485
• /
• 2005

Let ($M^n$, g) be a compact oriented Riemannian manifold. It has been conjectured that every solution of the equation $z_g=D_gdf-{\Delta}_gfg-fr_g$ is an Einstein metric. In this article, we deal with the 3 dimensional case of the equation. In dimension 3, if the conjecture fails, there should be a stable minimal hypersurface in ($M^3$, g). We study some necessary conditions to guarantee that a stable minimal hypersurface exists in $M^3$.

• The Pure and Applied Mathematics
• /
• v.10 no.2
• /
• pp.103-118
• /
• 2003

We estimate the stable rank of twisted crossed products of $C^{*}-algebras$ by topological Abelian groups. As an application we estimate the stable rank of twisted crossed products of $C^{*}-algebras$ by solvable Lie groups. In particular, we obtain the stable rank estimate of twisted group $C^{*}-algebras$ of solvable Lie groups by the (reduced) dimension and (generalized) rank of groups.

• Journal of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1421-1431
• /
• 2021

In this paper we study the preservation of various notions of expansivity in discrete dynamical systems and the induced map for n-fold symmetric products and hyperspaces. Then we give a characterization of a compact metric space admitting hyper N-expansive homeomorphisms via the topological dimension. More precisely, we show that C⁰-generically, any homeomorphism on a compact manifold is not hyper N-expansive for any N ∈ ℕ. Also we give some examples to illustrate our results.

• The Mathematical Education
• /
• v.6 no.2
• /
• pp.1-9
• /
• 1968

In mathematics, a definition must have authentic reasons to be defined so. On defining geometric figures, there must be adequencies in sequel and consistency in the concepts of figures, though the dimensions of them are different. So we can avoid complicated thoughts from the study of geometric property. From the texts of SMSG, UICSM and others, we can find easily that the same concepts are not kept up on defining some figures such as ray and segment on a line, angle and polygon on a plane, and polyhedral angle and polyhedron on a 3-dimensionl space. And the measure of angle is not well-defined on basis of measure theory. Moreover, the concepts for interior, exterior, and frontier of each figure used in these texts are different from those of general topology and algebraic topology. To avoid such absurdness, I myself made new terms and their definitions, such as 'gan' instead of angle, 'polygonal region' instead of polygon, and 'polyhedral solid' instead of polyhedron, where each new figure contains its interior. The scope of this work is hmited to the fundamental idea, and it merely has dealt with on the concepts of measure, dimension, and topological property. In this case, the measure of a figure is a set function of it, so the concepts of measure is coincided with that of measure theory, and we can deduce the topological property for it from abstract stage. It also presents appropriate concepts required in much clearer fashion than traditional method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.27 no.4
• /
• pp.324-341
• /
• 2023

Topological data analysis (TDA) is a data analysis technique, recently developed, that investigates the overall shape of a given dataset. The mapper algorithm is a TDA method that considers the connectivity of the given data and converts the data into a mapper graph. Compared to persistent homology, another popular TDA tool, that mainly focuses on the homological structure of the given data, the mapper algorithm is more of a visualization method that represents the given data as a graph in a lower dimension. As it visualizes the overall data connectivity, it could be used as a prediction method that visualizes the new input points on the mapper graph. The existing mapper packages such as Giotto-TDA, Gudhi and Kepler Mapper provide the descriptive mapper algorithm, that is, the final output of those packages is mainly the mapper graph. In this paper, we develop a simple predictive algorithm. That is, the proposed algorithm identifies the node information within the established mapper graph associated with the new emerging data point. By checking the feature of the detected nodes, such as the anomality of the identified nodes, we can determine the feature of the new input data point. As an example, we employ the fraud credit card transaction data and provide an example that shows how the developed algorithm can be used as a node prediction method.