• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.213-216
• /
• 2004

Proirity queues(PQ) can be used in applications such as scheduling or sorting. The data structures for PQ can be constructed with or without pointers. The implicit representation without pointers uses less memory space than pointer-based representation. It if shown that a 2-heap, a traditional Implicit PQ based on a binary tree, is slower than an f-heap based on a 8-ary tree. This is because 8-heap utilizes cache memory more efficiently This paper presents a novel fast implicit heap called 8-heap＊ which is easier to implement. Experimental results show that the 8-heap＊ is faster than 8-heap as well as 2-heap.

• Korean Journal of Cognitive Science
• /
• v.10 no.4
• /
• pp.51-62
• /
• 1999

This paper proposes a fuzzy Petri net representation to represent the fuzzy production rules of a rule-based expert system. Based on the fuzzy Petri net representation. we present a fuzzy reasoning algorithms which consist of forward and b backward reasoning algorithm. The proposed algorithms. which use the proper belief evaluation functions according to fuzzy concepts in antecedent and consequent of a fuzzy production rule. are more closer to human intuition and reasoning than other methods. The forward reasoning algorithm can be represented by a reachability tree as a kind of finite directed tree. The backward reasoning algorithm generates the backward reasoning path from the goal to the initial nodes and then evaluates the belief value of the goal node using belief evaluation functions.

• The Journal of the Korea Contents Association
• /
• v.14 no.1
• /
• pp.14-23
• /
• 2014

There have been many researches for XML as the international standard to store and exchange data on the internet. Among these research fields, we focus on the techniques labeling the nodes of the XML tree that is required for querying the structural information. A labeling scheme assigns the unique label to the nodes and supports the queries for the structural information such as Ancestor-Descendant and Parent-Child relationships. In this paper, we propose a labeling scheme using vector representation where the assigned labels are not altered although XML documents are changed dynamically. Our labeling scheme reduces the storage requirement for the labels of the XML tree and provides the efficient query by using the fixed-length labels with a short size. Result of performance evaluation shows that our labeling scheme is superior to the previous approaches.

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

The syntactic pattern recognition system of Korean characters is composed of three main functional parts; Preprocessing, Graph-representation, and Segmentation. In preprocessing routine, the input pattern has been thinned using the Hilditch's thinning algorithm. The graph-representation is the detection of a number of nodes over the input pattern and codification of branches between nodes by 8 directional components. Next, segmentation routine which has been implemented by top down nondeterministic parsing under the control of tree grammar identifies parts of the graph-represented Pattern as basic components of Korean characters. The authors have made sure that this system is effective for recognizing Korean characters through the recognition simulations by digital computer.

• Nuclear Engineering and Technology
• /
• v.40 no.5
• /
• pp.327-348
• /
• 2008

A risk-informed regulatory approach implies that risk insights be used as supplement of deterministic information for safety decision-making purposes. In this view, the use of risk assessment techniques is expected to lead to improved safety and a more rational allocation of the limited resources available. On the other hand, it is recognized that uncertainties affect both the deterministic safety analyses and the risk assessments. In order for the risk-informed decision making process to be effective, the adequate representation and treatment of such uncertainties is mandatory. In this paper, the risk-informed regulatory framework is considered under the focus of the uncertainty issue. Traditionally, probability theory has provided the language and mathematics for the representation and treatment of uncertainty. More recently, other mathematical structures have been introduced. In particular, the Dempster-Shafer theory of evidence is here illustrated as a generalized framework encompassing probability theory and possibility theory. The special case of probability theory is only addressed as term of comparison, given that it is a well known subject. On the other hand, the special case of possibility theory is amply illustrated. An example of the combination of probability and possibility for treating the uncertainty in the parameters of an event tree is illustrated.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.809-812
• /
• 2008

통신 시스템에 대한 관심은 인터넷의 급격한 발전에 의해 가상공간의 출현과 유비쿼터스 컴퓨팅 환경 구축에 대한 요구가 증대됨에 따라 관련 이론 및 기술의 발전을 주도해 왔다. 이와 관련하여 가장 근간이 되는 문제들 중 하나는 최적 정보 통신 스패닝 트리 (OCST: Optimal Communication Spanning Tree) 설계 문제이다. 본 논문에서는 이러한 OCST 설계 문제를 네트워크 신뢰도를 고려하여 해결하기 위해 유전 알고리즘 (GA)를 이용한다. 본 논문에서는 유전 알고리즘을 이용함에 있어서 n개의 노드들로 구성된 네트워크 문제에서 n-2개의 숫자열로 표현 가능한 유전자 표현법을 이용하고 신뢰성 있는 OCST 설계 문제 해결을 위한 해법으로서 유전 알고리즘을 제안한다. 임의로 생성된 예제에 대한 수치 실험을 통해 통신시스템의 기본 문제 중 하나인 OCST 설계 문제의 해법으로서의 제안 알고리즘의 유용성과 효율성을 확인한다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.20-25
• /
• 2002

This paper presents a genetic programming based evolutionary strategy for on-line adaptive learnable evolvable hardware. Genetic programming can be useful control method for evolvable hardware for its unique tree structured chromosome. However it is difficult to represent tree structured chromosome on hardware, and it is difficult to use crossover operator on hardware. Therefore, genetic programming is not so popular as genetic algorithms in evolvable hardware community in spite of its possible strength. We propose a chromosome representation methods and a hardware implementation method that can be helpful to this situation. Our method uses context switchable identical block structure to implement genetic tree on evolvable hardware. We composed an evolutionary strategy for evolvable hardware by combining proposed method with other's striking research results. Proposed method is applied to the autonomous mobile robots cooperation problem to verify its usefulness.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.254-254
• /
• 2000

This paper presents a genetic programming based evolutionary strategy for on-line adaptive learnable evolvable hardware. genetic programming can be useful control method for evolvable hardware for its unique tree structured chromosome. However it is difficult to represent tree structured chromosome on hardware, and it is difficult to use crossover operator on hardware. Therefore, genetic programming is not so popular as genetic algorithms in evolvable hardware community in spite of its possible strength. We propose a chromosome representation methods and a hardware implementation method that can be helpful to this situation. Our method uses context switchable identical block structure to implement genetic tree on evolvable hardware. We composed an evolutionary strategy (or evolvable hardware by combining proposed method with other's striking research results. Proposed method is applied to the autonomous mobile robots cooperation problem to verify its usefulness.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.37-50
• /
• 2021

Query applications based on nested data, the most commonly used form of data representation on the web, especially precise query, is becoming more extensively used. MapReduce, a distributed architecture with parallel computing power, provides a good solution for big data processing. However, in practical application, query requests are usually concurrent, which causes bottlenecks in server processing. To solve this problem, this paper first combines a column storage structure and an inverted index to build index for nested data on MapReduce. On this basis, this paper puts forward an optimization strategy which combines query execution service tree and frequent sub-query trajectory to reduce the response time of frequent queries and further improve the efficiency of multi-user concurrent queries on large scale nested data. Experiments show that this method greatly improves the efficiency of nested data query.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.27-28
• /
• 2020

이형 데이터 간의 정보 전송과 교환을 가능하게 하는 유연한 트리 구조의 특성은 인터넷 및 IoT 환경에서의 대량 데이터 저장·전송·교환 등에 있어서 XML이나 JSON에서 주요하게 사용된다. 사용성에 있어서는 수월한 반면에, 감추어져 있는 가치있는 정보들을 트리 구조의 대량 데이터들로부터 찾아내는 것은 일반 단순 구조의 데이터에 비해서 훨씬 어려우며 복잡하고 난해한 문제들을 발생시킨다. 이는 트리가 갖는 계층 구조 때문이다. 본 논문에서는 계층 구조를 갖는 대량 트리 데이터들을 보다 단순한 리스트 구조로 변형한 후 해당 구조로부터 가장 자주 발생하는 유용한 정보들을 추출하는 방법을 제시한다.