• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.213-217
• /
• 2007

소프트웨어 테스팅은 소프트웨어의 개발 과정에 있어서 가장 중요하고 많은 비용이 드는 부분이다. 소프트웨어 테스팅을 수동으로 행하는 것은 많은 문제를 발생시킬 수 있다. 소프트웨어 자동 테스팅을 하기 위해서 최근 활발히 연구되고 있는 부분이 모델 기반 소프트웨어 자동 테스팅 기법이다. 본 논문에서는 UML 모델 기반 테스트 케이스 자동 생성 기법을 제안한다. UML state chart 로 모델링 된 테스트 대상 소프트웨어를 제안된 자료구조에 저장 한 후, 이를 flow graph 로 변환한다. 최종적으로 변환된 flow graph 에서 테스트 케이스를 생성한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.120.3-120
• /
• 2001

We propose a new method of path planning for cleaning robots. Path planning problem for cleaning robots is different from conventional path planning problems in which finding a collision-free trajectory from a start point to a goal point is focused. In the case of cleaning robots, however, a planned path should cover all area to be cleaned. To resolve this problem in a systematic way, we propose a method based on a graph model as follows: at first, partition a given map into proper regions, then transform a divided region to a vertex and a connectivity between regions to an edge of a graph. Finally, a region is divided into sub-regions so that the graph has a unary tree which is the simplest Hamilton path. The effectiveness of the proposed method is shown by computer simulation results.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1004-1008
• /
• 1990

This research focuses on developing a new and computationally efficient algorithm for free space structuring and planning collision free paths for an autonomous mobile robot working in an environment populated with polygonal obstacles. The algorithm constructs the available free space between obstacles in terms of free convex area. A collision free path can be efficiently generated based on a graph constructed using the midpoints of common free links between free convex area as passing points. These points correspond to nodes in a graph and the connection between them within each convex area as arcs in this graph. The complexity of the search for collision free path is greatly reduced by minimizing the size of the graph to be searched concerning the number of nodes and the number of arcs connecting them. The analysis of the proposed algorithm shows its efficiency in terms of computation ability, safety and optimality.

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.05a
• /
• pp.85-90
• /
• 2003

In this paper we develop a method for finding optimal ordering of K statistical models. This is based on a dependent paired comparison experimental arrangement whose results can naturally be represented by a completely oriented graph (also so called tournament graph). Introducing preference probabilities, strong transitivity conditions, and an optimal criterion to the graph, we show that a Hamiltonian path obtained from row sum ranking is the optimal ordering. Necessary theories involved in the method and computation are provided. As an application of the method, generalized variances of K multivariate normal populations are compared by a Bayesian approach.

• Journal of applied mathematics & informatics
• /
• v.35 no.1_2
• /
• pp.25-32
• /
• 2017

Let G be a graph and k is a positive integer. Hammack and Livesay in [The inner power of a graph, Ars Math. Contemp., 3 (2010), no. 2, 193-199] introduced a new graph operation $G^{(k)}$, called the $k^{th}$ inner power of G. In this paper, it is proved that if G is bipartite then $G^{(2)}$ has exactly three components such that one of them is bipartite and two others are isomorphic. As a consequence the edge frustration index of $G^{(2)}$ is computed based on the same values as for the original graph G. We also compute the first and second Zagreb indices and coindices of $G^{(2)}$.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.1037-1067
• /
• 2017

Motzkin and Straus established a close connection between the maximum clique problem and a solution (namely graph-Lagrangian) to the maximum value of a class of homogeneous quadratic multilinear functions over the standard simplex of the Euclidean space in 1965. This connection and its extensions were successfully employed in optimization to provide heuristics for the maximum clique problem in graphs. It is useful in practice if similar results hold for hypergraphs. In this paper, we develop a homogeneous multilinear function based on the structure of hypergraphs and their complement hypergraphs. Its maximum value generalizes the graph-Lagrangian. Specifically, we establish a connection between the clique number and the generalized graph-Lagrangian of 3-uniform graphs, which supports the conjecture posed in this paper.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.427-429
• /
• 2001

지금까지 가상현실을 이용한 여러 가지 시스템들이 제안되어 왔다. 하지만 이러한 시스템들은 사용자에게 몰입감을 줄 수 있는 예측하기 힘든 다양한 상황을 제공하기보다는 미리 정해진 시나리오를 따라 고정된 형태의 흐름을 가지는 문제점이 있었다. 이를 해결하기 위해가상세계 내에서의 오브젝트의 행동이나 이벤트의 전개를 위한 여러 가지 방법들이 제안되어왔다. 하지만 이 방법들 역시 방대한 탐색 공간이나 한정된 범위내에서만 자율적인 움직임이 가능한 점 등의 문제점을 가지고 있다. 본 논문에서는 이를 해결하기 위하여 Causality에 기반한 이벤트의 전개모델을 제안한다. 이를 위해 본 논문은 먼저 frame구조를 이용하여 정형화한 Structured Causal Graph를 제안하고, 구성되어진 Structured Causal Graph를 이용하여 이벤트를 전개해나가는 방법을 제시한다.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.145-153
• /
• 1998

An approach has been developed to generate parametric models with Boolean operations. The approach combines Boolean operations and graph manipulation on the constraints imposed on primitives. A Boolean operation is first performed on two primitives and new geometric elements such as vertices and edges are computed. Then to generate the constraint graph of the polygon the each constraints graph of two primitives are merged by adding the new geometric elements with its corresponding constraints. In the merging process, some of the geometric elements belonging to the primitives may be eliminated based on its contribution to the polygon. A computer implementation in a 2D space is described to illustrate the approach with examples.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.2
• /
• pp.231-241
• /
• 2011

Business processes are often of long duration, and include internal worker's decision making, which makes business processes to be exposed to many exceptional situations. These properties of business processes makes it difficult to guarantee successful termination of business processes at the design phase. The behavioral properties of business processes mainly depends on the data aspects of business processes. To formalize the data aspect of process modeling, this paper proposes a graph-based model, called Data Dependency Graph (DDG), constructed from dependency relationships specified between business data. The paper also defines a mechanism of describing a set of mapping rules that generates a process model semantically equivalent to a DDG, which is accomplished by allocating data dependencies to component activities.

• Journal of Information Science Theory and Practice
• /
• v.6 no.1
• /
• pp.18-30
• /
• 2018

Interest in open data is continuing to grow around the world. In particular, open government data are considered an important element in securing government transparency and creating new industrial values. The South Korean government has enacted legislation on opening public data and provided diversified policy and technical support. However, there are also limitations to effectively utilizing open data in various areas. This paper introduces an administrative district knowledge model to improve the sharing and utilization of open government data, where the data are semantically linked to generate a knowledge graph that connects various data based on administrative districts. The administrative district knowledge model semantically models the legal definition of administrative districts in South Korea, and the administrative district knowledge graph is linked to data that can serve as an administrative basis, such as addresses and postal codes, for potential use in hospitals, schools, and traffic control.