• Genomics & Informatics
• /
• v.6 no.2
• /
• pp.68-71
• /
• 2008

The static approach of representing metabolic pathway diagrams offers no flexibility. Thus, many systems adopt automatic graph layout techniques to visualize the topological architecture of pathways. There are weaknesses, however, because automatically drawn figures are generally difficult to understand. The problem becomes even more serious when we attempt to visualize all of the information in a single, big picture, which usually results in a confusing diagram. To provide a partial solution to this thorny issue, we propose J2dpathway, a metabolic pathway atlas viewer that has node-abstracting features.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.595-598
• /
• 1988

In this paper, a new folding algorithm for design of high density PLA's is proposed. This algorithm generates transform matrix so that programmed region of each row becomes narrow. Based on transform matrix, folding pair is selected. In the process of generating transform matrix, interval degree and dense degree are used to improve folding ratio. This paper also proposes an efficient folding pair graph which has short time of selection folding pair. This proposed algorithm is named PLAFOLII and implemented in C language on VAX-11/750 (UNIX) computer. Through various example, efficiency of this algorithm is verified.

• The Journal of Sustainable Design and Educational Environment Research
• /
• v.19 no.3
• /
• pp.48-58
• /
• 2020

Surplus resources including workforce and space have occurred by the implementation of electronic government. In order to utilize these resources for welfare, culture, employment, and sports for all, the plan for merging closed dong offices is going on. Meanwhile, the demand for childcare facilities is increasing due to the growing number of working couples and small-scale families, but the government has underwent many budget problems in processes such as new construction and purchase of the land. In response, this study purposes to present measures to simultaneously solve the problems of expanding childcare facilities due to the current increase in demand for them and of closed dong offices due to their reduced role from the implementation of the e-government. As a method of research, a survey was conducted on the current status and actual condition of childcare facilities using closed dong offices, and the spatial compositions of the facilities were compared through J-graph based on spatial syntax. Through this method, the types of space generated by the use of the existing dong offices were derived, and the problems and directions for improvement were described.

• Journal of the Architectural Institute of Korea Planning & Design
• /
• v.35 no.1
• /
• pp.55-62
• /
• 2019

Hayakawa Kunihiko introduced community space as an open space in Housing in Japan for the first time. We can find the continuity of his architectural intent from his three works (Atrium, Steps, Labyrinth) during the early period of his Housing buildings, In particular, from Labyrinth, his intent was expanded to cities through 'Urban Void', seeking communication and harmony. Accordingly, based on the architectural overview and a field survey of Labyrinth, an analysis was conducted using Space Syntax to investigate whether the space of an inner courtyard is being used as a community space for neighbors who pass through the courtyard and whether the courtyard plays the role of 'Urban Void' as intended by the architect. For this investigation, according to VGA, the courtyard showed the role of great visual connectivity and integration and facilitated connections to the center of the entire space. On the other hand, according to J-Graph, the access stairway connected to each household from the courtyard helped secure privacy in the midst of common space. Step Depth noted that a hierarchy of space was formed to ensure visual privacy within each unit household in addition to privacy for each household.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.12
• /
• pp.1225-1230
• /
• 2014

This paper investigates the group average-consensus and group formation-consensus problems for first-order multi-agent systems. The control protocol for group consensus is designed by considering the positive adjacency elements. Since each intra-group Laplacian matrix cannot be satisfied with the in-degree balance because of the positive adjacency elements between groups, we decompose the Laplacian matrix into an intra-group Laplacian matrix and an inter-group Laplacian matrix. Moreover, average matrices are used in the control protocol to analyze the stability of multi-agent systems with a fixed and undirected communication topology. Using the graph theory and the Lyapunov functional, stability analysis is performed for group average-consensus and group formation-consensus, respectively. Finally, some simulation results are presented to validate the effectiveness of the proposed control protocol for group consensus.

• Journal of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.795-834
• /
• 2016

The main purpose of this paper is to propose a scheme of a proof of the nonsimpleness of the group $Homeo^{\Omega}$ ($D^2$, ${\partial}D^2$) of area preserving homeomorphisms of the 2-disc $D^2$. We first establish the existence of Alexander isotopy in the category of Hamiltonian homeomorphisms. This reduces the question of extendability of the well-known Calabi homomorphism Cal : $Diff^{\Omega}$ ($D^1$, ${\partial}D^2$)${\rightarrow}{\mathbb{R}}$ to a homomorphism ${\bar{Cal}}$ : Hameo($D^2$, ${\partial}D^2$)${\rightarrow}{\mathbb{R}}$ to that of the vanishing of the basic phase function $f_{\underline{F}}$, a Floer theoretic graph selector constructed in [9], that is associated to the graph of the topological Hamiltonian loop and its normalized Hamiltonian ${\underline{F}}$ on $S^2$ that is obtained via the natural embedding $D^2{\hookrightarrow}S^2$. Here Hameo($D^2$, ${\partial}D^2$) is the group of Hamiltonian homeomorphisms introduced by $M{\ddot{u}}ller$ and the author [18]. We then provide an evidence of this vanishing conjecture by proving the conjecture for the special class of weakly graphical topological Hamiltonian loops on $D^2$ via a study of the associated Hamiton-Jacobi equation.

• Journal of Computational Design and Engineering
• /
• v.3 no.1
• /
• pp.14-23
• /
• 2016

The problem of fitting B-spline curves to planar point clouds is studied in this paper. A novel method is proposed to deal with the most challenging case where multiple intersecting curves or curves with self-intersection are necessary for shape representation. A method based on Delauney Triangulation of data points is developed to identify connected components which is also capable of removing outliers. A skeleton representation is utilized to represent the topological structure which is further used to create a weighted graph for deciding the merging of curve segments. Different to existing approaches which utilize local shape information near intersections, our method considers shape characteristics of curve segments in a larger scope and is thus capable of giving more satisfactory results. By fitting each group of data points with a B-spline curve, we solve the problems of curve structure reconstruction from point clouds, as well as the vectorization of simple line drawing images by drawing lines reconstruction.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.9
• /
• pp.858-862
• /
• 2015

This paper presents a new forward-viewing mono-camera based obstacle detection algorithm for mobile robots. The proposed method extracts the coarse location of an obstacle in an image using inverse perspective mapping technique from sequential images. In the next step, graph-cut based image labeling is conducted for estimating the exact obstacle boundary. The graph-cut based labeling algorithm labels the image pixels as either obstacle or floor as the final outcome. Experiments are performed to verify the obstacle detection performance of the developed algorithm in several examples, including a book, box, towel, and flower pot. The low illumination condition, low color contrast between floor and obstacle, and floor pattern cases are also tested.

• Journal of Power System Engineering
• /
• v.14 no.3
• /
• pp.77-82
• /
• 2010

In general, the control valves are essential components in hydraulic systems. Structural changes within the valves remain a challenge because many parameters of valve tend to interact in terms of static and dynamic performance. Therefore, the valve characteristics is applied directly to the stability of hydraulic system. Inner structure of the valve which is used mainly in the industries is made up poppet type and spool type. This paper made a description of the method for numerical analysis and modeling of the valve with a built-in moving part of four-type. Based on the physical parameters of the valves, a numerical model of objected valve is developed using the bond graph method. It is to verified the results that the moving part of four-type has an effect on pressure and flow characteristics. Also, It is analyzed the results which has an effect on response characteristic by angular of poppet valve face and inertia variation of the valve with a built-in moving part. In the results, it is confirmed that the rising and settling time vary with the shape of moving part in valve.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.12
• /
• pp.1053-1060
• /
• 2016

As location recognition for autonomous vehicles develops, the need for a precise map for autonomous driving has increased. A precise map must be built based upon accurate position. Recent studies have accelerated research in this area by using various sensors that calculate the accurate position by comparing and recognizing objects around the roads. However, application of such methods is limited because these studies only take objects with significant verticality into consideration. Thus, new research is needed to overcome the limitations: a method that is not constrained by the existence of certain types of surrounding objects shall be proposed. Most roads contain road marking information, such as lanes, direction signs, and pedestrian crossings. Such information on the road surface is a valuable resource for building a precise map. This paper proposes a method of building a precise map by using road marking information.