• The Korean Journal of Applied Statistics
• /
• v.19 no.3
• /
• pp.599-617
• /
• 2006

Recently many LBS(Location Based Service) systems are issued in mobile computing systems. Spatial-Temporal Moving Sequence Pattern Mining is a new mining method that mines user moving patterns from user moving path histories in a sensor network environment. The frequent pattern mining is related to the items which customers buy. But on the other hand, our mining method concerns users' moving sequence paths. In this paper, we consider the sequence of moving paths so we handle the repetition of moving paths. Also, we consider the duration that user spends on the location. We proposed new Apriori_msp based on the Apriori algorithm and evaluated its performance results.

• International Journal of Highway Engineering
• /
• v.13 no.1
• /
• pp.197-206
• /
• 2011

The Korean government concentrates on supplying public transit facilities for the mobility handicapped. In other hands, increasing needs of transfer information when the mobility handicapped use transit facilities are substantial but not satisfactory as a whole. This study focuses on evaluating the applicability of developed K-path algorithm to provide user-customized route information that could make an active using of public transit while considering the mobility handicapped preferences. Developed algorithm reflects on requirements considering transfer attributes of the mobility handicapped. Trip attributes of the handicapped are addressed distinguished from handicapped types such as transfer walking time, transfer ratio, facility preferences and etc. This study examines the verification and application of the proposed algorithm that searches the least time K-paths by testing on actual subway networks in Seoul metropolitan areas. It is shown that the K-path algorithm is good enough to provide paths that meet the needs of the mobility handicapped and to be adoptable for the future expansion.

• Journal of Advanced Navigation Technology
• /
• v.19 no.2
• /
• pp.116-122
• /
• 2015

Motivated by continuous increase in flight demand, awareness of the importance in developing ways to increase aircraft operational efficiency on the airport movement area has been raised. This paper proposes a new routing algorithm for providing the shortest path in a right time, enhancing the aircraft movement efficiency. Many researches on developing algorithms have been performed, for example, Dijkstra algorithm and $A^*$ algorithm. The Dijkstra algorithm provide optimal solution but could possibly provide it with a cost of relatively longer computation time. On the other hand, $A^*$ algorithm does not guarantee the optimality of a solution. In this paper, we suggest a Hybrid $A^*$ algorithm, incorporating both algorithms to eliminate the weaknesses. Rigorous test shows the proposed Hybrid $A^*$ algorithm may achieve shorter computing time and optimality in searching the shortest path.

• Proceedings of the Korean Society of Disaster Information Conference
• /
• 2017.11a
• /
• pp.275-277
• /
• 2017

본 논문에서는 GIS를 이용하여 국내 고병원성 조류인플루엔자(HPAI) 발생 농가를 대상으로 HPAI 감염 및 확산에 영향을 미치는 여러 인자와의 연관성을 분석한다. 인자는 크게 철새에 기인한 1차 감염과 사람에 기인한 2차 감염으로 나눈다. 전자는 철새 이동경로, 철새 도래지, 후자는 고속도로, HPAI 발생 농가 간 거리를 분석한다. 분석 시 거리는 500m(관리지역), 3km(보호지역), 10km(예찰지역)으로 설정하고, ArcGIS 프로그램을 사용하였다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.527-531
• /
• 2007

하천내에서 작은 물고기의 국지적인 회유 또는 이동 습성은 먹이를 구하고, 산란 및 성장과 집단에서 분산하고, 위험으로부터 도피하는 것에 밀접한 연관이 있다. 하천의 합류부와 연결부에 제방(levee), 도로(road) 등이 설치되는 경우 일반적으로 암거형태의 인공수로로 상 하류를 연결되는데, 암거내 수리특성상 평수시 저유량, 고유속, 저수심의 수리특성을 보인다. 이러한 수리특성은 물고기가 이동하는데 장애(barrier)가 되어 생태적으로 하천내 종다양성 감소와 일부 어종의 멸종을 초래한다. 어도 설치시 설계기준에서 가장 주목할 부분은 어도를 이용할 대상어종의 범위와 유영능력이다. 하천설계기준(2005, 한국수자원학회)에서 제시된 물고기의 유영능력은 대부분 국외 어종을 대상으로 외국에서 실험한 결과를 이용하고 있다. 그러므로 이러한 기준이 국내 어종에 대해 적합한지에 대한 검토가 필요하다. 본 실험의 목적은 국지회유성인 피라미와 각시붕어가 인공수로를 통과할 때의 유영행동 중 소상성공율과 유영속력을 평가하고자 함이다. 유영행동의 실험방법은 Brett(1967)에 의해 제안된 2가지 방법인 증진유속방법과 고정유속 방법중에서 물고기의 이동경로와 소상능력을 확인하기에 용이한 고정유속방법을 사용하였다. 또한, 효과적인 실험을 위해 실험어종(피라미 100마리, 각시붕어 100마리)이 실험 중에 최적의 건강상태를 유지할 수 있도록 물고기의 적응 기간(24시간)과 실험 중 휴식기간을 두었다. 실험결과 체형이 방추형(fujiform)인 피라미의 경우 평균유속 $0.7{\sim}0.8m/s$구간에서 소상성공율이 61%에서 26%로 급격하게 하락하는 현상이 나타났다. 그리고 측편형(compressiform)의 체형을 가진 각시붕어의 경우 평균유속 0.4m/s에서 소상성공율이 25%로 나타났으며 그 이상의 유속에서는 10%이하로 나타났다. 실험어종의 이동경로를 분석한 결과 대부분 수로바닥에 밀착하여 최저유속구간을 이용하여 이동하는 것으로 나타났으며, 이동경로의 지점유속은 평균 유속의 70%정도로 나타났다. 실제 하천에 설치된 인공수로가 생태통로의 기능을 유지하기 위해서는 평상시 수리특성이 대상어종의 유영능력을 초과하지 않도록 설계되어야 한다. 특히, 하천에 설치된 인공수로의 길이가 $5{\sim}10m$정도일 경우라면 피라미의 소상 가능성을 50% 이상 확보하기 위해서는 평수시 설계유속이 0.7m/s를 초과하지 않아야 할 것으로 판단된다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.827-829
• /
• 2016

In this paper, in order to achieve the user's convenience in golf putting during practice, to provide a method of tracking the golf ball using a high speed camera. This is recently, it is to analyze so that you can hit a golf putting part of the leisure sport to enjoy a lot of people accurately. The proposed method, the pixel when using a common USB camera is blurred, since the golf ball detection rate is low and using a high-speed camera capable of measuring up to per second 380 frames. First, by using the Hough transform after pretreatment, to detect a golf ball. Movement path by using the information subsequently detected golf ball, calculating the moving distance and angle. The proposed method result of applying, improved travel route detection rate of the golf ball is improved, the accuracy of the moving distance and angle.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.162-169
• /
• 2022

In a dynamically changing time-varying network environment, the optimal moving pattern of edge devices can be applied to distributing computing resources to edge cloud servers or deploying new edge servers in the FEC(Fog/Edge Computing) environment. In addition, this can be used to build an environment capable of efficient computation offloading to alleviate latency problems, which are disadvantages of cloud computing. This paper proposes an algorithm to extract the optimal moving pattern by analyzing the moving path of multiple edge devices requiring application services in an arbitrary spatio-temporal environment based on frequency. A comparative experiment with A^* and Dijkstra algorithms shows that the proposed algorithm uses a relatively fast execution time and less memory, and extracts a more accurate optimal path. Furthermore, it was deduced from the comparison result with the A^* algorithm that applying weights (preference, congestion, etc.) simultaneously with frequency can increase path extraction accuracy.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.1354-1356
• /
• 2012

최근 ITS(Intelligent Transportation Systems)의 개발과 함께 차량용 내비게이션의 사용이 급증하면서 경로탐색의 중요성이 더욱 가속화되고 있다. 현재 차량용 내비게이션은 멀티미디어 및 정보통신 기술의 결합과 함께 다양한 기능 및 정보를 사용자에게 제공하고 있으며 이러한 기능과 정보를 사용해서 목적지점까지의 최단경로를 탐색하는 것이 내비게이션 시스템의 핵심기능이다. 이러한 경로탐색 알고리즘은 교통시스템, 통신 네트워크, 운송 시스템은 물론 이동 로봇의 경로 설정 등 다양한 분야에 사용되고 있다. 개미 집단 최적화(Ant Colony Optimization, ACO) 알고리즘은 메타 휴리스틱 탐색 방법으로 그리디 탐색(Greedy Search)뿐만 아니라 긍정적 반응의 탐색을 사용한 모집단에 근거한 접근법으로 순환 판매원 문제(Traveling Salesman Problem, TSP)를 풀기 위해 처음으로 제안되었다. 본 논문에서는 개미 집단 최적화(ACO) 알고리즘이 기존의 경로 탐색 알고리즘으로 알려진 Dijkstra 보다 최단경로 탐색에 있어서 더 적합한 알고리즘이라는 것을 설명하고자 한다.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.6
• /
• pp.1191-1201
• /
• 2010

In this paper, we analyze the impact on quitting one's first job based on "Graduates Occupational Mobility Survey" data given by Korea Employment Information Service. According to the survey, there are a large number of questionnaires on quitting one's first job and so it is not easy to choose among them. We will investigate model selection criteria and apply the procedure proposed by Shtatland et al. (2003) to identify the final model.

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.71-82
• /
• 2003

The shortest path problems(SPP) are critical issues in the military logistics such as the simulation of the War-Game. However, the existing SPP has two major drawbacks, one is its accuracy of solution and the other is for only one solution with focused on just link cost in the military transportation planning models. In addition, very few previous studies have been examined for the multi-shortest path problems without considering link capacity reflecting the military characteristics. In order to overcome these drawbacks, it is necessary to apply the multi-shortest paths algorithm reflecting un-expected military incidents. This study examines the multi-shortest paths in the real networks using Shier algorithm. The network contains both military link capacity and time-based cost. Also, the modes are defined as a platoon(group) rather than unit which is used in most of previous studies in the military logistics. To verify the algorithm applied in this study. the comparative analysis was performed with various sizes and routes of network which compares with Dijkstra algorithm. The major findings of this study are as follows ; 1) Regarding the unique characteristics of the military transportation plan, Shier algorithm, which is applied to this study, is more realistic than Dijkstra algorithm. Also, the time based concept is more applicable than the distance based model in the military logistics. 2) Based on the results from the various simulations of this study the capacity-constraint sections appeared in each scenarios. As a consequence, the alternatives are necessary such as measures for vulnerable area, improvement of vehicle(mode), and reflection of separated-marching column in the military manuals. Finally. the limits and future research directions are discussed : 1) It is very hard to compare the results found in this study. which is used in the real network and the previous studies which is used in arbitrary network. 2) In order to reflect the real military situations such as heavy tanks and heavy equipment vehicles. the other constraints such as the safety load of bridges and/or the height of tunnels should be considered for the future studies.