Search NASA⌕ Search

SEARCH · Search NASA

Results for “deterministic”

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

Suppressing proximity effects during rapid serial two-photon lithography through tuning of reaction–diffusion kinetics

The ability of two-photon lithography (TPL) to print deterministic nanoporous 3D structures is highly valuable for many applications. However, it is challenging to print such structures rapidly due to the proximity effects that cause closely spaced features to enlarge and merge. A key challenge is the limited understanding of the origins and spatiotemporal dynamics of the long-range proximity effects that extend beyond the optical focal spot. Here, we empirically investigate these proximity effects in serial TPL using custom-made acrylate-based photoresists. We demonstrate that the complex spatiotemporal dynamics of the proximity effects can be explained through the kinetics of the reaction–diffusion photopolymerization mechanisms that underlie the curing process. Specifically, we show that the proximity effects arise due to comparable timescales of reaction and diffusion of oxygen. Furthermore, we demonstrate that long-range proximity effects can be suppressed by introducing phenolic inhibitors, which reduce oxygen consumption through non-inhibiting side reactions and promote faster termination of curing reactions. These insights enabled improving the linewidths from >400 to 260 nm during printing of nanoporous 3D woodpiles at scanning speeds of 50 mm s −1 . Thus, the knowledge generated here can be applied to deterministically tune the proximity effects and enable rapid printing of high-resolution nanoporous 3D structures.

36 MATERIALS SCIENCE↗
DOE OSTI2025

A fluctuating hydrodynamics model for nanoscale surfactant-laden interfaces

A multispecies diffuse interface model is formulated in a fluctuating hydrodynamics framework for the purpose of simulating surfactant interfaces at the nanoscale. The model generalizes previous work to ternary mixtures, employing a Cahn-Hilliard free energy density combined with incompressible, isothermal fluctuating hydrodynamics where dissipative fluxes include both deterministic and stochastic terms. The intermolecular parameters in the free energy are chosen such that one species acts as a partially miscible surfactant. From Laplace pressure measurements, we show that in this model the surface tension decreases linearly with surfactant concentration, leading to Marangoni convection for interfaces with concentration gradients. In the capillary wave spectrum for interfaces with and without surfactant, we find that for the former, the spectrum deviates significantly from classical capillary wave theory, presumably due to Gibbs elasticity. In non-equilibrium simulations of the Rayleigh-Plateau instability, deterministic simulations showed that the surfactant delays pinching of a fluid cylinder into droplets. However, stochastic simulations indicate that thermal fluctuations disrupt the surfactant's stabilizing effect. Similarly, the spreading of a patch of surfactant, driven by Marangoni convection, was found to be partially suppressed by thermal fluctuations.

Capillary waves↗
DOE OSTI2025

First-of-a-Kind Risk-Informed Digital Twin for Operational Decision Making

A digital twin (DT) is a digital model or a collection of models of a physical entity. DTs in the nuclear arena can be used from plant design through decommissioning. Decisions are typically a priori or made offline. Risk-informed decision making is identifying what can go wrong, its frequency, and the consequences of its failure. Ideally risk-informed decision making reflects the current state of the plant and provides a decision in real time. Traditionally, probabilistic risk assessments (PRAs) evaluate the failures of safety systems, the risk of core damage, and the offsite dose as the consequence. However, this DT evaluates the decisions on the control side rather than the protection side. It uses the same risk methods to probabilistically inform the decision-making process but in a different way. Rather than evaluating the risk of core damage, this DT evaluates the likelihood of avoiding a trip set point while maintaining plant safety. Performance-based assessments are identified via its probabilistic evaluation of operational alternatives based on system status. Because the purpose of the control system is to maintain system variables within prescribed operating ranges, upsets or challenges that can exceed a trip set point resulting in a plant transient and a challenge to plant mitigating systems based on actual plant conditions, are evaluated to safely maintain the plant within the operating ranges. The probabilistic portion of the model is autonomously and automatically adjusted, and the metric of interest (i.e. likelihood of avoiding a trip set point) is recalculated. The digital representation of the physical system (i.e. the DT) performs a deterministic performance–based assessment of the probabilistically identified alternatives identified to validate the probabilistic assessment. A decision-making algorithm selects the appropriate option based on the probabilistic and deterministic assessments and transmits a control signal to a component(s) to initiate a corrective action or informs an operator of its decision.

digital twin↗
DOE OSTI2026

Offline Maximizing Minimally Invasive Proper Orthogonal Decomposition for Reduced-Order Modeling of S n Radiation Transport

Deterministic solutions to the Sn radiation transport equation can be computationally expensive to calculate. Reduced-order modeling enables efficient approximation of the full-order model (FOM) solution. We propose a novel method for constructing reduced-order models (ROMs) of the S n radiation transport equation, offline maximizing minimally invasive (OMMI) proper orthogonal decomposition (POD). POD uses the method of snapshots to create a reduced-order basis for constructing an ROM. Minimally invasive POD leverages the sweep infrastructure existing in deterministic transport codes to create a POD-based ROM, even when infeasible by traditional methods. Offline maximizing minimally invasive proper orthogonal decomposition (OMMI-POD) extends minimally invasive POD by performing sweeps offline, therefore maximizing the potential speedup. OMMI-POD does so by creating a library of reduced systems from a training set. This library of reduced systems is then interpolated to provide a rapid approximate solution of the S n radiation transport equation. The model is evaluated on a set of test problems, achieving a low error with a 466 times speedup over the FOM. Also presented is a study of the effect of sampling method on the performance of OMMI-POD, specifically comparing naive uniform sampling to the more accurate and computationally expensive greedy sampling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Spin–orbit torque in a three-fold-symmetric bilayer and its effect on magnetization dynamics

Field-free switching of perpendicular magnetization has previously been observed in an epitaxial L1 1 -ordered CoPt/CuPt bilayer and attributed to spin–orbit torque (SOT) arising from the crystallographic 3m point group of the interface. Using a first-principles nonequilibrium Green's function formalism combined with the Anderson disorder model, we calculate the angular dependence of the SOT in a CoPt/CuPt bilayer and find that the magnitude of the 3m SOT is about 20% of the conventional dampinglike SOT. We further study the magnetization dynamics in perpendicularly magnetized films in the presence of 3m SOT and Dzyaloshinskii–Moriya interaction, using the equations of motion for domain wall dynamics and micromagnetic simulations. For systems where strong interfacial DMI results in the Néel character of domain walls, we find that a very large current density is required to achieve deterministic switching, because reorientation of the magnetization inside the domain wall is necessary to induce the switching asymmetry. For thicker films with relatively weak interfacial DMI and the Bloch character of domain walls, deterministic switching is possible at much smaller current densities, which may explain the recent experimental findings.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Preparing angular momentum eigenstates using engineered quantum walks

Coupled angular-momentum eigenstates are widely used in atomic and nuclear physics calculations and are building blocks for spin networks and the Schur transform. To combine two angular momenta J 1 and J 2 , forming eigenstates of their total angular momentum J=J 1 +J 2 , we develop a quantum-walk scheme that does not require inputting O(j 3 ) nonzero Clebsch–Gordan (CG) coefficients classically. In fact, our scheme may be regarded as a unitary method for computing CG coefficients on quantum computers with a typical complexity of O⁡(j) and a worst-case complexity of O⁡(j 3 ). Equivalently, our scheme provides decompositions of the dense CG unitary into sparser unitary operations. Our scheme prepares angular-momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states, which are usually highly entangled states in the computational basis. In contrast with usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in su⁡(2)×su⁡(2), which are inspired by, but different from, Hamiltonians that govern magnetic resonances and dipole interactions. To achieve a deterministic preparation of both ket and bra states, we use projection and destructive interference to double pinch the quantum walks, such that each step is a unit-probability population transfer within a two-level system. We test our state preparation scheme on classical computers, reproducing tables of CG coefficients. Finally, we also implement small test problems on current quantum hardware.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Distributed Order Recording Techniques for Efficient Record-and-Replay of Multi-threaded Programs

After all these years and all these other shared memory programming frameworks, OpenMP is still the most popular one. However, its greater levels of non-deterministic execution makes debugging and testing more challenging. The ability to record and deterministically replay the program execution is key to address this challenge. However, scalably replaying OpenMP programs is still an unresolved problem. In this paper, we propose two novel techniques that use Distributed Clock (DC) and Distributed Epoch (DE) recording schemes to eliminate excessive thread synchronization for OpenMP record and replay. Our evaluation on representative HPC applications with ReOMP, which we used to realize DC and DE recording, shows that our approach is 2-5x more efficient than traditional approaches that synchronize on every shared-memory access. Furthermore, we demonstrate that our approach can be easily combined with MPI-level replay tools to replay non-trivial MPI+OpenMP applications. We achieve this by integrating ReOMP into ReMPI, an existing scalable MPI record-and-replay tool, with only a small MPI-scale-independent runtime overhead.

Fu, Xiang↗
DOE OSTI2024

Short-Term Load Forecasting Considering EV Charging Loads with Prediction Interval Evaluation

Short-term load forecasting plays a critical role in power system planning and operation. Along with the electrification of various loads, electricity demands are becoming increasingly hard to predict. Notably, the recent rise in electric vehicles (EVs) has further contributed to this unpredictability. To address this issue, this paper proposes a probabilistic load forecasting strategy utilizing Gaussian process regression, structured in a day-ahead manner. While many works focus on deterministic prediction, probabilistic forecasting offers additional insights into variability and uncertainty, enabling more flexible and reliable operation for power systems. To enhance the accuracy of the load forecasting model, the inputs include features related to EV charging habits as well as commonly used weather information. The load forecasting results are evaluated using various metrics, including conventional ones that assess the accuracy of point forecasts, as well as additional metrics that test the reliability of prediction intervals. The proposed load forecasting method is finally tested on real residential power consumption data and EV charging data sampled from real-world sources. The results prove that the new features can greatly improve the performance of the load forecasting method.

electrical vehicle↗
DOE OSTI2024

Short-Term Probabilistic Solar Forecasting via Reinforcement Learning over ECMWF

In this paper, we present an innovative reinforcement learning approach for short-term solar forecasting, leveraging data from the European Centre for Medium-Range Weather Forecasts (ECMWF). The methodology begins with the application of the System Advisor Model (SAM) to transform various ECMWF numerical weather prediction members into predictive photovoltaic power generation. To enhance the precision of deterministic forecasting, we introduce a dynamic model selection algorithm based on Q-learning. This algorithm dynamically identifies and utilizes the most accurate ensemble member for forecasting purposes. Furthermore, we employ a support vector regression surrogate model with a Gaussian distribution to generate probabilistic forecasts, providing a holistic view of solar energy generation uncertainty. To expedite the training process and make it more practical for real-world applications, we integrate a rolling update workflow. This innovative workflow reduces the training period from months to a mere 19 days, making our method highly efficient. Numerical results of the case study show that in comparison to benchmark models, the proposed method improves the deterministic and probabilistic solar forecasting accuracy by up to 40.84% and 48.42%, respectively.

ensemble forecasting↗
DOE OSTI2025

FAIR to WISE (F2W) v1.0.0

FAIR to WISE (F2W) is an iterative, large-language model (LLM) driven pipeline that turns unstructured research PDFs into structured, queryable knowledge graphs (KGs). Core features include schema-driven extraction to a LinkML model; full provenance capture; ontology-grounded enrichment (e.g., chemical validation and ChEBI lookup); graph construction to JSON-LD with stable IDs; and KG-RAG question answering with evidence-aware retrieval. The system is engineered for reproducibility and accessibility (open-source Ollama models, temperature=0, NVTX/Nsight profiling) with robust QA (relation verification, deduplication, and deterministic outputs). Primary uses are literature-to-KG automation, knowledge-grounded Q&A, and experimental steering support. We demonstrate the approach in organic photovoltaics, where the pipeline ingests papers, builds a domain KG, and evaluates answers against expert competency questions to guide experimental planning and interpretation. Compared with off-the-shelf LLMs and ad-hoc NLP tools, F2W addresses ontology gaps and reduces hallucination risk by grounding responses in extracted evidence and enforcing schema constraints; it also offers deterministic, provenance-linked outputs and open, cost-aware deployment. Evidence-aware ranking further improves answer quality over pure vector search.

Abramov, David [Lawrence Berkeley National Laborat↗
DOE OSTI2026

AstraAI v1

AstraAI is an open-source, structure-aware AI coding agent designed for large scientific and DOE-HPC codebases such as AMReX-based applications. Unlike general-purpose coding assistants, AstraAI combines retrieval-augmented generation (RAG) with compiler-level Abstract Syntax Tree (AST) analysis to perform precise, scope-constrained code modifications. It identifies exact function spans, enforces locality of edits, and maintains cross-file invariants, enabling deterministic and build-safe transformations in complex C++/GPU environments. AstraAI is intended for developers working on large, evolving HPC frameworks where correctness, reproducibility, and structural integrity are critical. Typical use cases include modifying physics kernels, updating GPU device lambdas, and performing multi-file refactors without breaking compilation or runtime semantics. Compared to conventional LLM-based coding agents - even those with repository access - AstraAI provides structural guarantees rather than free-form text patches. It minimizes unintended diffs, prevents scope drift, preserves formatting and build stability, and reduces structural hallucinations. By integrating compiler tooling directly into the generation loop, AstraAI transforms AI-assisted coding from probabilistic text editing into deterministic, structure-preserving program transformation suitable for mission-critical scientific software.

Natarajan, Mahesh [Lawrence Berkeley National Labo↗
DOE OSTI2026

CodeScribe Agent

SF-26-086 CodeScribe introduces a structured, multi-stage pipeline that combines deterministic program analysis with LLM-powered translation to enable incremental, testable Fortran-to-C++ migration. First, `code-scribe index` traverses the project directory tree and produces `scribe.yaml` metadata files recording all modules, subroutines, and functions at each level, giving the LLM accurate structural context instead of a hallucinated codebase model. Second, `code-scribe draft` performs the deterministic portion of translation — converting Fortran types to C++ equivalents, replacing `use` statements with `#include` and `using namespace` directives, and detecting constructs requiring special handling — while embedding`scribe-prompt` annotations that guide the LLM through non-trivial cases such as statement-function-to-lambda conversions and `extern "C"` wrapper generation. Third, `code-scribe translate` applies project-specific TOML-based few-shot prompt templates and submits the composed prompt to a pluggable LLM backend (OpenAI, Anthropic, Argonne ARGO, any OpenAI-compatible endpoint, or local Hugging Face checkpoints), producing a C++ source file, a header, and a Fortran-C++ interface file for each translated routine so the codebase compiles and runs correctly throughout the migration. Beyond translation, CodeScribe includes a tool-using coding agent (`code-scribe agent`) with read, bash, edit, and write capabilities, and a bounded loop mode (`code-scribe loop`) that runs repeated stateless agent sessions over a task file with restricted tool access — enabling sustained, auditable software development workflows for broader scientific computing tasks.

Dhruv, Akash [Argonne National Laboratory (ANL), A↗
DOE OSTI2025

APOLLO: a facility-scale differentiable virtual accelerator at Fermilab FAST/IOTA

As the design complexity of modern accelerators grows, there is more interest in using advanced simulations that have fast execution time or yield additional insights like gradients. The FAST/IOTA facility has been working on implementing and experimentally validating an end-to-end digital twin that is both fast and gradient-aware, allowing for rapid prototyping of new software and experiments with minimal beam time costs. Our framework integrates physics and ML codes for linac and ring simulation through a set of generic interfaces between surrogate and physics-based sections. To reproduce device inputs and outputs, system state is exposed as a deterministic event loop in a specialized discrete event simulator architecture. Because Fermilab is undergoing control system transition, several APIs were implemented as final user interfaces - a fully asynchronous EPICS soft IOC, a gRPC-based Data Pool Manager (DPM), and legacy ACNET protocols. We discuss implementation details as well as challenges handling live data assimilation and future plans to extend modelling to main complex proton accelerators like PIPII and Booster.

Kuklev, Nikita [Fermilab]↗
DOE OSTI1993

Nuclear Safety [Vol. 34, No. 1, January-March 1993]

Nuclear Safety is a review journal that covers significant developments in the field of nuclear safety. Its scope includes the analysis and control of hazards associated with nuclear energy, operations involving fissionable materials, and the products of nuclear fission and their effects on the environment. Primary emphasis is on safety in reactor design, construction, and operation; however, the safety aspects of the entire fuel cycle, including fuel fabrication, spent-fuel processing, nuclear waste disposal, handling of radioisotopes, and environmental effects of these operations, are also treated. Table of Contents for this issue follows. GENERAL SAFETY CONSIDERATIONS: 1 An Integrated Regional Approach To Risk Management of Industrial Systems, S. Chakraborty and R. Stratton; 9 Annual Technical Meeting of the NRC Cooperative Severe Accident Research Program, E. G. Silver; ACCIDENT ANALYSIS: 13 Deterministic Severe Accident Criteria as Severe Accident Design Criteria and Policy for the New Production Reactor-Heavy Water Reactor, P. T. Rhoads; 20 Proposed Deterministic Severe Accident Criteria for the Heavy Water Reactor-New Production Reactor Containment, K. D. Bergeron, S. E. Slezak, and C. E. Leach; 33 Quasi-Static Core Liquid Level Depression and Long-Term Core Uncovery During a PWR LOCA, Y. Kukita, R. R. Schultz, H. Nakamura, and J. Katayama; 49 LIRA: An Advanced Containment System to Minimize the Accidental Radioactivity Releases, A. Turricchia; 63 Errata to “A Review of Hydrogen Production During Melt/Water Interaction in LWRs,” Vol. 33, No. 4; CONTROL AND INSTRUMENTATION: 64 The Nuplex 80+™ Advanced Control Complex from ABB Combustion Engineering, F. Ridolfo, D. Harmon, and K. Scarola; DESIGN FEATURES: 76 A Scheme for Passive Isolation of the Containment of a Reactor, A. K. Ghosh, V. V. Raj, and K. Kakodkar; 84 Utility Requirements for Safety in the Passive Advanced Light-Water Reactor, T. U. Marston, W. H. Layman, and G. Bockhold, Jr.; WASTE AND SPENT FUEL MANAGEMENT: 91 Activities Related to Waste and Spent Fuel Management, Compiled by M. D. Muhlheim and E. G. Silver; OPERATING EXPERIENCES: 103 Testing Deficiencies in Auxiliary Systems Feedwater Systems, J. D. Kueck; 110 Reactor Shutdown Experience, Compiled by J. W. Cletcher; 113 Selected Safety-Related Events, Compiled by G. A. Murphy; 115 Operating U.S. Power Reactors, Compiled by M. D. Muhlheim and E. G. Silver; RECENT DEVELOPMENTS: 133 General Administrative Activities, Compiled by M. D. Muhlheim and E. G. Silver; 145 Reports, Standards, and Safety Guides, D. S. Queener; 150 Proposed Rule Changes as of Sept. 30, 1992; ANNOUNCEMENTS: 75 Harvard Short Course on Risk: Science, Assessment, and Management; 102 International Conference on Reactor Physics and Reactor Computations; 102 The Fourth International Conference on Nuclear Waste Reprocessing and Waste Management [RECOD ’94]; 132 International Symposium on the Radiological Exposure of the Population of the European Community from Radioactivity in the Mediterranean Sea [MARINA-MED]; 162 International High-Level Radioactive Waste Conference ‘Technology Integration—Above and Below”; 154 The Authors; 158 Indexes to Nuclear Safety, Volume 33.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Probabilistic data fusion and physics-informed machine learning: A new paradigm for modeling under uncertainty, and its application to accelerating the discovery of new materials

In this report we summarize the work conducted by PI Perdikaris and his group under this Early Career project DE–SC0019116 during the period of 09/01/2018 – 08/31/2023. The central aim of the work was to introduce a new paradigm for scientific data analysis that can seamlessly synthesize rigorous mathematical modeling with data of variable fidelity (e.g., measurements at multiple scales/resolutions or predictions of variable fidelity models) and multiple modalities (e.g., images, time–series, or scattered measurements). The setting we are interested in involves complex systems that are partially observed and whose dynamical behavior could be hard to model or totally unknown. The inherent uncertainty associated with this setting necessitates a departure from the classical deterministic realm of modeling and scientific computation, and, consequently, our main building blocks can no longer be crisp deterministic numbers and governing laws, but instead we must operate with probabilistic models.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Implications of Safety and Operational Features of Small, Advanced Reactors for the Evaluation of Important Human Actions

The design and operational characteristics of non-light water reactors are likely to change the role of human actions in safety function management and the types of human actions that are deemed important. The objectives of this report are to: • Identify the implications of small, advanced reactor design characteristics on human performance and the changing role of human actions in the management of safety functions. • Identify the methods that may be used to identify important human actions. • Identify how HFE safety reviewers can help ensure that the methods adequately model human actions to identify those that are important to safety. We identified the implications of small, advanced reactor characteristics on the role of personnel in safety function management. Then we addressed how designers can identify which human actions are important to safety using both probabilistic risk assessment (PRA) and deterministic analyses. PRA identifies important human actions using risk-importance criteria. Deterministically identified important human actions include those identified by analyses of situations such as transients and accidents and defense in depth. In all cases, the acceptability of the analyses is dependent on the modeling, quantification, and criterion selection to determine which human actions are important. How well the designers address these processes determines the acceptability of their methodology.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

A multigigabit link layer protocol for single picosecond latency determinism using AMD ultrascale+ GTH and GTY transreceivers

recision timing distribution systems require determin istic and repeatable high speed serial data link latency. The EIC Timing Data Link will employ a specialized link layer protocol for deterministic multigigabit communication us ing AMD Ultrascale+ GTH and GTY transceivers. Link la tency must also be measurable to accurately compensate in real time for latency variations of the physical medium. The point-to-point link is full duplex and fully synchronous with a latency control algorithm to align the internal clocks of each system with picosecond resolution. Deterministic clock domain crossing between systems is ensured using static timing analysis of the elastic buffer control signals.

43 PARTICLE ACCELERATORS↗
DOE OSTI2026

Temporal Coarse Graining for Classical Stochastic Noise in Quantum Systems

Simulations of quantum systems with Hamiltonian classical stochastic noise can be challenging when the noise exhibits temporal correlations over a multitude of time scales, such as for 1/f noise in solid-state quantum information processors. Here we present an approach for simulating Hamiltonian classical stochastic noise that performs temporal coarse-graining by effectively integrating out the high-frequency components of the noise. We focus on the case where the stochastic noise can be expressed as a sum of Ornstein-Uhlenbeck processes. Temporal coarse-graining is then achieved by conditioning the stochastic process on a coarse realization of the noise, expressing the conditioned stochastic process in terms of a sum of smooth, deterministic functions and bridge processes with boundaries fixed at zero, and performing the ensemble average over the bridge processes. For Ornstein-Uhlenbeck processes, the deterministic components capture all dependence on the coarse realization, and the stochastic bridge processes are not only independent but taken from the same distribution with correlators that can be expressed analytically, allowing the associated noise propagators to be precomputed once for all simulations. This combination of noise trajectories on a coarse time grid and ensemble averaging over bridge processes has practical advantages, such as a simple concatenation rule, that we highlight with numerical examples.

Albash, Tameem [Sandia National Lab. (SNL-NM), Alb↗