Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 667 records · Page 37

Enhancing Power Distribution System Resilience with Fusion-GNN: A Dynamic Graph Representation Learning Approach

This paper explores the applications of Fusion Graph Neural Network (FuGNN) on power distribution systems. FuGNN effectively models dynamic networks with evolving topology and features. Applied to power system network reconfiguration, FuGNN demonstrates its feasibility in optimizing switch configurations to minimize unserved loads and operational costs during extreme events. Additionally, FuGNN supports various downstream tasks, such as node feature prediction, further enhancing its versatility and applicability in power system resilience.

Liu, Boming↗

Physics-based, neural network force fields for reactive molecular dynamics: Investigation of carbene formation from [EMIM + ][OAc - ]

Reactive molecular dynamics simulations enable detailed understanding of solvent effects on chemical reaction mechanisms and reaction rates. While classical molecular dynamics using reactive force fields allows significantly longer simulation time scales and larger system sizes compared with ab initio molecular dynamics, constructing reactive force fields is a difficult and complex task. In this work, we describe a general approach following the Empirical Valence Bond (EVB) framework for constructing ab initio reactive force fields for condensed phase simulations by combining physics-based methods with neural networks (PB/NN). The physics-based terms ensure correct asymptotic behavior of electrostatic, polarization, and dispersion interactions, and are compatible with existing solvent force fields. Neural networks are utilized for versatile description of short-range orbital interactions within the transition state region, and accurate rendering of vibrational motion of the reacting complex. Herein, we demonstrate our methodology for a simple deprotonation reaction of the 1-ethyl-3-methylimidazolium (EMIM+) cation with acetate to form 1-ethyl- 3-methylimidazol-2-ylidene and acetic acid. Our PB/NN force field exhibits ~ 1 kJ/mol MAE accuracy within the transition state region for the gas-phase complex. To characterize solvent modulation of the reaction profile, we compute potentials of mean force (PMFs) for the gas-phase reaction as well as the reaction within a four ion cluster, and benchmark against ab initio molecular dynamics simulations. We find that the surrounding ionic environment significantly destabilizes formation of the carbene product, and we show that this effect is accurately captured by the reactive force field. By construction, the PB/NN potential may be directly employed for simulations of other solvents/chemical environments without additional parameterization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Controlling the self-organizing dynamics in a sandpile model on complex networks by failure tolerance

In this paper, we propose a strategy to control the self-organizing dynamics of the Bak-Tang-Wiesenfeld (BTW) sandpile model on complex networks by allowing some degree of failure tolerance for the nodes and introducing additional active dissipation while taking the risk of possible node damage. We show that the probability for large cascades significantly increases or decreases respectively when the risk for node damage outweighs the active dissipation and when the active dissipation outweighs the risk for node damage. By considering the potential additional risk from node damage, a non-trivial optimal active dissipation control strategy which minimizes the total cost in the system can be obtained. Under some conditions the introduced control strategy can decrease the total cost in the system compared to the uncontrolled model. Moreover, when the probability of damaging a node experiencing failure tolerance is greater than the critical value, then no matter how successful the active dissipation control is, the total cost of the system will have to increase. This critical damage probability can be used as an indicator of the robustness of a network or system. Copyright (C) EPLA, 2015

Qi, Junjian↗

Water-anion hydrogen bonding dynamics: Ultrafast IR experiments and simulations

Many of water’s remarkable properties arise from its tendency to form an intricate and robust hydrogen bond network. Understanding the dynamics that govern this network is fundamental to elucidating the behavior of pure water and water in biological and physical systems. In ultrafast nonlinear infrared experiments, the accessible time scales are limited by water’s rapid vibrational relaxation (1.8 ps for dilute HOD in H 2 O), precluding interrogation of slow hydrogen bond evolution in non-bulk systems. Here in this paper, hydrogen bonding dynamics in bulk D 2 O were studied from the perspective of the much longer lived (36.2 ps) CN stretch mode of selenocyanate (SeCN-) using polarization selective pump-probe (PSPP) experiments, two-dimensional infrared (2D IR) vibrational echo spectroscopy, and molecular dynamics simulations. The simulations make use of the empirical frequency mapping approach, applied to SeCN - for the first time. The PSPP experiments and simulations show that the orientational correlation function decays via fast (2.0 ps) restricted angular diffusion (wobbling-in-a-cone) and complete orientational diffusive randomization (4.5 ps). Spectral diffusion, quantified in terms of the frequency-frequency correlation function, occurs on two time scales. The initial 0.6 ps time scale is attributed to small length and angle fluctuations of the hydrogen bonds between water and SeCN - . The second 1.4 ps measured time scale, identical to that for HOD in bulk D 2 O, reports on the collective reorganization of the water hydrogen bond network around the anion. Lastly, the experiments and simulations provide details of the anion-water hydrogen bonding and demonstrate that SeCN- is a reliable vibrational probe of the ultrafast spectroscopy of water.

14 SOLAR ENERGY↗

Reduced basis approximations of parameterized dynamical partial differential equations via neural networks

Projection-based reduced order models are effective at approximating parameter-dependent differential equations that are parametrically separable. When parametric separability is not satisfied, which occurs in both linear and nonlinear problems, projection-based methods fail to adequately reduce the computational complexity. Devising alternative reduced order models is crucial for obtaining efficient and accurate approximations to expensive high-fidelity models. In this work, we develop a timestepping procedure for dynamical parameter-dependent problems, in which a neural-network is trained to propagate the coefficients of a reduced basis expansion. This results in an online stage with a computational cost independent of the size of the underlying problem. Here, we demonstrate our method on several parabolic partial differential equations, including a problem that is not parametrically separable.

97 MATHEMATICS AND COMPUTING↗

Discrete dislocation dynamics for crystal RVEs. Part 1: Periodic network kinematics

A novel implementation of the dislocation flux boundary condition in discrete dislocation dynamics is presented. The continuity of the individual dislocation loops in a periodic representative crystal volume (RVE) is enforced across the boundary of the RVE with the help of a dual topological description for representing dislocation line kinematics in two equivalent spaces representing the deforming crystal, the RVE and the unbounded crystal spaces. The former describes the motion of the dislocations in the simulated crystal RVE whereas the latter represents the motion of dislocations in an infinite space containing all replicas of the RVE. A mapping between the two spaces forms the basis of the implementation of flux boundary condition. The implementation details are discussed in the context of statistical homogeneity of bulk crystals undergoing macroscopically homogeneous plastic deformation. In this case, the boundary nodes associated with dislocation segments bear no relevance in the motion of the dislocations. Finally, some test cases are presented and discussed to establish the proposed approach.

42 ENGINEERING↗

Materials genome innovation for computational software (magics) center

Functional layered material (LM) architectures will dominate nanomaterials science in this century. We have developed theory, modeling, simulation, and software and data tools that enhance understanding and AI guide synthesis, enable characterization of complex structures, and improve capabilities in the predictive design and growth of LMs. Research at the Center has focused on: Computational synthesis and characterization: AI guided synthesis and experimental synthesis of stacked LMs with tailored properties via optimized chemical vapor deposition (CVD) growth and liquid-phase exfoliation; study defects, edges, grain boundaries, wrinkling of atomic layers and their effects on chemical, mechanical, electrical, and optical properties. Far-from-equilibrium processes: Joint experimental and simulation based probe of electronic processes with NAQMD and ultrafast X-ray free-electron laser (XFEL) and ultrafast electron diffraction (UED) facilities at Stanford. Experimentally validate NAQMD by ultrafast electron diffraction and X-ray spectroscopy studies of structural and excited state dynamics, shape fluctuations, and phonon dynamics. Scalable software: Simulation engines for desktop-to-exascale platforms using low-overhead, linear-scaling QMD algorithms; divide-conquer-recombine NAQMD with electronic excitations; extended-Lagrangian reactive molecular dynamics (RMD), machine learning (ML) based neural-network quantum molecular dynamics (NNQMD), and super-state accelerated molecular dynamics (AMD) and kinetic Monte Carlo codes; thermal and electrical transport software; and design 3D architectures of LMs with desired functionality using scalable software. Distribution of software and data, and training: Software and simulation-experimental data generated within the Center are distributed to the materials science community via Berkeley Materials Project (MP) framework. We have also organized three workshops for software distribution and training at USC (Nov. 2017, Mar. 2018) and Gaithersburg, MD (Nov. 2018) to train researchers, with the last one in focused on underrepresented groups, in collaboration with Howard University which is one of the largest HBCUs. The Center supported a total of 46 personnel and 6 undergraduate students. These include 14 faculty, 11 postdoctoral research associates, 20 graduate research assistants, and mentored 6 undergraduate students. This resulted in the publications of 63 research papers that include 46 publications on Reactive and Quantum Dynamics Simulations, 13 publications on Machine Learning for Quantum Materials, and 4 publications on Quantum Computing.

2D Materials↗

Terminal Attractors In Neural Networks

Neural networks made to "learn" faster. Report presents theoretical study of terminal attractors in neural networks. Includes systematic analysis of applications to activation dynamics of neural networks.

Zak, Michail A.↗

Flexible AI Models for Grid Resilience

The rapid growth in size and complexity of artificial intelligence (AI) and machine learning (ML) models has led to increased energy demands, posing a threat to the reliability of the existing power grid. This project addresses the challenge of highly intermittent and energy-intensive inference workloads by (1) developing fidelity-adaptive neural networks capable of dynamic response to grid conditions and (2) integrating these networks with power flow simulations to assess their impact on power grid reliability. We will explore both top-down and bottom-up approaches to create hierarchies of submodels that provide a controlled trade-off between power draw and prediction accuracy. The top-down method utilizes NN pruning to reduce a flagship model into progressively smaller, energy-efficient variants. The bottom-up approach employs geometrically principled weight setting strategies to construct depth-efficient models from the ground up. A real-time hardware-in-the-loop (HIL) platform will be developed to simulate a scaled AC power grid, integrating live AI workload power draw and enabling dynamic model switching in response to grid feedback. This work will provide a novel framework for evaluating the impact of flexible AI/ML workloads on grid performance and establish new methodologies for energy-aware computing in data centers. The outcomes will demonstrate that adaptive AI/ML can play a critical role in improving grid stability while advancing NREL's leadership in energy-efficient computing research.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Multi-Domain Routing in Delay Tolerant Networks

The goal of Delay Tolerant Networking (DTN) is to provide the missing ingredient for the ever-growing collection of communicating nodes in our solar system to become a Solar System Internet (SSI). Great strides have been made in modeling particular types of DTNs, such as schedule- or discovery-based. Now, analogously to the Internet, these smaller DTNs can be considered routing domains which must be stitched together to form the overall SSI. In this paper, we propose a framework for cross-domain routing in DTNs as well as methodologies for detecting these sub-domains. Example time-varying networks are given to demonstrate the techniques proposed. A basic component is the mathematical theory of sheaves, which unifies the underlying model of DTN routing algorithms, by giving rise to routing sheaves – these can be defined for the dynamic and scheduled networks as noted above, and can also be used to define the interfaces between these domains in order to route across them. An immediate application would be routing across discovery-based networks connected by scheduled networks. These DTN subdomains remain elusive, however, and need to become well-defined and properly sized for tractable computability. In particular, a balance must be determined between areas that are too large (i.e. large matrix computations) versus areas that are too small (i.e. “many” single-noded domains). Moreover, the connections between the domains should, at least locally, be chosen to optimize data flow and connectivity: we address this in three ways. First, tools from persistent homology are given to understand underlying structures, reminiscent of hierarchies in the Internet Protocol (IP) addressing. Second, we construct a notion of temporal graph curvature based on network geometry to analyze flows induced by dynamical processes on these networks. Finally, Schrodinger Bridges, a tool arising from statistical physics, are proposed as a method of constructing flows on time-evolving networks with desirable properties such as speed, robustness, and load sensitivity. We construct an approach to temporal hypergraphs to simultaneously model unicast, multicast, and broadcast, using the language of scheme theory, and then consider DTN network coding as a way to achieve network-level computation and organization. The paper concludes with a discussion and ideas for future work.

Alan Hylton↗

Parallel replica dynamics method for bistable stochastic reaction networks: Simulation and sensitivity analysis

Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed

97 MATHEMATICS AND COMPUTING↗

Regression-Based Analytics for Response Dynamics of SDN Solutions and Components

We consider Software-Defined Network (SDN) solutions that dynamically setup and teardown connections, and also their response dynamics of connectivity and TCP throughput. There is a wide variety of choices for controllers, switches, andsoftware modules, and objective analytics of measurements are needed to compare the response dynamics of solutions based on their combinations. Throughput and ping measurements during connection changes contain significant statistical variations due to the complexities of controllers, northbound scripts, and network devices. We propose analytical methods to estimate response regression functions, which provide a rigorous and objective comparison of different SDN solutions and their components, namely, controllers, switches, and OpenFlow versions. We apply this approach in two scenarios: (a) switching of long-haul connections emulated in hardware by ANUE devices over a testbed consisting of HP and Cisco switches, and (b) multi-site science infrastructure emulated using VMs and Mininet. The results provide useful practical insights including: (i) the dpctl method responds seconds faster than the OpenDayLight (ODL) method on average under OpenFlow 1.0, but performs similar to ODL under OpenFlow 1.3, and (ii) the ping response of dpctl is about 0.6 sec faster than ODL for the second scenario.

97 MATHEMATICS AND COMPUTING↗

Secure Storage Architectures

The purpose of this report is to clarify the challenges associated with storage for secure enclaves. The major focus areas for the report are: - review of relevant parallel filesystem technologies to identify assets and gaps; - review of filesystem isolation/protection mechanisms, to include native filesystem capabilities and auxiliary/layered techniques; - definition of storage architectures that can be used for customizable compute enclaves (i.e., clarification of use-cases that must be supported for shared storage scenarios); - investigate vendor products related to secure storage. This study provides technical details on the storage and filesystem used for HPC with particular attention on elements that contribute to creating secure storage. We outline the pieces for a a shared storage architecture that balances protection and performance by leveraging the isolation capabilities available in filesystems and virtualization technologies to maintain the integrity of the data. Key Points: There are a few existing and in-progress protection features in Lustre related to secure storage, which are discussed in (Chapter 3.1). These include authentication capabilities like GSSAPI/Kerberos and the in-progress work for GSSAPI/Host-keys. The GPFS filesystem provides native support for encryption, which is not directly available in Lustre. Additionally, GPFS includes authentication/authorization mechanisms for inter-cluster sharing of filesystems (Chapter 3.2). The limitations of key importance for secure storage/filesystems are: (i) restricting sub-tree mounts for parallel filesystem (which is not directly supported in Lustre or GPFS), and (ii) segregation of hosts on the storage network and practical complications with dynamic additions to the storage network, e.g., LNET. A challenge for VM based use cases will be to provide efficient IO forwarding of the parallel filessytem from the host to the guest (VM). There are promising options like para-virtualized filesystems to help with this issue, which are a particular instances of the more general challenge of efficient host/guest IO that is the focus of interfaces like virtio. A collection of bridging technologies have been identified in Chapter 4, which can be helpful to overcome the limitations and challenges of supporting efficient storage for secure enclaves. The synthesis of native filesystem security mechanisms and bridging technologies led to an isolation-centric storage architecture that is proposed in Chapter 5, which leverages isolation mechanisms from different layers to facilitate secure storage for an enclave. Recommendations: The following highlights recommendations from the investigations done thus far. - The Lustre filesystem offers excellent performance but does not support some security related features, e.g., encryption, that are included in GPFS. If encryption is of paramount importance, then GPFS may be a more suitable choice. - There are several possible Lustre related enhancements that may provide functionality of use for secure-enclaves. However, since these features are not currently integrated, the use of Lustre as a secure storage system may require more direct involvement (support). (*The network that connects the storage subsystem and users, e.g., Lustre s LNET.) - The use of OpenStack with GPFS will be more streamlined than with Lustre, as there are available drivers for GPFS. - The Manilla project offers Filesystem as a Service for OpenStack and is worth further investigation. Manilla has some support for GPFS. - The proposed Lustre enhancement of Dynamic-LNET should be further investigated to provide more dynamic changes to the storage network which could be used to isolate hosts and their tenants. - The Linux namespaces offer a good solution for creating efficient restrictions to shared HPC filesystems. However, we still need to conduct a thorough round of storage/filesystem benchmarks. - Vendor products should be more closely reviewed, possibly to include evaluation of performance/protection of select products. (Note, we are investigation the option of evaluating equipment from Seagate/Xyratex.) Outline: The remainder of this report is structured as follows: - Section 1: Describes the growing importance of secure storage architectures and highlights some challenges for HPC. - Section 2: Provides background information on HPC storage architectures, relevant supporting technologies for secure storage and details on OpenStack components related to storage. Note, that background material on HPC storage architectures in this chapter can be skipped if the reader is already familiar with Lustre and GPFS. - Section 3: A review of protection mechanisms in two HPC filesystems; details about available isolation, authentication/authorization and performance capabilities are discussed. - Section 4: Describe technologies that can be used to bridge gaps in HPC storage and filesystems to facilitate...

Aderholdt, Ferrol↗

Artificial neural network potentials for mechanics and fracture dynamics of two-dimensional crystals **

Understanding the mechanics and failure of materials at the nanoscale is critical for their engineering and applications. The accurate atomistic modeling of brittle failure with crack propagation in covalent crystals requires a quantum mechanics-based description of individual bond-breaking events. Artificial neural network potentials (NNPs) have emerged to overcome the traditional, physics-based modeling tradeoff between accuracy and accessible time and length scales. Previous studies have shown successful applications of NNPs for describing the structure and dynamics of molecular systems and amorphous or liquid phases of materials. However, their application to deformation and failure processes in materials is still uncommon. In this study, we discuss the apparent limitations of NNPs for the description of deformation and fracture under loadings and propose a way to generate and select training data for their employment in simulations of deformation and fracture simulations of crystals. We applied the proposed approach to 2D crystalline graphene, utilizing the density-functional tight-binding method for more efficient and extensive data generation in place of density functional theory. Then, we explored how the data selection affects the accuracy of the developed artificial NNPs. It revealed that NNP’s reliability should not only be measured based on the total energy and atomic force comparisons for reference structures but also utilize comparisons for physical properties, e.g. stress–strain curves and geometric deformation. In sharp contrast to popular reactive bond order potentials, our optimized NNP predicts straight crack propagation in graphene along both armchair and zigzag (ZZ) lattice directions, as well as higher fracture toughness of ZZ edge direction. Our study provides significant insight into crack propagation mechanisms on atomic scales and highlights strategies for NNP developments of broader materials.

2D materials↗

Neural learning of constrained nonlinear transformations

Two issues that are fundamental to developing autonomous intelligent robots, namely, rudimentary learning capability and dexterous manipulation, are examined. A powerful neural learning formalism is introduced for addressing a large class of nonlinear mapping problems, including redundant manipulator inverse kinematics, commonly encountered during the design of real-time adaptive control mechanisms. Artificial neural networks with terminal attractor dynamics are used. The rapid network convergence resulting from the infinite local stability of these attractors allows the development of fast neural learning algorithms. Approaches to manipulator inverse kinematics are reviewed, the neurodynamics model is discussed, and the neural learning algorithm is presented.

Barhen, Jacob↗