• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1705-1711
• /
• 1991

On-line fault detection and diagnosis has an increasing interest in a chemical process industry, especially for a process control and automation. The chemical process needs an intelligent operation-aided workstation which can do such tasks as process monitoring, fault detection, fault diagnosis and action guidance in semiautomatic mode. These tasks can increase the performance of a process operation and give merits in economics, safety and reliability. Aiming these tasks, series of researches have been done in our lab. Main results from these researches are building appropriate knowledge representation models and a diagnosis mechanism for fault detection and diagnosis in a chemical process. The knowledge representation schemes developed in our previous research, the symptom tree model and the fault-consequence digraph, showed the effectiveness and the usefulness in a real-time application, of the process diagnosis, especially in large and complex plants. However in our previous approach, the diagnosis speed is its demerit in spite of its merits of high resolution, mainly due to using two knowledge models complementarily. In our current study, new knowledge representation scheme is developed which integrates the previous two knowledge models, the symptom tree and the fault-consequence digraph, into one. This new model is constructed using a material balance, energy balance, momentum balance and equipment constraints. Controller related constraints are included in this new model, which possesses merits of the two previous models. This new integrated model will be tested and verified by the real-time application in a BTX process or a crude unit process. The reliability and flexibility will be greatly enhanced compared to the previous model in spite of the low diagnosis speed. Nexpert Object for the expert system shell and SUN4 workstation for the hardware platform are used. TCP/IP for a communication protocol and interfacing to a dynamic simulator, SPEEDUP, for a dynamic data generation are being studied.

• Journal of the Korean Society of Industry Convergence
• /
• v.26 no.2_2
• /
• pp.315-325
• /
• 2023

Recently, various dynamic risk analysis methods have been suggested for estimating the risk index by predicting the possibility of accidents and damage. It is necessary to maintain and support the safety system for responding to accidents by continuously updating the probability of accidents and the results of accidents, which are quantitative standards of ship risk. In this study, when a LNG leakage that may occur in the LN G Fuel Gas Supply System (FGSS) room during LN G bunkering operation, a reliability physical model was prepared by the change in monitoring data as physical parameters to estimate the accident probability. The scenario in which LNG leakage occur were configured with FT (Fault Tree), and the coefficient of the covariate model and Weibull distribution was estimated based on the monitoring data. The possibility of an LNG leakage, which is the top event of FT, was confirmed by changes in time and monitoring data. A method for estimating the LNG leakage based on the reliability physical analysis is proposed, which supports fast decision-making by identifying the potential LNG leakage at the accident.

• 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.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.07a
• /
• pp.337-340
• /
• 2014

클라우드 시스템이 큰 이슈로 떠오르면서 그 기반이 되는 분산 파일 시스템에 관한 연구가 계속되고 있다. 최근 제안된 분산파일 시스템은 대부분 확장 가능하며 신뢰성이 있는 시스템으로 구성되어 있으며 내고장성(Fault tolerance)과 높은 가용성을 위해 데이터 복제 기법을 사용하며 하둡 분산 파일 시스템에서는 블락의 복제수를 기본3개로 지정한다. 그러나 이 정책은 복제수가 많아지면 많아질수록 가용성은 높아지지만 스토리지 또한 증가한다는 단점이 있다. 본 논문에선 이러한 문제점을 해결하기 위해 최소한의 블락 복제수와 복제된 블락을 효율적으로 배치하여 더 좋은 성능과 부하분산(Load Balancing)하기 위한 기법을 제안한다.

• Nuclear Engineering and Technology
• /
• v.53 no.11
• /
• pp.3465-3473
• /
• 2021

For a long time, research into integrated deterministic-probabilistic safety assessment has been continuously conducted to point out and overcome the limitations of classical ET (event tree)/FT (fault tree) based PSA (probabilistic safety assessment). The current paper also attempts to assert the reason why a technical transformation from classical PSA is necessary with a re-interpretation of the categories of risk. In this study, residual risk was classified into interpolating- and extrapolating-censored categories, which represent risks that are difficult to identify through an interpolation or extrapolation of representative scenarios due to potential nonlinearity between hardware and human behaviors intertwined in time and space. The authors hypothesize that such risk can be dealt with only if the classical ETs/FTs are freely relocated, entailing large-scale computation associated with physical models. The functional elements that are favorable to find residual risk were inferred from previous studies. The authors then introduce their under-development enabling techniques, namely DICE (Dynamic Integrated Consequence Evaluation) and DeBATE (Deep learning-Based Accident Trend Estimation). This work can be considered as a preliminary initiative to find the bridging points between deterministic and probabilistic assessments on the pillars of big data technology.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.12
• /
• pp.637-644
• /
• 2004

This paper proposes an expert system with the knowledge learning capability which can enhance the safety and effectiveness of substation operation in the automated substation as well as existing substation by inferring multiple events such as main transformer fault, busbar fault and main transformer work schedule under multiple inference mode and multiple objective mode and by considering totally the switch status and the main transformer operating constraints. Especially inference mode includes the local minimum tree search method and pattern recognition method to enhance the performance of real-time bus reconfiguration strategy. The inference engine of the expert system consists of intuitive inferencing part and logical inferencing part. The intuitive inferencing part offers the control strategy corresponding to the event which is most similar to the real event by searching based on a minimum distance classification method of pattern recognition methods. On the other hand, logical inferencing part makes real-time control strategy using real-time mode(best-first search method) when the intuitive inferencing is failed. Also, it builds up a knowledge base or appends a new knowledge to the knowledge base using pattern learning function. The expert system has main transformer fault, main transformer maintenance work and bus fault processing function. It is implemented as computer language, Visual C++ which has a dynamic programming function for implementing of inference engine and a MFC function for implementing of MMI. Finally, it's accuracy and effectiveness is proved by several event simulation works for a typical substation.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.801-812
• /
• 2002

On-line reorganization in a shared nothing database cluster is crucial to the performance of the database system in a dynamic environment like WWW where the number of users grows rapidly and changing access patterns may exhibit high skew. In the existing method of on-line reorganization have a drawback that needs excessive data migrations in case more than two nodes within a cluster have overload at the same time. In this paper, we propose an advanced B$^{+}$ tree based on-line reorganization method that solves data skew on multi-nodes. Our method facilitates fast and efficient data migration by including spare nodes that are added to cluster through on-line scaling. Also we apply CSB$^{+}$ tree (Cache Sensitive B$^{+}$ tree) to our method instead of B$^{+}$ tree for fast select and update queries. We conducted performance study and implemented the method on Ultra Fault-Tolerant Database Cluster developed for high scalability and availability. Empirical results demonstrate that our proposed method is indeed effective and fast than the existing method. method.

• Journal of KIISE:Information Networking
• /
• v.34 no.2
• /
• pp.120-133
• /
• 2007

A multicast tree includes several, possibly a large number of, paths connecting source-receiver pairs, and network failure may disable part of the multicast tree. Reconstruction of the entire multicast tree to recover from a component failure is highly undesirable, because some group members have to suffer service disruptions even though the communication paths to/from them are not affected by the failure. To limit reconfiguration region and to maximize the likelihood of successful reconfiguration, we propose and evaluate a pre-planned reconfiguration policy for QoS multicast sessions. Specifically, we equip a reconfiguration path (RP) with each end-to-end path that connects a source-receiver pair in the multicast tree, and reserve resources in advance along the RPs. Efficient resource-sharing techniques are applied to reduce the amount of resources reserved for RPs but not used in the absence of failures. This way, we prevent uncontrolled competition among different multicast sessions which may simultaneously try to recover from failures. We evaluate the performance of the proposed scheme using simulation on randomly-generated networks. We use the shortest-path routing for QoS multicast sessions, and simulate both source-based and shared multicast trees. The evaluation results indicates that successful pre-planned reconfiguration can be achieved for all group members with reasonable overhead. Our scheme is also shown to adapt well to dynamic changes of group membership.

• Nuclear Engineering and Technology
• /
• v.51 no.6
• /
• pp.1540-1553
• /
• 2019

A nuclear power plant (NPP) is a highly complex system-of-systems as manifested through its internal systems interdependence. The negative impact of such interdependence was demonstrated through the 2011 Fukushima Daiichi nuclear disaster. As such, there is a critical need for new strategies to overcome the limitations of current risk assessment techniques (e.g. the use of static event and fault tree schemes), particularly through simulation of the nonlinear dynamic feedback mechanisms between the different NPP systems/components. As the first and key step towards developing an integrated NPP dynamic probabilistic risk assessment platform that can account for such feedback mechanisms, the current study adopts a system dynamics simulation approach to model the thermal dynamic processes in: the reactor core; the secondary coolant system; and the pressurized water reactor. The reactor core and secondary coolant system parameters used to develop system dynamics models are based on those of the Palo Verde Nuclear Generating Station. These three system dynamics models are subsequently validated, using results from published work, under different system perturbations including the change in reactivity, the steam valve coefficient, the primary coolant flow, and others. Moving forward, the developed system dynamics models can be integrated with other interacting processes within a NPP to form the basis of a dynamic system-level (systemic) risk assessment tool.

• Nuclear Engineering and Technology
• /
• v.40 no.7
• /
• pp.571-580
• /
• 2008

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 it is highly memory consuming. In order to solve a large reliability problem within limited computational resources, many attempts have been made, such as static and dynamic variable ordering schemes, to minimize BDD size. Additional effort was the development of a ZBDD (Zero-suppressed BDD) algorithm to calculate an approximate TEP. The present method is the first successful application of a BDD truncation. The new method is an efficient method to maintain a small BDD size by a BDD truncation during a BDD calculation. The benchmark tests demonstrate the efficiency of the developed method. The TEP rapidly converges to an exact value according to a lowered truncation limit.