• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.328-342
• /
• 2007

We propose a new cache conscious indexing structure for processing frequently updated data efficiently. Our proposed index structure is based on a KDB-Tree, one of the representative index structures based on space partitioning techniques. In this paper, we propose a data compression technique and a pointer elimination technique to increase the utilization of a cache line. To show our proposed index structure's superiority, we compare our index structure with variants of the CR-tree(e.g. the FF CR-tree and the SE CR-tree) in a variety of environments. As a result, our experimental results show that the proposed index structure achieves about 85%, 97%, and 86% performance improvements over the existing index structures in terms of insertion, update and cache-utilization, respectively.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2004.12a
• /
• pp.113-116
• /
• 2004

Assisted by high technologies of information and communication in storing and collecting moving object information, many applications have been developing technical methods to exploit databases of moving objects effectively and variously. Among them, today, Current and Anticipated Future Position Indexing methods manage current positions of moving objects in order to anticipate future positions of them or more complex future queries. They, however, strongly demand update performance as fast enough to guarantee certainty of queries as possible. In this paper, we propose a new indexing mettled derived from the TPR-tree that should has update performance considerably improved, we named it BUR-tree. In our method, index structure can be inserted, deleted, and updated with a number (or bulk) of objects simultaneously rather than one object at a time as in conventional methods. This method is intended to be applied to a traffic network in which vast number of objects, such as cars, pedestrians, moves continuously.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.04b
• /
• pp.195-204
• /
• 2000

The finite element analysis (FEA) is widely used in modern structural dynamics because the performance of structure can be predicted in early stage. However, due to the difficulty in determination of various uncertain parameters, it is not easy to obtain a reliable finite element model. To overcome these difficulties, a updating program of FE model is developed by consisting of pretest, correlation and update. In correlation, it calculates modal assurance criteria, cross orthogonality, mixed orthogonality and coordinate modal assurance criteria. For the model updating, the continuum sensitivity analysis and design optimization tool(DOT) are used. The SENSUP program is developed for model updating giving physical parameter sensitivity. The developed program is applied to practical examples such as the BLDC spindle motor of HDD, and upper housing of induction motor. And the sensor placement for the square plate is compared using several methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.583-597
• /
• 2001

Tracking the targets of interest has been one of the major research areas in radar surveillance system. We formulate the tracking problem as an incomplete data problem and apply the EM algorithm to obtain the MAP estimate. The resulting filter has a recursive structure analogous to the Kalman filter. The difference is that the measurement-update deals with multiple measurements and the parameter-update can estimate the system parameters. Through extensive experiments, it turns out that the proposed system is better than PDAF and NNF in tracking the targets. Also, the performance degrades gracefully as the disturbances become stronger.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.52-62
• /
• 1997

To reconstruct the complete 3-D shape of an object, seveal range images form different viewpoints should be merged into a single model. The process of extraction of the transformation parameters between multiple range views is calle dregistration. In this paper, we propose a new algorithm to find the transformation parameters between multiple range views. Th eproposed algorithm consists of two step: initial estimation and iteratively update the transformation. To guess the initial transformation, we modify the principal axes by considering the projection effect, due to the difference fo viewpoints. Then, the following process is iterated: in order to extract the exact transformation parameters between the range views: For every point of the common region, find the nearest point among the neighborhood of the current corresponding point whose correspondency is defined by the reverse calibration of the range finder. Then, update the transformation to satisfy the new correspondencies. In order to evaluate the performance the proposed registration algorithm, some experiments are performed on real range data, acquired by space encoding range finder. The experimental results show that the proposed initial estimation accelerate the following iterative registration step.

• Proceedings of the Korea Database Society Conference
• /
• 1997.10a
• /
• pp.515-523
• /
• 1997

Maintaining materialized views and/or replica can basically be considered as a client-sewer architecture that extracts the changes of the distributed source data and transfers them to the relevant target sites. View maintenance and materialized views are considered to be important for suggesting solutions to the problems such as a decision support, active databases, a data warehouse, temporal databases, internet applications, etc. In this paper an analysis is addressed that formulates the cost functions and evaluates them as the propagation subjects, objects, and update policies. The propagation subject can be the client side, sewer side, and the third: and the objects can be base tables, semi-base tables, and delta files: And the update policies can be the immediate, deferred and periodic ones, respectively.

• The Journal of Korea Robotics Society
• /
• v.4 no.1
• /
• pp.56-61
• /
• 2009

A probability-based data generation is a typical context-generation method that is a not only simple and strong data generation method but also easy to update generation conditions. However, the probability-based context-generation method has been found its natural-born ambiguousness and confliction problems in generated context data. In order to compensate for the disadvantages of the probabilistic random data generation method, a situation propagation network is proposed in this paper. The situation propagating network is designed to update parameters of probability functions are included in probability-based data generation model. The proposed probability-based context-generation model generates two kinds of contexts: one is related to independent contexts, and the other is related to conditional contexts. The results of the proposed model are compared with the results of the probabilitybased model with respect to performance, reduction of ambiguity, and confliction.

• The Journal of Korea Robotics Society
• /
• v.9 no.4
• /
• pp.206-215
• /
• 2014

Acoustic signal is crucial for the autonomous navigation of underwater vehicles. For this purpose, this paper presents a method of acoustic source localization. The proposed method is based on the probabilistic estimation of time delay of acoustic signals received by two hydrophones. Using Bayesian update process, the proposed method can provide reliable estimation of direction angle of the acoustic source. The acquired direction information is used to estimate the location of the acoustic source. By accumulating direction information from various vehicle locations, the acoustic source localization is achieved using extended Kalman filter. The proposed method can provide a reliable estimation of the direction and location of the acoustic source, even under for a noisy acoustic signal. Experimental results demonstrate the performance of the proposed acoustic source localization method in a real sea environment.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.5
• /
• pp.775-782
• /
• 2005

The service of wireless network has problems due to low bandwidth, frequent disconnection, low packet transport and user' mobility. In this paper, we proposed the cooperative methods of update to perform efficiently wireless network services. The proposed method performs the updates by cooperative filtering and streaming by $mbuffer_{in}$ and $mbuffer_{out}$. The simulation results show performance improvement of the proposed method compared to others.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.171-177
• /
• 2012

Network mobility support has been taken into consideration for users who have multiple terminals to enjoy the seamless connectivity. This paper proposes a network mobility support scheme in the LISP architecture. During the mobile router attachment, the EID-to-RLOC mapping database is refreshed in the map server. Furthermore, map update is developed to support smooth handoff for the mobile network. An analysis of performance is given by comparing the proposed scheme with NEMO.