Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

Aviation Transportation, Cyber Threats, and Network-of-Networks: Modeling Perspectives for Translating Theory to Practice

Understanding aviation transportation infrastructure system behavior and coupling with communication networks is essential for securing and restoring functionality against cyber-enabled threats. While significant progress has been made in the past decade on developing infrastructure resilience theories based on network structure and operations, translating and generalizing them to real-world practice has often been challenging due to imperfect data and inapplicability of modeling assumptions. These typically include: 1) stylized network structures without uncertainty, 2) node homogeneity, 3) static criticality measures, and 4) unrealistic cascade models originating from single points of failure. This paper presents modeling perspectives that aim to address these theory-to-practice challenges using a well-grounded network-of-networks (NoN) construct. Real-world modeling challenges are identified and a network theory-guided conceptual NoN model is developed that may be operationalized with the U.S. national airspace system airport network (NASAN) and Federal Aviation Administration (FAA) communication network as application domain. Improving accuracy in loss of functionality estimates due to cyber events in communication networks and cascading air travel delay impacts is key for informing consequence-based decision support and risk/contingency analyses.

Bhatia, Udit↗
DOE OSTI2022

Toward higher-radix switches with co-packaged optics for improved network locality in data center and HPC networks [Invited]

In this work, we study the network locality improvements that can be achieved by using co-packaged optics in data center and high-performance computing (HPC) networks. The increased escape bandwidth offered by co-packaged optics can enable switches with speeds of 51.2 Tb/s and beyond. From a network architecture perspective, the key advantages of introducing co-packaged optics at the switch points include the implementation of large-scale topologies of >12,000 end points with 4× higher bisection bandwidth and the reduction of the required number of switches by >40% compared with state-of-the-art approaches. From a network operation perspective, improved network locality and faster operation can be achieved since the higher-radix switches can mitigate the impact of network contention. Placing applications under fewer leaf switches reduces the number of packets that cross the spine switches in a leaf-spine topology. The proposed scheme is evaluated via discrete-event simulations: we initially evaluate the network locality properties of the system by using virtual-machine traces from a production data center, and we subsequently quantify the performance improvements by simulating an all-to-all pattern for a variety of message sizes over a number of nodes. The results suggest that co-packaged optics form a promising solution for keeping up with bandwidth scaling in future networks. The virtual-machine analysis shows that large-scale applications can be placed under up to 50% fewer first-level switches, while the network analysis shows speedups of up to 7.1, which translates to execution time reductions of up to 26% and 42.7% for applications with communication ratios of 0.3 and 0.5, respectively.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2015

The underground research facilities (URF) network - illustrating the IAEA's concept and use of professional networks - 15382

Since 2001, the IAEA has championed the concept and use of professional networks (Communities of Practice) to advance best practices and to provide a platform for cooperation in radioactive waste management, decommissioning and environmental remediation across the globe. The Underground Research Facilities (URF) Network was the first in a series of networks implemented under the auspices of the IAEA to share experiences, elicit best practices, and transfer knowledge on topics relevant to the development and implementation of geological disposal of long lived and high level radioactive waste - i.e. intermediate level waste (ILW), high-level waste (HLW) and/or spent nuclear fuel (SNF). Special emphasis is placed on the role and use of URFs to support such geological disposal developments. In addition to the direct benefits provided to Member States through its programme of work, the URF Network also delivers less tangible, yet equally valuable benefits through the informal exchange of information, the development of peer-to-peer professional networks, and seeding of multi-lateral cooperation between Member States. Network members represent a range of nuclear programme sizes and advancements in their respective repository programmes. After a decade of fruitful cooperation, delivering more than 30 training courses on topics relevant to geological disposal, the URF Network is gradually reassessing its mode of operation and focus of work. Emphasizing selected strategic goals - focused in part on more systematic training of URF Network members human resources and in part on select key technical issues - would benefit all network members, while remaining cautious in the commitment of scarce resources. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2022

Retracted Article: Distributed energy management for networked microgrids in a three-phase unbalanced distribution network

Owing to increased penetration of three-phase and single-phase microgrids, distributed energy resources (DERs), and responsive loads, the maintenance of a three-phase balance by distribution networks is a significant challenge. Existing literature on distributed energy management for networked microgrids generally neglects the distribution network or employs a simplified phase balanced distribution network; thus, these evaluations are not applicable. Further, the underlying mutual coupling between the different phases of distribution feeders results in a more challenging situation. Here, to solve this issue, this study sought to propose distributed energy management based on a three-phase unbalanced distribution network. Various three-phase or single-phase microgrids, utility-owned DERs, and responsive loads were coordinated through iteratively adjusted price signals. Based on the price signals received, the microgrid controllers (MCs) and distribution management system (DMS) updated the schedules of the DERs and responsive loads under their jurisdiction separately. The price signals were then updated according to the generation-load mismatch at each node and distributed to the corresponding MCs and DMS for the next iteration. The iteration continued until a sufficiently small generation-load mismatch was achieved at all nodes, that is, a balanced generation and load at all nodes under the agreed price signals. Considering a three-phase unbalanced distribution network, the price signals were determined per phase per node. Overall, the proposed distributed energy management coordinates microgrids, utility-owned DERs, responsive loads with guaranteed network constraints, and preserves the privacy of microgrid customers. This distributed energy management method was further demonstrated through various case studies on a three-phase networked microgrid test system.

24 POWER TRANSMISSION AND DISTRIBUTION↗
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 OSTI2017

Evolving Deep Networks Using HPC

While a large number of deep learning networks have been studiedand published that produce outstanding results on natural imagedatasets, these datasets only make up a fraction of those to whichdeep learning can be applied. These datasets include text data, audiodata, and arrays of sensors that have very different characteristicsthan natural images. As these “best” networks for natural imageshave been largely discovered through experimentation and cannotbe proven optimal on some theoretical basis, there is no reasonto believe that they are the optimal network for these drasticallydifferent datasets. Hyperparameter search is thus often a very im-portant process when applying deep learning to a new problem. Inthis work we present an evolutionary approach to searching thepossible space of network hyperparameters and construction thatcan scale to 18, 000 nodes. This approach is applied to datasets ofvarying types and characteristics where we demonstrate the abilityto rapidly find best hyperparameters in order to enable practitionersto quickly iterate between idea and result.

Young, Steven↗
NASA NTRS2005

A Comparison of Geographic Information Systems, Complex Networks, and Other Models for Analyzing Transportation Network Topologies

This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.

Alexandrov, Natalia↗
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↗