• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.101-109
• /
• 2004

In this paper, we propose an efficient algerian for wavelet-based sti image coding method that utilizes the rate-distortion (R-D) theory. Since conventional tree-structured image coding schemes do not consider the rate-distortion theory properly, they show reduced coding performance. In this paper, we apply an rate-distortion optimized embedding (RDE) operation into the set partitioning in hierarchical trees (SPIHT) algorithm. In this algorithm, we use the rate-distortion slope as a criterion for the coding order of wavelet coefficients in SPIHT lists. We also describe modified set partitioning and rate-distortion optimized list scan methods. Experimental results demonstrate that the proposed method outperforms the SPIHT algorithm and the rate-distortion optimized embedding algerian with respect to the PSNR (peak signal-to-noise ratio) performance.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.543-554
• /
• 2002

GIS (Geographic Information Systems) need faster access and better visualization. For faster access and better visualization in GIS, map generalization and levels of detail are needed. Existing spatial indexing methods do not support map generalization. Also, a few existing spatial indexing methods supporting map generalization do not support ail map generalization operations. We propose a new index structure, i.e. the LR-tree, supporting ail map generalization operations. This paper presents algorithms for the searching and updating the LR-tree and the results of performance evaluation. Our index structure works better than other spatial indexing methods for map generalization.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.4
• /
• pp.1-14
• /
• 2004

In this study, we propose Linktable based on extended TB-Tree(LTB-Tree) which can improve the performance of existing TB (Trajectory-Bundle)-tree proposed for indexing the trajectory of moving objects in GIS Applications. In addition, in order to evaluate proposed indexing scheme, we take into account as follows. At first, we select existing R*-tree, TB-tree, and LTB-tree as the subject of performance evaluation. Secondly, we make use of random data set and real data set as experimental data. Thirdly, we evaluate the performance with respect to the variation of size of memory buffer by considering the restriction of available memory of a given system. Fourth, we test them by using the experimental data set with a variation of data distribution. Finally, we think over insertion and retrieval performance of trajectory query and range query as experimental measures. The experimental results show that the proposed indexing scheme, LTB-tree, gains better performance than traditional other schemes with respect to the insertion and retrieval of trajectory query.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.23-31
• /
• 2010

With the advances in the information technology and mobile communications, we now face increasing demands for various services based on both of position tracking of moving objects and their efficient index scheme. Accordingly, the $TPR^*$-tree, which were proposed for efficiently tracking moving objects and predicting their positions in the future time, has drawn much intention. As the $TPR^*$-tree came from the R-tree that is suitable for indexing static objects, it does not support cheap update costs. Therefore, it seems to be very costly to index moving objects if there are frequent occurrences of node updates caused by continuously changing velocities and positions. If some moving objects with high velocities have node updates, in particular, then the $TPR^*$-tree may suffer from many unnecessary updates in the wide range of tree regions. To avoid such a problem, we propose a method that can keep fast-moving objects in the child nodes of the root node, thereby saving node update costs in the $TPR^*$-tree. To show our performance advantages and retaining $TPR^*$-tree features, we performed some performance experiments using a simulation technique.

• Journal of Advanced Navigation Technology
• /
• v.24 no.4
• /
• pp.285-290
• /
• 2020

This paper presents a time synchronization algorithm based on PLL for application to telemetry systems and implement FPGA logic. The large aircraft of the telemetry system acquires status information through each distributed acquisition devices and analyzes the flight status in real time. For this reason, time synchronization between systems is important to improve precision. This paper presents a PLL based time synchronization algorithm that is less complex than other time synchronization methods and takes less time to process data because there is minimized message transmission for synchronization. The validity of proposed algorithm is proved by simulation of Python. And the VHDL logic was implemented in FPGA to check the time synchronization performance.

• Proceedings of the Materials Research Society of Korea Conference
• /
• 1998.05a
• /
• pp.115-115
• /
• 1998

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.438-450
• /
• 2003

Spatial joins find pairs of objects that overlap with each other. In spatial joins using indexes, original-space indexes such as the R-tree are widely used. An original-space index is the one that indexes objects as represented in the original space. Since original-space indexes deal with sizes of objects, it is difficult to develop a formal algorithm without relying on heuristics. On the other hand, transform-space indexes, which transform objects in the original space into points in the transform space and index them, deal only with points but no sites. Thus, spatial join algorithms using these indexes are relatively simple and can be formally developed. However, the disadvantage of transform-space join algorithms is that they cannot be applied to original-space indexes such as the R-tree containing original-space objects. In this paper, we present a novel mechanism for achieving the best of these two types of algorithms. Specifically, we propose a new notion of the transform-space view and present the transform-space view join algorithm(TSVJ). A transform-space view is a virtual transform-space index based on an original-space index. It allows us to interpret on-the-fly a pre-built original-space index as a transform-space index without incurring any overhead and without actually modifying the structure of the original-space index or changing object representation. The experimental result shows that, compared to existing spatial join algorithms that use R-trees in the original space, the TSVJ improves the number of disk accesses by up to 43.1% The most important contribution of this paper is to show that we can use original-space indexes, such as the R-tree, in the transform space by interpreting them through the notion of the transform-space view. We believe that this new notion provides a framework for developing various new spatial query processing algorithms in the transform space.

• Parasites, Hosts and Diseases
• /
• v.28 no.1
• /
• pp.25-30
• /
• 1990

The direct wet mount examination of vaginal. secretion, widely applied for the diagnosis of Trichcmonas vaginalis infection in woman patients, is rapi4 and economical, however, the sensitivity of this technique is not so high. In this study enzyme-linked immunosorbent assay (ELISA) was employed for the detection of serum anti-T. vaginalis IgG and IsM antibodies from 30 vaginal trichomoniasis patients and 30 non-infected healthy persons. The results were as follows: 1. Serum ELISA-IgG value was $0.37{\pm}0.134(Mean{\pm}S.D.)$ in vaginal trichomoniasis patients and $0.21{\pm}0.054$ in healthy controls(P<0.005), and the sensitivity and specificity of ELISA for serum IgG antibody were 70.0% and 96.7%, respectively. 2. Serum ELISA-IgM value was $0.33{\pm}0.177 (Mean{\pm}S.D.)$ in vaginal trichomonlasls patients and $0.11{\pm}0.051$ in healthy controls (p<0.005), and the sensitivity and specificity of ELISA for serum IsM antibody were 70.0% and 96.7%, respectively. 3, The ELISA-IgG values showed a significant correlation with ELISA-IgM values(r=0.77, p<0.005) , With above results, it is assumed that ELISA is a reliable method for the diagnosis of T vaginalis infection and simultaneous measurement of serum IgG and IgM with this technique is recommended.

• Korean Journal of Soil Science and Fertilizer
• /
• v.45 no.6
• /
• pp.1027-1031
• /
• 2012

This experiment was conducted to select winter-adaptable crop system or cropping systems for an enhanced carbon (C) fixation amount in plant biomass and soil. Single or mixed cropping systems of green manure crops, rye (R), triticale (TC), hairy vetch (HV), TC+HV, and control (fallow) were investigated during winter and spring. The amount and content of C and N in the above-ground biomass and soil C content by soil depth were measured under different green manure crops. The above-ground biomass was highest in TC+HV followed by R and TC with 664, 585, and 545 kg $10a^{-1}$, which exceeded the biomass of control by 181, 160, and 149%, respectively. The amount of C accumulation was higher in soil surface than deep soil. which was a similar pattern to the above-ground biomass. Therefore, green manure cropping in winter and spring seasons will be very helpful of improve soil organic matter.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.463-476
• /
• 2006

R-trees have been traditionally optimized for the I/O performance with the disk page as the tree node. Recently, researchers have proposed cache-conscious variations of R-trees optimized for the CPU cache performance in main memory environments, where the node size is several cache lines wide and more entries are packed in a node by compressing MBR keys. However, because there is a big difference between the node sizes of two types of R-trees, disk-optimized R-trees show poor cache performance while cache-optimized R-trees exhibit poor disk performance. In this paper, we propose a cache and disk optimized R-tree, called the PR-tree (Prefetching R-tree). For the cache performance, the node size of the PR-tree is wider than a cache line, and the prefetch instruction is used to reduce the number of cache misses. For the I/O performance, the nodes of the PR-tree are fitted into one disk page. We represent the detailed analysis of cache misses for range queries, and enumerate all the reasonable in-page leaf and nonleaf node sizes, and heights of in-page trees to figure out tree parameters for best cache and I/O performance. The PR-tree that we propose achieves better cache performance than the disk-optimized R-tree: a factor of 3.5-15.1 improvement for one-by-one insertions, 6.5-15.1 improvement for deletions, 1.3-1.9 improvement for range queries, and 2.7-9.7 improvement for k-nearest neighbor queries. All experimental results do not show notable declines of the I/O performance.