Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

How Does Flow Alteration Propagate Across a Large, Highly Regulated Basin? Dam Attributes, Network Context, and Implications for Biodiversity

Abstract Large dams are a leading cause of river ecosystem degradation. Although dams have cumulative effects as water flows downstream in a river network, most flow alteration research has focused on local impacts of single dams. Here we examined the highly regulated Colorado River Basin (CRB) to understand how flow alteration propagates in river networks, as influenced by the location and characteristics of dams as well as the structure of the river network—including the presence of tributaries. We used a spatial Markov network model informed by 117 upstream‐downstream pairs of monthly flow series (2003–2017) to estimate flow alteration from 84 intermediate‐to‐large dams representing >83% of the total storage in the CRB. Using Least Absolute Shrinkage and Selection Operator regression, we then investigated how flow alteration was influenced by local dam properties (e.g., purpose, storage capacity) and network‐level attributes (e.g., position, upstream cumulative storage). Flow alteration was highly variable across the network, but tended to accumulate downstream and remained high in the main stem. Dam impacts were explained by network‐level attributes (63%) more than by local dam properties (37%), underscoring the need to consider network context when assessing dam impacts. High‐impact dams were often located in sub‐watersheds with high levels of native fish biodiversity, fish imperilment, or species requiring seasonal flows that are no longer present. These three biodiversity dimensions, as well as the amount of dam‐free downstream habitat, indicate potential to restore river ecosystems via controlled flow releases. Our methods are transferrable and could guide screening for dam reoperation in other highly regulated basins.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Range and strength of mechanical interactions of force dipoles in elastic fiber networks

Mechanical forces generated by myosin II molecular motors drive diverse cellular processes, most notably shape change, division and locomotion. These forces may be transmitted over long range through the cytoskeletal medium – a disordered, viscoelastic network of biopolymers. The resulting cell size scale force chains can in principle mediate mechanical interactions between distant actomyosin units, leading to self-organized structural order in the cell cytoskeleton. Inspired by such force transmission through elastic structures in the cytoskeleton, we consider a percolated fiber lattice network, where fibers are represented as linear elastic elements that can both bend and stretch, and the contractile activity of myosin motors is represented by force dipoles. Then, by using a variety of metrics, we show how two such contractile force dipoles interact with each other through their mutual mechanical deformations of the elastic fiber network. As a prelude to two-dipole interactions, we quantify how forces propagate through the network from a single anisotropic force dipole by analyzing clusters of nodes connected by highly strained bonds, as well as through the decay rate of strain energy with distance from a force dipole. We show that predominant fiber bending screens out force propagation, resulting in reduced and strongly network configuration-dependent dipole interactions. On the other hand, stretching-dominated networks support longer-ranged inter-dipole interactions that recapitulate the predictions of linear elasticity theory. By characterizing the differences between tensile and compressive force propagation in the fiber network, we show how inter-dipole interaction depends on the dipoles’ mutual separation and orientation. The resulting elastic interaction energy may mediate a force between multiple distant dipoles, leading to their self-organization into ordered configurations. In conclusion, this provides a potential pathway for active mechanical force-driven structural order in elastic biopolymer networks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Effect of penetrant–polymer interactions and shape on the motion of molecular penetrants in dense polymer networks

The diffusion of dilute molecular penetrants within polymers plays a crucial role in the advancement of material engineering for applications such as coatings and membrane separations. The potential of highly cross-linked polymer networks in these applications stems from their capacity to adjust the size and shape selectivity through subtle changes in network structures. In this paper, we use molecular dynamics simulation to understand the role of penetrant shape (aspect ratios) and its interaction with polymer networks on its diffusivity. We characterize both local penetrant hopping and the long-time diffusive motion for penetrants and consider different aspect ratios and penetrant–network interaction strengths at a variety of cross-link densities and temperatures. The shape affects the coupling of penetrant motion to the cross-link density- and temperature-dependent structural relaxation of networks and also affects the way a penetrant experiences the confinement from the network meshes. The attractive interaction between the penetrant and network primarily affects the former since only the system of dilute limit is of present interest. These results offer fundamental insights into the intricate interplay between penetrant characteristics and polymer network properties and also suggest future directions for manipulating polymer design to enhance the separation efficiency.

Chemistry↗
DOE OSTI2024

Collective neural network behavior in a dynamically driven disordered system of superconducting loops

Collective properties of complex systems composed of many interacting components such as neurons in our brain can be modeled by artificial networks based on disordered systems. We show that a disordered neural network of superconducting loops with Josephson junctions can exhibit computational properties like categorization and associative memory in the time evolution of its state in response to information from external excitations. Superconducting loops can trap multiples of fluxons in many discrete memory configurations defined by the local free energy minima in the configuration space of all possible states. A memory state can be updated by exciting the Josephson junctions to fire or allow the movement of fluxons through the network as the current through them surpasses their critical current thresholds. Simulations performed with a lumped element circuit model of a 4-loop network show that information written through excitations is translated into stable states of trapped flux and their time evolution. Experimental implementation on a high-Tc superconductor YBCO-based 4-loop network shows dynamically stable flux flow in each pathway characterized by the correlations between junction firing statistics. Neural network behavior is observed as energy barriers separating state categories in simulations in response to multiple excitations, and experimentally as junction responses characterizing different flux flow patterns in the network. The state categories that produce these patterns have different temporal stabilities relative to each other and the excitations. This provides strong evidence for time-dependent (short-to-long-term) memories, that are dependent on the geometrical and junction parameters of the loops, as described with a network model.

Josephson junctions↗
DOE OSTI2025

Feature learning and generalization in deep networks with orthogonal weights

Fully-connected deep neural networks with weights initialized from independent Gaussian distributions can be tuned to criticality, which prevents the exponential growth or decay of signals propagating through the network. However, such networks still exhibit fluctuations that grow linearly with the depth of the network, which may impair the training of networks with width comparable to depth. We show analytically that rectangular networks with tanh activations and weights initialized from the ensemble of orthogonal matrices have corresponding preactivation fluctuations which are independent of depth, to leading order in inverse width. Moreover, we demonstrate numerically that, at initialization, all correlators involving the neural tangent kernel (NTK) and its descendants at leading order in inverse width—which govern the evolution of observables during training—saturate at a depth of ~20, rather than growing without bound as in the case of Gaussian initializations. We speculate that this structure preserves finite-width feature learning while reducing overall noise, thus improving both generalization and training speed in deep networks with depth comparable to width. We provide some experimental justification by relating empirical measurements of the NTK to the superior performance of deep non-linear orthogonal networks trained under full-batch gradient descent on the MNIST and CIFAR-10 classification tasks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Benefits and Limits of Phasing Alleles for Network Inference of Allopolyploid Complexes

Abstract Accurately reconstructing the reticulate histories of polyploids remains a central challenge for understanding plant evolution. Although phylogenetic networks can provide insights into relationships among polyploid lineages, inferring networks may be hindered by the complexities of homology determination in polyploid taxa. We use simulations to show that phasing alleles from allopolyploid individuals can improve phylogenetic network inference under the multispecies coalescent by obtaining the true network with fewer loci compared with haplotype consensus sequences or sequences with heterozygous bases represented as ambiguity codes. Phased allelic data can also improve divergence time estimates for networks, which is helpful for evaluating allopolyploid speciation hypotheses and proposing mechanisms of speciation. To achieve these outcomes in empirical data, we present a novel pipeline that leverages a recently developed phasing algorithm to reliably phase alleles from polyploids. This pipeline is especially appropriate for target enrichment data, where the depth of coverage is typically high enough to phase entire loci. We provide an empirical example in the North American Dryopteris fern complex that demonstrates insights from phased data as well as the challenges of network inference. We establish that our pipeline (PATÉ: Phased Alleles from Target Enrichment data) is capable of recovering a high proportion of phased loci from both diploids and polyploids. These data may improve network estimates compared with using haplotype consensus assemblies by accurately inferring the direction of gene flow, but statistical nonidentifiability of phylogenetic networks poses a barrier to inferring the evolutionary history of reticulate complexes.

Evolutionary Biology↗
DOE OSTI2021

Leveraging In-Network Computing and Programmable Switches for Streaming Analysis of Scientific Data

With the emergence of programmable network devices that match the performance of fixed function devices, several recent projects have explored in-network computing, where the processing that is traditionally done outside the network is offloaded to the network devices. In-network computing has typically been applied to network functions (e.g., load balancing, NAT, and DNS), caching, data reduction/aggregation, and coordination/consensus functions. In some cases it has been used to accelerate stream-processing tasks that involve small payloads and simple operations. In this work we focus on leveraging in-network computing for stream processing of scientific datasets with large payloads that require complex operations such as floating-point computations and logarithmic functions. We demonstrate in-network computing for a real-world scientific application performing streaming normalization of a 2-D image from a light source experiment. We discuss the challenges we encountered and potential approaches to address them.

Sankaran, Ganesh↗
DOE OSTI2024

Physics-Guided, Physics-Informed, and Physics-Encoded Neural Networks and Operators in Scientific Computing: Fluid and Solid Mechanics

Abstract Advancements in computing power have recently made it possible to utilize machine learning and deep learning to push scientific computing forward in a range of disciplines, such as fluid mechanics, solid mechanics, materials science, etc. The incorporation of neural networks is particularly crucial in this hybridization process. Due to their intrinsic architecture, conventional neural networks cannot be successfully trained and scoped when data are sparse, which is the case in many scientific and engineering domains. Nonetheless, neural networks provide a solid foundation to respect physics-driven or knowledge-based constraints during training. Generally speaking, there are three distinct neural network frameworks to enforce the underlying physics: (i) physics-guided neural networks (PgNNs), (ii) physics-informed neural networks (PiNNs), and (iii) physics-encoded neural networks (PeNNs). These methods provide distinct advantages for accelerating the numerical modeling of complex multiscale multiphysics phenomena. In addition, the recent developments in neural operators (NOs) add another dimension to these new simulation paradigms, especially when the real-time prediction of complex multiphysics systems is required. All these models also come with their own unique drawbacks and limitations that call for further fundamental research. This study aims to present a review of the four neural network frameworks (i.e., PgNNs, PiNNs, PeNNs, and NOs) used in scientific computing research. The state-of-the-art architectures and their applications are reviewed, limitations are discussed, and future research opportunities are presented in terms of improving algorithms, considering causalities, expanding applications, and coupling scientific and deep learning solvers.

Computer Science↗
DOE OSTI2022

Performance trade-offs in reconfigurable networks for HPC

Designing efficient interconnects to support high-bandwidth and low-latency communication is critical toward realizing high performance computing (HPC) and data center (DC) systems in the exascale era. At extreme computing scales, providing the requisite bandwidth through overprovisioning becomes impractical. These challenges have motivated studies exploring reconfigurable network architectures that can adapt to traffic patterns at runtime using optical circuit switching. Despite the plethora of proposed architectures, surprisingly little is known about the relative performances and trade-offs among different reconfigurable network designs. We aim to bridge this gap by tackling two key issues in reconfigurable network design. First, we study how cost, power consumption, network performance, and scalability vary based on optical circuit switch (OCS) placement in the physical topology. Specifically, we consider two classes of reconfigurable architectures: one that places OCSs between top-of-rack (ToR) switches—ToR-reconfigurable networks (TRNs)—and one that places OCSs between pods of racks—pod-reconfigurable networks (PRNs). Second, we tackle the effects of reconfiguration frequency on network performance. Our results, based on network simulations driven by real HPC and DC workloads, show that while TRNs are optimized for low fan-out communication patterns, they are less suited for carrying high fan-out workloads. PRNs exhibit better overall trade-off, capable of performing comparably to a fully non-blocking fat tree for low fan-out workloads, and significantly outperform TRNs for high fan-out communication patterns.

Teh, Min Yee↗
DOE OSTI2024

Exploring the benefits of using co-packaged optics in data center and AI supercomputer networks: a simulation-based analysis [Invited]

We investigate the advantages of using co-packaged optics in next-generation data center and AI supercomputer networks. The increased escape bandwidth offered by co-packaged optics provides multiple possibilities for building 50T switches and beyond, expanding the opportunities in both the data center and supercomputing domains. Furthermore, this provides network architects with the opportunity to expand their design space and develop simplified networks with enhanced network locality properties. Co-packaging at the switch and server points enables networks with double capacity while reducing the switch count by 64% compared to state-of-the-art systems. We evaluate these concepts through discrete-event simulations using all-to-all and all-reduce traffic patterns that simulate collective communications commonly found in network-bound applications. Initially, we investigate the all-to-all overhead involved in distributing the virtual machines of the applications across multiple leaf switches and compare it to the scenario in which all VMs are placed under a single switch. Subsequently, we evaluate the performance of an AI supercomputing cluster by simulating both patterns for different message sizes, while also varying the number of participating nodes. The results suggest that networks with improved locality properties become increasingly important as the network stack operates at higher speeds; for a stack latency of 1.25 µs, placing the applications under multiple switches can result in up to 68% higher completion times than placing them under a single switch. For AI supercomputers, significant improvements are observed in the mean server throughput, reaching more than 90% for configurations involving 256 nodes and message sizes of at least 128 KiB.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2021

Exploration of multifidelity UQ sampling strategies for computer network applications.

Network modeling is a powerful tool to enable rapid analysis of complex systems that can be challenging to study directly using physical testing. Here, two approaches are considered: emulation and simulation. The former runs real software on virtualized hardware, while the latter mimics the behavior of network components and their interactions in software. Although emulation provides an accurate representation of physical networks, this approach alone cannot guarantee the characterization of the system under realistic operative conditions. Operative conditions for physical networks are often characterized by intrinsic variability (payload size, packet latency, etc.) or a lack of precise knowledge regarding the network configuration (bandwidth, delays, etc.); therefore uncertainty quantification (UQ) strategies should be also employed. UQ strategies require multiple evaluations of the system with a number of evaluation instances that roughly increases with the problem dimensionality, i.e., the number of uncertain parameters. It follows that a typical UQ workflow for network modeling based on emulation can easily become unattainable due to its prohibitive computational cost. In this paper, a multifidelity sampling approach is discussed and applied to network modeling problems. The main idea is to optimally fuse information coming from simulations, which are a low-fidelity version of the emulation problem of interest, in order to decrease the estimator variance. By reducing the estimator variance in a sampling approach it is usually possible to obtain more reliable statistics and therefore a more reliable system characterization. Several network problems of increasing difficulty are presented. For each of them, the performance of the multifidelity estimator is compared with respect to the single fidelity counterpart, namely, Monte Carlo sampling. For all the test problems studied in this work, the multifidelity estimator demonstrated an increased efficiency with respect to MC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

On the Robustness of Network Community Structure Under Addition of Edges

Communities represent important functional modules in networked systems. A key goal in preserving such communities is understanding their robustness under perturbations. Previous research has studied the impact of node removals and edge removals on the community structure. However, the impact of edge additions on the robustness of the community structure is relatively unknown. Edge additions or false positive edges may simulate measurement errors or external exceptional events that threaten the functionality of networked systems. Here, we study the impact of edge additions on the community structure using Lancichinetti-Fortunato-Radicchi (LFR) benchmark networks. We show that, for a fixed network size, the impact of edge additions is greater on networks with initially weak community structure than on networks with strongly clustered structures. In addition, we find that the perception of the impact is also dependent on the community detection algorithm used to uncover communities. In particular, we found that modularity-based methods such as Leiden and Louvain are less affected than information-theoretic and message passing-based methods such as Infomap and Label Propagation. Our results demonstrate that edge addition can (a) significantly impact the community structure of networks based on their initial conditions, and (b) the perception of the impact is dependent on the community detection algorithm used. We describe limitations, open challenges, and how this methodology can inform the design of resilient networked systems under edge additions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Understanding Discrete Fracture Networks Through Spectral Graph Theory

Discrete Fracture Network models (DFNs) are used to simulate fluid flow and particle transport through fracture networks in low permeability rock. Understanding these processes are essential in many subsurface applications, such as environmental restoration of contaminated fractured media, CO 2 sequestration, detection of low-level nuclear tests, and hydrocarbon extraction. Compared with other models, DFNs allow for incorporation of a wider range of network characteristics but have substantially greater computation cost. These networks can be represented with graphs, allowing the use of graph theory tools to study the networks. I used Python to simulate flow and transport on a range of DFNs and analyzed these networks using methods from network analysis and spectral graph theory. My purpose was to find ways to gain insight about flow and transport on DFNs using these graph representations, bypassing the computationally intensive meshing typically required. My work is still in progress, but I have discovered several interesting trends and patterns that I believe could be useful towards my goal. If I am able to bring these results to fruition, they will aid subsurface geologists in extracting flow and transport information about fracture networks more efficiently.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

LaserNetUS Collaboration Network—University of Rochester (Final Report)

LaserNetUS Collaborative Network established in 2018 is a network of high-power laser facilities supported by the Department of Energy (DOE) Office of Fusion Energy Sciences (FES) and operating effectively as a user facility. Its mission is to advance and promote intense laser science and applications by providing scientists and students with broad access to unique facilities and enabling technologies, advancing the frontiers of laser-science research, and fostering collaboration among researchers and networks from around the world. Users who submit proposals through an annual call are selected by an external and independent proposal review panel (PRP) not involving personnel from any of the facilities. Besides the Omega Laser Facility at the University of Rochester’s Laboratory for Laser Energetics (UR/LLE), the network during this project period includes high-intensity laser facilities from six other universities and three national laboratories, namely, the Colorado State University (CSU), the University of Michigan (UM), the University of Nebraska at Lincoln (UNL), The Ohio State University (OSU), Université du Québec, the University of Texas at Austin (UT Austin), Lawrence Berkeley National Laboratory (LBNL), SLAC National Accelerator Laboratory (SLAC) and Lawrence Livermore National Laboratory (LLNL), respectively. The network facilities span a wide range in laser pulse energy, pulse duration, repetition rate, and experimental diagnostic equipment enabling innovative research in a variety of exciting areas. Details of the LaserNetUS facilities, organization and committees, events, and accomplishments can be found at the network website (https://lasernetus.org/). A very important role that the LaserNetUS fulfills is the training of students and young scientists who will be key for the future development of laser-plasma science and high-power laser technology itself. The network provides these students not only with access to the most advanced instrumentation and laser facilities, but also the opportunities to interact and collaborate with students from other institutions and with a large group of experienced scientists. As the largest university-based laser users’ facility in the world, the Omega Laser Facility at the UR/LLE has served the high-energy-density physics (HEDP) and inertial fusion science community for nearly 40 years. The multi-beam multi-kJ OMEGA EP Laser System brings unique capabilities to the LaserNetUS network. The combination of high intensity and high energy in short- and long-pulse operation together with solid or gas-jet targets and externally applied magnetic fields provides users a wide domain of experimental conditions. This award provides a total of eight shot days on OMEGA EP for LaserNetUS users. During the award period of performance (June 2019–November 2021), seven teams have fully utilized the eight shot days for their unique science experiments on OMEGA EP with a total of 83 target shots. These experiments involve 13 graduate students, two undergraduate students and six postdoctoral researchers. Results have been widely disseminated at international conferences including LaserNetUS annual meeting (~20 presentations including three invited), and in peer-reviewed journal publications (three published with several manuscripts in preparation).

36 MATERIALS SCIENCE↗
DOE OSTI2023

The Hidden Flexibility of the Natural Gas Network for Electric Power Operations: A Case Study of a Near-Miss Winter Event

The U.S. power sector has become increasingly reliant on gas pipeline networks to deliver fuel to natural gas power plants. In addition to supplying relatively low-cost fuel, gas networks offer generators flexibility in their operations through the ability to deliver fuel when needed by using gas storage facilities or linepack if the gas network is at an operating point below its design capacity. However, disruptions or stress events on the gas network - like those occurring in the Northeast and Texas in recent years - can result in limitations on gas availability to generators at times when generation is in short supply. Here we examine a period of stress that occurred in the winter of 2022 in the Western United States. Using data on the region's natural gas pipeline network and electric generators, we build an integrated gas and electric model that closely replicates the actual dispatch of the period. We then evaluate the implications of removing flexibility employed by the gas network operator, which during that period curtailed scheduled gas deliveries to other parties to increase deliveries to natural gas power plants, which requested more gas than initially forecasted. We find that without the flexibility supplied by the gas network operator, there would have been curtailment of gas generation due to gas offtake constraints, requiring the power system operator to redispatch relying on more expensive generation or to potentially shed load. A sensitivity exploring a wind drought further exacerbates the strain, illustrating the potential challenge of managing gas and grid interactions as systems move to higher shares of variable renewable electricity. Based on this example, we discuss potential coordination strategies between the two system operators to ensure that the power system can successfully utilize and rely on the flexibility offered by natural gas networks.

03 NATURAL GAS↗
DOE OSTI2024

Quantum Networks: A New Platform for Aerospace

The ability to distribute entanglement between quantum nodes may unlock new capabilities in the future that include teleporting information across multinode networks, higher resolution detection via entangled sensor arrays, and measurements beyond the quantum limit enabled by networked atomic clocks. These new quantum networks also hold promise for the Aerospace community in areas such as deep space exploration, improved satellite communication, and synchronizing drone swarms. Although exciting, these applications are a long way off from providing a “real-world” benefit, as they have only been theoretically explored or demonstrated in small-scale experiments. An outstanding challenge is to identify near-term use cases for quantum networks; this may be an intriguing new area of interest for the aerospace community, as the quantum networking field would benefit from more multidisciplinary collaborations. This paper introduces quantum networking, discusses the difficulties in distributing entanglement within these networks, highlights recent progress toward this endeavor, and features two current case studies on mobile quantum nodes and an entangled clock network, both of which are relevant to the aerospace community.

Engineering↗
DOE OSTI2020

Continuous Test and Transition Infrastructure for Quantum Networking for Science Complex

We propose a network architecture with a separate quantum dataplane and a conventional control plane: (a) Quantum Data Plane: The Quantum Data plane consists of links of dark fibers connecting quantum switches and repeaters, which in turn, connect to quantum computers, memory and sensors. Since the current reach is limited to local areas, it will begin as a collection of site networks at laboratories, (b) Conventional Control Plane: The Control plane provides management access to quantum devices for configuration and provisioning via control nodes with firewall and encryption capabilities. Continuous Test and Transition Infrastructure: We propose an infrastructure with a control plane connecting multiple sites via encrypted tunnels over conventional networks consisting of the following: (a) Site Quantum Networks: Individual site networks supported by their fiber plants connect laboratories that house and connect to their quantum devices for testing and interoperability.(b) Site Control Planes: Sites are connected over individual control planes with control hosts with Software Defined Networking capabilities, which can be peered with other networks via ESnet.(c) Progressive Expansion: Initially, sites will develop individual data planes with their specific quantum devices and fiber connections, and mechanisms to interface with conventional networks. They progressively expand and interconnect, under a wide-area ecosystem of peered control planes for device testing, interoperability development and roll off into production environments.

Rao, Nageswara S.↗
DOE OSTI2020

One step removed shadow network

A system and method includes an operational network that communicates with an external network by opening a first transmission protocol socket. A data diode coupled to the operational network and a gateway enables the one-way transfer of all information received from the external network and transmitted by the operational network to the gateway such that no information travels from the gateway to the operational network or the external network. The gateway opens a second transmission protocol socket by mapping a sequence number to an acknowledgement number and increasing that mapped acknowledgement number by a value of one. A transmitter then transmits the acknowledgment to a remote network or a gateway.

Park, Brent K.↗