• Title/Summary/Keyword: tree diagram

Search Result 115, Processing Time 0.028 seconds

Derivation of State Transition Diagram from Class Using Tree Structure (트리 형태를 이용한 클래스의 단계별 상태 다이어그램 도출 기법에 대한 연구)

  • Choi, Soo Kyung;Park, Young Bom
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.1
    • /
    • pp.19-26
    • /
    • 2013
  • To improve the reliability and quality of software system, many studies of the testing based on state-transition diagram have been in progress. Existing studies tried to solve the complexity problem of state-transition diagram. But the development of test case demands the better way to derive and manage the state diagram with low complexity. In this paper, the STMT(State-Transition Mapping Tree) is proposed to decrease the complexity of state diagram without changing or loosing the original state or transition information. Comparing with other methods, the proposed method turns out to be less complex.

An approximate approach for Computing Fault-tree probabilities (Fault-tree 확률계산을 위한 근사적 방법)

  • Lee, Geun-Hui;Lee, Dong-Hyeong
    • Journal of Korean Society for Quality Management
    • /
    • v.18 no.2
    • /
    • pp.25-32
    • /
    • 1990
  • This paper presents an approximate algorithm for computing Fault-tree probabilities. The method is essentially composed of three steps. In the first step, a Fault-tree is converted into a network form. In the second step, We change the network into a parallelized diagram. In the third step, the approximate fault-tree probability is calculated from the parallelized diagram. In this paper, in order to verify the method two hypothetical Fault-tree is used by examples. The results show that the method is very useful, even though it is an approximate technique, since it needs not to search the minimal cut sets and has the simple computing rontines.

  • PDF

Distributed Search of Swarm Robots Using Tree Structure in Unknown Environment (미지의 환경에서 트리구조를 이용한 군집로봇의 분산 탐색)

  • Lee, Gi Su;Joo, Young Hoon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.67 no.2
    • /
    • pp.285-292
    • /
    • 2018
  • In this paper, we propose a distributed search of a cluster robot using tree structure in an unknown environment. In the proposed method, the cluster robot divides the unknown environment into 4 regions by using the LRF (Laser Range Finder) sensor information and divides the maximum detection distance into 4 regions, and detects feature points of the obstacle. Also, we define the detected feature points as Voronoi Generators of the Voronoi Diagram and apply the Voronoi diagram. The Voronoi Space, the Voronoi Partition, and the Voronoi Vertex, components of Voronoi, are created. The generated Voronoi partition is the path of the robot. Voronoi vertices are defined as each node and consist of the proposed tree structure. The root of the tree is the starting point, and the node with the least significant bit and no children is the target point. Finally, we demonstrate the superiority of the proposed method through several simulations.

A Study on the Hydrologic Decision-Making for Drought Management : 2. Decision-Making Method for Drought Management (가뭄관리를 위한 수문학적 의사결정에 관한 연구 : 2. 가뭄관리를 위한 의사결정 방법)

  • Kang, In-Joo;Yoon, Yong-Nam
    • Journal of Korea Water Resources Association
    • /
    • v.35 no.5
    • /
    • pp.597-609
    • /
    • 2002
  • This study suggests a methodology of hydrologic decision making for the establishment of a standard of drought management from the drought analysis by the past drought history and for the drought monitoring and management according to drought processing. The construction and analysis of a decision tree diagram are performed and the step by step plan according to drought severity is suggested. Say, the decision tree diagram is constructed by the transition probability and quantity of monthly precipitation. Then the drought processing is investigated by the analysis of diagram and the 3-step of drought notice, drought warning, and emergency plan are established. The suggested methology in this study can be used for the other area and the decision tree diagram be used by changing the diagram according to the utilization purposes. Also, the choice of monthly PDSI class and precipitation analysis can be performed by the continuous data supplement. And so, a new standard value by the modified diagram is provided and the continuous drought management will be possible.

GPU-accelerated Reliability Analysis Method using Dynamic Reliability Block Diagram based on DEVS Formalism (DEVS 형식론 기반의 Dynamic Reliability Block Diagram과 GPU 가속 기술을 이용한 신뢰도 분석 방법)

  • Ha, Sol;Ku, Namkug;Roh, Myung-Il
    • Journal of the Korea Society for Simulation
    • /
    • v.22 no.4
    • /
    • pp.109-118
    • /
    • 2013
  • This paper adopts the system configuration to assess the reliability instead of making a fault tree (FT), which is a traditional method to analyze reliability of a certain system; this is the reliability block diagram (RBD) method. The RBD method is a graphical presentation of a system diagram connecting the subsystems of components according to their functions or reliability relationships. The equipment model for the reliability simulation is modeled based on the discrete event system specification (DEVS) formalism. In order to make various alternatives of target system, this paper also adopts the system entity structure (SES), an ontological framework that hierarchically represents the elements of a system and their relationships. To enhance the calculation time of reliability analysis, GPU-based accelerations are adopted to the reliability simulation.

An Efficient Method for Finding the Neighbor MBRs on Voronoi Diagram (보르노이 다이어그램 상의 효율적인 이웃 MBR 연산 기법)

  • Park, Yonghun;Lee, Jinju;Lim, Jongtae;Choi, Kilseong;Yoo, Jaesoo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2010.05a
    • /
    • pp.13-15
    • /
    • 2010
  • 이동객체의 공간 데이터를 색인하기 위해 검색성능이 뛰어난 R-tree구조가 많이 활용된다. 최근 R-tree를 B+-tree처럼 인접한 단말노드 간의 연결을 통해 질의 처리를 수행하는 ISR-tree와 ISG-index가 제안되었다. 이 기법들은 MBR (Minimum Boundary Rectangle) 간의 인접한 이웃 노드를 결정하기 위해 보르노이 다이어그램(Voronoi Diagram)을 이용한다. MBR을 대상으로 하는 보르노이 다이어그램은 매우 복잡한 연산과정을 거친다. 본 논문에서는 점을 대상으로 하는 보르노이 다이어그램 연산을 활용한 인접한 이웃 MBR을 연산하는 기법을 제안한다. 각 MBR의 꼭지점들을 기준으로 보르노이 다이어그램을 만들 경우, 인접한 MBR의 꼭지점들의 보르노이 셀이 항상 인접한 것을 알아내었고, 이를 활용한다. 제안하는 기법의 우수성을 증명하기 위해 기존의 기법과 비교하여 성능평가를 수행하였다.

  • PDF

Influence Diagram Approach for Strategic Decision Structuring Process

  • Kim, Gi-Hyo;Kim, Soung-Hie
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.10 no.1
    • /
    • pp.41-53
    • /
    • 1985
  • The influence diagram is a new conceptual tool that can be used for structuring a strategic decision problem in decision analysis. It has a graphical representation of probabilistic dependence among variables in the decision problem. In this formal procedures for constructuring the influence diagram and for translating it into the corresponding decision tree are studied. An example that shows the power of the infuence diagram is shown.

  • PDF

Zero-suppressed ternary decision diagram algorithm for solving noncoherent fault trees in probabilistic safety assessment of nuclear power plants

  • Woo Sik Jung
    • Nuclear Engineering and Technology
    • /
    • v.56 no.6
    • /
    • pp.2092-2098
    • /
    • 2024
  • Probabilistic safety assessment (PSA) plays a critical role in ensuring the safe operation of nuclear power plants. In PSA, event trees are developed to identify accident sequences that could lead to core damage. These event trees are then transformed into a core-damage fault tree, wherein the accident sequences are represented by usual and complemented logic gates representing failed and successful operations of safety systems, respectively. The core damage frequency (CDF) is estimated by calculating the minimal cut sets (MCSs) of the core-damage fault tree. Delete-term approximation (DTA) is commonly employed to approximately solve MCSs representing accident sequence logics from noncoherent core-damage fault trees. However, DTA can lead to an overestimation of CDF, particularly when fault trees contain many nonrare events. To address this issue, the present study introduces a new zero-suppressed ternary decision diagram (ZTDD) algorithm that averts the CDF overestimation caused by DTA. This ZTDD algorithm can optionally calculate MCSs with DTA or prime implicants (PIs) without any approximation from the core-damage fault tree. By calculating PIs, accurate CDF can be calculated. The present study provides a comprehensive explanation of the ZTDD structure, formula of the ZTDD algorithm, ZTDD minimization, probability calculation from ZTDD, strength of the ZTDD algorithm, and ZTDD application results. Results reveal that the ZTDD algorithm is a powerful tool that can quickly and accurately calculate CDF and drastically improve the safety of nuclear power plants.

LAT System for Fault Tree Generation (PLC로 제어되는 기계에서 Fault Tree를 효과적으로 생성하기 위한 LAT(Ladder Analysis Tool)개발)

  • 김선호;김동훈;김도연;한기상;김주한
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.10a
    • /
    • pp.442-445
    • /
    • 1997
  • A challenging activity in the manufacturing industry is to perform in real time the continuous monitoring of the process state, the situation assessment and identification of the problem on line and diagnosis of the cause and importance of the problem if he process does not work properly. This paper describes LAT(Ladder Analysis Tool) system for fault tree generation to improving the fault diagnosis of CNC machine tools. The system consists of 4 steps which can automatically ladder analysis from ladder diagram to two diagnosis function models. The two diagnostic models based on he ladder diagram is switching function model and step switching function model. This system tries to overcome diagnosis deficiencies present machine tool.

  • PDF

ALGORITHM FOR THE CONSTRUCTION OF THE STATE TRANSITION DIAGRAM OF A SACA OVER GF($2^p$)

  • Choi, Un-Sook;Cho, Sung-Jin
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.5_6
    • /
    • pp.1331-1342
    • /
    • 2009
  • In this paper, we analyze the behavior of the state transition of nongroup CA with a single attractor over GF($2^p$)(p > 1), and propose the algorithm for the construction of the state transition diagram of a Single Attractor CA(SACA) over GF($2^p$) which is very different from the construction algorithm for the state transition diagram of GF(2) SACA.

  • PDF