• Journal of Digital Contents Society
• /
• v.15 no.4
• /
• pp.527-532
• /
• 2014

Recently, due to the proliferation of mobile smart devices, the inovation of bigdata, which analyzes and processes massive data collected from various sensors implaned in smart devices, expands to LBSs. Many location prediction techniques for moving objects have been studied in literature. However, as the majority of studies perform location prediction which depends on specific applications, they hardly reflect the technical requirements of next-generation spatio-temporal information services. Therefore, this paper proposes the design of general-purpose distributed moving object prediction query processing framework that is capable of performing primitive and various types of queries effectively based on massive spatio-temporal data of moving objects in real-world space networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2188-2194
• /
• 2011

With the development of wireless network technology, Storing the location information of a spatiotemporal object was very necessary. Each spatiotemporal object has many unnecessariness location information, hence it is inefficient to search all trajectory information of spatiotemporal objects. In this paper, we propose an efficient method which increase searching efficiency. Using EMBR(Extend Minimun Bounding Rectangle), an LinearMarge split algorithm that minimizes the volume of MBRs is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy.

• 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.

• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.3
• /
• pp.13-21
• /
• 2011

In mobile environment supporting mobility technologies, user requirements have been increased with respect to utilization of location information. In particular, moving object DBMS has consistently posed in order to efficiently maintain traffic information related to location of vehicle which tents to tremendously change over time. Despite the fact that these sorts of researches must be taken into consideration, empirical studies on moving object in terms of map database for lbs service, spatial attribute of which is continuously changed over time, have rarely performed. Therefore, aim of this paper is to suggest efficient spatial index scheme, which is capable of supporting query processing algorithm and location of moving object over time, by developing new empirical model. As a result, we can come to the conclusion that moving object model based on multi-fixed grid index makes it possible to cut down on the number of entity for retrieving. What's more, this model enables hierarchical data to be accessed through efficient spatial filtering on large-scale lbs data and constraints in accordance with level in order to display map.

• Journal of Biomedical Engineering Research
• /
• v.23 no.5
• /
• pp.375-383
• /
• 2002

Aneurysm embolisation method using coils have been widely used. Micro coils are introduced via a small catheter, and are packed inside of aneurysm sac, which induces intraaneurysmal flow stagnation and thrombus formation. When partial blocking of an aneurysm is inevitable, the location of coils is important since it changes the flow patterns inside the aneurysm, which affect the embolisation process. We measured the flow field inside the partially blocked lateral aneurysm models in vitro, and tried to suggest the effective locations of coils for aneurysm embolisation. Velocity fields are measured using a particle image velocitimeter for different coil locations- proximal neck, distal neck, proximal dome and distal dome. Flow into the aneurysm sac was significantly reduced in the distally blocked models, and coils at distal neck blocked inflow more effectively comparing to those at distal dome. This study suggests that distal neck should be the most effective location for aneurysm embolisation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.9-17
• /
• 2008

This paper proposes a method of color reproduction considering the viewing conditions of a PDP TV. Because of a change of peripheral environments by a temporal and spatial location of observers, the ambient lightings should be considered in the process of color reproduction of displays. A conventional method enhances the contrast and saturation of images by controlling voltage gains in each channel, so that there is a limit to implementing the phenomenon of human adaptation. This method also faces difficulties in reproducing the perceived colors under a variety of viewing conditions. Accordingly, in order to solve this problem, we first characterize the device by considering the brightness and the flare effect. The chromatic adaptation is finally applied to reproduce colors in a PDP TV using the information from the viewing conditions by the sensor. The images reproduced by the proposed method are visually more superior to those reproduced by a conventional method in the experiments.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.23-28
• /
• 2006

In this paper, a power-aware query processing using optimized distributed R-tree in a sensor network is proposed. The proposed technique is a new approach for processing range queries that uses spatial indexing. Range queries are most often encountered under sensor networks for computing aggregation values. The previous work just addressed the importance but didn't provide any efficient technique for processing range queries. A query processing scheme is thus designed for efficiently processing them. Each node in the sensor network has the MBR of the region where its children nodes and the node itself are located. The range query is evaluated over the region which intersects the geographic location of sensors. It ensures the maximum power savings by avoiding the communication of nodes not participating over the evaluation of the query.

• Korean journal of applied entomology
• /
• v.49 no.2
• /
• pp.145-149
• /
• 2010

Differences in the number of Platypus koryoensis (Murayama) (Coleoptera: Platypodidae) trapped in different trap types, colors and positions on the trunk were evaluated to develop a monitoring trap for Platypus koryoensis, a known vector of Korean oak wilt disease. The experiments were conducted in an oak forest located in Gwangtan-myeon, Paju-si, Gyeonggi-do, Korea using two types of trap: sticky trap and multi-funnel trap. Trapping efficiency of the two trap types was not significantly different. Trapping efficiency of the sticky trap was not affected by four trap colors: yellow, black, white and transparent. The number of beetle caught was higher in the traps facing the upper slope than the lower slope regardress of trap type. Our results showed that both traps type are useful for monitoring Platypus koryoensis.

• Journal of KIISE:Databases
• /
• v.33 no.4
• /
• pp.396-408
• /
• 2006

Moving object databases manage a large amount of past location data which are accumulated as the time goes. To retrieve fast the past location of moving objects, we need index structures which consider features of moving objects. The KDB-tree has a good performance in processing range queries. Although we use the KDB-tree as an index structure for moving object databases, there has an over-split problem in the spatial domain since the feature of moving object databases is to increase the time domain. Because the over-split problem reduces spatial regions in the MBR of nodes inverse proportion to the number of splits, there has a problem that the cost for processing spatial-temporal range queries is increased. In this paper, we propose the dynamic split strategy of the KDB-tree to process efficiently the spatial-temporal range queries. The dynamic split strategy uses the space priority splitting method for choosing the split domain, the recent time splitting policy for splitting a point page to maximize the space utilization, and the last division policy for splitting a region page. We compare the performance of proposed dynamic split strategy with the 3DR-tree, the MV3R-tree, and the KDB-tree. In our performance study for range queries, the number of node access in the MKDB-tree is average 30% less than compared index structures.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.1847-1850
• /
• 2002

최근에 이동통신기술의 발전과 무선인터넷 사용자의 급증 및 휴대 단말기 장치의 성능 향상으로 인하여 사용자의 위치 정보를 활용하여 부가 정보 서비스를 받을 수 있는 위치기반서비스(LBS Location Based Service)에 대한 관심이 급증하고 있다. 위치기반 서비스를 제공하기 위해서는 사용자의 위치정보를 관리하는 이동체 데이터베이스가 필수적으로 요구된다. 친구 찾기 서비스와 같은 초기 단계의 LBS 서비스에서는 현재위치만을 가지고 서비스할 수 있지만, 데이터 마이닝이나 CRM등과 같이 연동된 고급 서비스를 제공하기 위해서는 시시각각 변화는 사용자의 현재 위치정보뿐 아니라 과거위치정보를 관리할 수 있어야 한다. 본 논문에서는 이동체 데이터 베이스의 구성요소 중 대용량의 위치정보를 저장 및 검색하기 위한 분산 관리 시스템을 설계하고자 한다. 분산 관리 시스템은 현재위치 관리 컴포넌트와 과거위치 관리 컴포넌트, 분산위치관리 컴포넌트로 구성된다. 현재 위치 관리 컴포넌트와 과거위치 관리 컴포넌트는 공간색인을 제공하므로 데이터 검색의 성능을 향상시키고, 분산위치 관리 컴포넌트는 대용량의 데이터를 다양한 데이터베이스에 분산 저장 및 검색하므로 과부하를 조절하고 대용량의 위치정보를 효율적으로 관리하고자 한다.