• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.163-173
• /
• 2004

Recently, location-based services are becoming very Popular in mobile environments. In this paper, we propose a new association based prefetch algorithm (called by STAP) that efficiently supports information service based on the large quantity of spatial database in mobile environments. We apply the spatial-temporal relations that are meaningful for location-based queries in mobile environments. Moreover, STAP considers user's mobility and the weight of spatial data. The relation of services is a new aspect not considered in previous cache politics. So STAP is the first prefetch algorithm considering the spatial-temporal relations and thus the cache policy begins to gain a new dimension. We evaluate the performance of STAP and prove the efficiency of STAP.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.4
• /
• pp.75-80
• /
• 2009

The Beacon Mounds play a important role in defence and communication extending from the period of the Three States to the period of Chosun. About the research of beacon mounds have focused on investigation in old literature. This research analyzed geographic factors such as altitude, cross section, distance and visible distance affect in selecting location of beacon mounds. And it was presumed how each beacon mound geographic characteristics was considered in selecting location of beacon mounds. As a result, it is presumed that communicating among beacon mounds and watching the coast were affected by geographic characteristics and selecting location of beacon mounds was considered by several geographic factors.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.336-339
• /
• 2013

Location-Based services that collect location information for moving object and utilize in real life are being used in many aspects by the development of wireless network technology. Accordingly, new index structures are required to efficiently retrieve the consecutive location of moving objects. This paper addresses algorithms that make index structure by using Douglas-Peucker Algorithm and process range query efficiently on moving objects trajectories. Our algorithms are going to make smaller size of index structure and process more efficiently.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.999-1004
• /
• 2010

Most of campus vehicle management systems, so far, simply manages coming in or go out of vehicles, issuing a parking tickets. Recently some of them use RFID tags to count total numbers of cars in the campus, excluding exact parking position management. In this paper we propose a new campus vehicle management system using wireless sensor network location management scheme. This system adopts RSSI based location management method with some performance improvement technique. According to the experimental result, this proposed scheme can be used to implement an effective campus vehicle management system.

• Journal of IKEEE
• /
• v.19 no.4
• /
• pp.472-478
• /
• 2015

When user wants to receive a smart safe return service, user sends a service request using a smart device to support GPS location data. After the smart safe return system receives the location of user, it selects the neighboring CCTV cameras based on user's location information, and controls the selected CCTV cameras to take a picture of the user, and to chase the user automatically. This service can be useful when there is a crime-ridden district on the path to return home late at night. Previous systems can't provide the smart safe return service to multiple user simultaneously. In this paper, we propose the smart safe return system which can provide the service to multiple users simultaneously.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8B
• /
• pp.929-938
• /
• 2011

The setting algorithm of cloaking region using dummy which is proposed in this paper solves the problem which counts the building with duplication that exists in several cells of Privacy Grid by adding the building grouping item to the index structure of the existing Privacy Grid, and by increasing K value after searching the contiguous cells in the comer of each building, the exposure problem of private location information due to the minimum cloaking region setting of the existing GBC is solved. In addition, this paper reduces the searching time of K value by setting smaller cloaking region than Privacy Grid and GBC with dummy K before expanding cloaking region and strengthens the location information protection of users using dummy K.

• Smart Media Journal
• /
• v.5 no.3
• /
• pp.81-87
• /
• 2016

In line with the sharp increase of container traffic from globalization, ships have become larger with an aim of improving the maritime transport capacity in addition to the growing interest in monitoring danger areas on ships considering the quantity increase of ships, along with the tightening of international standard for ship safety by IMO(international Maritime Organization). Korea established a location based ship accident forecasting and preventing system in 2012 by Korea Coast Guard, however its poor response in ship accidents has been pointed out in the wake of the recent disaster of Sewol ferry. To resolve this problem, this study attempts to design a wearable type, instant emergency response system that has DGPS to issue an alert on danger areas and automatically send ship's location and operation information in emergency situation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.248-254
• /
• 2013

In location finding system using spaced multi-sensor, there is the phenomenon that the position estimation accuracy is degraded by the location of signal sources and the sensors. This phenomenon is called GDOP(Geometric Dilution Of Precision) effect. and to minimize these effects, research is needed on how. In this paper, I will describe how to minimize GDOP effect, estimating possibility of GDOP using AOA(angle of arrival) information of spaced multi sensors, and removing sensor error factor in position estimation.

• Journal of KIISE:Software and Applications
• /
• v.33 no.3
• /
• pp.356-364
• /
• 2006

'Ubiquitous Computing' is the most important paradigm of the next generation Information-Communication technology. The one of important problems to develop ubiquitous computing service system get hold of relations between times of transfer objects and events of transfer objects. Another problem is what reason transfer-pattern through location data of transfer objects. In this paper, we propose an approach to offer temporal-relation service in ubiquitous computing environment. The first is temporal reasoning in service viewpoint. The second is temporal reasoning to record user's preference. Users have preferences that are closely connected with time. These preferences are recorded at user profile. Therefore, the user profile-based ubiquitous service system can offer suitable service to users.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.12
• /
• pp.461-468
• /
• 2018

Developers spend a significant amount of time exploring and trying to understand source code to find a source location to modify. To reduce such time, existing studies have recommended the source location using statistical language model techniques. However, in these techniques, the recommendation does not occur if input data does not exactly match with learned data. In this paper, we propose a code location recommendation method using Recurrent Neural Networks and interaction histories, which does not have the above problem of the existing techniques. Our method achieved an average precision of 91% and an average recall of 71%, thereby reducing time for searching and exploring code more than the existing recommendation techniques.