• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.156-159
• /
• 2010

vp tree는 기준점(vantage point)과의 거리를 기준으로 데이터베이스 내의 자료를 색인하는 자료구조이다. 멀티미디어 자료 검색에서 비슷한 정도는 객체간의 거리를 바탕으로 비교하고, vp tree 색인 구조는 이 과정을 내포하고 있기 때문에 최근 멀티미디어 검색 연구에서 많이 사용되고 있다. 검색 방법에는 query와 가장 가까운 대상을 찾는 Nearest Neighbor Search, 또는 query와 가까운 k등까지를 검색하는 k-Nearest Neighbor Search가 있다. 본 논문에서는 Content-based retrieval에서 최근 자주 사용되는 vp tree에서 효과적인 k-NNS 방법을 제안하고, 기존의 전형적인 k-NNS 방법과의 비교 실험 결과를 보인다.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.453-463
• /
• 2002

With the prevalence of multi-dimensional data such as images, content-based retrieval of data is becoming increasingly important. To handle multi-dimensional data, multi-dimensional index structures such as the R-tree, Rr-tree, TV-tree, and MVP-tree have been proposed. Numerous research results on how to effectively manipulate these structures have been presented during the last decade. Query processing strategies, which is important for reducing the processing time, is one such area of research. In this paper, we propose query processing algorithms for R-tree based structures. The novel aspect of these algorithms is that they make use of the notion of VP filtering, a concept borrowed from the MVP-tree. The filtering notion allows for delaying of computational overhead until absolutely necessary. By so doing, we attain considerable performance benefits while paying insignificant overhead during the construction of the index structure. We implemented our algorithms and carried out experiments to demonstrate the capability and usefulness of our method. Both for range query and incremental query, for all dimensional index trees, the response time using VP filtering was always shorter than without VP filtering. We quantitatively showed that VP filtering is closely related with the response time of the query.

• Journal of Information Processing Systems
• /
• v.9 no.2
• /
• pp.315-332
• /
• 2013

This paper presents an approach for improving the use of VP-tree in video indexing and searching. A vantage-point tree or VP-tree is one of the metric space-based indexing methods used in multimedia database searches and data retrieval. Instead of relying on the Euclidean distance as a measure of search space, the proposed approach focuses on the trigonometric inequality for compressing the search range, which thus, improves the search performance. A test result of using 10,000 video files shows that this method reduced the search time by 5-12%, as compared to the existing method that uses the AESA algorithm.

• Korean Journal of Veterinary Service
• /
• v.36 no.1
• /
• pp.23-30
• /
• 2013

An avian rotavirus (AvRV-2) was isolated from feces of broilers suffering from acute gastroenteritis in 2011. It was the first avian rotavirus isolated in Korea. To investigate the molecular characteristics of AvRV-2, the VP4, VP6, VP7 and NSP4 gene nucleotide sequences were determined and compared with those of rotavirus strains available in the GenBank database. The phylogenetic tree of VP7 gene showed that AvRV-2 had a high degree of nucleotide sequence homology (93.4% to 94.7%) with those of rotaviruses belonging to genotype G19 cluster. The phylogenetic tree of the VP4 gene revealed a high degree of nucleotide sequence homology (95.8% to 95.9%) with genotype P[30] rotaviruses isolated from chickens. The VP6 and NSP4 gene nucleotide sequences showed the highest identities with those of avian strains with 95.3% to 96.4% and 90.3% to 92.2%, respectively. Genetic characterization of the VP4, VP6, VP7 and NSP4 showed that AvRV-2 strain was most closely related to chicken rotavirus strains from Germany and Japan. Comparative nucleotide sequences and phylogenetic analysis indicated that avian rotavirus isolated from broilers belonged to genotype G19P[30] and it was the first report on avian rotavirus infection in Korea.

• Journal of Korea Multimedia Society
• /
• v.15 no.2
• /
• pp.215-225
• /
• 2012

In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.

• Journal of Microbiology and Biotechnology
• /
• v.20 no.3
• /
• pp.643-649
• /
• 2010

Evaluation of the primary etiologic agents that cause aseptic meningitis outbreaks may provide valuable information regarding the prevention and management of aseptic meningitis. In Korea, an outbreak of aseptic meningitis caused by echovirus type 30 (E30) occurred from May to October in 2008. In order to determine the etiologic agent, CSF and/or stool specimens from 140 children hospitalized for aseptic meningitis at Soonchunhyang University Cheonan Hospital between June and October of 2008 were tested for virus isolation and identification. E30 accounted for 61.7% (37 cases) and echovirus 6 accounted for 21.7% (13 cases) of all the human enteroviruses (HEVs) isolates (60 cases in total). For the molecular characterization of the isolates, the VP1 gene sequence of 18 Korean E30 isolates was compared pairwise using the MegAlign with 34 reference strains from the GenBank database. The pairwise comparison of the nucleotide sequences of the VP1 genes demonstrated that the sequences of the Korean strains differed from those of lineage groups A, B, C, D, E, F, and G. Reconstruction of the phylogenetic tree based on the complete VP1 nucleotide sequences resulted in a monophyletic tree, with eight clustered lineage groups. All Korean isolates were segregated from other lineage groups, thus suggesting that the Korean strains were a distinct lineage of E30, and a probable cause of this outbreak. This manuscript is the first report, to the best of our knowledge, of the molecular characteristics of E30 strains associated with an aseptic meningitis outbreak in Korea, and their respective phylogenetic relationships.

• Transactions of the KSME C: Technology and Education
• /
• v.4 no.1
• /
• pp.27-34
• /
• 2016

This preliminary study investigated data mining-based methods to assess and predict the performance of geothermal heat pump(GHP) system. Data mining is a key process of the knowledge discovery in database (KDD), which includes five steps: 1) Selection; 2) Pre-processing; 3) Transformation; 4) Analysis(data mining); and 5) Interpretation/Evaluation. We used two analysis models, categorical and numerical decision tree models to ascertain the patterns of performance(COP) and electrical consumption of the GHP system. Prior to applying the decision tree models, we statistically analyzed measurement database to determine the effect of sampling intervals on the system performance. Analysis results showed that 10-min sampling data for the performance analysis had highest accuracy of 97.7% over the actual dataset of the GHP system.

• Journal of Korean Society of Forest Science
• /
• v.50 no.1
• /
• pp.25-28
• /
• 1980

The purpose of the this study was to compare the torlent tree to drought among the Pinus koraiensis, Abies holophylla, and Ginkgo biloba. The water relations parameters of leafy shoots were measured by the Pressure chamber technique from August 10 to September 4 in 1980. On the water relations parameters such as original osmotic pressure(${\pi}_0$), osmotic pressure(${\pi}_p$) and relative water content (RWC) at incipient plasmolysis, and Vp/Vo ratio of the volume of osmotic water (Vp) at incipient plasmolysis to total symplasmic water (Vo) basis, the Abies holophylla shoots showed ontogenetically a superior osmoregulation which are closely associated with drought resistance compared with Pinus koraiensis, and the Ginkgo biloba shoots showed the heighest among these three species.

• Korean Journal of Veterinary Research
• /
• v.46 no.3
• /
• pp.235-248
• /
• 2006

The VP2 full gene of Korean infectious bursal disease virus(IBDV) strain, SH/92, three attenuated vaccine strains, Bur706, Bursine-2 and CEV/AC strains, were amplified by reverse transcriptase-polymerase chain reaction and sequenced and compared with published VP2 gene sequences of IBDVs. The VP2 nucleotide sequence similarity between SH/92 and three vaccine stains was 95.6~96.5% whereas the nucleic acid similarity among three vaccine strains was 97.5~98.5%. The amino acid sequence similarity of VP2 of SH/92 compared with three vaccine strains was between 94.4 and 97.6% while the amino acid similarity among three vaccine strains was between 97.4 and 98.4%. The amino acid similarity between SH/92 and classical virulent strain, 52/70 and STC strain was 96.4 and 96.5%, respectively. The serine-rich heptapeptide was conserved in CEVAC and Bursine-2 as well as SH/92 but not in Bur706. The phylogenetic tree developed from amino acid sequences showed that SH/92 was categorized with vv IBDVs(HK46, OKYM, KKI, UPM94/273, SH95) in one branch while three vaccine strains were catagorized with STC strain in the other branch.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.