• Journal of Korea Game Society
• /
• v.13 no.6
• /
• pp.43-52
• /
• 2013

Path finder is one of the very important algorithm of artificial intelligence and is a process generally used in many game fields. Path finder requires many calculation, so it exerts enormous influences on performances. To solve this, many researches on the ways to reduce the amount of calculate operations have been made, and the typical example is A* algorithm but it has unnecessary computing process, reducing efficiency. In this paper, to reduce the amount of calculate operations such as node search with costly arithmetic operations, we proposes the weight based pre-processing A* algorithm. The simulation was materialized to measure the efficiency of the weight based pre-process A* algorithm, and the results of the experiments showed that the weight based method was approximately 1~2 times more efficient than the general methods.

• Journal of Korean Society of Transportation
• /
• v.20 no.1
• /
• pp.65-76
• /
• 2002

This study is realized using fuzzy evaluation and AHP(the analytic hierarchy process) for the optimum search of traffic route and estimated by the quantitative analysis in the vague subjective judgement. It is different from classical route search and noticed thinking method of human. Appraisal element, weight, appraisal value of route is extracted from basic of the opinion gathering fur the driving expert and example of route model was used for the finding of practice utility. Model assessment was performed attribute membership function making of estimate element, estimate value setting, weight define by the AHP, non additive presentation of weight according to $\lambda$-fuzzy measure, Choquet fuzzy integral.

• Spatial Information Research
• /
• v.20 no.3
• /
• pp.67-81
• /
• 2012

Due to the recent advancement of cloud computing, the research on database outsourcing has been actively done. Moreover, the number of users who utilize Location-based Services(LBS) has been increasing with the development in w ireless communication technology and mobile devices. Therefore, LBS providers attempt to outsource their spatial database to service provider, in order to reduce costs for data storage and management. However, because unauthorized access to sensitive data is possible in spatial database outsourcing, it is necessary to study on the preservation of a user's privacy. Thus, we, in this paper, propose a spatial data encryption scheme to produce outsourced database from an original database. We also propose a k-Nearest Neighbor(k-NN) query processing algorithm that efficiently performs k-NN by using the outsourced database. Finally, we show from performance analysis that our algorithm outperforms the existing one.

• Journal of Korean Society for Geospatial Information Science
• /
• v.10 no.1 s.19
• /
• pp.59-66
• /
• 2002

The rapid change of industrial structure causes to increase distribution cost and requires necessity of physical distribution system urgently. Traffic situation is getting extremely worse and traffic jam has led to increasing expense of physical distribution delivery which dominates 20% of distribution cost. In this situation, the shortest and most suitable path search system is required by modern people who must waste a lot of time for moving with a car or on the street as well as many companies. for these reasons, we developed the shortest-path-searching system applying the dijkstra algorithm which is one of the effective shortest path algorithm to GIS, and it was constructed by considering realistic urban traffic and the pattern of street in a physical situation. Also, this system was developed to be updated weight data automatically, considering the dynamic change of traffic situation such as a traffic information service which will be served in real time. Finally, we designed this system to serve on web by using MapObjects IMS.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.2
• /
• pp.1-12
• /
• 2017

The Seoul metropolitan transportation card's high value lies in its recording of total population movements of the public transit system. In case of recorded information on transit by bus, even though route information utilized by each passenger is accurate, the lack of passenger transfer information of the urban railway makes it difficult to estimate correct routes taken by each passenger. Therefore, pinpointing passenger path selection patterns arising in the metropolitan railway network and using this as part of a path movement estimation model is essential. This research seeks to determine that features of passenger movement routes in the urban railway system is comprised of M-similar routes with increasing number of transfer reflected as additional costs. In order to construct the path finding conditions, an M-similar route searching method is proposed, embedded with non additive path cost which appears through inclusion of the stepwise transportation parameter. As well, sensitivity of the M-similar route method based on transportation card records is evaluated and a stochastic trip assignment model using M-similar path finding is constructed. From these, link trip and transfer trip results between lines of the Seoul metropolitan railway are presented.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.5
• /
• pp.521-528
• /
• 2002

Intranet is that intra-information system builds using web-technology of company. In this study, Intranet building plan of Rent-a-car proposed. Because of Intranet will construct low-cost, Small-Medium company Information have profit. Intranet Building Methods suggests that Work-flow investigate and apply-field search later on. Decision supporting and Marketing have effectiveness.

• Journal of KIISE:Software and Applications
• /
• v.26 no.3
• /
• pp.343-352
• /
• 1999

본 논문에서는 대용량 데이터베이스에서 효율적인 연관 규칙 탐사에 대한 알고리즘을 제안하였다. 제안하는 알고리즘은 복합 해쉬 트리를 사용하여 해쉬 트리 탐색 비용과 데이터베이스 스캔 비용을 동시에 줄임으로서 성능을 향상시켰다. 복합 해쉬 트리는 같은 크기의 항목집합들 대신에 크기가 다른 여러 항목집합을 하나의 해쉬 트리로 구성한다. 복합 해쉬 트리의 유용성을 보이기 위하여 제안한 알고리즘은 잘 알려져 있는 Apriori, DHP 방밥과 수행 시간 측면에서 성능 비교를 하였다. 그 결과 대부분의 최소 지지도에서제안한 알고리즘이 Apriori, DHP 방법보다 우수하게 나타났으며, 최소 지지도가 0.5% 이하인 경우 DHP 방법에 비하여 약 30%의 이득 향상이 있었다.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.2
• /
• pp.185-192
• /
• 2004

Intranet is that intra-information system builds using web-technology of company In this study, Intranet building plan of Cosmetic-company proposed. Because of Intranet will construct low-cost, Small-Medium company Information have profit. Intranet Building Methods suggests that Work-flow investigate and apply-field search later on. Decision supporting and Marketing have effectiveness.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2009.05a
• /
• pp.39-42
• /
• 2009

4 세대 모바일폰은 카메라, MP3, 블루투스, DMB, 전자수첩, PC, 웹브라우징의 복합 기능을 가진 제품으로 진화하고 있으며, 이를 위한 사용자의 요구와 경험디자인의 요소를 탐색하고 분석하는 것이 요구된다. 하지만 기존의 사용자 요구의 조사와 경험디자인은 많은 비용과 시간을 투입하고도 기존 요구의 재확인에 머물거나, 제한적이고 예측 가능한 결과만을 도출하는 문제점을 가지고 있어 창의적 디자인 아이디어 도출에는 한계를 가지고 있다. 이는 사용자의 선정과 분석의 방법이 마케팅 중심의 통계적 방법에 기초하고 있으며, 사용자의 선정에 분석의 결과가 좌우되기 때문이다. 본 연구는 창의적 경험디자인의 방법으로서 1% 이미지 추출의 작업과 국내외 커뮤니티 사이트를 중심으로 한 디지털 포켓리서치의 방법을 활용하였나 2차 사용자 조사는 '1% UX 리서치'로 명명한 극단적 사용자 분석의 방법을 개발하고 적용하였으며, 주요 디자인 요구와 암시점은 K-J 매트릭스를 통하여 체계화하였다. 디지털포켓리서치와 1% 사용자의 리서치의 방법론은 근 미래의 사용자 예측과 풍부한 경험디자인의 아이디어를 발상할 수 있다는 측면에서 기존의 방법론 보다 비용과 시간 측면에서 효율적으로 활용할 수 있었다.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 2004.03a
• /
• pp.45-49
• /
• 2004

최적경로문제는 한 지점에서 다른 지점으로 이동할 때, 최소한의 비용으로 이동할 수 있는 경로를 찾는 문제를 의미하며, 최근 인터넷을 이용한 경로 안내 시스템에 적용되어 왔다. 이때, 보통 시간비용을 최소로 하는 경로를 제공하는 것이 일반적이다. 그러나 현실적으로 우리는 타인에게 어떠한 경로를 설명하거나 알려 줄 때, 인지도나 접근성이 높은 경로를 포함하는 경우가 많다. 이에 본 연구에서는 교통경로를 산출할 때 접근성이 높은 경로를 포함하여 경로를 구성하는 방안을 제시하였다 이를 구현하기 위해 건축, 도시공간에서 접근성 분석에 사용되고 있는 Space Syntax라는 방법론을 적용하였다. GIS 데이터 구조를 이용하기 위해 알고리즘을 일부 수정하였으며, 일반적으로 최단거리 산출에 많이 사용되고 있는 Dijkstra 알고리즘과 결합하여 구축하였다. 이렇게 구축된 알고리즘을 소규모의 교통 네트웍상에 적용하여 테스트하였다.