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 1,099 records · Page 61

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↗

A dynamic protein interactome drives energy conservation and electron flux in Thermococcus kodakarensis

ABSTRACT Life is supported by energy gains fueled by catabolism of a wide range of substrates, each reliant on the selective partitioning of electrons through redox ( red uction and ox idation) reactions. Electron flux through tunable and regulated protein interactions provides dynamic routes for energy conservation, but how electron flux is regulated in vivo , particularly for archaeal metabolisms that support rapid growth at the thermodynamic limits of life, is poorly understood. Identification of bona fide in vivo protein assemblies and how such assemblies dictate the totality of electron flux is critical to our understanding of the regulation imposed on metabolism, energy production, and energy conservation. Here, 25 key proteins in central metabolic redox pathways in the model, genetically accessible, hyperthermophilic archaeon Thermococcus kodakarensis , were purified to reveal an extensive, dynamic, and tightly interconnected network of protein interactions that responds to environmental cues (such as the availability of various reductive sinks) to direct electron flux to maximize energetic gains. Interactions connecting disparate functions suggest many catabolic and anabolic activities occur in spatial proximity in vivo , and while protein complexes have been historically defined under optimal conditions, many of these complexes appear to maintain alternative partnerships in changing conditions. The totality of the results obtained redefines our understanding of in vivo assemblies driving ancient metabolic strategies supporting the growth of modern Archaea. IMPORTANCE Given the potential for rational genetic manipulations of biofuel- and biotech-promising archaea to yield transformative results for major markets, it is a priority to define how the metabolisms of such species are controlled, at least in part, by in vivo protein assemblies, and from such, define routes of energy flux that can be most efficiently altered toward biofuel or biotechnological gains. Proteinaceous electron carriers (PECs, such as ferredoxins) offer the potential for specific protein–protein interactions to coordinate selective reductive flow. Employing the model, genetically accessible, hyperthermophilic archaeon, Thermococcus kodakarensis , we establish the metabolic protein interactome of 25 key redox proteins, revealing that each redox active protein has a dynamic partnership profile, suggesting catabolic and anabolic activities may occur in concert and in temporal and spatial proximity in vivo . These results reveal critical importance in evaluating the newly identified partnerships and their role and utility in providing regulated redox flux in T. kodakarensis .

Williams, Sere A. (ORCID:0000000235509590)↗

SU-F-E-09: Respiratory Signal Prediction Based On Multi-Layer Perceptron Neural Network Using Adjustable Training Samples

Purpose: Dynamic tracking of moving organs, such as lung and liver tumors, under radiation therapy requires prediction of organ motions prior to delivery. The shift of moving organ may change a lot due to huge transform of respiration at different periods. This study aims to reduce the influence of that changes using adjustable training signals and multi-layer perceptron neural network (ASMLP). Methods: Respiratory signals obtained using a Real-time Position Management(RPM) device were used for this study. The ASMLP uses two multi-layer perceptron neural networks(MLPs) to infer respiration position alternately and the training sample will be updated with time. Firstly, a Savitzky-Golay finite impulse response smoothing filter was established to smooth the respiratory signal. Secondly, two same MLPs were developed to estimate respiratory position from its previous positions separately. Weights and thresholds were updated to minimize network errors according to Leverberg-Marquart optimization algorithm through backward propagation method. Finally, MLP 1 was used to predict 120∼150s respiration position using 0∼120s training signals. At the same time, MLP 2 was trained using 30∼150s training signals. Then MLP is used to predict 150∼180s training signals according to 30∼150s training signals. The respiration position is predicted as this way until it was finished. Results: In this experiment, the two methods were used to predict 2.5 minute respiratory signals. For predicting 1s ahead of response time, correlation coefficient was improved from 0.8250(MLP method) to 0.8856(ASMLP method). Besides, a 30% improvement of mean absolute error between MLP(0.1798 on average) and ASMLP(0.1267 on average) was achieved. For predicting 2s ahead of response time, correlation coefficient was improved from 0.61415 to 0.7098.Mean absolute error of MLP method(0.3111 on average) was reduced by 35% using ASMLP method(0.2020 on average). Conclusion: The preliminary results demonstrate that the ASMLP respiratory prediction method is more accurate than MLP method and can improve the respiration forecast accuracy.

60 APPLIED LIFE SCIENCES↗

Network-Wide Traffic Signal Control Using Bilinear System Modeling and Adaptive Optimization

This study proposes a new multi-input multi-output optimal bilinear signal control method in which a bilinear dynamic model approximation is used to capture the nonlinear dynamics of the urban traffic networks. With signal green time splits as the control input and traffic delay changes as the output for each intersections in the network, a bilinear system model was developed, which, on the basis of linear system modeling, takes interactions among traffic delays and signal timing splits into consideration. Based on the bilinear system modeling framework, we conducted two steps in each time interval to derive traffic control strategies: (1) we used the normalized least-squared algorithm to estimate system parameters; and (2) we solved an online optimization problem to obtain the updated traffic control inputs for the signal timing that minimizes future traffic delays. We evaluated the proposed method in a microscopic traffic simulation environment (VISSIM) with a 35-intersection network of Bellevue city in Washington. Two different traffic demand patterns: (1) normal traffic demands; and (2) time-varying traffic demands were simulated to compare the performance of different control strategies. Experimental results show that (1) the proposed bilinear system model can better describe traffic system dynamics than linear-model based methods, such as our previously developed linear-quadratic regulator control; and (2) the proposed method outperforms the state-of-the-art signal control strategies, namely the max-pressure and the self-organizing traffic light control methods. We have also shown that the proposed method is applicable to all other possible network layouts and signal controller phasing structures.

42 ENGINEERING↗

Constrained Deep Reinforcement Learning for Energy Sustainable Multi-UAV Based Random Access IoT Networks With NOMA

In this paper, we apply the Non-Orthogonal Multiple Access (NOMA) technique to improve the massive channel access of a wireless IoT network where solar-powered Unmanned Aerial Vehicles (UAVs) relay data from IoT devices to remote servers. Specifically, IoT devices contend for accessing the shared wireless channel using an adaptive p-persistent slotted Aloha protocol; and the solar-powered UAVs adopt Successive Interference Cancellation (SIC) to decode multiple received data from IoT devices to improve access efficiency. To enable an energy-sustainable capacity-optimal network, we study the joint problem of dynamic multi-UAV altitude control and multi-cell wireless channel access management of IoT devices as a stochastic control problem with multiple energy constraints. We first formulate this problem as a Constrained Markov Decision Process (CMDP), and propose an online model-free Constrained Deep Reinforcement Learning (CDRL) algorithm based on Lagrangian primal-dual policy optimization to solve the CMDP. Extensive simulations demonstrate that our proposed algorithm learns a cooperative policy in which the altitude of UAVs and channel access probability of IoT devices are dynamically controlled to attain the maximal long-term network capacity while ensuring energy sustainability of UAVs, outperforming baseline schemes. The proposed CDRL agent can be trained on a small network, yet the learned policy can efficiently manage networks with a massive number of IoT devices and varying initial states, which can amortize the cost of training the CDRL agent.

42 ENGINEERING↗

Weak and Strong Connectivity Regimes for a General Time Elapsed Neuron Network Model

For large fully connected neuron networks, we study the dynamics of homogenous assemblies of interacting neurons described by time elapsed models. Under general assumptions on the firing rate which include the ones made in previous works (Pakdaman et al. in Nonlinearity 23(1):55–75, 2010; SIAM J Appl Math 73(3):1260–1279, 2013, Mischler and Weng in Acta Appl Math, 2015), we establish accurate estimate on the long time behavior of the solutions in the weak and the strong connectivity regime both in the case with and without delay. Our results improve (Pakdaman et al. 2010, 2013) where a less accurate estimate was established and Mischler and Weng (2015) where only smooth firing rates were considered. Our approach combines several arguments introduced in the above previous works as well as a slightly refined version of the Weyl’s and spectral mapping theorems presented in Voigt (Monatsh Math 90(2):153–161, 1980) and Mischler and Scher (Ann Inst H Poincaré Anal Non Linéaire 33(3):849–898, 2016).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Investigating Neighbor Discovery for High-Rate Delay Tolerant Networking

A neighbor discovery protocol that enables the dynamic discovery of nodes for NASA Glenn Research Center’s High Rate Delay Tolerant Networking (HDTN) project is needed to satisfy mission scalability and interoperability objectives. The purpose of this study is to primarily examine a DTN IP neighbor discovery (IPND) implementation to understand the inner workings of the protocol before approaching a neighbor discovery implementation for the HDTN project. Using a rust-based DTN IPND implementation, this study analyzed the neighbor discovery process. DTN IPND was found to help meet both mission scalability and interoperability objectives by enabling dynamic routing capabilities. This study definitively answers the question regarding mission scalability and interoperability concerns. Further studies are needed to establish the most optimal neighbor discovery implementation for HDTN.

Prash Choksi↗