• 제어로봇시스템학회논문지
• /
• 제2권2호
• /
• pp.108-114
• /
• 1996

We present proofs of the stability and convergence of Self-organizing feature map (SOFM) neural network with time-invarient learning rate and binary reinforcement function. One of the major problems in Self-organizing feature map neural network concerns with learning rate-"Kalman Filter" gain in stochsatic control field which is monotone decreasing function and converges to 0 for satisfying minimum variance property. In this paper, we show that the stability and convergence of Self-organizing feature map neural network with time-invariant learning rate. The analysis of the proposed algorithm shows that the stability and convergence is guranteed with exponentially stable and weak convergence properties as well.s as well.

• 대한수학회논문집
• /
• 제38권1호
• /
• pp.267-280
• /
• 2023

In this article, we show that the family of all 𝓘^𝒦-open subsets in a topological space forms a topology if 𝒦 is a maximal ideal. We introduce the notion of 𝓘^𝒦-covering map and investigate some basic properties. The notion of quotient map is studied in the context of 𝓘^𝒦-convergence and the relationship between 𝓘^𝒦-continuity and 𝓘^𝒦-quotient map is established. We show that for a maximal ideal 𝒦, the properties of continuity and preserving 𝓘^𝒦-convergence of a function defined on X coincide if and only if X is an 𝓘^𝒦-sequential space.

• ETRI Journal
• /
• 제33권4호
• /
• pp.476-486
• /
• 2011

The quality of navigation service is determined by the accuracy of the available data. For existing navigation services, a full map update is provided in order to keep the map data of mobile devices current. As content and services of mobile devices have recently been diversifying, the size of map data managed in mobile devices has increased, reaching several gigabytes in size. It generally takes tens of minutes to write several gigabytes of data into mobile device storage. For traditional navigation systems, a complicated storage structure called a physical storage format (PSF) is used to assure maximum processing performance of map data in mobile devices within limited resources. Consequently, even though modified navigation map data actually affects only a portion of a map, the full map data is updated because partial updates are not possible. In this paper, a navigation system is studied to solve this difficult partial map update problem. The map air update navigation system, which is the result of this study, provides real-time partial map updating using wireless communications.

• 한국생산제조학회지
• /
• 제23권3호
• /
• pp.279-283
• /
• 2014

Recently, a topology algorithm based on the artificial bee colony algorithm (ABCA) has been proposed for static and dynamic topology optimization. From the results, the convergence rate of the algorithm was determined to be slightly slow. Therefore, we propose a new search method to improve the convergence rate of the algorithm using a chaotic map. We investigate the effect of the chaotic map on the convergence rate of the algorithm in static and dynamic topology optimization. The chaotic map has been applied to three cases, namely, employ bee search, onlooker bee search, and both employ bee as well as onlooker bee search steps. It is verified that the case in which the logistic function of the chaotic map is applied to both employ bee as well as onlooker bee search steps shows the best dynamic topology optimization, improved by 5.89% compared to ABCA. Therefore, it is expected that the proposed algorithm can effectively be applied to dynamic topology optimization to improve the convergence rate.

• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제3권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 Multimedia Information System
• /
• 제4권4호
• /
• pp.249-254
• /
• 2017

Digital vector maps must be compressed effectively for transmission or storage in Web GIS (geographic information system) and mobile GIS applications. This paper presents a polyline compression method that consists of polyline feature-based hybrid simplification and second derivative-based data compression. Experimental results verify that our method has higher simplification and compression efficiency than conventional methods and produces good quality compressed maps.

• ETRI Journal
• /
• 제37권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.

• 한국멀티미디어학회논문지
• /
• 제19권8호
• /
• pp.1453-1459
• /
• 2016

Recently, vector map has developed, used in many domains, and in most cases vector map data contains confidential information which must be kept away from unauthorized users. Moreover, the manufacturing process of a vector map is complex and the maintenance of a digital map requires substantial monetary and human resources. This paper presents the selective encryption scheme based on polyline simplification methods for GIS vector map data protection to store, transmit or distribute to authorized users. Main advantages of our algorithm are random vertices and transformation processes but it still meets requirements of security by random processes, and this algorithm can be implement to many types of vector map formats.

• 한국정보통신학회논문지
• /
• 제18권6호
• /
• pp.1381-1387
• /
• 2014

지속적인 정보기술의 발전으로 최근 인문학, 지역학 등 다른 학문 분야와의 융합에 대한 필요성이 대두되고 있다. 정보기술과 인문 지역학의 융합 분야 중에서 전자문화지도는 점, 선, 면의 공간데이타와 시간, 공간, 주제를 통하여 다양한 문화정보를 디지털화하여 전자지도 위에 표현한다. 지식지도는 전자문화지도의 활용을 고도화시킨 개념으로, 기존의 전자문화지도 상에 전문학술정보를 표현하는 것이다. 이 지식지도는 세부적으로 전자문화지도와 연계하여 학술정보를 제공하므로 주제별, 지역별, 시대별 데이터가 유기적으로 연결된 시각적이고 통합적인 정보 공유 및 확산이 가능하다. 따라서 지식지도 구축이 활성화되면 효율적인 학문 연구 및 연구결과 확산을 위한 도구로 활용될 수 있다. 본 논문에서는 먼저 지식지도에 대한 전반적인 개념, 구성에 대한 연구 내용을 기술하고, 이를 기반으로 실제 지식지도 구현을 위한 설계를 제시한다.

• Journal of Information Processing Systems
• /
• 제13권1호
• /
• pp.68-82
• /
• 2017

Nowadays, geographic information system (GIS) is developed and implemented in many areas. A huge volume of vector map data has been accessed unlawfully by hackers, pirates, or unauthorized users. For this reason, we need the methods that help to protect GIS data for storage, multimedia applications, and transmission. In our paper, a selective encryption method is presented based on vertex randomization and hybrid transform in the GIS vector map. In the proposed algorithm, polylines and polygons are focused as the targets for encryption. Objects are classified in each layer, and all coordinates of the significant objects are encrypted by the key sets generated by using chaotic map before changing them in DWT, DFT domain. Experimental results verify the high efficiency visualization by low complexity, high security performance by random processes.