Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Reducing Communication in Graph Neural Network Training

Graph Neural Networks (GNNs) are powerful and flexible neural networks that use the naturally sparse connectivity information of the data. GNNs represent this connectivity as sparse matrices, which have lower arithmetic intensity and thus higher communication costs compared to dense matrices, making GNNs harder to scale to high concurrencies than convolutional or fully-connected neural networks. Here, we introduce a family of parallel algorithms for training GNNs and show that they can asymptotically reduce communication compared to previous parallel GNN training methods. We implement these algorithms, which are based on 1D, 1. 5D, 2D, and 3D sparse-dense matrix multiplication, using torch.distributed on GPU-equipped clusters. Our algorithms optimize communication across the full GNN training pipeline. We train GNNs on over a hundred GPUs on multiple datasets, including a protein network with over a billion edges.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Learning generative neural networks with physics knowledge

Deep generative neural networks have enabled modeling complex distributions, but incorporating physics knowledge into the neural networks is still challenging and is at the core of current physics-based machine learning research. To this end, we propose a physics generative neural network (PhysGNN), a new class of generative neural networks for learning unknown distributions in a physical system described by partial differential equations (PDE). PhysGNN couples PDE systems with generative neural networks. It is a fully differentiable model that allows back-propagation of gradients through both numerical PDE solvers and generative neural networks, and is trained by minimizing the discrete Wasserstein distance between generated and observed probability distributions of the PDE outputs using the stochastic gradient descent method. Moreover, PhysGNN does not require adversarial training like standard generative neural networks, which offers better stability than adversarial training. We show that PhysGNN can learn complex distributions in stochastic inverse problems, where conventional methods such as maximum likelihood estimation and momentum matching methods may be inapplicable when little knowledge is known about the form of unknown distributions or the physical model is too complex. Furthermore, our method allows physics-based generative neural network training for learning complex distributions in the context of differential equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Accelerating network layouts using graph neural networks

Graph layout algorithms used in network visualization represent the first and the most widely used tool to unveil the inner structure and the behavior of complex networks. Current network visualization software relies on the force-directed layout (FDL) algorithm, whose high computational complexity makes the visualization of large real networks computationally prohibitive and traps large graphs into high energy configurations, resulting in hard-to-interpret “hairball” layouts. Here we use Graph Neural Networks (GNN) to accelerate FDL, showing that deep learning can address both limitations of FDL: it offers a 10 to 100 fold improvement in speed while also yielding layouts which are more informative. We analytically derive the speedup offered by GNN, relating it to the number of outliers in the eigenspectrum of the adjacency matrix, predicting that GNNs are particularly effective for networks with communities and local regularities. Finally, we use GNN to generate a three-dimensional layout of the Internet, and introduce additional measures to assess the layout quality and its interpretability, exploring the algorithm’s ability to separate communities and the link-length distribution. The novel use of deep neural networks can help accelerate other network-based optimization problems as well, with applications from reaction-diffusion systems to epidemics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

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↗
DOE OSTI2021

Multi-Omics Driven Metabolic Network Reconstruction and Analysis of Lignocellulosic Carbon Utilization in Rhodosporidium toruloides

An oleaginous yeast Rhodosporidium toruloides is a promising host for converting lignocellulosic biomass to bioproducts and biofuels. In this work, we performed multi-omics analysis of lignocellulosic carbon utilization in R. toruloides and reconstructed the genome-scale metabolic network of R. toruloides . High-quality metabolic network models for model organisms and orthologous protein mapping were used to build a draft metabolic network reconstruction. The reconstruction was manually curated to build a metabolic model using functional annotation and multi-omics data including transcriptomics, proteomics, metabolomics, and RB-TDNA sequencing. The multi-omics data and metabolic model were used to investigate R. toruloides metabolism including lipid accumulation and lignocellulosic carbon utilization. The developed metabolic model was validated against high-throughput growth phenotyping and gene fitness data, and further refined to resolve the inconsistencies between prediction and data. We believe that this is the most complete and accurate metabolic network model available for R. toruloides to date.

09 BIOMASS FUELS↗
DOE OSTI2019

Network coding for improving throughput in WDM optical networks with dedicated protection

Network coding (NC) has been recently emerging as an excellent technique for leveraging network efficiency. In optical networks, NC and protection appear to be a good match and indeed, NC could be effectively exploited for greater protection efficiency thanks to the opportunity of combining signals rather than duplication in the traditional approach. Motivated by this observation, we investigate the application of a simple and practical NC technique based on XOR operation to improve the network throughput in survivable optical networks. To this end, we propose the NC-based protection whose speed recovery is on a par with the conventional 1+1 dedicated protection while the capacity usage could be more efficient, paving the way for improving throughput in constrained capacity conditions. A novel mixed integer linear programming model is developed for survivable optical networks design employing the proposed NC-based protection. The model attempts to optimally determine the demands to serve, the routing for served demands and NC assignment among demands aiming at maximizing the network throughput in the constraint of bandwidth limitation. Extensive numerical evaluations on realistic topologies are provided to highlight the advantages of our NC-based protection proposal compared with the conventional dedicated protection in improving the network throughput. Encouraging results are observed when the new protection proposal based on NC could accommodate up to 30% more traffic than the conventional case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Context-Enriched Identification of Particles with a Convolutional Network for Neutrino Events

Particle detectors record the interactions of subatomic particles and their passage through matter. The identification of these particles is necessary for in-depth physics analysis. While particles can be identified by their individual behavior as they travel through matter, the full context of the interaction in which they are produced can aid the classification task substantially. We have developed the first convolutional neural network for particle identification which uses context information. This is also the first implementation of a four-tower siamese-type architecture both for separation of independent inputs and inclusion of context information. The network classifies clusters of energy deposits from the NOvA neutrino detectors as electrons, muons, photons, pions, and protons with an overall efficiency and purity of 83.3% and 83.5%, respectively. We show that providing the network with context information improves performance by comparing our results with a network trained without context information.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Networked HIL Simulation System for Modeling Large-scale Power Systems

This paper presents a networked hardware-in-the-loop (HIL) simulation system for modeling large-scale power systems. Researchers have developed many HIL test systems for power systems in recent years. Those test systems can model both microsecond-level dynamic responses of power electronic systems and millisecond-level transients of transmission and distribution grids. By integrating individual HIL test systems into a network of HIL test systems, we can create large-scale power grid digital twins with flexible structures at required modeling resolution that fits for a wide range of system operating conditions. This will not only significantly reduce the need for field tests when developing new technologies but also greatly shorten the model development cycle. In this paper, we present a networked OPAL-RT based HIL test system for developing transmission-distribution coordinative Volt-VAr regulation technologies as an example to illustrate system setups, communication requirements among different HIL simulation systems, and system connection mechanisms. Impacts of communication delays, information exchange cycles, and computing delays are illustrated. Simulation results show that the performance of a networked HIL test system is satisfactory.

Xie, Fuhong↗
DOE OSTI2022

Rates and Reversibilities in Interconnected Reaction Networks

Mathematical relations prescribing unidirectional forward and reverse rates originally derived based on single-path reaction sequences do not apply to interconnected reaction networks. The presence of branches in reaction networks, leading to alternative stable products, decreases unidirectional rates in reference to those calculated by single-path functional forms, as shown by simulated isotopic exchange rates, but impacts the unidirectional forward and reverse rates equally such that the functional form of effective reversibility remains unchanged. Regardless of stoichiometric numbers and network connectivity, the application of the pseudo-steady-state hypothesis on reactive intermediates in conjunction with consideration of unidirectional rates toward the product of interest and all alternative stable products results in mathematical expressions that accurately reflect simulated isotopic exchange rates. Further analyses based on kinetic resistance, a property akin to electrical resistance, illustrate the manifestation of nodal resistances in addition to the single-path kinetic resistance for interconnected reaction networks. The generalized formalism for assessing rates and reversibilities in interconnected networks derived herein enables us to demonstrate that unidirectional rates cannot be assessed solely from effective reversibilities and net rates of generation of stable species in such networks. Furthermore, isotopic exchange rates, under the condition that each elementary step in the overall reaction sequence forms a unique reactive intermediate that is consumed solely by the subsequent step, can be utilized to determine unidirectional rates and can serve to validate postulated reaction pathways in highly interconnected reaction networks (e.g., CO x hydrogenation).

42 ENGINEERING↗
DOE OSTI2025

Hierarchical Network Partitioning for Solution of Potential-Driven, Steady-State Nonlinear Network Flow Equations

The solution of potential-driven steady-state flow in large networks is a task which manifests in various engineering applications, such as transport of natural gas or water through pipeline networks. The resultant system of nonlinear equations depends on the network topology, and in general, there is no numerical algorithm that offers guaranteed convergence to the solution (assuming a solution exists). Some methods offer guarantees in cases where the network topology satisfies certain assumptions, but these methods fail for larger networks. On the other hand, the Newton-Raphson algorithm offers a convergence guarantee if the starting point lies close to the (unknown) solution. It would be advantageous to compute the solution of the large nonlinear system through the solution of smaller nonlinear sub-systems wherein the solution algorithms (Newton-Raphson or otherwise) are more likely to succeed. Here, this letter proposes and describes such a procedure, a hierarchical network partitioning algorithm that enables the solution of large nonlinear systems corresponding to potential-driven steady-state network flow equations.

42 ENGINEERING↗
DOE OSTI2025

xGFabric: Coupling Sensor Networks and HPC Facilities with Private 5G Wireless Networks for Real-Time Digital Agriculture

Advanced scientific applications require coupling distributed sensor networks with centralized high-performance computing facilities. Citrus Under Protective Screening (CUPS) exemplifies this need in digital agriculture, where citrus research facilities are instrumented with numerous sensors monitoring environmental conditions and detecting protective screening damage. CUPS demands access to computational fluid dynamics codes for modeling environmental conditions and guiding real-time interventions like water application or robotic repairs. These computing domains have contrasting properties: sensor networks provide low-performance, limited-capacity, unreliable data access, while high-performance facilities offer enormous computing power through high-latency batch processing. Private 5G networks present novel capabilities addressing this challenge by providing low latency, high throughput, and reliability necessary for near-real-time coupling of edge sensor networks with HPC simulations. This work presents xGFabric, an end-to-end system coupling sensor networks with HPC facilities through Private 5G networks. The prototype connects remote sensors via 5G network slicing to HPC systems, enabling real-time digital agriculture simulation.

Digital Agriculture↗
DOE OSTI2022

Adaptive Fault Detection Based on Neural Networks and Multiple Sampling Points for Distribution Networks and Microgrids

Smart networks such as microgrid (MG) and active distribution networks (ADN) have been recently playing an important role in power system operation. The design and implementation of appropriate protection systems for such networks must be addressed, which imposes new technical challenges. This paper presents the implementation and validation aspects of an adaptive fault detection strategy based on neural networks (NNs) and multiple sampling points for ADN and MG. The solution is implemented on an edge device. Artificial NNs are used to derive a data-driven model that uses only local measurements to detect fault states of the network without the need for communication infrastructure. Multiple sampling points are used to derive a data-driven model, which allows the generalization considering the implementation in physical systems. The adaptive fault detector model is implemented on a Jetson Nano system, which is a single-board computer (SBC) with a small Graphic Processing Unit (GPU) intended to run machine learning loads at the edge. The proposed method is tested in a physical, real-life, low-voltage network located at Universidad del Norte, Colombia. This testing network is based on the IEEE-13 Node Test Feeder scaled down to 220 V. The validation in a simulation environment shows the accuracy and dependability above 99.6%, while the real-time tests show the accuracy and dependability of 95.5% and 100%, respectively. Without hard-to-derive parameters, the easy-to-implement embedded model highlights the potential for real-life applications.

42 ENGINEERING↗
DOE OSTI2021

Shear Stress Dependence of Force Networks in 3D Dense Suspensions

The geometric organization and force networks of 3D dense suspensions that exhibit both shear thinning and thickening have been examined as a function of varying strength of interparticle attractive interactions using lubrication flow discrete element simulations. Significant rearrangement of the geometric topology does not occur at either the local or global scale as these systems transition across the shear thinning and shear thickening regimes. In contrast massive rearrangements in the balance of attractive, lubrication, and contact forces are observed with interesting behavior of network growth and competition. In agreement with prior work, in shear thinning regions the attractive force is dominant, however as the shear thickening region is approached there is growth of lubrication forces. Lubrication forces oppose the attraction forces, but as viscosity continues to increase under increasing shear stress, the lubrication forces are dominated by contact forces that also resist attraction. Contact forces are the dominant interactions during shear thickening and are an order of magnitude higher than their values in the shear-thinning regime. At high attractive interaction strength, contact networks can form even under shear thinning conditions, however high shear stress is still required before contact networks become the driving mechanism of shear thickening. Analysis of the contact force network during shear thickening generally indicate a uniformly spreading network that rapidly forms across empty domains, however the growth patterns have structure that are significantly dependent upon the strength of interparticle interactions, indicating subtle variations in the mechanism of shear thickening.

Edens, Lance E.↗
DOE OSTI2021

Illinois Express Quantum Network (IEQNET): metropolitan-scale experimental quantum networking over deployed optical fiber

The Illinois Express Quantum Network (IEQNET) is a program to realize metro-scale quantum networking over deployed optical fiber using currently available technology. IEQNET consists of multiple sites that are geographically dispersed in the Chicago metropolitan area. Each site has one or more quantum nodes (Qnodes) representing the communication parties in a quantum network. Q-nodes generate or measure quantum signals such as entangled photons and communicate the results via standard, classical, means. The entangled photons in IEQNET nodes are generated at multiple wavelengths, and are selectively distributed to the desired users via optical switches. Here we describe the network architecture of IEQNET, including the Internet-inspired layered hierarchy that leverages software-defined-networking (SDN) technology to perform traditional wavelength routing and assignment between the Q-nodes. Specifically, SDN decouples the control and data planes, with the control plane being entirely classical. Issues associated with synchronization, calibration, network monitoring, and scheduling will be discussed. An important goal of IEQNET is demonstrating the extent to which the control plane can coexist with the data plane using the same fiber lines. This goal is furthered by the use of tunable narrow-band optical filtering at the receivers and, at least in some cases, a wide wavelength separation between the quantum and classical channels. We envision IEQNET to aid in developing robust and practical quantum networks by demonstrating metro-scale quantum communication tasks such as entanglement distribution and quantum-state teleportation.

Chung, Joaquin↗
DOE OSTI2022

Nonlocal Kernel Network (NKN): a Stable and Resolution-Independent Deep Neural Network.

Neural operators have recently become popular tools for designing solution maps between function spaces in the form of neural networks. Differently from classical scientific machine learning approaches that learn parameters of a known partial differential equation (PDE) for a single instance of the input parameters at a fixed resolution, neural operators approximate the solution map of a family of PDEs [6, 7]. Despite their success, the uses of neural operators are so far restricted to relatively shallow neural networks and confined to learning hidden governing laws. In this work, we propose a novel nonlocal neural operator, which we refer to as nonlocal kernel network (NKN), that is resolution independent, characterized by deep neural networks, and capable of handling a variety of tasks such as learning governing equations and classifying images. Our NKN stems from the interpretation of the neural network as a discrete nonlocal diffusion reaction equation that, in the limit of infinite layers, is equivalent to a parabolic nonlocal equation, whose stability is analyzed via nonlocal vector calculus. The resemblance with integral forms of neural operators allows NKNs to capture long-range dependencies in the feature space, while the continuous treatment of node-to-node interactions makes NKNs resolution independent. The resemblance with neural ODEs, reinterpreted in a nonlocal sense, and the stable network dynamics between layers allow for generalization of NKN’s optimal parameters from shallow to deep networks. This fact enables the use of shallow-to-deep initialization techniques [8]. Our tests show that NKNs outperform baseline methods in both learning governing equations and image classification tasks and generalize well to different resolutions and depths.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

B-PINNs: Bayesian Physics-informal Neural Networks for Forward and Inverse PDE Problems with Noisy Data

We propose a Bayesian physics-informed neural network (B-PINN) to solve both forward and inverse nonlinear problems described by partial differential equations (PDEs) and noisy data. In this Bayesian framework, the Bayesian neural network (BNN) combined with a PINN for PDEs serves as the prior while the Hamiltonian Monte Carlo (HMC) or the variational inference (VI) could serve as an estimator of the posterior. B-PINNs make use of both physical laws and scattered noisy measurements to provide predictions and quantify the aleatoric uncertainty arising from the noisy data in the Bayesian framework. Compared with PINNs, in addition to uncertainty quantification, B-PINNs obtain more accurate predictions in scenarios with large noise due to their capability of avoiding overfitting. We conduct a systematic comparison between the two different approaches for the B-PINNs posterior estimation (i.e., HMC or VI), along with dropout used for quantifying uncertainty in deep neural networks. Our experiments show that HMC is more suitable than VI with mean field Gaussian approximation for the B-PINNs posterior estimation, while dropout employed in PINNs can hardly provide accurate predictions with reasonable uncertainty. Finally, we replace the BNN in the prior with a truncated Karhunen-Loève (KL) expansion combined with HMC or a deep normalizing flow (DNF) model as posterior estimators. The KL is as accurate as BNN and much faster but this framework cannot be easily extended to high-dimensional problems unlike the BNN based framework.

Non linear PDEs, Noisy data, Bysian physics inform↗
DOE OSTI2021

Tunable Stochasticity in an Artificial Spin Network

Metamaterials present the possibility of artificially generating advanced functionalities through engineering of their internal structure. Artificial spin networks, in which a large number of nanoscale magnetic elements are coupled together, are promising metamaterial candidates that enable the control of collective magnetic behavior through tuning of the local interaction between elements. In this work, the motion of magnetic domain-walls in an artificial spin network leads to a tunable stochastic response of the metamaterial, which can be tailored through an external magnetic field and local lattice modifications. This type of tunable stochastic network produces a controllable random response exploiting intrinsic stochasticity within magnetic domain-wall motion at the nanoscale. An iconic demonstration used to illustrate the control of randomness is the Galton board. In this system, multiple balls fall into an array of pegs to generate a bell-shaped curve that can be modified via the array spacing or the tilt of the board. A nanoscale recreation of this experiment using an artificial spin network is employed to demonstrate tunable stochasticity. Furthermore, this type of tunable stochastic network opens new paths toward post-Von Neumann computing architectures such as Bayesian sensing or random neural networks, in which stochasticity is harnessed to efficiently perform complex computational tasks.

Artificial spin network↗