• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.382-390
• /
• 2005

Huffman codes are widely used for image and video data transmission. As the increase of real-time data, a lot of studies on effective decoding algorithms and architectures have been done. In this paper, we proposed a balanced binary search tree for Huffman decoding and compared the performance of the proposed architecture with that of previous works. Based on definitions of the comparison of codewords with different lengths, the proposed architecture constructs a balanced binary tree which does not include empty internal nodes, and hence it is very efficient in the memory requirement. Performance evaluation results using actual image data show that the proposed architecture requires small number of table entries, and the decoding time is 1, 5, and 2.41 memory accesses in minimum, maximum, and average, respectively.

• Korean Journal of Oriental Medicine
• /
• v.16 no.1
• /
• pp.69-84
• /
• 2010

It is the well-known truth that processing of raw information is needed to a certain extent during information search. Especially for Oriental Medical information, it becomes much clearer that even more complex processing is necessary. As a means of reducing such complexity, this study suggests a way to understand effectively the organic relationships among information found on the interface. In this process, 'knowledge-based archaeological' method has been used. A new concept of interface observed by this research is the study of a system which contains realistically considered knowledge-based archaeological and historical specificity. These models are organized so that search results could be materialized in different tree-structured interface models, which can help one understand the relationships among wanted search results at one glance and confirm the details of those results via mouse click. Strength of the vertical tree structure resides in its capability of suggesting its users clear historical relationship between separate Oriental medical information. The horizontal tree structure enables deeper understanding of sectional interrelationship of searched information. The strength of the prescription tree structure is that it helps one understand the lineage of prescriptions, as Oriental medicinal treatment is often summarized into changes in prescriptions.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.711-718
• /
• 2019

BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.651-665
• /
• 2003

To reduce cache misses emerges as the most important issue in today's situation of main memory databases, in which CPU speeds have been increasing at 60% per year, and memory speeds at 10% per year. Recent researches have demonstrated that cache-conscious index structure such as the CR-tree outperforms the R-tree variants. Its search performance can be poor than the original R-tree, however, since it uses a lossy compression scheme. In this paper, we propose alternatively a cache-conscious version of the R-tree, which we call MR-tree. The MR-tree propagates node splits upward only if one of the internal nodes on the insertion path has empty room. Thus, the internal nodes of the MR-tree are almost 100% full. In case there is no empty room on the insertion path, a newly-created leaf simply becomes a child of the split leaf. The height of the MR-tree increases according to the sequence of inserting objects. Thus, the HeightBalance algorithm is executed when unbalanced heights of child nodes are detected. Additionally, we also propose the CCMR-tree in order to build a more cache-conscious MR-tree. Our experimental and analytical study shows that the two-dimensional MR-tree performs search up to 2.4times faster than the ordinary R-tree while maintaining slightly better update performance and using similar memory space.

• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.147-160
• /
• 2008

BPMS(business process management system) facilitates defining new processes or updating existing processes. However, processing of exceptional or nonroutine task requires the intervention of domain experts or introduction of the situation specific resolution process. This paper assumes sufficient amount of business process exception handling cases are stored in the process repository. Since the retrieval of the best exception handling process requires a good understanding about the exceptional situation, context awareness is an important issue. To facilitate the understanding of exceptional situation and to enable the efficient selection of the best exception handling process, we adopted the 'situation variable' and 'decision variable' construct. A case example for exception handling in the e-commerce delivery process is provided to illustrate how the proposed construct works. Application of the C5.0 algorithm guarantees the construction of an optimum search tree. It also implies that an efficient search path has been identified for the context aware selection of the best exception handling process.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.87-93
• /
• 2002

A new approach of constructing a suffix tree $T_s$for the given string S is to construct recursively a suffix tree $ T_0$ for odd positions construct a suffix tree $T_e$ for even positions from $ T_o$ and then merge $ T_o$ and $T_e$ into $T_s$ To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets The hardest part of Farachs algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search) Our merging algorithm is more intuitive than Farachs coupled DFS (depth-first search ) merging and thus it can be easily extended to other applications.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.5
• /
• pp.409-415
• /
• 2009

The head-related transfer function (HRTF), which has an important role in virtual sound localization has different characteristics across the subjects. Measuring HRTF is very time-consuming and requires a set of specific apparatus. Accordingly, HRTF customization is often employed. In this paper, we propose a method to search an adequate HRTF from a set of the HRTFs. To achieve rapid and reliable customization of HRTF, all HRTFs in the database are partitioned, where a binary search tree was employed. The distortion measurement adopted in HRTF partitioning was determined in a heuristic way, which predicts the differences in perceived sound location well. The DC-Davis CIPIC HRTF database set was used to evaluate the effectiveness of the proposed method. In the listening test, where 10 subjects were participated, the stimuli filtered by the HRTF obtained by the proposed method were closer to those by the personalized HRTF in terms of sound localization. Moreover, performance of the proposed method was shown to be superior to the previous customization method, where the HRFT is selected by using anthropometric data.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.145-153
• /
• 2013

Multimedia contents' searching methods in existing mobile computer environment tend to be brought with many over heads when attempting to search data in large bulks. The MINT system has been studied to resolve such problem. However, MINT system delivers many over heads by searching multimedia contents through applying B-Tree. The suggested method is said to be CST-MCR searching system based on CST-Tree. The specific characteristic of this method is improved MINT system by applying CST-Tree's index. The result of capacity evaluation came out with improved capacity of 4.27% from MINT system and CST-MCR methods in average. Conclusively, it has been proven that the suggested method is superior.

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.25-32
• /
• 1990

This paper presents an approximate algorithm for computing Fault-tree probabilities. The method is essentially composed of three steps. In the first step, a Fault-tree is converted into a network form. In the second step, We change the network into a parallelized diagram. In the third step, the approximate fault-tree probability is calculated from the parallelized diagram. In this paper, in order to verify the method two hypothetical Fault-tree is used by examples. The results show that the method is very useful, even though it is an approximate technique, since it needs not to search the minimal cut sets and has the simple computing rontines.

• 한국데이터정보과학회:학술대회논문집
• /
• 2005.04a
• /
• pp.164-173
• /
• 2005

Data mining is the method to find useful information for large amounts of data in database. It is used to find hidden knowledge by massive data, unexpectedly pattern, relation to new rule. The methods of data mining are decision tree, association rules, clustering, neural network and so on. The decision tree approach is most useful in classification problems and to divide the search space into rectangular regions. Decision tree algorithms are used extensively for data mining in many domains such as retail target marketing, fraud detection, data reduction and variable screening, category merging, etc. We analyze waste database united with local information using decision tree techniques for environmental information. We can use these decision tree outputs for environmental preservation and improvement.