• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.753-754
• /
• 2008

LiDAR data are acknowledged as very useful method to represent 3-D geographical information. In this paper aquad tree has been utilized to represent the 3-D spatial information. Compression algorithm is implemented based on a given threshold. The efficiency of compress is very high with large threshold values.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06b
• /
• pp.482-486
• /
• 2007

본 논문은 기존의 O-tree 표현법을 이용한 플로어플랜 알고리즘의 결점을 보완한 새로운 알고리즘을 제안한다. 기존의 방법에선 플로어플랜의 변형을 처리하는 과정에서 몇 가지 변형을 간과하기 때문에 좋은 해를 놓치는 경우가 발생한다. 본 논문에서는 기존의 방법을 수정하여 변형을 처리하는 과정에서 블록이 들어갈 수 있는 모든 위치를 고려하였다. 그 결과 MCNC 밴치마크 회로를 이용한 실험에서 총면적이 이전의 방법에 비해 평균 3% 개선되었다.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.390-396
• /
• 2008

Storybooks, especially those for children, may contain illustrations. An automated system for generating illustrations would help the production process of storybook publishing. In this paper, we propose a method for automatically generating layouts of objects during generating illustrations. In generated layouts, it is preferred to avoid unnecessary overlap between objects, corresponding to the spatial information in storybooks. We first define a representation scheme for spatial information in natural language sentences using tree structures and predicate-argument structures. Unification of tree structures and Region Connection Calculus are then used to manipulate the information and generate corresponding illustrations.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.805-812
• /
• 1989

An efficient diagnostic approach for real-time operation aiding expert system in chemical process plants is discussed. The approach is based on the hybrid of the simplified symptom tree(SST) and the fault consequence digraph(FCD), representation of propagation patterns of fault states. The SST generates fault hypothesis efficiently and the FCD resolve the real fault accurately. Frame based knowledge representation and object-oriented programming make diagnostic system general and efficient. Truth maintenance system enables robust pattern matching and provides enhanced explain facilities. A prototype expert system for supports operation of naphtha furnaces process, called OASYS, has been built and tested to demonstrate this methodology. Utilization of diversified process symbolic data, produced using dynamic normal standards, overcomes the problem of qualitative Boolean reasoning and enhance the applicability.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.4
• /
• pp.201-205
• /
• 2011

개인화된 제품과 서비스에 대한 소비자의 요구는 성공적인 전자상거래 플랫폼을 기반으로 하고 있다. 성공적인 전자상거래 플랫폼을 개발함에 있어 자주 간과되고 있는 중요한 요소는 바로 웹 페이지의 HTML 구조이다. HTML 구조는 전자상거래 웹사이트의 속도와 랭킹을 결정짓는 기본적인 요소이다. 본 논문은 HTML 구조를 분석하기 위한 효율적이고 다소 생소한 시각화 기법을 제안하는데, 이러한 기법을 사용하여 개발자는 잠재적인 프로그래밍 오류와 개선 사항을 발견할 수 있다. 본 논문은 하나의 사례를 이용하여 제안된 기법을 더욱 구체화 시킨다.

• Journal of applied mathematics & informatics
• /
• v.40 no.5_6
• /
• pp.883-896
• /
• 2022

A hereditary base-b representation, used in the celebrated Goodstein's theorem, can easily be converted into a labeled rooted tree. In this way it is possible to give a more elementary geometric proof of the aforementioned theorem and to establish a more general version, geometrically proved. This view is very useful for better understanding the underlying logical problems and the need to use transfinite induction in the proof. Similar problems will then be considered, such as the so-called "hydra game".

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.5
• /
• pp.494-499
• /
• 1990

A new compact hierarchical representation method image is proposed. This method represents a binary image with the set of decimal numbers. Each decimal number represents the pattern of nonterminal node(gray node) in the quadtree. This pattern implies the combination of its four child nodes. The total number of gray nodes is one third of that terminal nodes. We show that gray tree method is efficient comparing with others which have been studied.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.12
• /
• pp.1096-1100
• /
• 2012

Most of previous genetic algorithms for solving graph problems have used a vertex-based encoding. We proposed an edge encoding based new genetic algorithm using a spanning tree. Contrary to general edge-based encoding, a spanning tree-based encoding represents only feasible partitions. As a target problem, we adopted the MAX CUT problem, which is well known as a representative NP-hard problem, and examined the performance of the proposed genetic algorithm. The experiments on benchmark graphs are executed and compared with vertex-based encoding. Performance improvements of the spanning tree-based encoding on sparse graphs was observed.

• The KIPS Transactions:PartD
• /
• v.16D no.5
• /
• pp.673-682
• /
• 2009

XML data are widely used for data representation and exchange on the Web and the data type is an continuous stream in ubiquitous environment. Therefore there are some mining researches related to the extracting of frequent structures and the efficient query processing of XML stream data. In this paper, we propose a mining method to extract frequent structures of XML stream data in recent window based on the sliding window. XML stream data are modeled as a tree set, called XFP_tree and we quickly extract the frequent structures over recent XML data in the XFP_tree.

• Proceedings of the KSR Conference
• /
• 1998.11a
• /
• pp.280-287
• /
• 1998

In this paper, Dynamic Fault Tree algorithm(DFT algorithm) is presented. This new algorithm provides a concise representation of dynamic fault tolerance system structure with redundancy, dynamic redundancy management and complex fault ＆ error recovery techniques. And it allows the modeler to define a dynamic fault tree model with the relative advantages of both fault tree and Markov models that captures the system structure and dynamic behavior. This algorithm applies to TMR and Dual-Duplex systems with the dynamic behavior and show that this algorithm captured the dynamic behavior in these systems with fault ＆ error recovery technique, sequence-dependent failures and the use dynamic spare. The DFT algorithm for solving the problems of the systems is more effective than the Markov and Fault tree analysis model.