• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.47-56
• /
• 2005

Recently, with the rapid development of mobile computing, wireless positioning technologies, and the generalization of wireless internet, LBS (Location Based Service) which utilizes location information of moving objects is serving in many fields. In order to serve LBS efficiently, the location data server that periodically stores location data of moving objects is required. Formerly, GIS servers have been used to store location data of moving objects. However, GIS servers are not suitable to store location data of moving objects because it was designed to store static data. Therefore, in this paper, we designed and implemented an extended SLDS(Short-term Location Data Subsystem) for real-time Location Based Services. The extended SLDS is extended from the SLDS which is a subsystem of the GALIS(Gracefully Aging Location Information System) architecture that was proposed as a cluster-based distributed computing system architecture for managing location data of moving objects. The extended SLDS guarantees real-time service capabilities using the TMO(Time-triggered Message-triggered Object) programming scheme and efficiently manages large volume of location data through distributing moving object data over multiple nodes. The extended SLDS also has a little search and update overhead because of managing location data in main memory. In addition, we proved that the extended SLDS stores location data and performs load distribution more efficiently than the original SLDS through the performance evaluation.

• Journal of Advanced Navigation Technology
• /
• v.26 no.6
• /
• pp.427-433
• /
• 2022

Obstacle detection, collision recognition, and avoidance technologies are required the collision avoidance technology for UAVs. In this paper, considering collinear multiple static obstacle, we propose an obstacle detection algorithm using LiDAR and a collision recognition and avoidance algorithm based on CPA. Preprocessing is performed to remove the ground from the LiDAR measurement data before obstacle detection. And we detect and classify obstacles in the preprocessed data using the K-means clustering algorithm. Also, we estimate the absolute positions of detected obstacles using relative navigation and correct the estimated positions using a low-pass filter. For collision avoidance with the detected multiple static obstacle, we use a collision recognition and avoidance algorithm based on CPA. Information of obstacles to be avoided is updated using distance between each obstacle, and collision recognition and avoidance are performed through the updated obstacles information. Finally, through obstacle location estimation, collision recognition, and collision avoidance result analysis in the Gazebo simulation environment, we verified that collision avoidance is performed successfully.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.73-85
• /
• 2004

Recently, as the growth of the wireless Internet, PDA and HPC, the focus of research and development related with GIS(Geographic Information System) has been changed to the Real-Time Mobile GIS to service LBS. To offer LBS efficiently, there must be the Real-Time GIS platform that can deal with dynamic status of moving objects and a location index which can deal with the characteristics of location data. Location data can use the same data type(e.g., point) of GIS, but the management of location data is very different. Therefore, in this paper, we studied the Real-Time Mobile GIS using the HBR-tree to manage mass of location data efficiently. The Real-Time Mobile GIS which is developed in this paper consists of the HBR-tree and the Real-Time GIS Platform HBR-tree. we proposed in this paper, is a combined index type of the R-tree and the spatial hash Although location data are updated frequently, update operations are done within the same hash table in the HBR-tree, so it costs less than other tree-based indexes Since the HBR-tree uses the same search mechanism of the R-tree, it is possible to search location data quickly. The Real-Time GIS platform consists of a Real-Time GIS engine that is extended from a main memory database system. a middleware which can transfer spatial, aspatial data to clients and receive location data from clients, and a mobile client which operates on the mobile devices. Especially, this paper described the performance evaluation conducted with practical tests if the HBR-tree and the Real-Time GIS engine respectively.

• The KIPS Transactions:PartC
• /
• v.14C no.4
• /
• pp.359-364
• /
• 2007

Current researches on the overlay multicast mechanism in the mobile ad hoc network (MANET) maintain the network topology information of the dynamically changing MANET, which may cause severe overhead. In this paper, we propose a new overlay multicast mechanism, the region-based overlay multicast in MANET(ROME), using the geometric locations of group members. In ROME, the physical topology is divided into small regions and the scope of location updates of group members is limited to a single region. ROME provides scalability by using the coordinate of the center point of a destination region as the destination of a data packet instead of the list of member addresses of that region. Our simulation results show that ROME gives better performance in terms of the packet overhead than other schemes.

• Spatial Information Research
• /
• v.13 no.1 s.32
• /
• pp.91-101
• /
• 2005

The Mobile Mapping System using the vehicle equipped the GPS, IMU, CCD Cameras is the effective system for the management of the road facilities, update of the digital map, and etc. If the geographic information which is acquired by the Mobile mapping System can be transmitted in realtime, users can process what they want using the latest data. In this research, the effective method was suggested for the transmission of the geographic information acquired by mobile mapping System such as position data, attitude data, and image data in the wireless internet environment in realtime.

• Journal of Digital Contents Society
• /
• v.13 no.3
• /
• pp.291-299
• /
• 2012

Ubiquitous computing is a technique to provide users with appropriate services, collecting the context information in somewhere by attached sensor. An intelligent system needs to automatically update services according to the user's various circumstances. To do this, in this paper, we propose a design of context ontology, trigger rule for mining service pattern related to users activity and an active mining architecture integrating trigger system. The proposed system is a framework for active mining user activity and service pattern by considering the relation between user context and object based on trigger system.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.606-617
• /
• 2005

There have been many research efforts which find efficiently all occurrences of the structural relationships between the nodes in the XML document tree for processing a XML query. Most of them use the region numbering which is based on positions of the nodes. Hut The position-based node numbering schemes require update of many node numbers in the XML document li the XML nodes are inserted frequently in the same position. In this paper, we propose ENN(extensible node numbering) scheme using the bucket number which is represented with the variable-length string for decreasing the number of the node numbers which is updated. We also present an performance analysis by comparing ENN method with TP(extended preorder) method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.956-963
• /
• 2006

This research studies multi participant consistency and dynamic data shared through 3D scenes in virtual network environments. In a distributed virtual environment of client-server structure, consistency is maintained by the static information exchange; as jerks occur by packet delay when updating messages of dynamic data exchanges are broadcasted frequence, the network bottleneck is reduced by predicting the movement path by using the Dead-reckoning algorithm. In Dynamic data path prediction, the tests the location prediction error between Dead-reckoning convergence interval and error of prediction and actual condition one time above threshold it interpolates a previously location. The shared dynamic data of the 3D virtual environment is implementation using the VRML EAI.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.17-25
• /
• 2006

TPR*-tree is the most widely-used index structure for effectively predicting the future positions of moving objects. The TPR*-tree, however, has the problem that both of the dead space in a bounding region and the overlap among hounding legions become larger as the prediction time in the future gets farther. This makes more nodes within the TPR*-tree accessed in query processing time, which incurs the performance degradation. In this paper, we examine the performance problem quantitatively with a series of experiments. First, we show how the performance deteriorates as a prediction time gets farther, and also show how the updates of positions of moving objects alleviates this problem. Our contribution would help provide Important clues to devise strategies improving the performance of TPR*-trees further.

• Proceeding of EDISON Challenge
• /
• 2015.03a
• /
• pp.177-183
• /
• 2015

$\text\tiny{D}$-Psicose 3-Epimerase (DPE)는 $\text\tiny{D}$-Fructose의 C3 Epimerase로써 $\text\tiny{D}$-Fructose를 $\text\tiny{D}$-Psicose로 전환해 주는 효소이다. $\text\tiny{D}$-Psicose는 설탕 대신 사용하는 감미료로 몸에 흡수되지 않아 칼로리가 없다고 알려져 있고 자연에서는 오로지 DPE에 의해서만 생산되는 희귀당이다. 이에 따라 DPE를 통한 $\text\tiny{D}$-Psicose 대량생산의 필요성이 대두되고 있는 등 이 분야에 대한 관심이 뜨거운 실정이다. 본 연구팀은 이 당과 관련된 작용기작 연구를 수행하기 위하여 아직 단백질 3차구조가 알려지지 않은 Clostridium hylemonae DPE (chDPE) 단백질의 3차 구조예측 연구를 수행 하였다. 우리는 HHsearch를 이용하여 agrobacterium tumefaciens의 DPE 외 2개의 구조를 호몰로지 모델링 연구를 위한 주형으로 선정하였다. 다음으로 PROMALS3D를 이용하여 주형들과 chDPE의 multiple sequence alignment를 수행하였고 이를 바탕으로 3차구조 예측 연구를 수행 하였다. 예측된 구조를 검증하기 위하여 ProSA와 Ramachandran plot분석을 이용하였고 Ramachandran plot에서 단백질의 94.8%에 해당하는 잔기들이 favoured regions에 위치하였다. ProSA에서는 Z-score값이 -9.3으로 X-선 결정학이나 핵자기 공명법으로 밝혀진 구조들에서 관측되는 범위 내에 위치하였다. 나아가 예측된 구조에 $\text\tiny{D}$-Psicose와 $\text\tiny{D}$-Fructose의 결합모드를 규명하기 위하여 도킹을 시도하였다. 이번 연구를 통하여 chDPE의 구조를 예측 할 수 있었고 이를 바탕으로 이 단백질의 기능을 이해하는데 도움을 줄 것으로 기대된다.