• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.577-580
• /
• 2004

Recently, in a field of cadastre, a computerization of cadastral map is in progress with great growth of GIS field. Also, the needs for the integration of land and building information are widely increasing for integral-management and its application of various land related information. In this study, it is constructed a 3D information cadastral map model that can make the integral management of land, building, connecting land recorders, building management ledgers, building titles, building pictures, and related attribute information.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.211-214
• /
• 2003

In this paper, we intend to find user's TV program choosing pattern and, recommend programs that he/she wants. So we suggest item dependency map which express relation between chosen program. Using an algorithm that we suggest, we can recommend an program, which a user has not saw yet but maybe is likely to interested in. Item dependency map is used as patterns for association in hopfield network so we can extract users global program choosing pattern only using users partial information. Hopfield network can extract global information from sub-information. Our algorithm can predict user's inclination and recommend an user necessary information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1290-1298
• /
• 2000

Turbo Code decoder is an iterate decoding technology, which extracts extrinsic information from the bit to be decoded by calculating both forward and backward metrics, and uses the information to the next decoding step Turbo Code shows excellent performance, approaching Shannon Limit at the view of BER, when the size of Interleaver is big and iterate decoding is run enough. But it has the problems which are increased complexity and delay and difficulty of real-time processing due to Interleaver and iterate decoding. In this paper, it is analyzed that MAP(maximum a posteriori) algorithm which is used as one of Turbo Code decoding, and the factor which determines its performance. MAP algorithm proceeds iterate decoding by determining soft decision value through the environment and transition probability between all adjacent bits and received symbols. Therefore, to improve the performance of MAP algorithm, the trust between adjacent received symbols must be ensured. However, MAP algorithm itself, can not do any action for ensuring so the conclusion is that it is needed more algorithm, so to decrease iterate decoding. Consequently, MAP algorithm and Turbo Code performance are analyzed in the nongaussian channel applying Robust equalization technique in order to input more trusted information into MAP algorithm for the received symbols.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.22 no.6
• /
• pp.14-22
• /
• 2014

An autonomous vehicle requires a technology of generating maps by recognizing surrounding environment. The recognition of the vehicle's environment can be achieved by using distance information from a 2D laser scanner and color information from a camera. Such sensor information is used to generate 2D or 3D maps. A 2D map is used mostly for generating routs, because it contains information only about a section. In contrast, a 3D map involves height values also, and therefore can be used not only for generating routs but also for finding out vehicle accessible space. Nevertheless, an autonomous vehicle using 3D maps has difficulty in recognizing environment in real time. Accordingly, this paper proposes the technology for generating 2D maps that guarantee real-time recognition. The proposed technology uses only the color information obtained by removing height values from 3D maps generated based on the fusion of 2D laser scanner and camera data.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.625-632
• /
• 2005

Recently, real time services have been demanding a lot and the number of mobile devices is increasing extremely. Many researchers are focusing on decreasing handoff or signaling cost, produced when mobile devices are moving around. With these efforts, HMIPv6(Hierarchical Mobile Internet Protocol Version 6) was proposed. Mobile nodes do not need to register their locations to Home Agents whenever crossing over subnets within a MAP domain. In HMIPv6, mobile nodes choose the farthest MAP without considering node mobility pattern. However, a large MAP domain is not always efficient for a slow moving node and required additional work to choose a MAP in HMIPv6. Hence, this paper proposes 'Performance Analysis of HMIPv6 applying adaptive MAP Domain Site'.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.3
• /
• pp.47-54
• /
• 2013

Real estate development promotes the efficient management of the land and has immense impact on national economy. So, it is necessary to establish a comprehensive policy by accumulating related information. Real estate development map must have the information about a parcel and adjacent parcel to make it possible to analysis in spatial domain, because error will be manifested in analysis using only real estate attribute information. This can be allocate the attribute of public management information about real estate on cadastral information and spatial information for social infrastructure and buildings. Especially, it must maintain the latest information of changes in the shape and the attributes of the buildings. This study suggested a method for developing a real estate development map based on road name address map and a method to maintain the latest information through the connection with related systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.340-342
• /
• 2004

정보통신 기술의 발달로 사용자는 이동간에도 지속적인 인터넷 서비스를 받길 원한다. 이에 이동성 지원을 위한 많은 연구들이 있었다. 이동성 지원을 위한 HMIPV6환경에서 이동노드(Mobile Node)가 새로운 MAP 도메인으로 이동하거나 처음으로 MAP 도메인에 진입할 때 이동 노드는 홈 에이전트(Home Agent)와 상대 노드(Correspondent Node)에게 자신의 바인딩 정보를 갱신 하여야만 한다. 이 때 이동노드는 MAP 도메인 내에서 LCoA와 RCoA를 MAP에게 바인딩을 하고 자신의 HoA(Home Address)를 이용하여 홈 에이전트와 상대노드에게 바인딩 갱신 메시지를 보내어 바인딩 정보를 갱신한다. 본 논문은 이동 노드가 지역 바인딩 갱신(LBU)메시지와 함께 보내는 바인딩 갱신 메시지를 이용하여 MAP가 이동노드 대신 바인딩 갱신 메시지를 보냄으로써 시그널링을 줄이는 방안을 제시하고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.426-432
• /
• 2007

The MAP algorithm is designed and implemented through the sliding window method for turbo decoding. First, the implementation issues, which are the length of the sliding window and the normalization method of state metrics are reviewed, and their optimal values are obtained by the simulation. All component schemes of the decoder including the branch metric evaluator are also presented. The proposed MAP architecture can be easily redesigned according to the size of sliding window, that is, sub-frame length because of its simplicity on buffer control.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1612-1616
• /
• 2006

For map services in the mobile environment, it should be considered that resource restriction or the mobile device. on, if a map database dedicated to mobile services may not be developed, the spatial data extracted from general map databases should be simplified before transmitting. % is paper suggests the filtering methods to manipulate the spatial data, which are changed to be able to displayed on the mobile devices. The suggested methods are evaluated by experiments. This method is based on the map generalization operator 'selection' and is refined to adapt on mobile phone environments.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.433-436
• /
• 2008

A demand on the spatial data management has been rapidly increased with the introduction and diffusion process of ITS, Telematics, and Wireless Sensor Network, and many different people use the digital map that offers various thematic spatial data. Spatial data for digital map can manage to tile-based and feature-based data. The existing tile-based digital map management systems have difficult problems of data construction, history management, and updating based on a spatial object. In order to solve these problems, this paper proposed the data model for the feature-based digital map management system that is designed for feature-based seamless map, history management, real-time updating of spatial data, and analyzed the validity and utility of the proposed model.