• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.926-937
• /
• 1996

A graph traversal technique is a certain pattern of visiting nodes of a graph. Many special traversal techniques have been applied to solve graph related problems. For example, the depth first search technique has been used for finding strongly onnected components of a directed graph or biconnected components of a general graph. The distributed protocol to implement his depth first search technique on the distributed network can be divided into a fixed topology problem where there is no topological change and a dynamic topology problem which has some topological changes. Therefore, in this paper, we present a more efficient distributed depth first search protocol with fixed topology and a resilient distributed depth first search protocol where there are topological changes for the distributed network. Also, we analysed the message and time complexity of the presented protocols and showed the improved results than the complexities of the other distributed depth first search protocols.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.172-178
• /
• 2005

순환탐색 알고리즘 및 스택기반 알고리즘 등은 유방향그래프에서 순환과 순환경로를 발견하는 특정 정점으로부터 출발하여 연결된 그래프에서 순환을 탐색하는 것이다. 기존 연구의 단점은 모든 순환을 다 찾아내지지 못하는 경우라든지, 동일한 순환을 중복해서 찾아내는 문제가 있었다. 본 연구에서 제시하는 정점제거 순환탐색 알고리즘은 특정 정점의 순환을 발견한 뒤 그 정점을 삭제하므로 중복된 순환을 발견하지 않고 모든 순환을 찾을 수 있다. 또한 순환을 발견했을 때, 순환경로를 출력하는데 있어서 스택의 인덱스를 이용해, 저장경로를 탐색하지 않고 출력하는 방법을 제안하였다. 실험에서는 임의의 정점과 간선을 생성하여 그래프로 만들고, 각 알고리즘에 따른 모든 정점을 찾을 수 있는지, 그래프 상황에 따라 어떠한 장단점이 있는지, 간선이 많아질수록 인덱스 순환탐색 알고리즘보다 탐색시간이 얼마나 차이를 보이는지를 확인하였다. 웹 구조처럼 일정한 크기의 웹페이지와 많은 수의 링크가 존재하는 그래프에서 정점제거 순환탐색 알고리즘이 순환을 찾는데 적합하다는 것을 입증했다.

• Journal of the Korea Computer Graphics Society
• /
• v.10 no.2
• /
• pp.51-56
• /
• 2004

모션 데이터들을 그래프로 저장하고 이를 모션합성에 이용하는 기존의 연구들은, 모든 모션 프레임간 연결비용계산으로 인하여 그래프 생성에 많은 시간이 걸린다는 단점이 있다. 본 논문에서는 이런 단점을 보완하여 빠르고 효과적으로 그래프를 생성하는 방법을 제시한다. 우선, PCA를 이용하여 모션들을 2차원에 투영시키고, 2차원 상의 간단한 거리계산으로 전이에지가 존재할 가능성이 큰 프레임 쌍들을 찾아낸다. 다음으로, 이런 프레임 쌍에 대해서만 연결비용을 계산하여 그래프를 생성한다. 따라서, 모든 프레임에 대한 비용계산에 비해 본 논문에서 제안한 방법은 효율적으로 그래프를 생성하게 된다.

• Journal of Internet Computing and Services
• /
• v.17 no.4
• /
• pp.51-60
• /
• 2016

Embedded software has requirements such as real-time and environment independency. The real-time requirement is affected from worst-case execution time of loaded tasks. Therefore, to guarantee real-time requirement, we need to determine a program's worst-case execution time using static analysis approach. However, the existing methods for worst-case execution time analysis do not consider the environment independency. Thus, in this paper, in order to provide environment independency, we propose a method for measuring task's execution time from the source codes. The proposed method measures the execution time through the control flow graph created from the source codes instead of the executable codes. However, the control flow graph created from the source code does not have information about execution time. Therefore, in order to provide this information, the proposed method identifies the relationships between statements in the source code and instructions in the executable code. By parameterizing those parts that are dependent on processors based on the relationships, it is possible to enhance the flexibility of the tool that measures the worst-case execution time.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.341-346
• /
• 2004

Recently A Hyper-Star Graph HS(m, k) has been introduced as a new interconnection network of new topology for parallel processing. Hyper-Star Graph has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show that Hyper-Star Graph HS(m, k) is subgraph of hypercube. And we also show that regular graph, Hyper-Star Graph HS(2n, n) is node-symmetric by introduced mapping algorithm. In addition, we introduce an efficient one-to-all broadcasting scheme - takes 2n-1 times - in Hyper-Star Graph HS(2n, n) based on a spanning tree with minimum height.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.4
• /
• pp.637-644
• /
• 2019

This paper describes an implementation of a graph-based simultaneous localization and mapping(SLAM) method called the General Graph Optimization. The General Graph Optimization formulates the SLAM problem using nodes and edges. The nodes represent the location and attitude of a robot in time sequence, and the edge between the nodes depict the constraint between the nodes. The constraints are imposed by sensor measurements. The General Graph Optimization solves the problem by optimizing the performance index determined by the constraints. The implementation is verified using the measurement data sets which are open for test of various SLAM methods.

• Journal of The Korean Association For Science Education
• /
• v.25 no.2
• /
• pp.122-132
• /
• 2005

Graphing abilities are critical to understand and convey information in science. And then, to what extent are secondary students in science courses able to understand line graphs? To find clues about the students' interpretation processes of the information in science-related line graphs, this study has the following research question: Is there a difference between the levels of complexity of good and poor readers as they use the thinking aloud method for studying cognitive processes? The present study was designed to provide evidence for the hypothesis that good line graph readers use a specific graph interpretation process when reading and interpreting line graphs. With the aid of the thinking aloud method we gained deeper insight into the interpretation processes of good and poor graph readers while verifying verbal statements with respect to line graphs. The high performing students tend to read much more information and more trend-related information than the low performing students. We support the assumption of differential line graph schema existing in the high performing students in conjunction with general graph schema. Also, high performing students tend to think aloud much more metacognitively than low performing students. High performing students think aloud a larger quantity of information from line graphs than low performing students, and more trend-related sentences than value-related sentences from line graphs. The differences of interpretation processes revealed between good and poor graph readers while reading and interpreting line graphs have implications for instructional practice as well as for test development and validation. Teaching students to read and interpret graphs flexibly and skillfully is a particular challenge to anyone seriously concerned with good education for students who live in an technological society.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04b
• /
• pp.466-468
• /
• 2000

이 논문에서는 Helmholtz machine을 사용하여 데이터의 분포 추정을 함으로써 문서 분류기를 학습하는 방법 제안한다. Helmholtz machine 은 생성 모델과 인식 모델로 구성된 그래프 모델로서, 그래프 모델에서의 분포 추정을 보다 가능하게 하기 위한 근사 방법 중의 하나이다. Helmholtz machine에서의 각 입력 노드는 문서를 구성하는 하나의 단어에 대응하는 이진 노드이다. 입력 노드의 개수가 많아지면 그만큼 학습 시간이 증가하기 때문에, 학습 시간을 줄이면서 적정 수준의 성능을 유지하기 위해 자질 선정이 필요하다. 이러한 요구 사항을 충족시키기 위해 정보획득량(information gain)기준을 이용하였으며, 뉴스 그룹 데이터에 대해 그 성능을 측정하고 Naive Bayes를 이용한 것과 비교한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.334-336
• /
• 2002

본 논문에서는 스타그래프 다중처리시스템을 위한 새로운 프로세서 할당방범을 제안한다. 기존의 할당방법은 프로세서 단편화로 인해 작업을 처리할 서브스타를 형성하지 못하면 프로세서 할당이 지연되는 문제점이 있었다. 이러한 할당 지연은 작업의 대기시간을 증가시키고 시스템의 성능 향상을 제한한다. 본 논문에서 제안하는 할당방법은 프로세서 할당 지연이 발생하면 동적할당테이블을 사용하여 단편화된 프로세서의 주소론 재생성한다. 새로운 주소의 프로세서들로 가용 서브스타를 형성하여 할당함으로써 작업의 대기시간을 줄이고 프로세서 단편화를 최소화한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.216-226
• /
• 2000

This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a deterministic signal transition graph specification with timing constraints. First, a timing analysis extracts the timed concurrency and timed causality relations between any two signal transitions. Then, a hazard-free implementation under the timing constraints is synthesized by constructing a precedence graph and finding paths in the graph. The major result of this work is that the method does not suffer from the state explosion problem, achieves significant reductions in synthesis time, and generates circuits that have nearly the same area as compared to previous methods.