Search NASA⌕ Search

SEARCH · Search NASA

Results for “network evolution”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Benchmarking structural evolution methods for training of machine learned interatomic potentials

When creating training data for machine-learned interatomic potentials (MLIPs), it is common to create initial structures and evolve them using molecular dynamics (MD) to sample a larger configuration space. Here, we benchmark two other modalities of evolving structures, contour exploration (CE) and dimer-method (DM) searches against MD for their ability to produce diverse and robust density functional theory training data sets for MLIPs. We also discuss the generation of initial structures which are either from known structures or from random structures in detail to further formalize the structure-sourcing processes in the future. The polymorph-rich zirconium-oxygen composition space is used as a rigorous benchmark system for comparing the performance of MLIPs trained on structures generated from these structural evolution methods. Using Behler–Parrinello neural networks as our MLIP models, we find that CE and the DM searches are generally superior to MD in terms of spatial descriptor diversity and statistical accuracy.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Transient Coupled Chemical-Thermal-Fluid Field Simulation for Sealed Aluminum-clad Spent Nuclear Fuel Storage Canister

As the first step toward developing three-dimensional (3D) multi-physics computational fluid dynamics (CFD) model for unsealed and vented canister storage system, a 3D CFD model coupled with bulk gas radiolysis reactions was developed first for sealed DOE standard canisters filled with inert gas and trace amount of air and water. The workflow for constructing canister-scale 3D CFD models and coupling with gas phase radiolysis reactions were established, which can be readily extended to unsealed, vented canister storage system. This interim milestone report documents the theory of the model, workflow to establish radiolysis reaction network, and initial simulations of the evolutions of thermal fields and hydrogen gas concentrations within sealed DOE standard canisters over long period of time. In addition, a mesh refinement test was done to show that increasing the models mesh refinement had negligible impact upon the temperature profiles.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2022

DeepCare: Improving Patient Care using Deep Learning on Electronic Health Records

Coordinating patient care using electronic health records (EHR) data presents an exciting but formidable opportunity in data extraction, analysis and modeling. Traditional methods use a manual feature driven approach to model patients with age, family history and symptoms to predict disease outcomes. We propose a novel approach to model patients based on their streaming electronic health records data combined with information from medical knowledge bases, which has been gained over years of medical research. Using a combination of representation learning and long short term memory (LSTM) networks we plan to model patient evolution over time, leading to more accurate and individualized predictive models for patient’s diseases. Our approach will be transformative in providing critical decision support for patient care, enabling accurate understanding and evolution of diseases in patients.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

Multimessengers from the Radioactive Decay of r -process Nuclei

The radioactive β-decay of nuclei synthesized in the rapid neutron capture process (r-process) releases a variety of particles, including electrons, γ-rays, neutrinos, and neutrons. These particles provide a rich set of multimessenger signals that carry information about the astrophysical environments where neutron-rich nucleosynthesis occurs. In this work, we calculate from first principles the emission spectra resulting from the β-decay of r-process nuclei. Our approach incorporates detailed nuclear structure and decay data to model the energy distributions of each particle species. We couple the spectra with a nuclear reaction network simulation to obtain the temporal evolution of these distributions. We find that the emission distributions vary significantly in time and are nonthermal, with substantial average energies. We investigate these nuclear signals as a direct probe of heavy element formation and show that they are complementary observables to kilonova.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

PDnetwork

PDnetwork is an interactive online tool designed to visualize the evolution of the co-authorship network in the field of peridynamics. In this network, each node represents a peridynamics author, and each link represents co-authorship between authors. The tool allows users to obtain collaborative measures for authors using selected network metrics and visualize collaborations for specific authors. Additionally, it provides rankings for authors based on selected collaboration metrics and includes links to the author profiles in the Scopus publication database.

Dahal, Biraj [Georgia Institute of Technology, Atl↗
DOE OSTI2026

Causality-respecting adaptive refinement for PINNs: enabling precise interface evolution in phase field modeling

Physics-informed neural networks (PINNs) have emerged as a powerful tool for solving physical systems described by partial differential equations (PDEs). However, their accuracy in dynamical systems, particularly those involving sharp moving boundaries with complex initial morphologies, remains a challenge. Here, this study introduces an approach combining residual-based adaptive refinement (RBAR) with causality-informed training to enhance the performance of PINNs in solving spatio-temporal PDEs. Our method employs a three-step iterative process: initial causality-based training, RBAR-guided domain refinement, and subsequent causality training on the refined mesh. Applied to the Allen-Cahn equation, a widely-used model in phase field simulations, our approach demonstrates significant improvements in solution accuracy and computational efficiency over traditional PINNs. Notably, we observe an ‘overshoot and relocate’ phenomenon in dynamic cases with complex morphologies, showcasing the method’s adaptive error correction capabilities. This synergistic interaction between RBAR and causality training enables accurate capture of interface evolution, even in challenging scenarios where traditional PINNs fail. Our framework not only resolves the limitations of uniform refinement strategies but also provides a generalizable methodology for solving a broad range of spatio-temporal PDEs. The enhanced performance of the RBAR–causality combined framework demonstrates its strong potential for advancing PINN-based modeling of physical systems characterized by complex, evolving interfaces.

Allen-Cahn equations↗
DOE OSTI2022

Phylogenetic structure of specialization: A new approach that integrates partner availability and phylogenetic diversity to quantify biotic specialization in ecological networks

Abstract Biotic specialization holds information about the assembly, evolution, and stability of biological communities. Partner availabilities can play an important role in enabling species interactions, where uneven partner availabilities can bias estimates of biotic specialization when using phylogenetic diversity indices. It is therefore important to account for partner availability when characterizing biotic specialization using phylogenies. We developed an index, phylogenetic structure of specialization (PSS), that avoids bias from uneven partner availabilities by uncoupling the null models for interaction frequency and phylogenetic distance. We incorporate the deviation between observed and random interaction frequencies as weights into the calculation of partner phylogenetic α‐diversity. To calculate the PSS index, we then compare observed partner phylogenetic α‐diversity to a null distribution generated by randomizing phylogenetic distances among the same number of partners. PSS quantifies the phylogenetic structure (i.e., clustered, overdispersed, or random) of the partners of a focal species. We show with simulations that the PSS index is not correlated with network properties, which allows comparisons across multiple systems. We also implemented PSS on empirical networks of host–parasite, avian seed‐dispersal, lichenized fungi–cyanobacteria, and hummingbird pollination interactions. Across these systems, a large proportion of taxa interact with phylogenetically random partners according to PSS, sometimes to a larger extent than detected with an existing method that does not account for partner availability. We also found that many taxa interact with phylogenetically clustered partners, while taxa with overdispersed partners were rare. We argue that species with phylogenetically overdispersed partners have often been misinterpreted as generalists when they should be considered specialists. Our results highlight the important role of randomness in shaping interaction networks, even in highly intimate symbioses, and provide a much‐needed quantitative framework to assess the role that evolutionary history and symbiotic specialization play in shaping patterns of biodiversity. PSS is available as an R package at https://github.com/cjpardodelahoz/pss .

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Recurrent convolutional neural networks for modeling nonadiabatic dynamics of quantum-classical systems

Recurrent neural networks (RNNs) have recently been extensively applied to model the time evolution in fluid dynamics, weather predictions, and even chaotic systems due to their ability to capture temporal dependencies and sequential patterns in data. Here we present an RNN model based on convolutional neural networks for modeling the nonlinear nonadiabatic dynamics of hybrid quantum-classical systems. The dynamical evolution of the hybrid systems is governed by equations of motion for classical degrees of freedom and von Neumann equation for electrons. The Physics-Aware Recurrent Convolution (PARC) neural network structure incorporates a differentiator-integrator architecture that inductively models the spatiotemporal dynamics of generic physical systems. Here, we apply our RNN approach to learn the space-time evolution of a one-dimensional semiclassical Holstein model after an interaction quench. For shallow quenches (small changes in electron-lattice coupling), the deterministic dynamics can be accurately captured using a single-CNN-based recurrent network. In contrast, deep quenches induce chaotic evolution, making long-term trajectory prediction significantly more challenging. Nonetheless, we demonstrate that the PARC-CNN architecture can effectively learn the statistical climate of the Holstein model under deep-quench conditions.

Holstein model↗
DOE OSTI2025

CLPNets: Coupled Lie–Poisson neural networks for multi-part Hamiltonian systems with symmetries

To accurately compute data-based prediction of Hamiltonian systems, it is essential to utilize methods that preserve the structure of the equations over time. We consider a particularly challenging case of systems with interacting parts that do not reduce to pure momentum evolution. Such systems are essential in scientific computations, such as discretization of a continuum elastic rod, which can be viewed as the group of rotations and translations $SE(3)$. The evolution involves not only the momenta but also the relative positions and orientations of the particles. The presence of Lie group-valued elements, such as relative positions and orientations, poses a problem for applying previously derived methods for data-based computing. We develop a novel method of data-based computation and complete phase space learning of such systems. We follow the original framework of SympNets (Jin et al., 2020) and LPNets (Eldred et al., 2024), building the neural network from phase space mappings that preserve the Lie–Poisson structure. We derive a novel system of mappings that are built into neural networks describing the evolution of such systems. We call such networks Coupled Lie–Poisson Neural Networks, or CLPNets. We consider increasingly complex examples for the applications of CLPNets, starting with the rotation of two rigid bodies about a common axis, progressing to the free rotation of two rigid bodies, and finally to the evolution of two connected and interacting $SE(3)$ components, describing the discretization of an elastic rod into two elements. Our method preserves all Casimir invariants to machine precision, preserves energy to high accuracy, and shows good resistance to the curse of dimensionality, requiring only a few thousand data points for all cases studied (three to eighteen dimensions). Additionally, the method is highly economical in memory requirements, requiring only about 200 parameters for the most complex case considered.

Data-based modeling↗
DOE OSTI2025

From disorganized data to emergent dynamic models: Questionnaires to partial differential equations

Starting with sets of disorganized observations of spatially varying and temporally evolving systems, obtained at different (also disorganized) sets of parameters, we demonstrate the data-driven derivation of parameter dependent, evolutionary partial differential equation (PDE) models capable of generating the data. This tensor type of data is reminiscent of shuffled (multidimensional) puzzle tiles. The independent variables for the evolution equations (their “space” and “time”) as well as their effective parameters are all emergent , i.e. determined in a data-driven way from our disorganized observations of behavior in them. We use a diffusion map based questionnaire approach to build a smooth parametrization of our emergent space/time/parameter space for the data. This approach iteratively processes the data by successively observing them on the “space,” the “time” and the “parameter” axes of a tensor. Once the data become organized, we use machine learning (here, neural networks) to approximate the operators governing the evolution equations in this emergent space. Our illustrative examples are based (i) on a simple advection–diffusion model; (ii) on a previously developed vertex-plus-signaling model of Drosophila embryonic development; and (iii) on two complex dynamic network models (one neuronal and one coupled oscillator model) for which no obvious smooth embedding geometry is known a priori. This allows us to discuss features of the process like symmetry breaking, translational invariance, and autonomousness of the emergent PDE model, as well as its interpretability.

generative models↗
DOE OSTI2022

Fast, High-fidelity Lyα Forests with Convolutional Neural Networks

Full-physics cosmological simulations are powerful tools for studying the formation and evolution of structure in the universe but require extreme computational resources. Here, we train a convolutional neural network to use a cheaper N-body-only simulation to reconstruct the baryon hydrodynamic variables (density, temperature, and velocity) on scales relevant to the Lyα forest, using data from Nyx simulations. We show that our method enables rapid estimation of these fields at a resolution of ~20 kpc, and captures the statistics of the Lyα forest with much greater accuracy than existing approximations. Because our model is fully convolutional, we can train on smaller simulation boxes and deploy on much larger ones, enabling substantial computational savings. Furthermore, as our method produces an approximation for the hydrodynamic fields instead of Lyα flux directly, it is not limited to a particular choice of ionizing background or mean transmitted flux.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

The advanced evolution of massive stars

The nuclear rates for reactions involving 12 C and 16 O are key to computing the energy release and nucleosynthesis evolution of massive stars during their advanced burning phases. Ultimately, these burning rates shape the stellar structure and evolution and influence the nature of the compact objects produced at the end of the stellar life. We explore the implications of new nuclear reaction rates from both experimental and theoretical studies for 12 C(α, γ) 16 ​O, 12 C+ 12​ C, 12 C+ 16 ​O, and 16 O+ 16 ​O reactions for massive stars. Our goal is to investigate how the chemical structure and nucleosynthesis evolve from the He-exhaustion stage to the O-burning phase and how these processes influence the ultimate stellar fate. We computed rotating and non-rotating models for stars of different masses at solar metallicity. We used the stellar evolution code GENEC, which includes a large network of nuclear reactions and isotopes involved in advanced phases, as well as updated rates for 12 C(α,γ) 16 O. For the three fusion reactions involving 12 C and 16 O, we considered new rates following a data-driven fusion suppression scenario (hereafter HIN(RES)) and new theoretical rates obtained with time-dependent Hartree-Fock (TDHF) calculations. The updated 12 C(α, γ) 16 ​O rates mainly impact the chemical structure evolution changing the 12 C/ 16 O ratio at He-exhaustion and have little effect on the CO core mass. This variation in the 12 C/ 16 O ratio is in some cases critical for predicting the final fate of the model, which is very sensitive to 12 C abundance, and in particular the 20 M ⊙ remnant may change from a black hole to a neutron star. The He-burning (C-burning) lifetime is also decreased (increased) by about −2% (+15%). The combined new rates for 12 C+ 12 ​C and 16 O+ 16 ​O fusion reactions according to the HIN(RES) model lead to shorter C- and O-burning lifetimes by ≈ − 10%, and −50%, respectively, and shift the ignition conditions to higher temperatures and densities. In contrast, the theoretical TDHF rates primarily affect C-burning, increasing its duration by about 30% and lowering the ignition temperature. These changes modify the chemical structure of the core, the size and duration of C-burning shells, and hence their compactness. They also impact the central and shell nucleosynthesis (by ±1 dex and by factors of ±2–10, respectively), while 12 C+ 16 ​O reaction rates variations remain the least important.

abundances↗
DOE OSTI2023

Plant terpene specialized metabolism: complex networks or simple linear pathways?

From the perspectives of pathway evolution, discovery and engineering of plant specialized metabolism, the nature of the biosynthetic routes represents a critical aspect. Classical models depict biosynthesis typically from an end-point angle and as linear, for example, connecting central and specialized metabolism. As the number of functionally elucidated routes increased, the enzymatic foundation of complex plant chemistries became increasingly well understood. The perception of linear pathway models has been severely challenged. With a focus on plant terpenoid specialized metabolism, we review here illustrative examples supporting that plants have evolved complex networks driving chemical diversification. The completion of several diterpene, sesquiterpene and monoterpene routes shows complex formation of scaffolds and their subsequent functionalization. These networks show that branch points, including multiple sub-routes, mean that metabolic grids are the rule rather than the exception. This concept presents significant implications for biotechnological production.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

GrainGNN: A dynamic graph neural network for predicting 3D grain microstructure

We propose GrainGNN, a surrogate model for the evolution of polycrystalline grain structure under rapid solidification conditions in metal additive manufacturing. High fidelity simulations of solidification microstructures are typically performed using multicomponent partial differential equations (PDEs) with moving interfaces. The inherent randomness of the PDE initial conditions (grain seeds) necessitates ensemble simulations to predict microstructure statistics, e.g., grain size, aspect ratio, and crystallographic orientation. Here, currently such ensemble simulations are prohibitively expensive and surrogates are necessary.In GrainGNN, we use a dynamic graph to represent interface motion and topological changes due to grain coarsening. We use a reduced representation of the microstructure using hand-crafted features; we combine pattern finding and altering graph algorithms with two neural networks, a classifier (for topological changes) and a regressor (for interface motion). Both networks have an encoder-decoder architecture; the encoder has a multi-layer transformer long-short-term-memory architecture; the decoder is a single layer perceptron.We evaluate GrainGNN by comparing it to high-fidelity phase field simulations for in-distribution and out-of-distribution grain configurations for solidification under laser power bed fusion conditions. GrainGNN results in 80%–90% pointwise accuracy; and nearly identical distributions of scalar quantities of interest (QoI) between phase field and GrainGNN simulations compared using Kolmogorov-Smirnov test. GrainGNN's inference speedup (PyTorch on single x86 CPU) over a high-fidelity phase field simulation (CUDA on a single NVIDIA A100 GPU) is 150×–2000× for 100-initial grain problem. Further, using GrainGNN, we model the formation of 11,600 grains in 220 seconds on a single CPU core.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Influence of Fault Architecture on Induced Earthquake Sequence Evolution Revealed by High-Resolution Focal Mechanism Solutions

The increasing seismicity and improved seismic observation network in recent years provide an opportunity to explore factors that influence the triggering processes, spatiotemporal evolution, and maximum magnitude of induced sequences. We map the fault architecture and stress state of four induced sequences in Oklahoma to determine their influence on the seismicity. We systematically relocate the earthquakes and compute hundreds of focal mechanisms of small to medium events (1.0 < M < 5.1) using various techniques, including machine learning, for the Guthrie, Woodward, Cushing, and Fairview sequences. The detailed fault geometry and spatiotemporal evolution of seismicity and stress states reveal different dominant driving forces for each sequence. In Cushing and Fairview (largest event ≥M5.0), the main fault structures are near-vertical narrow strike-slip faults, with most of the small earthquake fault planes optimally oriented. The two sequences exhibit discontinuous temporal migration but strong earthquake self-driven rupture growth. In Guthrie and Woodward (largest event <M5.0), the two sequences show more complex diffuse fault structures with varying dipping angles along depth. The inverted focal mechanisms show a mix of strike-slip faulting and normal faulting in both sequences, and the normal faulting events are less optimally oriented than strike-slip events. The two sequences are dominated by continuous diffusive migration in time driven by pore pressure propagation. The above results suggest that fault architecture and stress state influence sequence evolution, major driving forces, and possibly maximum magnitude.

58 GEOSCIENCES↗