Search NASA⌕ Search

SEARCH · Search NASA

Results for “Probabilities Mathematics”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

High energy particle production from proton synchrotron radiation in strong magnetic fields in relativistic quantum field theory

We investigate photon, pion, and 𝜌-meson production from proton synchrotron radiation in the presence of strong magnetic fields. The proton decay widths and the luminosities of the emitted particles are calculated within a relativistic quantum framework that incorporates Landau quantization. A scaling rule is derived for the transition probability between different Landau levels. This allows an evaluation of transitions for extremely high Landau numbers exceeding 10 15 . Furthermore, we calculate the momentum distribution of the emitted particles by properly including the proton recoil effect associated with particle emission. The results differ significantly from conventional semiclassical approaches.

Cosmic ray sources↗
DOE OSTI2024

Artificial Intelligence and Machine Learning Support for Probabilistic Fracture Mechanics

In this research, artificial intelligence and machine learning (ML) methods are used to search an uncertain parameter space more efficiently for the most important inputs with respect to response sensitivities. These methods are applied to the Extremely Low Probability of Rupture (xLPR) probabilistic fracture mechanics code used at the U.S. Nuclear Regulatory Commission (NRC) in support of nuclear regulatory research. This report documents two separate but related sub-tasks: (1) ranking important uncertain input features with respect to target outputs, determined by convergence in confidence intervals for increasing sample sizes using simple random sampling; and (2) implementation of a reduced-order surrogate model for fast, approximate sample generation. Unoptimized readily available off-the-shelf ML models were used in both sub-tasks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Divide and conquer: separating the two probabilities in seismic phase picking

There are two fundamental probabilities in the seismic phase picking process—the probability of the existence of a seismic phase (detection probability) and the probability associated with the phase arrival time estimation (timing probability). The nearly ubiquitous approach in developing deep learning phase picking models is to use a kernel, such as a truncated Gaussian, to mask the labelled phase arrival time and train a segmentation model. Once a model is trained, the times of the peaks in the output are taken as phase arrival times (picks), and the height of the peaks are taken as ‘probability’ of the picks. Here, we show that this ‘probability’ represents neither the detection nor the timing probability because this approach forces the output to follow the shape of the kernel. We introduce an approach using two models to estimate these two distinct probabilities. We use a binary classifier with a calibrated confidence to address the detection probability and a multiclass classifier to obtain a probability mass function to address the timing probability. This new approach can make the deep learning-based phase picking process more interpretable and provide options to logically control seismic monitoring workflows.

58 GEOSCIENCES↗
DOE OSTI2026

Powered By ERAD [Slides]

Energy Resilience Analysis for Distribution Power System (ERAD) is a free, open-source Python toolkit for estimating the energy and service impacts of hazards like earthquakes and flooding. It uses a graph-based approach to capture high resolution connectivity among the grid, critical services, and customers and rapidly compute household level metrics and aggregated statistics across large distribution systems. It uses asset fragility curves that relate hazard severity to survival probability for power system equipment including cables, transformers, substations, etc. The tool is designed to be modular and extensible, allowing it to interface with third-party hazard simulators and integrate into broader resilience analysis workflows. ERAD enables researchers, students, communities, distribution utilities, and other stakeholders to understand hazard impacts and evaluate the effectiveness of different programs to improve energy resilience. The webinar was hosted by NLR researcher Aadil Latif.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Data-driven prediction of scaling and ignition of inertial confinement fusion experiments

Recent advances in inertial confinement fusion (ICF) at the National Ignition Facility (NIF), including ignition and energy gain, are enabled by a close coupling between experiments and high-fidelity simulations. Neither simulations nor experiments can fully constrain the behavior of ICF implosions on their own, meaning pre- and postshot simulation studies must incorporate experimental data to be reliable. Linking past data with simulations to make predictions for upcoming designs and quantifying the uncertainty in those predictions has been an ongoing challenge in ICF research. We have developed a data-driven approach to prediction and uncertainty quantification that combines large ensembles of simulations with Bayesian inference and deep learning. The approach builds a predictive model for the statistical distribution of key performance parameters, which is jointly informed by past experiments and physics simulations. The prediction distribution captures the impact of experimental uncertainty, expert priors, design changes, and shot-to-shot variations. We have used this new capability to predict a 10× increase in ignition probability between Hybrid-E shots driven with 2.05 MJ compared to 1.9 MJ, and validated our predictions against subsequent experiments. We describe our new Bayesian postshot and prediction capabilities, discuss their application to NIF ignition and validate the results, and finally investigate the impact of data sparsity on our prediction results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Stochastic Optimization and Uncertainty Quantification of Natrium-based Nuclear-Renewable Energy Systems for Flexible Power Applications in Deregulated Markets

Rapid integration of variable renewable energy sources (VRES) has made modeling and stochastic optimization of hybrid energy systems crucial for studying their long-term performance and viability. However, most studies have focused on just historical data, which may be unreliable for capturing short-term fluctuations, rare events, and long-term patterns of energy demand, price, and the variability of renewable energy sources. For this study, optimal synthetic time series models were developed using Wasserstein distance. The models were validated by comparing the key statistical measures against those of the historical data. They were then used to optimize the integrated Natrium-style advanced energy systems and their long-term (30 years) economics. The stochastic model performs bi-level optimization to find the optimal sizes for the balance of plant and thermal energy storage, while also optimizing energy dispatch to achieve the maximum net present value. In studies of two deregulated markets (California ISO and the Electric Reliability Council of Texas), the integrated Natrium-style system performed better in CAISO than in ERCOT, given higher and more consistent electricity prices during peak-demand periods. The potentially enlarged cost associated with the variable operation and maintenance of the TES system also plays a significant role in driving the system sizing, thus its impacts on the system are investigated in detail through comparison against a baseline case. The study also finds that the bi-level optimization results based on stochastic gradient descent closely match the grid search results. The uncertainty quantification of the stochastic signals provides further NPV-related insights and probability distributions for the case studies. The normal standard error of the mean of NPV for the case with and without TES VOM for CAISO were found to be 7.73M (plus-minus sign) 1.09M USD and 104.99M (plus-minus sign) 1.25M USD, respectively based on a 95% confidence. Given the relatively small NPV variance based on 150 samples, the analysis affords the most robust possible prediction of the techno-economic performance of the integrated Natrium-style energy systems.

25 ENERGY STORAGE↗
DOE OSTI2026

Predictive models of the genetic bases underlying budding yeast fitness in multiple environments

Abstract The ability of organisms to adapt and survive depends on the effects of genes and the environment on fitness. However, the multigenic nature of fitness and genotype-by-environment interactions hinder our understanding of the genetic basis of fitness. Here, we established fitness prediction models for 35 environments using machine learning and existing fitness data and different genetic variant types for a Saccharomyces cerevisiae population. Models revealed that the predictive ability of genetic variants varied across environments, with copy number variants explaining the majority of fitness variation in most cases. Model interpretation showed that different variant types identified distinct gene sets associated with predictive variants. These gene sets were significantly enriched in experimentally validated genes affecting fitness in only a subset of environments, indicating that many genes influencing fitness remain unexplored. Notably, non-experimentally validated genes were more important than validated ones for fitness predictions. Gene contributions to predictions were both isolate- and environment-dependent, pointing to gene-by-gene and gene-by-environment interactions. Furthermore, models uncovered experimentally validated and novel candidate genetic interactions for a well-characterized stress, the fungicide benomyl. These findings highlight the feasibility of identifying the genetic basis of fitness by using different genetic variant types and offer novel targets for future functional analysis.

DNA copy number variations↗
DOE OSTI2024

Distributionally Robust Variational Quantum Algorithms With Shifted Noise

Given their potential to demonstrate near-term quantum advantage, variational quantum algorithms (VQAs) have been extensively studied. Although numerous techniques have been developed for VQA parameter optimization, it remains a significant challenge. A practical issue is the high sensitivity of quantum noise to environmental changes, and its propensity to shift in real time. This presents a critical problem as an optimized VQA ansatz may not perform effectively under a different noise environment. For the first time, we explore how to optimize VQA parameters to be robust against unknown shifted noise. We model the noise level as a random variable with an unknown probability density function (PDF), and we assume that the PDF may shift within an uncertainty set. This assumption guides us to formulate a distributionally robust optimization problem, with the goal of finding parameters that maintain effectiveness under shifted noise. We utilize a distributionally robust Bayesian optimization solver for our proposed formulation. This provides numerical evidence in both the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) with hardware-efficient ansatz, indicating that we can identify parameters that perform more robustly under shifted noise. We regard this work as the first step towards improving the reliability of VQAs influenced by real-time noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Ensemble variational Fokker-Planck methods for data assimilation

Particle flow filters solve Bayesian inference problems by smoothly transforming a set of particles into samples from the posterior distribution. Particles move in state space under the flow of an McKean-Vlasov-Itˆo process. This work introduces the Variational Fokker-Planck (VFP) framework for data assimilation, a general approach that includes previously known particle flow filters as special cases. The McKean-Vlasov-Itˆo process that transforms particles is defined via an optimal drift that depends on the selected diffusion term. It is established that the underlying probability density - sampled by the ensemble of particles - converges to the Bayesian posterior probability density. For a finite number of particles the optimal drift contains a regularization term that nudges particles toward becoming independent random variables. Based on this analysis, we derive computationally-feasible approximate regularization approaches that penalize the mutual information between pairs of particles, and avoid particle collapse. Moreover, the diffusion plays a role akin to a particle rejuvenation approach that aims to alleviate particle collapse. The VFP framework is very flexible. Different assumptions on prior and intermediate probability distributions can be used to implement the optimal drift, and localization and covariance shrinkage can be applied to alleviate the curse of dimensionality. A robust implicit-explicit method is discussed for the efficient integration of stiff McKean- Vlasov-Itˆo processes. Here, the effectiveness of the VFP framework is demonstrated on three progressively more challenging test problems, namely the Lorenz ’63, Lorenz ’96 and the quasi-geostrophic equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Persistent Classification: Understanding Adversarial Attacks by Studying Decision Boundary Dynamics

ABSTRACT There are a number of hypotheses underlying the existence of adversarial examples for classification problems. These include the high‐dimensionality of the data, the high codimension in the ambient space of the data manifolds of interest, and that the structure of machine learning models may encourage classifiers to develop decision boundaries close to data points. This article proposes a new framework for studying adversarial examples that does not depend directly on the distance to the decision boundary. Similarly to the smoothed classifier literature, we define a (natural or adversarial) data point to be ( γ , σ)‐stable if the probability of the same classification is at least for points sampled in a Gaussian neighborhood of the point with a given standard deviation . We focus on studying the differences between persistence metrics along interpolants of natural and adversarial points. We show that adversarial examples have significantly lower persistence than natural examples for large neural networks in the context of the MNIST and ImageNet datasets. We connect this lack of persistence with decision boundary geometry by measuring angles of interpolants with respect to decision boundaries. Finally, we connect this approach with robustness by developing a manifold alignment gradient metric and demonstrating the increase in robustness that can be achieved when training with the addition of this metric.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Implementation of Genetic Algorithms to Optimize Metal–Organic Frameworks for CO 2 Capture

Metal-organic frameworks (MOFs) are promising materials for CO 2 capture with the potential to use less energy than current industrial CO 2 capture methods. MOFs are highly versatile sorbents, and there is an almost unlimited number of MOFs that could be synthesized. In this work, we used a genetic algorithm (GA) and grand canonical Monte Carlo (GCMC) simulations to efficiently search for high-performing MOFs for CO 2 capture. We analyzed the effects of important GA parameters, including the mutation probability, the number of MOFs per generation and the number of GA generations, on the GA performance. Here, we performed GCMC simulations on-the-fly during the GA procedure to determine the performance of proposed MOFs and optimized their structures using multiple objective functions across different topologies. The GA was able to determine top-performing MOFs balancing CO 2 selectivity versus working capacity and reduced the cost of molecular simulations by a factor of 25 versus brute-force screening of an entire database of structures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Multiple Changepoint Detection for Non‐Gaussian Time Series

ABSTRACT This article combines methods from existing techniques to identify multiple changepoints in non‐Gaussian autocorrelated time series. A transformation is used to convert a Gaussian series into a non‐Gaussian series, enabling penalized likelihood methods to handle non‐Gaussian scenarios. When the marginal distribution of the data is continuous, the methods essentially reduce to the change of variables formula for probability densities. When the marginal distribution is count‐oriented, Hermite expansions and particle filtering techniques are used to quantify the scenario. Simulations demonstrating the efficacy of the methods are given and two data sets are analyzed: 1) the proportion of home runs hit by Major League Baseball batters from 1920 to 2023 and 2) a six‐dimensional series of tropical cyclone counts from the Earth's basins of generation from 1980 to 2023. In the first series, beta marginal distributions are used to describe the proportions; in the second, Poisson marginal distributions seem appropriate.

Lund, Robert [Department of Statistics University ↗
DOE OSTI2024

Self-Aware Local Autonomous and Semi-Cooperative Control for Cross-Layered Resilience (SLAC3R)

The objective of this work is to develop and demonstrate novel, adaptive, lightweight algorithms that enable the decision-making agents in a large cyber-physical network to act both autonomously and in collaborative harmony to enforce assured resilience across spatiotemporal layers, even under unforeseen adversarial scenarios (e.g., high- impact-low-probability events). Towards this end, the proposed solution will serve as minimally invasive add-on layers that bridge the existing (faster, reactive) local myopic controls and (slower, predictive) centralized optimization. Importantly, the proposed algorithms will enable the multi-agent network to autonomously and collaboratively enforce resilient operation under no or limited communication environment typical of severe cyber- physical adversarial events. The expected outcome of this effort is a suite of prototype, open-source, software algorithms for safety-aware local autonomous and semi-cooperative control (SLAC3R), demonstrated on networked microgrids (via RD2C/Thrust-1 OPAL-RT testbed).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Deriving the Landauer Principle From the Quantum Shannon Entropy

We derive an expression to determine the equilibrium probability distribution of a quantum state in contact with a noisy thermal environment that formally separates contributions from quantum and classical forms of probabilistic uncertainty. A statistical mechanical interpretation of this probability distribution enables us to derive an expression for the minimum free energy costs for arbitrary (reversible or irreversible) quantum state changes. In conclusion, based on this derivation, we demonstrate that–in contrast to classical systems–the free energy required to erase or reset a qubit depends sensitively on both the fidelity of the target state and on the physical properties of the environment, such as the number of quantum bath states, due primarily to the entropic effects of system-bath entanglement.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Enhancing scalability and accuracy of quantum poisson solver

The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far either suffer from lack of accuracy and/or are limited to very small sizes of the problem and thus have no practical usage. In this regard, our previous work showed a proof-of-concept demonstration in advancing quantum Poisson solver algorithm and validated preliminary results for a simple case of 3 x 3 problem. In this work, we delve into comprehensive research details, presenting the results on up to 15 x 15 problems that include step-by-step improvements in Poisson equation solutions, scaling performance, and experimental exploration. In particular, we demonstrate the implementation of eigenvalue amplification by a factor of up to 2 8 , achieving a significant improvement in the accuracy of our quantum Poisson solver and comparing that to the exact solution. Additionally, we present success probability results, highlighting the reliability of our quantum Poisson solver. Moreover, we explore the scaling performance of our algorithm against the circuit depth and width, demonstrating how our approach scales with larger problem sizes and thus further solidifies the practicality of easy adaptation of this algorithm in real-world applications. We also discuss a multilevel strategy for how this algorithm might be further improved to explore much larger problems with greater performance. Finally, through our experiments on the IBM quantum hardware, we conclude that though overall results on the existing NISQ hardware are dominated by the error in the CNOT gates, this work opens a path to realizing a multidimensional Poisson solver on near-term quantum hardware.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Identifying Adversarial Cyber-Activity in Operational Technology Environments Using Bayesian Networks

Critical infrastructure and other operational technology (OT) environments face increasing cybersecurity risks from adversarial behavior. This paper describes the development of a risk model using a Bayesian network to enhance the comprehension of observable cyber events caused by malicious activity in OT environments. The core of the Bayesian network is a process model that describes the stages of adversary behavior. The remainder of the model is based on the MITRE ATT&CK® for Industrial Control Systems (ICS) taxonomy, which includes tactics and techniques that may be used by the adversary. The observables provide evidence for adversary behavior through the intermediary technique and tactic nodes. One challenge in constructing this model is a lack of open-source data from cyber-attacks on OT systems. This paper discusses learning from limited data, the elicitation of expert opinion to construct the conditional probability tables when data is scarce, and the refinement of the most difficult conditional probabilities tables using several forms of sensitivity analyses. Finally, the Bayesian network is demonstrated using two historical case studies: the DarkSide ransomware attack on the Colonial Pipeline and the destructive cyberattack targeting the ThyssenKrupp blast furnace. Index Terms—Cybersecurity, industrial control systems, operational technology

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

It is not σ 8 : constraining the non-linear matter power spectrum with the Dark Energy Survey Year-5 supernova sample

The weak gravitational lensing magnification of Type Ia supernovae (SNe Ia) is sensitive to the matter power spectrum on scales $k\gt 1 h$ Mpc$^{-1}$, making it unwise to interpret SNe Ia lensing in terms of power on linear scales. We compute the probability density function of SNe Ia magnification as a function of standard cosmological parameters, plus an empirical parameter $A_{\rm mod}$ which describes the suppression or enhancement of matter power on non-linear scales compared to a cold dark matter only model. While baryons are expected to enhance power on the scales relevant to SN Ia lensing, other physics such as neutrino masses or non-standard dark matter may suppress power. Using the Dark Energy Survey Year-5 sample, we find $A_{\rm mod} = 0.77^{+0.69}_{-0.40}$ (68 per cent credible interval around the median). Although the median is consistent with unity there are hints of power suppression, with $A_{\rm mod} \lt 1.09$ at 68 per cent credibility.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

A Review and Comparison of Different Sensitivity Analysis Techniques in Practice

There exist many methods for sensitivity analysis readily available to the practitioner. While each seeks to help the modeler answer the same general question – How do sources of uncertainty or changes in the model inputs relate to uncertainty in the output? – different methods are associated with different assumptions, constraints, and required resources, leading to conclusions that may vary in interpretability and level of detail. Thus, it is crucial that the practitioner selects the desired sensitivity analysis method judiciously, making sure to match the selected approach to the specifics of their problem and to their desired objectives. In this chapter, we provide a practical overview of a collection of widely used, widely available sensitivity analysis methods. We focus on global sensitivity approaches, which seek to characterize how uncertainty in the model output may be allocated to sources of uncertainty in model inputs across the entire input space. Generally, this will require the practitioner to specify a probability distribution over the input space. On the other hand, methods for local sensitivity analysis do not require this specification but they have more limited utility, providing insight into sources of uncertainty associated only with a particular, specified location in the input space. Our hope is that this chapter may serve as a decision-making tool for practitioners, helping to guide the selection of a sensitivity analysis approach that will best fit their needs. To support this goal, we have selected a suite of approaches to cover, which, while not exhaustive, we believe provides a flexible and robust sensitivity analysis toolkit. All methods included are widely used and available in standard software packages.

97 MATHEMATICS AND COMPUTING↗