• 제목/요약/키워드: Graph-based

검색결과 1,802건 처리시간 0.028초

Sediment Yield by Instantaneous Unit Sediment Graph

  • Lee, Yeong-Hwa
    • Environmental Sciences Bulletin of The Korean Environmental Sciences Society
    • /
    • 제2권1호
    • /
    • pp.29-36
    • /
    • 1998
  • An instantaneous unit sediment graph (IUSG) model is investigated for prediction of sediment yield from an upland watershed in Northwestern Mississippi. Sediment yields are predicted by convolving source runoff with an IUSG. The IUSG is the distribution of sediment from an instantaneous burst of rainfall producing one unit of runoff. The IUSG, defined as a product of the sediment concentration distribution (SCD) and the instantaneous unit hydrograph (IUH), is known to depend on the characteristics of the effective rainfall. The IUH is derived by the Nash model for each event. The SCD is assumed to be an exponential function for each event and its parameters were correlated with the effective rainfall characteristics. A sediment routing function, based on travel time and sediment particle size, is used to predict the SCD.

  • PDF

타입-2 퍼지 가중치 그래프에서의 최단경로문제 (Shortest Path Problem in a Type-2 Fuzzy Weighted Graph)

  • Lee, Seungsoo;Lee, Kwang H.
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2001년도 추계학술대회 학술발표 논문집
    • /
    • pp.314-318
    • /
    • 2001
  • Constructing a shortest path on a graph is a fundamental problem in the area of graph theory. In an application where we cannot exactly determine the weights of edges, fuzzy weights can be used instead of crisp weights, and Type-2 fuzzy weights will be more suitable if this uncertainty varies under some conditions. In this paper, shortest path problem in type-1 fuzzy weighted graphs is extended for type-2 fuzzy weighted graphes. A solution is also given based on possibility theory and extension principle.

  • PDF

그래프 구조 기반의 회의 정보 가시화 (Graph-based Information Visualization for Meeting Information)

  • 김리라;양상욱;김영일;전차수;최영;김래현;박세형
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
    • /
    • pp.1334-1341
    • /
    • 2006
  • 정보가시화는 정보를 기하학적으로 표현하는 연구 분야로 정량적 정보를 테이블, 도표 등의 형태로 표현하는 정량 정보 가시화와 그래프나 네트워크와 같은 구조적 자료를 기하학적으로 표현하는 graph visualization이 있다. 본 연구에서는 그래프 기반의 정보 가시화를 이용한 회의 정보 가시화 프로그램을 소개하고자 한다. 이는 연구개발이나, 프로젝트 관리, 브레인스토밍 등의 회의에 있어서 태스크, 자원, 일정, 문서 등으로 구성되는 회의정보를 대상으로 한다. 최초 정보 생성, 정보 수정, 정보 가시화 기능을 갖고 있으며 그래프 자동 배치 모듈, 가시화 모듈, 사용자 인터페이스 모듈 등으로 구성되어 있다. 그래프 자동 배치는 오픈 소스로 제공되는 GraphViz를 사용하였고, 가시화는 OpenGL을 이용하였다. 회의 정보들 사이의 복잡한 관계를 그래프 구조로 표현하여 업무와 자원의 분배, 관련된 문서 검색을 쉽게 하여 회의 정보를 직관적이고, 빠르고 쉽게 조작하고, 이해하는데 유용하다.

  • PDF

2차원도면으로 표현된 각주형 부품의 특징형상인식

  • 박재민;이충수;박경진
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1997년도 춘계학술대회 논문집
    • /
    • 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.

  • PDF

시설배치문제의 의사결정지원 시스템 - 그래프이론의 접근

  • 이호준
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 1989년도 추계학술발표회 발표논문초록집; 이화여자대학교, 서울; 23 Sep. 1989
    • /
    • pp.77-85
    • /
    • 1989
  • The purpose of this research entails the study of the multicriteria graph-theoretic Facility Layout Problem(FLP), the development of a Decision Support System(DSS), and a sensitivity analysis for graph Theoretic heuristics. The graph theoretic FLP Decision Support System gives decision makers or planners more information as a guide in producing their final layouts. This information is provided by a variety of final result scores, so called upper bound values, based on different options and different criteria. The increased information provided will give decision makers more confidence in design a block plan. One case is presented to demonstrate the applicability of the system to real-world problem. Finally, applicabilities of the DSS to other format layouts, such as GT layout and JIT's U-line, are briefly mentioned.

  • PDF

An Efficient Topology/Parameter Control in Evolutionary Design for Multi-domain Engineering Systems

  • Seo, Ki-Sung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제5권2호
    • /
    • pp.108-113
    • /
    • 2005
  • This paper suggests a control method for an 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 in bond graph synthesis, 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.

BINGO: Biological Interpretation Through Statistically and Graph-theoretically Navigating Gene $Ontology^{TM}$

  • Lee, Sung-Geun;Yang, Jae-Seong;Chung, Il-Kyung;Kim, Yang-Seok
    • Molecular & Cellular Toxicology
    • /
    • 제1권4호
    • /
    • pp.281-283
    • /
    • 2005
  • Extraction of biologically meaningful data and their validation are very important for toxicogenomics study because it deals with huge amount of heterogeneous data. BINGO is an annotation mining tool for biological interpretation of gene groups. Several statistical modeling approaches using Gene Ontology (GO) have been employed in many programs for that purpose. The statistical methodologies are useful in investigating the most significant GO attributes in a gene group, but the coherence of the resultant GO attributes over the entire group is rarely assessed. BINGO complements the statistical methods with graph-theoretic measures using the GO directed acyclic graph (DAG) structure. In addition, BINGO visualizes the consistency of a gene group more intuitively with a group-based GO subgraph. The input group can be any interesting list of genes or gene products regardless of its generation process if the group is built under a functional congruency hypothesis such as gene clusters from DNA microarray analysis.

암석의 성인별 한계변형률 특성에 관한 연구 (A study on critical strain properties of intact rock due to Petrogenesis)

  • 김영수;박시현;김대만;신지섭;한희수
    • 한국지반공학회:학술대회논문집
    • /
    • 한국지반공학회 2009년도 춘계 학술발표회
    • /
    • pp.1133-1138
    • /
    • 2009
  • This study was conducted in order to know the internal application of the critical strain graph. To evaluate critical strain graph, we carried out an uniaxial compression test with some of internal rocks: sandstone, shale, weathered granite, and pink granitic. Based on the uniaxial compression test, we deduced relations among critical strain, failure strain, uniaxial compression strength and modulus of elasticity. As a result, the study has found out the rocks, which have been tested, can be possibly evaluated by critical strain graph.

  • PDF

분산 컴퓨터 시스템에서 파일 할당에 관한 연구 (A Study on the File Allocation in Distributed Computer Systems)

  • 홍진표;임재택
    • 대한전자공학회논문지
    • /
    • 제27권4호
    • /
    • pp.571-579
    • /
    • 1990
  • A dynamic relocation algorithm for non-deterministic process graph in distributed computer systems is proposed. A method is represented for determining the optimal policy for processing a process tree. A general database query request is modelled by a process tree which represent a set of subprocesses together with their precedence relationship. The process allocation model is based on operating cost which is a function fo selection of site for processing operation, data reduction function and file size. By using expected values of parameters for non-deterministic process tree, the process graph and optimal policy that yield minimum operating cost are determined. As process is relocated according to threshold value and new information of parameters after the execution of low level process for non-deterministic process graph, the assigned state that approximate to optiaml solution is obtained. The proposed algorihtm is heuristic By performing algorithm for sample problems, it is shown that the proposed algorithm is good in obtaining optimal solution.

  • PDF

터빈-발전기 Governor Droop의 그래프와 비례식을 통한 특성 고찰 (Understanding Governor Droop of Turbine-Generator through Graph and Proportional Expression)

  • 이상중
    • 조명전기설비학회논문지
    • /
    • 제27권5호
    • /
    • pp.33-38
    • /
    • 2013
  • This paper presents a simpler calculation of the generator load sharing according to the change of system frequency and the droop setting of turbine-generator governor. The author firstly draws a graph based on the generator operation at rated MW output and normal frequency, and secondly, builds a proportional expression using the graph in order to obtain the solution in a simpler way rather than using conventional mathematical calculation, to provide the readers with an easier understanding of the droop setting of turbine-generator governor.