• Title/Summary/Keyword: event graph

Search Result 79, Processing Time 0.025 seconds

Terminal Reliability Evaluation in RBN and MANET (RBN과 MANET에서의 터미널 간 신뢰도 평가)

  • Lee Jun-Hyuk;Kim Kyung-Mok;Oh Young-Hwan
    • Journal of Applied Reliability
    • /
    • v.6 no.2
    • /
    • pp.187-194
    • /
    • 2006
  • In this paper, We presented the algorithm for estimating a reliability between nodes in wireless communication network such as RBN and MANET To estimate the reliability between nodes, we first modeled RNB and MANET as probability graph. Branches of the graph are always reliable and the probability of node failure is independent. After all possible simple path which can be established between two nodes are examined, we perform sharp arithmetic to remove repetition event between two nodes. Using probability for each variable of the minimized Boolean equation, we present the reliability formula.

  • PDF

Computing Reliability Cluster-based in Wireless Distributed Sensor Networks (클러스터 기반의 무선 분산 센서 네트워크에서의 터미널 간 신뢰도 평가)

  • Lee, Jun-Hyuk;Oh, Young-Hwan
    • Journal of Applied Reliability
    • /
    • v.6 no.4
    • /
    • pp.297-306
    • /
    • 2006
  • In this paper, We presented the algorithm for estimating a reliability between nodes in wireless distributed sensor networks (DSN). To estimate the reliability between nodes, we first modeled DSN as probability graph. Links of the graph are always reliable and the probability of node failure is independent. After all possible simple path which can be established between two nodes are examined, we perform sharp operation to remove repetition event between two nodes. Using probability for each variable of the minimized Boolean equation, we present the reliability formula.

  • PDF

Cyberattack Tracing System Operational Architecture (사이버공격 추적시스템 운용아키텍처)

  • Ahn, Jae-hong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.26 no.2
    • /
    • pp.179-187
    • /
    • 2023
  • APT cyber attacks have been a problem for over a past decade, but still remain a challenge today as attackers use more sophisticated techniques and the number of objects to be protected increases. 'Cyberattack Tracing System' allows analysts to find undetected attack codes that penetrated and hid in enterprises, and to investigate their lateral movement propagation activities. The enterprise is characterized by multiple networks and mass hosts (PCs/servers). This paper presents a data processing procedure that collects event data, generates a temporally and spatially extended provenance graph and cyberattack tracing paths. In each data process procedure phases, system design considerations are suggested. With reflecting the data processing procedure and the characteristics of enterprise environment, an operational architecture for CyberAttack Tracing System is presented. The operational architecture will be lead to the detailed design of the system.

Study on the Correlation between Grip Strength and EEG (악력 세기와 뇌파의 상관관계에 관한 연구)

  • Kim, Dong-Eun;Park, Seung-Min;Sim, Kwee-Bo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.9
    • /
    • pp.853-859
    • /
    • 2013
  • The purpose of this study was to identify the correlation between electroencephalography (EEG) and strength, using grip strength. 64-channel EEG data were recorded from five healthy subjects in tasks requiring handgrip contractions of nine levels of MVC (Maximal Voluntary Contraction). We found the ERS (Event-Related Synchronization)/ERD (Event-Related Desynchronization) at the measured EEG data using STFT (Short-Time Furier Transform) and spectral power in the EEG of each frequency range displayed in the graph. In this paper, we identified that the stronger we contracted, the greater the spectral power was increased in the ${\beta}$, ${\gamma}$ wave.

A Study on Real time Multiple Fault Diagnosis Control Methods (실시간 다중고장진단 제어기법에 관한 연구)

  • 배용환;배태용;이석희
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1995.04b
    • /
    • pp.457-462
    • /
    • 1995
  • This paper describes diagnosis strategy of the Flexible Multiple Fault Diagnosis Module for forecasting faults in system and deciding current machine state form sensor information. Most studydeal with diagnosis control stategy about single fault in a system, this studies deal with multiple fault diagnosis. This strategy is consist of diagnosis control module such as backward tracking expert system shell, various neural network, numerical model to predict machine state and communication module for information exchange and cooperate between each model. This models are used to describe structure, function and behavior of subsystem, complex component and total system. Hierarchical structure is very efficient to represent structural, functional and behavioral knowledge. FT(Fault Tree). ST(Symptom Tree), FCD(Fault Consequence Diagrapy), SGM(State Graph Model) and FFM(Functional Flow Model) are used to represent hierachical structure. In this study, IA(Intelligent Agent) concept is introduced to match FT component and event symbol in diagnosed system and to transfer message between each event process. Proposed diagnosis control module is made of IPC(Inter Process Communication) method under UNIX operating system.

  • PDF

Bus Reconfiguration Strategy Based on Local Minimum Tree Search for the Event Processing of Automated Distribution Substations

  • Ko Yun-Seok
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.2
    • /
    • pp.177-185
    • /
    • 2005
  • This paper proposes an expert system that can enhance the accuracy of real-time bus reconfiguration strategy by adopting the local minimum tree search method and that can minimize the spreading effect of the fault by considering the operating condition when a main transformer fault occurs in an automated substation. The local minimum tree search method is used to expand the best-first search method. This method has the advantage that it can improve the solution performance within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. The second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules from the obtained switching candidate set. Also, this paper proposes generalized distribution substation modeling using graph theory, and a substation database based on the study results is designed.

Discrete Event System with Bounded Random Time Variation (제한된 시간변동을 갖는 시간제약 이산사건시스템의 스케줄링 분석)

  • Kim Ja Hui;Lee Tae Eok
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.923-929
    • /
    • 2002
  • We discuss scheduling analysis for a discrete event system with time windows of which firing or holding time delays are subject to random variation within some finite range. To do this, we propose a modified p-lime Petri net, named p+-time Petri net. We develop a condition for which a synchronized transition does not have a dead token, that is, the firing epochs do not violate the time window constraints. We propose a method of computing the feasible range of the token sojourn time at each place based on a time difference graph. We also discuss an application for analyzing wafer residency times within the process chambers for a dual-armed cluster tool for chemical vapor deposition.

  • PDF

Bus Reconfiguration Strategy Based on Local Minimum Tree Search for the Event Processing of Automated Distribution Substation (자동화된 변전소의 이벤트 발생시 준최적 탐색법에 기반한 모선 재구성 전략의 개발)

  • Ko Yun-Seok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.53 no.10
    • /
    • pp.565-572
    • /
    • 2004
  • This paper proposes an expert system which can enhance the accuracy of real-time bus reconfiguration strategy by adopting local minimum tree search method and minimize the spreading effect of the fault by considering totally the operating condition when a main transformer fault occurs in the automated substation. The local minimum tree search method to expand the best-first search method. This method has an advantage which can improve the performance of solution within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. And, second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules for the obtained switching candidate set. Also, this paper studies the generalized distribution substation modelling using graph theory and a substation database is designed based on the study result. The inference engine of the expert system and the substation database is implemented in MFC function of Visual C++. Finally, the performance and effectiveness of the proposed expert system is verified by comparing the best-first search solution and local minimum tree search solution based on diversity event simulations for typical distribution substation.

NEW RESULTS TO BDD TRUNCATION METHOD FOR EFFICIENT TOP EVENT PROBABILITY CALCULATION

  • Mo, Yuchang;Zhong, Farong;Zhao, Xiangfu;Yang, Quansheng;Cui, Gang
    • Nuclear Engineering and Technology
    • /
    • v.44 no.7
    • /
    • pp.755-766
    • /
    • 2012
  • A Binary Decision Diagram (BDD) is a graph-based data structure that calculates an exact top event probability (TEP). It has been a very difficult task to develop an efficient BDD algorithm that can solve a large problem since its memory consumption is very high. Recently, in order to solve a large reliability problem within limited computational resources, Jung presented an efficient method to maintain a small BDD size by a BDD truncation during a BDD calculation. In this paper, it is first identified that Jung's BDD truncation algorithm can be improved for a more practical use. Then, a more efficient truncation algorithm is proposed in this paper, which can generate truncated BDD with smaller size and approximate TEP with smaller truncation error. Empirical results showed this new algorithm uses slightly less running time and slightly more storage usage than Jung's algorithm. It was also found, that designing a truncation algorithm with ideal features for every possible fault tree is very difficult, if not impossible. The so-called ideal features of this paper would be that with the decrease of truncation limits, the size of truncated BDD converges to the size of exact BDD, but should never be larger than exact BDD.

A Logical Simulation of Dynamic Natural Phenomena Based on Event Propagation Graph (사건 전파그래프에 기반한 동적인 자연현상의 논리적 시뮬레이션)

  • Park, Jung-Yong;Park, Jong-Hee
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.38 no.4
    • /
    • pp.10-21
    • /
    • 2001
  • This paper develops a logical simulation method for by dyversity of situations. Most existing systems, for example, games and infant tutoring systems lead users to virtual environment with unfolding situations, but are not designed to induce the change of the environment itself. In this paper, a logically simulated environment is created by defining situations and single events based on situation hierarchy structure. We elaborate the occurrence of events by classifying the causality. The occurrence or natural phenomena is dictated by physical laws and natural phenomena are expressed as the transition of the event based on event association. Specifically we define the source of the event for natural phenomena and we consider the existence of objects as a primary factor in event occurrence. The advantages of this approach include the reuse of events, that is, different events can be generated in the same flow with fresh conditions. This allows us to implement a more practical and logical environment. A drawback to this method is the difficulty in dividing a situation into events. The proposed method was implemented in the context of the change of season among natural phenomena.

  • PDF