• Genomics & Informatics
• /
• v.6 no.3
• /
• pp.147-152
• /
• 2008

The basic graph layout technique, one of many visualization techniques, deals with the problem of positioning vertices in a way to maximize some measure of desirability in a graph. The technique is becoming critically important for further development of the field of systems biology. However, applying the appropriate automatic graph layout techniques to the genomic scale flow of metabolism requires an understanding of the characteristics and patterns of duplicate and shared vertices, which is crucial for bioinformatics software developers. In this paper, we provide the results of parsing KEGG XML files from a graph-theoretical perspective, for future research in the area of automatic layout techniques in biological pathway domains.

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

CAD drawings contain drawing errors similar to manually produced drawings. This paper is concerned with a computer-aided drawing check system for the drawing errors. The problem treated in this paper is the checking of dimension errors, deficiency and redundancy of dimension lines in the mechanical drawings made by a CAD system. Graph theory is used for the checking of the deficient and redundant dimensions. The feasibility of this system is confirmed for the checking items.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.2D
• /
• pp.171-179
• /
• 2010

The purpose of the present study is to suggest composing the graph topology of sketch drawing element and the recognition of the shape pattern for the earthwork quantity calculation. The algorithm which can extract the topology element such as vertex, edge, face and establish the relation between each topology was developed. The model which can define earthwork graph and recognize the shape pattern of earthwork was presented. As a result of the study, the shape pattern of earthwork that can't be calculated by existing earthwork calculation program could be recognized as expanding this model. The earthwork shape recognition automation using the graph topology model can be applied to the automation for the earthwork quantity estimation.

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.875-890
• /
• 2009

Metabolimics interprets an organism as a network of functional units and an organism is represented by a metabolic pathway i.e., well-displayed graph. So a software tool for drawing pathway is necessary to understand it comprehensively. These tools have a problem that edge-crossings exponentially increase as the number of nodes grows. To apply automatic graph layout techniques to the genome-scale metabolic flow, it is very important to reduce unnecessary edge-crossing on a metabolic pathway layout. In this paper, we design and implement 2.5D metabolic pathway layout modules. Metabolic pathways are represented hierarchically by making use of the '2-layered layout algorithm' in 3D. It enhances the readability and reduces unnecessary edge-crossings by using 3D layout modules instead of 2D layout algorithms.

• 전기의세계
• /
• v.19 no.5
• /
• pp.1-7
• /
• 1970

Starting from the review of signal flow graphs and flow graphs, this paper gives an example of sampled-data systems for Sedlar & Bekey's formulation. In this purpose it discussed the difference between Mason's signal-flow graphs and Coates flow graphs for drawing th flow graph of a linear system, and then a new flow-graph symbol introduced in order to distinguish between continuous and discrete systems. Thus, the paper is analysed and compared with a sampled-data systems between conventional methods and new method of signal flow graphs.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.496-507
• /
• 2001

An expert system for the diagnosis and indication of hypertension is implemented through HTML-based backward inference. HTML-based backward inference is performed using the hypertext function of HTML, and many HTML files, which are hyperlinked to each other based on the backward rules, should be prepared beforehand. The development and maintenance of the HTML files are conducted automatically using the decision graph. Still, the drawing and input of the decision graph is a time consuming and tedious job if it is done manually. So, automatic generator of the decision graph for the diagnosis and indication of hypertension was implemented. The HTML-based backward inference ensures accessibility, multimedia facilities, fast response, stability, easiness, and platform independency of the expert system. So, this research reveals that HTML-based inference approach can be used for many Web-based intelligent site with fast and stable performance.

• Journal of Elementary Mathematics Education in Korea
• /
• v.24 no.1
• /
• pp.1-30
• /
• 2020

This study was carried out in order to identify the error types of statistical graphs for statistical literacy education. We analyze the meaning of using graphs in statistical problem solving, and identify categories, frequencies, and contexts as the components of statistical graphs. Error types of representing categories and frequencies make statistics consumers see incorrect distributions of data by subjective point of view of statistics producers and visual illusion. Error types of providing contexts hinder the interpretation of statistical information by concealing or twisting the contexts of data. Moreover, the findings show that tasks provide standardized frame already for drawing graphs in order to avoid errors and pay attention to the process of drawing the graph rather than statistical literacy for analyzing data. We suggest some implications about statistical literacy education, ethical problems, and knowledge for teaching to be considered when teaching the statistical graph in elementary mathematics classes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1353-1362
• /
• 1999

그래프 드로잉이란 추상적인 그래프를 시각적으로 구성하여 2차원 평면상에 그려주는 작업으로 대칭성은 그래프 드로잉시 고려해야 하는 미적 기준들 중에서 그래프의 구조 및 특성을 표현해주는 가장 중요한 기준이다. 그러나 일반 그래프에서 대칭성을 찾아 그려 주는 문제는 NP-hard로 증명이 되어 있기 때문에 현재까지는 트리, 외부평면 그래프, 직병렬 유향 그래프나 평면 그래프 등으로 대상을 한정시켜 연구가 진행되어 왔다. 본 논문에서는 병렬 컴퓨터나 컴퓨터 네트워크 구조를 가시화 시키기 위하여 많이 사용되는 그래프인 상호연결망(interconnection network)의 대칭성을 분석하고 분석된 대칭성을 최대로 보여주는 대칭 드로잉 알고리즘을 제안하였다. 그리고 이를 기반으로 하여 상호연결망의 기존 드로잉 방법들과 본 논문에서 제안한 대칭 드로잉 등 다양한 드로잉을 지원하는 WWW 기반의 상호연결망 드로잉 시스템을 구현하였다.Abstract Graph drawing is constructing a visually-informative drawing of an abstract graph. Symmetry is one of the most important aesthetic criteria that clearly reveals the structures and the properties of graphs. However, the problem of finding geometric symmetry in general graphs is NP-hard. So the previous work has focused on the subclasses of general graphs such as trees, outerplanar graphs, series-parallel digraphs and planar graphs.In this paper, we analyze the geometric symmetry on the various interconnection networks which have many applications in the design of computer networks, parallel computer architectures and other fields of computer science. Based on these analysis, we develope algorithms for constructing the drawings of interconnection networks which show the maximal symmetries.We also design and implement Interconnection Network Drawing System (INDS) on WWW which supports the various drawings including the conventional drawings and our suggested symmetric drawings.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.2
• /
• pp.234-242
• /
• 2010

In this paper, we deal with the visualization of graphs, which are one of the most important data structures. As the size of a graph increases, it becomes more difficult to check the graph visually because of the increase of edge intersections. We propose a new method of overcoming such problem. Most of previous studies considered only the minimization of edge intersections, but we additionally pursue to preserve distances between vertices. We present a novel genetic algorithm using an evaluation function based on a weighted sum of two objectives. Our experiments could show effective visualization results.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.426-431
• /
• 1997

Features are well recognized to play an important role for the integration of ACD and CAPP. Majority of pervious works for the feature recognition for prismatic part is based on 3D solid model. But in real factories, 2D drawing are used more than 3D drawings. In this paper, we develope an algorithm of the feature recognition on prismatic parts in 2D drawings, using by the graph method and the heuristic algorithm. Previous algorithms have some conflicts at feature interaction. In this paper, elements are grouped into connection by the graph method. Then features are recognized by using these grouped elements and their relationships of front and side-view. For resolving the problem of feature interaction, the element graphs are modified by an deloped algorithm. This algorithm is applied to a CAPP system for milling process planning.