• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.25-27
• /
• 2001

컴퓨터와 통신 기술의 급소간 발전으로 이동 매체를 통한 정보 서비스 요구가 급증하고 있다. 이 중에서 이동 매체를 통한 전자 지도 서비스는 전송 정보의 용량이 크고 출력 장치의 resource를 많이 요구하기 때문에 이를 극복하기 위한 연구가 필요하다. 이 논문에서는 무선 지도 서비스 환경의 bandwidth 제약 조건과 resource 제약 조건을 새로이 정의하고 이를 해결하는 동적 약도 생성 기법을 소개한다. 본 논문은 resource 제약 조건을 해결하기 위해 지도 정확성의 기준을 완화하여 재 정의한 generalization 기법을 도입하며, bandwidth 제약 조건을 해결하기 위해 설정된 threshold 값을 만족하는 filtering 기법을 제안 및 설계 구현한다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.4 no.2
• /
• pp.55-70
• /
• 1994

본 논문은 데이타베이스의 동적 기능을 모형화하기 위해서 동적 규칙을 사건과 동적 규칙 객체로 취급하여 개념적 스키마에 표현하는 동적 객체지향 데이타 모델을 제안한다. 제안된 모델에서 정적 구조와 동적 구조에 대한 개념들을 정의하고 모형화 과정에서 사용자의 이해도를 증진시키는 모델의 구성요호에 대한 그래픽 다이어그램을 제시하였다. 그리고 동적 규칙이 데이타베이스 구조에 포함됨으로써 발생가능한 정보의 불법적인 노출 또는 변경을 방지하기 위해서 BLP모델의 보안 정책을 확장하여 제안된 모델에 대한 11가지 종류의 다단계 보안 성질들을 정의하였다. 또한, 정의된 다단계 보안 성질들이 타당한가를 조사하기 위해서 패트리네트를 확장하여, 보안 성질의 검증작업을 수행하였다.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.2
• /
• pp.35-48
• /
• 2008

In this paper, we propose a Dynamic Heuristic to reduce the number of node accesses and improve quality of path in the client-based navigation service. The Dynamic Heuristic is to use heuristic data from server that is calculated with traffic data. The server-based navigation service provides a path searched on server and transmits it to client, but we propose that server only provide heuristic data to client. The proposed client searches a path with heuristic transmitted data from server. We present a new algorithm for using Dynamic Heuristic in the path-finding. The algorithm bases Grid Based Path-Finding, and has minimum speed data of edges in grid. It removes several grids whose minimum speed is less than limited speed.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.627-630
• /
• 2004

본 논문에서는 기존 데이터베이스를 무선 데이터베이스에 사용하도록 무선 지도를 간략화하는 동적 생성 매커니즘에 대해 기술하였다. 이 매커니즘은 generalization, filtering 그리고 사용자 인터페이스 부분으로 구성된다. 이렇게 개발된 기술은 무선 지도 서비스의 기능을 향상시킬수 있는데, 전송 지도 데이터를 이미지 방식으로 전송하는 래스터 데이터(raster data) 지도 방식을 이용하였다. 이러한 기술을 통해 무선 지도 데이터의 전송 속도 향상이 가능하고 동적 전자 약도 생성도 가능하다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1615-1622
• /
• 2009

Generally, the Terminal Based Navigation System(TBNS) used embedded road data searches a path that has less qualitative than The Center Based Navigation System(CBNS). TBNS has not used real time road data but it is recently able to use it with technique such as TPEG. However, it causes to increase a cost of exploring by using real time road data for improvement quality of a path, because of limited performance. In this paper, we propose a Dynamic Heuristic to improve quality of path in the TBNS. Dynamic Heuristic(DH) is not fixed data and is dynamically modified using transferred real time road data from server. In this paper, we propose path-lading algorithm with Maximum Speed Dynamic Heuristic (DH-MAX) and do an experiment. The DH-MAX is to be used the highest speed as DH, in real map divided by same size. And proposed algorithm searches path using the priority searching only of the fixed data, but also the highest speed with real time information. In the performance test, the quality of path is enhanced but the cost of searching is increased than A* algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.5
• /
• pp.988-995
• /
• 2009

One of the most popular services of Telematics is a shortest path finding from a starting point to a destination. In this paper, a dynamic shortest path finding system with forecasting result of traffic flow in the future was developed and various experiments to verify the performance of our system using real-time traffic information has been conducted. Traffic forecasting has been done by a prediction system using Bayesian network. It searched a dynamic shortest path, a static shortest path and an accumulated shortest path for the same starting point and destination and calculated their travel time to compare with one of its real shortest path. From the experiment, over 75%, the travel time of dynamic shortest paths is the closest to one of their real shortest paths than one of static shortest paths and accumulated shortest paths. Therefore, it is proved that finding a dynamic shortest path by applying traffic flows in the future for intermediated intersections can give more accurate traffic information and improve the quality of services of Telematics than finding a static shortest path applying by traffic flows of the starting time for intermediated intersections.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.661-663
• /
• 2003

주변에 존재하는 임의의 다양한 소형기기 기반 서비스(예, 각 지역의 유틸리티 장비 서비스)들을 동적으로 발견하고, 이들간 상호 서비스 호출이 동적인 분산컴퓨팅 환경을 퍼베이시브 컴퓨팅 환경이라 한다. 지니는 이러한 퍼베이시브 컴퓨팅 환경의 효과적 구축을 위한 미들웨어이다. 그러나 지니 미들웨어의 높은 H/W 및 S/W 요구사항 때문에 많은 소형기기에서는 지원이 되지 않아, 퍼베이시브 컴퓨팅 환경에서 광범위한 활용이 되지 않고 있다. 본 논문에서는 제한된 H/W 용량과 S/W 기능을 갖고 있는 소형기기 상에서 범용적 지니 지원방법 (지니 Surrogate 아키텍쳐)를 논의하고, 대표적 인터넷 소형기기인 핸드폰 상에서 지니 서비스 구현 방법을 제안한다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.6
• /
• pp.208-218
• /
• 2017

This study aims to develop the Vehicle Local Dynamic Map (V-LDM) and demonstrate its performance for providing dynamic map data efficiently to the vehicle control module. Firstly, the concept of the in-vehicle LDM has been established and then the system has been carefully designed according to the international standards. The high-precision digital map embedded in LDM has been designed to incorporate the lane-level information of road network, and the Dynamic Map protocol (DM protocol) which is a message protocol including the road data with dynamic traffic event data has been defined. The performance test of the proposed system has been conducted in the uninterrupted road section of Kyungbu expressway, showing that both of the data size and the elapsed time to finish the process are almost linearly proportional to the length of target road. Finally, it is recommended that the length of target road for DM protocol be less than 250m.

• Journal of KIISE:Software and Applications
• /
• v.28 no.12
• /
• pp.875-884
• /
• 2001

Although the self organizing map (SOM) is widely utilized in such fields of data visualization and topology preserving mapping, since it should have the topology fixed before trained, it has some shortcomings that it is difficult to apply it to practical problems, and classification capability is quite low despite better clustering performance. To overcome these points this paper proposes the dynamic topology preserving self-organizing map(DTSOM) that dynamically splits the output nodes on the map and trains them, and attempts to improve the classification capability by combining multiple DTSOMs K-Winner method has been applied to combine DTSOMs which produces K outputs with winner node selection method. This produces even better performance than the conventional combining methods such as majority voting weighting, BKS Bayesian, Borda, Condorect and reliability sum. DTSOM remedies the shortcoming of determining the topology in advance, and the classification rate increases significantly by combing multiple maps trained with different features. Experimental results with handwritten digit recognition indicate that the proposed method works out to problems of conventional SOM effectively so to improve the classification rate to 98.1%.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.151-158
• /
• 2005

In order to use the existing map data base in the mobile phone, the dynamic creation technique of the radio map which will be able to be converted into the raster image and transmitted was proposed. We transferred the client module functions such as the coordinate conversion, data compression and decoding to server, and made driving of JAVA browser in the mobile phone which has the restricted resources possible for the dynamic creation of the radio map. We made the radio electronic map service possible without map data base for the mobile phone use only by performing the general work of the map at the sever. And we guaranteed the client waiting time less then the limit time by performing the filtering work of the map at the server also. After we input the keyword at the user interface for searching the region or facility, and verified the performance of the proposed technique by confirming that the raster electronic map usable at the mobile phone was created dynamically.