Search NASA⌕ Search

SEARCH · Search NASA

Results for “dynamic network”

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 1,081 records · Page 60

SENTRA: A Modular Computational Graph Framework for Critical Mineral and Materials Supply Chains: Part I: Network Construction Latent-Quantity Estimation, and Temporal Graph Forecasting

Global supply chains for critical minerals and materials are complex, evolving networks of countries, products, production stages, and trade relationships. Existing analytical approaches are limited by fragmented data and static network representations that do not capture the dynamic production dependencies linking raw materials, intermediate products, and final goods across multiple countries. Trade and production statistics provide only a partial view of domestic production, inventories, and material flows, making it difficult to identify indirect sourcing pathways, hidden dependencies, and embedded foreign exposures. This paper introduces the Supply Chain Exposure Network Tracking and Risk Assessment (SENTRA) framework, a modular graph-based computational framework for constructing, analyzing, and forecasting dynamic supply chain networks. As the first paper in a three-part methodological series, it establishes the computational foundation of SENTRA by constructing a temporal attributed multi-relational graph whose nodes represent product–country pairs and whose edges encode observed trade and within-country value-chain relationships. Statistical estimation and constrained optimization recover latent production, final demand, and product input dependency coefficients while enforcing economic accounting constraints. Graph-derived exposure measures quantify direct, transshipment, value-chain, and multi-hop supply chain dependencies independently of the forecasting model. A temporal graph forecasting architecture based on a relational graph neural network then forecasts the evolution of the graph under mass-balance constraints with distribution-free conformal uncertainty quantification. Validation on the global aluminum supply chain shows that the learned graph representations recover economically meaningful supply chain structure, accurately forecast out-of-sample trade relationships, and produce well-calibrated prediction intervals. Subsequent papers apply this computational foundation to exposure assessment, disruption analysis, and scenario-based policy analysis, and extend the framework to multimaterial supply chain modeling and decision support.

36 MATERIALS SCIENCE↗

Neural network error correction for solving coupled ordinary differential equations

A neural network is presented to learn errors generated by a numerical algorithm for solving coupled nonlinear differential equations. The method is based on using a neural network to correctly learn the error generated by, for example, Runge-Kutta on a model molecular dynamics (MD) problem. The neural network programs used in this study were developed by NASA. Comparisons are made for training the neural network using backpropagation and a new method which was found to converge with fewer iterations. The neural net programs, the MD model and the calculations are discussed.

Shelton, R. O.↗

Solving the Dynamics-Aware Economic Dispatch Problem with the Koopman Operator

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, in contrast to T-ED, DED is a nonlinear, non-convex optimization problem that is computationally prohibitive to solve. We introduce a machine learning-based operator-theoretic approach for solving the DED problem efficiently. Specifically, we develop a novel discrete-time Koopman Operator (KO) formulation that embeds domain information into the structure of the KO to learn high-fidelity approximations of the generator dynamics. Using the KO approximation, the DED problem can be reformulated as a computationally tractable linear program (abbreviated DED-KO). We demonstrate the high solution quality and computational-time savings of the DED-KO model over the original DED formulation on a 9-bus test system.

King, Ethan↗

Correlated Ion Transport Governed by Dynamic Local Structure in High Concentration and Localized High Concentration Electrolytes

Understanding the dynamics of cluster formation and network percolation provides the mechanistic link between microscopic solvation structure and transport in concentrated electrolytes, including localized high-concentration electrolytes (LHCEs). Although recent studies have shown LHCEs to form micelle-like aggregates at specific compositions, a quantitative understanding of how solvation structures and transport properties depend on salt–solvent–diluent ratios remains limited. Here, we integrate molecular dynamics with Onsager transport analyses to chart the evolution of solvation microstructure and associated ionic transport in LiFSI/DMC/TTE, achieving good agreement with experimental conductivities across composition. We show that micelle formation arises from a dynamic instability of the cation–anion network, and that network percolation is the primary determinant of conductivity. Two compositional thresholds emerge: A critical network concentration (CNC) and a critical micelle concentration (CMC) that delineate transitions from extended percolating networks to micelle-like clusters and then to fragments. These structural transitions rationalize the nonintuitive conductivity decrease at intermediate dilution despite monotonically decreasing viscosity and provide composition-level design rules for LHCEs.

Mohanakrishnan, Rohith Srinivaas [University of Ca↗

Water transport through monolayer fullerene membrane

Water transport through nanoporous materials is important in water treatment, desalination, and nanofiltration. Two-dimensional (2D) membranes such as porous graphene have been explored for high-permeance water transport. However, water transport through a new class of 2D membranes based on two-dimensional covalently linked fullerene monolayers has not been fully explored. Here we use classical molecular dynamics simulations to investigate both vapor and liquid water transport through a monolayer fullerene membrane. We find that a quasi-tetragonal phase fullerene membrane possesses the right pore size and geometry that allows fast water vapor transport (∼ 50 g m −2 day −1 Pa −1 ) and water liquid transport (∼ 2.0 g m −2 day −1 Pa −1 ). Furthermore, simulation of sea water transport through the fullerene membrane shows 100 % salt rejection. The much faster vapor transport rate is attributed to the funnel-shaped pore and the optimal size that allows free rotation of water molecules permeating through, while the slower liquid transport is due to the need to desolvate a water molecule to break its hydrogen-bond network across the hydrophobic pore. This work shows the great potential of using monolayer fullerene membranes as 2D membranes for fast and selective water transport.

Desalination↗

Dynamic Communication Resource Negotiations

Today's advanced network management systems can automate many aspects of the tactical networking operations within a military domain. However, automation of joint and coalition tactical networking across multiple domains remains challenging. Due to potentially conflicting goals and priorities, human agreement is often required before implementation into the network operations. This is further complicated by incompatible network management systems and security policies, rendering it difficult to implement automatic network management, thus requiring manual human intervention to the communication protocols used at various network routers and endpoints. This process of manual human intervention is tedious, error-prone, and slow. In order to facilitate a better solution, we are pursuing a technology which makes network management automated, reliable, and fast. Automating the negotiation of the common network communication parameters between different parties is the subject of this paper. We present the technology that enables inter-force dynamic communication resource negotiations to enable ad-hoc inter-operation in the field between force domains, without pre-planning. It also will enable a dynamic response to changing conditions within the area of operations. Our solution enables the rapid blending of intra-domain policies so that the forces involved are able to inter-operate effectively without overwhelming each other's networks with in-appropriate or un-warranted traffic. It will evaluate the policy rules and configuration data for each of the domains, then generate a compatible inter-domain policy and configuration that will update the gateway systems between the two domains.

policy negotiation↗

Spatiotemporal Characteristics and Propagation of Summer Extreme Precipitation Events over United States: A Complex Network Analysis

Complex Network (CN) is a graph-theory based depiction of relation shared by various elements of a complex-dynamical system such as the atmosphere. Here we applied the concept of CN to understand the directionality and topological structure of summer extreme precipitation events (SEPEs) over the conterminous United States (CONUS). The SEPEs are calculated based on the 95th percentile daily rainfall at 0.5ox0.5o spatial resolution for CONUS to investigate the multi-dimensional characteristics of precipitation extremes. The derived CN coefficients (e.g., betweenness centrality, clustering coefficient, orientation, and network divergence) reveal important structural and dynamical information about the topology of the SEPEs and improve understanding of the dominant meteorological patterns. The initiation and propagation of SEPEs from the source-zones to the sink-zones are identified. The SEPEs are influenced by topography, dominant wind patterns, and moisture sources in terms of their topological structure and spatial dynamics.

Mondal, Somnath↗

A comparison of probabilistic generative frameworks for molecular simulations

Generative artificial intelligence is now a widely used tool in molecular science. Despite the popularity of probabilistic generative models, numerical experiments benchmarking their performance on molecular data are lacking. Here, in this work, we introduce and explain several classes of generative models, broadly sorted into two categories: flow-based models and diffusion models. We select three representative models: neural spline flows, conditional flow matching, and denoising diffusion probabilistic models, and examine their accuracy, computational cost, and generation speed across datasets with tunable dimensionality, complexity, and modal asymmetry. Our findings are varied, with no one framework being the best for all purposes. In a nutshell, (i) neural spline flows do best at capturing mode asymmetry present in low-dimensional data, (ii) conditional flow matching outperforms other models for high-dimensional data with low complexity, and (iii) denoising diffusion probabilistic models appear the best for low-dimensional data with high complexity. Our datasets include a Gaussian mixture model and the dihedral torsion angle distribution of the Aib9 peptide, generated via a molecular dynamics simulation. We hope our taxonomy of probabilistic generative frameworks and numerical results may guide model selection for a wide range of molecular tasks.

Artificial intelligence↗

A divide-conquer-recombine algorithmic paradigm for large spatiotemporal quantum molecular dynamics simulations

We introduce an extension of the divide-and-conquer (DC) algorithmic paradigm called divide-conquer-recombine (DCR) to perform large quantum molecular dynamics (QMD) simulations on massively parallel supercomputers, in which interatomic forces are computed quantum mechanically in the framework of density functional theory (DFT). In DCR, the DC phase constructs globally informed, overlapping local-domain solutions, which in the recombine phase are synthesized into a global solution encompassing large spatiotemporal scales. For the DC phase, we design a lean divide-and-conquer (LDC) DFT algorithm, which significantly reduces the prefactor of the O(N) computational cost for N electrons by applying a density-adaptive boundary condition at the peripheries of the DC domains. Our globally scalable and locally efficient solver is based on a hybrid real-reciprocal space approach that combines: (1) a highly scalable real-space multigrid to represent the global charge density; and (2) a numerically efficient plane-wave basis for local electronic wave functions and charge density within each domain. Hybrid space-band decomposition is used to implement the LDC-DFT algorithm on parallel computers. A benchmark test on an IBM Blue Gene/Q computer exhibits an isogranular parallel efficiency of 0.984 on 786 432 cores for a 50.3 × 10{sup 6}-atom SiC system. As a test of production runs, LDC-DFT-based QMD simulation involving 16 661 atoms is performed on the Blue Gene/Q to study on-demand production of hydrogen gas from water using LiAl alloy particles. As an example of the recombine phase, LDC-DFT electronic structures are used as a basis set to describe global photoexcitation dynamics with nonadiabatic QMD (NAQMD) and kinetic Monte Carlo (KMC) methods. The NAQMD simulations are based on the linear response time-dependent density functional theory to describe electronic excited states and a surface-hopping approach to describe transitions between the excited states. A series of techniques are employed for efficiently calculating the long-range exact exchange correction and excited-state forces. The NAQMD trajectories are analyzed to extract the rates of various excitonic processes, which are then used in KMC simulation to study the dynamics of the global exciton flow network. This has allowed the study of large-scale photoexcitation dynamics in 6400-atom amorphous molecular solid, reaching the experimental time scales.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A deep learning enabler for nonintrusive reduced order modeling of fluid flows

Here in this paper, we introduce a modular deep neural network (DNN) framework for data-driven reduced order modeling of dynamical systems relevant to fluid flows. We propose various DNN architectures which numerically predict evolution of dynamical systems by learning from either using discrete state or slope information of the system. Our approach has been demonstrated using both residual formula and backward difference scheme formulas. However, it can be easily generalized into many different numerical schemes as well. We give a demonstration of our framework for three examples: (i) Kraichnan-Orszag system, an illustrative coupled nonlinear ordinary differential equation, (ii) Lorenz system exhibiting chaotic behavior, and (iii) a nonintrusive model order reduction framework for the two-dimensional Boussinesq equations with a differentially heated cavity flow setup at various Rayleigh numbers. Using only snapshots of state variables at discrete time instances, our data-driven approach can be considered truly nonintrusive since any prior information about the underlying governing equations is not required for generating the reduced order model. Our a posteriori analysis shows that the proposed data-driven approach is remarkably accurate and can be used as a robust predictive tool for nonintrusive model order reduction of complex fluid flows.

42 ENGINEERING↗

Ultrafast perturbation of magnetic domains by optical pumping in a ferromagnetic multilayer

Ultrafast optical pumping of spatially nonuniform magnetic textures is known to induce far-from-equilibrium spin transport effects. Here, we use ultrafast x-ray diffraction with unprecedented dynamic range to study the laser-induced dynamics of labyrinth domain networks in ferromagnetic CoFe/Ni multilayers. We detected azimuthally isotropic, odd order, magnetic diffraction rings up to fifth order. The amplitudes of all three diffraction rings quench to different degrees within 1.6 ps. In addition, all three of the detected diffraction rings both broaden by 15% and radially contract by 6% during the quench process. We are able to rigorously quantify a 31% ultrafast broadening of the domain walls via Fourier analysis of the order-dependent quenching of the three detected diffraction rings. Here, the broadening of the diffraction rings is interpreted as a reduction in the domain coherence length, but the shift in the ring radius, while unambiguous in its occurrence, remains unexplained. In particular, we demonstrate that a radial shift explained by domain-wall broadening can be ruled out. With the unprecedented dynamic range of our data, our results provide convincing evidence that labyrinth domain structures are spatially perturbed at ultrafast speeds under far-from-equilibrium conditions, albeit the mechanism inducing the perturbations remains yet to be clarified.

36 MATERIALS SCIENCE↗

Searching for correlations between vibrational spectral features and structural parameters of silicate glass network

Infrared (IR) and Raman spectroscopic features of silicate glasses are usually interpreted based on the analogy with those of smaller molecules, molecular clusters, or crystalline counterparts; this study tests the accuracy and validity of these widely cited peak assignment schemes by comparing vibrational spectral features with bond parameters of the glass network created by molecular dynamics (MD) simulations. A series of sodium silicate glasses with compositions of [Na 2 O] x [Al 2 O 3 ] 2 [SiO 2 ] 98- x with x = 7, 12, 17, and 22 were synthesized and analyzed with IR and Raman. A silica glass substrate and a crystalline quartz were also analyzed for comparison. Glass structures with the same compositions were generated with MD simulations using three types of potentials: fixed partial charge pairwise (Teter), partial diffuse charge potential (MGFF), and bond order-based charge transfer potential (ReaxFF). The comparison of simulated and experimental IR spectra showed that, among these three potentials tested, ReaxFF reproduces the concentration dependence of spectral features closest to the experimentally observed trend. Hence, the bond length and angle distributions as well as Si– Q n species and ring size distributions of silica and sodium silicate glasses were obtained from ReaxFF-MD simulations and further compared with the peak assignment or deconvolution schemes—which have been widely used since 1970s and 1980s—(a) correlation between the IR peak position in the Si–O stretch region (1050-1120 cm -1 ) and the Si–O–Si bond angle; (b) deconvolution of the Raman bands in the Si–O stretch region with the Q n speciation; and (c) assignment of the Raman bands in the 420-600 cm -1 region to the bending modes of (SiO) n rings with different sizes (typically, n = 3-6). The comparisons showed that none of these widely used methods is congruent with the bond parameters or structures of silicate glass networks produced via ReaxFF-MD simulations. This result invokes that the adequacy of these spectral interpretation methods must be questioned. Alternative interpretations are proposed, which are to be tested independently in future studies.

36 MATERIALS SCIENCE↗

Learning stochastic dynamics and predicting emergent behavior using transformers

We show that a neural network originally designed for language processing can learn the dynamical rules of a stochastic system by observation of a single dynamical trajectory of the system, and can accurately predict its emergent behavior under conditions not observed during training. We consider a lattice model of active matter undergoing continuous-time Monte Carlo dynamics, simulated at a density at which its steady state comprises small, dispersed clusters. We train a neural network called a transformer on a single trajectory of the model. The transformer, which we show has the capacity to represent dynamical rules that are numerous and nonlocal, learns that the dynamics of this model consists of a small number of processes. Forward-propagated trajectories of the trained transformer, at densities not encountered during training, exhibit motility-induced phase separation and so predict the existence of a nonequilibrium phase transition. Transformers have the flexibility to learn dynamical rules from observation without explicit enumeration of rates or coarse-graining of configuration space, and so the procedure used here can be applied to a wide range of physical systems, including those with large and complex dynamical generators.

97 MATHEMATICS AND COMPUTING↗

RAM as a Network Managed Resource

This paper describes an architecture for and several application examples of using a dynamically allocable RAM pool over the network as part of a deep memory hierarchy. We present four different use cases, including in situ analysis, machine learning, quantum chemistry simulations, and virtualization. In each use case, we modified or implemented software to use a network RAM pool, and then evaluated the performance. The cases of in situ analysis, machine learning, and virtualization demonstrated good performance. While the quantum chemistry experiments exhibited an average slowdown of 53% for all runs, including those where resources were clearly oversubscribed, the scalability results showed promise.

Allcock, William↗

Efficient Scalable Contact Network Generation from Population Data

Modeling the contacts among a population is critical to understanding the dynamics of a disease outbreak. Contact networks, where nodes are individuals and edges are contacts among them, are used to represent these complex individual-level interactions. In this work, we are given the daily activity schedules of an urban population that represent the activity location and time of individuals in a population during a single twenty four hour period over multiple days. Using collocation to determine contact between individuals, our goal is to extract hourly contact networks from large-scale activity data. We improve upon the existing adjacency matrix-based method by implementing our custom sparse matrix multiplication algorithm. Starting with a Python implementation, we achieve a 1600x speed up in the computation with a fast custom designed sparse matrix multiplier algorithm implemented in the C++ language. This work is central to future parallel designs of the problem.

97 MATHEMATICS AND COMPUTING↗

Measuring, Predicting and Visualizing Short-Term Change in Word Representation and Usage in VKontakte Network

Language in social media is extremely dynamic: new concepts emerge, trend and disappear, while the meaning of existing concepts can fluctuate over time. This work addresses a novel task of measuring and predicting meaning shift – context or semantic representation change from surface level dynamics e.g., word frequencies observed in social media streams. We study the relationship between language dynamics and short-term context change on a corpus of VKontakte posts collected during the Russia-Ukraine crisis in 2014 – 2015. We train a neural network model to predict short-term shifts in meaning from previous meaning as well as word dynamics. We demonstrate that short-term representation shift can be accurately predicted up to several weeks in advance. Moreover, we visualize this short-term context shift for the example words and demonstrate the practical side of our approach to discover and track meaning of newly emerging terms in social media during crises.

distributional semantics, word embeddings, social ↗

Quantum Time Dynamics Mediated by the Yang–Baxter Equation and Artificial Neural Networks

Quantum computing shows great potential, but errors pose a significant challenge. This study explores new strategies for mitigating quantum errors using artificial neural networks (ANNs) and the Yang–Baxter equation (YBE). Unlike traditional error mitigation methods, which are computationally intensive, we investigate artificial error mitigation. We developed a novel method that combines ANNs for noise mitigation combined with the YBE to generate noisy data. This approach effectively reduces noise in quantum simulations, enhancing the accuracy of the results. The YBE rigorously preserves quantum correlations and symmetries in spin chain simulations in certain classes of integrable lattice models, enabling effective compression of quantum circuits while retaining linear scalability with the number of qubits. This compression facilitates both full and partial implementations, allowing the generation of noisy quantum data on hardware alongside noiseless simulations using classical platforms. By introducing controlled noise through the YBE, we enhance the data set for error mitigation. We train an ANN model on partial data from quantum simulations, demonstrating its effectiveness in mitigating errors in time-evolving quantum states, providing a scalable framework to enhance quantum computation fidelity, particularly in noisy intermediate-scale quantum (NISQ) systems. We demonstrate the efficacy of this approach by performing quantum time dynamics simulations using the Heisenberg XY Hamiltonian on real quantum devices.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum dynamics of cosmological particle production: interacting quantum field theories with matrix product states

Understanding real-time dynamics of interacting quantum fields in curved space-time remains a major theoretical challenge. We employ tensor network methods to study such dynamics using interacting scalar and gauge theories in 1+1 spacetime dimensions, subject to a quench modeling a homogeneously expanding gravitational background. The models considered are the scalar λϕ 4 theory and the Schwinger model, i.e. a Dirac fermion coupled to a U(1) gauge field which is equivalent via bosonization to a scalar field with a cosine self-interaction. In the free scalar limit, both theories reproduce known analytical results, providing a nontrivial numerical validation of bosonization in curved spacetime for the Schwinger model. Our central finding is that self-interactions lead to a suppression of gravitational particle production compared to the free-field case, as evidenced by two-point functions and the spectra of produced particles. We further examine the behavior of entanglement generation and find that interactions suppress entanglement growth in the λϕ 4 theory, while in the Schwinger model, the interplay between suppressed particle production and enhanced inter-particle correlations leads to more complex entanglement behavior. Our results pave the way for further explorations of nonperturbative quantum real-time dynamics of interacting scalar and gauge theories in arbitrary gravitational backgrounds.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗