Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “probabilistic inference”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 271 records · Page 15

Sparsifying priors for Bayesian uncertainty quantification in model discovery

We propose a probabilistic model discovery method for identifying ordinary differential equations governing the dynamics of observed multivariate data. Our method is based on the sparse identification of nonlinear dynamics (SINDy) framework, where models are expressed as sparse linear combinations of pre-specified candidate functions. Promoting parsimony through sparsity leads to interpretable models that generalize to unknown data. Instead of targeting point estimates of the SINDy coefficients, we estimate these coefficients via sparse Bayesian inference. The resulting method, uncertainty quantification SINDy (UQ-SINDy), quantifies not only the uncertainty in the values of the SINDy coefficients due to observation errors and limited data, but also the probability of inclusion of each candidate function in the linear combination. UQ-SINDy promotes robustness against observation noise and limited data, interpretability (in terms of model selection and inclusion probabilities) and generalization capacity for out-of-sample forecast. Sparse inference for UQ-SINDy employs Markov chain Monte Carlo, and we explore two sparsifying priors: the spike and slab prior, and the regularized horseshoe prior. UQ-SINDy is shown to discover accurate models in the presence of noise and with orders-of-magnitude less data than current model discovery methods, thus providing a transformative method for real-world applications which have limited data.

97 MATHEMATICS AND COMPUTING↗

Mixture Model Framework for Traumatic Brain Injury Prognosis Using Heterogeneous Clinical and Outcome Data

Prognoses of Traumatic Brain Injury (TBI) outcomes are neither easily nor accurately determined from clinical indicators. This is due in part to the heterogeneity of damage inflicted to the brain, ultimately resulting in diverse and complex outcomes. Using a data-driven approach on many distinct data elements may be necessary to describe this large set of outcomes and thereby robustly depict the nuanced differences among TBI patients’ recovery. In this work, we develop a method for modeling large heterogeneous data types relevant to TBI. Our approach is geared toward the probabilistic representation of mixed continuous and discrete variables with missing values. The model is trained on a dataset encompassing a variety of data types, including demographics, blood-based biomarkers, and imaging findings. In addition, it includes a set of clinical outcome assessments at 3, 6, and 12 months post-injury. The model is used to stratify patients into distinct groups in an unsupervised learning setting. We use the model to infer outcomes using input data, and show that the collection of input data reduces uncertainty of outcomes over a baseline approach. In addition, we quantify the performance of a likelihood scoring technique that can be used to self-evaluate the extrapolation risk of prognosis on unseen patients.

97 MATHEMATICS AND COMPUTING↗

Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks

Portfolio methods support the combination of different algorithms and heuristics, including stochastic local search (SLS) heuristics, and have been identified as a promising approach to solve computationally hard problems. While successful in experiments, theoretical foundations and analytical results for portfolio-based SLS heuristics are less developed. This article aims to improve the understanding of the role of portfolios of heuristics in SLS. We emphasize the problem of computing most probable explanations (MPEs) in Bayesian networks (BNs). Algorithmically, we discuss a portfolio-based SLS algorithm for MPE computation, Stochastic Greedy Search (SGS). SGS supports the integration of different initialization operators (or initialization heuristics) and different search operators (greedy and noisy heuristics), thereby enabling new analytical and experimental results. Analytically, we introduce a novel Markov chain model tailored to portfolio-based SLS algorithms including SGS, thereby enabling us to analytically form expected hitting time results that explain empirical run time results. For a specific BN, we show the benefit of using a homogenous initialization portfolio. To further illustrate the portfolio approach, we consider novel additive search heuristics for handling determinism in the form of zero entries in conditional probability tables in BNs. Our additive approach adds rather than multiplies probabilities when computing the utility of an explanation. We motivate the additive measure by studying the dramatic impact of zero entries in conditional probability tables on the number of zero-probability explanations, which again complicates the search process. We consider the relationship between MAXSAT and MPE, and show that additive utility (or gain) is a generalization, to the probabilistic setting, of MAXSAT utility (or gain) used in the celebrated GSAT and WalkSAT algorithms and their descendants. Utilizing our Markov chain framework, we show that expected hitting time is a rational function - i.e. a ratio of two polynomials - of the probability of applying an additive search operator. Experimentally, we report on synthetically generated BNs as well as BNs from applications, and compare SGSs performance to that of Hugin, which performs BN inference by compilation to and propagation in clique trees. On synthetic networks, SGS speeds up computation by approximately two orders of magnitude compared to Hugin. In application networks, our approach is highly competitive in Bayesian networks with a high degree of determinism. In addition to showing that stochastic local search can be competitive with clique tree clustering, our empirical results provide an improved understanding of the circumstances under which portfolio-based SLS outperforms clique tree clustering and vice versa.

Mengshoel, Ole J.↗

TU-CD-BRA-05: Atlas Selection for Multi-Atlas-Based Image Segmentation Using Surrogate Modeling

Purpose: The growing size and heterogeneity in training atlas necessitates sophisticated schemes to identify only the most relevant atlases for the specific multi-atlas-based image segmentation problem. This study aims to develop a model to infer the inaccessible oracle geometric relevance metric from surrogate image similarity metrics, and based on such model, provide guidance to atlas selection in multi-atlas-based image segmentation. Methods: We relate the oracle geometric relevance metric in label space to the surrogate metric in image space, by a monotonically non-decreasing function with additive random perturbations. Subsequently, a surrogate’s ability to prognosticate the oracle order for atlas subset selection is quantified probabilistically. Finally, important insights and guidance are provided for the design of fusion set size, balancing the competing demands to include the most relevant atlases and to exclude the most irrelevant ones. A systematic solution is derived based on an optimization framework. Model verification and performance assessment is performed based on clinical prostate MR images. Results: The proposed surrogate model was exemplified by a linear map with normally distributed perturbation, and verified with several commonly-used surrogates, including MSD, NCC and (N)MI. The derived behaviors of different surrogates in atlas selection and their corresponding performance in ultimate label estimate were validated. The performance of NCC and (N)MI was similarly superior to MSD, with a 10% higher atlas selection probability and a segmentation performance increase in DSC by 0.10 with the first and third quartiles of (0.83, 0.89), compared to (0.81, 0.89). The derived optimal fusion set size, valued at 7/8/8/7 for MSD/NCC/MI/NMI, agreed well with the appropriate range [4, 9] from empirical observation. Conclusion: This work has developed an efficacious probabilistic model to characterize the image-based surrogate metric on atlas selection. Analytical insights lead to valid guiding principles on fusion set size design.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Experimental determinations of carbon and hydrogen isotope fractionations and methane clumped isotope compositions associated with ethane pyrolysis from 550 to 600°C

Methane clumped isotope compositions signify the relative natural abundances of rare, doubly substituted isotopic species of methane ( 13 CH 3 D and 12 CH 2 D 2 ) and have emerged as a new isotopic tool to trace the sources, sinks, and lifecycles of methane in the environment. Such measurements can identify equilibration (or reequilibration) temperatures if found to be in isotopic equilibrium or non-equilibrium processes (e.g., kinetically controlled reactions or mixing) if not in isotopic equilibrium. Naturally occurring thermogenic methane—formed by the thermally activated breakdown of larger organic molecules—has been found to have clumped isotope compositions consistent with equilibrium at reasonable gas formation temperatures in some settings and non-equilibrium processes occurring during either formation, migration, storage, or extraction in others. To explore the potential controls on the isotopic composition of thermogenic methane, we conducted isothermal time-series ethane pyrolysis experiments at 550 and 600 °C to measure methane and ethane 13 C/ 12 C and D/H fractionations and methane clumped isotope compositions (resolved 13 CH 3 D and 12 CH 2 D 2 ). We explore the effects of modifying the initial clumped isotope composition of ethane and the addition of water vapor to pyrolysis experiments. We observe that ethane and methane 13 C/ 12 C are controlled by kinetic isotope effects and Rayleigh distillation processes. In contrast, ethane and methane D/H and methane clumped isotope compositions appear to be controlled by a combination of these processes and hydrogen isotope exchange. The hydrogen isotope exchange processes lead to isotopic equilibrium as reaction completion is approached for both D/H (ethane/methane) and methane clumped isotope compositions. Here, we develop a chemical model based on a mass balance approach that accounts for inheritance vs. hydrogen-abstraction formation pathways for singly and doubly substituted isotopologues of ethane and methane that is compared to the experimental data. The model allows the determination of carbon and hydrogen kinetic isotope effects associated with ethane cracking and hydrogen abstraction reactions that, where applicable, we compare to prior theoretical constraints. From the comparison of the model to the experimental data, we infer that the kinetically controlled ethane and methane bulk isotope compositions and methane clumped isotope compositions are controlled by kinetic isotope effects (both primary and secondary) associated with both C–C bond and C–H bond cleavage reactions. Specifically, the methane clumped isotope compositions likely result from a combination of clumped isotope effects associated with ethane breakdown and/or assembly of methane isotopologues (expressed in terms of γ-factor parameters ≠ 1) and combinatorial effects that arise probabilistically. We discuss our experimental results in the context of recent pyrolysis experiments and observations of naturally occurring thermogenic methane. We consider a proposal consistent with observations from nature that the hydrogen isotope exchange reactions that promote equilibration of methane isotopic molecules at or near formation temperature may be facilitated by free radicals generated by pyrolysis reactions. In this framework, isotope exchange effectively ceases when pyrolysis effectively ceases locking in compositions that can be consistent with peak formation temperatures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Graphical Model for Fusing Diverse Microbiome Data

This paper develops a Bayesian graphical model for fusing disparate types of count data. The motivating application is the study of bacterial communities from diverse high-dimensional features, in this case, transcripts, collected from different treatments. In such datasets, there are no explicit correspondences between the communities and each corresponds to different factors, making data fusion challenging. We introduce a flexible multinomial-Gaussian generative model for jointly modeling such count data. This latent variable model jointly characterizes the observed data through a common multivariate Gaussian latent space that parameterizes the set of multinomial probabilities of the transcriptome counts. The covariance matrix of the latent variables induces a covariance matrix of co-dependencies between all the transcripts, effectively fusing multiple data sources. We present a computationally scalable variational Expectation-Maximization (EM) algorithm for inferring the latent variables and the parameters of the model. Here, the inferred latent variables provide a common dimensionality reduction for visualizing the data and the inferred parameters provide a predictive posterior distribution. In addition to simulation studies that demonstrate the variational EM procedure, we apply our model to a bacterial microbiome dataset.

59 BASIC BIOLOGICAL SCIENCES↗

Chaotic neural dynamics facilitate probabilistic computations through sampling

Cortical neurons exhibit highly variable responses over trials and time. Theoretical works posit that this variability arises potentially from chaotic network dynamics of recurrently connected neurons. Here, we demonstrate that chaotic neural dynamics, formed through synaptic learning, allow networks to perform sensory cue integration in a sampling-based implementation. We show that the emergent chaotic dynamics provide neural substrates for generating samples not only of a static variable but also of a dynamical trajectory, where generic recurrent networks acquire these abilities with a biologically plausible learning rule through trial and error. Furthermore, the networks generalize their experience in the stimulus-evoked samples to the inference without partial or all sensory information, which suggests a computational role of spontaneous activity as a representation of the priors as well as a tractable biological computation for marginal distributions. These findings suggest that chaotic neural dynamics may serve for the brain function as a Bayesian generative model.

60 APPLIED LIFE SCIENCES↗

A NEW DIAGNOSTIC OF ACTIVE GALACTIC NUCLEI: REVEALING HIGHLY ABSORBED SYSTEMS AT REDSHIFT >0.3

We introduce the Mass-Excitation (MEx) diagnostic to identify active galactic nuclei (AGNs) in galaxies at intermediate redshift. In the absence of near-infrared spectroscopy, necessary for using traditional nebular line diagrams at z > 0.4, we demonstrate that combining [O III] {lambda}5007/H{beta} and stellar mass successfully distinguishes between star formation and AGN emission. The MEx classification scheme relies on a novel probabilistic approach splitting galaxies into sub-categories with more confidence than alternative high-z diagnostic diagrams. It recognizes that galaxies near empirical boundaries on traditional diagrams have an uncertain classification and thus a non-zero probability of belonging to more than one category. An outcome of this work is a system of statistical weights that can be used to compute global properties of galaxy samples. We apply the MEx diagram to 2812 galaxies at 0.3 < z < 1 in the Great Observatories Origins Deep Survey North and Extended Groth Strip fields, and compare it to an independent X-ray classification scheme. We identify Compton-thick AGN candidates with large X-ray absorption, which we infer from the luminosity ratio between hard X-ray emission and [O III] {lambda}5007, a nearly isotropic tracer of AGNs. X-ray stacking of sources that were not detected individually supports the validity of the MEx diagram and yields a very flat spectral slope for the Compton-thick candidates ({Gamma} {approx} 0.4; unambiguously indicating absorbed AGNs). We present evidence that composite galaxies, which are difficult to identify with alternative high-redshift diagrams, host the majority of the highly absorbed AGNs. Our findings suggest that the interstellar medium of the host galaxy provides significant absorption in addition to the torus invoked in AGN unified models.

79 ASTRONOMY AND ASTROPHYSICS↗

On the Stochastic Stability of Deep Markov Models

Deep Markov models (DMM) are generative models which are scalable and expressive generalization of Markov models for representation, learning, and inference problems. DMMs using deep neural networks to parametrize the transition of Markov probability distributions have recently been shown to provide more expressiveness in modeling sequential data and dynamical system responses. However, the fundamental stochastic stability guarantees of such models have not been thoroughly investigated. In this paper, we present a rigorous analytical method to prove the necessary and sufficient conditions of DMM's stochastic stability. This task is achieved by spectral analysis of the efficiently computed Jacobians of probabilistic maps modeled by deep neural networks. We make theoretical connections between the eigenvalues of neural network's weights and the different activation function types used on the stability and overall dynamic behavior of DMMs with Gaussian distributions. We empirically substantiate our theoretical results on stochastic stability and eigenvalue spectra via several numerical experiments. Formal stability guarantees of DMMs can substantially improve their robustness and trustworthiness, necessary for reliable use in safety-critical real-world applications.

Drgona, Jan↗

GEOMETRIC AND DYNAMICAL MODELS OF REVERBERATION MAPPING DATA

We present a general method to analyze reverberation (or echo) mapping data that simultaneously provides estimates for the black hole mass and for the geometry and dynamics of the broad-line region (BLR) in active galactic nuclei (AGNs). While previous methods yield a typical scale size of the BLR or a reconstruction of the transfer function, our method directly infers the spatial and velocity distribution of the BLR from the data, from which a transfer function can be easily derived. Previous echo mapping analysis requires an independent estimate of a scaling factor known as the virial coefficient to infer the mass of the black hole, but this is not needed in our more direct approach. We use the formalism of Bayesian probability theory and implement a Markov Chain Monte Carlo algorithm to obtain estimates and uncertainties for the parameters of our BLR models. Fitting of models to the data requires knowledge of the continuum flux at all times, not just the measured times. We use Gaussian Processes to interpolate and extrapolate the continuum light curve data in a fully consistent probabilistic manner, taking the associated errors into account. We illustrate our method using simple models of BLR geometry and dynamics and show that we can recover the parameter values of our test systems with realistic uncertainties that depend upon the variability of the AGN and the quality of the reverberation mapping observing campaign. With a geometry model we can recover the mean radius of the BLR to within {approx}0.1 dex random uncertainty for simulated data with an integrated line flux uncertainty of 1.5%, while with a dynamical model we can recover the black hole mass and the mean radius to within {approx}0.05 dex random uncertainty, for simulated data with a line profile average signal-to-noise ratio of 4 per spectral pixel. These uncertainties do not include modeling errors, which are likely to be present in the analysis of real data, and should therefore be considered as lower limits to the accuracy of the method.

79 ASTRONOMY AND ASTROPHYSICS↗

Using Bayesian Inference Framework towards Identifying Gas Species and Concentration from High Temperature Resistive Sensor Array Data

High temperature gas sensors have been highly demanded for combustion process optimization and toxic emissions control, which usually suffer from poor selectivity. In order to solve this selectivity issue and identify unknown reducing gas species (CO, CH 4 , and CH 8 ) and concentrations, a high temperature resistive sensor array data set was built in this study based on 5 reported sensors. As each sensor showed specific responses towards different types of reducing gas with certain concentrations, based on which calibration curves were fitted, providing benchmark sensor array response database, then Bayesian inference framework was utilized to process the sensor array data and build a sample selection program to simultaneously identify gas species and concentration, by formulating proper likelihood between input measured sensor array response pattern of an unknown gas and each sampled sensor array response pattern in benchmark database. This algorithm shows good robustness which can accurately identify gas species and predict gas concentration with a small error of less than 10% based on limited amount of experiment data. These features indicate that Bayesian probabilistic approach is a simple and efficient way to process sensor array data, which can significantly reduce the required computational overhead and training data.

Liu, Yixin↗

Enabling probabilistic learning on manifolds through double diffusion maps

Here, we present a generative learning framework for probabilistic sampling that extends Probabilistic Learning on Manifolds (PLoM), which is designed to generate statistically consistent realizations of a random vector in a finite-dimensional Euclidean space, informed by a (representative) set of observations. In its original form, PLoM constructs a reduced-order probabilistic model by combining three main components: (a) kernel density estimation to approximate the underlying probability measure, (b) Diffusion Maps to characterize the manifold of the data, and (c) a reduced-order Itô Stochastic Differential Equation (ISDE) to sample from the learned distribution. However, its sampling dynamics are posed in the ambient space and the retained number of reduced coordinates is chosen by projection-reconstruction error. In practice, this often (i) requires more coordinates than the data’s intrinsic dimension to achieve stable sampling and (ii) lacks a smooth, basis-independent lifting back to the data domain; moreover, standard Diffusion Maps emphasize harmonic eigenfunctions and can miss non-harmonic latent structure. We address these limitations by decoupling geometry learning from sampling: a first Diffusion Maps pass identifies non-harmonic coordinates on which we formulate a full-order ISDE directly in the latent space, while Double Diffusion Maps captures multiscale geometric features and Geometric Harmonics (GH) learns a smooth lifting map to the ambient variables that is independent of the particular diffusion basis. This hybrid design preserves the system’s dynamical richness with a compact geometric representation and enables principled out-of-sample inference. The effectiveness and robustness of the proposed method are illustrated through two numerical studies: one based on data generated from two-dimensional Hermite polynomial functions and another based on high-fidelity simulations of a detonation wave in a reactive flow.

Double diffusion maps↗

Ground Heat Flux Reconstruction Using Bayesian Uncertainty Quantification Machinery and Surrogate Modeling

Ground heat flux (G 0 ) is a key component of the land-surface energy balance of high-latitude regions. Despite its crucial role in controlling permafrost degradation due to global warming, G 0 is sparsely measured and not well represented in the outputs of global scale model simulation. In this study, an analytical heat transfer model is tested to reconstruct G 0 across seasons using soil temperature series from field measurements, Global Climate Model, and climate reanalysis outputs. The probability density functions of ground heat flux and of model parameters are inferred using available G 0 data (measured or modeled) for snow-free period as a reference. When observed G 0 is not available, a numerical model is applied using estimates of surface heat flux (dependent on parameters) as the top boundary condition. These estimates (and thus the corresponding parameters) are verified by comparing the distributions of simulated and measured soil temperature at several depths. Aided by state-of-the-art uncertainty quantification methods, the developed G 0 reconstruction approach provides novel means for assessing the probabilistic structure of the ground heat flux for regional permafrost change studies.

54 ENVIRONMENTAL SCIENCES↗

Resolving Mixtures of Soot Characterized by SP-AMS Spectra Using a Latent Dirichlet Allocation Model

Soot produced by detonation or combustion events exhibits different chemical properties depending on the fuel, device construction, and environmental conditions in which the event occurs. These properties can be useful for defining relevant signatures for probabilistically identifying the different types of events that occurred, based on the soot that is produced from these events. However, it is rare to observe samples of soot from a detonation or combustion that are not contaminated by outside particles. In this paper, we present a method for resolving mixtures of soot to determine the contributions of sources that may be present in samples of recovered soot. We use Latent Dirichlet Allocation to describe the generative process for a sample of recovered soot, and use Variational Bayesian Inference to learn about the parameters associated with the generative model. We demonstrate the utility of this method by considering real samples of mixtures of soot under various frameworks to show that the model is able to identify the different components present in a sample of soot as well as their mixing proportions.

54 ENVIRONMENTAL SCIENCES↗

Probabilistic estimation of depth-resolved profiles of soil thermal diffusivity from temperature time series

Abstract. Improving the quantification of soil thermal and physical properties is key to achieving a better understanding and prediction of soil hydro-biogeochemical processes and their responses to changes in atmospheric forcing. Obtaining such information at numerous locations and/or over time with conventional soil sampling is challenging. The increasing availability of low-cost, vertically resolved temperature sensor arrays offers promise for improving the estimation of soil thermal properties from temperature time series, and the possible indirect estimation of physical properties. Still, the reliability and limitations of such an approach need to be assessed. In the present study, we develop a parameter estimation approach based on a combination of thermal modeling, sliding time windows, Bayesian inference, and Markov chain Monte Carlo simulation to estimate thermal diffusivity and its uncertainty over time, at numerous locations and at an unprecedented vertical spatial resolution (i.e., down to 5 to 10 cm vertical resolution) from soil temperature time series. We provide the necessary framework to assess under which environmental conditions (soil temperature gradient, fluctuations, and trend), temperature sensor characteristics (bias and level of noise), and deployment geometries (sensor number and position) soil thermal diffusivity can be reliably inferred. We validate the method with synthetic experiments and field studies. The synthetic experiments show that in the presence of median diurnal fluctuations ≥ 1.5 ∘C at 5 cm below the ground surface, temperature gradients > 2 ∘C m−1, and a sliding time window of at least 4 d the proposed method provides reliable depth-resolved thermal diffusivity estimates with percentage errors ≤ 10 % and posterior relative standard deviations ≤ 5 % up to 1 m depth. Reliable thermal diffusivity under such environmental conditions also requires temperature sensors to be spaced precisely (with accuracy to a few millimeters), with a level of noise ≤ 0.02 ∘C, and with a bias defined by a standard deviation ≤ 0.01 ∘C. Finally, the application of the developed approach to field data indicates significant repeatability in results and similarity with independent measurements, as well as promise in using a sliding time window to estimate temporal changes in soil thermal diffusivity, as needed to potentially capture changes in bulk density or water content.

54 ENVIRONMENTAL SCIENCES↗

Learning to simulate high energy particle collisions from unlabeled data

In many scientific fields which rely on statistical inference, simulations are often used to map from theoretical models to experimental data, allowing scientists to test model predictions against experimental results. Experimental data is often reconstructed from indirect measurements causing the aggregate transformation from theoretical models to experimental data to be poorly-described analytically. Instead, numerical simulations are used at great computational cost. We introduce Optimal-Transport-based Unfolding and Simulation (OTUS), a fast simulator based on unsupervised machine-learning that is capable of predicting experimental data from theoretical models. Without the aid of current simulation information, OTUS trains a probabilistic autoencoder to transform directly between theoretical models and experimental data. Identifying the probabilistic autoencoder’s latent space with the space of theoretical models causes the decoder network to become a fast, predictive simulator with the potential to replace current, computationally-costly simulators. Here, we provide proof-of-principle results on two particle physics examples, Z-boson and top-quark decays, but stress that OTUS can be widely applied to other fields.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Identifying Bayesian optimal experiments for uncertain biochemical pathway models

Abstract Pharmacodynamic (PD) models are mathematical models of cellular reaction networks that include drug mechanisms of action. These models are useful for studying predictive therapeutic outcomes of novel drug therapies in silico. However, PD models are known to possess significant uncertainty with respect to constituent parameter data, leading to uncertainty in the model predictions. Furthermore, experimental data to calibrate these models is often limited or unavailable for novel pathways. In this study, we present a Bayesian optimal experimental design approach for improving PD model prediction accuracy. We then apply our method using simulated experimental data to account for uncertainty in hypothetical laboratory measurements. This leads to a probabilistic prediction of drug performance and a quantitative measure of which prospective laboratory experiment will optimally reduce prediction uncertainty in the PD model. The methods proposed here provide a way forward for uncertainty quantification and guided experimental design for models of novel biological pathways.

97 MATHEMATICS AND COMPUTING↗

Improved Sampling Algorithms in the Risk-Informed Safety Margin Characterization Toolkit

The RISMC approach is developing advanced set of methodologies and algorithms in order to perform Probabilistic Risk Analyses (PRAs). In contrast to classical PRA methods, which are based on Event-Tree and Fault-Tree methods, the RISMC approach largely employs system simulator codes applied to stochastic analysis tools. The basic idea is to randomly perturb (by employing sampling algorithms) timing and sequencing of events and internal parameters of the system codes (i.e., uncertain parameters) in order to estimate stochastic parameters such as core damage probability. This approach applied to complex systems such as nuclear power plants requires to perform a series of computationally expensive simulation runs given a large set of uncertain parameters. These types of analysis are affected by two issues. Firstly, the space of the possible solutions (a.k.a., the issue space or the response surface) can be sampled only very sparsely, and this precludes the ability to fully analyze the impact of uncertainties on the system dynamics. Secondly, large amounts of data are generated and tools to generate knowledge from such data sets are not yet available. This report focuses on the first issue and in particular employs novel methods that optimize the information generated by the sampling process by sampling unexplored and risk-significant regions of the issue space: adaptive (smart) sampling algorithms. They infer system response from surrogate models constructed from existing samples and predict the most relevant location of the next sample. It is therefore possible to understand features of the issue space with a small number of carefully selected samples. In this report, we will present how it is possible to perform adaptive sampling using the RISMC toolkit and highlight the advantages compared to more classical sampling approaches such Monte-Carlo. We will employ RAVEN to perform such statistical analyses using both analytical cases but also another RISMC code: RELAP-7.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗