• Journal of KIISE:Databases
• /
• 제33권5호
• /
• pp.513-525
• /
• 2006

Search results of XML keyword search are defined generally as the most specific elements containing all query keywords in the literature. The labels of XML elements and semantic information such as ontology, conceptual model, thesaurus, and so on, are used to improve the preciseness of the search results. This paper presents a hierarchical index for an efficient XML keyword query processing on the condition that returnable search concepts are defined and users' query concepts can be interpreted with the help of the semantic information. The hierarchical index separately stores the XML elements containing a keyword on the basis of the hierarchical relations of the concepts that the XML elements belong to, and makes it possible to obtain least common ancestors, which are candidates for the search results, with selectively reading the elements belonging to the concepts relevant to query concepts and without considering all the combinations of the elements having been read. This paper deals with how to organize the hierarchical index and how to process XML keyword queries with the index. In our experiment with the DBLP XML document and the XML documents in the INEX2003 test set, the hierarchical index worked well.

• Journal of Digital Contents Society
• /
• 제8권4호
• /
• pp.441-449
• /
• 2007

In video coding, motion estimation is a process to estimate the pixel of the current frame from the reference frame, which affects directly the predictive quality and the encoding time. This paper is related to AHHS(Adaptive Hierarchical Hexagon Search) using spatio-temporal motion activity for fast motion estimation. The proposed method defines the spatio-temporal motion activity of the current macroblock using the motion vectors of its spatio-temporally adjacent macroblocks, and then conventional AHS(Adaptive Hexagon Search) is performed if the spatio-temporal motion activity is lower, otherwise, hierarchical hexagon search is performed on a multi-layered hierarchical space constructed by multiple sub-images with low frequency in wavelet transform. In the paper, based on computer simulation results for multiple video sequences with different motion characteristics, the performance of the proposed method was analysed and assessed in terms of the predictive quality and the computational time. Experimental results indicate that the proposed method is both suitable for (quasi-) stationary and large motion searches. The proposed method could keep the merit of the adaptive hexagon search capable of fast estimating motion vectors and also adaptively reduce the local minima occurred in the video sequences with higher spatio-temporal motion activity.

• Journal of KIISE:Information Networking
• /
• 제35권6호
• /
• pp.482-496
• /
• 2008

Packet classification in the Internet routers requires multi-dimensional search for multiple header fields for every incoming packet in wire-speed, hence packet classification is one of the most important challenges in router design. Hierarchical packet classification is one of the most effective solutions since search space is remarkably reduced every time a field search is completed. However, hierarchical structures have two intrinsic issues; back-tracking and empty internal nodes. In this paper, we propose a new hierarchical packet classification algorithm which solves both problems. The back-tracking is avoided by using the set-pruning and the empty internal nodes are avoided by applying the binary search tree. Simulation result shows that the proposed algorithm provides significant improvement in search speed without increasing the amount of memory requirement. We also propose an optimization technique applying controlled rule copy in set-pruning.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제32권3B호
• /
• pp.143-152
• /
• 2007

In order to provide new value-added services such as a policy-based routing and the quality of services in next generation network, the Internet routers need to classify packets into flows for different treatments, and it is called a packet classification. Since the packet classification should be performed in wire-speed for every packet incoming in several hundred giga-bits per second, the packet classification becomes a bottleneck in the Internet routers. Therefore, high speed packet classification algorithms are required. In this paper, we propose an efficient packet classification architecture based on a hierarchical binary search fee. The proposed architecture hierarchically connects the binary search tree which does not have empty nodes, and hence the proposed architecture reduces the memory requirement and improves the search performance.

• KIISE Transactions on Computing Practices
• /
• 제22권2호
• /
• pp.83-88
• /
• 2016

Subtopic mining is the extraction and ranking of possible subtopics, which disambiguate and specify the search intentions of an input query in terms of relevance, popularity, and diversity. This paper describes the limitations of previous studies on the utilization of web resources, and proposes a subtopic mining method with a two-level hierarchy based on hierarchical search intentions and web resources, in order to overcome these limitations. Considering the characteristics of resources provided by the official subtopic mining task, we extract various second-level subtopics reflecting hierarchical search intentions from web documents, and expand and re-rank them using other provided resources. Terms in subtopics with wider search intentions are used to generate first-level subtopics. Our method performed better than state-of-the-art methods in almost every aspect.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.104-106
• /
• 2007

In this paper, we propose an approach to design of optimized Cascade controller for Rotary Inverted Pendulum system using Hierarchical Fair Competition-based Genetic Algorithm(HFCGA). GAs may get trapped in a sub-optimal region of the search space thus becoming unable to find better quality solutions, especially for very large search space. The Parallel Genetic Algorithms(PGA) are developed with the aid of global search and retard premature convergence. HFCGA is a kind of multi-populations of PGA. In this paper, we design optimized Cascade controller by HFCGA for Rotary Inverted Pendulum system that is nonlinear and unstable. Cascade controller comprise two feedback loop, parameters of controller optimize using HFCGA. Then designed controller evaluate by apply to the real plant.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• 제30B권6호
• /
• pp.35-48
• /
• 1993

In this paper, a hierarchical motion vector estimation algorithm using pyramidal structure is proposed. Using a smaller measurement window at each level of a pyramid than that of the conventional scheme, the proposed algorithm, based on the TSS(three step search), reduces the computational complexity greatly with its performance comparable to that of the TSS. By increasing the number of cnadidate motion vectors which are to be used as the initial search points for motion vector estimation at the next level, the performance improves further. Then the computational complexity of the proposed hierarchical algorithm depends on the number of candidate motion vectors, with its PSNR (peak signal to noise ratio) ranging between those of the TSS and the full search method. The simulation results with two different block sizes and various test sequences are given and its hardware implementation is also sketched.

• The Journal of Information Systems
• /
• 제14권3호
• /
• pp.17-22
• /
• 2005

Location management is very important in location-based services to provide services to the mobile users like banking, city guides and many more. Ubiquitous and mobile devices are the source of data in location management and its significant operations are update and search method. Some studies to improve these were presented by using optimal sequential paging, location area scheme and hierarchical database scheme. In addition, not all location services have the same access methods on data and it lead to difficulties of providing services. A proposed location management of multi-agent architecture is presented in this study. It shows the coordination of the agents on the distributed database of location-based services. The proposal focuses on the location management of the mobile object presented in a hierarchical search and update. Also, it uses a nearest neighbor technique for efficient search method of mobile objects.

• IEMEK Journal of Embedded Systems and Applications
• /
• 제14권2호
• /
• pp.79-86
• /
• 2019

For decades, in-memory data structures have been designed for DRAM-based main memory that provides symmetric read/write performances and has no limited write endurance. However, such data structures provide sub-optimal performance for NVM as it has different characteristics to DRAM. With this motivation, we rethink a conventional red-black tree in terms of its efficacy under NVM settings. The original red-black tree constantly rebalances sub-trees so as to export fast access time over dataset, but it inevitably increases the write traffic, adversely affecting the performance for NVM with a long write latency and limited endurance. To resolve this problem, we present a variant of the red-black tree called a hierarchical balanced binary search tree. The proposed structure maintains multiple keys in a single node so as to amortize the rebalancing cost. The performance study reveals that the proposed hierarchical binary search tree effectively reduces the write traffic by effectively reaping the high capacity of NVM.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 한국방송공학회 1996년도 학술대회
• /
• pp.217-220
• /
• 1996

This paper describes a new hierarchial block matching algorithm especially appropriate for a large search area. The proposed algorithm consists of higher level search for an initial motion vector estimate by using a new matching criterion over the evenly subsampled search points, and lower level search for the final motion vector refinement. In the higher level matching criterion, mean absolute differences at the search points (or motion vector candidates) similar to motion vectors of causally neighboring blocks, are weighted properly so that these points can have a higher chance to being selected. The proposed algorithm outperforms existing hierarchical block matching algorithms, and its computational regularity makes hardware implementation simple.