• 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.

• Nuclear Engineering and Technology
• /
• v.15 no.1
• /
• pp.1-10
• /
• 1983

By controlling both the means of grafting and the cast-solution components, no degradation and dimensional change of radiation-induced graft polymerization were found. The electric resistance of styrene-cellulose acetate grafts increases with increasing styrene content, while those for the hydrophilic monomers show no marked effect. In comparison with the grafted cellulose acetate membrane by simultaneous irradiation method, the appearance of the grafted membrane by post-polymerization method was not markedly changed irrespective of the percent of grafting and radiation dose of electron beam or ${\gamma}$-ray. The combination of crosslinking agents such as divinyl benzene (OB) or trimethyl propane triacrylate (TMPT) in the VP:St:BPO system leads to gradual increase of the percent of grafting. The activation energy for grafting of St:VP:BPO solution onto cellulose acetate membrane was determined to be about 21.8 Kcal/mole over the range of 55$^{\circ}$-8$0^{\circ}C$. The initial rate of grafting (in %/hr) is proportional to the power 0.76 for dose intensities.

• 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 the Korean Society of Radiology
• /
• v.13 no.7
• /
• pp.941-946
• /
• 2019

Computed tomography (CT) has been increasing in frequency and indications for use in clinical diagnosis and treatment decisions. Multidetector CT has the advantage of shortening the inspection time and obtaining a high resolution image compared to a single detector CT, but has been pointed out the disadvantage of increasing the radiation exposure. In addition, when the low tube voltage is used to reduce the exposure dose in the CT, noise increases relatively. In the existing method, the method of finding the optimal image quality using the method of adjusting the parameters of the image reconstruction method is not a fundamental measure. In this study, we applied a double-tree complex wavelet algorithm and analyzed the results to maintain the normal signal and remove only noise. Experimental results show that the noise is reduced from 8.53 to 4.51 when using a complex oriented 2D method with 100kVp and 0.5sec rotation time. Through this study, it was possible to remove the noise and reduce the patient dose by using the optimal noise reduction algorithm. The results of this study can be used to reduce the exposure of patients due to the low dose of CT.

• Proceedings of the KIEE Conference
• /
• 2000.07c
• /
• pp.1954-1956
• /
• 2000

In this paper, when void of XLPE was existed, electrical tree was growth in branch-type, and it was growth in bush-type when void of XLPE was not existed. Moreover, charge magnitude of partial discharge by deterioration time of XLPE sample was about proportion to output voltage of AE signals. When void was existed, charge magnitude of partial discharge, the output voltage Vp-p value of AE signals were increased with increasing deterioration time. However, when void were not existed, charge magnitude of partial discharge, the output voltage Vp-p value of AE signals were increased in fast deterioration time, but it were decreasing at after in middle deterioration time. Frequency spectrum response of AE signal was about 100-250[kHz].

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.91-102
• /
• 1996

The multicast routing algorithm is necessary to transmit multimedia traffic efficiently in ATM (asynchronous transfer mode) networks. In this paper, we propose the multicast routing algorithm which is based on VP/VC characteristic. The proposed algorithm is based on VP tree concept and using cost function which is based on VP/VC switching. The cost funication is composed of link cost, delay and weighting factor on delay and the weighting factor is calculated by delay sensitivity of the traffic. The proposed algorithm can choose delay bounded path which satisfies delay constraint, moreover it can choose optimal path among VPs which has the same link cost and satisfying delay constraint. With controlling weighting factor, proposed algorithm can set-up efficient path. When the weighting factor sets to be between 0.8 and 1, experimental results show that the perforance of proposed scheme is approximated to that of cost optimal algorithm and strongly delay optimized algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.11a
• /
• pp.370-373
• /
• 2020

본 연구는 파일기반 악성파일 탐지시간을 줄이는 알고리즘 사용에 대해 기술하고 있다. 기존 탐지방식은 파일의 시그니처 값에 대한 유사도를 단순히 비교하는 것에만 그쳐 오탐율이 높거나 새롭게 생성되는 악성파일을 대응할 수 없는 제한점이 있다. 또한 정확도를 높이고자 딥 러닝을 통한 탐지방식이 제안되고 있으나 이 또한 동적분석으로 진행이 되기 때문에 시간이 오래 걸리는 제한이 있다. 그래서 우리는 이를 보완하는 VP Tree 탐지를 제안한다. 이 방법은 시그니처 값이 아닌 다차원에서의 해시 값의 데이터 위치를 기반으로 거리를 척도 한다. 유클리드 거리 법, 맨해튼 거리법이 사용되며 삼각부등식의 만족하는 기준으로 K-NN 이 생성이 되며, K-NN 을 이진 트리로 구성하여 인덱스를 통한 탐지를 진행하기에 기존 방법들을 보완할 수 있는 대안점이 될 수 있으며, 악성파일과 정상파일이 섞여 존재하는 총 3 만개의 데이터를 대상으로 악성파일 탐지 테스트를 진행하였으며 기본 방식에 비해 약 15~20%정도 속도가 단축된다는 것을 입증했다.

• 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.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.21 no.4
• /
• pp.317-326
• /
• 2019

Salinity which is often detected on reclaimed land is a major detrimental factor to crop growth. It would be advantageous to develop an approach for assessment of salinity and drought damages using a non-destructive method in a large landfills area. The objective of this study was to examine applicability of the decision tree classifier using imagery for classifying for spring potatoes (Solanum tuberosum) damaged by salinity or drought at vegetation growth stages. We focused on comparing the accuracies of OA (Overall accuracy) and KC (Kappa coefficient) between the simple reflectance and the band ratios minimizing the effect on the light unevenness. Spectral merging based on the commercial band width with full width at half maximum (FWHM) such as 10 nm, 25 nm, and 50 nm was also considered to invent the multispectral image sensor. In the case of the classification based on original simple reflectance with 5 nm of FWHM, the selected bands ranged from 3-13 bands with the accuracy of less than 66.7% of OA and 40.8% of KC in all FWHMs. The maximum values of OA and KC values were 78.7% and 57.7%, respectively, with 10 nm of FWHM to classify salinity and drought damages of spring potato. When the classifier was built based on the band ratios, the accuracy was more than 95% of OA and KC regardless of growth stages and FWHMs. If the multispectral image sensor is made with the six bands (the ratios of three bands) with 10 nm of FWHM, it is possible to classify the damaged spring potato by salinity or drought using the reflectance of images with 91.3% of OA and 85.0% of KC.