Analyzing simulation-based PRA data through traditional and topological clustering: A BWR station blackout case study

被引:22
作者
Maljovec, D. [1 ]
Liu, S. [1 ]
Wang, B. [1 ]
Mandelli, D. [2 ]
Bremer, P. -T. [3 ]
Pascucci, V. [1 ]
Smith, C. [2 ]
机构
[1] Univ Utah, Sci Comp & Imaging Inst, Salt Lake City, UT 84112 USA
[2] Idaho Natl Lab, Idaho Falls, ID 83415 USA
[3] Lawrence Livermore Natl Lab, Livermore, CA 94550 USA
基金
美国国家科学基金会;
关键词
Probabilistic risk assessment; Computational topology; Clustering; High-dimensional data analysis;
D O I
10.1016/j.ress.2015.07.001
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Dynamic probabilistic risk assessment (DPRA) methodologies couple system simulator codes (e.g., RELAP and MELCOR) with simulation controller codes (e.g., RAVEN and ADAPT). Whereas system simulator codes model system dynamics deterministically, simulation controller codes introduce both deterministic (e.g., system control logic and operating procedures) and stochastic (e.g., component failures and parameter uncertainties) elements into the simulation. Typically, a DPRA is performed by sampling values of a set of parameters and simulating the system behavior for that specific set of parameter values. For complex systems, a major challenge in using DPRA methodologies is to analyze the large number of scenarios generated, where clustering techniques are typically employed to better organize and interpret the data. In this paper, we focus on the analysis of two nuclear simulation datasets that are part of the risk-informed safety margin characterization (RISMC) boiling water reactor (BWR) station blackout (SBO) case study. We provide the domain experts a software tool that encodes traditional and topological clustering techniques within an interactive analysis and visualization environment, for understanding the structures of such high-dimensional nuclear simulation datasets. We demonstrate through our case study that both types of clustering techniques complement each other for enhanced structural understanding of the data. Published by Elsevier Ltd.
引用
收藏
页码:262 / 276
页数:15
相关论文
共 21 条
[1]  
Carreira-Perpinan Miguel A, 1997, CS9609 U SHEFF, P1
[2]  
Dan Maljovec, 2013, INT TOP M PROB SAF A
[3]  
Dan Maljovec, 2013, INT C MATH COMP METH
[4]  
Dan Maljovec, 2014, PROB SAF ASS MAN C
[5]   EFFICIENT ALGORITHM FOR A COMPLETE LINK METHOD [J].
DEFAYS, D .
COMPUTER JOURNAL, 1977, 20 (04) :364-366
[6]  
Di Maio F, 2009, P NPIC HMIT 2009 KNO
[7]  
Diego Mandelli, 2013, EXT1330203 INL
[8]   Hierarchical morse-smale complexes for piecewise linear 2-manifolds [J].
Edelsbrunner, H ;
Harer, J ;
Zomorodian, A .
DISCRETE & COMPUTATIONAL GEOMETRY, 2003, 30 (01) :87-107
[9]   Topological persistence and simplification [J].
Edelsbrunner, H ;
Letscher, D ;
Zomorodian, A .
DISCRETE & COMPUTATIONAL GEOMETRY, 2002, 28 (04) :511-533
[10]  
Edelsbrunner H., 2003, P 19 ANN S COMP GEOM, P361, DOI [DOI 10.1145/777792.7778461, DOI 10.1145/777792.777846, 10.1145/777792.777846]