• The Pure and Applied Mathematics
• /
• v.3 no.1
• /
• pp.33-40
• /
• 1996

A convergence structure defined by Kent [4] is a correspondence between the filters on a given set X and the subsets of X which specifies which filters converge to points of X. This concept is defined to include types of convergence which are more general than that defined by specifying a topology on X. Thus, a convergence structure may be regarded as a generalization of a topology. With a given convergence structure q on a set X, Kent [4] introduced associated convergence structures which are called a topological modification and a pretopological modification. (omitted)

• Journal of the Korean Mathematical Society
• /
• v.58 no.2
• /
• pp.265-281
• /
• 2021

In the kneading theory developed by Milnor and Thurston, it is proved that the kneading matrix and the kneading determinant associated with a continuous piecewise monotone map are invariant under orientation-preserving conjugacy. This paper considers the problem for orientation-reversing conjugacy and proves that the former is not an invariant while the latter is. It also presents applications of the result towards the computational complexity of kneading matrices and the classification of maps up to topological conjugacy.

• Journal of the Chungcheong Mathematical Society
• /
• v.34 no.1
• /
• pp.77-84
• /
• 2021

Let f : [0, 1] → [0, 1] be a multimodal map with positive topological entropy. The dynamics of the renormalization operator for multimodal maps have been investigated by Daniel Smania. It is proved that the measure of maximal entropy for a specific category of Cr interval maps is unique.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.11
• /
• pp.569-584
• /
• 2016

In this paper, we present a spatial knowledge extractor implemented in Hadoop MapReduce parallel, distributed computing environment. From a large spatial dataset, this knowledge extractor automatically derives a qualitative spatial knowledge base, which consists of both topological and directional relations on pairs of two spatial objects. By using R-tree index and range queries over a distributed spatial data file on HDFS, the MapReduce-enabled spatial knowledge extractor, MRSPAKE, can produce a web-scale spatial knowledge base in highly efficient way. In experiments with the well-known open spatial dataset, Open Street Map (OSM), the proposed web-scale spatial knowledge extractor, MRSPAKE, showed high performance and scalability.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.179-182
• /
• 2007

In this paper, we introduce the concepts of fuzzy (r, s)-semi-preopen sets and fuzzy (r, s)-semi-precontinuous maps on intuitionistic fuzzy topological spaces in Sostak's sense. The relations among fuzzy (r, s)-semicontinuous, fuzzy (r, s)-precontinuous, and fuzzy (r, s)-semi-precontinuous maps are discussed. The concepts of fuzzy (r, s)-semi-preinterior, fuzzy (r, s)-semi-preclosure, fuzzy (r, s)-semi-preneighborhood, and fuzzy (r, s)-quasi-semi-preneighborhood are given. Using these concepts, the characterization for the fuzzy (r, s)-semi-precontinuous map is obtained. Also, we introduce the notions of fuzzy (r, s)-semi-preopen and fuzzy (r, s)-semi-preclosed maps on intuitionistic fuzzy topological spaces in Sostak's sense, and then we investigate some of their characteristic properties.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.358-366
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the high speed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space and generates a topological feature map. A topological feature map preserves the mutual relations (similarities) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Therefore each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented a k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• The Journal of Korea Robotics Society
• /
• v.4 no.1
• /
• pp.25-33
• /
• 2009

One of the main problems of topological localization in a real indoor environment is variations in the environment caused by dynamic objects and changes in illumination. Another problem arises from the sense of topological localization itself. Thus, a robot must be able to recognize observations at slightly different positions and angles within a certain topological location as identical in terms of topological localization. In this paper, a possible solution to these problems is addressed in the domain of global topological localization for mobile robots, in which environments are represented by their visual appearance. Our approach is formulated on the basis of a probabilistic model called the Bayes filter. Here, marginalization of dynamics in the environment, marginalization of viewpoint changes in a topological location, and fusion of multiple visual features are employed to measure observations reliably, and action-based view transition model and action-associated topological map are used to predict the next state. We performed experiments to demonstrate the validity of our proposed approach among several standard approaches in the field of topological localization. The results clearly demonstrated the value of our approach.

• Journal of the Chungcheong Mathematical Society
• /
• v.4 no.1
• /
• pp.103-113
• /
• 1991

Some properties of a path space and the fundamental group ${\sigma}(X,x_0,G)$ of a topological transformation group (X, G, ${\pi}$) are described. It is shown that ${\sigma}(X,x_0,H)$ is a normal subgroup of ${\sigma}(X,x_0,G)$ if H is a normal subgroup of G ; Let (X, G, ${\pi}$) be a transformation group with the open action property. If every identification map $p:{\Sigma}(X,x,G)\;{\longrightarrow}\;{\sigma}(X,x,G)$ is open for each $x{\in}X$, then ${\lambda}$ induces a homeomorphism between the fundamental groups ${\sigma}(X,x_0,G)$ and ${\sigma}(X,y_0,G)$ where ${\lambda}$ is a path from $x_0$ to $y_0$ in X ; The space ${\sigma}(X,x_0,G)$ is an H-space if the identification map $p:{\Sigma}(X,x_0,G)\;{\longrightarrow}\;{\sigma}(X,x_0,G)$ is open in a topological transformation group (X, G, ${\pi}$).

• ETRI Journal
• /
• v.29 no.5
• /
• pp.655-666
• /
• 2007

There are nodes and edges in a topological map. Node data has been used as a main source of information for the localization of mobile robots. In contrast, edge data is regarded as a minor source of information, and it has been used in an intuitive and heuristic way. However, edge data also can be used as a good source of information and provide a way to use edge data efficiently. For that purpose, we define a data format which describes the shape of an edge. This format is called local generalized Voronoi graph's angle (LGA). However, the LGA is constituted of too many samples; therefore, real time localization cannot be performed. To reduce the number of samples, we propose a compression method which utilizes wavelet transformation. This method abstracts the LGA by key factors using far fewer samples than the LGA. Experiments show that the LGA accurately describes the shape of the edges and that the key factors preserve most information of the LGA while reducing the number of samples.

• Honam Mathematical Journal
• /
• v.33 no.1
• /
• pp.11-17
• /
• 2011

We study some properties of quasi-topological spaces. Also we introduce the concept of Q-continuity and investigate several types of quasi-topology on an SGNS.