• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.31-36
• /
• 1992

This paper describes the development of a 'General-purpose ETRI MAP interface module' (GEM) for a Mini-MAP network. GEM operates as a Mini-MAP node in our FA system. To communicate between GEM and programmable devices such as PLC, CNC, and robot, RS232C is used, which is a traditional method. A Mini-MAP host system controls and monitors programmable devices via GEM. The Mini-MAP function of GEM is implemented and tested on the basis of the MAP V3.0.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.5
• /
• pp.343-350
• /
• 2019

Map labels are the most recognizable map elements using the human visual system because they are essentially a natural language. In this study, an experiment was conducted using an eye-tracker to objectively record and analyze the response of subjects regarding visual attention to map labels. A primary building object was identified by analyzing visit counts, average visit duration, fixation counts, and the average fixation duration of a subject's gaze for an area of interest acquired using the eye-tracker. The unmarked rate of map labels in Google map, Naver map, and Daum map was calculated. As a result, this rate exceeded fifty-one percent, with the lowest rate recorded for Google map. It is expected that the results of this study will contribute to an increase in the diversity of research in terms of the spatial cognition approach for map labels, which is more helpful to users than the existing body of work on methods of expression for labels.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.2 s.332
• /
• pp.39-48
• /
• 2005

An HMIPv6 provides micro mobility management using MAP for decreasing handover delay and network load in a mobile IP networks. An HMIPv6 uses distance based algorithm for MAP selection when a mobile host enters a new network domain. However, since every mobile hosts select a farthest router as a MAP, a handover delay and packet loss will be increased. A new MAP selection scheme is herein proposed to solve the problems caused by the distance based MAP selection algorithm by using secondary MAP. We executed the performance evaluation by simulation about handover delay and packet loss of an HMIPv6 and our proposed scheme. The simulation results show that the performance of our proposed scheme is better than that of HMIPv6.

• Knowledge Management Research
• /
• v.13 no.1
• /
• pp.1-12
• /
• 2012

A knowledge map is a network-typed diagram visualizing all kinds of knowledge that influences each other to solve a problem. A knowledge map determines the structure of knowledge categorizing and archiving by defining the relationship of referential navigation among knowledge. Since tremendous and increasing number of knowledge needs to be included in a knowledge map, a knowledge map must be organized automatically by considering the contents and relationships of knowledge. This paper suggests the concept and prototype of a semi-automated knowledge map which automatically maps new piece of knowledge onto a manually provided draft map. The prototype knowledge map is based on the recursive programming to make a knowledge map automatically determine the location of the newly-entered knowledge by considering the referential relationship between knowledge. The proposed knowledge enables the knowledge network to expand autonomously by automatically including and storing knowledge. Also, it can improve the accuracy and applicability of knowledge for problem-solving, because the relationship of referential navigation among knowledge can be efficiently and effectively expressed.

• The Pure and Applied Mathematics
• /
• v.5 no.1
• /
• pp.55-63
• /
• 1998

A Gauss map of m-dimensional distribution on a Riemannian manifold M is called a harmonic Gauss map if it is a harmonic map from the manifold into its Grassmann bundle $G_m$(TM) of m-dimensional tangent subspace. We calculate the tension field of the Gauss map of m-dimensional distribution and especially show that the Hopf fibrations on $S^{4n＋3}$ are the harmonic Gauss map of 3-dimensional distribution.

• The Journal of Korea Robotics Society
• /
• v.6 no.3
• /
• pp.247-254
• /
• 2011

This paper presents a method of sonar grid map matching for topological place recognition. The proposed method provides an effective rotation invariant grid map matching method. A template grid map is firstly extracted for reliable grid map matching by filtering noisy data in local grid map. Using the template grid map, the rotation invariant grid map matching is performed by Ring Projection Transformation. The rotation invariant grid map matching selects candidate locations which are regarded as representative point for each node. Then, the topological place recognition is achieved by calculating matching probability based on the candidate location. The matching probability is acquired by using both rotation invariant grid map matching and the matching of distance and angle vectors. The proposed method can provide a successful matching even under rotation changes between grid maps. Moreover, the matching probability gives a reliable result for topological place recognition. The performance of the proposed method is verified by experimental results in a real home environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1056-1059
• /
• 2003

Self-Oranizing Map(SOM) is an unsupervised neural network providing cluster analysis of high dimensional input data. The output from the SOM is represented in map that help us to explore data. The weak point of conventional SOM is when the map is large, it take a long time to train the data. The computing time is known to be O(MN) for trainning to find the winning node (M,N are the number of nodes in width and height of the map). This paper presents a new method to reduce the computing time by creating new map. Each node in a new map is the centroid of nodes' group that are in the original map. After create a new map, we find the winning node of this map, then find the winning node in original map only in nodes that are represented by the winning node from the new map. This new method is called "High Speed Self-Oranizing Map"(HS-SOM). Our experiment use HS-SOM to cluster documents and compare with SOM. The results from the experiment shows that HS-SOM can reduce computing time by 30%-50% over conventional SOM.

• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.207-213
• /
• 2006

Mobility Anchor points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro hand off. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we propose a novel scheme to select a MAP to minimize the communication cost, taking the mobile node's moving speed and data rate into account. To come up with the scheme we analyses the communication analyses the communication cost into the binding update cost and the data packet delivery cost, and derive an equation representing the optimal MAP domain size to minimize the total cost.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4A
• /
• pp.546-552
• /
• 2000

The decoding of Turbo-Code relies on the application of a soft input/soft output decoders which can be realized using maximum-a-posteriori(MAP) symbol estimator[l]. Radix-2 MAP decoder can not be used for high speed communications because of a large number of interleaver block size N. This paper proposed a new simple method for radix-4 MAP decoder based on radix-2 MAP decoder in order to reduce the interleave block size. A branch metrics, forward and backward recursive functions are proposed for applying to radix-4 MAP structure with symbol interleaver. Radix-4 MAP decoder shall be illustratively described and its error performance capability shall be compared to conventional radix-2 MAP decoder in AWGN channel.

• 한국정보통신설비학회:학술대회논문집
• /
• 2007.08a
• /
• pp.323-326
• /
• 2007

Mobility Anchor Points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro handoff. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we proposed a cost effective MAP selection scheme. When leaving the current MAP domain. the mobile node calculates the optimum MAP domain size to minimize the local mobility cost at the new MAP domain considering mobile node's velocity and packet transmission rate. The mobile node then selects a MAP domain of size close to the optimum domain size calculated among the candidate MAP domains. In this way, it is possible for the mobile node to select an optimal MAP adaptively taking the network and node states into account, thus reducing the communication cost.