• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.333-338
• /
• 2001

Fault tree is a widely used methodology for analyzing product reliability. The fault trees are usually constructed using the experiences of expert reliability engineers in top-down approaches and have different structures according to each expert's subjectivity. In this work it is tried to find a general method for the fault tree construction based on the function tree that is the result of product function deployment. Based on the function tree, the method has the advantage of resulting an objective fault tree since the faults are defined as the opposite concept of functions. The fault tree construction of this work consists of the following steps: 1) definition of product primary function with the viewpoints of product operation and configuration, 2) construction of functional relation chart using a grouping algorithm, 3) abstraction of functional block diagram according to operation sequences and configuration of a product, 4) construction of function tree for each viewpoint, and 5) construction of fault tree by matching the function tree and simplification of the result.

• Journal of the Ergonomics Society of Korea
• /
• v.19 no.3
• /
• pp.61-75
• /
• 2000

To enhance web site's usability, it has been suggested that the depth of tree structured menus should be minimized. In this research, experimental results are reported to quantitatively compare the methods currently used for reducing the depth of menus in web sites. 25 popular web sites were selected and their menu types were categorized into four types: top menu, drop-down menu, boolean menu, and table of contents. The four types of menu were then sub-categorized into 15 different types according to their sub-menu type, existence of menu colors, and the event occurring after mouse activation. Performance tests and subjective evaluation were carried out. The results showed that there were no significant differences in terms of response time among the 15 menu types, while table of contents and drop-down in which the first and second level of menus were visible induced the least number of errors. In the subjective test, the top-menu structure with colors and presentation of its sub-menu without clicking mouse were preferred.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.4
• /
• pp.63-69
• /
• 1998

The area optimization of the power distribution network is an important problem in the layout design of VLSI systems. In this paper we propose noval methods to solve the problem of designing minimal area power distribution nets, while satisfying voltage drop and electromigration constraints. We propose two novel greedy heuristics for power net design-one based on bottom-up tree construction using greedy merging and the other based on top-down linearly separable partitioning.

• Journal of KIISE:Databases
• /
• v.29 no.5
• /
• pp.367-380
• /
• 2002

Due to recent increase in applications requiring huge amount of data such as spatial data analysis and image analysis, clustering on large databases has been actively studied. In a hierarchical clustering method, a tree representing hierarchical decomposition of the database is first created, and then, used for efficient clustering. Existing hierarchical clustering methods mainly adopted the bottom-up approach, which creates a tree from the bottom to the topmost level of the hierarchy. These bottom-up methods require at least one scan over the entire database in order to build the tree and need to search most nodes of the tree since the clustering algorithm starts from the leaf level. In this paper, we propose a novel top-down hierarchical clustering method that uses multidimensional indexes that are already maintained in most database applications. Generally, multidimensional indexes have the clustering property storing similar objects in the same (or adjacent) data pares. Using this property we can find adjacent objects without calculating distances among them. We first formally define the cluster based on the density of objects. For the definition, we propose the concept of the region contrast partition based on the density of the region. To speed up the clustering algorithm, we use the branch-and-bound algorithm. We propose the bounds and formally prove their correctness. Experimental results show that the proposed method is at least as effective in quality of clustering as BIRCH, a bottom-up hierarchical clustering method, while reducing the number of page accesses by up to 26～187 times depending on the size of the database. As a result, we believe that the proposed method significantly improves the clustering performance in large databases and is practically usable in various database applications.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.99-108
• /
• 1997

An efficient wavelet packet algorithm to find wavelet packet quickly is presented in this paper. The top-down method maximizing the transform coding gain that is obtained from the second moment of the band is used to divide the subbands into wavelet tree. The bit allocation for each band in the tree is performed in proportion to its variance. Bands are coded by the lossless coding algorithm called the bit plane run length coding(BPRLC) and uniform quantizer. The proposed algorithm is compared with of the single tree algorithim proposed by Ramchandran and Vetterli. To verify the efficiency of our algorithm, simulations are jperformed using several sets of images. The results show us that our method reduces the execution time by about forty percent of that required by the single tree method while maintaining the comparable reconstructed image qualities.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.10
• /
• pp.591-597
• /
• 2003

In this paper, a best-basis selection algorithm that improves the performance of the coding gains and the computational complexity is proposed. The proposed algorithm limits the computational complexity according to the resolved threshold value and decomposes the parent subbands by using the top-down tree search and the relative energy between the parent subbands and the child subbands. For the experiments of the proposed algorithm, the bit-rates, the peak signal-to-noise ratio (PSNR), and the reconstructed images are presented by using the Quad-tree coder. The result of the proposed algorithm is compared to that of DWT algorithm using the Quad-tree coder for a set of standard test images. In addition, the result of the proposed algorithm is compared to that of JPEG-2000 algorithm and that of S+P algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.5A
• /
• pp.738-744
• /
• 2001

멀티캐스팅이란 일대일의 전형적인 통신 모델과 one-to-all 방식의 브로드캐스팅의 중간적인 일대다 통신 모델이다. 여러 가지 통신 어플리케이션에서 멀티캐스팅 서비스를 제공하기 위해서는 많은 요구사항이 필요하며, 이를 위하여 여러 가지 멀티캐스팅 프로토콜이 연구되어 왔다. 그 중 신뢰도를 보장하기 위하여 논리적인 트리를 구성하고, 이러한 계층적 트리 기반의 복구 메커니즘을 이용하여 오류를 복구, 흐름 및 혼잡을 제어하는 방식이 Tree-based Multicasting Protocol이다. 본 논문에서는 Tree-based Multicasting Protocol에서 기본이 되는 논리적 트리를 구성하는데 있어 Top-down 방식을 따르는 프로토콜과 Bottom-up 방식을 따르는 프로토콜의 트리 구성 방식을 살펴보고, 시뮬레이션을 통하여 멀티캐스팅 그룹에 참여하는 노드수가 증가함에 따라 트리 구성시 교환되는 메시지 수와 트리 구성 지연 시간, 트리 Depth 등을 비교하였다.

• Annual Conference on Human and Language Technology
• /
• 1994.11a
• /
• pp.426-433
• /
• 1994

본 논문에서는 트리의 점증적인 합성에 의하여 파싱을 진행시켜 나가는 파싱 방법을 소개하며 이의 한국어 파싱에의 응용을 살펴 본다. 이와 같은 트리 합성 파싱(tree combining parsing)을 지원하기 위한 문법인 트리 합성 문법(Tree Combining Grammar)을 소개한다. 우리는 먼저 문맥 자유 문법을 작성한 후 이로부터 자동적인 변환에 의하여 트리 합성 문법을 얻는 과정을 취한다. 따라서 트리 합성 파싱은 일종의 문맥 자유 파싱(context-free parsing)으로 볼 수 있으나 점증성(incremental), 하향성(top-down), 상향성(bottom-up), 유연성(flexible) 등과 같은 장점을 갖고 있다. 트리 합성 파싱의 유연성을 기반으로 하여 부분 자유 어순, 중심어 후행성과 같은 특성을 가진 한국어를 효과적으로 파싱할 수 있도록 트리 합성 파싱을 확장하는 방법을 살펴본다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2253-2261
• /
• 1999

ACK generates optimized code using the string pattern matching technique in pattern table generator and peephole optimizer. But string pattern matching method is not effective due to the many comparative actions in pattern selection. We designed and implemented the EM intermediate code optimizer using tree pattern matching algorithm composed of EM tree generator, optimization pattern table generator and tree pattern matcher. Tree pattern matching algorithm practices the pattern matching that centering around root node with refer to the pattern table, with traversing the EM tree by top-down method. As a result, compare to ACK string pattern matching methods, we found that the optimized code effected to pattern selection time, and contributed to improved the pattern selection time by about 10.8%.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.97-108
• /
• 2004

This paper proposes to use an algorithmic debugging technique for locating logical errors in Java programs. The algorithmic debugging is a semi-automated debugging technique that builds an execution tree from a source program and locates logical errors, if any, included in the program from the execution tree with top-down method. So, it is very important to build a suitable execution tree from the various programming languages. In this paper we propose the method for building an execution tree iron Java programs and walk through an example. This approach could reduce the number of interactions between a user and a debugging system than the traditional step-wise debugging technique.