Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “TIME”

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 OSTI2022

Fusion Fuel Cycle Inventory Reduction Studies Using a Processing-Time–Based Discrete-Time Interval Model

Developing a Fusion Pilot Plant (FPP) design that minimizes risks due to tritium in-process inventory (IPI) is an important concern for the operation of commercial devices. This becomes even more of concern since an FPP will be breeding more tritium than is burned in the reactor for sustainability. The IPI is the tritium moving through the system that is not in the storage and delivery subsystem. Here a process model that solves time-dependent differential equations based on processing times was used to investigate the reduction of the IPI of a potential fuel cycle design. The impact of new and more efficient technologies such as direct internal recycling (DIR), metal foil pumps, continuous pumping, improved isotope separation, and hydrogen separating continuous pumps on IPI was investigated by adjusting subsystem processing times and material flow streams. It was shown that any of the insertions of DIR studied in this paper caused a reduction in the total IPI of the system and proved to be the optimal way to reduce the IPI in the system. Fuel cycle modifications near the torus, such as a coupled DIR and improved pumping systems, produced the largest reductions in tritium inventory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Deterministic Linear Time for Maximal Poisson‐Disk Sampling using Chocks without Rejection or Approximation

Abstract We show how to sample uniformly within the three‐sided region bounded by a circle, a radial ray, and a tangent, called a “chock.” By dividing a 2D planar rectangle into a background grid, and subtracting Poisson disks from grid squares, we are able to represent the available region for samples exactly using triangles and chocks. Uniform random samples are generated from chock areas precisely without rejection sampling. This provides the first implemented algorithm for precise maximal Poisson‐disk sampling in deterministic linear time. We prove O(n · M(b) log b), where n is the number of samples, b is the bits of numerical precision and M is the cost of multiplication. Prior methods have higher time complexity, take expected time, are non‐maximal, and/or are not Poisson‐disk distributions in the most precise mathematical sense. We fill this theoretical lacuna.

Mitchell, Scott A.↗
DOE OSTI2025

Space-Time Finite Element Tensor Network Approach for the Time-Dependent Convection–Diffusion–Reaction Equation with Variable Coefficients

In this paper, we present a new space-time Galerkin-like method, where we treat the discretization of spatial and temporal domains simultaneously. This method utilizes a mixed formulation of the tensor-train (TT) and quantized tensor-train (QTT) (please see Section Tensor-Train Decomposition), designed for the finite element discretization (Q1-FEM) of the time-dependent convection–diffusion–reaction (CDR) equation. We reformulate the assembly process of the finite element discretized CDR to enhance its compatibility with tensor operations and introduce a low-rank tensor structure for the finite element operators. Recognizing the banded structure inherent in the finite element framework’s discrete operators, we further exploit the QTT format of the CDR to achieve greater speed and compression. Additionally, we present a comprehensive approach for integrating variable coefficients of CDR into the global discrete operators within the TT/QTT framework. The effectiveness of the proposed method, in terms of memory efficiency and computational complexity, is demonstrated through a series of numerical experiments, including a semi-linear example.

convection–diffusion–reaction equation↗
DOE OSTI2023

Tree-level Unitarity in $$ \textrm{SU}{(2)}_L\times \textrm{U}{(1)}_Y\times \textrm{U}{(1)}_{Y^{\prime }} $$ Models

Abstract In models with a U(1) gauge extension beyond the Standard Model, one can derive sum rules for the couplings of the theory that are a consequence of tree-level unitarity. In this paper, we provide a comprehensive list of coupling sum rules for a general$$ \textrm{SU}{(2)}_L\times \textrm{U}{(1)}_Y\times \textrm{U}{(1)}_{Y^{\prime }} $$ SU 2 L × U 1 Y × U 1 Y ′ gauge theory coupled to an arbitrary set of fermion and scalar multiplets. These results are of particular interest for models of dark matter that employ an extended gauge sector mediated by a new (dark)Z ′ gauge boson. For the case of a minimal extension of the Standard Model with a$$ \textrm{U}{(1)}_{Y^{\prime }} $$ U 1 Y ′ gauge boson, we clarify the definitions of the weak mixing angle and the electroweakρparameter. We demonstrate the utility of a generalizedρparameter (denoted byρ ′ ) whose definition naturally follows from the unitarity sum rules developed in this paper.

Physics↗
DOE OSTI2025

Physics-informed latent neural operator for real-time predictions of time-dependent parametric PDEs

Deep operator network (DeepONet) has shown significant promise as surrogate models for systems governed by partial differential equations (PDEs), enabling accurate mappings between infinite-dimensional function spaces. However, when applied to systems with high-dimensional input-output mappings arising from large numbers of spatial and temporal collocation points, these models often require heavily overparameterized networks, leading to long training times. Latent DeepONet addresses some of these challenges by introducing a two-step approach: first learning a reduced latent space using a separate model, followed by operator learning within this latent space. While efficient, this method is inherently data-driven and lacks mechanisms for incorporating physical laws, limiting its robustness and generalizability in data-scarce settings. Here, in this work, we propose PI-Latent-NO, a physics-informed latent neural operator framework that integrates governing physics directly into the learning process. Our architecture features two coupled DeepONets trained end-to-end: a Latent-DeepONet that learns a low-dimensional representation of the solution, and a Reconstruction-DeepONet that maps this latent representation back to the physical space. By embedding PDE constraints into the training via automatic differentiation, our method eliminates the need for labeled training data and ensures physics-consistent predictions. The proposed framework is both memory and compute-efficient, exhibiting near-constant scaling with problem size and demonstrating significant speedups over traditional physics-informed operator models. We validate our approach on a range of parametric PDEs, showcasing its accuracy, scalability, and suitability for real-time prediction in complex physical systems.

Latent representations↗
DOE OSTI2024

Overview of the distributed image processing infrastructure to produce the Legacy Survey of Space and Time

The Vera C. Rubin Observatory is preparing to execute the most ambitious astronomical survey ever attempted, the Legacy Survey of Space and Time (LSST). Currently the final phase of construction is under way in the Chilean Andes, with the Observatory’s ten-year science mission scheduled to begin in 2025. Rubin’s 8.4-meter telescope will nightly scan the southern hemisphere collecting imagery in the wavelength range 320–1050 nm covering the entire observable sky every 4 nights using a 3.2 gigapixel camera, the largest imaging device ever built for astronomy. Automated detection and classification of celestial objects will be performed by sophisticated algorithms on high-resolution images to progressively produce an astronomical catalog eventually composed of 20 billion galaxies and 17 billion stars and their associated physical properties. In this article we present an overview of the system currently being constructed to perform data distribution as well as the annual campaigns which reprocess the entire image dataset collected since the beginning of the survey. These processing campaigns will utilize computing and storage resources provided by three Rubin data facilities (one in the US and two in Europe). Each year a Data Release will be produced and disseminated to science collaborations for use in studies comprising four main science pillars: probing dark matter and dark energy, taking inventory of solar system objects, exploring the transient optical sky and mapping the Milky Way. Also presented is the method by which we leverage some of the common tools and best practices used for management of large-scale distributed data processing projects in the high energy physics and astronomy communities. We also demonstrate how these tools and practices are utilized within the Rubin project in order to overcome the specific challenges faced by the Observatory.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Time-of-flight vs time-of-arrival in neutron spectroscopic measurements for high energy density plasmas

The neutron time-of-flight (nToF) diagnostic technique has a lengthy history in Inertial Confinement Fusion (ICF) and High Energy Density (HED) Science experiments. Its initial utility resulted from the simple relationship between the full width half maximum of the fusion peak signal in a distant detector and the burn averaged conditions of an ideal plasma producing the flux [Lehner and Pohl, Z. Phys. 207, 83–104 (1967)]. More recent precision measurements [Gatu-Johnson et al., Phys. Rev. E 94(8), 021202 (2016)] and theoretical studies [Munro, Nucl. Fusion 56, 035001 (2016)] have shown the spectrum to be more subtle and complicated, driving the desire for an absolute calibration of the spectrum to disambiguate plasma dynamics from the conditions producing thermonuclear reactions. In experiments where the neutron production history is not well measured, but the neutron signal is preceded by a concomitant flux of photons, the spectrum can be in situ calibrated using a set of collinear detectors to obtain a true “time-of-flight” measurement. This article presents the motivation and overview of this technique along with estimates of the experimental precision needed to make useful measurements in existing and future nToF systems such as the pulsed power Z-machine located in Albuquerque, NM, at Sandia National Laboratories.

Fusion experiments↗
DOE OSTI2024

Adaptive time stepping for the two-time integro-differential Kadanoff-Baym equations

The nonequilibrium Green's function gives access to one-body observables for quantum systems. Of particular interest are quantities such as density, currents, and absorption spectra which are important for interpreting experimental results in quantum transport and spectroscopy. We present an integration scheme for the Green's function's equations of motion, the Kadanoff-Baym equations (KBE), which is both adaptive in the time integrator step size and method order as well as the history integration order. We analyze the importance of solving the KBE self-consistently and show that adapting the order of history integral evaluation is important for obtaining accurate results. To examine the efficiency of our method, we compare runtimes to a state-of-the-art fixed time step integrator for several test systems and show an order of magnitude speedup at similar levels of accuracy. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Early time solution as an alternative to the late time evolving dark energy with DESI DR2 BAO

Recently the Dark Energy Spectroscopic Instrument (DESI) provided constraints on the expansion history from their Data Release 2. The DESI baryon acoustic oscillation measurements are well described by a flat Λ CDM model, but the preferred parameters are in mild ( 2.3 σ ) tension with those determined from the cosmic microwave background. The DESI Collaboration has already explored a variety of solutions to this tension relying on variations in the late-time evolution of dark energy. Here we test an alternative—the introduction of an “early dark energy” (EDE) component. We find that EDE models can alleviate the tension, though they lead to differences in other cosmological parameters that have observational implications. Particularly the EDE models that fit the acoustic datasets prefer lower Ω m , higher H 0 , n s and σ 8 in contrast to the late-time solutions. Finally, we discuss the current status and near-future prospects for distinguishing amongst these solutions.

Baryon acoustic oscillations↗
DOE OSTI2023

Real-Time Model-Adaptive Relaying Applied to Microgrid Protection

In microgrids, the short-circuit current magnitude is significantly limited by more than an order of magnitude due to the relatively small inverter-based resources. Commercially available protective devices for distribution cannot reliably protect a microgrid due to their dependence on the magnitude of the fault current. Moreover, overcurrent relays typically cannot function properly for a microgrid because they are incapable of detecting faults and/or performing the coordination between the relays in inverter-based microgrids operated in the islanded mode. This paper proposes a model-adaptive relay designed to adjust the relay curves based on the available generation and the network topology. The proposed method runs a real-time model of the microgrid, which gathers information from the network to calculate the available short-circuit current in the specified node. The fault current from the model is then used for the adaptive algorithm to calculate the relay settings, considering coordination with the downstream fuses and upstream reclosers. This work presents the validation of the proposed method in Hardware-in-the-Loop, in a hardware testbed as well as field deployed in a real microgrid in East-Tennessee.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

JACC: Leveraging HPC Meta-Programming and Performance Portability with the Just-in-Time and LLVM-based Julia Language

We present JACC (Julia for Accelerators), the first high-level, and performance-portable model for the just-in-time and LLVM-based Julia language. JACC provides a unified and lightweight front end across different back ends available in Julia, enabling the same Julia code to run efficiently on many HPC CPU and GPU targets. We evaluated the performance of JACC for common HPC kernels as well as for the most computationally demanding kernels used in applications, HPCCG, a supercomputing benchmark test for sparse domains, and HARVEY, a blood flow simulator to assist in the diagnosis and treatment of patients suffering from vascular diseases. We carried out the performance analysis on the most advanced US DOE supercomputers: Aurora, Frontier, and Perlmutter. Overall, we show that JACC has a negligible overhead versus vendor-specific solutions, reporting GPU speedups with no extra cost to programmability.

Valero-Lara, Pedro↗
DOE OSTI2024

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. Here, we establish communication lower bounds that determine how much data movement is required (under mild conditions) to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that, with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations when the input and output tensors vary greatly in size.

HBL-inequalities↗
DOE OSTI2026

Trapped-ion Quantum Network Real-time Control Software (QuantNet Real-time Control) v0.1.0

This real-time control software for the QUANT-NET testbed is built upon the ARTIQ (Advanced Real-Time Infrastructure for Quantum physics) ecosystem. A central contribution of this work is the software's modular and reusable architecture, which facilitates the creation of hierarchical experimental control sequences by combining precomposed sequences and subsequences as building blocks within the framework.

Cheah, You-Wei [Lawrence Berkeley National Laborat↗
DOE OSTI2023

Data-driven time-scale separation of ODE right-hand sides using dynamic mode decomposition and time delay embedding

Multi-physics simulation often involves multiple different scales. The ARKODE ODE solver package in the SUNDIALS library addresses multi-scale problems with a multi-rate time-integrator that can work with a right-hand side that has fast scale and slow scale components. In this report, we use dynamic mode decomposition and time delay embedding to extract the fast and slow components of the right-hand sides of a simple ODE from data. We then use the extracted components to solve the ODE with ARKODE. Finally, to move towards a real-world use case, we attempt to extract fast and slow scale dynamics from synthetic seismic modeling data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Evaluation of LLM-Generated Kokkos Code Using Compile-Time and Run-Time Testing

Due to the growing use of large language models (LLMs) by developers and researchers, it has become essential to reliably evaluate their ability to generate code that uses specialized libraries. We explore the use of compile-time and run-time evaluation of LLM-generated Kokkos code through extending the methods used by OpenAI with the HumanEval dataset. Our evaluation framework is based on the first 40 prompts from the Kokkos138 dataset. We start by discussing two different forms of LLM prompting, using entirely plain English or providing pseudocode for added context. These two methods are used to generate Kokkos code with the Llama-3.1-8B-Instruct and CodeQwen1.5-7B-Chat models. We found that both forms of prompting led to high failure rates and difficulties with reliably parsing LLM-generated code, while prompts with pseudocode for context generally led to improved results on more complicated tests.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

The Perils of AI-Assisted Time Conversion Critical Errors in J2000 Time to UNIX/UTC Conversions Using AI Assistants (Technical Memorandum)

This memo addresses a critical issue encountered when using AI assistants for time system conversions, specifically converting data tagged with J2000 seconds through UNIX time to UTC. Initial AI responses to this common conversion task were fundamentally incorrect, with errors exceeding 37 seconds - enough to cause significant issues in many applications. This document demonstrates the problem, quantifies the error, and provides best practices for using AI tools safely in technical work. Both Claude 4.5 Sonnet and ChatGPT GPT-5.5 Thinking gave the same answer.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗