SEARCH · Engineering Papers
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.
This is a multi-language auto differentiation package. It includes multiple language versions of the package. It can be included/used as a module/class in users' application program to enable differentiability of the program. It is simple, transparent, extensible, efficient compared with the other AD package such as Enzyme or Pytorch.
As the design complexity of modern accelerators grows, there is more interest in using advanced simulations that have fast execution time or produce insights about accelerator state. One notable example of additional information are gradients of physical observables with respect to design parameters produced by differentiable simulations. The IOTA/FAST facility has recently begun a program to implement and experimentally validate a unified start-to-end differentiable digital twin to serve as a virtual accelerator test stand, allowing for rapid prototyping of new software and experiments with minimal beam time costs. In this contribution we will discuss our plans and progress. Specifically, we will cover the selection and benchmarking of both physics and ML codes, the development of generic interfaces between device models and surrogate or physics-based sections, and the export of the parameters through either a deterministic event loop or a fully asynchronous EPICS soft input/output controller. We will also discuss challenges in model calibration and uncertainty quantification, as well as future plans to support larger proton accelerators like PIPII and Booster.
The Earth’s subsurface is a key resource that provides energy via fossil fuels and geothermal sources, stores drinking water, and is used in the fight against climate change via carbon sequestration. Simulating the physical processes that occur in the Earth’s subsurface with computers enables better use of this resource. DPFEHM is a Julia package that includes computer models with a focus on the Earth’s subsurface, especially fluid flow, which is critical for the aforementioned applications. DPFEHM is able to solve the groundwater flow equations (single phase flow), Richards equation (air/water), the advection-dispersion equation, and the 2d wave equation. One of the key features of DPFEHM is that it supports automatic differentiation, so it can be integrated into machine learning workflows using frameworks such as Flux or PyTorch. The automatic differentiation capabilities give it the same performance as adjoint methods.
Modern network devices collect a large amount of data that can be analyzed to identify bottlenecks, anomalies, cyber-attacks, etc. Therefore, there is often a need to analyze such collections of network data quite often by an external expert or by the research community. However, these collections of data contain sensitive, proprietary information. In order for the network data to be shared, it must first be anonymized. The overall objective of this project is to develop an innovative privacy management tool to anonymize network data and achieve sufficient privacy, acceptable data utility, and efficient data analysis at the same time. No existing anonymization methods can achieve all of these at the same time. The core of this technology is a differential private clustering algorithm that provides strong privacy protection, preserves data properties important for subsequent analysis, and allows the party receiving the anonymized data to conduct analysis directly on anonymized data without the need of decryption or any extra processing. The research carried out was to design, implement and verify a solution to this problem by completing the following tasks: 1) developing the core technology; 2) developing a context based method that automatically recommends fields that must be anonymized; 3) conducted experiments showing superior results using our approach compared to existing tools, and 4) developed an intuitive but basic user interface. The research that was conducted generated novel algorithmic techniques that utilize state-of-the-art methods such as condensation, differential privacy preservation, clustering, automated tuning based on contextual awareness, and recommendation techniques to specify columns to users for anonymization leading to optimal privacy that allows research analysis on the dataset. Experiments were conducted to evaluate the efficacy of these novel algorithmic techniques by performing analysis on original non-anonymized datasets, then conducting analysis on the same yet anonymized datasets and comparing the results of the analyses. Overall, the anonymized analysis results were within 1% of the original results, verifying that the generated technology not only guarantees a high level of privacy but also enables research analysis as if it were conducted on the original dataset. Potential applications of this technology include anonymization of any type of structured network datasets that contain sensitive identifiers, such as IP addresses, that can be used in multiple applications. For example, to create an AI or machine learning model for cyber security, e.g., to detect attacks, or for performance analysis, e.g., identify bottlenecks or predict performance. In addition, a market analysis that was conducted for potential applications of this technology identified a broader range of applications of our anonymization technology beyond the network sector that includes healthcare, banking, insurance, securities, finance (FISB), data brokering, cloud services, ad sales, and government.
This presentation begins with the motivation for performing 181 Ta and 19 F high energy quasi-differential and neutron emission measurements. It then provides a discussion of significant pulse digitization upgrade. The Quasi-Differential methodology and importance for validating nuclear data are provided. Preliminary results from 181 Ta and 19 F are displayed. The presentation concludes with a discussion and future studies.
Neutrino physics experiments rely on accurate nuclear-interaction models that are in part guided by experimental observations. Multi-differential cross section measurements are particularly valuable for exploring the underlying physics described in these models, making them a significant step forward in the field. This note presents methodology in preparation to unfold neutrino flux-averaged double and triple-differential cross sections of the inclusive muon neutrino charged-current interaction on Argon. This work builds upon the existing framework and methodology presented in recent energy dependent cross section measurements at MicroBooNE using the Wire-Cell tomographic event reconstruction. The signal definition, choice of binning, and handling of estimated detector uncertainties are discussed, and the MicroBooNE simulation model is validated over the multi-dimensional phase space of muon momentum, muon polar angle, and visible hadronic energy.
We report the first measurement of the differential cross section $d^2σ(E_ν)/dcos(θ_µ)dP_µ$for inclusive muon neutrino charged-current scattering on argon. This measurement utilizes data from6.5×10 20 protons on target of exposure collected using the MicroBooNE liquid argon time projection chamber located on-axis in the Fermilab Booster Neutrino Beam with a mean neutrino energy of approximately 0.8 GeV. In this note, the mapping from reconstructed kinematics to truth quantities, particularly from reconstructed to true neutrino energy, is validated by comparing the distribution of reconstructed hadronic energy in data to that of the model prediction in different muon scattering angle bins after conditional constraint from the muon momentum distribution in data. The success of this validation gives confidence that the missing energy in the MicroBooNE detector is well-modeled within its uncertainties in simulation, enabling the unfolding to an energy-dependent triple-differential measurement over muon momentum, muon scattering angle, and neutrino energy. The unfolded measurement covers an extensive phase space, providing a wealth of information useful for future LArTPC experiments measuring neutrino oscillations. Comparisons with model predictions show the best agreement with Neut 5.4.0.1 at low energy, and with NuWro 19.02.01 at higher energies, particularly at forward muon scattering angles.
A comprehensive international effort has been underway to elucidate the properties and behaviors of neutrinos. A major source of systematic uncertainties in studying neutrino-induced interactions comes from neutrino-nucleus cross-section models, highlighting the need for more precise statistical measurements. MINERvA, an on-axis neutrino-nucleus scattering experiment located at the Fermi National Accelerator Laboratory, was established to produce neutrino cross-section measurements with many different nuclei. The helium target is the lightest nucleus to be measured by MINERvA. Using the NuMI medium energy muon neutrino data set, we present preliminary results and summarize the extraction of the charged current (CC) muon neutrino - helium-4 semi-inclusive ($\nu_{\mu}$+$^{4}\textrm{He}$$\rightarrow$$\mu^{-}$+N$\pi$+M$\textit{p}$) multi-differential cross-section extraction as a function of transverse ($P_{T}$) and longitudinal ($P_{L}$) muon momentum with respect to the neutrino beamline. We define the final state topology as CC-N$\pi$M$\textit{p}$, with at least two reconstructed tracks: a muon and a combination of N protons and M pions, where $N + M > 0$. To probe the dependence on the size of the nucleus in neutrino-induced interaction phenomena we present a differential cross-section ratio of helium-4 to MINERvA's hydrocarbon target (\textrm{CH}) as a function of transverse muon momentum.
We develop a novel synergistic approach between model reduction and machine learning. The specific goal of this project is to aid in the construction of reduced order models for basis functions that are custom-made to represent the solution of partial differential equations. Partial differential equations (PDEs) are one of the main mathematical tools for describing physical phenomena. However, due to either efficiency or necessity, for many real-world problems, we are interested in constructing reduced order models (ROMs) which focus only on the explicit computation of subsets of the active spatio-temporal scales in the problem, while treating the interaction with the rest of the scales approximately. The task of accurate representation of such interactions (usually called memory terms) constitutes a vast area of research known as model reduction. PI Stinis has significant expertise in the construction of ROMs for complex systems. In addition, in recent work with the project key participant Qadeer, they have utilized machine learning to acquire custom-made basis functions (CBFs) to expand the solutions of PDEs. In the proposed work, we will merge the two concepts by constructing ROMs for subsets of the CBFs needed to represent the solution of a PDE. Specifically, we will use the Mori-Zwanzig model reduction formalism to construct ROMs for subsets of CBFs for nonlinear PDEs of various complexity, as well as investigate the usage of CBFs in the spectral vanishing viscosity method for problems that can form shocks in finite time. The outcome of the research is aimed to be proof-of-concept about a novel synergistic approach between model reduction and machine learning, thus advancing the field of scientific machine learning. Such a capability will benefit the efficient modeling of physical systems appearing in various areas of interest to the DOE.
This report demonstrates universal differential equations (UDEs) as an approach to bridge the gap between ordinary differential equations (ODE) models and agent-based models (ABMs). Using UDE models as surrogates for ABMs allows us to preserve the foundational ODE that represents global disease dynamics while coupling it with a neural network model to approximate functions for the local behaviors of the ABM.
Differential equations (DEs) serve as fundamental tools in mathematical modeling across scientific disciplines, yet classical numerical solvers face limitations with large-scale or computationally intensive problems. This study explores a quantum-inspired approach to solving DEs, combining quantum- inspired techniques with classical methods. It focuses on fixed- point arithmetic on quantum circuits, utilizing basic quantum gates to manipulate DE solutions. We expand upon the techniques introduced by Zanger et al. [Quantum, 5, 502 (2021)] by offering a precise computation for a fixed-point signed multiplication scheme, while also presenting a quantum circuit capable of executing the fixed-point division algorithm. We demonstrate the feasibility of our approach through the simulation of a linear Ordinary Differential Equation (ODE), where initial conditions and parameters are encoded into quantum circuits using fixed- point representation. By executing sequences of quantum gates mimicking numerical integration steps, we obtain approximate solutions to the ODE with specified fixed-point precision.
Enabling the computation of partial derivatives or sensitivities in production hydrocodes is beneficial for design, optimization, sensitivity analysis, and uncertainty quantification. Traditional finite difference approximations of these sensitivities are inefficient since convergence studies of the step size is required for each parameter of interest. For these reasons, HYPercomplex Automatic Differentiation (HYPAD) was implemented in the Eulerian hydrocode PAGOSA. HYPAD is analogous to forward-mode automatic differentiation except hypercomplex numbers (numbers with multiple imaginary parts) are used instead of dual numbers. Accurate partial derivatives can be computed of all state variables with respect to multiple input variables in a single run. The method was implemented using operator overloading to handle hypercomplex algebra. HYPAD was demonstrated and verified on Sod’s shock tube problem to compute derivatives of the state variables with respect to a material parameter, initial conditions, and geometry.
We introduce the Poisson tensor completion (PTC) estimator, a non-parametric differential entropy estimator. The PTC estimator leverages inter-sample relationships to compute a low-rank Poisson tensor decomposition of the frequency histogram. Our crucial observation is that the histogram bins are an instance of a space partitioning of counts and thus can be identified with a spatial Poisson process. The Poisson tensor decomposition leads to a completion of the intensity measure over all bins—including those containing few to no samples—and leads to our proposed PTC differential entropy estimator. A Poisson tensor decomposition models the underlying distribution of the count data and guarantees non-negative estimated values and so can be safely used directly in entropy estimation. Our estimator is the first tensor-based estimator that exploits the underlying spatial Poisson process related to the histogram explicitly when estimating the probability density with low-rank tensor decompositions for the purpose of tensor completion. Furthermore, we demonstrate that our PTC estimator is a substantial improvement over standard histogram-based estimators for sub-Gaussian probability distributions because of the concentration of norm phenomenon.
he project PARADIGM (PARallel Approach of Differential and InteGral Measurements) answers this question by selecting via machine learning (ML) an optimal combination of differential and integral experiments to reduce 239 Pu nuclear data uncertainties from 1-600 keV by 50%..
Operating particle accelerators involves optimizing multiple goals simultaneously, which can be challenging due to trade-offs among objectives. While evolutionary algorithms like the genetic algorithm (GA) have been used for various Multi-Objective Optimization (MOO) tasks, they are not inherently suited for complex control problems. This talk highlights two variations of Reinforcement Learning (RL) for concurrently optimizing heat load and trip rates at the Continuous Electron Beam Accelerator Facility (CEBAF). The problem involves strict constraints on individual states, actions, and overall energy requirements of the beam. First, this talk highlights how differentiability can be harnessed through a Deep Differentiable Reinforcement Learning (DDRL) approach to address MOO issues within particle accelerators. We examine the DDRL method alongside Model Free Reinforcement Learning (MFRL), GA, and Bayesian Optimization (BO). The performance of these methods is assessed by generating a Pareto-front for two objectives. Our findings indicate that DDRL excels in handling high-dimensional problems more effectively than MFRL, BO, and GA. Next, we will show integration of explainable physics-based constraints into RL algorithms to enhance trans- parency and trust in decision-making processes by enabling users to verify that agents adhere to established physical principles. This surrogate function can be modeled using neural networks or sparse dictionary mod- els. By examining the mathematical form of the learned constraint function, we are able to confirm the agent has learned to use the established physics of each environment provided but the surrogate model. In addi- tion, we find that the introduction of a mathematical functional dictionary based surrogate model enables our reinforcement learning algorithms to reliably converge for difficult high-dimensional accelerator controls environments.
Resonant neutrino–nucleus processes constitute a significant portion of neutrino interactions in the few-GeV energy region. Charged-current interactions with a muon and one single charged pion in the final state (CC1$\pi$) are primarily sensitive to resonant processes, while also receiving contributions from non-resonant processes and being strongly affected by nuclear effects and final-state interactions. A precise understanding of this channel is essential for improving neutrino interaction models and reducing systematic uncertainties in oscillation measurements. The Short-Baseline Near Detector (SBND) at Fermilab has collected the largest neutrino–argon dataset to date, providing an excellent opportunity to study CC1$\pi$ interactions on argon. This analysis aims to improve existing single-differential cross-section measurements by reporting results in a variety of kinematic variables and to perform the first double-differential CC1$\pi$ cross-section measurement on argon, using novel techniques for pion energy reconstruction.
We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In [1], a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices. The algorithm here is also exponentially faster than the bounds derived in [1] for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in [2]). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by [3], but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas [2] and [3] additionally require normality.
Pathogens that infect more than one host offer an opportunity to study how resistance mechanisms have evolved across different species. Exserohilum turcicum infects both maize and sorghum and the isolates are host-specific, offering a unique system to examine both compatible and incompatible interactions. We conducted transcriptional analysis of maize and sorghum in response to maize-specific and sorghum-specific E. turcicum isolates and identified functionally related co-expressed modules. Maize had a more robust transcriptional response than sorghum. E. turcicum responsive genes were enriched in core orthologs in both crops, but only up to 16% of core orthologs showed conserved expression patterns. Most changes in gene expression for the core orthologs, including hub genes, were lineage specific, suggesting a role for regulatory divergent evolution. We identified several defense-related shared differentially expressed (DE) orthologs with conserved expression patterns between the two crops, suggesting a role for parallel evolution of those genes in both crops. Many of the differentially expressed genes (DEGs) during the incompatible interaction were related to quantitative disease resistance (QDR). This work offers insights into how different hosts with relatively recent divergence interact with a common pathogen. Our results are important for developing resistance to this critical pathogen and understanding the evolution of host-pathogen interactions.