• Proceedings of the Safety Management and Science Conference
• /
• 2000.05a
• /
• pp.207-215
• /
• 2000

This study deals with the application of knowledge-engineering and a methodology for the assessment & measurement of reliability, availability, maintainability, and safety of industrial systems using fault-tree representation. A fuzzy methodology for fault-tree evaluation seems to be an alternative solution to overcome the drawbacks of the conventional approach(insufficient information concerning the relative frequences of hazard events). To improve the quality of results, the membership functions must be approximated based on heuristic considerations. The purpose of this Is to describe the knowlwdge engineering approach, directed to integrate the various sources of knowledge involved in a FTA.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.178-180
• /
• 2003

최소 걸침 나무는 널리 알려진 순회 판매원 문제와 같이 전통적인 최적화 문제 중에 하나이다. 특히나 최소 걸침 나무와는 달리 차수 제약 최소 걸침 나무의 경우는 일반적으로 NP-hard 문제로 알려져 있다. 이러한 NP-hard 문제를 해결하기 위한 다양한 접근법들이 소개되었는데 유전 알고리즘은 효율적인 방법 중에 하나로 알려져 있다. 유전 알고리즘과 같이 진화에 기반을 둔 알고리즘을 어떤 문제에 적응하기 위해서 가장 우선적으로 고려되어야 하는 것은 해를 어떻게 표현할 것인가 인데 본 논문에서는 차수 제약 최소 걸침 나무를 해결하기 위한 새로운 트리 표현법을 제안한다.

• Journal of the Korea Safety Management & Science
• /
• v.2 no.2
• /
• pp.1-10
• /
• 2000

This study deals with the application of knowledge engineering and a methodology for the assessment and measurement of reliability, availability, maintainability, and safety of industrial systems using fault-tree representation. A fuzzy methodology for fault-tree evaluation seems to be an alternative solution to overcome the drawbacks of the conventional approach (insufficient information concerning the relative frequence of hazard events). To improve the quality of results, the membership functions must be approximated based on heuristic considerations. The purpose of this study is to describe the knowledge engineering approach, directed to integrate the various sources of knowledge involved in a FTA.

• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.347-355
• /
• 2014

The general octree structure is common for various applications including computer graphics, geometry information analysis and query. Unfortunately, the general octree approach causes duplicated sample data and discrepancy between sampling and representation positions when applied to sample continuous spatial information, for example, signed distance fields. To address these issues, some researchers introduced the dual octree. In this paper, the weakness of the dual octree approach will be illustrated by focusing on the fact that the dual octree cannot access some specific continuous zones asymptotically. This paper shows that the primal tree presented by Lefebvre and Hoppe can solve all the problems above. Also, this paper presents a three-dimensional primal tree traversal algorithm based the Morton codes which will help to parallelize the primal tree method.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.67-75
• /
• 2008

In this paper, we propose an efficient URL lookup algorithm for URL list-based web contents filtering systems. Converting a URL list into URL prefix form and building a hash tree representation of them, the proposed algorithm performs tree searches for URL lookups. It eliminates redundant searches of hash table method. Experimental results show that proposed algorithm is $62%{\sim}210%$ faster, depending on the number of segment, than conventional hash table method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.1
• /
• pp.63-70
• /
• 2001

EZW(Embedded coding using Zero-trees of Wavelet coefficients) decreases symbol-position information using zero-trees, but threshold value fall lot raising resolution, then coding cost of significant coefficients is expensive. To avoide this fact, this paper uses quad-tree representing coefficient-position information. a magnitude of significant coefficient is represented on matrix used at EZW. the proposed algorithm is hoped for raising a coding cost.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.833-835
• /
• 2002

In this paper, we propose multi-resolutional representation of B-rep solid models using the selective Boolean operations on non-manifold geometric models. Since the union and subtraction operations of the selective Boolean operations are commutative, the integrity of the model is guaranteed for reordering design features. A multi-resolution representation is established using a non-manifold merged set model and a feature modeling tree reordered according to some criterion of level of detail (LOD). Then, a solid model for a specified LOD can be extracted from this multi-resolution model using the selective Boolean operations.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.615-617
• /
• 2000

Temporal Logic Frameworks is convenient to represent temporal relation. It is useful to represent a dynamic properties of Discrete Event Dynamic Systems. Also, it is convenient to express a current and next state of event using logical representation. Because the teachability tree of the Temporal Logic Frameworks is very complexity it is difficult to understand. In this paper, we defined some rules to represent Temporal Logic Frameworks by Petri Net and proposed am method of the representation of them Petri Net for the Temporal Logic Frameworks. An example are used to demonstrate the feasibility of this method.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.86-92
• /
• 2015

A level set tree provides a useful representation of a multidimensional density function. Visualizing the data structure as a tree offers many advantages for data analysis and clustering. In this paper, we present a level set tree estimation algorithm for use with a set of data points. The proposed algorithm creates a level set tree from a family of level sets estimated over a whole range of levels from zero to infinity. Instead of estimating density function then thresholding, we directly estimate the density level sets using one-class support vector machines (OC-SVMs). The level set estimation is facilitated by the OC-SVM solution path algorithm. We demonstrate the proposed level set tree algorithm on benchmark data sets.

• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.237-248
• /
• 2010

When scenes in the real world are perceived for the purpose of computer/robot vision fields, there are great deals of texture based patterns in them. This paper introduces a texture feature representation on a coordinate system in which many different patterns can be represented with a mathematical model (Gabor function). The representation of texture features of each pattern on the coordinate system results in the high performance/competence of texture pattern classification. A decision tree algorithm is used to classify pattern data represented on the proposed coordinate system. The experimental results for the texture pattern classification show that the proposed method is better than previous researches.