Search NASA⌕ Search

SEARCH · Search NASA

Results for “Dynamic Networks”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

From Nonclassical to Classical: Crystallization Seeds Reshape Nucleation Mechanisms

Crystalline seeds are widely employed in crystallization to accelerate nucleation and control product polymorphs; yet, their impact on nucleation mechanisms remains poorly understood. While homogeneous nucleation of crystals from solution often proceeds through nonclassical pathways involving amorphous intermediates, it is unclear how seeds that promote heterogeneous nucleation reshape these mechanisms and govern polymorph selection. Here, in this study, we provide the first direct evidence that crystalline seeds can bypass the need for amorphous intermediates as nucleation sites, converting nonclassical nucleation mechanisms into classical, monomer-by-monomer crystallization pathways. Using molecular dynamics simulations of zeolite synthesis, we uncover a complex reaction network of competing nucleation processes mediated by intermediate interfacial polymorphs. The interplay between thermodynamic stability and kinetic favorability of these interfacial polymorphs dictates nucleation outcomes, creating a dynamic balance between the interfacial polymorph stability and crystallization rates. Furthermore, we show that the synthesis environment-whether monomers or aggregates serve as reactants-profoundly impacts these pathways. At moderate supersaturation, seeds eliminate amorphous intermediates and promote classical nucleation, whereas high supersaturation or aggregate-based reactants favor nonclassical pathways, even in the presence of seeds. These findings establish a general framework for understanding how seeds govern crystallization mechanisms, with broad implications for controlling nucleation kinetics, polymorph selection, and material properties. While focused on zeolites, this work reveals insights that may be applicable to biominerals, pharmaceuticals, functional materials, and catalysts, providing a basis for engineering crystallization pathways in diverse applications.

Chu-Jon, Carlos [Univ. of Utah, Salt Lake City, UT↗
DOE OSTI2025

Efficient Neural Network Approaches for Conditional Optimal Transport with Applications in Bayesian Inference

In this work, we present two neural network approaches that approximate the solutions of static and dynamic conditional optimal transport (COT) problems. Both approaches enable conditional sampling and conditional density estimation, which are core tasks in Bayesian inference—particularly in the simulation-based (“likelihood-free”) setting. Our methods represent the target conditional distribution as a transformation of a tractable reference distribution. Obtaining such a transformation, chosen here to be an approximation of the COT map, is computationally challenging even in moderate dimensions. To improve scalability, our numerical algorithms use neural networks to parameterize candidate maps and further exploit the structure of the COT problem. Our static approach approximates the map as the gradient of a partially input convex neural network. It uses a novel numerical implementation to increase computational efficiency compared to state-of-the-art alternatives. Our dynamic approach approximates the conditional optimal transport via the flow map of a regularized neural ODE; compared to the static approach, it is slower to train but offers more modeling choices and can lead to faster sampling. We demonstrate both algorithms numerically, comparing them with competing state-of-the-art approaches, using benchmark datasets and simulation-based Bayesian inverse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Dynamic Validation of CNN-Based Surrogate Models for Inverter-Based Resources in Open-Source Solvers

Traditionally, distribution system planning has focused on steady-state analyses, with limited consideration of dynamic behavior. However, as large or medium-scale inverter-based resources (IBRs), particularly grid-following (GFL) inverters in commercial or industry buildings, become more prevalent, understanding their dynamic impact is essential for grid planning and operation. This article presents an innovative deep-learning (DL)-approach using convolutional neural networks technique to model the GFL inverters. Developed from real grid-tied commercial IBR transient data, these dynamic DL models overcome proprietary constraints by requiring minimal knowledge of internal converter physics while maintaining high accuracy and flexibility. To demonstrate their applicability, the models were incorporated into GridLAB-D, an open-source, three-phase distribution analysis tool. This integration enables dynamic simulations of large-scale distribution networks with high IBR penetration stability analysis. Rigorous testing and validation, aligned with industry standards, confirmed the reliability and efficiency of this approach, paving the way for enhanced planning and operational assessments of modern power systems.

Deep-learning↗
DOE OSTI2024

Exploring Li-Ion Transport Properties of Li 3 TiCl 6 : A Machine Learning Molecular Dynamics Study

We performed large-scale molecular dynamics simulations based on a machine-learning force field (MLFF) to investigate the Li-ion transport mechanism in cation-disordered Li 3 TiCl 6 cathode at six different temperatures, ranging from 25°C to 100°C. In this work, deep neural network method and data generated by ab − initio molecular dynamics (AIMD) simulations were deployed to build a high-fidelity MLFF. Radial distribution functions, Li-ion mean square displacements (MSD), diffusion coefficients, ionic conductivity, activation energy, and crystallographic direction-dependent migration barriers were calculated and compared with corresponding AIMD and experimental data to benchmark the accuracy of the MLFF. From MSD analysis, we captured both the self and distinct parts of Li-ion dynamics. The latter reveals that the Li-ions are involved in anti-correlation motion that was rarely reported for solid-state materials. Similarly, the self and distinct parts of Li-ion dynamics were used to determine Haven’s ratio to describe the Li-ion transport mechanism in Li 3 TiCl 6 . Obtained trajectory from molecular dynamics infers that the Li-ion transportation is mainly through interstitial hopping which was confirmed by intra- and inter-layer Li-ion displacement with respect to simulation time. Ionic conductivity (1.06 mS/cm) and activation energy (0.29eV) calculated by our simulation are highly comparable with that of experimental values. Overall, the combination of machine-learning methods and AIMD simulations explains the intricate electrochemical properties of the Li 3 TiCl 6 cathode with remarkably reduced computational time. Thus, our work strongly suggests that the deep neural network-based MLFF could be a promising method for large-scale complex materials.

Selvaraj, Selva Chandrasekaran (ORCID:000000029023↗
DOE OSTI2024

IRIS-GNN: Leveraging Graph Neural Networks for Scheduling on Truly Heterogeneous Runtime Systems

The diversity of accelerators in computer systems poses significant challenges for software developers, such as managing vendor-specific compiler toolchains, code fragmentation requiring different kernel implementations, and performance portability issues. To address these, the Intelligent Runtime System (IRIS) was developed. IRIS works across various systems, from smartphones to supercomputers, enabling automatic performance scaling based on available accelerators. It introduces abstract tasks for seamless execution transitions between accelerators while ensuring memory consistency and task dependencies. Although IRIS simplifies system details, optimal dynamic scheduling still requires user input to understand workload structures. To address this, we introduce a new scheduling policy for IRIS, termed IRIS-GNN, which is the first IRIS hybrid policy that operates in conjunction with the dynamic policies. This policy employs a Graph-Neural Network (GNN) to conduct Graph Classification of any task graphs submitted to IRIS. This GNN analyzes the structure and attributes of the task graph, categorizing it as either locality, concurrency, or mixed. This classification subsequently guides the selection of the dynamic policy used by IRIS. We provide a comparison of the performance of IRIS-GNN against the complete spectrum of IRIS’s dynamic policies, assess the overhead introduced by the GNN within this scheduling framework, and ultimately explore its practical application in real-world scenarios.

Johnston, Beau↗
DOE OSTI2024

Anticipating Technical Expertise and Capability Evolution in Research Communities Using Dynamic Graph Transformers

The ability to anticipate global technical expertise and capability evolution trends is essential for national and global security, especially in safety-critical domains such as nuclear nonproliferation (NN) and rapidly emerging fields like artificial intelligence (AI). Here, in this work, we extend traditional statistical relational learning approaches (e.g., link prediction in collaboration networks) and formulate a problem of anticipating technical expertise and capability evolution using dynamic heterogeneous graph representations. We develop novel capabilities to forecast collaboration patterns, authorship behavior, and technical capability evolution at different granularities (e.g., scientist and institution levels) in two distinct research fields. We implement a dynamic graph transformer (DGT) neural architecture, which pushes the state-of-the-art graph neural network models by: 1) forecasting heterogeneous (rather than homogeneous) nodes and edges; and 2) relying on both discrete- and continuous-time inputs. We demonstrate that our DGT models predict collaboration, partnership, and expertise patterns with 0.26, 0.73, and 0.53 mean reciprocal rank values for AI and 0.48, 0.93, and 0.22 for NN domains. DGT model performance exceeds the best-performing static graph baseline models by 30%–80% across AI and NN domains. Our findings demonstrate that DGT models boost inductive task performance when previously unseen nodes appear in the test data for the domains with emerging collaboration patterns (e.g., AI). Specifically, models accurately predict which established scientists will collaborate with early career scientists and vice versa in the AI domain.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Investigation into the Performance Benefits of Exposing Network Backpressure in UPC++ and GASNet-EX

This document is a brief summary of the research, and supporting development efforts, conducted by the project "Investigation into Improving Dynamic Adaptivity to System-Level Asynchrony in UPC++". We tested the hypothesis "The UPC++ and GASNet-EX runtimes can expose information from the network stack that enables applications to dynamically adapt to congestion, improving total throughput". We present experimental results from both a microbenchmark and an application benchmark that support this hypothesis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

How Does the Rate of Chain Exchange Relate to Stress Relaxation in Triblock Copolymer Networks?

The relationship between macroscopic stress relaxation and molecular-level chain exchange in triblock copolymer micelles has been explored using rheology and time-resolved small-angle neutron scattering (TR-SANS), marking the first measurements of chain exchange in concentrated triblock networks. It has long been assumed in models of transient or thermoreversible networks that the time scales for these two processes are equal. Experimentally, we find that stress relaxation occurs many orders-of-magnitude faster than chain exchange. This difference is quantitatively explained by modest dispersity in the core block that results in a slight asymmetry within any given nominally symmetric triblock. For stress relaxation to occur, only the shorter chain must pull out, while chain exchange is slowed due to the requirement of the eventual pullout of the longer block. The pullout time is extremely sensitive to the length of the core block. This mechanism is supported by measurements with an intentionally asymmetric triblock copolymer, which displays an even larger difference between the stress relaxation and chain exchange rates. These results establish a quantitative molecular-level picture of the chain dynamics associated with stress relaxation in triblock copolymer networks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Frequency Control and Disturbance Containment Using Grid-Forming Embedded Storage Networks

The paper presents a distributed approach for operating a network of inverter-based energy storage resources embedded in a bulk power system. Departing from their traditional role of steady-state reserves, the storage assets in the network are utilized as frequency-responsive resources shaping system dynamics. The power electronics converter systems interfacing the storage resources are equipped with local controllers designed to respond under transient disturbances. To this end, a safety-constrained distributed control strategy is explored. The paper compares the performance of converter-interfaced grid-forming and grid-following storage networks for fast frequency control and disturbance containment/localization. Sensitivity studies are performed to study the impact of storage size, steady-state dispatch, and controller design on dynamic performance. The findings are presented through case studies with results from the IEEE test systems.

Chatterjee, Kaustav (ORCID:0000000153273860)↗
DOE OSTI2024

Do not forget the electrons: Extending moderately-sized nuclear networks for multidimensional hydrodynamic codes

Context.Nuclear networks are widely used coupled with hydrodynamical simulations of explosive scenarios to account for the change of nuclear species and energy generation rate due to nuclear reactions. In this way, there is a feedback mechanism between the hydrodynamical state and the nuclear processes. Unfortunately, the timescale of nuclear reactions is orders of magnitude smaller than the dynamical timescale that drives hydrodynamical simulations. Therefore, these nuclear networks are usually very small, reduced in most cases to a dozen elements, especially when simulations are carried out in more than one dimension. Aims.We present here an extended nuclear network, with 90 species, designed for being coupled with hydrodynamic simulations, which includes neutrons, protons, electrons, positrons, and the corresponding neutrino and anti-neutrino emission. This network is also coupled with temperature, making it extremely robust and, together with its size, unique of its kind. The inclusion of electron captures on free protons makes the network very appropriate for multidimensional studies of Type Ia supernova explosions, especially when the exploding object is a massive white dwarf. Methods.We perform several tests that are relevant to simulate explosive scenarios, such as Type Ia supernovae and core-collapse supernovae. We compare the results of the 90 nuclei network with a standardα-chain network with 14 elements to evaluate the differences in the energy generation rate. We also evaluate the relevance of including the electrons in the network in terms of generated yields and how it affects the pressure of a degenerate fluid such as that of white dwarfs. The results obtained with the 90-nuclei network have been verified with a much larger 2000-nuclei network built from REACLIB (WinNet), in terms of nuclear energy generation rate, pressure, and produced yields. Results.The results obtained with the proposed medium-sized network compare fairly well, to a few percent, with those computed withWinNetin scenarios reproducing the gross physical conditions of current Type Ia supernova explosion models. In those cases where the carbon and oxygen fuel ignites at high density, the high-temperature plateau typical of the nuclear statistical equilibrium regime is well defined and stable, allowing large integration time steps. We show that the inclusion of electron captures on free protons substantially improves the estimation of the electron fraction of the mixture. Therefore, the pressure is better determined than in networks where electron captures are excluded, which will ultimately lead to more reliable hydrodynamic models. Explosive combustion of helium at low density, occurring near the surface layer of a white dwarf, is also better described with the proposed network, which gives nuclear energy generation rates much closer toWinNetthan typical reduced alpha networks. Conclusions.A nuclear network withN= 90 species, including electrons, aimed at multidimensional calculations of supernova explosions is described and verified. The proposed network is suitable for the study of Type Ia supernova explosions because it provides better values of pressure and electron abundance than other existing networks with smaller or even a similar size but without including electron capture processes.

Astronomy & Astrophysics↗
DOE OSTI2025

Temporally-consistent koopman autoencoders for forecasting dynamical systems

Absence of sufficiently high-quality data often poses a key challenge in data-driven modeling of high-dimensional spatio-temporal dynamical systems. Koopman Autoencoders (KAEs) harness the expressivity of deep neural networks (DNNs), the dimension reduction capabilities of autoencoders, and the spectral properties of the Koopman operator to learn a reduced-order feature space with simpler, linear dynamics. However, the effectiveness of KAEs is hindered by limited and noisy training datasets, leading to poor generalizability. To address this, we introduce the Temporally-Consistent Koopman Autoencoder (tcKAE), designed to generate accurate long-term predictions even with limited and noisy training data. This is achieved through a consistency regularization term that enforces prediction coherence across different time steps, thus enhancing the robustness and generalizability of tcKAE over existing models. We provide analytical justification for this approach based on Koopman spectral theory and empirically demonstrate tcKAE’s superior performance over state-of-the-art KAE models across a variety of test cases, including simple pendulum oscillations, kinetic plasma, and fluid flow data.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Stability-Constrained Learning for Frequency Regulation in Power Grids With Variable Inertia

The increasing penetration of converter-based renewable generation has resulted in faster frequency dynamics, and low and variable inertia. As a result, there is a need for frequency control methods that are able to stabilize a disturbance in the power system at timescales comparable to the fast converter dynamics. This paper proposes a combined linear and neural network controller for inverter-based primary frequency control that is stable at time-varying levels of inertia. We model the time-variance in inertia via a switched affine hybrid system model. We derive stability certificates for the proposed controller via a quadratic candidate Lyapunov function. We test the proposed control on a 12-bus 3-area test network, and compare its performance with a base case linear controller, optimized linear controller, and finite-horizon Linear Quadratic Regulator (LQR). Our proposed controller achieves faster mean settling time and over 50% reduction in average control cost across 100 inertia scenarios compared to the optimized linear controller. Unlike LQR which requires complete knowledge of the inertia trajectories and system dynamics over the entire control time horizon, our proposed controller is real-time tractable, and achieves comparable performance to LQR.

data-driven control↗
DOE OSTI2025

Dynamic Low-Rank Training with Spectral Regularization: Achieving Robustness in Compressed Representations

Deployment of neural networks on resource-constrained devices demands models that are both compact and robust to adversarial inputs. However, compression and adversarial robustness often conflict. In this work, we introduce a dynamical low-rank training scheme enhanced with a novel spectral regularizer that controls the condition number of the low-rank core in each layer. This approach mitigates the sensitivity of compressed models to adversarial perturbations without sacrificing clean accuracy. The method is model- and data-agnostic, computationally efficient, and supports rank adaptivity to automatically compress the network at hand. Extensive experiments across standard architectures, datasets, and adversarial attacks show the regularized networks can achieve over 94\% compression while recovering or improving adversarial accuracy relative to uncompressed baselines.

Schotthoefer, Steffen [ORNL] (ORCID:00000002156965↗
DOE OSTI2026

Identifying stochastic dynamics via finite expression methods

Modeling stochastic differential equations (SDEs) is crucial for understanding complex dynamical systems in various scientific fields. Recent methods often employ neural network-based models, which typically represent SDEs through a combination of deterministic and stochastic terms. However, these models usually lack interpretability and have difficulty in generalizing beyond their training domain. Here, this paper introduces the Finite Expression Method (FEX), a symbolic learning approach designed to derive interpretable mathematical representations of the deterministic component of SDEs. For the stochastic component, we integrate FEX with advanced generative modeling techniques to provide a comprehensive representation of SDEs. The numerical experiments on linear, nonlinear, and multidimensional SDEs demonstrate that FEX generalizes well beyond the training domain and delivers more accurate long-term predictions compared to neural network-based methods. The symbolic expressions identified by FEX not only improve prediction accuracy but also offer valuable scientific insights into the underlying dynamics of the systems.

Complex dynamical systems↗
DOE OSTI2024

Learning of networked spreading models from noisy and incomplete data

Recent years have seen a lot of progress in algorithms for learning parameters of spreading dynamics from both full and partial data. Some of the remaining challenges include model selection under the scenarios of unknown network structure, noisy data, missing observations in time, as well as an efficient incorporation of prior information to minimize the number of samples required for an accurate learning. Here, in this work, we introduce a universal learning method based on a scalable dynamic message-passing technique that addresses these challenges often encountered in real data. The algorithm leverages available prior knowledge on the model and on the data, and reconstructs both network structure and parameters of a spreading model. We show that a linear computational complexity of the method with the key model parameters makes the algorithm scalable to large network instances.

97 MATHEMATICS AND COMPUTING↗