• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.34-42
• /
• 2007

The sphere decoder (SD) has recently been proposed to perform maximum likelihood (ML) decoding for multi-input multi-output systems. Employing a 'breadth-first' searching algorithm for closet points in a lattice, we propose a novel ML decoding scheme for multi-input multi-output systems. Simulation results show that the proposed scheme has the same bit error rate performance as the conventional ML decoders while allowing significantly lower computational burden than the SD.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1C
• /
• pp.37-47
• /
• 2011

In this paper, we propose a novel ML decoding scheme based on the combination of depth- and breadth-first search methods on a partitioned tree for multiple input multiple output systems. The proposed scheme first partitions the searching tree into several stages, each of which is then searched by a depth- or breadth-first search method, possibly exploiting the advantages of both the depth- and breadth-first search methods in an organized way. Numerical results indicate that, when the depth- and breadth-first search algorithms are adopted appropriately, the proposed scheme exhibits substantially lower computational complexity than conventional ML decoders while maintaining the ML bit error performance.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.18 no.5
• /
• pp.15-21
• /
• 1981

This paper deals with the syntactic analysis algorithms of Korean sentence and system for machine translation. The parts of speech and constituients are syntactically analized at unified view-points and then an effective classification algorithm is proposed. The constituients which are applied an inverse movement transformation algorithm are processed with the concept of attribute. Syntactic analysis system is constructed to generate parsing table including the deep structure of sentence by lexicon proper to the combinational property of Korean and breadth-first searching method. The results obtained from the system program are shown as the parsing table of source sentences.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.6
• /
• pp.49-55
• /
• 2017

Robots, games and life applications have been developed while computer areas are developed. Moreover, various applications have been utilized for various users including the early childhood. Recently, smart phones have been dramatically used by various users including early childhood. Many applications need to find a path from a starting point to destinations. For example, without using real maps, users can find the direct paths for the destinations in realtime. Specifically, path exploration in game programs is so important to have accurate results. Nowadays, with these techniques, diverse applications for educations of early childhood have been developed. To deal with the functions, necessity of efficient path search programs with high accuracy becomes much higher. In this paper, we design and develop a friendly maze program for early childhood based on a path searching algorithm. Basically, the path of lineal distance from a starting location to destination is considered. Moreover, weight values are calculated by considering heuristic weighted h(x). In our approach, A* algorithm searches the path considering weight values. Moreover, we utilize depth first search approach instead of breadth first search in order to reduce the search space. so it is proper to use A* algorithm in finding efficient paths although it is not optimized paths.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.3
• /
• pp.425-438
• /
• 1993

Due to the producer-consumer dependency of shared variables, the potential parallelism embeded in the logic programming language has not been fully examined. The method proposed in this paper eliminates the dependency of shared variables by introducing number-sequenced variables in expanding an AND-OR proof tree. Basically, the execution of a logic program can be divided into two phases : expanding an AND-OR tree and proving the tree by matching facts with leaf nodes. In the course of the first phase, a set of number-sequenced variables are produced by expanding an AND-OR tree in the breadth-first searching. Based on the information of number-sequence, each of them is verified in the second phase in order to prove the tree. Consequently, the proposed algorithm can explore more parallelism without the dependency of shared variables.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.119-132
• /
• 2007

In molecular biology, approximate subsequence search is one of the most important operations. In this paper, we propose an accurate and efficient method for approximate subsequence search in large DNA databases. The proposed method basically adopts a binary trie as its primary structure and stores all the window subsequences extracted from a DNA sequence. For approximate subsequence search, it traverses the binary trie in a breadth-first fashion and retrieves all the matched subsequences from the traversed path within the trie by a dynamic programming technique. However, the proposed method stores only window subsequences of the pre-determined length, and thus suffers from large post-processing time in case of long query sequences. To overcome this problem, we divide a query sequence into shorter pieces, perform searching for those subsequences, and then merge their results. To verify the superiority of the proposed method, we conducted performance evaluation via a series of experiments. The results reveal that the proposed method, which requires smaller storage space, achieves 4 to 17 times improvement in performance over the suffix tree based method. Even when the length of a query sequence is large, our method is more than an order of magnitude faster than the suffix tree based method and the Smith-Waterman algorithm.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.11
• /
• pp.596-603
• /
• 2004

This paper proposes an expert system based on the pattern recognition method which can enhance the accuracy and effectiveness of real-time bus reconfiguration strategy for the transfer of faulted load when a main transformer fault occurs in the automated substation. The minimum distance classification method is adopted as the pattern recognition method of expert system. The training pattern set is designed MTr by MTr to minimize the searching time for target load pattern which is similar to the real-time load pattern. But the control pattern set, which is required to determine the corresponding bus reconfiguration strategy to these trained load pattern set is designed as one table by considering the efficiency of knowledge base design because its size is small. The training load pattern generator based on load level and the training load pattern generator based on load profile are designed, which are can reduce the size of each training pattern set from max L/sup (m+f)/ to the size of effective level. Here, L is the number of load level, m and f are the number of main transformers and the number of feeders. The one reduces the number of trained load pattern by setting the sawmiller patterns to a same pattern, the other reduces by considering only load pattern while the given period. And control pattern generator based on exhaustive search method with breadth-limit is designed, which generates the corresponding bus reconfiguration strategy to these trained load pattern set. The inference engine of the expert system and the substation database and knowledge base is implemented in MFC function of Visual C++ Finally, the performance and effectiveness of the proposed expert system is verified by comparing the best-first search solution and pattern recognition solution based on diversity event simulations for typical distribution substation.

• Journal of Sasang Constitutional Medicine
• /
• v.10 no.2
• /
• pp.181-220
• /
• 1998

1. PURPOSE This is a quantitative analysis of Sasang Constitution by measuring human body except face. This study is carried out for the purpose of searching out the theory of Sa-cho and the morphologic theory of Sasang Constitution. 2. METHOD (1) SUBJECTS Subjects are 338 person came to Dept. of Sasang Constitutional Medicine (KyungHee Oriental Medical Center) and Oriental Medicine and Western Medicine Cooperative Health Examination Center (KyungHee Medical Center) from October 1997 to Jauary 1998. The mean age is $41.7{\pm}12.39$. (2) CLASSIFICATION OF SASANG CONSTITUTION QSCCII(Questionnaire for the Sasang Constitution Classification) is used for the Classification of Sasang Constitution. The distributions of Sasang Constitution Classification are Soeumin 83, Soyangin 98, and Taeumin 157. (3) MEASURING INSTRUMENT & ITEMS Length, Breadth, Circomferece, and Skinfold thickness of each body segment are measured by Martin's measuring instrument and Skinfold Caliper. Measured items of this study is based on Lohman's methods and is added new items. (4) DATA ANALYSIS The Volume, Weight, Rate, and Index of each group are calculated by using measuring items. The difference of each group is analyzed by SPSS 7.0 for Win. 3. RESULT (1) THE MORPHOLOGIC CHARACTERISTIC of TAEUMIN First of all, the Taeumin has a emormous morphology. His trunk is huge but head-neck and limbs is small. The volume and weight of head-neck is smaller than other body segments but the volume and weight of upper-abdomen is bigger than ones. (2) THE MORPHOLOGIC CHARACTERISTIC of SOEUMIN The Soeumin has a small morphology. His head-neck rate is bigger than Taeumin's but his trunk rate is smaller than Taeumin's. And his lower limbs rate is bigger than other constitution but it's not a significant difference. His neck is thinest and longgest than others. His chest is thin and narrow. His lower-abdomen rate is bigger than other constitution but it's difference is not significant. (3) THE MORPHOLOGIC CHARACTERISTIC of SOYANGIN Soyangin has a middle size at head-neck and chest part. But the rate of upper limb is higer than other constitution. And the rate of lower-abdomen part is lower than other constitution. but that's not significant.