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.

SourceResearch connectionFrom yearThrough year

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

At least 307 records · Page 17

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Assessing the Reliability Benefits of Energy Storage as a Transmission Asset

Utilizing energy storage solutions to reduce the need for traditional transmission investments has been recognized by system planners and supported by federal policies in recent years. This work demonstrates the need for detailed reliability assessment for quantitative comparison of the reliability benefits of energy storage and traditional transmission investments. First, a mixed-integer linear programming expansion planning model considering candidate transmission lines and storage technologies is solved to find the least-cost investment decisions. Next, operations under the resulting system configuration are simulated in a probabilistic reliability assessment which accounts for weather-dependent forced outages. The outcome of this work, when applied to TPPs, is to further equalize the consideration of energy storage compared to traditional transmission assets by capturing the value of storage for system reliability.

co-optimization↗

DOE OSTI2025

Deep Neural Network Assisted Distributed Strain and Temperature Fiber Sensor System for Natural Gas Pipeline Monitoring

Natural gas pipeline integrity monitoring is crucial to detect potential leaks, find structural issues, and prevent environmental damage. This article presents a system of natural gas pipeline monitoring that uses a specialized double Brillouin peak sensing fiber along with the Brillouin optical time domain analysis (BOTDAs) technique. The calibrated sensing fiber coefficients for strain and temperature are 41.8 kHz/ με and 0.9 MHz/°C for peak 1; and 47.2 kHz/ με , and 1.11 MHz/°C for peak 2, respectively. Initially, lab tests were performed by installing a short section of double Brillouin peak fiber (DBPF) on a 1-in steel pipe under pressure up to 1000 per square inch (psi) at elevated temperatures. Simultaneous distributed measurements of temperature and pressure-induced hoop strain were successfully measured. Considering the long processing speed to extract Brillouin frequency shift (BFS), we employ a novel probabilistic deep neural network (PDNN) framework for rapid BFS prediction. Additionally, using the Finite Element Method, the effects of the pipeline pressure on hoop strain were modeled and compared to the experimental hoop strain under the same set of pipeline conditions. Finally, an actual 4-in outer diameter steel natural gas pipeline was used for pilot-scale tests, where hoop strain was measured at various pressure levels. Leaks were simulated to demonstrate accurate pipeline integrity monitoring. At an internal pipe pressure of 1000 psi, hoop strain of approximately 300 με was observed, and the sensitivity was calculated as 0.28 με /psi. The results of this pilot-scale study demonstrated that the system is capable of performing distributed monitoring sufficient to detect pipeline pressure and the presence of leaks to ensure the safe operation of gas pipelines in the field.

03 NATURAL GAS↗

DOE OSTI2026

Throughput Estimation of Data Transport Networks From Digital Twin Measurements

Digital twins of networked infrastructures, known as Virtual Infrastructure Twins (VITs), are increasingly used for software development, pre-deployment testing, and design space exploration. While VITs avoid the costs and potential disruptions associated with experiments on operational networks, their throughput measurements are typically not sufficiently accurate for performance profiling of wide-area networks that they emulate. Here, machine learning (ML) methods are developed to transform these inaccurate VIT network throughput measurements to closely match in peak and overall profile of those from a physical testbed or production network. First, a micro kernel network reflecting a physical network is utilized to collect one-time measurements on a host to support this ML transformation. Then, a generic multi-modal ML method is developed to learn a map that transforms measurements from subsequent VITs on the same host to match past, current and follow-on testbed and cloud networks. ML generalization equations are derived to establish its correctness and probabilistically guarantee its generalization accuracy. Experimental results are presented for a variety of VIT hosts with target testbed and cloud networks; they include a case study of a four-site science ecosystem wherein inaccurate convex VIT measurement profiles are transformed into accurate concave profiles of target networks.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Advanced Shuttle Strategies for Parallel QCCD Architectures

Trapped ions (TIs) are at the forefront of quantum computing implementation, offering unparalleled coherence, fidelity, and connectivity. However, the scalability of TI systems is hampered by the limited capacity of individual ion traps, necessitating intricate ion shuttling for advanced computational tasks. The quantum charge-coupled device (QCCD) framework has emerged as a promising solution, facilitating ion mobility for universal quantum computation. Current QCCD architectures predominantly feature a linear topology, which is increasingly recognized as inefficient for complex quantum operations. Anticipating the shift toward more efficacious designs, this article introduces an innovative quantum scheduling strategy optimized for parallel QCCD topologies. Our strategy proposes a probabilistic formula for ion movement, alongside ingenious methods for local layer generation and layer compression, yielding a significant reduction in ion shuttle times. Through simulations, we demonstrate that our strategy not only substantially outstrips the linear model but also exhibits better performance over other parallel strategies that employ greedy algorithms. This is achieved through our nuanced resolution of complexities, such as traffic blocks and trap capacity limitations. The consequent reduction in shuttle operations leads to lower energy consumption and an enhancement in the quantum computer's fidelity, ultimately accelerating program execution times.

43 PARTICLE ACCELERATORS↗

DOE OSTI2024

Learning Constrained Parametric Differentiable Predictive Control Policies With Guarantees

We present differentiable predictive control (DPC), a method for offline learning of constrained neural control policies for nonlinear dynamical systems with performance guarantees. We show that the sensitivities of the parametric optimal control problem can be used to obtain direct policy gradients. Specifically, we employ automatic differentiation (AD) to efficiently compute the sensitivities of the model predictive control (MPC) objective function and constraints penalties. To guarantee safety upon deployment, we derive probabilistic guarantees on closed-loop stability and constraint satisfaction based on indicator functions and Hoeffding’s inequality. We empirically demonstrate that the proposed method can learn neural control policies for various parametric optimal control tasks. In particular, we show that the proposed DPC method can stabilize systems with unstable dynamics, track time-varying references, and satisfy nonlinear state and input constraints. Our DPC method has practical time savings compared to alternative approaches for fast and memory-efficient controller design. Specifically, DPC does not depend on a supervisory controller as opposed to approximate MPC based on imitation learning. We demonstrate that, without losing performance, DPC is scalable with greatly reduced demands on memory and computation compared to implicit and explicit MPC while being more sample efficient than model-free reinforcement learning (RL) algorithms.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

A System-Level Cost Modeling Framework for Design for Remanufacturing: A Case Study of an Agricultural Machine Transmission

Remanufacturing offers significant environmental and economic benefits by restoring end-of-life products to as-new conditions. Although extensive research has been conducted on the topic, the adoption of remanufacturing practices remains limited across various industries. A primary barrier to broader implementation is the substantial upfront investment required, which necessitates reliable cost modeling to justify potential future savings. Most existing models treat components independently and ignore inter-component dependencies. We develop a probabilistic, system-level cost modeling framework that integrates reliability, reusability, and a dependency matrix to capture cascading effects across components over multiple life cycles. Our model identifies those critical components that maximize remanufacturing benefits across a product's many lives. A toy example and an industry case study (John Deere PowrQuad transmission subassembly) illustrate how design alternatives affect cumulative cost. Using a Monte Carlo simulation (MCS) to perform life cycle cost analysis on the system with different design changes, we show the normalized average cost savings after three remanufacturing cycles. Accounting for dependencies meaningfully alters cost projections and ignoring them underestimates accumulated cost by up to 20% in our examples. Furthermore, the results of our study confirm that accounting for component interdependencies is necessary to produce cost estimates that meet industry standards.

Life Cycle Analysis and Design↗

DOE OSTI2025

Micromechanical Surrogate Machine Learning Model for Creep Deformation Modeling

Process variability during the manufacture of gas turbine engine hot section components can significantly affect the material’s resulting microstructure. In casting, for instance, geometric variation within a component (thin sections versus thick sections, radial location) influences cooling rates and the resulting grain size. The high temperature creep response is known to be sensitive to grain size owing to a diffusional creep mechanism which occurs more readily along grain boundaries. Microstructural variation correspondingly drives mechanical behavior which propagates into component scale performance uncertainty. These factors are essential when planning inspection, maintenance, and repair strategies within a reliability framework. These benefits provide opportunities to increase overall energy efficiency through refined margins. Critically, there is an opportunity to bolster existing data-driven reliability models using physics-driven process-structure-property relations. Here we present recent work establishing a framework for evaluating the probabilistic creep performance of high-temperature materials. A novel microstructure-sensitive crystal plasticity finite element model is established that captures both grain boundary and crystallographic deformation effects. The computationally expensive physics model is calibrated using a statistical approach and this high-fidelity model is subsequently used to train a computationally efficient machine learning surrogate model. The surrogate model is essential for sampling a large ensemble of simulated structure-property pair results. The ensemble data are then mined to extract salient trends to be incorporated into a microstructure-sensitive reliability model. The proposed approach represents a novel way to capture microstructure-sensitive trends from physics-based models within a modern reliability framework.

Fernandez-Zelaia, Patxi [ORNL]↗

DOE OSTI2025

Dynamic molecular architecture of the synaptonemal complex

During meiosis, pairing between homologous chromosomes is stabilized by the assembly of the synaptonemal complex (SC). The SC ensures the formation of crossovers between homologous chromosomes and regulates their distribution. However, how the SC regulates crossover formation remains elusive. We isolated an unusual mutation in Caenorhabditis elegans that disrupts crossover interference but not SC assembly. This mutation alters the unique C terminal domain of an essential SC protein, SYP-4, a likely ortholog of the vertebrate SC protein SIX6OS1. We use three-dimensional stochastic optical reconstruction microscopy (3D-STORM) to interrogate the molecular architecture of the SC from wild-type and mutant C. elegans animals. Using a probabilistic mapping approach to analyze super-resolution image data, we detect changes in the organization of the synaptonemal complex in wild-type animals that coincide with crossover designation. We also found that our syp-4 mutant perturbs SC architecture. Our findings add to growing evidence that the SC is an active material whose molecular organization contributes to chromosome-wide crossover regulation.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Parallel Randomized Tucker Decomposition Algorithms

The Tucker tensor decomposition is a natural extension of the singular value decomposition (SVD) to multiway data. Here, we propose to accelerate Tucker tensor decomposition algorithms by using randomization and parallelization. We present two algorithms that scale to large data and many processors, significantly reduce both computation and communication cost compared to previous deterministic and randomized approaches, and obtain nearly the same approximation errors. The key idea in our algorithms is to perform randomized sketches with Kronecker-structured random matrices, which reduces computation compared to unstructured matrices and can be implemented using a fundamental tensor computational kernel. We provide probabilistic error analysis of our algorithms and implement a new parallel algorithm for the structured randomized sketch. Our experimental results demonstrate that our combination of randomization and parallelization achieves accurate Tucker decompositions much faster than alternative approaches. We observe up to a 16X speedup over the fastest deterministic parallel implementation on 3D simulation data.

Tucker decompositions↗

DOE OSTI2025

Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems

Algorithms from Randomized Numerical Linear Algebra (RandNLA) are known to be effective in handling high-dimensional computational problems, providing high-quality empirical performance as well as strong probabilistic guarantees. However, their practical application is complicated by the fact that the user needs to set various algorithm-specific tuning parameters which are different from those used in traditional NLA. This paper demonstrates how a surrogate-based autotuning approach can be used to address fundamental problems of parameter selection in RandNLA algorithms. In particular, we provide a detailed investigation of surrogate-based autotuning for sketch-and-precondition (SAP)-based randomized least squares methods, which have been one of the great success stories in modern RandNLA. Empirical results show that our surrogate-based autotuning approach can achieve near-optimal performance with much less tuning cost than a random search (up to about 7.6x fewer trials of different parameter configurations). Moreover, while our experiments focus on least squares, our results demonstrate a general-purpose autotuning pipeline applicable to any kind of RandNLA algorithm.

Cho, Younghyun↗

DOE OSTI2026

Robust Optimal Experimental Design of Infinite-Dimensional Bayesian Nonlinear Inverse Problems

Abstract. We consider robust optimal experimental design (ROED) for nonlinear Bayesian inverse problems governed by partial differential equations (PDEs). An optimal design is one that maximizes some utility quantifying the quality of the solution of an inverse problem. However, the optimal design is dependent on elements of the inverse problem such as the simulation model, the prior, or the measurement error model. ROED aims to produce an optimal design that is aware of the additional uncertainties encoded in the inverse problem and remains optimal even after variations in them. We follow a worst-case scenario approach to develop a new framework for robust optimal design of nonlinear Bayesian inverse problems. The proposed framework (a) is scalable and designed for infinite-dimensional Bayesian nonlinear inverse problems constrained by PDEs; (b) develops efficient approximations of the utility, namely the expected information gain; (c) employs eigenvalue sensitivity techniques to develop analytical forms and efficient evaluation methods of the gradient of the utility with respect to the uncertainties against which we wish to be robust; and (d) employs a probabilistic optimization paradigm that properly defines and efficiently solves the resulting combinatorial max-min optimization problem. The effectiveness of the proposed approach is illustrated for optimal sensor placement problem in an inverse problem governed by an elliptic PDE.

Chowdhary, Abhijit↗

DOE OSTI2026

CAHS: Context-Aware Homology Search

Protein homology search is foundational to bioinformatics: it supports annotation transfer, structure/function inference, and evolutionary analysis over rapidly expanding sequence repositories (e.g., UniProtKB). Profile hidden Markov models (pHMMs), as implemented in HMMER, remain the most widely trusted approach because they provide statistically calibrated E-values; however, their gap behavior is fixed once a profile is trained, despite biological evidence that insertion/deletion tolerance varies across flexible loops and intrinsically disordered regions. We present CAHS (Context-Aware Homology Search), a lightweight query-time adapter for pHMM search that incorporates learned and biologically motivated signals without changing HMMER's downstream search pipeline or its calibrated E-value reporting. Given a query sequence, CAHS computes per-residue representations from a protein language model and a disorder predictor, maps these to profile coordinates, and modulates only match-state transition rows (gap-open and gap-extension probabilities) while preserving Plan7 constraints. We comprehensively evaluate CAHS across six structurally diverse protein families and multi-domain architectures against a 570k-sequence target corpus. CAHS expands detection capability, retrieving thousands of additional remote homologs at relaxed thresholds by maintaining alignment quality through flexible regions. For multi-domain proteins, context-aware modulation resolves 94% of fragmented alignments. Crucially, CAHS preserves hit-set invariance at stringent operating points (E<10-10), demonstrating increased statistical confidence without inflating false positives. Furthermore, sharper statistical distinction between homologs and background noise during early filter stages yields up to a 3.87× acceleration in end-to-end wall-clock time on high-performance computing clusters. Overall, CAHS illustrates a practical AI-for-science design pattern: augmenting a trusted probabilistic model with query-specific learned signals to improve interpretable, reproducible inference in data-rich biology.

Bhattaram, Swethasree [Georgia Institute of Techno↗

DOE OSTI2024

ComStock™ 2024 Release 1 [SWR-19-33 and SWR-20-32]

ComStock™ is an NREL model of the U.S. commercial building stock. The model takes some building characteristics from the U.S. Department of Energy's (DOE's) Commercial Prototype Building Models and Commercial Reference Building. However, unlike many other building stock models, ComStock also combines these with a variety of additional public- and private-sector data sets. Collectively, this information provides high-fidelity building stock representation with a realistic diversity of building characteristics. This repository contains the source code used to build and execute ComStock models, including upgrade scenarios. In addition, the sampling of buildings characteristics used for the initial ComStock (V1.0) release is provided. The ComStock model is under active calibration and development, which is publicly visible on this repository. Execution of the ComStock workflow is managed through the buildstockbatch repository, a shared asset of ResStock™ and ComStock™ , specifically developed to scale to execution of tens of millions of simulations through multiple infrastructure providers. The dataset output from the initial ComStock (V1.0) release can be found at the accompanying ComStock data viewer website and additional information about ComStock found on the NREL Buildings Website. For more details about ongoing model development please consult the End Use Load Profiles website. ComStock is a direct result of the NREL residential stock modeling tool ResStock™ (recipient of a R&D100 award) and was inspired by the high-fidelity solar & storage adoption model dGen™. Additionally, this tool would not be possible without the decades of work undertaken by the OpenStudio® and EnergyPlus® visionaries and contributors, significant funding, feedback and support from the Los Angeles Department of Water and Power, and the Department of Energy's Building Technology Office ongoing support of and investment in building energy modeling software. is an analytic methodology for modeling the energy usage of the commercial building stock within the United States of America. The commercial building stock is represented through a sampling of complex probabilistic distributions of various features of interest for modeling energy usage within commercial buildings. Each sample from these distributions is converted into a building energy model based on the features of that specific sample. Each building energy model can be simulated as is, but additional changes can be made to the model through addition of energy conservation measures, component faults, or other desired alterations. The results of the simulations are then processed to provide insights for various stakeholders, including but not limited to policy makers, engineers, and marketers.

Horsey, Henry↗

DOE OSTI2024

nrelWattileExt (SkySpark Wattile Extension) [SWR-24-73]

The NREL Wattile extension, nrelWattileExt, provides an interface between SkySpark, an energy management and analytics software, and Wattile, an NREL-developed Python package for probabilistic prediction of building energy consumption. Wattile models predict discrete quantiles of the probability distribution of a target quantity (typically energy consumption) using the historical time series data from one or more predictors (typically weather data). Within SkySpark, predictions from Wattile models can be used for measurement & verification of building performance, detection of energy anomalies, and fault detection. Related to: https://github.com/NREL/Wattile

Frank, Stephen↗

DOE OSTI2024

popclass

popclass is a lightweight python package that allows fast, probabilistic classification of the lens of a microlensing event given the event's posterior distribution and a model of the Galaxy. popclass provides the bridge between Galactic simulation and lens classification, an interface to common Bayesian inference libraries, and the ability for users to flexibly specify their own Galactic model and classification parameters.

Mcgill, Peter↗

DOE OSTI2025

arianna-ppl

A probabilistic programming language for python built on numpy

Lui, Arthur↗

DOE OSTI2025

KeNary

A Probabilistic Kernel-Based n-ary Classification Method for Sets of Observations

Stricklin, PhD, Madeline [Los Alamos National Labo↗

DOE OSTI2025

ciemss/pyciemss

Causal and probabilistic reasoning with continuous time dynamical systems

Witty, Sam [Sorbus AI]↗