Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network simulation”

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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Deep-Learning based Reconstruction of the Shower Maximum $X_{\mathrm{max}}$ using the Water-Cherenkov Detectors of the Pierre Auger Observatory

The atmospheric depth of the air shower maximum X max is an observable commonly used for the determination of the nuclear mass composition of ultra-high energy cosmic rays. Direct measurements of X max are performed using observations of the longitudinal shower development with fluorescence telescopes. At the same time, several methods have been proposed for an indirect estimation of X max from the characteristics of the shower particles registered with surface detector arrays. In this paper, we present a deep neural network (DNN) for the estimation of X max . The reconstruction relies on the signals induced by shower particles in the ground based water-Cherenkov detectors of the Pierre Auger Observatory. The network architecture features recurrent long short-term memory layers to process the temporal structure of signals and hexagonal convolutions to exploit the symmetry of the surface detector array. We evaluate the performance of the network using air showers simulated with three different hadronic interaction models. Thereafter, we account for long-term detector effects and calibrate the reconstructed X max using fluorescence measurements. Finally, we show that the event-by-event resolution in the reconstruction of the shower maximum improves with increasing shower energy and reaches less than 25 g/cm 2 at energies above 2 × 10 19 eV.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Smart pixel sensors: towards on-sensor filtering of pixel clusters with deep learning

Highly granular pixel detectors allow for increasingly precise measurements of charged particle tracks. Next-generation detectors require that pixel sizes will be further reduced, leading to unprecedented data rates exceeding those foreseen at the High- Luminosity Large Hadron Collider. Signal processing that handles data incoming at a rate of $\mathcal{O}$(40 MHz) and intelligently reduces the data within the pixelated region of the detector at rate will enhance physics performance at high luminosity and enable physics analyses that are not currently possible. Using the shape of charge clusters deposited in an array of small pixels, the physical properties of the traversing particle can be extracted with locally customized neural networks. In this first demonstration, we present a neural network that can be embedded into the on-sensor readout and filter out hits from low momentum tracks, reducing the detector's data volume by 57.1%–75.7%. The network is designed and simulated as a custom readout integrated circuit with 28 nm CMOS technology and is expected to operate at less than 300 μW with an area of less than 0.2 mm 2 . The temporal development of charge clusters is investigated to demonstrate possible future performance gains, and there is also a discussion of future algorithmic and technological improvements that could enhance efficiency, data reduction, and power per area.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2026

Latent Twins

Over the past decade, scientific machine learning has transformed the development of mathematical and computational frameworks for analyzing, modeling, and predicting complex systems. From inverse problems to numerical partial differential equations (PDEs), dynamical systems, and model reduction, these advances have pushed the boundaries of what can be simulated. Yet they have often progressed in parallel, with representation learning and algorithmic solution methods evolving largely as separate pipelines. With Latent Twins, we propose a unifying mathematical framework that creates a hidden surrogate in latent space for the underlying equations. Whereas digital twins mirror physical systems in the digital world, Latent Twins mirror mathematical systems in a learned latent space governed by operators. Through this lens, classical modeling, inversion, model reduction, and operator approximation all emerge as special cases of a single principle. We establish the fundamental approximation properties of Latent Twins for both ordinary differential equations (ODEs) and PDEs and demonstrate the framework across three representative settings: (i) canonical ODEs, capturing diverse dynamical regimes; (ii) a PDE benchmark using the shallow-water equations, contrasting Latent Twin simulations with deep operator network and forecasts with a four-dimensional variational method baseline; and (iii) a challenging real-data geopotential reanalysis dataset, reconstructing and forecasting from sparse, noisy observations. Latent Twins provide a compact, interpretable surrogate for solution operators that evaluate across arbitrary time gaps in a single-shot, while remaining compatible with scientific pipelines such as assimilation, control, and uncertainty quantification. Looking forward, this framework offers scalable, theory-grounded surrogates that bridge data-driven representation learning and classical scientific modeling across disciplines.

Latent Twins↗
DOE OSTI2023

The evolution of HCO + in molecular clouds using a novel chemical post-processing algorithm

Modelling the chemistry of molecular clouds is critical to accurately simulating their evolution. To reduce computational cost, 3D simulations generally restrict their chemistry to species with strong heating and cooling effects. Time-dependent information about the evolution of other species is therefore often neglected. We address this gap by post-processing tracer particles in the SILCC-Zoom molecular cloud simulations. Using a chemical network of 39 species and 301 reactions (including freeze-out of CO and H 2 O) and a novel algorithm to reconstruct a density grid from sparse tracer particle data, we produce time-dependent density distributions for various species. We focus upon the evolution of HCO + , which is a critical formation reactant of CO but is not typically modelled on the fly. We find that ∼ 90 per cent of the HCO + content of the cold molecular gas forms in situ around n HCO + ∼ 10 3 –10 4 cm −3 , over a time-scale of approximately 1 Myr. The remaining ∼ 10 per cent forms at high extinction sites, with minimal turbulent mixing out into the less dense gas. We further show that the dominant HCO + formation pathway is dependent on the visual extinction, with the reaction H 3 + + CO contributing 90 per cent of the total HCO + production above A V, 3D = 3. We produce the very first maps of the HCO + column density, N(HCO + ), and show that it reaches values as high as 10 15 cm −2 . We find that 50 per cent of the HCO + mass is located within AV ∼ 10–30 in a density range of 10 3.5 –10 4.5 cm −3 . Our maps of N(HCO + ) are shown to be in good agreement with recent observations of the W49A star-forming region.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

A post-merger enhancement only in star-forming Type 2 Seyfert galaxies: the deep learning view

ABSTRACT Supermassive black holes require a reservoir of cold gas at the centre of their host galaxy in order to accrete and shine as active galactic nuclei (AGN). Major mergers have the ability to drive gas rapidly inwards, but observations trying to link mergers with AGN have found mixed results due to the difficulty of consistently identifying galaxy mergers in surveys. This study applies deep learning to this problem, using convolutional neural networks trained to identify simulated post-merger galaxies from survey-realistic imaging. This provides a fast and repeatable alternative to human visual inspection. Using this tool, we examine a sample of ∼8500 Seyfert 2 galaxies ($L[\mathrm{O\, {\small III}}] \sim 10^{38.5 - 42}$ erg s−1) at z < 0.3 in the Sloan Digital Sky Survey and find a merger fraction of $2.19_{-0.17}^{+0.21}$ per cent compared with inactive control galaxies, in which we find a merger fraction of $2.96_{-0.20}^{+0.26}$ per cent, indicating an overall lack of mergers among AGN hosts compared with controls. However, matching the controls to the AGN hosts in stellar mass and star formation rate reveals that AGN hosts in the star-forming blue cloud exhibit a ∼2 × merger enhancement over controls, while those in the quiescent red sequence have significantly lower relative merger fractions, leading to the observed overall deficit due to the differing M*–SFR distributions. We conclude that while mergers are not the dominant trigger of all low-luminosity, obscured AGN activity in the nearby Universe, they are more important to AGN fuelling in galaxies with higher cold gas mass fractions as traced through star formation.

Avirett-Mackenzie, M. S.↗
DOE OSTI2023

Variational quantum simulation of the critical Ising model with symmetry averaging

Here we investigate the use of deep multiscale entanglement renormalization ansatz (DMERA) circuits as a variational ansatz. We use the exactly solvable one-dimensional critical transverse-field Ising model as a test bed. Numerically exact simulation of the quantum circuit ansatz can in this case be carried out to hundreds of qubits by exploiting efficient classical algorithms for simulating matchgate circuits. We find that, for this system, the DMERA strongly outperforms a standard quantum approximate optimization algorithm (QAOA)–style ansatz, and that a major source of systematic error in correlation functions approximated using the DMERA is the breaking of the translational and Kramers-Wannier symmetries of the transverse-field Ising model. We are able to reduce this error by up to four orders of magnitude by symmetry averaging, without incurring additional cost in qubits or circuit depth. Here, we propose that this technique for mitigating systematic error could be applied to noisy intermediate-scale quantum (NISQ) simulations of physical systems with other symmetries.

1-dimensional spin chains↗
DOE OSTI2020

Universal spin dynamics in infinite-temperature one-dimensional quantum magnets

Here, we address the nature of spin dynamics in various integrable and non-integrable, isotropic and anisotropic quantum spin-$S$ chains, beyond the paradigmatic $S=1/2$ Heisenberg model. In particular, we investigate the algebraic long-time decay $\propto t^{-1/z}$ of the spin-spin correlation function at infinite temperature, using state-of-the-art simulations based on tensor network methods. We identify three universal regimes for the spin transport, independent of the exact microscopic model: (i) superdiffusive with $z=3/2$, as in the Kardar-Parisi-Zhang universality class, when the model is integrable with extra symmetries such as spin isotropy that drive the Drude weight to zero, (ii) ballistic with $z=1$ when the model is integrable with a finite Drude weight, and (iii) diffusive with $z=2$ with easy-axis anisotropy or without integrability, at variance with previous observations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Easy-plane spin Hall nano-oscillators as spiking neurons for neuromorphic computing

Here we show analytically using a macrospin approximation that easy-plane spin Hall nano-oscillators excited by a spin current polarized perpendicularly to the easy plane have phase dynamics analogous to that of Josephson junctions. Similarly to Josephson junctions, they can reproduce the spiking behavior of biological neurons that is appropriate for neuromorphic computing. To take advantage of typical spin-orbit torques, we use a nanoconstriction geometry, in which the magnetostatic interaction and magnetocrystalline anisotropy are tuned to create an easy plane that includes the interface normal direction. We perform micromagnetic simulations of such oscillators realized in this geometry and show that the easy-plane spiking dynamics is preserved in this experimentally feasible architecture. Finally we simulate two elementary neural network blocks that implement operations essential for neuromorphic computing. First, we show that output spikes energies from two neurons can be summed and injected into a following layer neuron and second, we demonstrate that outputs can be multiplied by synaptic weights implemented by locally modifying the anisotropy.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Microscopic calculation of fission product yields for odd-mass nuclei

Fission data are essential inputs to reaction networks involved in nucleosynthesis simulations and nuclear forensics. In such applications as well as in the description of multichance fission, the characteristics of fission for odd-mass nuclei are just as important as those for even-even nuclei. The fission theories that aim at explicitly describing fission dynamics are typically based on some variant of the nuclear mean-field theory. In such cases, the treatment of systems with an odd number of particles is markedly more involved, both formally and computationally. In this article, we use the blocking prescription of the Hartree-Fock-Bogoliubov theory with Skyrme energy functionals to compute the deformation properties of odd-mass uranium isotopes. We show that the resulting fission fragment distributions depend quite significantly on the spin of the odd neutron. By direct calculation of the spin distribution of the fissioning nucleus, we propose a methodology to rigorously predict the charge and mass distributions in odd-mass nuclei.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Preparation of the SU(3) lattice Yang-Mills vacuum with variational quantum methods

Studying QCD and other gauge theories on quantum hardware requires the preparation of physically interesting states. The variational quantum eigensolver provides a way of performing vacuum state preparation on quantum hardware. Here in this work, variational quantum eigensolver is applied to pure SU(3) lattice Yang-Mills on a single plaquette and one dimensional plaquette chains. Bayesian optimization and gradient descent were investigated for performing the classical optimization. Ansatz states for plaquette chains are constructed in a scalable manner from smaller systems using domain decomposition and a stitching procedure analogous to the density matrix renormalization group. Small examples are performed on IBM’s superconducting Manila processor.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Quantum real-time evolution using tensor renormalization group methods

We introduce an approach for approximate real-time evolution of quantum systems using tensor renormalization group (TRG) methods originally developed for imaginary time. We use higher-order TRG to generate a coarse-grained time evolution operator for a 1+1⁢D transverse Ising model with a longitudinal field. We show that the standard tensor norm used for the singular value decomposition-based truncation is degenerate and propose an alternate method to discriminate. We show that it is effective and efficient in evolving Gaussian wave packets for one and two particles in the disordered phase, while ordered phase behavior is more challenging to capture. We compare our algorithm with local simulators for universal quantum computers and discuss possible benchmarking in the near future.

lattice gauge theory↗
DOE OSTI2024

Complex Structure of Molten FLiBe (2 Li F – Be F 2 ) Examined by Experimental Neutron Scattering, X-Ray Scattering, and Deep-Neural-Network Based Molecular Dynamics

The use of molten salts as coolants, fuels, and tritium breeding blankets in the next generation of fission and fusion nuclear reactors benefits from furthering the characterization of the molecular structure of molten halide salts, paving the way to predictive capability of the chemical and thermophysical properties of molten salts. Due to its neutronic, chemical, and thermochemical properties, 2 Li F - Be F 2 is a candidate molten salt for several fusion- and fission-reactor designs. We performed neutron and x-ray total-scattering measurements to determine the atomic structure of liquid 2 Li F - Be F 2 . We also performed and neural-network molecular-dynamics simulations to predict the structure obtained by neutron- and x-ray-diffraction experiments. The use of machine learning provides improvements to the efficiency in predicting the structure at a longer length scales than is achievable with simulations at significantly lower computational expense while retaining near accuracy. We found that the NNMD simulations accurately predicted the Be F 4 2 − oligomer formations seen in the experimental first-structure-factor peak. Our combination of high-resolution measurements with large-scale molecular dynamics provided an avenue to explore and experimentally verify the intermediate-range ordering beyond the first-nearest neighbor that has posed too many experimental and computational challenges in previous works. With a deeper understanding of the salt structure and ion ordering, the evolution of salt chemistry over the lifetime of a reactor can be better predicted, which is crucial to the licensing and operation of advanced fission and fusion reactors that employ molten salts. To this end, this work will serve as a reference for future studies of salt structure and macroscopic properties with and without the addition of solutes. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm

The trading of fidelity for scale enables approximate classical simulators such as matrix product states (MPSs) to run quantum circuits beyond exact methods. A control parameter, the so-called bond dimension $\mathcal{χ}$ for MPSs, governs the allocated computational resources and the output fidelity. Here, we characterize the fidelity for the quantum approximate optimization algorithm by the expectation value of the cost function that it seeks to minimize and find that it follows a scaling law $\mathscr{F}$(ln $\mathcal{χ}$/N), where N is the number of qubits. With ln $\mathcal{χ}$ amounting to the entanglement that a MPS can encode, we show that the relevant variable for investigating the fidelity is the entanglement per qubit. Importantly, our results calibrate the classical computational power required to achieve the desired fidelity and benchmark the performance of quantum hardware in a realistic setup. For instance, we quantify the hardness of performing better classically than a noisy superconducting quantum processor by readily matching its output to the scaling function. Moreover, we relate the global fidelity to that of individual operations and establish its relationship with $\mathcal{χ}$ and N. We sharpen the requirements for noisy quantum computers to outperform classical techniques at running a quantum optimization algorithm in speed, size, and fidelity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Network Hardware Virtualization for Application Provisioning in Core Networks

We present that service providers and vendors are moving toward a network virtualized core, whereby multiple applications would be treated on their own merit in programmable hardware. Such a network would have the advantage of being customized for user requirements and allow provisioning of next generation services that are built specifically to meet user needs. In this article, we articulate the impact of network virtualization on networks that provide customized services and how a provider's business can grow with network virtualization. We outline a decision map that allows mapping of applications with technology that is supported in network-virtualization - oriented equipment. Analogies to the world of virtual machines and generic virtualization show that hardware supporting network virtualization will facilitate new customer needs while optimizing the provider network from the cost and performance perspectives. A key conclusion of the article is that growth would yield sizable revenue when providers plan ahead in terms of supporting network-virtualization-oriented technology in their networks. To be precise, providers have to incorporate into their growth plans network elements capable of new service deployments while protecting network neutrality. Finally, a simulation study validates our NV-induced model.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

RE-INTEGRATE EMT Simulation Software: DAE Solvers and Automation

Existing electromagnetic transient (EMT) simulation tools face challenges in accelerating EMT simulations, especially for very large-scale power networks. To tackle this issue, next generation EMT simulation tools such as RE-INTEGRATE EMT are being researched upon. Such tools should be equipped with automation capabilities and advanced numerical differential-algebraic equation (DAE) solvers. In this paper, the DAE solvers incorporated within the RE-INTEGRATE EMT simulation tool are discussed. In particular, a modified ODEINT-based DAE solver and the ARKODE solver from SUN-DIALS are leveraged within RE-INTEGRATE EMT. In addition, the automation implemented within RE-INTEGRATE EMT to automate the DAE generation (replacing the need of manual discretization and assembling DAEs) is discussed. Different use cases were implemented using the RE-INTEGRATE EMT tool and were validated with respect to baseline simulations.

Marthi, Phani Ratna Vanamali [ORNL] (ORCID:0000000↗