Channel Network Control on Seasonal Lake Area Dynamics in Arctic Deltas
Explore the source record for details and available documents.
Lawrence Vulis↗
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.
Dynamic Quantum Frequency Conversion for Quantum Networks
Explore the source record for details and available documents.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Neural Networks Surrogates of PDE-based Dynamical Systems: Application to Ice Sheet Dynamics.
Abstract not provided.
Perego, Mauro↗
New Insights into the Chain Dynamics and Microstructure of Highly Crosslinked Networks as a Function of Network Heterogeneity.
Abstract not provided.
Jones, Brad Howard↗
The dynamics and stratigraphy of distributary channel networks (Final Technical Report)
Sedimentary reservoirs are frequently composed of the deposits of distributary channel networks. These networks are associated with coarse sediments (and high permeability) within the channel network, and relatively fine sediments (and low permeability) outside the channel network. The shape of the network is complex, and a product of the environmental boundary conditions under which it grows (Figure 1). These systems control heterogeneity at small and large scales within sedimentary basins, and understanding this heterogeneity and the links between scales represents the important scientific frontier addressed by this project.
58 GEOSCIENCES↗
Effects of bursting dynamic features on the generation of multi-clustered structure of neural network with symmetric spike-timing-dependent plasticity learning rule
In this paper, the generation of multi-clustered structure of self-organized neural network with different neuronal firing patterns, i.e., bursting or spiking, has been investigated. The initially all-to-all-connected spiking neural network or bursting neural network can be self-organized into clustered structure through the symmetric spike-timing-dependent plasticity learning for both bursting and spiking neurons. However, the time consumption of this clustering procedure of the burst-based self-organized neural network (BSON) is much shorter than the spike-based self-organized neural network (SSON). Our results show that the BSON network has more obvious small-world properties, i.e., higher clustering coefficient and smaller shortest path length than the SSON network. Also, the results of larger structure entropy and activity entropy of the BSON network demonstrate that this network has higher topological complexity and dynamical diversity, which benefits for enhancing information transmission of neural circuits. Hence, we conclude that the burst firing can significantly enhance the efficiency of clustering procedure and the emergent clustered structure renders the whole network more synchronous and therefore more sensitive to weak input. This result is further confirmed from its improved performance on stochastic resonance. Therefore, we believe that the multi-clustered neural network which self-organized from the bursting dynamics has high efficiency in information processing.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Transfer learning nonlinear plasma dynamic transitions in low dimensional embeddings via deep neural networks
Deep learning algorithms provide a new paradigm to study high-dimensional dynamical behaviors, such as those in fusion plasma systems. Development of novel, data-driven model reduction methods, coupled with detection of abnormal modes with plasma physics, opens a unique opportunity to identify plasma instabilities through automated construction of parsimonious models that can be tuned to balance accuracy and cost. Our fusion transfer learning (FTL) model demonstrates success in rapidly reconstructing nonlinear kink mode structures by learning from a limited amount of nonlinear simulation data. The knowledge transfer process leverages a pre-trained neural encoder–decoder network, initially trained on linear simulations, to effectively capture nonlinear dynamics. The low-dimensional embeddings extract the coherent structures of interest, while preserving the inherent dynamics of the complex system. Experimental results highlight FTL’s capacity to capture transitional behaviors and dynamical features in plasma dynamics—a task often challenging for conventional methods. The model developed in this study is generalizable and can be extended broadly through transfer learning to address various magnetohydrodynamics modes.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Network succession reveals the importance of competition in response to emulsified vegetable oil amendment for uranium bioremediation: Competition in bioremediation system
When trying to discern network interactions among different species/populations in microbial communities interests have been evoked in recent years, but little information is available about temporal dynamics of microbial network interactions in response to environmental perturbations. We modified the random matrix theory-based network approach to discern network succession in groundwater microbial communities in response to emulsified vegetable oil (EVO) amendment for uranium bioremediation. Groundwater microbial communities from one control and seven monitor wells were analysed with a functional gene array (GeoChip 3.0), and functional molecular ecological networks (fMENs) at different time points were reconstructed. Our results showed that the network interactions were dramatically altered by EVO amendment. Dynamic and resilient succession was evident: fairly simple at the initial stage (Day 0), increasingly complex at the middle period (Days 4, 17, 31), most complex at Day 80, and then decreasingly complex at a later stage (140–269 days). Unlike previous studies in other habitats, negative interactions predominated in a time-series fMEN, suggesting strong competition among different microbial species in the groundwater systems after EVO injection. In particular, several keystone sulfate-reducing bacteria showed strong negative interactions with their network neighbours. These results provide mechanistic understanding of the decreased phylogenetic diversity during environmental perturbations.
59 BASIC BIOLOGICAL SCIENCES↗
Modeling and simulation of vascular tumors embedded in evolving capillary networks
Here in this work, we present a coupled 3D–1D model of solid tumor growth within a dynamically changing vascular network to facilitate realistic simulations of angiogenesis. Additionally, the model includes erosion of the extracellular matrix, interstitial flow, and coupled flow in blood vessels and tissue. We employ continuum mixture theory with stochastic Cahn–Hilliard type phase-field models of tumor growth. The interstitial flow is governed by a mesoscale version of Darcy’s law. The flow in the blood vessels is controlled by Poiseuille flow, and Starling’s law is applied to model the mass transfer in and out of blood vessels. The evolution of the network of blood vessels is orchestrated by the concentration of the tumor angiogenesis factors (TAFs); blood vessels grow towards the increasing TAFs concentrations. This process is not deterministic, allowing random growth of blood vessels and, therefore, due to the coupling of nutrients in tissue and vessels, makes the growth of tumors stochastic. We demonstrate the performance of the model by applying it to a variety of scenarios. Numerical experiments illustrate the flexibility of the model and its ability to generate satellite tumors. Simulations of the effects of angiogenesis on tumor growth are presented as well as sample-independent features of cancer.
3D–1D coupled blood flow models↗
Transferable Dynamic Molecular Charge Assignment Using Deep Neural Networks
We report that the ability to accurately and efficiently compute quantum-mechanical partial atomistic charges has many practical applications, such as calculations of IR spectra, analysis of chemical bonding, and classical force field parametrization. Machine learning (ML) techniques provide a possible avenue for the efficient prediction of atomic partial charges. Modern ML advances in the prediction of molecular energies [i.e., the hierarchical interacting particle neural network (HIP-NN)] has provided the necessary model framework and architecture to predict transferable, extensible, and conformationally dynamic atomic partial charges based on reference density functional theory (DFT) simulations. Utilizing HIP-NN, we show that ML charge prediction can be highly accurate over a wide range of molecules (both small and large) across a variety of charge partitioning schemes such as the Hirshfeld, CM5, MSK, and NBO methods. To demonstrate transferability and size extensibility, we compare ML results with reference DFT calculations on the COMP6 benchmark, achieving errors of 0.004e – (elementary charge). This is remarkable since this benchmark contains two proteins that are multiple times larger than the largest molecules in the training set. An application of our atomic charge predictions on nonequilibrium geometries is the generation of IR spectra for organic molecules from dynamical trajectories on a variety of organic molecules, which show good agreement with calculated IR spectra with reference method. Critically, HIP-NN charge predictions are many orders of magnitude faster than direct DFT calculations. Lastly, these combined results provide further evidence that ML (specifically HIP-NN) provides a pathway to greatly increase the range of feasible simulations while retaining quantum-level accuracy.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Population dynamics, information transfer, and spatial organization in a chemical reaction network under spatial confinement and crowding conditions
Here, we investigate, via Brownian dynamics simulations, the reaction dynamics of a generic, nonlinear chemical network under spatial confinement and crowding conditions. In detail, the Willamowski-Rossler chemical reaction system has been “extended” and considered as a prototype reaction-diffusion system. These results are potentially relevant to a number of open problems in biophysics and biochemistry, such as the synthesis of primitive cellular units (protocells) and the definition of their role in the chemical origin of life and the characterization of vesicle-mediated drug delivery processes. More generally, the computational approach presented in this work makes the case for the use of spatial stochastic simulation methods for the study of biochemical networks in vivo where the “well-mixed” approximation is invalid and both thermal and intrinsic fluctuations linked to the possible presence of molecular species in low number copies cannot be averaged out.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Damage Spreading in Spatial and Small-world Random Boolean Networks
The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ($\bar{K} \ll 1$) and that the critical connectivity of stability $K_s$ changes compared to random networks. At higher $\bar{K}$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.
Lu, Qiming↗
Continuous Time Group Discovery in Dynamic Graphs
With the rise in availability and importance of graphs and networks, it has become increasingly important to have good models to describe their behavior. While much work has focused on modeling static graphs, we focus on group discovery in dynamic graphs. We adapt a dynamic extension of Latent Dirichlet Allocation to this task and demonstrate good performance on two datasets. Modeling relational data has become increasingly important in recent years. Much work has focused on static graphs - that is fixed graphs at a single point in time. Here we focus on the problem of modeling dynamic (i.e. time-evolving) graphs. We propose a scalable Bayesian approach for community discovery in dynamic graphs. Our approach is based on extensions of Latent Dirichlet Allocation (LDA). LDA is a latent variable model for topic modeling in text corpora. It was extended to deal with topic changes in discrete time and later in continuous time. These models were referred to as the discrete Dynamic Topic Model (dDTM) and the continuous Dynamic Topic Model (cDTM), respectively. When adapting these models to graphs, we take our inspiration from LDA-G and SSN-LDA, applications of LDA to static graphs that have been shown to effectively factor out community structure to explain link patterns in graphs. In this paper, we demonstrate how to adapt and apply the cDTM to the task of finding communities in dynamic networks. We use link prediction to measure the quality of the discovered community structure and apply it to two different relational datasets - DBLP author-keyword and CAIDA autonomous systems relationships. We also discuss a parallel implementation of this approach using Hadoop. In Section 2, we review LDA and LDA-G. In Section 3, we review the cDTM and introduce cDTMG, its adaptation to modeling dynamic graphs. We discuss inference for the cDTM-G and details of our parallel implementation in Section 4 and present its performance on two datasets in Section 5 before concluding in Section 6.
97 MATHEMATICS AND COMPUTING↗
Complementing Dynamical Downscaling With Super‐Resolution Convolutional Neural Networks
Despite advancements in Artificial Intelligence (AI) methods for climate downscaling, significant challenges remain for their practicality in climate research. Current AI-methods exhibit notable limitations, such as limited application in downscaling Global Climate Models (GCMs), and accurately representing extremes. To address these challenges, we implement an AI-based methodology using super-resolution convolutional neural networks (SRCNN), trained and evaluated on 40 years of daily precipitation data from a reanalysis and a high-resolution dynamically downscaled counterpart. The dynamical downscaled simulations, constrained using spectral nudging, enable the replication of historical events at a higher resolution. This allows the SRCNN to emulate dynamical downscaling effectively. Modifications, such as incorporating elevation data and data pre-processing enhances overall model performance, while using exponential and quantile loss functions improve the simulation of extremes. Our findings show SRCNN models efficiently and skillfully downscale precipitation from GCMs. Future work will expand this methodology to downscale additional variables for future climate projections.
54 ENVIRONMENTAL SCIENCES↗
Reverse and Forward Engineering of Local Voltage Control in Distribution Networks
The increasing penetration of renewable and distributed energy resources in distribution networks calls for real-time and distributed voltage control. As such, in this paper we investigate local Volt/VAR control with a general class of control functions, and show that the power system dynamics with non-incremental local voltage control can be seen as a distributed algorithm for solving a well-defined optimization problem (reverse engineering). The reverse engineering further reveals a fundamental limitation of the non-incremental voltage control: the convergence condition is restrictive and prevents better voltage regulation at equilibrium. This motivates us to design two incremental local voltage control schemes based on the subgradient and pseudo-gradient algorithms respectively for solving the same optimization problem (forward engineering). The new control schemes decouple the dynamical property from the equilibrium property, and have much less restrictive convergence conditions. This work presents another step towards developing a new foundation—network dynamics as optimization algorithms—for distributed real-time control and optimization of future power networks.
42 ENGINEERING↗
SuperNeurons: Dynamic GPU Memory Management for Training Deep Neural Networks
Going deeper and wider in neural architectures improves their accuracy, while the limited GPU DRAM places an undesired restriction on the network design domain. Deep Learning (DL) practitioners either need to change to less de- sired network architectures, or nontrivially dissect a network across multiGPUs. These distract DL practitioners from concentrating on their original machine learning tasks. We present SuperNeurons: a dynamic GPU memory scheduling runtime to enable the network training far beyond the GPU DRAM capacity. SuperNeurons features 3 memory optimizations, Liveness Analysis, Unified Tensor Pool, and Cost-Aware Recomputation; together they effectively reduce the network-wide peak memory usage down to the maximal memory usage among layers. We also address the performance issues in these memory-saving techniques. Given the limited GPU DRAM, SuperNeurons not only provisions the necessary memory for the training, but also dynamically allocates the memory for convolution workspaces to achieve the high performance. Evaluations against Caffe, Torch, MXNet and TensorFlow have demonstrated that SuperNeurons trains at least 3.2432 deeper network than current ones with the leading performance. Particularly, SuperNeurons can train ResNet2500 that has 104 basic network layers on a 12GB K40c.
Wang, Linnan↗
Ensemble Kalman Filter for Dynamic State Estimation of Power Grids Stochastically Driven by Time-correlated Mechanical Input Power
State and parameter estimation of power transmission networks is important for monitoring power grid operating conditions and analyzing transient stability. Wind power generation depends on fluctuating input power levels, which are correlated in time and contribute to uncertainty in turbine dynamical models. The ensemble Kalman filter (EnKF), a standard state estimation technique, uses a deterministic forecast and does not explicitly model time-correlated noise in parameters such as mechanical input power. However, this uncertainty affects the probability of fault-induced transient instability and increased prediction bias. Here a novel approach is to model input power noise with time-correlated stochastic fluctuations, and integrate them with the network dynamics during the forecast. While the EnKF has been used to calibrate constant parameters in turbine dynamical models, the calibration of a statistical model for a time-correlated parameter has not been investigated. In this study, twin experiments on a standard transmission network test case are used to validate our time-correlated noise model framework for state estimation of unsteady operating conditions and transient stability analysis, and a methodology is proposed for the inference of the mechanical input power time-correlation length parameter using time-series data from PMUs monitoring power dynamics at generator buses.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Experimental observation of chimera and cluster states in a minimal globally coupled network
A “chimera state” is a dynamical pattern that occurs in a network of coupled identical oscillators when the symmetry of the oscillator population is broken into synchronous and asynchronous parts. We report the experimental observation of chimera and cluster states in a network of four globally coupled chaotic opto-electronic oscillators. This is the minimal network that can support chimera states, and our study provides new insight into the fundamental mechanisms underlying their formation. We use a unified approach to determine the stability of all the observed partially synchronous patterns, highlighting the close relationship between chimera and cluster states as belonging to the broader phenomenon of partial synchronization. Our approach is general in terms of network size and connectivity. We also find that chimera states often appear in regions of multistability between global, cluster, and desynchronized states.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗