Search NASA⌕ Search

SEARCH · Search NASA

Results for “Networking”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Deep Koopman Neural Network for Analyzing High-Energy-Density Simulations of Electrical Wire Explosions

Megaampere-scale electrical wire experiments (EWEs) provide a platform for studying magnetohydrodynamic (MHD) instability growth in magneto-inertial fusion (MIF) devices. Even when nonlinear simulations of these experiments can digitally reproduce much of the experimentally observed instability growth, interpreting the results and understanding mode growth and evolution can be non-trivial. As a first step toward providing better interpretation of these simulation features, this work investigates the use of a deep neural network that uses Koopman operator theory to analyze the dynamics of pulsed-power-driven explosions of EWEs. This deep neural network is trained on 1-D resistive MHD simulations of EWEs. This neural network learns to transform the nonlinear data into a lower-dimensional representation where the time dynamics are linear. Layers of this neural network are shown to learn features of the simulations, including the locations of shock waves and different physical regimes of the simulation. Using the learned features, the network can compress a time state of the simulation consisting of 5120 data point into a 36-parameter lower-dimensional latent space embedding. Furthermore, these embeddings are shown to be clustered in the latent space by initial radius and time state.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

On the Training and Generalization of Deep Operator Networks

Here, we present a novel training method for deep operator networks (DeepONets), one of the most popular neural network models for operators. DeepONets are constructed by two subnetworks, namely the branch and trunk networks. Typically, the two subnetworks are trained simultaneously, which amounts to solving a complex optimization problem in a high dimensional space. In addition, the nonconvex and nonlinear nature makes training very challenging. To tackle such a challenge, we propose a two-step training method that trains the trunk network first and then sequentially trains the branch network. The core mechanism is motivated by the divide-and-conquer paradigm and is the decomposition of the entire complex training task into two subtasks with reduced complexity. Therein the Gram–Schmidt orthonormalization process is introduced which significantly improves stability and generalization ability. On the theoretical side, we establish a generalization error estimate in terms of the number of training data, the width of DeepONets, and the number of input and output sensors. Numerical examples are presented to demonstrate the effectiveness of the two-step training method, including Darcy flow in heterogeneous porous media.

deep operator networks↗
DOE OSTI2025

Networked Microgrid Energy Management Considering Ownership and Control Structures: A Comparison

With the growing deployment of microgrids, networked microgrids have emerged for their additional advantages of economy, reliability and resilience by coordinating the operation of multiple microgrids. As microgrids are operated with different ownership, objectives and functionalities, the formed networked microgrids show characteristics of mixed ownership, inconsistent objectives and various functionalities. To enable the coordinated operation of networked microgrids, three control structures, i.e., centralized, distributed and decentralized, have been constructed in the literature. However, the data sharing enabling these different paradigms and the resulted value propositions are not well defined, leading to poor resource management and resilience, etc. To solve this issue, a complete comparison of networked microgrid energy management under centralized, distributed and decentralized structures are performed. As a novel contribution, the required minimum data exchange of networked microgrid energy management under three control structures are identified, respectively. The value propositions are calculated and compared against each other by the results of case studies.

control structures↗
DOE OSTI2024

Zapiary: Creating Visibility in IOT Networks

Zigbee and Z-Wave are the main networking protocols used by low-power Internet of Things (IOT) devices. These protocols use low frequencies. Mesh architecture, and unique address formats that make them not compatible with traditional network traffic tools like IX-Discovery Tools. Zapiary is a software that takes CSV files with Zigbee and Z-Wave traffic and generates Structured Threat Information eXpression (STIX) JSON bundles illustrating the communication within IOT networks. The bundles can then be viewed within Structured Threat Intelligence Graph (STIG) or used with AI/ML models to provide deeper visibility into nodes that make up the network and the ability to trend the mesh network over time.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Multidimensional Distributional Neural Network Output Demonstrated in Super‐Resolution of Surface Wind Speed

Accurate quantification of uncertainty in neural network predictions remains a central challenge for scientific applications involving high-dimensional, correlated data. While existing methods capture either aleatoric or epistemic uncertainty, few offer closed-form, multidimensional distributions that preserve spatial correlation while remaining computationally tractable. In this work, we present a framework for training neural networks with a multidimensional Gaussian loss, generating a closed-form predictive distribution over outputs informed by non-identically distributed training data. Our approach captures aleatoric uncertainty by iteratively estimating the means and covariance matrices, and is demonstrated on a super-resolution example out-of-training-sample. We leverage a Fourier representation of the covariance matrix to stabilize network training and preserve spatial correlation. We introduce a novel regularization strategy—referred to as information sharing—that interpolates between image-specific and global covariance estimates, enabling convergence of the super-resolution downscaling network trained on image-specific distributional loss functions. This framework allows for efficient sampling, explicit correlation modeling, and extensions to more complex distribution families all without disrupting prediction performance. We demonstrate the method on a surface wind speed downscaling task and discuss its broader applicability to uncertainty-aware prediction in scientific models.

17 WIND ENERGY↗
DOE OSTI2025

SPIKANs: separable physics-informed Kolmogorov–Arnold networks

Physics-Informed Neural Networks (PINNs) have emerged as a promising method for solving partial differential equations (PDEs) in scientific computing. While PINNs typically use multilayer perceptrons (MLPs) as their underlying architecture, recent advancements have explored alternative neural network structures. One such innovation is the Kolmogorov–Arnold Network (KAN), which has demonstrated benefits over traditional MLPs, including faster neural scaling and better interpretability. The application of KANs to physics-informed learning has led to the development of Physics-Informed KANs (PIKANs), enabling the use of KANs to solve PDEs. However, despite their advantages, KANs often suffer from slower training speeds, particularly in higher-dimensional problems where the number of collocation points grows exponentially with the dimensionality of the system. To address this challenge, we introduce Separable Physics-Informed Kolmogorov–Arnold Networks (SPIKANs). This novel architecture applies the principle of separation of variables to PIKANs, decomposing the problem such that each dimension is handled by an individual KAN. This approach drastically reduces the computational complexity of training without sacrificing accuracy, facilitating their application to higher-dimensional PDEs. Through a series of benchmark problems, we demonstrate the effectiveness of SPIKANs, showcasing their superior scalability and performance compared to PIKANs and highlighting their potential for solving complex, high-dimensional PDEs in scientific computing.

Kolmogorov-Arnold networks↗
DOE OSTI2025

Deep Learning without Global Optimization by Random Fourier Neural Networks

Here we introduce a new training algorithm for deep neural networks that utilize random complex exponential activation functions. Our approach employs a Markov chain Monte Carlo sampling procedure to iteratively train network layers, avoiding global and gradient-based optimization while maintaining error control. It consistently attains the theoretical approximation rate for residual networks with complex exponential activation functions, determined by network complexity. Additionally, it enables efficient learning of multiscale and high-frequency features, producing interpretable parameter distributions. Despite using sinusoidal basis functions, we do not observe Gibbs phenomena in approximating discontinuous target functions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Sampling two-dimensional isometric tensor network states

Sampling a quantum system’s underlying probability distributions is an important computational task, e.g., for quantum advantage experiments and quantum Monte Carlo algorithms. Tensor networks are an invaluable tool for efficiently representing states of large quantum systems with limited entanglement. Algorithms for sampling one-dimensional (1D) tensor networks are well-established and utilized in several 1D tensor network methods. In this paper we introduce two novel sampling algorithms for two-dimensional (2D) isometric tensor network states (isoTNS) that generalize existing 1D tensor network sampling algorithms. Our first proposed algorithm performs independent sampling and yields a single configuration together with its associated probability. The second algorithm employs a greedy search strategy to identify high-probability configurations and their corresponding probabilities. Numerical results demonstrate the effectiveness of these algorithms across quantum states with varying entanglement and system size.

Dumitrescu, Eugene [ORNL] (ORCID:0000000158519567)↗
DOE OSTI2025

Electroreduction-Driven Formation and Connectivity of Polyoxometalate Coordination Networks

We present the synthesis of metal oxide coordination networks based on Preyssler-type polyoxoanions ([NaP 5 W 30 O 110 ] 14– and [NaP 5 MoW 29 O 110 ] 14– ) bridged with metal–aquo complexes ([M(H 2 O) n ] m+ , M m+ = Co 2+ , Ni 2+ , Zn 2+ , Y 3+ ), induced by electrochemical reduction. Networks bridged with first-row transition metals are isostructural with a previously reported Co-bridged structure, while the Y 3+ -bridged structure is new. All networks feature an uncommon binding motif of the metal cation to the oxygen atoms at cap positions, which we hypothesize is due to increased electron density at the cap upon reduction. Oxidation of a Zn 2+ -bridged network resulted in a new structure in which Zn 2+ –O cap bonds are lost, indicating the importance of reduction in the connectivity of these polyoxometalate-based coordination networks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Protein–Protein Interaction Networks Derived from Classical and Machine Learning-Based Natural Language Processing Tools

The study of protein-protein interactions (PPIs) provides insight into various biological mechanisms, including the binding of antibodies to antigens, enzymes to inhibitors or promoters, and receptors to ligands. Recent studies of PPIs have led to significant biological breakthroughs. For example, the study of PPIs involved in the human:SARS-CoV-2 viral infection mechanism aided in the development of the SARS-CoV-2 vaccines. Though several databases exist for the manual curation of PPI networks, text mining methods have been routinely demonstrated as useful alternatives for newly studied or understudied species where databases are incomplete. Here, the relationship extraction (RE) performance of several open-source classical text processing, machine learning (ML)-based natural language processing (NLP), and large language model (LLM)-based NLP tools were compared. Overall, our results indicated that networks derived from classical methods tend to have high true positive rates at the expense of having overconnected-networks, ML-based NLP methods have lower true positive rates but networks with the closest structures to the target network, and LLM-based NLP methods tend to exist in-between the two other approaches, with variable performances. Finally, the selection of a specific NLP approach should be tied to the needs of a study and text availability, as models varied in performance due to the amount of text provided.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Quartz Dissolution Effects on Flow Channelization and Transport Behavior in Three‐Dimensional Fracture Networks

We perform a set of reactive transport simulations in three-dimensional fracture networks to characterize the impact of geochemical reactions on flow channelization. Flow channelization, a frequently observed phenomenon in porous and fractured subsurface rock formations, results from the spatially variable hydraulic resistance offered by a geological structure. In addition to geo-structural features such as network connectivity, geometry, and hydraulic resistance, geochemical reactions, for example, dissolution and precipitation, can dynamically inhibit or enhance flow channelization. These geochemical processes can change the fracture permeability leading to increased flow channelization, which are localized connected regions of high volumetric flow rates that are seemingly ubiquitous in the subsurface. In our simulations, fractures partially filled with quartz are gradually dissolved until quasi-steady state conditions are obtained. We compare the flow field's initial unreacted and final dissolved states in terms of flow and transport observations. We observe that the dissolved fracture networks provide less resistance to flow and exhibit increased flow channelization when compared to their unreacted counterparts. However, there is substantial variability in the magnitude of these changes which implies that the channelization strongly depends on the network structure. In turn, we identify the interplay between the particular network structure and the impact of geochemical dissolution on flow channelization. The presented results indicate that geological systems that have been weathering or reactive for longer times in older landscapes are likely to have increased flow channelization compared to their equivalent but younger counterparts, which implies a time dependence on flow channelization in fractured media.

Hyman, Jeffrey D.↗
DOE OSTI2025

Labels as a feature: Network homophily for systematically annotating human GPCR drug-target interactions

Machine learning has revolutionized drug discovery by enabling the exploration of vast, uncharted chemical spaces essential for discovering novel patentable drugs. Despite the critical role of human G protein-coupled receptors in FDA-approved drugs, exhaustive in-distribution drug-target interaction testing across all pairs of human G protein-coupled receptors and known drugs is rare due to significant economic and technical challenges. This often leaves off-target effects unexplored, which poses a considerable risk to drug safety. In contrast to the traditional focus on out-of-distribution exploration (drug discovery), we introduce a neighborhood-to-prediction model termed Chemical Space Neural Networks that leverages network homophily and training-free graph neural networks with labels as features. We show that Chemical Space Neural Networks’ ability to make accurate predictions strongly correlates with network homophily. Thus, labels as features strongly increase a machine learning model’s capacity to enhance in-distribution prediction accuracy, which we show by integrating labeled data during inference. We validate these advancements in a high-throughput yeast biosensing system (3773 drug-target interactions, 539 compounds, 7 human G protein-coupled receptors) to discover novel drug-target interactions for FDA-approved drugs and to expand the general understanding of how to build reliable predictors to guide experimental verification.

Hansson, Frederik G↗
DOE OSTI2024

rNets: a standalone package to visualize reaction networks

In the study of chemical processes, visualizing reaction networks is pivotal for identifying crucial compounds and transformations. Traditional methods, such as network schematics and reaction path linear plots, often struggle to effectively represent complex reaction networks due to their size and intricate connectivity. Alternatives capable of leading with complexity include graph methods, but they are not user-friendly, lacking simplicity and modularity, which hinders their integration with widely-used research software. This work introduces rNets an innovative tool designed for the efficient visualization of reaction networks with a user-friendly interface, modularity, and seamless integration with existing software packages. The effectiveness of rNets is demonstrated through its application in analyzing three catalytic reactions, showcasing its potential to significantly enhance research both in homogeneous and heterogeneous catalysis fields. This tool not only simplifies the visualization process but also opens new avenues for exploring complex reaction networks in diverse research contexts.

Pablo-García, Sergio↗
DOE OSTI2024

Connected Traffic Signal Coordination Optimization Framework through Network-Wide Adaptive Linear Quadratic Regulator–Based Control Strategy

Traffic congestion in metropolitan areas causes several significant challenges, such as longer travel times, decreased productivity, increased fuel consumption and vehicle emissions, and even severe injuries during crashes. Traffic signal control is a management approach to reduce traffic congestion and allocate the appropriate right of way for safety and mobility efficiency, both in temporal and spatial domains. Here, this study proposes a network-wide adaptive signal control coordination optimization framework based on the linear quadratic regulator algorithm. The traffic flow conditions driven by signal control inputs are formulated based on their network-wide state-space representation. After modeling traffic control regulation constraints, an adaptive linear quadratic regulator algorithm is designed to maximize the network-wide total throughput under the current conditions. Optimal signal control split time durations for multiple intersections in the network are derived by solving the algebraic Riccati equation. Furthermore, the recursive least square parameter estimation method is employed to quantify dynamic traffic condition changes. To verify the effectiveness of this proposed signal control framework, both simulation and real-world experimental tests are conducted for multiple intersections in downtown Chattanooga, Tennessee, United States. In preparation for real-world experimental tests, pipelines for real-time data processing implementation and historical traffic flow data analysis are conducted. The test results demonstrate that the proposed control framework achieves a decrease in travel time by up to 19.4%, total time spent (TTS) by up to 11.9%, and relative queue balance (RQB) by up to 15.6%. The research findings indicate that the proposed signal control framework can be generalized to handle large scale signal control optimization network-wide.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Using the Metropolis algorithm to explore the loss surface of a recurrent neural network

In the limit of small trial moves the Metropolis Monte Carlo algorithm is equivalent to gradient descent on the energy function in the presence of Gaussian white noise. This observation was originally used to demonstrate a correspondence between Metropolis Monte Carlo moves of model molecules and overdamped Langevin dynamics, but it also applies in the context of training a neural network: making small random changes to the weights of a neural network, accepted with the Metropolis probability, with the loss function playing the role of energy, has the same effect as training by explicit gradient descent in the presence of Gaussian white noise. We explore this correspondence in the context of a simple recurrent neural network. We also explore regimes in which this correspondence breaks down, where the gradient of the loss function becomes very large or small. In these regimes the Metropolis algorithm can still effect training, and so can be used as a probe of the loss function of a neural network in regimes in which gradient descent struggles. We also show that training can be accelerated by making purposely-designed Monte Carlo trial moves of neural-network weights.

Casert, Corneel↗
DOE OSTI2024

Machine learning without a processor: Emergent learning in a nonlinear analog network

Standard deep learning algorithms require differentiating large nonlinear networks, a process that is slow and power-hungry. Electronic contrastive local learning networks (CLLNs) offer potentially fast, efficient, and fault-tolerant hardware for analog machine learning, but existing implementations are linear, severely limiting their capabilities. These systems differ significantly from artificial neural networks as well as the brain, so the feasibility and utility of incorporating nonlinear elements have not been explored. Here, we introduce a nonlinear CLLN—an analog electronic network made of self-adjusting nonlinear resistive elements based on transistors. We demonstrate that the system learns tasks unachievable in linear systems, including XOR (exclusive or) and nonlinear regression, without a computer. We find our decentralized system reduces modes of training error in order (mean, slope, curvature), similar to spectral bias in artificial neural networks. The circuitry is robust to damage, retrainable in seconds, and performs learned tasks in microseconds while dissipating only picojoules of energy across each transistor. This suggests enormous potential for fast, low-power computing in edge systems like sensors, robotic controllers, and medical devices, as well as manufacturability at scale for performing and studying emergent learning.

Science & Technology - Other Topics↗
DOE OSTI2025

Alternating and Gaussian Fermionic Isometric Tensor Network States

Isometric tensor networks in two dimensions enable efficient and accurate study of quantum many-body states, yet the effect of the isometric restriction on the represented quantum states is not fully understood. We address this question in two main contributions. First, we introduce an improved variant of isometric tensor network states (isoTNS) in two dimensions, where the isometric arrows on the columns of the network alternate between pointing upward and downward; hence the name alternating isometric tensor network states. Second, we introduce a numerical tool—the isometric Gaussian fermionic TNS (isoGfTNS)—that incorporates isometric constraints into the framework of Gaussian fermionic tensor network states. We demonstrate in numerous ways that alternating isoTNSs represent many-body ground states of two-dimensional quantum systems significantly better than the original isoTNSs. First, we show that the entanglement in an isoTNS is mediated along the isometric arrows and that alternating isoTNSs mediate entanglement more efficiently than conventional isoTNSs. Second, alternating isoTNSs correspond to a deeper, and thus more representative, sequential-circuit construction of depth 𝒪⁢(𝐿𝑥 ⋅𝐿𝑦) compared to the original isoTNSs of depth 𝒪⁢(𝐿𝑥 +𝐿𝑦). Third, using the Gaussian framework and gradient-based energy minimization, we provide numerical evidence of better bond-dimension scaling and variational energy of alternating isoGfTNSs for ground states of various free-fermionic models, including the Fermi surface, the band insulator, and the 𝑝𝑥 +𝑖⁢𝑝𝑦 mean-field superconductor. Finally, benchmarking on the transverse-field Ising model, we demonstrate that an alternating isoTNS provides substantially improved performance and stability relative to the original isoTNS for the ground-state search algorithm in interacting systems.

Wu, Yantao [Chinese Academy of Sciences, Beijing (↗
DOE OSTI2025

Flow-Driven Stretch Fluctuations Govern the Nonlinear Viscoelasticity of Elongating Associative Polymer Networks

We use nonequilibrium molecular dynamics simulations to verify recent tube-model predictions that associative polymer networks exhibit broad stretch fluctuations during elongational flow. Simulations further show that these fluctuating dynamics give rise to the rate-dependent extensional viscosity 𝜂 𝐸 measured in filament stretching experiments on H-bonding networks. Simulations model bivalent associative networks with a reactive bead-spring model for varying association strength and extensional strain rate. We observe that stretch fluctuations are driven by a new form of chain tumbling, where chains continually collapse and elongate as their associations break and reform within the advecting network. This produces a broad, nearly uniform distribution of chain stretch over a wide range of strain rates, manifesting as a rate-independent plateau in the extensional stress. Our results show that the nonlinear viscoelasticity of associative networks is dominated by large fluctuations in molecular response, which cannot be captured by current mean-field models.

biomimetic & bio-inspired materials↗