• Journal of the KSME
• /
• v.35 no.5
• /
• pp.427-441
• /
• 1995

이 글에서는 MAP 변천과정과 구조 및 특성 그리고 현황 및 전망에 대하여 기술하였다. MAP 기술은 고도의 첨단 기술을 요구하는 분야가 아니고 또한 선진국에서도 시작 단계에 있는 분야 이므로 국내에서도 많은 사람들이 관심을 가지고 이 분야를 육성한다면 선진국과 대등한 관계를 가지고 경쟁을 벌일 수 있을 것이다. 이 글을 통하여 많은 사람들이 MAP 시스템을 이해하는데 조금이라도 도움이 되었기를 희망하며, 앞으로도 많은 사람들이 MAP에 관심을 기울여 주기를 바라는 바이다.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.49-54
• /
• 2003

As of date, the cadastral information which is the utility to be computerized have not been identical with local autonomous entities and relational groups each other and updated real-time, therefore the relation group or the academic circles carried out in many researches on a cadastral map matching, but the cadastral maps have not been even occurred the expansion and contraction so that the theory arrangement doesn't seem simple as to a cadastral map matching. As being take such reality into consideration, We have to be based on $\boxDr$construction ministry of the rules for continuous map$\boxUl$ for a continuous cadastral map with using PBLIS data; so the operators use Autodesk Map 5 which added applications and match the neat line by the identical scale, the different scale, the district boundary and the origin according to the judgement myself We have the purpose to minimize the problem as analyzing the accuracy between the parcel coordinates If the matched map and ones of moved map.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.187-191
• /
• 2008

In the mobile environments for the vector map services, a map simplification work through the map generalization steps helps improve the readability of the map on a large scale. The generalization operations are various such as selection, aggregation, simplification, displacement, and so on, the formal operation algorithms have not been built yet. Because the algorithms require deep special knowledge and heuristic, which make it hard to automate the processes. This thesis proposes some map generalization algorithms specialized in mobile vector map services, based on previous works. This thesis will show the detail to adapt the approaches on the mobile environment, to display complex spatial objects efficiently on the mobile devices which have restriction on the resources.

• Journal of Environmental Science International
• /
• v.13 no.6
• /
• pp.489-495
• /
• 2004

The purpose of this research is to apply GIS(Geographic Information System) for the road simulation and find some benefits analysis for the design processes. The northern Jeju island was selected as a case study. The 1/5,000 digital map and GIS technique were used for optimum road design of the island based on Arc View software. Using this software we can get an overlay map by combination of hill shade map, slope map, aspect map, and building buffer map. Based on the overlay map, we designed the optimum road line and performed three dimensional simulation. From the results, we found that the developed three dimensional road simulation technique using GIS technique that was very useful tool to estimate the reasonable road design before the real road construction works.

• 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.899-902
• /
• 2003

무선 환경에서의 실시간 서비스의 확대와 노드의 이동성 증가에 따라 handover 시 발생되는 패킷 손실과 지연으로 인한 실시간 서비스의 중단이 해결해야 할 중요한 문제점이 되고 있다. 본 논문에서는 IETF (Internet Engineering Task Force)의 중요한 마이크로 이동성 프로토콜인 HMIPv6의 기본 동작을 설명하고, 여전히 문제점으로 남아있는 Inter-MAP (Mobility Anchor Point) handover의 성능을 향상시키기 위한 Dynamic MAP Switching handover 알고리듬을 제안한다. 제안한 알고리듬은 인접한 MAP 도메인을 중첩되게 설정하고 Inter-MAP handover가 발생되기 전에 미리 MAP을 switching한다. 따라서 Inter-MAP handover가 발생하지 않도록 함으로써 handover 시 발생하는 데이터의 손실 및 지연을 감소시킬 수 있다. 제안된 알고리듬의 성능 향상은 산술적 분석을 통하여 검증한다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.135-140
• /
• 2005

This paper proposes the technique of load balancing with traffic which is concentrated to MAP on the hierarchical mobile IPv6. This technique sends the secondary MAP address using the extension option of IPv6, so the upper level MAP will manage it. Therefore, when the overload occurs, it distributes the overload to the secondary MAP address by using redirect tunneling technique, so the efficient communication becomes possible. We validate the feasibility and result of the proposed technique by using ns-2 simulator.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.533-536
• /
• 2005

MAP algorithm is known for optimal decoding algorithm of Turbo codes, but it has very large computational complexity and delay. Generally log-MAP algorithm is used in order to overcome the defect. In this paper we propose modified scheme of the state metric calculation block which can improve the computation speed in log-MAP decoder and simple linear offset unit without using LUT. The simulation results show that the operation speed of the proposed scheme is improved as compared with that of the past scheme.

• 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.

• Journal of Software Engineering Society
• /
• v.25 no.4
• /
• pp.63-67
• /
• 2012

According to the growth of data being generated in man fields, a distributed programming model MapReduce has been introduced to handle it. In this paper, we build two cluster system with Solaris and Linux environment on SUN Blade150 respectively and then to evaluate the performance of a MapReduce application running on MapReduce middleware Hadoop in terms of its average elapse time and standard deviation. As a result of this experiment, we show that the overall performance of the MapReduce application based on Hadoop is affected by the configuration of the cluster system.