• Journal of Internet Computing and Services
• /
• v.5 no.4
• /
• pp.77-94
• /
• 2004

Recently, the needs of index structure which manages moving objects efficiently have been increased because of the rapid development of location-based techniques. Existing index structures frequently need updates because moving objects change continuatively their positions. That caused entire performance loss of the index structures. In this paper, we propose a new index structure called the TPKDB-tree that is a spatio-temporal index structure based on KDB-tree. Our technique optimizes update costs and reduces a search time for moving objects and reduces unnecessary updates by expressing moving objects as linear functions. Thus, the TPKDB-tree efficiently supports the searches of future positions of moving objects by considering the changes of moving objects included in the node as time-parameter. To maximize space utilization, we propose the new update and split methods. Finally, we perform various experiments to show that our approach outperforms others.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.235-242
• /
• 2007

Network Mobility Basic Support protocol reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the mobile router (MR), but causes some problems such as sub-optimal routing and multiple encapsulations. This paper proposes an Route Optimization Employing HMIP Extension for Mobile Networks (ROHMIP) scheme for nested nubile networks support which introduces HMIP concept with relation information between MNNs behind a MR and the MR in order to localize handoff, to optimize routing and especially reduce handoff signal overhead. With ROHMIP, a mobile network node (MNN) behind a MR performs route optimization with a correspondent node (CN) as the MR sends a binding update message (BU) to mobility anchor point (MAP) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12A
• /
• pp.964-974
• /
• 2003

With increasing use of a personal mobile computer. the Mobile IPv6 is one of the main protocols that support mobility and complies with IPv6 specification. Similar to the mobile IPv6, the mobile IPv6 also has limitations on fast moving condition. The Hierarchical Mobile IPv6 is a solution that overcomes these limitations. The Hierarchical Mobile IPv6 is a micro mobility protocol that supports fast mobile IP handover and reduces signaling overhead with Mobility Anchor Point(MAP). But until now no paging method is applied to the Hierarchical Mobile IPv6 to reduce unnecessary signaling overhead and power consumption of mobile nodes. So, the paging mechanism for the Hierarchical Mobile IPv6 is proposed in this paper. the mechanism is implemented by making use of the destination option header and extension function and the last location algorithm. The results show that the Hierarchical Mobile IPv6 with the paging ability reduces the traffic of mobile networks by removing unnecessary binding update packet generated whenever handover takes place. Also, the larger the paging size is. the less the number of BU(Binding Update) massage generated.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.698-701
• /
• 2010

Recently, Vehicular Networks is being developed to provide variety of services such as email, ftp, and video streaming services. As IP mobility technology, Proxy Mobile IP is developed to provide these services for a VANET user. By adopting Proxy Mobile IPv6 (PMIPv6), Vehicular Networks can support IP mobility, but it may cause a proxy binding update (PBU) message when a vehicle moves from one MAG to another. In addition, if the density of vehicles on the road is high, significant PBU messages are generated. In this paper, we propose bulk PBU message to reduce signaling overhead by those PBU messages when a bunch of vehicles move from one MAG to another. When the vehicles move from one MAG to another, it generates only one bulk PBU message to update those vehicle's location. Through numerical and simulation results, we show that our proposed bulk registration reduces signaling overhead when the density of vehicles and the speed of them are high.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.397-401
• /
• 2007

Recent applications on continuous queries on moving objects are extended quickly to various parts. These applications need not only 2-dimensional space data but also high-dimensional space data. If we use previous index for overlapped continuous range queries on high-dimensional space data, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We focus on stationary queries, non-exponential increase of storage cost and efficient processing time for large data sets. In this paper, to solve these problems, we present a novel query indexing method, denoted as PAB(Projected Attribute Bit)-based query index. We transfer information of high-dimensional continuous range query on each axis into one-dimensional bit lists by projecting technique. Also proposed query index supports incremental update for efficient query processing. Through various experiments, we show that our method outperforms the CES(containment-encoded squares)-based indexing method which is one of the most recent research.

• Journal of Korean Library and Information Science Society
• /
• v.49 no.4
• /
• pp.93-117
• /
• 2018

KORMARC format for holdings data is a standard for expressing and exchanging holdings information-who they have, what copies are owned, where they are held, etc. As the need of resource sharing grows, such holdings information that informs the user to the availability and the location of a bibliographic item is becoming increasingly important. However the KORMARC format for holdings data has been used much less than KORMARC for bibliographic and authority data, and has attracted little attention from Korean libraries. Under these circumstances, this study intends (1) to analyze various standards for holdings information including MARC21 format for Holdings data (update No.26) and its applications, (2) to investigate the types of holdings data and description regulations used in Korean libraries and bibliographic utilities, and (3) to suggest the revision of existing KORMARC format for holdings data.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.39 no.6
• /
• pp.599-607
• /
• 2021

Street-view images, which are omnidirectional scenes centered on a specific location on the road, can provide various obstacle information for the pedestrians. Pedestrian network data for the navigation services should reflect the up-to-date obstacle information to ensure the mobility of pedestrians, including people with disabilities. In this study, the object detection model was trained for the bollard as a major obstacle in Seoul using street-view images and a deep learning algorithm. Also, a process for updating information about the presence and number of bollards as obstacle properties for the crosswalk node through spatial matching between the detected bollards and the pedestrian nodes was proposed. The missing crosswalk information can also be updated concurrently by the proposed process. The proposed approach is appropriate for crowdsourcing data as the model trained using the street-view images can be applied to photos taken with a smartphone while walking. Through additional training with various obstacles captured in the street-view images, it is expected to enable efficient information update about obstacles on the road.

• Geophysics and Geophysical Exploration
• /
• v.19 no.3
• /
• pp.111-120
• /
• 2016

In order to enhance the connectivity of fracture network as fluid path in enhanced/engineered geothermal system (EGS), the exact locating of hydraulic fractured zone is very important. Hydraulic fractures can be tracked by locating of microseismic events which are occurred during hydraulic fracture stimulation at each stage. However, since the subsurface velocity is changed due to hydraulic fracturing at each stage, in order to find out the exact location of microseismic events, we have to consider the velocity change due to hydraulic fracturing at previous stage when we perform the mapping of microseimic events at the next stage. In this study, we have modified 3D locating algorithm of microseismic data which was developed by Kim et al. (2015) and have developed 3D velocity update algorithm using occurred microseismic data. Eikonal equation which can efficiently calculate traveltime for complex velocity model at anywhere without shadow zone is used as forward engine in our inversion. Computational cost is dramatically reduced by using Fresnel volume approach to construct Jacobian matrix in velocity inversion. Through the numerical test which simulates the geothermal survey geometry, we demonstrated that the initial velocity model was updated by using microseismic data. In addition, we confirmed that relocation results of microseismic events by using updated velocity model became closer to true locations.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.1
• /
• pp.1-13
• /
• 2007

The necessity of future index is increasing to predict the future location of moving objects promptly for various location-based services. A representative research topic related to future index is the probability trajectory prediction technique that improves reliability using the past trajectory information of moving objects in the road network environment. However, the prediction performance of this technique is lowered by the heavy load of extensive future trajectory search in long-range future queries, and its index maintenance cost is high due to the frequent update of future trajectory. Thus, this paper proposes the Probability Cell Trajectory-Tree (PCT-Tree), a cell-based future indexing technique for efficient long-range future location prediction. The PCT-Tree reduces the size of index by rebuilding the probability of extensive past trajectories in the unit of cell, and improves the prediction performance of long-range future queries. In addition, it predicts reliable future trajectories using information on past trajectories and, by doing so, minimizes the cost of communication resulting from errors in future trajectory prediction and the cost of index rebuilding for updating future trajectories. Through experiment, we proved the superiority of the PCT-Tree over existing indexing techniques in the performance of long-range future queries.

• Journal of Korean Society for Geospatial Information Science
• /
• v.1 no.2 s.2
• /
• pp.195-206
• /
• 1993

As the first step in developing the urban information system it is very important to identify the location of the street, and the feature of objects on it Also it is necessary to understand the relationship between objects concerned. In order to manage these information efficiently, the road information should be well organized and standardized for digital data. Because the road is the base place under which most urban utilities are buried. However, the present real situation is that even if we have unique numbers authorized by law for some parts of the road it is too ambiguous to figure out the spatial location of the specific area because the assigned area is so large and incoherent. Therefore, the purpose of this study is to propose a road location identication scheme, to apply this scheme at Kangnam-ku Seoul, and finally to propose the guideline in developing the road management information system in Korea. The road identification scheme developed in this study are as follows: (1) The road is defined as a fixed factor, and was given the identification number which repressents the funtion, relationship, and direction of the road without the road section and absolute coordinates. (2) The parcel identification nutter was given to each route to understand it possible to understand the location of the road itself and surroundings. (3) To update the md information using the scheme developed in this study relative coordinate method(Dynamic Segmentation) based on the road centerline was applied.