Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 919 records · Page 51

High Energy Physics Network Requirements Review: Final Report, July 2024–December 2024

The world-class research infrastructure at the US Department of Energy (DOE) Office of Science (SC) provides the research community with premier observational, experimental, computational, and network capabilities. Each user facility is designed to provide unique capabilities to advance the core DOE mission in science and technology for its SC program to stimulate rich scientific discoveries and enhance its innovation ecosystem. Research communities gather and flourish around each user facility, bringing together new and enhanced perspectives. The continual reinvention of the practice of science — as users and staff forge novel approaches expressed in research workflows — unlocks new discoveries and propels scientific progress. Within this research ecosystem, the high-performance computing (HPC) and networking user facilities stewarded by the SC’s Advanced Scientific Computing Research (ASCR) program play a dynamic cross-cutting role, enabling complex workflows demanding high-performance data, networking, and computing solutions. The ASCR facilities enterprise seeks to understand and meet the needs and requirements across SC and DOE domain science programs and priority efforts, highlighted by the formal requirements review methodology. Between July and December 2024, the Energy Sciences Network (ESnet) and the Office of High Energy Physics (HEP) of the DOE-SC organized an ESnet requirements review of HEP-supported program activities. Preparation for these events included identification of key stakeholders: program and facility management, research groups, and technology providers. Each stakeholder group was asked to prepare formal case study documents about its relationship to the HEP program to build a complete understanding of the current, near-term, and long-term status, expectations, and processes that will support the science going forward.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Switched electrical networks and bilinear equations

State equations arising in the description of power processing systems are described. The role played by Lie groups and Lie algebras in characterizing the inherent dynamical features of these systems is outlined, and network examples are presented for illustration.

Wood, J. R.↗

Fluid System Stability Analysis Techniques

Fluid systems, or networks, consist of multiple components that work together to achieve some desired thermofluid state. For any generic application, this fluid state can be a combination of the fluid pressure, flow rate, enthalpy, or species concentration. Fluid system components, such as pumps and valves, are often governed by nonlinear differential equations, resulting in complex component-to-component interactions. System-level fluid network stability occurs when the flow through the system can maintain a steady-state solution in the presence of small perturbations, which depends on these component interactions. System instability, however, can go undetected until issues arise during integrated system testing. This presentation explores a method for system designers to think of the fluid network as an assembly of components, each with their own thermofluid surfaces of partial stability, called nullclines. The intersections of all nullclines yields system-level solutions, called equilibrium points. When designers define operating points, they are tuning system parameters so that these equilibrium points move to the desired location in the thermofluid state plane. However, linearization theory shows us that the dynamic behavior around these points can be unstable. The local stability of these equilibrium points can be assessed analytically with eigen-analysis, or numerically by propagating state-plane samples to construct a phase portrait. Investigating a phase portrait can help designers gain a qualitative understanding of a system’s dynamic performance. This understanding can then help inform requirement definitions, component selection, and operational procedures. This presentation includes an example of the phase portrait technique on a system featuring a centrifugal pump and a back-pressure regulator (BPR). Numerical modeling of this system suggests that equilibrium points on the left-hand side of the pump curve are dynamically unstable.

Fluid System↗

SIDDA: SInkhorn Dynamic Domain Adaptation for Image Classification

SInkhorn Dynamic Domain Adaptation (SIDDA) supplements the experiments presented in 2501.14048, SIDDA: SInkhorn Dynamic Domain Adaptation for Image Classification with Equivariant Neural Networks. SIDDA introduces a semi-supervised, automatic domain adaptation method that leverages Sinkhorn divergences to dynamically adjust the regularization in the optimal transport plan and the weighting between classification and domain adaptation loss terms during training.

Pandya, Sneh [Fermi National Accelerator Laborator↗

Evolution of Robustness in Growing Random Networks

Networks are widely used to model the interaction between individual dynamic systems. In many instances, the total number of units and interaction coupling are not fixed in time, and instead constantly evolve. In networks, this means that the number of nodes and edges both change over time. Various properties of coupled dynamic systems, such as their robustness against noise, essentially depend on the structure of the interaction network. Therefore, it is of considerable interest to predict how these properties are affected when the network grows as well as their relationship to the growth mechanism. Here, we focus on the time evolution of a network’s Kirchhoff index. We derive closed-form expressions for its variation in various scenarios, including the addition of both edges and nodes. For the latter case, we investigate the evolution where single nodes with one or two edges connecting to existing nodes are added recursively to a network. In both cases, we derive the relations between the properties of the nodes to which the new node connects along with the global evolution of network robustness. In particular, we show how different scalings of the Kirchhoff index can be obtained as a function of the number of nodes. We illustrate and confirm this theory via numerical simulations of randomly growing networks.

97 MATHEMATICS AND COMPUTING↗

Causally‐Informed Deep Learning to Improve Climate Models and Projections

Abstract Climate models are essential to understand and project climate change, yet long‐standing biases and uncertainties in their projections remain. This is largely associated with the representation of subgrid‐scale processes, particularly clouds and convection. Deep learning can learn these subgrid‐scale processes from computationally expensive storm‐resolving models while retaining many features at a fraction of computational cost. Yet, climate simulations with embedded neural network parameterizations are still challenging and highly depend on the deep learning solution. This is likely associated with spurious non‐physical correlations learned by the neural networks due to the complexity of the physical dynamical system. Here, we show that the combination of causality with deep learning helps removing spurious correlations and optimizing the neural network algorithm. To resolve this, we apply a causal discovery method to unveil causal drivers in the set of input predictors of atmospheric subgrid‐scale processes of a superparameterized climate model in which deep convection is explicitly resolved. The resulting causally‐informed neural networks are coupled to the climate model, hence, replacing the superparameterization and radiation scheme. We show that the climate simulations with causally‐informed neural network parameterizations retain many convection‐related properties and accurately generate the climate of the original high‐resolution climate model, while retaining similar generalization capabilities to unseen climates compared to the non‐causal approach. The combination of causal discovery and deep learning is a new and promising approach that leads to stable and more trustworthy climate simulations and paves the way toward more physically‐based causal deep learning approaches also in other scientific disciplines.

Meteorology & Atmospheric Sciences↗

Robust Online Sequential RVFLNs for Data Modeling of Dynamic Time-Varying Systems with Application of an Ironmaking Blast Furnace

In a world where the increasing complexity of modern industrial processes brings difficulties for accurate mathematical modeling, taking advantage of data has become an efficient solution to complex dynamic process modeling issue. In this paper, we develop a novel robust online sequential version of random vector functional-link networks (RVFLNs) for data-driven modeling of dynamic time-varying system and applied it in a blast furnace (BF) ironmaking process. First, to overcome the time-varying dynamics of process and to enable the RVFLNs to learn online with avoiding data saturation, an improved online sequential version of RVFLNs (OS-RFVLNs) is first presented by online sequential learning with forgetting factor. This improved OS-RVFLNs algorithm is not only suitable for the real-time and large data transfer situation, but also can adjust the sensitivity of the algorithm to different samples with the help of the introduced forgetting factor. Second, since the output weights of the improved OS-RVFLNs as well as other RVFLNs algorithms are obtained by the least squares approach, a robustness problem may occur when the training dataset is contaminated with various outliers. To solve this problem, a Cauchy distribution weighted M-estimator is introduced to improve the robustness of the improved OS- RVFLNs. For this proposed robust OS-RVFLNs (R-OS- RVFLNs), since the weights of different outlier data are properly determined by the Cauchy distribution function, their corresponding contribution on modeling can be properly distinguished. Thus robust and better modeling results can be achieved. Experiments using actual industrial data of BF ironmaking process and comparative studies have demonstrated that the proposed method produces a better estimation accuracy and stronger robustness than other methods.

Blast furnace (BF), Modelling, Dynamic systems↗

Neural Network Approaches for Mobile Spectroscopic Gamma-Ray Source Detection

Artificial neural networks (ANNs) for performing spectroscopic gamma-ray source identification have been previously introduced, primarily for applications in controlled laboratory settings. To understand the utility of these methods in scenarios and environments more relevant to nuclear safety and security, this work examines the use of ANNs for mobile detection, which involves highly variable gamma-ray background, low signal-to-noise ratio measurements, and low false alarm rates. Simulated data from a 2” × 4” × 16” NaI(Tl) detector are used in this work for demonstrating these concepts, and the minimum detectable activity (MDA) is used as a performance metric in assessing model performance.In addition to examining simultaneous detection and identification, binary spectral anomaly detection using autoencoders is introduced in this work, and benchmarked using detection methods based on Non-negative Matrix Factorization (NMF) and Principal Component Analysis (PCA). On average, the autoencoder provides a 12% and 23% improvement over NMF- and PCA-based detection methods, respectively. Additionally, source identification using ANNs is extended to leverage temporal dynamics by means of recurrent neural networks, and these time-dependent models outperform their time-independent counterparts by 17% for the analysis examined here. The paper concludes with a discussion on tradeoffs between the ANN-based approaches and the benchmark methods examined here.

Bilton, Kyle J. (ORCID:0000000184553689)↗

XNsim: Internet-Enabled Collaborative Distributed Simulation via an Extensible Network

In this paper, the XNsim approach to achieve Internet-enabled, dynamically scalable collaborative distributed simulation capabilities is presented. With this approach, a complete simulation can be assembled from shared component subsystems written in different formats, that run on different computing platforms, with different sampling rates, in different geographic locations, and over singlelmultiple networks. The subsystems interact securely with each other via the Internet. Furthermore, the simulation topology can be dynamically modified. The distributed simulation uses a combination of hub-and-spoke and peer-topeer network topology. A proof-of-concept demonstrator is also presented. The XNsim demonstrator can be accessed at http://www.jsc.draver.corn/xn that hosts various examples of Internet enabled simulations.

Novotny, John↗

Generic, Sparse Tensor Core for Neural Networks

Sparse neural network attracts more attention for model compression, fast execution, and power reduction. The state-of-the-art designed sparse tensor core for structured and static sparsity, which did not support well for generic or dynamic sparsity. We design a sparse tensor core to support generic sparsity pruning with a novel hybrid and blocked sparse matrix storage format, HB-ELL, which saves computation and storage while keeping the most significant elements, as well as supporting dynamic sparsity for data flow in neural networks. We achieve better performance with preliminary results than the state-of- the-art on an NVIDIA GPU simulator.

Wu, Xiaolong↗

Simulating the Impact of Dynamic Rerouting on Metropolitan-scale Traffic Systems

The rapid introduction of mobile navigation aides that use real-time road network information to suggest alternate routes to drivers is making it more difficult for researchers and government transportation agencies to understand and predict the dynamics of congested transportation systems. Computer simulation is a key capability for these organizations to analyze hypothetical scenarios; however, the complexity of transportation systems makes it challenging for them to simulate very large geographical regions, such as multi-city metropolitan areas. In this article, we describe enhancements to the Mobiliti parallel traffic simulator to model dynamic rerouting behavior with the addition of vehicle controller actors and vehicle-to-controller reroute requests. The simulator is designed to support distributed-memory parallel execution using discrete event simulation and be scalable on high-performance computing platforms. We demonstrate the potential of the simulator by analyzing the impact of varying the population penetration rate of dynamic rerouting on the San Francisco Bay Area road network. Using high-performance parallel computing, we can simulate a day in the San Francisco Bay Area with 19 million vehicle trips with 50 percent dynamic rerouting penetration over a road network with 0.5 million nodes and 1 million links in less than three minutes. We present a sensitivity study on the dynamic rerouting parameters, discuss the simulator’s parallel scalability, and analyze system-level impacts of changing the dynamic rerouting penetration. Furthermore, we examine the varying effects on different functional classes and geographical regions and present a validation of the simulation results compared to real-world data.

97 MATHEMATICS AND COMPUTING↗

Accurate Consensus-based Distributed Averaging with Variable Time Delay in Support of Distributed Secondary Control Algorithms

We report that distributed secondary control has been widely used in hierarchical control structures, where multiple distributed generators (DGs) need to coordinate to regulate system voltage and frequency. In these systems, consensus algorithms determine the average of a group of dynamic states (e.g. voltages measured by a group of DGs). To be useful, consensus algorithms must be computationally efficient, stable and accurate. In practice, numerous practical implementation challenges significantly affect the consensus equilibrium. In this paper, we quantify the accuracy deviations of the distributed average observer algorithms proposed in the literature to demonstrate the problems with the state-of-the-art distributed averaging techniques. A novel approach is proposed that achieves accurate average tracking in the presence of time-varying communication delays among agents. In our implementation, time synchronization of all distributed controllers is enabled by a novel software platform, called Resilient Information Architecture Platform for the Smart Grid (RIAPS). The proposed distributed average observer is implemented on hardware controllers and its effectiveness is validated in a controller hardware-in-the-loop testbed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Structure and dynamics of $\mathrm{Fe_{90}}$$\mathrm{Si_3}$$\mathrm{O_7}$ liquids close to Earth's liquid core conditions

Using an artificial neural-network machine learning interatomic potential, we have performed molecular dynamics simulations to study the structure and dynamics of $\mathrm{Fe_{90}}$$\mathrm{Si_3}$$\mathrm{O_7}$ liquid close to the Earth's liquid core conditions. Here, the simulation results reveal that the short-range structural order (SRO) in the $\mathrm{Fe_{90}}$$\mathrm{Si_3}$$\mathrm{O_7}$ liquid is very strong. About 80% of the atoms are arranged in crystallinelike SRO motifs. In particular, ~ $70$% of Fe-centered clusters can be classified as either hexagonal-close-packed-like or icosahedrallike SRO motifs. The SRO clusters centered on Fe, Si, or O atoms are strongly intermixed and homogenously distributed throughout the liquid. The atomic structure of the liquid and the fractions of dominant SRO clusters are not sensitive to pressure/temperature used in the simulations except that the SRO of the O-centered clusters is enhanced close to inner core pressures. The O-diffusion coefficient is about two to three times larger than the Fe and Si ions and increases more rapidly in the deeper core regions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Low-temperature paddlewheel effect in glassy solid electrolytes

Glasses are promising electrolytes for use in solid-state batteries. Nevertheless, due to their amorphous structure, the mechanisms that underlie their ionic conductivity remain poorly understood. Here, ab initio molecular dynamics is used to characterize migration processes in the prototype glass, 75Li2S–25P2S5. Lithium migration occurs via a mechanism that combines concerted motion of lithium ions with large, quasi-permanent reorientations of PS4 3- anions. This latter effect, known as the ‘paddlewheel’ mechanism, is typically observed in high temperature crystalline polymorphs. In contrast to the behavior of crystalline materials, in the glass paddlewheel dynamics contribute to Lithium-ion mobility at room temperature. Paddlewheel contributions are confirmed by characterizing spatial, temporal, vibrational, and energetic correlations with Lithium motion. Furthermore, the dynamics in the glass differ from those in the stable crystalline analogue, γ-Li3PS4, where anion reorientations are negligible and ion mobility is reduced. These data imply that glasses containing complex anions, and in which covalent network formation is minimized, may exhibit paddlewheel dynamics at low temperature. Consequently, these systems may be fertile ground in the search for new solid electrolytes.

36 MATERIALS SCIENCE↗

Multiscale graph neural network autoencoders for interpretable scientific machine learning

The goal of this work is to address two limitations in autoencoder-based models: latent space interpretability and compatibility with unstructured meshes. This is accomplished here with the development of a novel graph neural network (GNN) autoencoding architecture with demonstrations on complex fluid flow applications. To address the first goal of interpretability, the GNN autoencoder achieves reduction in the number nodes in the encoding stage through an adaptive graph reduction procedure. Further, this reduction procedure essentially amounts to flowfieldconditioned node sampling and sensor identification, and produces interpretable latent graph representations tailored to the flowfield reconstruction task in the form of so-called masked fields. These masked fields allow the user to (a) visualize where in physical space a given latent graph is active, and (b) interpret the time-evolution of the latent graph connectivity in accordance with the time-evolution of unsteady flow features (e.g. recirculation zones, shear layers) in the domain. To address the goal of unstructured mesh compatibility, the autoencoding architecture utilizes a series of multi-scale message passing (MMP) layers, each of which models information exchange among node neighborhoods at various lengthscales. The MMP layer, which augments standard single-scale message passing with learnable coarsening operations, allows the decoder to more efficiently reconstruct the flowfield from the identified regions in the masked fields. Analysis of latent graphs produced by the autoencoder for various model settings are conducted using unstructured snapshot data sourced from large-eddy simulations in a backward-facing step (BFS) flow configuration with an OpenFOAM-based flow solver at high Reynolds numbers.

97 MATHEMATICS AND COMPUTING↗

Neural network potential for Zr–Rh system by machine learning

Zr–Rh metallic glass has enabled its many applications in vehicle parts, sports equipment and so on due to its outstanding performance in mechanical property, but the knowledge of the microstructure determining the superb mechanical property remains yet insufficient. Here, we develop a deep neural network potential of Zr–Rh system by using machine learning, which breaks the dilemma between the accuracy and efficiency in molecular dynamics simulations, and greatly improves the simulation scale in both space and time. Here, the results show that the structural features obtained from the neural network method are in good agreement with the cases in ab initio molecular dynamics simulations. Furthermore, we build a large model of 5400 atoms to explore the influences of simulated size and cooling rate on the melt-quenching process of Zr 77 Rh 23 . Our study lays a foundation for exploring the complex structures in amorphous Zr 77 Rh 23 , which is of great significance for the design and practical application.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Data Driven Online Learning of Power System Dynamics

With the advancement of sensing and communication in power networks, high-frequency real-time data from a power network can be used as a resource to develop better monitoring capabilities. In this work, a systematic approach based on data-driven operator theoretic methods involving Koopman operator is proposed for the online identification of power system dynamics. In particular, a new algorithm is provided, which unlike any previously existing algorithms, updates the Koopman operator iteratively as new data points are acquired. The proposed algorithm has three advantages: a) allows for real-time monitoring of the power system dynamics b) linear power system dynamics (this linear system is usually in a higher dimensional feature space and is not same as linearization of the underlying nonlinear dynamics) and c) computationally fast and less intensive when compared to the popular Extended Dynamic Mode Decomposition (EDMD) algorithm. The efficiency of the proposed algorithm is illustrated on an IEEE 9 bus system using synthetic data from the nonlinear model and on IEEE 39 bus system using synthetic data from the linearized model.

Sinha, Subhrajit↗

Transient disease dynamics across ecological scales

Analyses of transient dynamics are critical to understanding infectious disease transmission and persistence. Identifying and predicting transients across scales, from within-host to community-level patterns, plays an important role in combating ongoing epidemics and mitigating the risk of future outbreaks. Moreover, greater emphases on non-asymptotic processes will enable timely evaluations of wildlife and human diseases and lead to improved surveillance efforts, preventive responses, and intervention strategies. Here, we explore the contributions of transient analyses in recent models spanning the fields of epidemiology, movement ecology, and parasitology. In addition to their roles in predicting epidemic patterns and endemic outbreaks, we explore transients in the contexts of pathogen transmission, resistance, and avoidance at various scales of the ecological hierarchy. Examples illustrate how (i) transient movement dynamics at the individual host level can modify opportunities for transmission events over time; (ii) within-host energetic processes often lead to transient dynamics in immunity, pathogen load, and transmission potential; (iii) transient connectivity between discrete populations in response to environmental factors and outbreak dynamics can affect disease spread across spatial networks; and (iv) increasing species richness in a community can provide transient protection to individuals against infection. Ultimately, we suggest that transient analyses offer deeper insights and raise new, interdisciplinary questions for disease research, consequently broadening the applications of dynamical models for outbreak preparedness and management.

59 BASIC BIOLOGICAL SCIENCES↗