• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.771-784
• /
• 1998

In this paper we propose an algorithm for generating minimal cutsets of undirected graphs. The algorithm is based on a blocking mechanism for generating every minimal cutest ex-actly once. The algorithm has an advantage of not requiring any preliminary steps to find minimal cutsets. The algorithm generates minimal cutsets at O(e.n) {where e,n = number of (edges, vertices) in the graph} computational effort per cutset. Formal proofs of the algorithm are presented.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.189-199
• /
• 1994

This paper considers the covering network design problem (CNDP). In the CNDP, an undirected graph is given where nodes correspond to potential facility sites and arcs to potential links connecting facilities. The objective of the CNDP is to identify the least cost connected subgraph whose nodes cover the given demand points. The problem difines a demand point to be covered if some node in the selected graph is present within an appropriate distance from the demand point. We present an integer programming formulation for the problem and develop a dual-based solution procedure. The computational results for randomly generated test problems are also shown.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2000.11a
• /
• pp.185-188
• /
• 2000

현재의 3차원 시각 정보 제시기는 Scene Graph 기반의 3차원 그래픽스 API에 기반을 두고 있다. 본 연구에서는 시각 정보 제시에 더불어 다양한 감각을 제시하기 위한 통합 제시 능력을 가지는 시스템으로 시각화 시스템을 확장하였다. 이 확장된 시스템은 다양한 감각 정보를 제시하기 위한 추가적인 정보를 가지는 확장된 Scene Graph을 가지고 운영되며, 통합된 Script System으로 각 감각 제시 시스템들간의 동기화 및 통합 관리와 제시 시스템의 확장에 유리한 장점을 가진다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.185-188
• /
• 2005

This paper suggests a control method for efficient topology/parameter evolution in a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynamic systems, We adopt a hierarchical breeding control mechanism with fitness-level-dependent differences to obtain better balancing of topology/parameter search - biased toward topological changes at low fitness levels, and toward parameter changes at high fitness levels. As a testbed for this approach, an eigenvalue assignment problem, which is to find bond graph models exhibiting minimal distance errors from target sets of eigenvalues, was tested and showed improved performance for various sets of eigenvalues.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1389-1392
• /
• 2000

본 논문은 프로시저 내에서 데이터 토큰들간의 정보흐름을 모델링 하기 위해서 정보 흐름 그래프(IFG : Information Flow Graph)라고 하는 프로그램 표현 도구를 개발하였다. IFG는 기존 제어 흐름 그래프와는 달리 프로그램 내에서 관심 있는 변수 값의 변화 과정을 쉽게 탐색할 수 있고, 정보 흐름의 미세 변화를 잘 표현할 수 있으므로, 프로그램에 대한 이해를 증진시킬 수 있다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1219-1224
• /
• 1999

This paper derived Montgomery's parallel algorithms for modular multiplication based on Walter's and Iwamura's method, and compared data dependence graph of each parallel algorithm. Comparing the result, Walter's parallel algorithm has small computational index in data dependence graph, so it is selected and used to computed spatial and temporal pipelining diagrams with each projection direction for designing expansible bit-level systolic array. We also evaluated internal operation of proposed expansible systolic array C++ language.

• Kyungpook Mathematical Journal
• /
• v.59 no.1
• /
• pp.175-190
• /
• 2019

In this paper, we provide results for the search number of the Cartesian product of graphs. We consider graphs on opposing ends of the spectrum: paths and cliques. Our main result determines the pathwidth of the product of cliques and provides a lower bound for the search number of the product of cliques. A consequence of this result is a bound for the search number of the product of arbitrary graphs G and H based on their respective clique numbers.

• Journal of KIISE:Software and Applications
• /
• v.28 no.12
• /
• pp.910-920
• /
• 2001

We developed a SIFC(Slice-based Information Flow Graph) For modeling the information flow on program on the basis of the information flow of a data tokens on program slices. Then we defined a SCM(Slice-based Complexity Measure) for measuring the program complexity by measuring the complexity of information flow on SIFG, We showed that, according to Zuse's approach, it assumed ordinal scale based on atomic modifications on SIFG and that it was additive to binary operation MBSEQ and that it was not additive to binary operation MBALT but satisfied Weyuker's 9th axiom. Also based on comparison with the existing measures, we showed that SCM could measure not only the control and data flow in program but also the physical size of program.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.9
• /
• pp.6290-6296
• /
• 2015

More informative ones of heuristics can help to conduct search more efficiently to obtain solution plan. However, in general, to derive highly informative heuristics from problem specifications requires lots of computational effort. To address this problem, we propose an State-Action based Planning Graph(SAPG) and Action-based heuristics for solving planning problems more efficiently. The SAPG is an extended one to be applied to can find interactions between subgoal & goal conditions from the relaxed planning graph which is a common means to get heuristics for solving the planning problems, Action-based heuristics utilizing SAPG graphs can find interactions between subgoal & goal conditions in an effective way, and then consider them to estimate the goal distance. Therefore Action-based heuristics have more information than the existing max and additive heuristics, also requires less computational effort than the existing overlap heuristics. In this pager. we present the algorithm to compute Action-based heuristics, and then explain empirical analysis to investigate the accuracy and the efficiency of the Action-based heuristics.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1327-1336
• /
• 1997

Test generation from the communication protocol specified in I/OFSM protocol is based on the asumption that the specification S and implemenataiton I are storngly, connected,minmal and deterministic.In this paper,we identify why these asumptions are necessary for minimal test cases genration from I/OFSM protocol speci-fication,and we propose a graph Rewriting System and its application to the specification I/OFSM for verifying its storng cinnectivity.We prove that the suggested algorithm is more dffcient thah the traditional strongly connected compoment find algorithm.