237 research outputs found

    Qualitative Fault Detection and Hazard Analysis Based on Signed Directed Graphs for Large-Scale Complex Systems

    Get PDF
    Nowadays in modern industries, the scale and complexity of process systems are increased continuously. These systems are subject to low productivity, system faults or even hazards because of various conditions such as mis-operation, equipment quality change, externa

    Minimising the kullback-leibler divergence for model selection in distributed nonlinear systems

    Full text link
    ยฉ 2018 by the authors. The Kullback-Leibler (KL) divergence is a fundamental measure of information geometry that is used in a variety of contexts in artificial intelligence. We show that, when system dynamics are given by distributed nonlinear systems, this measure can be decomposed as a function of two information-theoretic measures, transfer entropy and stochastic interaction. More specifically, these measures are applicable when selecting a candidate model for a distributed system, where individual subsystems are coupled via latent variables and observed through a filter. We represent this model as a directed acyclic graph (DAG) that characterises the unidirectional coupling between subsystems. Standard approaches to structure learning are not applicable in this framework due to the hidden variables; however, we can exploit the properties of certain dynamical systems to formulate exact methods based on differential topology. We approach the problem by using reconstruction theorems to derive an analytical expression for the KL divergence of a candidate DAG from the observed dataset. Using this result, we present a scoring function based on transfer entropy to be used as a subroutine in a structure learning algorithm. We then demonstrate its use in recovering the structure of coupled Lorenz and Rรถssler systems

    Plant-Wide Diagnosis: Cause-and-Effect Analysis Using Process Connectivity and Directionality Information

    Get PDF
    Production plants used in modern process industry must produce products that meet stringent environmental, quality and profitability constraints. In such integrated plants, non-linearity and strong process dynamic interactions among process units complicate root-cause diagnosis of plant-wide disturbances because disturbances may propagate to units at some distance away from the primary source of the upset. Similarly, implemented advanced process control strategies, backup and recovery systems, use of recycle streams and heat integration may hamper detection and diagnostic efforts. It is important to track down the root-cause of a plant-wide disturbance because once corrective action is taken at the source, secondary propagated effects can be quickly eliminated with minimum effort and reduced down time with the resultant positive impact on process efficiency, productivity and profitability. In order to diagnose the root-cause of disturbances that manifest plant-wide, it is crucial to incorporate and utilize knowledge about the overall process topology or interrelated physical structure of the plant, such as is contained in Piping and Instrumentation Diagrams (P&IDs). Traditionally, process control engineers have intuitively referred to the physical structure of the plant by visual inspection and manual tracing of fault propagation paths within the process structures, such as the process drawings on printed P&IDs, in order to make logical conclusions based on the results from data-driven analysis. This manual approach, however, is prone to various sources of errors and can quickly become complicated in real processes. The aim of this thesis, therefore, is to establish innovative techniques for the electronic capture and manipulation of process schematic information from large plants such as refineries in order to provide an automated means of diagnosing plant-wide performance problems. This report also describes the design and implementation of a computer application program that integrates: (i) process connectivity and directionality information from intelligent P&IDs (ii) results from data-driven cause-and-effect analysis of process measurements and (iii) process know-how to aid process control engineers and plant operators gain process insight. This work explored process intelligent P&IDs, created with AVEVAยฎ P&ID, a Computer Aided Design (CAD) tool, and exported as an ISO 15926 compliant platform and vendor independent text-based XML description of the plant. The XML output was processed by a software tool developed in Microsoftยฎ .NET environment in this research project to computationally generate connectivity matrix that shows plant items and their connections. The connectivity matrix produced can be exported to Excelยฎ spreadsheet application as a basis for other application and has served as precursor to other research work. The final version of the developed software tool links statistical results of cause-and-effect analysis of process data with the connectivity matrix to simplify and gain insights into the cause and effect analysis using the connectivity information. Process knowhow and understanding is incorporated to generate logical conclusions. The thesis presents a case study in an atmospheric crude heating unit as an illustrative example to drive home key concepts and also describes an industrial case study involving refinery operations. In the industrial case study, in addition to confirming the root-cause candidate, the developed software tool was set the task to determine the physical sequence of fault propagation path within the plant. This was then compared with the hypothesis about disturbance propagation sequence generated by pure data-driven method. The results show a high degree of overlap which helps to validate statistical data-driven technique and easily identify any spurious results from the data-driven multivariable analysis. This significantly increase control engineers confidence in data-driven method being used for root-cause diagnosis. The thesis concludes with a discussion of the approach and presents ideas for further development of the methods

    Industrial fault detection and diagnosis using Bayesian belief network

    Get PDF
    Rapid development in industry have contributed to more complex systems that are prone to failure. In applications where the presence of faults may lead to premature failure, fault detection and diagnostics tools are often implemented. The goal of this research is to improve the diagnostic ability of existing FDD methods. Kernel Principal Component Analysis has good fault detection capability, however it can only detect the fault and identify few variables that have contribution on occurrence of fault and thus not precise in diagnosing. Hence, KPCA was used to detect abnormal events and the most contributed variables were taken out for more analysis in diagnosis phase. The diagnosis phase was done in both qualitative and quantitative manner. In qualitative mode, a networked-base causality analysis method was developed to show the causal effect between the most contributing variables in occurrence of the fault. In order to have more quantitative diagnosis, a Bayesian network was constructed to analyze the problem in probabilistic perspective

    A Review of Kernel Methods for Feature Extraction in Nonlinear Process Monitoring

    Get PDF
    Kernel methods are a class of learning machines for the fast recognition of nonlinear patterns in any data set. In this paper, the applications of kernel methods for feature extraction in industrial process monitoring are systematically reviewed. First, we describe the reasons for using kernel methods and contextualize them among other machine learning tools. Second, by reviewing a total of 230 papers, this work has identified 12 major issues surrounding the use of kernel methods for nonlinear feature extraction. Each issue was discussed as to why they are important and how they were addressed through the years by many researchers. We also present a breakdown of the commonly used kernel functions, parameter selection routes, and case studies. Lastly, this review provides an outlook into the future of kernel-based process monitoring, which can hopefully instigate more advanced yet practical solutions in the process industries

    Visualization of fault propagation paths in process monitoring systems

    Get PDF
    Modern industrial processes typically have complex interconnections among process equipment and units. A fault can easily propagate far beyond its origin, making it difficult to locate the root cause and to identify its propagation paths. Thus, the latest approach for identifying fault propagation paths uses qualitative models, e.g., topology-based models, for improving the results acquired from the data-driven methods of causal analysis. However, the current approach includes no display of the fault propagation paths in process monitoring systems, which could enable the visualisation of the spread of fault effects. In this thesis, the aim is to develop and to test a new technique which enables a process monitoring system to display fault propagation paths, based on the causality matrix obtained from a process. A causality matrix is created using the Granger causality method, which contains the details of the fault propagation path. Subsequently, the causality matrix is refined using a connectivity matrix, which was obtained from a piping and instrumentation diagram (P&ID). Furthermore, the process monitoring system and the refined causality matrix are linked together, to transfer the fault propagation paths details to the process monitoring interface. A number of algorithms in the automation system are developed and implemented to accomplish the link. A flotation pilot process is the case study in this thesis, used for testing this technique. The experiment data acquired from the flotation pilot was analysed to generate a causality matrix, which is subsequently refined and stored in the database of the automation system. Hence, the fault propagation paths is visualised in the process monitoring system. Finally, this procedure confirmed that the propagation of the effects of a fault is better understood if the propagation path is visualised in the process monitoring system

    Improving the interpretability of causality maps for fault identification

    Get PDF
    Thesis (MEng)--Stellenbosch University, 2020.ENGLISH ABSTRACT: Worldwide competition forces modern mineral processing plants to operate at high productivity. This high productivity is achieved by implementing process monitoring to maintain the desired operating conditions. However, a fault originating in one section of a plant can propagate throughout the plant and so obscure its root cause. Causality analysis is a method that identifies the cause-effect relationships between process variables and presents these in a causality map which can be used to track the propagation path of a fault back to its root cause. A major obstacle to the wide acceptance of causality analysis as a tool for fault diagnosis in industry is the poor interpretability of causality maps. This study identified, proposed and assessed ways to improve the interpretability of causality maps for fault identification. All approaches were tested on a simulated case study and the resulting maps compared to a standard causality map or its transitive reduction. The ideal causality map was defined and all comparisons were performed based on its characteristics. Causality maps were produced using conditional Granger causality (GC), with a novel heuristic approach for selecting sampling period and time window. Conditional GC was found to be ill-suited to plant-wide causality analysis, due to large data requirements, poor model order selection using AIC, and inaccuracy in the presence of multiple different residence times and time delays. Methods to incorporate process knowledge to constrain connections and potential root causes were investigated and found to remove all spurious connections and decrease the pool of potential root cause variables respectively. Tools such as visually displaying node rankings on the causality map and incorporating sliders to manipulate connections and variables were also investigated. Furthermore, a novel hierarchical approach for plant-wide causality analysis was proposed, where causality maps were constructed in two subsequent stages. In the first stage, a less-detailed plant-wide map was constructed using representatives for groups of variables, and used to localise the fault to one of those groups of variables. Variables were grouped according to plant sections or modules identified in the data, and the first principal component (PC1) was used to represent each group (PS-PC1 and Mod-PC1 respectively). PS-PC1 was found to be the most promising approach, as its plant-wide map clearly identified the true root cause location, and the stage-wise application of conditional GC significantly reduced the required number of samples from 13 562 to 602. Lastly, a usability study in the form of a survey was performed to investigate the potential for industrial application of the tools and approaches presented in this study. Twenty responses were obtained, with participants consisting of Stellenbosch University final-year/postgraduate students, employees of an industrial IoT firm, and Anglo American Platinum employees. Main findings include that process knowledge is vital; grouping variables improves interpretability by decreasing the number of nodes; accuracy must be maintained during causality map simplification; and sliders add confusion by causing significant changes in the causality map. In addition, survey results found PS-PC1 to be the most user-friendly approach, further emphasizing its potential for application in industry.AFRIKAANSE OPSOMMING: Wรชreldwye kompetisie forseer moderne mineraalprosesseringaanlegte om by hoรซ produktiwiteit bedryf te word. Hierdie hoรซ produktiwiteit word bereik deur prosesmonitering te implementeer om die gewenste bedryfskondisies te handhaaf. โ€™n Fout wat in een deel van โ€™n aanleg ontstaan kan egter regdeur die aanleg voortplant en so die grondoorsaak verberg. Oorsaaklikheidanalise is โ€™n metode wat die oorsaak-en-gevolg-verhouding tussen prosesveranderlikes identifiseer en hierdie in โ€™n oorsaaklikheidskaart toon wat gebruik kan word om die voortplantings roete van โ€™n fout terug na sy grondoorsaak te volg. โ€™n Groot hindernis vir die wye aanvaarding van oorsaaklikheidanalise as instrument vir foutdiagnose in industrie, is die swak interpreteerbaarheid van oorsaaklikheidskaarte. Hierdie studie het maniere om die interpreteerbaarheid van oorsaaklikheidskaarte vir foutidentifikasie te verbeter, geรฏdentifiseer, voorgestel en geassesseer. Alle benaderings is getoets op โ€™n gesimuleerde gevallestudie en die resulterende kaarte is vergelyk met โ€™n standaard oorsaaklikheidskaart of sy transitiewe inkrimping. Die ideale oorsaaklikheidskaart is gedefinieer en alle vergelykings is uitgevoer gebaseer op sy karakteristieke. Oorsaaklikheidskaarte is geproduseer deur kondisionele Granger-oorsaaklikheid (GC) te gebruik, met โ€™n nuwe heuristiese benadering om steekproefperiode en tydgleuf te selekteer. Kondisionele GC is gevind om nie gepas te wees vir aanlegwye oorsaaklikheidanalise nie, as gevolg van groot datavereistes, swak seleksie van modelorde as AIC gebruik word, en onakkuraatheid in die teenwoordigheid van veelvoudige, verskillende verblyftye en tydvertraging. Metodes om proseskennis te inkorporeer om konneksies en potensiรซle grondoorsake te bedwing, is ondersoek en gevind om alle konneksies wat vals is te verwyder en die groep van potensiรซle grondoorsaakveranderlikes te verminder, onderskeidelik. Instrumente soos om node-ordes op die oorsaaklikheidskaart visueel te vertoon en skuiwers te inkorporeer om konneksies en veranderlikes te manipuleer is ook ondersoek. Verder is โ€™n nuwe hiรซrargiese benadering vir aanlegwye oorsaaklikheidanalise voorgestel, waar oorsaaklikheidskaarte in twee opeenvolgende fases gebou is. In die eerste fase is โ€™n minder gedetaileerde aanlegwye kaart gebou deur verteenwoordigers vir groepe veranderlikes te gebruik, en is gebruik om die fout na een van daardie groepe van veranderlikes te lokaliseer. Veranderlikes is gegroepeer volgens aanlegdele of modules geรฏdentifiseer in die data, en die eerste hoof komponent (PC1) is gebruik om elke groep te verteenwoordig (PS-PC1 en Mod-PC1 onderskeidelik). PS-PC1 is gevind om die mees belowende benadering te wees, want sy aanlegwye kaart het duidelik die ware grondoorsaakligging geรฏdentifiseer, en die stap-gewyse toepassing van kondisionele GC het die vereisde aantal steekproewe beduidend verminder van 13 562 tot 602. Laastens, โ€™n bruikbaarheidstudie in die vorm van โ€™n opname is uitgevoer om die potensiaal vir industriรซle toepassing van die instrumente en benaderinge voorgestel in hierdie studie, te ondersoek. Twintig antwoorde is verkry, met deelnemers wat bestaan het uit Universiteit van Stellenbosch se finale jaar/nagraadse studente, werknemers van โ€™n industriรซle IoT-firma, en Anglo American Platinum werknemers. Hoofbevindinge het ingehou dat proseskennis noodsaaklik is; om veranderlikes te groepeer verbeter interpreteerbaarheid deur die aantal nodes te verminder; akkuraatheid moet gehandhaaf word gedurende vereenvoudiging van oorsaaklikheidskaarte; en skuiwers dra by tot verwarring deur beduidende veranderinge in die oorsaaklikheidskaart te maak. Daarmee saam het die opname se resultate gevind dat PS-PC1 die meer gebruiksvriendelike benadering was, wat sy potensiaal vir toepassing verder beklemtoon.Master

    ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ ํ•™์Šต ๋ฐ ์ถ”๋ก ๊ณผ ๊ทธ๋ž˜ํ”„ ๋ผ์˜๋ฅผ ํ™œ์šฉํ•œ ๊ณต์ • ์ด์ƒ ๊ฐ์ง€ ๋ฐ ์ง„๋‹จ ๋ฐฉ๋ฒ•๋ก 

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ)-- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ํ™”ํ•™์ƒ๋ฌผ๊ณตํ•™๋ถ€, 2019. 2. ์ด์›๋ณด.Fault detection and diagnosis (FDD) is an essential part of safe plant operation. Fault detection refers to the process of detecting the occurrence of a fault quickly and accurately, and representative methods include the use of principal component analysis (PCA), and autoencoders (AE). Fault diagnosis is the process of isolating the root cause node of the fault, then determining the fault propagation path to identify the characteristic of the fault. Among the various methods, data-driven methods are the most widely-used, due to their applicability and good performance compared to analytical and knowledge-based methods. Although many studies have been conducted regarding FDD, no methodology for conducting every step of FDD exists, where the fault is effectively detected and diagnosed. Moreover, existing methods have limited applicability and show limited performance. Previous fault detection methods show loss of variable characteristics in dimensionality reduction methods and have large computational loads, leading to poor performance for complex faults. Likewise, preceding fault diagnosis methods show inaccurate fault isolation results, and biased fault propagation path analysis as a consequence of implementing knowledge-based characteristics for construction of digraphs of process variable relationships. Thus a comprehensive methodology for FDD which shows good performance for complex faults and variable relationships, is required. In this study, an efficient and effective comprehensive FDD methodology based on Markov random fields (MRF) modelling is proposed. MRFs provide an effective means for modelling complex variable relationships, and allows efficient computation of marginal probability of the process variables, leading to good performance regarding FDD. First, a fault detection framework for process variables, integrating the MRF modelling and structure learning with iterative graphical lasso is proposed. Graphical lasso is an algorithm for learning the structure of MRFs, and is applicable to large variable sets since it approximates the MRF structure by assuming the relationships between variables to be Gaussian. By iteratively applying the graphical lasso to monitored variables, the variable set is subdivided into smaller groups, and consequently the computational cost of MRF inference is mitigated allowing efficient fault detection. After variable groups are obtained through iterative graphical lasso, they are subject to the MRF monitoring framework that is proposed in this work. The framework obtains the monitoring statistics by calculating the probability density of the variable groups through kernel density estimation, and the monitoring limits are obtained separately for each group by using a false alarm rate of 5%. Second, a fault isolation and propagation path analysis methodology is proposed, where the conditional marginal probability of each variable is computed via inference, then is used to calculate the conditional contribution of individual variables during the occurrence of a fault. Using the kernel belief propagation (KBP) algorithm, which is an algorithm for learning and inferencing MRFs comprising continuous variables, the parameters of MRF are trained using normal process data, then the individual conditional contribution of each variable is calculated for every sample of the fault process data. By analyzing the magnitude and reaction speed of the conditional contribution of individual variables, the root fault node can be isolated and the fault propagation path can be determined effectively. Finally, the proposed methodology is verified by applying it to the well-known Tennessee Eastman process (TEP) model. Since the TEP has been used as a benchmark process over the past years for verifying various FDD methods, it serves the purpose of performance comparison. Also, since it consists of multiple units and has complex variable relationships such as recycle loops, it is suitable for verifying the performance of the proposed methodology. Application results show that the proposed methodology performs better compared to state-of-the-art FDD algorithms, in terms of both fault detection and diagnosis. Fault detection results showed that all 28 faults designed inside the TEP model were detected with a fault detection accuracy of over 95%, which is higher than any other previously proposed fault detection method. Also, the method showed good fault isolation and propagation path analysis results, where the root-cause node for every fault was detected correctly, and the characteristics of the initiated faults were identified through fault propagation path analysis.๊ณต์ • ์ด์ƒ์˜ ๊ฐ์ง€ ๋ฐ ์ง„๋‹จ ์‹œ์Šคํ…œ์€ ์•ˆ์ „ํ•œ ๊ณต์ • ์šด์˜์— ํ•„์ˆ˜์ ์ธ ๋ถ€๋ถ„์ด๋‹ค. ์ด์ƒ ๊ฐ์ง€๋Š” ์ด์ƒ์ด ๋ฐœ์ƒํ–ˆ์„ ๊ฒฝ์šฐ ์ฆ‰๊ฐ์ ์œผ๋กœ ์ด๋ฅผ ์ •ํ™•ํ•˜๊ฒŒ ๊ฐ์ง€ํ•˜๋Š” ํ”„๋กœ์„ธ์Šค๋ฅผ ์˜๋ฏธํ•˜๋ฉฐ, ๋Œ€ํ‘œ์ ์ธ ๋ฐฉ๋ฒ•์œผ๋กœ๋Š” ์ฃผ์„ฑ๋ถ„ ๋ถ„์„ ๋ฐ ์˜คํ† ์ธ์ฝ”๋”๋ฅผ ํ™œ์šฉํ•œ ๊ฐ์ง€ ๋ฐฉ๋ฒ•๋ก ์ด ์žˆ๋‹ค. ์ด์ƒ ์ง„๋‹จ์€ ๊ฒฐํ•จ์˜ ๊ทผ๋ณธ ์›์ธ์ด ๋˜๋Š” ๋…ธ๋“œ๋ฅผ ๊ฒฉ๋ฆฌํ•˜๊ณ , ์ด์ƒ์˜ ์ „ํŒŒ ๊ฒฝ๋กœ๋ฅผ ํƒ์ง€ํ•˜์—ฌ ์ด์ƒ์˜ ํŠน์„ฑ์„ ์‹๋ณ„ํ•˜๋Š” ํ”„๋กœ์„ธ์Šค์ด๋‹ค. ๊ณต์ • ์ด์ƒ์˜ ๊ฐ์ง€ ๋ฐ ์ง„๋‹จ ๋ฐฉ๋ฒ•๋ก ์—๋Š” ๋ชจ๋ธ ๋ถ„์„ ๋ฐฉ๋ฒ•๋ก , ์ง€์‹ ๊ธฐ๋ฐ˜ ๋ฐฉ๋ฒ•๋ก  ๋“ฑ์˜ ๋‹ค์–‘ํ•œ ๋ฐฉ๋ฒ•๋ก ์ด ์žˆ์ง€๋งŒ, ๊ณต์ •์— ๋Œ€ํ•œ ์ ์šฉ ๊ฐ€๋Šฅ์„ฑ๊ณผ ์„ฑ๋Šฅ ์ธก๋ฉด์—์„œ ๊ฐ€์žฅ ์œ ์šฉํ•˜๋‹ค๊ณ  ์•Œ๋ ค์ ธ ์žˆ๋Š” ๋ฐ์ดํ„ฐ ๊ธฐ๋ฐ˜ ๋ฐฉ๋ฒ•๋ก ์ด ๋„๋ฆฌ ํ™œ์šฉ๋˜๊ณ  ์žˆ๋‹ค. ๊ณต์ • ์ด์ƒ์˜ ๊ฐ์ง€ ๋ฐ ์ง„๋‹จ์— ๋Œ€ํ•œ ๋ฐ์ดํ„ฐ ๊ธฐ๋ฐ˜ ๋ฐฉ๋ฒ•๋ก ์€ ๋‹ค๋ฐฉ๋ฉด์œผ๋กœ ์—ฐ๊ตฌ๋˜์–ด ์™”์ง€๋งŒ, ์ด์ƒ ๊ฐ์ง€ ๋ฐ ์ง„๋‹จ์„ ๋ชจ๋‘ ํšจ๊ณผ์ ์œผ๋กœ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ๋Š” ๋ฐฉ๋ฒ•๋ก ์€ ์†Œ์ˆ˜์— ๋ถˆ๊ณผํ•˜๋ฉฐ, ์กด์žฌํ•˜๊ณ  ์žˆ๋Š” ๋ฐฉ๋ฒ•๋ก ๋“ค ์—ญ์‹œ ๋‘ ๋ถ„์•ผ ๋ชจ๋‘์—์„œ ์ข‹์€ ์„ฑ๋Šฅ์„ ๋ณด์—ฌ์ฃผ๊ณ  ์žˆ๋Š” ๊ฒฝ์šฐ๋Š” ์—†๋‹ค. ์ด๋Š” ๊ธฐ์กด ๋ฐฉ๋ฒ•๋ก ๋“ค์˜ ์ ์šฉ ๊ฐ€๋Šฅ์„ฑ์ด ์ œํ•œ๋˜์–ด ์žˆ์œผ๋ฉฐ ๊ณต์ •์— ์ ์šฉ์‹œ ์ œํ•œ๋œ ์„ฑ๋Šฅ์„ ๋ณด์—ฌ์ฃผ๊ธฐ ๋•Œ๋ฌธ์ด๋‹ค. ์ด์ƒ ๊ฐ์ง€์˜ ๊ฒฝ์šฐ, ๋Œ€์šฉ๋Ÿ‰์˜ ๋ฐ์ดํ„ฐ๋ฅผ ์ฒ˜๋ฆฌํ•  ๋•Œ ๋ฐœ์ƒํ•˜๋Š” ๊ณผ๋ถ€ํ•˜๋กœ ์ธํ•œ ๊ฐ์ง€ ๋Šฅ๋ ฅ์˜ ์ €ํ•˜, ์ฐจ์› ์ถ•์†Œ ๋ฐฉ๋ฒ•๋ก ๋“ค์„ ์‚ฌ์šฉํ•  ์‹œ ์ด์— ๋”ฐ๋ฅธ ๋ณ€์ˆ˜ ํŠน์„ฑ ๋ฐ˜์˜์˜ ๋ถ€์ •ํ™•์„ฑ, ๊ทธ๋ฆฌ๊ณ  ์ถ•์†Œ๋œ ์ฐจ์›์—์„œ์˜ ๊ณ„์‚ฐ์œผ๋กœ ์ธํ•˜์—ฌ ๋ณตํ•ฉ์ ์ธ ํ˜•ํƒœ์˜ ์ด์ƒ์„ ๊ฐ์ง€ํ•ด ๋‚ด์ง€ ๋ชปํ•˜๋Š” ๋ฌธ์ œ ๋“ฑ์ด ์žˆ๋‹ค. ์ด์ƒ ์ง„๋‹จ์˜ ๊ฒฝ์šฐ ์ด์ƒ์˜ ์›์ธ์ด ๋˜๋Š” ๋…ธ๋“œ์˜ ๊ฒฉ๋ฆฌ ๋ฐ ์ด์ƒ ์ „ํŒŒ ๊ฒฝ๋กœ์— ๋Œ€ํ•œ ๋ถ„์„์ด ๋ถ€์ •ํ™•ํ•œ ๊ฒฝ์šฐ๊ฐ€ ๋งŽ์€๋ฐ, ์ด๋Š” ์ฐจ์› ์ถ•์†Œ๋กœ ์ธํ•˜์—ฌ ๊ณต์ • ๋ณ€์ˆ˜์˜ ํŠน์„ฑ์ด ์†Œ์‹ค๋˜๋Š” ์„ฑ์งˆ์ด ์žˆ๊ณ , ๋ฐฉํ–ฅ์„ฑ ๊ทธ๋ž˜ํ”„๋ฅผ ํ™œ์šฉํ•  ์‹œ ๊ณต์ •์— ๋Œ€ํ•œ ์„ ํ–‰ ์ง€์‹์„ ์ ์šฉํ•จ์œผ๋กœ์จ ํŽธํ–ฅ๋œ ์ด์ƒ ์ง„๋‹จ ๊ฒฐ๊ณผ๊ฐ€ ๋‚˜ํƒ€๋‚˜๋Š” ๊ฒฝ์šฐ๋“ค์ด ๋ฐœ์ƒํ•˜๊ธฐ ๋•Œ๋ฌธ์ด๋‹ค. ๊ธฐ์กด ๋ฐฉ๋ฒ•๋ก ๋“ค์— ๋Œ€ํ•œ ์ด๋Ÿฌํ•œ ํ•œ๊ณ„์ ๋“ค์„ ๊ณ ๋ คํ•ด ๋ดค์„๋•Œ, ๋ณ€์ˆ˜ ๊ฐ๊ฐ์˜ ํŠน์„ฑ์ด ์†Œ์‹ค๋˜์ง€ ์•Š๋„๋กํ•˜์—ฌ ํšจ๊ณผ์ ์œผ๋กœ ์ด์ƒ์— ๋Œ€ํ•œ ๊ฐ์ง€์™€ ์ง„๋‹จ์„ ๋ชจ๋‘ ์ˆ˜ํ–‰ํ•ด ๋‚ผ ์ˆ˜ ์žˆ์œผ๋ฉด์„œ๋„, ๊ณ„์‚ฐ์ƒ์˜ ํšจ์œจ์„ฑ์„ ๊ฐ–์ถ˜, ์ด์ƒ ๊ฐ์ง€ ๋ฐ ์ง„๋‹จ์— ๋Œ€ํ•œ ํ†ตํ•ฉ๋œ ๋ฐฉ๋ฒ•๋ก ์˜ ๊ฐœ๋ฐœ์ด ์‹œ๊ธ‰ํ•˜๋‹ค๊ณ  ํ•  ์ˆ˜ ์žˆ๋‹ค. ๋ณธ ์—ฐ๊ตฌ์—์„œ๋Š” ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ ๋ชจ๋ธ๋ง๊ณผ ๊ทธ๋ž˜ํ”„ ๋ผ์˜๋ฅผ ๊ธฐ๋ฐ˜์œผ๋กœํ•˜์—ฌ, ์ด์ƒ์— ๋Œ€ํ•œ ๊ฐ์ง€ ๋ฐ ์ง„๋‹จ์„ ๋ชจ๋‘ ์ˆ˜ํ–‰ํ•ด ๋‚ผ ์ˆ˜ ์žˆ๋Š” ํ†ตํ•ฉ์ ์ธ ๊ณต์ • ๋ชจ๋‹ˆํ„ฐ๋ง ๋ฐฉ๋ฒ•๋ก ์„ ์ œ์•ˆํ•œ๋‹ค. ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ๋Š” ๋น„์„ ํ˜•์ ์ด๊ณ  ๋น„์ •๊ทœ์ ์ธ ๋ณ€์ˆ˜ ๊ด€๊ณ„๋ฅผ ํšจ๊ณผ์ ์œผ๋กœ ๋ชจ๋ธ๋งํ•  ์ˆ˜ ์žˆ๊ฒŒ ํ•ด์ฃผ๊ณ , ์ด์ƒ ๋ฐœ์ƒ ์ƒํ™ฉ์—์„œ์˜ ๋ชจ๋‹ˆํ„ฐ๋ง ํ†ต๊ณ„๊ฐ’ ๊ณ„์‚ฐ์‹œ์— ๊ฐ ๋ณ€์ˆ˜์˜ ํŠน์„ฑ์„ ๋ฐ˜์˜ํ•˜์—ฌ ํ™•๋ฅ  ๊ณ„์‚ฐ์„ ํ•ด ๋‚ผ ์ˆ˜ ์žˆ๊ธฐ ๋•Œ๋ฌธ์— ํšจ๊ณผ์ ์ธ ์ด์ƒ ๊ฐ์ง€ ๋ฐ ์ง„๋‹จ ์ˆ˜๋‹จ์ด ๋œ๋‹ค. ๊ธฐ๋ณธ์ ์œผ๋กœ ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ๋Š” ํ™•๋ฅ ๊ฐ’ ๊ณ„์‚ฐ์‹œ์˜ ๋ถ€ํ•˜๊ฐ€ ํฌ์ง€๋งŒ, ๋ณธ ์—ฐ๊ตฌ์—์„œ๋Š” ๊ทธ๋ž˜ํ”„ ๋ผ์˜ ๋ฐฉ๋ฒ•๋ก ์„ ์ถ”๊ฐ€์ ์œผ๋กœ ํ•จ๊ป˜ ํ™œ์šฉํ•˜์—ฌ ๊ณ„์‚ฐ ์ƒ์˜ ๋ถ€ํ•˜๋ฅผ ์ค„์ด๊ณ  ํšจ์œจ์ ์œผ๋กœ ์ด์ƒ ๊ฐ์ง€ ๋ฐ ์ง„๋‹จ์„ ํ•ด๋‚ผ ์ˆ˜ ์žˆ๋„๋ก ํ•˜์˜€๋‹ค. ๋ณธ ์—ฐ๊ตฌ์—์„œ ์ œ์•ˆ๋œ ๋‚ด์šฉ๋“ค์€ ๋‹ค์Œ๊ณผ ๊ฐ™๋‹ค. ์ฒซ์งธ, ๊ณต์ • ๋ณ€์ˆ˜๋ฅผ ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ ํ˜•ํƒœ๋กœ ๋ชจ๋ธ๋งํ•˜๊ณ , ๊ทธ๋ž˜ํ”„ ๋ผ์˜๋ฅผ ํ™œ์šฉํ•ด ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ์˜ ๊ตฌ์กฐ๋ฅผ ์–ป์„ ์ˆ˜ ์žˆ๋Š” ๋ฐฉ๋ฒ•๋ก ์„ ์ œ์‹œํ•˜์˜€๋‹ค. ๊ทธ๋ž˜ํ”„ ๋ผ์˜๋Š” ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ์˜ ๊ตฌ์กฐ๋ฅผ ํŒŒ์•…ํ•˜๊ธฐ ์œ„ํ•œ ๋ฐฉ๋ฒ•๋ก ์ธ๋ฐ, ๋ณ€์ˆ˜ ๊ฐ„์˜ ๊ด€๊ณ„๋ฅผ ๊ฐ€์šฐ์Šค ํ•จ์ˆ˜์˜ ํ˜•ํƒœ๋กœ ๊ฐ€์ •ํ•˜๊ธฐ ๋•Œ๋ฌธ์— ๋‹ค๋ณ€์ˆ˜ ์‹œ์Šคํ…œ์—์„œ๋„ ํšจ์œจ์ ์œผ๋กœ ๊ทธ๋ž˜ํ”„ ๊ตฌ์กฐ๋ฅผ ํŒŒ์•…ํ•  ์ˆ˜ ์žˆ๋„๋ก ํ•ด์ค€๋‹ค. ๋ณธ ์—ฐ๊ตฌ์—์„œ๋Š” ๋ฐ˜๋ณต์  ๊ทธ๋ž˜ํ”„ ๋ผ์˜๋ฅผ ์ œ์•ˆํ•˜์—ฌ ๋ชจ๋“  ๊ณต์ • ๋ณ€์ˆ˜๋“ค์ด ์ƒ๊ด€๊ด€๊ณ„๊ฐ€ ๋†’์€ ๋ณ€์ˆ˜ ์ง‘๋‹จ์œผ๋กœ ๋ฌถ์ผ ์ˆ˜ ์žˆ๋„๋ก ํ•˜์˜€๋‹ค. ์ด๋ฅผ ํ™œ์šฉํ•˜๋ฉด ์ „์ฒด ๊ณต์ • ๋ณ€์ˆ˜ ์ง‘๋‹จ์„ ๋‹ค์ˆ˜์˜ ์†Œ์ง‘๋‹จ์œผ๋กœ ๋ถ„๋ฅ˜ํ•˜๊ณ  ๊ฐ๊ฐ์— ๋Œ€ํ•œ ๊ทธ๋ž˜ํ”„ ๊ตฌ์กฐ๋ฅผ ํŒŒ์•…ํ•  ์ˆ˜ ์žˆ๊ฒŒ ๋˜๋Š”๋ฐ, ํฌ๊ฒŒ ๋‘ ๊ฐ€์ง€์˜ ํšจ๊ณผ๋ฅผ ์–ป์„ ์ˆ˜ ์žˆ๋‹ค. ์šฐ์„ ์ ์œผ๋กœ ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ ํ™•๋ฅ  ๊ณ„์‚ฐ์˜ ๋Œ€์ƒ์ด ๋˜๋Š” ๋ณ€์ˆ˜์˜ ๊ฐœ์ˆ˜๋ฅผ ์ค„์—ฌ์คŒ์œผ๋กœ์จ ๊ณ„์‚ฐ ๋ถ€ํ•˜๋ฅผ ์ค„์ด๊ณ  ํšจ์œจ์ ์ธ ์ด์ƒ ๊ฐ์ง€๊ฐ€ ์ด๋ฃจ์–ด์งˆ ์ˆ˜ ์žˆ๋„๋ก ํ•œ๋‹ค. ๋˜ํ•œ ์ƒ๊ด€๊ด€๊ณ„๊ฐ€ ๋†’์€ ์ง‘๋‹จ๋ผ๋ฆฌ ๋ฌถ์—ฌ์„œ ๋ชจ๋ธ๋ง ๋œ ๊ทธ๋ž˜ํ”„๋ฅผ ํ™œ์šฉํ•˜์—ฌ ์ด์ƒ์˜ ์ง„๋‹จ ๊ณผ์ •์—์„œ ๊ณต์ • ๋ณ€์ˆ˜ ๊ฐ„์˜ ๊ด€๊ณ„ ํŒŒ์•… ๋ฐ ์ „ํŒŒ ๊ฒฝ๋กœ ๋ถ„์„์„ ์šฉ์ดํ•˜๋„๋ก ํ•ด์ค€๋‹ค. ๋‘ ๋ฒˆ์งธ๋กœ, ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ์˜ ํ™•๋ฅ  ์ถ”๋ก ์„ ๊ธฐ๋ฐ˜์œผ๋กœ ํ•˜์—ฌ ํšจ๊ณผ์ ์œผ๋กœ ์ด์ƒ ๊ฐ์ง€๊ฐ€ ์ด๋ฃจ์–ด์งˆ ์ˆ˜ ์žˆ๋„๋ก ํ•˜๋Š” ๋ฐฉ๋ฒ•๋ก ์„ ์ œ์•ˆํ•˜์˜€๋‹ค. ๋ฐ˜๋ณต์  ๊ทธ๋ž˜ํ”„ ๋ผ์˜๋ฅผ ํ†ตํ•ด ์–ป์–ด์ง„ ๋‹ค์ˆ˜์˜ ๋ณ€์ˆ˜ ์†Œ์ง‘๋‹จ์— ๋Œ€ํ•˜์—ฌ ๊ฐ๊ฐ ํ™•๋ฅ  ์ถ”๋ก ์„ ์ ์šฉํ•˜์—ฌ ์ด์ƒ ๊ฐ์ง€๋ฅผ ์ง„ํ–‰ํ•˜๊ฒŒ ๋˜๋Š”๋ฐ, ์ œ์•ˆ๋œ ๋ฐฉ๋ฒ•๋ก ์—์„œ๋Š” ์ปค๋„ ๋ฐ€๋„ ์ถ”์ • ๋ฐฉ๋ฒ•๋ก ์„ ํ™œ์šฉํ•˜์˜€๋‹ค. ์ •์ƒ ๋ฐ์ดํ„ฐ๋ฅผ ํ™œ์šฉํ•˜์—ฌ ๊ฐ ๋ณ€์ˆ˜๋“ค์— ๋Œ€ํ•œ ์ปค๋„ ๋ฐ€๋„์˜ ๋Œ€์—ญํญ์„ ํ•™์Šตํ•˜๊ณ , ์ด์ƒ ๋ฐ์ดํ„ฐ๊ฐ€ ๋ฐœ์ƒํ•  ์‹œ ์ด๋ฅผ ํ™œ์šฉํ•œ ์ปค๋„ ๋ฐ€๋„ ์ถ”์ •๋ฒ•์„ ์‚ฌ์šฉํ•˜์—ฌ ์ด์ƒ๊ฐ์‹œ ํ†ต๊ณ„์น˜๋ฅผ ๊ณ„์‚ฐํ•˜๊ฒŒ ๋œ๋‹ค. ์ด๋•Œ ํ—ˆ์œ„ ์ง„๋‹จ์œจ์„ 5%๋กœ ๊ฐ€์ •ํ•˜์—ฌ ๊ฐ๊ฐ์˜ ์†Œ์ง‘๋‹จ์— ๋Œ€ํ•œ ๊ณต์ • ๊ฐ์ง€ ๊ธฐ์ค€์„ ์„ ์„ค์ •ํ•˜์˜€๊ณ , ์ด์ƒ๊ฐ์‹œ ํ†ต๊ณ„์น˜๊ฐ€ ๊ณต์ • ๊ฐ์‹œ ๊ธฐ์ค€์„ ๋ณด๋‹ค ๋‚ฎ๊ฒŒ ๋  ๊ฒฝ์šฐ ์ด์ƒ์ด ๊ฐ์ง€๋œ๋‹ค. ์„ธ ๋ฒˆ์งธ๋กœ, ์ด์ƒ ๋ฐœ์ƒ ์‹œ ์›์ธ์ด ๋˜๋Š” ๋ณ€์ˆ˜์˜ ๊ฒฉ๋ฆฌ ๋ฐ ์ด์ƒ ์ „ํŒŒ ๊ฒฝ๋กœ ๋ถ„์„์„ ํšจ๊ณผ์ ์œผ๋กœ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ๋Š” ๋ฐฉ๋ฒ•๋ก ์„ ์ œ์‹œํ•˜์˜€๋‹ค. ์ œ์‹œ๋œ ๋ฐฉ๋ฒ•๋ก ์—์„œ๋Š” ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ์˜ ํ™•๋ฅ  ์ถ”๋ก  ๊ณผ์ •์„ ํ™œ์šฉํ•˜์—ฌ ์ด์ƒ ๋ฐœ์ƒ ์‹œ ๊ฐ ๋ณ€์ˆ˜์˜ ์กฐ๊ฑด๋ถ€ ํ•œ๊ณ„ ํ™•๋ฅ ์„ ๊ณ„์‚ฐํ•˜๊ณ , ์ด๋ฅผ ํ™œ์šฉํ•ด ์ƒˆ๋กญ๊ฒŒ ์ •์˜๋œ ์กฐ๊ฑด๋ถ€ ๊ธฐ์—ฌ๋„ ๊ฐ’์„ ๊ณ„์‚ฐํ•˜์—ฌ, ์ด์ƒ์— ๋Œ€ํ•œ ๊ฐ ๋ณ€์ˆ˜์˜ ๊ธฐ์—ฌ๋„๋ฅผ ํŒŒ์•…ํ•  ์ˆ˜ ์žˆ๋„๋ก ํ•œ๋‹ค. ์ด ๊ณผ์ •์—์„œ๋Š” ์ปค๋„ ์‹ ๋ขฐ๋„ ์ „ํŒŒ ๋ฐฉ๋ฒ•๋ก ์ด ์‚ฌ์šฉ๋˜๋Š”๋ฐ, ์ด๋Š” ์—ฐ์† ๋ณ€์ˆ˜๋ฅผ ๊ฐ€์ง€๋Š” ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ์— ๋Œ€ํ•˜์—ฌ ํ™•๋ฅ  ์ถ”๋ก ์„ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ๋„๋ก ํ•˜๋Š” ๋ฐฉ๋ฒ•๋ก ์ด๋‹ค. ์ปค๋„ ์‹ ๋ขฐ๋„ ์ „ํŒŒ๋ฒ•์„ ์‚ฌ์šฉํ•˜๋ฉด ์ •์ƒ ์ƒํƒœ์˜ ๊ณต์ • ๋ฐ์ดํ„ฐ๋ฅผ ํ™œ์šฉํ•˜์—ฌ ๋งˆ๋ฅด์ฝ”ํ”„ ๋žœ๋ค ํ•„๋“œ๋ฅผ ๊ตฌ์„ฑํ•˜๋Š” ํŒŒ๋ผ๋ฏธํ„ฐ ๊ฐ’๋“ค์„ ํ•™์Šตํ•˜๊ณ , ์ด์ƒ ๋ฐœ์ƒ์‹œ ์ด์ƒ ๋ฐ์ดํ„ฐ์— ๋Œ€ํ•˜์—ฌ ๊ฐ ๋ณ€์ˆ˜์˜ ์กฐ๊ฑด๋ถ€ ๊ธฐ์—ฌ๋„ ๊ฐ’์„ ๊ณ„์‚ฐํ•  ์ˆ˜ ์žˆ๊ฒŒ ๋œ๋‹ค. ์ด ๋•Œ ๊ณ„์‚ฐ๋œ ์กฐ๊ฑด๋ถ€ ๊ธฐ์—ฌ๋„ ๊ฐ’์˜ ํฌ๊ธฐ์™€, ์ด์ƒ ๋ฐœ์ƒ ์ดํ›„ ๊ฐ ๋ณ€์ˆ˜์˜ ์กฐ๊ฑด๋ถ€ ๊ธฐ์—ฌ๋„ ๊ฐ’์˜ ๋ณ€ํ™” ๋ฐ˜์‘ ์†๋„๋ฅผ ์ข…ํ•ฉ์ ์œผ๋กœ ํŒ๋‹จํ•˜์—ฌ, ์ด์ƒ์˜ ์›์ธ ๋ณ€์ˆ˜์— ๋Œ€ํ•œ ๊ฒฉ๋ฆฌ์™€ ์ด์ƒ ์ „ํŒŒ ๊ฒฝ๋กœ ๋ถ„์„์„ ํšจ๊ณผ์ ์œผ๋กœ ์ˆ˜ํ–‰ํ•  ์ˆ˜ ์žˆ๊ฒŒ ๋œ๋‹ค. ๋ณธ ์—ฐ๊ตฌ์—์„œ๋Š” ์ œ์•ˆ๋œ ์ด์ƒ ๊ฐ์ง€ ๋ฐ ์ง„๋‹จ ๋ฐฉ๋ฒ•๋ก ์˜ ์„ฑ๋Šฅ์„ ๊ฒ€์ฆํ•˜๊ธฐ ์œ„ํ•˜์—ฌ ํ…Œ๋„ค์‹œ ์ด์ŠคํŠธ๋งŒ ๊ณต์ • ๋ชจ๋ธ์— ์ด๋ฅผ ์ ์šฉํ•˜๊ณ  ๊ฒฐ๊ณผ๋ฅผ ๋ถ„์„ํ•˜์˜€๋‹ค. ํ…Œ๋„ค์‹œ ์ด์ŠคํŠธ๋งŒ ๊ณต์ •์€ ์ˆ˜๋…„๊ฐ„ ๊ณต์ • ๊ฐ์‹œ ๋ฐฉ๋ฒ•๋ก ์„ ๊ฒ€์ฆํ•˜๊ธฐ ์œ„ํ•œ ๋ฒค์น˜๋งˆํฌ ๊ณต์ •์œผ๋กœ ๋„๋ฆฌ ์‚ฌ์šฉ๋˜์–ด ์™”๊ธฐ ๋•Œ๋ฌธ์—, ์ œ์‹œ๋œ ๋ฐฉ๋ฒ•๋ก ์„ ์ด์— ์ ์šฉํ•ด ๋ด„์œผ๋กœ์จ ๋‹ค๋ฅธ ๊ณต์ • ๊ฐ์‹œ ๋ฐฉ๋ฒ•๋ก ๋“ค๊ณผ์˜ ์„ฑ๋Šฅ์„ ๋น„๊ตํ•ด ๋ณผ ์ˆ˜ ์žˆ์—ˆ๋‹ค. ๋˜ํ•œ ๋‹ค์ˆ˜์˜ ๋‹จ์œ„ ๊ณต์ •์„ ํฌํ•จํ•˜๊ณ  ์žˆ๊ณ , ์ˆœํ™˜์ ์ธ ๋ณ€์ˆ˜ ๊ด€๊ณ„ ์—ญ์‹œ ํฌํ•จํ•˜๊ณ  ์žˆ๊ธฐ ๋•Œ๋ฌธ์— ์ œ์‹œ๋œ ๋ฐฉ๋ฒ•๋ก ์˜ ์„ฑ๋Šฅ์„ ์‹œํ—˜ํ•ด ๋ณด๊ธฐ์— ์ ํ•ฉํ–ˆ๋‹ค. ํ…Œ๋„ค์‹œ ์ด์ŠคํŠธ๋งŒ ๊ณต์ • ๋‚ด๋ถ€์—๋Š” 28๊ฐœ ์ข…๋ฅ˜์˜ ์ด์ƒ์ด ํ”„๋กœ๊ทธ๋žจ ์ƒ์— ๋‚ด์žฅ๋˜์–ด ์žˆ๋Š”๋ฐ, ์ œ์‹œ๋œ ๊ณต์ • ๊ฐ์ง€ ๋ฐฉ๋ฒ•๋ก ์„ ์ ์šฉํ•œ ๊ฒฐ๊ณผ ๋ชจ๋“  ์ด์ƒ์— ๋Œ€ํ•˜์—ฌ 96% ์ด์ƒ์˜ ๋†’์€ ์ด์ƒ ๊ฐ์ง€์œจ์„ ๋‚˜ํƒ€๋‚ด์—ˆ๋‹ค. ์ด๋Š” ๊ธฐ์กด์— ์ œ์‹œ๋œ ๊ณต์ • ๊ฐ์‹œ ๋ฐฉ๋ฒ•๋ก ๋“ค์— ๋น„ํ•˜์—ฌ ์›”๋“ฑํžˆ ๋†’์€ ์ˆ˜์น˜์˜€๋‹ค. ๋˜ํ•œ ์ด์ƒ ์ง„๋‹จ ์„ฑ๋Šฅ์„ ๋ถ„์„ํ•ด ๋ณธ ๊ฒฐ๊ณผ, ๋ชจ๋“  ์ด์ƒ์— ๋Œ€ํ•˜์—ฌ ์›์ธ์ด ๋˜๋Š” ๋…ธ๋“œ๋ฅผ ํšจ๊ณผ์ ์œผ๋กœ ํŒŒ์•…ํ•  ์ˆ˜ ์žˆ์—ˆ๊ณ , ์ด์ƒ ์ „ํŒŒ ๊ฒฝ๋กœ ์—ญ์‹œ ์ •ํ™•ํ•˜๊ฒŒ ํƒ์ง€ํ•˜์—ฌ ๊ธฐ์กด ๋ฐฉ๋ฒ•๋ก ๋“ค๊ณผ๋Š” ์ฐจ๋ณ„ํ™”๋œ ์„ฑ๋Šฅ์„ ๋‚˜ํƒ€๋‚ด์—ˆ๋‹ค. ์ œ์‹œ๋œ ๋ฐฉ๋ฒ•๋ก ์„ ํ…Œ๋„ค์‹œ ์ด์ŠคํŠธ๋งŒ ๊ณต์ •์— ์ ์šฉํ•ด ๋ด„์œผ๋กœ์จ, ๋ณธ ์—ฐ๊ตฌ ๋‚ด์šฉ์ด ๊ณต์ • ์ด์ƒ์˜ ๊ฐ์ง€ ๋ฐ ์ง„๋‹จ์— ๋Œ€ํ•œ ํ†ตํ•ฉ์ ์ธ ๋ฐฉ๋ฒ•๋ก  ์ค‘์—์„œ ๊ฐ€์žฅ ์šฐ์ˆ˜ํ•œ ์„ฑ๋Šฅ์„ ๋‚˜ํƒ€๋‚ด๋Š” ๊ฒƒ์„ ํ™•์ธํ•  ์ˆ˜ ์žˆ์—ˆ๋‹ค.Contents Abstract i Contents iv List of Tables vii List of Figures ix 1 Introduction 1 1.1 Research Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Research Objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 1.3 Outline of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2 Markov Random Fields Modelling, Graphical Lasso, and Optimal Structure Learning 10 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.2 Markov Random Fields . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.3 Graphical Lasso . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2.4 MRF Modelling & Structure Learning . . . . . . . . . . . . . . . . . 19 2.4.1 MRF modelling in process systems . . . . . . . . . . . . . . 19 2.4.2 Structure learning using iterative graphical lasso . . . . . . . 20 2.5 Application of Iterative Graphical Lasso on the TEP . . . . . . . . . . 24 3 Efficient Process Monitoring via the Integrated Use of Markov Random Fields Learning and the Graphical Lasso 31 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 3.2 MRF Monitoring Integrated with Graphical Lasso . . . . . . . . . . . 35 3.2.1 Step 1: Iterative graphical lasso . . . . . . . . . . . . . . . . 36 3.2.2 Step 2: MRF monitoring . . . . . . . . . . . . . . . . . . . . 36 3.3 Implementation of Glasso-MRF monitoring to the Tennessee Eastman process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 3.3.1 Tennessee Eastman process . . . . . . . . . . . . . . . . . . 41 3.3.2 Glasso-MRF monitoring on TEP . . . . . . . . . . . . . . . . 48 3.3.3 Fault detection accuracy comparison with other monitoring techniques . . . . . . . . . . . . . . . . . . . . . . . . . . . 87 3.3.4 Fault detection speed & fault propagation . . . . . . . . . . . 95 4 Process Fault Diagnosis via Markov Random Fields Learning and Inference 101 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 101 4.2 Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106 4.2.1 Probabilistic graphical models & Markov random fields . . . 106 4.2.2 Kernel belief propagation . . . . . . . . . . . . . . . . . . . . 107 4.3 Fault Diagnosis via MRF Modeling . . . . . . . . . . . . . . . . . . 113 4.3.1 MRF structure learning via graphical lasso . . . . . . . . . . 116 4.3.2 Kernel belief propagation - bandwidth selection . . . . . . . . 116 4.3.3 Conditional contribution evaluation . . . . . . . . . . . . . . 117 4.4 Application Results & Discussion . . . . . . . . . . . . . . . . . . . 118 4.4.1 Two tank process . . . . . . . . . . . . . . . . . . . . . . . . 119 4.4.2 Tennessee Eastman process . . . . . . . . . . . . . . . . . . 137 5 Concluding Remarks 152 Bibliography 157 Nomenclature 169 Abstract (In Korean) 170Docto
    • โ€ฆ
    corecore