• 제목/요약/키워드: J-graph

검색결과 229건 처리시간 0.028초

J2dpathway: A Global Metabolic Pathway Viewer with Node-Abstracting Features

  • Song, Eun-Ha;Ham, Seong-Il;Yang, San-Duk;Rhie, A-Rang;Park, Hyun-Seok;Lee, Sang-Ho
    • Genomics & Informatics
    • /
    • 제6권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.

고밀도 PLA 설계를 위한 겹침 알고리즘 (A folding algorithm for design of high density PLA's)

  • 선선구;김윤홍;홍인식;정준모;이재민;임인칠
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
    • /
    • 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.

  • PDF

폐동사무소를 활용한 보육시설의 공간특성에 관한 연구 (A Study on the characteristics of space of child care facilities to utilize closed dong offices)

  • 성형규;이종국
    • 교육녹색환경연구
    • /
    • 제19권3호
    • /
    • pp.48-58
    • /
    • 2020
  • 전자정부의 시행으로 기존 동사무소에서 인력 및 공간에서 잉여분이 발생하게 되었으며 서울시와 지방정부에서는 복지, 문화, 고용, 생활체육 등의 용도로 사용하기 위하여 동 통폐합계획이 진행하고 있다. 한편, 맞벌이 부부 증가 및 핵가족화로 인해 보육시설 수요는 점차 증가하고 있지만 정부는 신축 및 부지매입 등에 많은 예산상에 문제에 따랐다. 이에 본 연구는 현재 보육시설 수요자 증가에 따른 보육시설 확충의 문제와 전자정부 시행으로 인해 동사무소의 역할이 축소됨으로 인해 발생하는 폐동사무소의 문제를 동시에 해결하기 위한 방안을 제시하고자 한다. 연구의 방법으로는 폐동사무소를 활용한 보육시설의 현황 및 실태 조사를 실행하고 공간구문론을 기초로 한 J-graph를 통해 시설 간 공간구성을 비교하였다. 이를 통해 기존 동사무소를 활용할 시 발생되는 공간유형을 도출하였으며 그로 인해 발생하는 문제점과 개선방향을 서술하였다.

하야카와 쿠니히코 초기 공동주택의 공용공간 특성에 관한 연구 - 도쿄 라비린스(ラビリンス)를 중심으로 - (A Study on the Common Space Characteristics of Early Housing by Hayakawa Kunihiko - Focusing on Labyrinth housing in Tokyo -)

  • 기유미;전병권;김경연
    • 대한건축학회논문집:계획계
    • /
    • 제35권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.

일차 다개체 시스템의 그룹 평균 상태일치와 그룹 대형 상태일치 (Group Average-consensus and Group Formation-consensus for First-order Multi-agent Systems)

  • 김재만;박진배;최윤호
    • 제어로봇시스템학회논문지
    • /
    • 제20권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.

CONTINUOUS HAMILTONIAN DYNAMICS AND AREA-PRESERVING HOMEOMORPHISM GROUP OF D2

  • Oh, Yong-Geun
    • 대한수학회지
    • /
    • 제53권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.

A graph-based method for fitting planar B-spline curves with intersections

  • Bon, Pengbo;Luo, Gongning;Wang, Kuanquan
    • Journal of Computational Design and Engineering
    • /
    • 제3권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.

전방 모노카메라 기반 장애물 검출 기술 (Obstacle Detection Algorithm Using Forward-Viewing Mono Camera)

  • 이태재;이훈;조동일
    • 제어로봇시스템학회논문지
    • /
    • 제21권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.

밸브 운동부 구조 변화에 따른 압력특성에 관한 연구 (A Study on Pressure Characteristic in Various Inner Structure of Valves)

  • 허정규;오인호;양경욱
    • 동력기계공학회지
    • /
    • 제14권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.

도로 노면 정보를 이용한 그래프 기반 자율주행용 정밀지도 생성 (Graph-based Building of a Precise Map for Autonomous Vehicles Using Road Marking Information)

  • 조성준;임준혁;지규인
    • 제어로봇시스템학회논문지
    • /
    • 제22권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.