• 제목/요약/키워드: graph method

검색결과 1,481건 처리시간 0.026초

신호 흐름 행렬에 의한 그래프 해석 (Analysis of Graphs Using the Signal Flow Matrix)

  • 김정덕;이만형
    • 전기의세계
    • /
    • 제22권4호
    • /
    • pp.25-29
    • /
    • 1973
  • The computation of transmittances between arbitrary input and output nodes is of particular interest in the signal flow graph theory imput. The signal flow matrix [T] can be defined by [X]=-[T][X] where [X] and [Y] are input nose and output node matrices, respectively. In this paper, the followings are discussed; 1) Reduction of nodes by reforming the signal flow matrix., 2) Solution of input-output relationships by means of Gauss-Jordan reduction method, 3) Extension of the above method to the matrix signal flow graph.

  • PDF

팩토링 기법을 이용한 신뢰성 구조도의 신뢰도 계산 알고리즘 (A Reliability Computational Algorithm for Reliability Block Diagram Using Factoring Method)

  • 이창훈;김명규;이상천
    • 대한산업공학회지
    • /
    • 제20권3호
    • /
    • pp.3-14
    • /
    • 1994
  • In this study, two reliability computational algorithms which respectively utilize a factoring method are proposed for a system represented by reliability block diagram. First, vertex factoring algorithm is proposed. In this algorithm, a reliability block diagram is considered as a network graph with vertex reliabilities. Second algorithm is mainly concerned with conversion of a reliabilities block diagram into a network graph with edge reliabilities. In this algorithm, the independence of edges is preserved by eliminating replicated edges, and in computing the reliability of a converted network graph, existing edge factoring algorithm is applied. The efficiency of two algorithms are compared for example systems with respect to computing times. The results shows that the second algorithm is shown to be more efficient than the first algorithm.

  • PDF

본드그래프모델링 방식을 이용한 직류전동기의 속도응답개선에 관한 연구 (Improvement on the Speed-Response of DC Motor Using Bond Graph Modeling Method)

  • 신위재;하홍곤
    • 한국통신학회논문지
    • /
    • 제16권4호
    • /
    • pp.309-318
    • /
    • 1991
  • 본 논문에서는 기준신호와 응답의 편차를 억제하기 위해서 이용하는 적분기와 직류전동기를 본드그래프로 구성하여 직류전동기의 속도 제어계에서 관성이나 외란 그리고 부하변동에 의한 파라미터나 응답변동에 대해서 높은 적응성을 갖는 모델추종형 servo 제어기를 본드그래프로 설계하였으며 이 본드그래프 모델링기법이 제어기의 동작 해석 및 설계에 유효함을 확인하였다.

  • PDF

영역 보로노이 그래프를 기반한 위상 지도 작성 (Topological Map Building Based on Areal Voronoi Graph)

  • 손영준;박귀태
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2004년도 하계학술대회 논문집 D
    • /
    • pp.2450-2452
    • /
    • 2004
  • Map building is essential to a mobile robot navigation system. Localization and path planning methods depend on map building strategies. A topological map is commonly constructed using the GVG(Generalized Voronoi Graph). The advantage of the GVG based topological map is compactness. But the GVG method have many difficulties because it consists of collision-free path. In this paper, we proposed an extended map building method, the AVG (Areal Voronoi Graph) based topological map. The AVG based topological map consists of collision-free area. This feature can improve map building, localization and path planning performance.

  • PDF

스프링강의 피로 특성에 미치는 평균 응력의 영향 (Effect of Mean Stress on Fatigue Properties in Spring Steel)

  • 석창성;김형익;장필수;주재만;강정훈
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2003년도 춘계학술대회
    • /
    • pp.255-260
    • /
    • 2003
  • Most of the fatigue test were achieved in fully reversed condition that mean stress is zero. But, generally, mean stress can not be zero. This research was achieved the bending fatigue test that changes mean stress to spring steel and was studied relation with the mean stress and the fatigue life. The method to search effect about mean stress was extended S-N graph in two cases. One method was extended S-N graph using modified Miner's rule with considering damage. Another was extended using tendency of S-N graph. The exponential value(${\alpha}$) of mean stress-alternating stress equation is converged between the Goodman's and the Gerber's value even if fatigue life increases.

  • PDF

Hierarchical Structure in Semantic Networks of Japanese Word Associations

  • Miyake, Maki;Joyce, Terry;Jung, Jae-Young;Akama, Hiroyuki
    • 한국언어정보학회:학술대회논문집
    • /
    • 한국언어정보학회 2007년도 정기학술대회
    • /
    • pp.321-329
    • /
    • 2007
  • This paper reports on the application of network analysis approaches to investigate the characteristics of graph representations of Japanese word associations. Two semantic networks are constructed from two separate Japanese word association databases. The basic statistical features of the networks indicate that they have scale-free and small-world properties and that they exhibit hierarchical organization. A graph clustering method is also applied to the networks with the objective of generating hierarchical structures within the semantic networks. The method is shown to be an efficient tool for analyzing large-scale structures within corpora. As a utilization of the network clustering results, we briefly introduce two web-based applications: the first is a search system that highlights various possible relations between words according to association type, while the second is to present the hierarchical architecture of a semantic network. The systems realize dynamic representations of network structures based on the relationships between words and concepts.

  • PDF

A DIFFERENCE SET METHOD FOR CIRCULANT DECOMPOSITIONS OF COMPLETE PARTITE GRAPHS INTO GREGARIOUS 4-CYCLES

  • Kim, Eun-Kyung;Cho, Young-Min;Cho, Jung-Rae
    • East Asian mathematical journal
    • /
    • 제26권5호
    • /
    • pp.655-670
    • /
    • 2010
  • The complete multipartite graph $K_{n(m)}$ with n $ {\geq}$ 4 partite sets of size m is shown to have a decomposition into 4-cycles in such a way that vertices of each cycle belong to distinct partite sets of $K_{n(m)}$, if 4 divides the number of edges. Such cycles are called gregarious, and were introduced by Billington and Hoffman ([2]) and redefined in [3]. We independently came up with the result of [3] by using a difference set method, and improved the result so that the composition is circulant, in the sense that it is invariant under the cyclic permutation of partite sets. The composition is then used to construct gregarious 4-cycle decompositions when one partite set of the graph has different cardinality than that of others. Some results on joins of decomposable complete multipartite graphs are also presented.

소셜 서비스를 위한 시공간 모델링 방안 (Time and Space Modeling Method for Social Services)

  • 이승희;박영호;박화진
    • 디지털콘텐츠학회 논문지
    • /
    • 제11권4호
    • /
    • pp.571-578
    • /
    • 2010
  • 최근 모바일 기기를 기반으로 수많은 소셜 네트워크 서비스가 확산되고 보급되는 가운데, 위치와 시간을 기반으로 하는 연구들이 증가하고 있다. 그러나 기존 연구들에서는 장소와 시간, 이벤트에 대한 조합적인 질의를 해결하는 것이 주요한 문제가 되었다. 본 연구에서는 소셜 서비스를 위한 시공간 모델링 방안으로 장소와 시간, 이벤트, 사용자의 소셜 액티비티를 통해 Human Activity Graph 모델링 방안과 Quad Relation Factors를 제안하고, 이를 위한 데이터 수집과 분석을 위한 하부 구조를 설계하였다.

스핀 코너 성능향상을 위한 모델링 및 민감도 해석 (Modelling and Sensitivity Analysis for the Performance Improvement of a Spin Coater)

  • 권태종;채호철;한창수;정진태;안강호
    • 한국생산제조학회지
    • /
    • 제9권6호
    • /
    • pp.96-102
    • /
    • 2000
  • Spinning mechanism is generally used in coasting process on grass plates. Rebounding PR(Photo Resist) which leads to occur inferiority of coating process is caused by vibrational energy of whole coating system. In this study, the sensitivity analysis is performed to analyze and reduce vibrational terms in the spin coating system. The sensitivity analysis is bared on the numerical expression of this system. By the bond graph method. power flow of each system is represented by some basic bond graph elements. Any energy domain system is modeled using the unified elements. The modelled spin coater system is verified with power spectrum data measured by FFT analyzer. As the results of verifying model parameters and sensitivity analysis, principal factors causing vibration phenomenon are mentioned. A study on vibration method in the spin coating system is discussed.

  • PDF

Optimization by Simulated Catalytic Reaction: Application to Graph Bisection

  • Kim, Yong-Hyuk;Kang, Seok-Joong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권5호
    • /
    • pp.2162-2176
    • /
    • 2018
  • Chemical reactions have an intricate relationship with the search for better-quality neighborhood solutions to optimization problems. A catalytic reaction for chemical reactions provides a clue and a framework to solve complicated optimization problems. The application of a catalytic reaction reveals new information hidden in the optimization problem and provides a non-intuitive perspective. This paper proposes a new simulated catalytic reaction method for search in optimization problems. In the experiments using this method, significantly improved results are obtained in almost all graphs tested by applying to a graph bisection problem, which is a representative problem of combinatorial optimization problems.