• ETRI Journal
• /
• v.29 no.5
• /
• pp.691-693
• /
• 2007

Existing methods to process continuous range queries are not scalable. In particular, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We propose a novel query indexing method called the projected attribute bit (PAB)-based query index. We project a two-dimensional continuous range query on each axis to get two one-dimensional bit lists. Since the queries are transformed to bit lists and query evaluation is performed by bit operations, the storage cost of indexing and query evaluation time are reduced significantly. Through various experiments, we show that our method outperforms the containment-encoded squares-based indexing method, which is one of the most recently proposed methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.458-459
• /
• 2021

Recently, researches using deep learning technology based on Wi-Fi fingerprints have been conducted for accurate services in indoor location-based services. Among the deep learning models, an RNN model that can store information from the past can store continuous movements in indoor positioning, thereby reducing positioning errors. At this time, continuous sequential data is required as training data. However, since Wi-Fi fingerprint data is generally managed only with signals for a specific location, it is inappropriate to use it as training data for an RNN model. This paper proposes a path generation method through prediction of a moving path based on Wi-Fi fingerprint data extended to region data through clustering to generate sequential input data of the RNN model.

• Journal of Korea Game Society
• /
• v.13 no.3
• /
• pp.47-54
• /
• 2013

In general, algorithms to find continuous k-nearest neighbors has been researched on the location based services monitoring periodically the moving objects such as vehicles and mobile phone. Those researches assume the environment that the number of query points is much less than that of moving objects and the query points are not moved but fixed. In gaming environments, cases to find k-nearest neighbors are when computing the next movement considering the neighbors such as flocking, crowd and robot simulations. Thus, every moving object becomes a query point so that the number of query point is same to that of moving objects and the query points are also moving. In this paper, we analyze the performance of the existing algorithms focused on location based services how they operate under the gaming environments.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.1
• /
• pp.451-458
• /
• 2011

In order to provide the optimal location based services such as the optimal moving path search or the scheduling pattern prediction, the extraction of significant moving pattern which is considered the temporal and spatial properties of the location-based historical data of the moving objects is essential. In this paper, for the extraction of significant moving pattern we propose the location generalization method which translates the location attributes of moving object into the spatial scope information based on $R^*$-tree for more efficient patterning the continuous changes of the location of moving objects and for indexing to the 2-dimensional spatial scope. The proposed method generates the moving sequences which is satisfied the constraints of the time interval between the spatial scopes using the generalized spatial data, and extracts the significant moving patterns using them. And it can be an efficient method for the temporal pattern mining or the analysis of moving transition of the moving objects to provide the optimal location based services.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.05a
• /
• pp.456-457
• /
• 2021

Recently, in order to more accurately provide indoor location-based services, technologies using Wi-Fi fingerprints and deep learning are being studied. Among the deep learning models, an RNN model that can store information from the past can store continuous movements in indoor positioning, thereby reducing positioning errors. When using an RNN model for indoor positioning, the collected training data must be continuous sequential data. However, the Wi-Fi fingerprint data collected to determine specific location information cannot be used as training data for an RNN model because only RSSI for a specific location is recorded. This paper proposes a region clustering technique for sequential input data generation of RNN models based on Wi-Fi fingerprint data.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.260-263
• /
• 2019

Recently, the need of researches and developments about WSN(Wireless Sensor Network) technologies, which can be applied to services to regions where the access is difficult or services that require continuous monitoring, has gradually increased due to its expansion and efficiency of the application areas. In this paper, we analyze existing researches which focused on reducing packet loss rate and increasing lifetime of sensor nodes. Then, we conduct studies about performance improvement factors where some schemes - clustering and location-based approaches - are applied and compare our study results with existing researches. Based on our studies, we are planning to conduct researches about a new scheme that could contribute to improve WSN's performance in terms of packet loss rate and network lifetime.

• Journal of Information Technology Services
• /
• v.21 no.6
• /
• pp.91-116
• /
• 2022

This research shows how the perception of digital shadow work varies depending on the user's period of use of digital services in applications, which are key areas of digital services. The purpose of this research is to investigate how the digital shadow work type changes over time. This research adopted a qualitative research method for location-based service "help application" users and examined the change in perception from the app service acceptance stage to the app service continuous use stage with two-times interviews of ten users by a longitudinal research design. This study conducted a longitudinal analysis focusing on how digital shadow work occurs in the application subscription process, exploring phenomenologically how the type changes throughout the process over time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.4
• /
• pp.752-758
• /
• 2012

SNS(Social Networking Services) is oneline service that enable users to construct human network through their relation on web, such as following relation, friend relation, and etc. Recently, owing to the advent of digital devices (smart phone, tablet PC) which embedded GPS some applications which provide services with spatial relevance and social relevance have been released. Such an online service is called LBSNS. It is required to use spatial filtering so as to build the LBSNS system that enable users to subscribe information of interesting area. For spatial filtering, user and tweet attaches location information which divide into static property presenting fixed area and dynamic property presenting user's area changed along the moving user. In the case of using a location information including dynamic property, Continuous query occurred from the moving user causes the problem in server. In this paper, we propose spatial filtering algorithm using Virtual Grid for reducing frequency of query, and conclude that frequency of query on using Virtual Grid is 93% decreased than frequency of query on not using Virtual Grid.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06a
• /
• pp.40-41
• /
• 2010

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06c
• /
• pp.46-48
• /
• 2006

This paper addresses the problem of monitoring continuous k-nearest neighbor (k-NN) queries. Given a set of moving (or static) objects and a set of moving (or static) query points, monitoring continuous k-NN query retrieves and updates the closest k objects to a query point continually. In order to support location based services (LBSs) in highly dynamic environments, where objects and/or queries are frequently moving, monitoring continuous queries require real-time updated results when objects and/or queries change their locations. Thus, it is important to minimize time delay for maintaining up to date the results. In this paper, we present monitoring method to shorten time delay for updating continuous k-NN queries based on the notion of result region and the minimum bounding rectangle enclosing all objects in each cell, referred to as c-MBR, in the grid index structure. Simulations are conducted to show the efficiency of the proposed method.