Search NASA⌕ Search

SEARCH · Search NASA

Results for “Neural network simulations”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Neural networks for atmospheric retrievals

We use neural networks to perform retrievals of temperature and water fractions from simulated clear air radiances for the Atmospheric Infrared Sounder (AIRS). Neural networks allow us to make effective use of the large AIRS channel set, and give good performance with noisy input. We retrieve surface temperature, air temperature at 64 distinct pressure levels, and water fractions at 50 distinct pressure levels. Using 728 temperature and surface sensitive channels, the RMS error for temperature retrievals with 0.2K input noise is 1.2K. Using 586 water and temperature sensitive channels, the mean error with 0.2K input noise is 16 percent. Our implementation of backpropagation training for neural networks on the 16,000-processor MasPar MP-1 runs at a rate of 90 million weight updates per second, and allows us to train large networks in a reasonable amount of time. Once trained, the network can be used to perform retrievals quickly on a workstation of moderate power.

Motteler, Howard E.↗
DOE OSTI2025

Search for Higgs boson decays into a Z boson and a light hadronically decaying resonance in pp collisions at s =13 TeV with the ATLAS detector

A search for decays of the Higgs boson into a Z boson and a light resonance, with a mass of 0.5–3.5 GeV, is performed using the full 140 fb−1 dataset of 13 TeV proton–proton collisions recorded by the ATLAS detector during LHC Run 2. Leptonic decays of the Z boson and hadronic decays of the light resonance are considered. The resonance can be interpreted as a J / ψ or η c meson, an axion-like particle, or a light pseudoscalar predicted in two-Higgs-doublet models. Due to its low mass, this resonance is produced with a high Lorentz boost in the laboratory frame and therefore reconstructed as a single small-radius jet of hadrons. A neural network is used to correct the Monte Carlo simulation of the total expected background using data from sideband regions. Two additional neural networks are used to distinguish signal from background, enhancing the purity of the signal region. A binned profile-likelihood fit is performed on the final-state invariant mass distribution. No significant excess of events relative to the expected background is observed, and upper limits at 95% confidence level are set on the Higgs boson's branching fraction to a Z boson and a light resonance. The exclusion limit is ∼10% for the lower masses, and increases for higher masses. Upper limits on the effective coupling C Z H eff / Λ of an axion-like particle to a Higgs boson and Z boson are also set at 95% confidence level, and range from 0.9 to 2 TeV−1.

Aad, G↗
DOE OSTI2025

Leveraging prior mean models for faster Bayesian optimization of particle accelerators

Tuning particle accelerators is a challenging and time-consuming task that can be automated and carried out efficiently using suitable optimization algorithms, such as model-based Bayesian optimization techniques. One of the major advantages of Bayesian algorithms is the ability to incorporate prior information about beam physics and historical behavior into the model used to make control decisions. In this work, we examine incorporating prior accelerator physics information into Bayesian optimization algorithms by utilizing fast executing, neural network models trained on simulated or historical datasets as prior mean functions in Gaussian process models. We show that in ideal cases, this technique substantially increases convergence speed to optimal solutions in high-dimensional tuning parameter spaces. Additionally, we demonstrate that even in non-ideal cases, where prior models of beam dynamics do not exactly match experimental conditions, the use of this technique can still enhance convergence speed. Finally, we demonstrate how these methods can be used to improve optimization in practical applications, such as transferring information gained from beam dynamics simulations to online control of the LCLS injector, and transferring knowledge gained from experimental measurements across different operating modes, such as accelerating different ion species at the ATLAS heavy ion accelerator.

43 PARTICLE ACCELERATORS↗
DOE OSTI2025

A physics-constrained deep learning treatment of runaway electron dynamics

An adjoint formulation leveraging a physics-informed neural network (PINN) is employed to advance the density moment of a runaway electron (RE) distribution forward in time. A distinguishing feature of this approach is that once the adjoint problem is solved, its solution can be used to project the RE density forward in time for an arbitrary initial momentum space distribution of REs. Furthermore, by employing a PINN, a parametric solution to the adjoint problem can be learned. Thus, once trained, this adjoint-deep learning framework is able to efficiently project the RE density forward in time across various plasma conditions while still including a fully kinetic description of RE dynamics. As an example application, the temporal evolution of the density of primary electrons is studied, with particular emphasis on evaluating the decay of a RE population when below threshold. Predictions from the adjoint-deep learning framework are found to be in good agreement with a traditional relativistic electron Fokker–Planck solver, for several distinct initial conditions, and across an array of physics parameters. Once trained, the PINN thus provides a means of generating RE density time histories with exceptionally low online execution time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

A Nonergodic Ground-Motion Model for the San Francisco Bay Area for Small-Magnitude Earthquakes

ABSTRACT Recently, generative models have become a computationally efficient alternative to physics-based numerical simulations of ground motions. Neural networks can learn from existing ground-motion data to generate unobserved ground-motion data at new source and site locations. A key challenge with generative models is ensuring that predicted ground motions remain within a physically realistic range. For this purpose, we developed an empirical, nonergodic ground-motion model (GMM) for small-magnitude earthquakes in the San Francisco Bay area based on about 5000 recordings per component for Mw ≤ 4 earthquakes. The nonergodic GMM predicts spatially varying median source, site, and path effects for both the Fourier amplitude spectrum (FAS) and the Fourier phase derivative (a proxy for duration), as well as the corresponding epistemic uncertainty for each term. For FAS, our model shows above-average source and site effects in the western part of the region and below-average effects in the eastern part, with regional effects exhibiting larger spatial correlation lengths with increasing frequency. For duration, the source term is negligible for small-magnitude earthquakes, and the site term leads to site-specific variations up to 5 s. Path effects for FAS and duration depend on the source–site pair and are extrapolated spatially using recent methods for path-effect modeling. The aleatory variability of the within-site within-path residuals is similar to the variability found in previous studies for other regions. The nonergodic model provides two key contributions: first, median adjustment terms that are transferable to larger magnitude earthquakes, further reducing aleatory variability in probabilistic seismic hazard analysis; second, region-specific criteria for validating machine learning-based ground-motion generators to evaluate whether synthetic ground motions exhibit physically realistic source, site, and path effects.

Lacour, Maxime↗
NASA NTRS1993

NETS

NETS development tool provides environment for simulation and development of neural networks - computer programs that "learn" from experience. Written in ANSI standard C, program allows user to generate C code for implementation of neural network.

Baffes, Paul T.↗
NASA NTRS1992

Inversion of snow parameters from passive microwave remote sensing measurements by a neural network trained with a multiple scattering model

Simultaneous inversion of the three parameters was performed which included mean-grain size of ice particles in snow, snow density, and snow temperatures from five brightness temperatures. Good results for the inversion of parameters were obtained using the neural network based on the simulated data computed from the dense media radiative transfer equation that takes into account the effects of multiple scattering.

Tsang, Leung↗
DOE OSTI2024

Neuromorphic intermediate representation: A unified instruction set for interoperable brain-inspired computing

Abstract Spiking neural networks and neuromorphic hardware platforms that simulate neuronal dynamics are getting wide attention and are being applied to many relevant problems using Machine Learning. Despite a well-established mathematical foundation for neural dynamics, there exists numerous software and hardware solutions and stacks whose variability makes it difficult to reproduce findings. Here, we establish a common reference frame for computations in digital neuromorphic systems, titled Neuromorphic Intermediate Representation (NIR). NIR defines a set of computational and composable model primitives as hybrid systems combining continuous-time dynamics and discrete events. By abstracting away assumptions around discretization and hardware constraints, NIR faithfully captures the computational model, while bridging differences between the evaluated implementation and the underlying mathematical formalism. NIR supports an unprecedented number of neuromorphic systems, which we demonstrate by reproducing three spiking neural network models of different complexity across 7 neuromorphic simulators and 4 digital hardware platforms. NIR decouples the development of neuromorphic hardware and software, enabling interoperability between platforms and improving accessibility to multiple neuromorphic technologies. We believe that NIR is a key next step in brain-inspired hardware-software co-evolution, enabling research towards the implementation of energy efficient computational principles of nervous systems. NIR is available atneuroir.org

Science & Technology - Other Topics↗
DOE OSTI2025

Correlated dynamic disorder, octahedral tilts, and acoustic phonon softening in CsSnBr 3 and CsPbBr 3

Metal halide perovskites (MHPs) have emerged as highly promising materials for optoelectronic applications, with all-inorganic MHPs presenting enhanced stability compared to their hybrid counterparts. Here, in this study, we investigate the atomic dynamics and structural fluctuations in single crystals of CsSnBr⁢ 3 and CsPbBr⁢ 3 through systematic inelastic neutron scattering (INS) measurements as a function of temperature. Our experiments are compared with first-principle simulations, augmented with large-scale molecular dynamics modeling, based on machine-learned neural network potentials. Through both INS and simulations, we find quasi-elastic diffuse rods in reciprocal space in both compounds, originating from fluctuating planar domains featuring correlated tilts of Br octahedron. The diffuse rods exhibit a slow, overdamped dynamic process, modulated across 𝑸 space, reflecting the strong lattice anharmonicity of the inorganic framework. We do not find evidence for dynamic off-centering of the Sn 2+ ions besides phonon vibrations at the center of the Br octahedron. These results offer valuable insights into the unusual anharmonic atomic dynamics and intricate correlated structural distortions in MHPs, which will be critical for rationalizing and further tailoring their thermal and optoelectronic properties.

36 MATERIALS SCIENCE↗
NASA NTRS1990

Learning and diagnosing faults using neural networks

Neural networks have been employed for learning fault behavior from rocket engine simulator parameters and for diagnosing faults on the basis of the learned behavior. Two problems in applying neural networks to learning and diagnosing faults are (1) the complexity of the sensor data to fault mapping to be modeled by the neural network, which implies difficult and lengthy training procedures; and (2) the lack of sufficient training data to adequately represent the very large number of different types of faults which might occur. Methods are derived and tested in an architecture which addresses these two problems. First, the sensor data to fault mapping is decomposed into three simpler mappings which perform sensor data compression, hypothesis generation, and sensor fusion. Efficient training is performed for each mapping separately. Secondly, the neural network which performs sensor fusion is structured to detect new unknown faults for which training examples were not presented during training. These methods were tested on a task of fault diagnosis by employing rocket engine simulator data. Results indicate that the decomposed neural network architecture can be trained efficiently, can identify faults for which it has been trained, and can detect the occurrence of faults for which it has not been trained.

Whitehead, Bruce A.↗
DOE OSTI2025

Score-Based Physics-Informed Neural Networks for High-Dimensional Fokker–Planck Equations

The Fokker-Planck (FP) equation is a foundational partial differential equation (PDE) in stochastic processes involving Brownian motions. However, the curse of dimensionality (CoD) poses a formidable challenge when dealing with high-dimensional FP equations. Although Monte Carlo simulation and (vanilla) Physics-Informed Neural Networks (PINNs) have shown the potential to tackle CoD, both methods exhibit significant numerical errors in high dimensions when dealing with the probability density function (PDF) associated with Brownian motion. The point-wise PDF values tend to decrease exponentially as dimensionality increases, surpassing the precision of numerical simulations and resulting in substantial errors. In addition, due to its massive sampling, Monte Carlo fails to offer fast sampling. Modeling the logarithm likelihood (LL) via vanilla PINNs transforms the FP equation into a notoriously difficult Hamilton-Jacobi-Bellman (HJB) equation, which is impractical for PINN learning, whose error grows rapidly with dimension. To this end, we propose a novel approach utilizing a score-based solver to fit the score function in stochastic differential equations (SDEs). The score function, defined as the gradient of the LL, plays a fundamental role in inferring LL and PDF and enables fast SDE sampling, offering an effective means to overcome the CoD. Three fitting methods, Score Matching (SM), Sliced Score Matching (SSM), and Score-PINN, are introduced, each contributing unique advantages in computational complexity, accuracy, and generality. The proposed score-based SDE solver operates in two stages: first, employing score matching or Score-PINN to acquire the score function; and second, solving the LL via an ordinary differential equation (ODE) using the obtained score function. Comparative evaluations across these methods showcase varying trade-offs. The proposed methodology is evaluated across diverse SDEs, including anisotropic Ornstein-Uhlenbeck processes, geometric Brownian motion, and Brownian motion with varying eigenspace. We also test various distributions, including Gaussian, Log-normal, Laplace, and Cauchy distributions. The numerical results demonstrate the score-based SDE solver’s stability, speed, and performance across different experimental settings, solidifying its potential as a solution to CoD for high-dimensional FP equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Introducing the DREAMS Project: DaRk mattEr and Astrophysics with Machine Learning and Simulations

We introduce the DaRk mattEr and Astrophysics with Machine learning and Simulations (DREAMS) project, an innovative approach to understanding the astrophysical implications of alternative dark matter (DM) models and their effects on galaxy formation and evolution. The DREAMS project will ultimately comprise thousands of cosmological hydrodynamic simulations that simultaneously vary over DM physics, astrophysics, and cosmology in modeling a range of systems—from galaxy clusters to ultra-faint satellites. Such extensive simulation suites can provide adequate training sets for machine-learning-based analyses. This paper introduces two new cosmological hydrodynamical suites of warm dark matter (WDM), each comprising 1024 simulations generated using the arepo code. One suite consists of uniform-box simulations covering a ${(25\,{h}^{-1}\,{\rm{Mpc}})}^{3}$ volume, while the other consists of Milky Way zoom-ins with sufficient resolution to capture the properties of classical satellites. For each simulation, the WDM particle mass is varied along with the initial density field and several parameters controlling the strength of baryonic feedback within the IllustrisTNG model. We provide two examples, separately utilizing emulators and convolutional neural networks, to demonstrate how such simulation suites can be used to disentangle the effects of DM and baryonic physics on galactic properties. The DREAMS project can be extended further to include different DM models, galaxy formation physics, and astrophysical targets. In this way, it will provide an unparalleled opportunity to characterize uncertainties on predictions for small-scale observables, leading to robust predictions for testing the particle physics nature of DM on these scales.

cosmological parameters↗
NASA NTRS1992

Inversion of surface parameters using fast learning neural networks

A neural network approach to the inversion of surface scattering parameters is presented. Simulated data sets based on a surface scattering model are used so that the data may be viewed as taken from a completely known randomly rough surface. The fast learning (FL) neural network and a multilayer perceptron (MLP) trained with backpropagation learning (BP network) are tested on the simulated backscattering data. The RMS error of training the FL network is found to be less than one half the error of the BP network while requiring one to two orders of magnitude less CPU time. When applied to inversion of parameters from a statistically rough surface, the FL method is successful at recovering the surface permittivity, the surface correlation length, and the RMS surface height in less time and with less error than the BP network. Further applications of the FL neural network to the inversion of parameters from backscatter measurements of an inhomogeneous layer above a half space are shown.

Dawson, M. S.↗
DOE OSTI2024

Symbolic diagnostics to interpret and analyze neural network models

Embedded machine-learned models (EMLMs) have the promise to improve the predictive accuracy of engineering simulators in environments of national interest. EMLMs often comprise complex input-output maps (e.g., neural networks), which make them unamenable to rigorous analysis and generally difficult to interpret. In the face of decades of theory, this lack of interpretability is a significant barrier to building confidence in these models. This work outlines an approach to interpret EMLMs using sparse polynomial regression for comparison with theoretical understanding. To do so, we build on the concept of Locally Interpretable Model-agnostic Explanations (LIME) using physics-informed clustering, prototype selection, and library construction. While general, we demonstrate our method on tensor-basis neural networks used in Reynolds-Averaged Navier-Stokes simulations of hypersonic fluid flows. Results are presented for a simulated toy model and for direct numerical simulations (DNS) of turbulent flows over a flat plate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Improved Gas Plume Identification Using Nearest Neighbor Methods for Background Estimation

Longwave infrared (LWIR) hyperspectral imaging (HSI) can be used for many tasks in remote sensing, including detecting and identifying effluent gases by LWIR sensors on airborne platforms. Identification is used after detection to increase confidence in weakly detected plumes, reduce false positives from detection, and distinguish between similar and confounding material signatures. Background estimation is an important step used to reveal the unique spectral characteristics of the detected gas, allowing the identification model to determine what the gas is specifically. The importance of proper background estimation increases when dealing with weak signals, large libraries of gases of interest, and uncommon or heterogeneous backgrounds. In this article, we propose two methods for background estimation: a novel k-nearest segments (KNS) algorithm and the standard k-nearest neighbors (KNN) algorithm. We test our methods and three existing background estimation methods for comparison against global background estimation to determine which performs best at estimating the true background radiance under a plume and for increasing identification confidence using a neural network classification model. We compare the different methods using 640 simulated weak plumes in an urban environment. For identification, our KNS algorithm improves median neural network identification confidence by 53.2%. For background radiance estimation, the KNN algorithm provides a median of 49 times less RMSE than global background estimation. Furthermore, KNN is the easiest method to tune for different plumes, making it an excellent “out of the box” background estimator.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Joint Modeling of Quasar Variability and Accretion Disk Reprocessing Using Latent Stochastic Differential Equations

Quasars are bright active galactic nuclei powered by the accretion of matter around supermassive black holes at the center of galaxies. Their stochastic brightness variability depends on the physical properties of the accretion disk and black hole. The upcoming Rubin Observatory Legacy Survey of Space and Time (LSST) is expected to observe tens of millions of quasars, so there is a need for efficient techniques like machine learning that can handle the large volume of data. Quasar variability is believed to be driven by an X-ray corona, which is reprocessed by the accretion disk and emitted as UV/optical variability. We are the first to introduce an auto-differentiable simulation of the accretion disk and reprocessing. We use the simulation as a direct component of our neural network to jointly model the driving variability and reprocessing, trained with supervised learning on simulated LSST-like 10 yr quasar light curves. We encode the light curves using a transformer encoder, and the driving variability is reconstructed using latent stochastic differential equations, a physically motivated generative deep learning method that can model continuous-time stochastic dynamics. By embedding the physical processes of the driving signal and reprocessing into our network, we achieve a model that is more robust and interpretable. We demonstrate that our model outperforms a Gaussian process regression baseline and can infer accretion disk parameters and time delays between wave bands, even for out-of-distribution driving signals. Our approach provides a powerful framework that can be adapted to solve other inverse problems in multivariate time series.

Fagin, Joshua [City Univ. of New York (CUNY), NY (↗
DOE OSTI2025

Spatiotemporal pattern detection, generation, and computation with circuits

Abstract Implementations of neurons, delays, and synapse circuits are presented with simulations. These neural elements are used to create two small spiking neural networks, the Rate-Window and Order-Biased clusters, which are capable of detecting simple two-spike spatiotemporal patterns. A simple pattern detecting network (SPDN) is created by combining the Rate-Window and Order-Biased clusters, where clusters are small spiking neural networks, and its simple pattern detection ability is demonstrated in simulation. The SPDN is used to implement a complex pattern detecting network (CPDN) and its complex pattern detection ability is demonstrated in simulation. Methods for generating arbitrary spatiotemporal patterns are presented. The CPDN and spatiotemporal pattern generation methods are then used to implement a novel spatiotemporal computing paradigm based on detecting and responding to spatiotemporal symbols. A simulation of a spatiotemporal half adder is presented to demonstrate the computing paradigm.

97 - MATHEMATICS AND COMPUTING↗