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 1,117 records · Page 62

Reducing Cascading Failure Risk by Increasing Infrastructure Network Interdependence

Increased coupling between critical infrastructure networks, such as power and communication systems, has important implications for the reliability and security of these systems. To understand the effects of power-communication coupling, several researchers have studied models of interdependent networks and reported that increased coupling can increase vulnerability. However, these conclusions come largely from models that have substantially different mechanisms of cascading failure, relative to those found in actual power and communication networks, and that do not capture the benefits of connecting systems with complementary capabilities. In order to understand the importance of these details, this paper compares network vulnerability in simple topological models and in models that more accurately capture the dynamics of cascading in power systems. First, we compare a simple model of topological contagion to a model of cascading in power systems and find that the power grid model shows a higher level of vulnerability, relative to the contagion model. Second, we compare a percolation model of topological cascading in coupled networks to three different models of power networks coupled to communication systems. Again, the more accurate models suggest very different conclusions than the percolation model. In all but the most extreme case, the physics-based power grid models indicate that increased power-communication coupling decreases vulnerability. This is opposite from what one would conclude from the percolation model, in which zero coupling is optimal. Only in an extreme case, in which communication failures immediately cause grid failures, did we find that increased coupling can be harmful. Together, these results suggest design strategies for reducing the risk of cascades in interdependent infrastructure systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Layered complex networks as fluctuation amplifiers

Abstract In complex networked systems theory, an important question is how to evaluate the system robustness to external perturbations. With this task in mind, I investigate the propagation of noise in multi-layer networked systems. I find that, for a two layer network, noise originally injected in one layer can be strongly amplified in the other layer, depending on how well-connected are the complex networks in each layer and on how much the eigenmodes of their Laplacian matrices overlap. These results allow to predict potentially harmful conditions for the system and its sub-networks, where the level of fluctuations is important, and how to avoid them. The analytical results are illustrated numerically on various synthetic networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Transactive Network Template for Decentralized Coordination of Electricity Provision and Value

Transactive energy systems facilitate and plan for an allocation of electricity based on distributed, value-based negotiations. They are currently extending the usage of market-based principles and transactions from wholesale electricity markets where they exist today downward into distribution systems. While many interesting transactive energy systems have been proposed, few fully decentralize price discovery and price-responsive control. Even fewer plan for extensibility that will be needed for the ultimate growth of transactive networks and for the inclusion of additional and new objectives and new flexible, responsive assets. This paper introduces a transactive network template from which an agent may be configured at its network node to negotiate for electricity with other neighboring network agents, manage a set of locally-owned supply and demand assets, and induce local power balance through price discovery. A set of base object classes defines the template and may be extended. Three important basic computational responsibilities are allocated among the base object classes—scheduling, balancing, and network coordination. These several basic classes and responsibilities may be used to represent the perspective of large and small devices and regions anywhere in the electric power grid because they are based on the self-similarity of these objects and responsibilities. Agents in a transactive network are not at all unique in these basic responsibilities. So far, these following dynamic values have been addressed by extension of the base classes: energy value, demand charges, transport losses, and impacts of distributed renewable resources. The template is designed to be further extended to address and monetize still other valuable objectives.

Transactive, Transactive network, Transactive netw↗

Identification of Plasma Current Center by Neural Network Inference in EAST

For the efficient and safe operation of experimental advanced superconducting tokamak (EAST), it is necessary to accurately identify and control the plasma current and its central position. In this article, neural network is used to identify the position of the plasma current center. The model trained by the basic back-propagation neural network can well match the relationship between the electromagnetic diagnostic signals and plasma current center positions. Both noisy simulation data and experimental data are applied to train and test the neural network inference model. Adding 0.1% noise to the training data is proven to improve the noise immunity of the inference model. Basic neural networks trained with both noisy simulation data and actual experimental data show good results with sufficient inputs; however, in both cases, the performance degrades significantly when only the poloidal field coil currents are given as inputs. For this kind of time-series problem, the dynamic neural network containing delay and feedback architecture is introduced, and an improved model requiring much fewer inputs is trained and tested for current center inference. Furthermore, some parameters of this model are compared and analyzed in this article. With suitable neural network architecture, the mapping between the controlled variables (poloidal field coil currents) and response variables (plasma current center) can be well-established.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Modeling a Million-Node Slim Fly Network Using Parallel Discrete-Event Simulation

As supercomputers close in on exascale performance, the increased number of processors and processing power translates to an increased demand on the underlying network interconnect. The Slim Fly network topology, a new lowdiameter and low-latency interconnection network, is gaining interest as one possible solution for next-generation supercomputing interconnect systems. In this paper, we present a high-fidelity Slim Fly it-level model leveraging the Rensselaer Optimistic Simulation System (ROSS) and Co-Design of Exascale Storage (CODES) frameworks. We validate our Slim Fly model with the Kathareios et al. Slim Fly model results provided at moderately sized network scales. We further scale the model size up to n unprecedented 1 million compute nodes; and through visualization of network simulation metrics such as link bandwidth, packet latency, and port occupancy, we get an insight into the network behavior at the million-node scale. We also show linear strong scaling of the Slim Fly model on an Intel cluster achieving a peak event rate of 36 million events per second using 128 MPI tasks to process 7 billion events. Detailed analysis of the underlying discrete-event simulation performance shows that a million-node Slim Fly model simulation can execute in 198 seconds on the Intel cluster.

interconnection networks↗

Generating Massive Scale-free Networks: Novel Parallel Algorithms using the Preferential Attachment Model

Recently, there has been substantial interest in the study of various random networks as mathematical models of complex systems. As real-life complex systems grow larger, the ability to generate progressively large random networks becomes all the more important. This motivates the need for efficient parallel algorithms for generating such networks. Naïve parallelization of sequential algorithms for generating random networks is inefficient due to inherent dependencies among the edges and the possibility of creating duplicate (parallel) edges. In this article, we present message passing interface-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model. Our algorithms are experimentally verified to scale very well to a large number of processing elements (PEs), providing near-linear speedups. The algorithms have been exercised with regard to scale and speed to generate scale-free networks with one trillion edges in 6 minutes using 1,000 PEs.

97 MATHEMATICS AND COMPUTING↗

OpenFlow arbitrated programmable network channels for managing quantum metadata

Quantum networks must classically exchange complex metadata between devices in order to carry out information for protocols such as teleportation, super-dense coding, and quantum key distribution. Demonstrating the integration of these new communication methods with existing network protocols, channels, and data forwarding mechanisms remains an open challenge. Software-defined networking (SDN) offers robust and flexible strategies for managing diverse network devices and uses. We adapt the principles of SDN to the deployment of quantum networks, which are composed from unique devices that operate according to the laws of quantum mechanics. We show how quantum metadata can be managed within a software-defined network using the OpenFlow protocol, and we describe how OpenFlow management of classical optical channels is compatible with emerging quantum communication protocols. We next give an example specification of the metadata needed to manage and control quantum physical layer (QPHY) behavior and we extend the OpenFlow interface to accommodate this quantum metadata. Here, we conclude by discussing near-term experimental efforts that can realize SDN’s principles for quantum communication.

97 MATHEMATICS AND COMPUTING↗

Learned adaptive properties for mitigation of weight perturbations in embedded spiking networks

Recent years have seen an increased importance of neural network inference in edge-based scenarios, which impose size and power constraints requiring novel computing devices. These same edge scenarios may require operating over long periods of time, or exposure to extreme environments, resulting in a drift of neural network weights that cause degraded performance. In searching for ways to develop neural network approaches that perform robustly under these conditions, we propose a biologically-inspired mechanism for the dynamic adaptation of within-neuron parameters that is guided by a global context signal carrying information about perturbations and variability in incoming stimuli. Specifically, we demonstrate that adaptive voltage thresholds or neuronal time constants, when informed by a global context signal, can enable network-level mechanisms to recover from perturbed synaptic weights. Consistent with prior literature, the context-modulated approach is effective for recurrent, but not feedforward networks, by modulating network level dynamics. We demonstrate this approach successfully recovers performance in image classification tasks and spatiotemporal tracking tasks under idealized and Gaussian noise as well as for realistic perturbations from a memristive device when exposed to ionizing radiation. Finally, we discuss how this approach enables the design of robust and energy-efficient neuromorphic systems that perform well, even in resource-constrained scenarios with extreme environments such as edge processing.

context modulation↗

A Review of Power Distribution Test Feeders in the United States and the Need for Synthetic Representative Networks

Under the increasing penetration of distributed energy resources and new smart network technologies, distribution utilities face new challenges and opportunities to ensure reliable operations, manage service quality, and reduce operational and investment costs. Simultaneously, the research community is developing algorithms for advanced controls and distribution automation that can help to address some of these challenges. However, there is a shortage of realistic test systems that are publically available for development, testing, and evaluation of such new algorithms. Concerns around revealing critical infrastructure details and customer privacy have severely limited the number of actual networks published and that are available for testing. In recent decades, several distribution test feeders and US-featured representative networks have been published, but the scale, complexity, and control data vary widely. This paper presents a first-of-a-kind structured literature review of published distribution test networks with a special emphasis on classifying their main characteristics and identifying the types of studies for which they have been used. As a result, this both aids researchers in choosing suitable test networks for their needs and highlights the opportunities and directions for further test system development. In particular, we highlight the need for building large-scale synthetic networks to overcome the identified drawbacks of current distribution test feeders.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Deploying Software-Defined Networking in Operational Technology Environments

Software Defined Networking for Operational Technologies, referred to as OT-SDN, is a leading technology to secure critical infrastructure and command and control (C2) systems. As the name implies, OT-SDN networks are programmable, which allows system owners to utilize the characteristics of their physical process to inform the security of their network. There are best practices for deploying OT-SDN into an environment, whether it is all at once or over time (hybrid) that the network is converted to SDN technologies. Through the development of data mining tools and standardized process control, OT-SDN can be deployed reliably. These tools will minimize or eliminate any communication failures during the transition and provide the network owner with complete documentation of their environment. This documentation could enable or facilitate the network owner to pass any audits or policy checks (Authority to Operate) before being allowed to utilize the OT-SDN infrastructure.

Software Defined Networking, Operational Technolog↗

Uniform redundancy allocation maximizes the robustness of flow networks against cascading failures

We study the robustness of flow networks against cascading failures under a partial load redistribution model. In particular, we consider a flow network of N lines with initial loads L 1 ,...,L N and free spaces (i.e., redundant space) S 1 ,...,S N that are independent and identically distributed with joint distribution P LS (x,y) = P[L ≤ x, S ≤ y]. The capacity C i is the maximum load allowed on line i and is given by C i = L i + S i . Furthermore, when a line fails due to overloading, it is removed from the system and (1 – ε) fraction of the load it was carrying is redistributed equally among all remaining lines in the system. The rest (i.e., ε fraction) of the load is assumed to be lost or absorbed, e.g., due to advanced circuitry disconnecting overloaded power lines or an interconnected network or material absorbing a fraction of the flow from overloaded lines. We analyze the robustness of this flow network against random attacks that remove a p fraction of the lines. Our contributions include (i) deriving the final fraction of alive lines n ∞ (p,ε) for all p,εϵ(0,1) and confirming the results via extensive simulations; (ii) showing that partial redistribution might lead to (depending on the parameter 0 < ε ≤ 1) the order of transition at the critical attack size p* changing from first to second-order; and (iii) proving analytically that flow networks achieve maximum robustness [quantified by the area ∫$^{1}_{0}$ n ∞ (p,ε)dp] when all lines have the same free space regardless of their initial load. The optimality of equal free-space allocation is also confirmed on real-world data from the UK National Power Grid.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solution‐Like Water Transport Across Molecular to Macroscopic Length Scales in Crosslinked Poly(Ethylene Glycol Diacrylate) Networks With Tailored Sidechains

Poly(ethylene glycol) (PEG)‐based materials, like PEG‐diacrylate (PEGDA), are prized for their hydrophilic, inert properties, and leveraged in hydrogels and as membrane mimics. While network chemistry is often tuned for selective transport and antifouling, fundamental understanding of water dynamics at the network surface and the impact on bulk transport is limited. We utilize Overhauser dynamic nuclear polarization (ODNP) to measure nanoscale water diffusivity near a tethered spin label at the water‐polymer surface and compare it to bulk water diffusivity from pulsed field gradient (PFG) NMR. Via active ester chemistry, spin labels and varied sidechain chemistries are introduced, modulating network hydrophilicity. Tuning network hydration through crosslinker content and functional groups further impacts water diffusivity. Results show rapid nanoscale water transport at the polymer surface, reflecting network volumetric water content, with further modulation by sidechain functionality. These findings demonstrate PEGDA's utility as a membrane mimic and the critical impact of network chemistry on water transport.

hydrogels↗

Watersheds and stream networks viewed longitudinally: Example insights from novel spatial portrayals of watershed characteristics

Abstract Longitudinal depictions of watershed structure and characteristics, including topography, stream networks, wetlands, ground water levels, and land use, can provide watershed knowledge and understanding unavailable from standard plan view maps. Three case studies provide examples of knowledge gained by applying longitudinal views of stream networks, watershed hydrologic behavior, and land use distributions. Longitudinal views of mountain stream networks show extreme variability in the slope‐area relationships of low Strahler order streams, large discontinuities in drainage area (large parts of drainage area space are absent in networks), and large variations in network curvature. Longitudinal views of a groundwater‐dominated headwater watershed increase the inference available from limited groundwater observations and clearly reveal how groundwater connections affect the permanence of surface water features and the distribution of vadose zone storage in the landscape. Plotting land uses longitudinally illuminates and allows a quantitative analysis of how land uses are distributed relative to topographic position. Viewing watersheds and stream networks longitudinally can provide new insights into watershed forms and processes and motivate new questions and research.

60 APPLIED LIFE SCIENCES↗

Optimization strategies for produced water networks with integrated desalination facilities

Optimal management and desalination of produced water is a major challenge for U.S. oil and gas development. Integrating rigorous desalination models into multi-period produced water network optimization problems presents several hurdles, which need to be tackled using advanced optimization strategies. Here, in this work, a novel multi-period produced water network formulation with separate solid and liquid flows is introduced to avoid singularities at zero flows. Rigorous steady state desalination models based on mechanical vapor recompression are embedded at the desalination sites in the network model. An integrated optimization formulation is developed to co-optimize the design of desalination units along with the operation of the network. Furthermore, a more robust approach based on the trust region filter method is developed to efficiently integrate complex desalination models into the multi-period planning problem. Both optimization approaches are demonstrated on a produced water network from the PARETO library (Drouven et al., 2022) using thermal desalination units. Our results show that while the TRF and integrated approaches have comparable solve times, the TRF approach has better performance reliability in terms of solver convergence. Furthermore, the optimal solution obtained by embedding rigorous models into the network is significantly different than when desalination costs are approximated using simple cost models, which motivates further research in this field.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

PANNA: Properties from Artificial Neural Network Architectures

We report prediction of material properties from first principles is often a computationally expensive task. Recently, artificial neural networks and other machine learning approaches have been successfully employed to obtain accurate models at a low computational cost by leveraging existing example data. Here, we present a software package “Properties from Artificial Neural Network Architectures” (PANNA) that provides a comprehensive toolkit for creating neural network models for atomistic systems following the Behler–Parrinello topology. Besides the core routines for neural network training, it includes data parser, descriptor builder for Behler–Parrinello class of symmetry functions and force-field generator suitable for integration within molecular dynamics packages. PANNA offers a variety of activation and cost functions, regularization methods, as well as the possibility of using fully-connected networks with custom size for each atomic species. PANNA benefits from the optimization and hardware-flexibility of the underlying TensorFlow engine which allows it to be used on multiple CPU/GPU/TPU systems, making it possible to develop and optimize neural network models based on large datasets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Terrestrial Trunked Radio (TETRA) exposure of neuronal in vitro networks

Highlights: • For the first time, we examined the impact of TETRA-RF on the electrophysiology of neuronal in vitro networks. • We examine whether TETRA short- and long-term exposure could affect the electrophysiology of neuronal in vitro networks. • Analysed parameters were spike rate, burst rate, burst duration and network synchrony. Terrestrial Trunked Radio (TETRA) is a worldwide common mobile communication standard, used by authorities and organizations with security tasks. Previous studies reported on health effects of TETRA, with focus on the specific pulse frequency of 17.64 Hz, which affects calcium efflux in neuronal cells. Likewise among others, it was reported that TETRA affects heart rate variability, neurophysiology and leads to headaches. In contrast, other studies conclude that TETRA does not affect calcium efflux of cells and has no effect on people's health. In the present study we examine whether TETRA short- and long-term exposure could affect the electrophysiology of neuronal in vitro networks. Experiments were performed with a carrier frequency of 395 MHz, a pulse frequency of 17.64 Hz and a differential quaternary phase-shift keying (π/4 DQPSK) modulation. Specific absorption rates (SAR) of 1.17 W/kg and 2.21 W/kg were applied. In conclusion, the present results do not indicate any effect of TETRA exposure on electrophysiology of neuronal in vitro networks, neither for short-term nor long-term exposure. This applies to the examined parameters spike rate, burst rate, burst duration and network synchrony.

63 RADIATION, THERMAL, AND OTHER ENVIRON. POLLUTAN↗

A hereditary integral, transient network approach to modeling permanent set and viscoelastic response in polymers

An efficient numerical framework is presented for modeling viscoelasticity and permanent set of polymers. It is based on the hereditary integral form of transient network theory, in which polymer chains belong to distinct networks each with different natural equilibrium states. Chains continually detach from previously formed networks and reattach to new networks in a state of zero stress. The free energy of these networks is given in terms of the deformation gradient relative to the configuration at which the network was born . A decomposition of the kernel for various free energies allows for a recurrence relationship to be established, bypassing the need to integrate over all time history. The technique is established for both highly compressible and nearly incompressible materials through the use of neo-Hookean, Blatz–Ko, Yeoh, and Ogden-Hill material models. Multiple examples are presented showing the ability to handle rate-dependent response and residual strains under complex loading histories.

Finite element method↗

Multi-fidelity Bayesian neural networks: Algorithms and applications

Here we propose a new class of Bayesian neural networks (BNNs) that can be trained using noisy data of variable fidelity, and we apply them to learn function approximations as well as to solve inverse problems based on partial differential equations (PDEs). These multi-fidelity BNNs consist of three neural networks: The first is a fully connected neural network, which is trained following the maximum a posteriori probability (MAP) method to fit the low-fidelity data; the second is a Bayesian neural network employed to capture the cross-correlation with uncertainty quantification between the low- and high-fidelity data; and the last one is the physics-informed neural network, which encodes the physical laws described by PDEs. For the training of the last two neural networks, we first employ the mean-field variational inference (VI) to maximize the evidence lower bound (ELBO) to obtain informative prior distributions for the hyperparameters in the BNNs, and subsequently we use the Hamiltonian Monte Carlo (HMC) method to estimate accurately the posterior distributions for the corresponding hyperparameters. We demonstrate the accuracy of the present method using synthetic data as well as real measurements. Specifically, we first approximate a one- and four-dimensional function, and then infer the reaction rates in one- and two-dimensional diffusion-reaction systems. Moreover, we infer the sea surface temperature (SST) in the Massachusetts and Cape Cod Bays using satellite images and in-situ measurements. Taken together, our results demonstrate that the present method can capture both linear and nonlinear correlation between the low- and high-fidelity data adaptively, identify unknown parameters in PDEs, and quantify uncertainties in predictions, given a few scattered noisy high-fidelity data. Finally, we demonstrate that we can effectively and efficiently reduce the uncertainties and hence enhance the prediction accuracy with an active learning approach, using as examples a specific one-dimensional function approximation and an inverse PDE problem.

97 MATHEMATICS AND COMPUTING↗