Search NASA⌕ Search

SEARCH · Search NASA

Results for “Probabilistic”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

It Depends - An Overview of Probabilistic Risk Analysis Concepts

How do you understand the data and assumptions in your probabilistic analysis? The PRA analyst needs to understand the data and input assumptions to effectively communicate the system/mission's risks. The decision maker also needs to understand conservatisms and how to interpret uncertainty in the PRA results. Properties such as assumptions on the distributions, uncertainty, use of test data, and common cause modeling can be the subject of much discussion, but often are the leading drivers of a risk profile.

risk assessment↗
DOE OSTI2024

Development and Validation of a Probabilistic Risk Assessment Model for a Generic Modular High Temperature Gas-Cooled Reactor

This study looks to develop and validate a probabilistic risk assessment (PRA) model for the modular high temperature gas-cooled reactor (MHTGR) using INL’s Systems Analysis Programs for Hands-on Integrated Reliability Evaluations (SAPHIRE) software. Validation against a General Atomics design involves matching event and fault trees to historical frequencies, with a goal of under 15% difference. The research aims to deliver a reliable PRA model to assess the safety of MHTGRs for use within high-temperature industrial applications.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Probabilistic Discrete‐Time Models for Spreading Processes in Complex Networks: A Review

Abstract Research into network dynamics of spreading processes typically employs both discrete and continuous time methodologies. Although each approach offers distinct insights, integrating them can be challenging, particularly when maintaining coherence across different time scales. This review focuses on the Microscopic Markov Chain Approach (MMCA), a probabilistic f ramework originally designed for epidemic modeling. MMCA uses discrete dynamics to compute the probabilities of individuals transitioning between epidemiological states. By treating each time step—usually a day—as a discrete event, the approach captures multiple concurrent changes within this time frame. The approach allows to estimate the likelihood of individuals or populations being in specific states, which correspond to distinct epidemiological compartments. This review synthesizes key findings from the application of this approach, providing a comprehensive overview of its utility in understanding epidemic spread.

Granell, Clara↗
DOE OSTI2026

3D probabilistic fracture mechanics / computational fluid dynamics simulation of a reactor pressure vessel under transient conditions

Reactor pressure vessels (RPVs) are safety-critical light-water-reactor components that, under irradiation, experience long-term material degradation in the form of embrittlement. This can increase their susceptibility to fracture under thermal-shock conditions, which could occur during off-normal transients such as loss-of-coolant accidents (LOCAs). During a LOCA, the most severe conditions for the RPV occur when emergency core cooling water is injected through the cold legs into the water-and-steam-filled RPV. The rapid cooling of the downcomer and internal RPV surface causes decreased temperature and elevated thermally driven tensile stresses in the RPV wall. This, combined with long-term material embrittlement, may cause fracture initiation at pre-existing flaws, challenging the integrity of the RPV. Assessing RPV integrity during transients with a large spatial variation in the coolant temperature requires a modeling approach that considers the effects of spatially varying coolant temperature on the fracture probability of a population of flaws distributed throughout the RPV, accounting for spatially varying embrittlement. Here, the present study addresses this need by demonstrating first-of-its-kind coupling of a high-fidelity 3D computational fluid dynamics code with 3D probabilistic fracture mechanics This was accomplished using representative models of a pressurized-water reactor subjected to small- and medium-break LOCA conditions, both of which can result in large spatial temperature variations. While the observed impact of accounting for 3D effects was minimal under the small-break LOCA this study indicates a significant increase in the probability of fracture initiation under the medium-break LOCA when 3D effects are considered, relative to a spatially uniform cooling scenario.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2025

Essential barrier height and a probabilistic approach in characterizing potential landscape

In this work we propose a probabilistic approach to investigate the shape of landscapes of multi-dimensional potential functions. Under a suitable coupling scheme, two copies of the overdamped Langevin dynamics associated with the potential function are coupled, and the coupling times are collected. Assuming a set of intuitive yet technically challenging conditions on the coupling scheme, it is shown that the tail distributions of the coupling times exhibit qualitatively different dependencies on the noise magnitude for single-well versus multi-well potential functions. More specifically, for convex single-well potentials, the negative tail exponent of the coupling time distribution is uniformly bounded away from zero by the convexity parameter and is independent of the noise magnitude. In contrast, for multi-well potentials, the negative tail exponent decreases exponentially as the noise vanishes, with the decay rate governed by the essential barrier height, a quantity introduced in this paper to characterize the non-convex nature of the potential function. Numerical investigations are conducted for a variety of examples, including the Rosenbrock function, interacting particle systems, and loss functions arising in artificial neural networks. These examples not only illustrate the theoretical results in various contexts but also provide crucial numerical validation of the conjectured assumptions, which are essential to the theoretical analysis yet lie beyond the reach of standard technical tools.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Practical Probabilistic Benchmark for AI Weather Models

Since the weather is chaotic, it is necessary to forecast an ensemble of future states. Recently, multiple AI weather models have emerged claiming breakthroughs in deterministic skill. Unfortunately, it is hard to fairly compare ensembles of AI forecasts because variations in ensembling methodology become confounding and the baseline data volume is immense. We address this by scoring lagged initial condition ensembles—whereby an ensemble can be constructed from a library of deterministic hindcasts. This allows the first parameter‐free intercomparison of leading AI weather models' probabilistic skill against an operational baseline. Lagged ensembles of the two leading AI weather models, GraphCast and Pangu, perform similarly even though the former outperforms the latter in deterministic scoring. These results are elaborated upon by sensitivity tests showing that commonly used multiple time‐step loss functions damage ensemble calibration.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Immersion Freezing in Particle-Based Aerosol-Cloud Microphysics: A Probabilistic Perspective on Singular and Time-Dependent Models

Cloud droplets containing immersed ice-nucleating particles (INPs) may freeze at temperatures above the homogeneous freezing threshold temperature in a process referred to as immersion freezing. In modeling studies, immersion freezing is often described using either so-called “singular” or “time-dependent” parameterizations. Here, we compare both approaches and discuss them in the context of probabilistic particle-based (super-droplet) cloud microphysics modeling. First, using a box model, we contrast how both parameterizations respond to idealized ambient cooling rate profiles and quantify the impact of the polydispersity of the immersed surface spectrum on the frozen fraction evolution. Presented simulations highlight that the singular approach, constituting a time-integrated form of a more general time-dependent approach, is only accurate under a limited range of ambient cooling rates. The time-dependent approach is free from this limitation. Second, using a prescribed-flow two-dimensional cloud model, we illustrate the macroscopic differences in the evolution in time of ice particle concentrations in simulations with flow regimes relevant to ambient cloud conditions. The flow-coupled aerosol-budget-resolving simulations highlight the benefits and challenges of modeling cloud condensation nuclei activation and immersion freezing on insoluble ice nuclei with super-particle methods. The challenges stem, on the one hand, from heterogeneous ice nucleation being contingent on the presence of relatively sparse immersed INPs, and on the other hand, from the need to represent a vast population of particles with relatively few so-called super particles (each representing a multiplicity of real particles). We discuss the critical role of the sampling strategy for particle attributes, including the INP size, the freezing temperature (for singular scheme) and the multiplicity.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Probabilistic Diffusion Models Advance Extreme Flood Forecasting

Extreme floods pose escalating risks in a changing climate, yet forecasting remains challenging due to peak flow underestimation and high uncertainty. We introduce diffusion-based runoff model (DRUM), a probabilistic deep learning (DL) approach that advances extreme flood forecasting across representative basins in the contiguous United States. DRUM outperforms state-of-the-art benchmarks, enhancing nowcasting skill for the top 1‰ of flows in 72.3% of studied basins. Under operational scenarios, DRUM extends reliable lead times by nearly a full day for 20- and 50-year floods. When evaluated with measured precipitation, an ideal condition, recall improves by 0.3–0.4 and the early warning window extends by 2.3 days for 50-year floods. The enhancement potential varies regionally, with precipitation-driven flood zones in the eastern and northwestern US benefiting most, gaining 3–7 days in lead time. These findings highlight the transformative potential of diffusion models as a cutting-edge generative AI technique for advancing hydrology and broader Earth system sciences.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

EFIT-Prime: Probabilistic and physics-constrained reduced-order neural network model for equilibrium reconstruction in DIII-D

We introduce EFIT-Prime, a novel machine learning surrogate model for EFIT (Equilibrium FIT) that integrates probabilistic and physics-informed methodologies to overcome typical limitations associated with deterministic and ad hoc neural network architectures. EFIT-Prime utilizes a neural architecture search-based deep ensemble for robust uncertainty quantification, providing scalable and efficient neural architectures that comprehensively quantify both data and model uncertainties. Physically informed by the Grad–Shafranov equation, EFIT-Prime applies a constraint on the current density J tor and a smoothness constraint on the first derivative of the poloidal flux, ensuring physically plausible solutions. Furthermore, the spatial location of the diagnostics is explicitly incorporated in the inputs to account for their spatial correlation. Extensive evaluations demonstrate EFIT-Prime's accuracy and robustness across diverse scenarios, most notably showing good generalization on negative-triangularity discharges that were excluded from training. Timing studies indicate an ensemble inference time of 15 ms for predicting a new equilibrium, offering the possibility of plasma control in real-time, if the model is optimized for speed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Tropical Cyclone Super Resolution using conditional diffusion denoising probabilistic model from mesoscale simulation to LES

Accurate modeling of tropical cyclone wind fields is essential for the design, risk assessment, and operational planning of offshore energy infrastructure. While mesoscale simulations are widely used thanks to their computational efficiency, they lack the necessary resolution to capture key features such as wind shear and veer profiles as well as the distribution turbulent kinetic energy (TKE). High-fidelity large-eddy simulation (LES) models on the other hand, can resolve turbulent structures and provide a more accurate representation of the complex wind field, albeit at a higher computational cost. To address this modeling gap, we introduce a two-part generative framework to enhance the resolution and physics-capturing ability of mesoscale simulations. First, a reduced-order model based on Karhunen–Loève (KL) decomposition is used to extract dominant spatial modes from one-dimensional mean wind profiles. A multilayer perceptron (MLP) is trained to map mesoscale mode weights to their LES counterparts, enabling accurate reconstruction of vertical velocity profiles. Second, a conditional Diffusion Denoising Probabilistic Model (DDPM) is developed to super-resolve coarse and low-fidelity mesoscale velocity fields, recovering fine-scale turbulence structures and stress distributions. The framework is evaluated across different tropical cyclone intensity categories defined by the Saffir–Simpson scale and demonstrates strong performance in both interpolation and extrapolation tasks. The generated fields accurately reproduce spatial coherence, stress distributions, and spectral energy characteristics observed in LES data. By bridging the fidelity gap between mesoscale and LES outputs, this approach offers a scalable, data-driven solution for enhancing the representation of tropical cyclone wind fields, enabling more robust offshore energy infrastructure systems design in tropical-cyclone-prone areas.

17 WIND ENERGY↗
DOE OSTI2025

Evaluating probabilistic deep learning methods for uncertainty quantification of temperature downscaling

Deep learning (DL) has emerged as a promising tool for downscaling coarse-resolution climate data to high-resolution outputs, enabling improved regional climate predictions. A critical aspect of DL-based downscaling is the incorporation of uncertainty quantification (UQ), which enhances the interpretability and reliability of predictions—key factors for climate risk assessment and decision-making. This study develops a DL model to downscale 2 m temperature across the contiguous United States using reanalysis datasets. We systematically evaluate three epistemic UQ methods—deep ensembles (DEns), Monte Carlo dropout (MCD), and Flipout—based on their probabilistic accuracy, downscaling performance, sensitivity to geographical features, and computational efficiency. Results indicate that MCD generally outperforms Flipout and DEns in terms of calibration and downscaling accuracy. However, DEns demonstrate lower calibration errors in coastal regions, indicating its higher confidence within these areas. Flipout, in contrast, is more sensitive to elevation gradients and exhibits higher calibration errors in mountainous regions. Hence, the choice of UQ method for this task depends on the specific requirements of the application. For applications that prioritize overall calibration, downscaling accuracy, and computational efficiency, MCD is a strong candidate. These findings highlight the importance of selecting UQ methods based on application-specific requirements, such as geographical context and computational constraints. By addressing the trade-offs between UQ methods, this study provides actionable insights for improving the reliability, scalability, and utility of DL-based downscaling in climate science.

Environmental sciences↗
DOE OSTI2024

Copacabana: a probabilistic membership assignment method for galaxy clusters

Cosmological analyses using galaxy clusters in optical/near-infrared photometric surveys require robust characterization of their galaxy content. Precisely determining which galaxies belong to a cluster is crucial. In this paper, we present the COlor Probabilistic Assignment of Clusters And BAyesiaN Analysis (Copacabana) algorithm. Copacabana computes membership probabilities for all galaxies within an aperture centred on the cluster using photometric redshifts, colours, and projected radial probability density functions. We use simulations to validate Copacabana and we show that it achieves up to 89 per cent membership accuracy with a mild dependence on photometric redshift uncertainties and choice of aperture size. We find that the precision of the photometric redshifts has the largest impact on the determination of the membership probabilities followed by the choice of the cluster aperture size. We also quantify how much these uncertainties in the membership probabilities affect the stellar mass–cluster mass scaling relation, a relation that directly impacts cosmology. Using the sum of the stellar masses weighted by membership probabilities (⁠μ * ⁠) as the observable, we find that Copacabana can reach an accuracy of 0.06 dex in the measurement of the scaling relation at low redshift for a Legacy Survey of Space and Time type survey. These results indicate the potential of Copacabana and μ * to be used in cosmological analyses of optically selected clusters in the future.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Effectiveness of denoising diffusion probabilistic models for fast and high-fidelity whole-event simulation in high-energy heavy-ion experiments

Artificial intelligence (AI) generative models, such as generative adversarial networks (GANs), variational autoencoders, and normalizing flows, have been widely used and studied as efficient alternatives for traditional scientific simulations. However, they have several drawbacks, including training instability and inability to cover the entire data distribution, especially for regions where data are rare. This is particularly challenging for whole-event, full-detector simulations in high-energy heavy-ion experiments, such as sPHENIX at the Relativistic Heavy Ion Collider and Large Hadron Collider experiments, where thousands of particles are produced per event and interact with the detector. This work investigates the effectiveness of denoising diffusion probabilistic models (DDPMs) as an AI-based generative surrogate model for the sPHENIX experiment that includes the heavy-ion event generation and response of the entire calorimeter stack. DDPM performance in sPHENIX simulation data is compared with a popular rival, GANs. Results show that both DDPMs and GANs can reproduce the data distribution where the examples are abundant (low-to-medium calorimeter energies). Nonetheless, DDPMs significantly outperform GANs, especially in high-energy regions where data are rare. Additionally, DDPMs exhibit superior stability compared to GANs. The results are consistent between both central and peripheral centrality heavy-ion collision events. Moreover, DDPMs offer a substantial speedup of approximately a factor of 100 compared to the traditional Geant4 simulation method.

42 ENGINEERING↗
DOE OSTI2024

Error mitigation in variational quantum eigensolvers using tailored probabilistic machine learning

Quantum computing technology has the potential to revolutionize the simulation of materials and molecules in the near future. A primary challenge in achieving near-term quantum advantage is effectively mitigating the noise effects inherent in current quantum processing units (QPUs). This challenge is also decisive in the context of quantum-classical hybrid schemes employing variational quantum eigensolvers (VQEs) that have attracted significant interest in recent years. In this paper, we present a method that employs parametric Gaussian process regression (GPR) within an active learning framework to mitigate noise in quantum computations, focusing on VQEs. Our approach, grounded in probabilistic machine learning, exploits a custom prior based on the VQE ansatz to capture the underlying correlations between VQE outputs for different variational parameters, thereby enhancing both accuracy and efficiency. We demonstrate the effectiveness of our method on a two-site Anderson impurity model and a eight-site Heisenberg model, using the IBM open-source quantum computing framework, Qiskit, showcasing substantial improvements in the accuracy of VQE outputs while reducing the number of direct QPU energy evaluations. This paper contributes to the ongoing efforts in quantum-error mitigation and optimization, bringing us a step closer to realizing the potential of quantum computing in quantum matter simulations. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Endogenizing Probabilistic Resource Adequacy Risks in Deterministic Capacity Expansion Models

In this work, we demonstrate how power system capacity expansion models can understate the stochastic effects of thermal outages when considering resource availabilities on an hourly expected value basis, yielding system designs with multiple orders of magnitude more shortfall risk than stated adequacy targets. We develop a novel approximation approach to efficiently endogenize awareness of this risk in a deterministic, linear capacity expansion framework. We compare this approach to exogenous tuning of an energy reserve margin, the leading alternative method to compensate for unmodeled probabilistic shortfall risk. Empirical results from a test system show that the new endogenous method cost-effectively meets all regional reliability targets with a single optimization solve, and produces a near-identical system design as the incumbent method without the need for repeated re-optimizations to find an appropriate reserve level. The endogenous method may also use iterative re-optimizations to further improve solution quality, although these incremental benefits were modest in the system studied.

capacity expansion modeling↗
DOE OSTI2026

Efficient Probabilistic Visualization of Local Divergence of 2D Vector Fields with Independent Gaussian Uncertainty

This work focuses on visualizing uncertainty of local divergence of two-dimensional vector fields. Divergence is one of the fundamental attributes of fluid flows, as it can help domain scientists analyze potential positions of sources (positive divergence) and sinks (negative divergence) in the flow. However, uncertainty inherent in vector field data can lead to erroneous divergence computations, adversely impacting downstream analysis. While Monte Carlo (MC) sampling is a classical approach for estimating divergence uncertainty, it suffers from slow convergence and poor scalability with increasing data size and sample counts. Thus, we present a two-fold contribution that tackles the challenges of slow convergence and limited scalability of the MC approach. (1) We derive a closed-form approach for highly efficient and accurate uncertainty visualization of local divergence, assuming independently Gaussian-distributed vector uncertainties. (2) We further integrate our approach into Viskores, a platform-portable parallel library, to accelerate uncertainty visualization. In our results, we demonstrate significantly enhanced efficiency and accuracy of our serial analytical (speed-up up to 1946×) and parallel Viskores (speed-up up to 19698×) algorithms over the classical serial MC approach. We also demonstrate qualitative improvements of our probabilistic divergence visualizations over traditional mean-field visualization, which disregards uncertainty. We validate the accuracy and efficiency of our methods on wind forecast and ocean simulation datasets.

Ouermi, Timbwaoga [University of Utah]↗
DOE OSTI2024

FuseIM: Fusing Probabilistic Traversals for Influence Maximization on Exascale Systems

Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as influence maximization. These applications heavily rely on BPTs to implement a Monte-Carlo sampling step for their approximations. Given the large sampling complexity, stochasticity of the diffusion process, and the inherent irregularity in real-world graph topologies, efficiently parallelizing these BPTs remains significantly challenging. In this paper, we present a new algorithm to fuse massive number of concurrently executing BPTs with random starts on the input graph. Our algorithm is designed to fuse BPTs by combining separate traversals into a unified frontier on distributed multi-GPU systems. To show the general applicability of the fused BPT technique, we have incorporated it into two state-of-the-art influence maximization parallel implementations (gIM and Ripples). Our experiments on up to 4K nodes of the OLCF Frontier supercomputer (32,768 GPUs and 196K CPU cores) show strong scaling behavior, and that fused BPTs can improve the performance of these implementations up to 34x (for gIM) and ~360x (for Ripples).

Neff, Reece W.↗