• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.487-489
• /
• 2005

This paper proposes a symbol timing recovery method that is simple in structure and can provide high speed symbol synchronization. Transmitter and receiver are not synchronized in communication systems using digital modulation. Receiver should search the timing variation of transmitter continuously. The proposed timing recovery method searches sample position by comparing previous sample value with next sample value. This method can be applied to digital and optical transceivers with high data rate.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.684-695
• /
• 1987

In this paper, an improved matching method using subtemplate of moving region and 3-step search algorithm is proposed. It reduces heavy computational load of the conventional method and also can continuously track the target even with occlusion. The proposed method is applied to an automatic target tracker using high speed 16bit microprocessor in order to track one moving target in real time. Experimental results show that the proposed method has better performance over the conventional method in spite of greately reducing the computational load, even in case with complex background and/or with occlusion.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.43 no.4
• /
• pp.586-593
• /
• 1994

This paper suggests the algorithm for on-line efficiency control of permancent magnet synchronous motors driving the electric vehicles. The existance of unigue d-axis current is verified, which generates the maximum efficiency at operating points of motor. Using the Fibonacci search method, d-axis current converges to the minimization of inverter input power, and to prevent the variation of motor speed in process of the efficiency control, the voltage decoupled control strategy is introduced. Through the experiments, the effects of an efficiency control algorithm are verified.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.15-16
• /
• 2007

In order to provide value-added services, next generation routers should perform packet classification for each incoming packet at wire-speed. In this paper, we proposed hierarchical priority trio (Hptrie) for packet classification. The proposed scheme improves the search performance and the memory requirement by replacing empty internal nodes in ordinary hierarchical trio with priority nodes which are the nodes including the highest priority rule among sub-trie nodes.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.87-94
• /
• 2003

One of the important fields for heuristic algorithm is how to balance between Intensification and Diversification. Ant Colony Optimization(ACO) is a new meta heuristic algorithm to solve hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as Breedy search It was first Proposed for tackling the well known Traveling Salesman Problem(TSP). In this paper, we deal with the performance improvement techniques through balance the Intensification and Diversification in Ant Colony System(ACS). First State Transition considering the number of times that agents visit about each edge makes agents search more variously and widen search area. After setting up criteria which divide elite tour that receive Positive Intensification about each tour, we propose a method to do addition Intensification by the criteria. Implemetation of the algorithm to solve TSP and the performance results under various conditions are conducted, and the comparision between the original An and the proposed method is shown. It turns out that our proposed method can compete with the original ACS in terms of solution quality and computation speed to these problem.

• Journal of Nutrition and Health
• /
• v.35 no.1
• /
• pp.115-123
• /
• 2002

This study was carried out to investigate the utilization status of internet dietary information by gender(boys: 363, girls: 366) in adolescent(middle & high school students). The results were summarized as follows. The internet using frequency of 6-7times per week had 45.0% of subjects and the using time of internet per a time was shown mainly'<2hours(68.5%)'. The main place for internet use was home(79.0%) and favorite search engine was 'Yahoo'(45.7%) and 'Daum'(19.3%). As main purpose using internet were mentioned 'social intercourse'(45.0%) and data search'(24.8%). The organization that offer to reliable internet information was educational institution'(49.4%). The problems in using information site were 'poor information'(26.4%), 'slow connection speed'(22.6%), and 'don't arouse interest'(18.8%). The search experience about dietary information had only 27.9% of subjects and search purpose was 'for homework'(33.3%) and 'for health'(32.0). The satisfaction degree of dietary information was not high. The connection motive to dietary information was mainly 'by site navigation casualty'(55.7%). Only 7.7% of subjects had experience of nutrition counseling using internet, and the motive of nutrition counseling was also 'by site navigation causally'(55.8%). The purpose of counseling was 'for diet'(41.5%) and 'for health problem'(30.2%), and the satisfaction degree of counseling result was very low. As the ask of improvement for counseling site were pointed out 'poor in answer content'(44.8%) and 'lazy answer'(31.0%). The subjects wanted to get the dietary information about 'growth in status'(41.4%), 'diet related skin beauty'(14.6%), the update period less 1 month, and the way of 'free board'(32.3%), 'game'(21.1%) and 'animation'(19.3%) as offer tool. The results of this study showed that although the internet using percent and frequency of subjects was high, they used dietary information very seldom and they are dissatisfied with internet nutritional information. Therefore, the information donor should consider which dietary information was needed and what is the optimal tool for adolescent.

• The Journal of the Korea Contents Association
• /
• v.9 no.11
• /
• pp.54-62
• /
• 2009

To avoid the redundant investment on the project selection process, it is necessary to check whether the submitted research topics have been proposed or carried out at other institutions before. This is possible through the search engines adopted by the keyword matching algorithm which is based on boolean techniques in national-sized research results database. Even though the accuracy and speed of information retrieval have been improved, they still have fundamental limits caused by keyword matching. This paper examines implemented TFIDF-based algorithm, and shows an experiment in search engine to retrieve and give the order of priority for similar and redundant documents compared with research proposals, In addition to generic TFIDF algorithm, feature weighting and K-Nearest Neighbors classification methods are implemented in this algorithm. The documents are extracted from NDSL(National Digital Science Library) web directory service to test the algorithm.

• The KIPS Transactions:PartB
• /
• v.8B no.5
• /
• pp.515-522
• /
• 2001

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Map(SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data, and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. We implemented about k-NN search for similar image classification as to (1) access to topological feature map, and (2) apply to pruning strategy of high speed search. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1851-1856
• /
• 2013

An XML is widely used for web services, such as SOAP(Simple Object Access Protocol) and REST (Representational State Transfer), and also de facto standard for representing data. Since the XML parser using DOM(Document Object Model) requires a preprocessing task creating a DOM-tree, and then storing it into memory, embedded systems with limited resources typically employ a streaming XML parser without preprocessing. In this paper, we propose a new architecture for the streaming XML parser using an APSearch(Adaptive Parallel Search) on FPGA(Field Programmable Gate Array). Compared to other approaches, the proposed APSearch parser dramatically reduces overhead on the software side and achieves about 2.55 and 2.96 times improvement in the time needed for an XML parsing. Therefore, our APSearch parser is suitable for systems to speed up XML parsing.

• Journal of the Institute of Convergence Signal Processing
• /
• v.18 no.2
• /
• pp.62-67
• /
• 2017

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to tremendous computational amount of full search algorithm, efforts for reducing computations of motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate directly to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors for candidates with high priority. By doing that, we can find the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as the full search algorithm.