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 973 records · Page 54
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Stability of Kuramoto networks subject to large and small fluctuations from heterogeneous and spatially correlated noise

Oscillatory networks subjected to noise are broadly used to model physical and technological systems. Due to their nonlinear coupling, such networks typically have multiple stable and unstable states that a network might visit due to noise. In this article, we focus on the assessment of fluctuations resulting from heterogeneous and spatially correlated noise inputs on Kuramoto model networks. We evaluate the typical, small fluctuations near synchronized states and connect the network variance to the overlap between stable modes of synchronization and the input noise covariance. Going beyond small to large fluctuations, we introduce the indicator mode approximation that projects the dynamics onto a single amplitude dimension. Such an approximation allows for estimating rates of fluctuations to saddle instabilities, resulting in phase slips between connected oscillators. Statistics for both regimes are quantified in terms of effective noise amplitudes that are compared and contrasted for several noise models. In conclusion, bridging the gap between small and large fluctuations, we show that a larger network variance does not necessarily lead to higher rates of large fluctuations.

42 ENGINEERING↗
DOE OSTI2017

Punishment diminishes the benefits of network reciprocity in social dilemma experiments

Network reciprocity has been widely advertised in theoretical studies as one of the basic cooperation-promoting mechanisms, but experimental evidence favoring this type of reciprocity was published only recently. When organized in an unchanging network of social contacts, human subjects cooperate provided the following strict condition is satisfied: The benefit of cooperation must outweigh the total cost of cooperating with all neighbors. In an attempt to relax this condition, we perform social dilemma experiments wherein network reciprocity is aided with another theoretically hypothesized cooperation-promoting mechanism—costly punishment. The results reveal how networks promote and stabilize cooperation. This stabilizing effect is stronger in a smaller-size neighborhood, as expected from theory and experiments. Contrary to expectations, punishment diminishes the benefits of network reciprocity by lowering assortment, payoff per round, and award for cooperative behavior. This diminishing effect is stronger in a larger-size neighborhood. An immediate implication is that the psychological effects of enduring punishment override the rational response anticipated in quantitative models of cooperation in networks.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2015

SOLAR CYCLE VARIATION OF THE INTER-NETWORK MAGNETIC FIELD

The solar inter-network magnetic field is the weakest component of solar magnetism, but it contributes most of the solar surface magnetic flux. The study of its origin has been constrained by the inadequate tempospatial resolution and sensitivity of polarization observations. With dramatic advances in spatial resolution and detecting sensitivity, the solar spectropolarimetry provided by the Solar Optical Telescope on board Hinode in an interval from the solar minimum to maximum of cycle 24 opens an unprecedented opportunity to study the cyclic behavior of the solar inter-network magnetic field. More than 1000 Hinode magnetograms observed from 2007 January to 2014 August are selected in the study. It has been found that there is a very slight correlation between sunspot number and magnetic field at the inter-network flux spectrum. From solar minimum to maximum of cycle 24, the flux density of the solar inter-network field is invariant, at 10 ± 1 G. The observations suggest that the inter-network magnetic field does not arise from flux diffusion or flux recycling of solar active regions, thereby indicating the existence of a local small-scale dynamo. Combining the full-disk magnetograms observed by the Solar and Heliospheric Observatory/Michelson Doppler Imager and the Solar Dynamics Observatory/Helioseismic and Magnetic Imager in the same period, we find that the area ratio of the inter-network region to the full disk of the Sun apparently decreases from solar minimum to maximum but always exceeds 60%, even in the phase of solar maximum.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2015

DOES THE VARIATION OF THE SOLAR INTRA-NETWORK HORIZONTAL FIELD FOLLOW THE SUNSPOT CYCLE?

The ubiquitousness of the solar inter-network horizontal magnetic field has been revealed by space-borne observations with high spatial resolution and polarization sensitivity. However, no consensus has been achieved on the origin of the horizontal field among solar physicists. For a better understanding, in this study, we analyze the cyclic variation of the inter-network horizontal field by using the spectro-polarimeter observations provided by the Solar Optical Telescope on board Hinode, covering the interval from 2008 April to 2015 February. The method of wavelength integration is adopted to achieve a high signal-to-noise ratio. It is found that from 2008 to 2015 the inter-network horizontal field does not vary when solar activity increases, and the average flux density of the inter-network horizontal field is 87 ± 1 G, In addition, the imbalance between horizontal and vertical fields also keeps invariant within the scope of deviation, i.e., 8.7 ± 0.5, from the solar minimum to maximum of solar cycle 24. This result confirms that the inter-network horizontal field is independent of the sunspot cycle. The revelation favors the idea that a local dynamo is creating and maintaining the solar inter-network horizontal field.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Characterizing gravitational wave detector networks: from A # to cosmic explorer

Gravitational-wave observations by the laser interferometer gravitational-wave observatory (LIGO) and Virgo have provided us a new tool to explore the Universe on all scales from nuclear physics to the cosmos and have the massive potential to further impact fundamental physics, astrophysics, and cosmology for decades to come. In this paper we have studied the science capabilities of a network of LIGO detectors when they reach their best possible sensitivity, called A # , given the infrastructure in which they exist and a new generation of observatories that are factor of 10 to 100 times more sensitive (depending on the frequency), in particular a pair of L-shaped cosmic explorer (CE) observatories (one 40 km and one 20 km arm length) in the US and the triangular Einstein telescope with 10 km arms in Europe. We use a set of science metrics derived from the top priorities of several funding agencies to characterize the science capabilities of different networks. The presence of one or two A # observatories in a network containing two or one next generation observatories, respectively, will provide good localization capabilities for facilitating multimessenger astronomy (MMA) and precision measurement of the Hubble parameter. Two CE observatories are indispensable for achieving precise localization of binary neutron star events, facilitating detection of electromagnetic counterparts and transforming MMA. Their combined operation is even more important in the detection and localization of high-redshift sources, such as binary neutron stars, beyond the star-formation peak, and primordial black hole mergers, which may occur roughly 100 million years after the Big Bang. The addition of the Einstein Telescope to a network of two CE observatories is critical for accomplishing all the identified science metrics including the nuclear equation of state, cosmological parameters, the growth of black holes through cosmic history, but also make new discoveries such as the presence of dark matter within or around neutron stars and black holes, continuous gravitational waves from rotating neutron stars, transient signals from supernovae, and the production of stellar-mass black holes in the early Universe. For most metrics the triple network of next generation terrestrial observatories are a factor 100 better than what can be accomplished by a network of three A # observatories.

Einstein telescope↗
DOE OSTI2013

NON-POTENTIAL FIELDS IN THE QUIET SUN NETWORK: EXTREME-ULTRAVIOLET AND MAGNETIC FOOTPOINT OBSERVATIONS

The quiet Sun (QS) magnetic network is known to contain dynamics which are indicative of non-potential fields. Non-potential magnetic fields forming ''S-shaped'' loop arcades can lead to the breakdown of static activity and have only been observed in high temperature X-ray coronal structures—some of which show eruptive behavior. Thus, analysis of this type of atmospheric structuring has been restricted to large-scale coronal fields. Here we provide the first identification of non-potential loop arcades exclusive to the QS supergranulation network. High-resolution Atmospheric Imaging Assembly data from the Solar Dynamics Observatory have allowed for the first observations of fine-scale ''S-shaped'' loop arcades spanning the network. We have investigated the magnetic footpoint flux evolution of these arcades from Heliospheric and Magnetic Imager data and find evidence of evolving footpoint flux imbalances accompanying the formation of these non-potential fields. The existence of such non-potentiality confirms that magnetic field dynamics leading to the build up of helicity exist at small scales. QS non-potentiality also suggests a self-similar formation process between the QS network and high temperature corona and the existence of self-organized criticality (SOC) in the form of loop-pair reconnection and helicity dissipation. We argue that this type of behavior could lead to eruptive forms of SOC as seen in active region (AR) and X-ray sigmoids if sufficient free magnetic energy is available. QS magnetic network dynamics may be considered as a coronal proxy at supergranular scales, and events confined to the network can even mimic those in coronal ARs.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

NuGraph2 with explainability: post-hoc explanations for geometric neural network predictions

With the growing popularity of artificial intelligence (AI) used for scientific applications, the ability of attribute a result to a reasoning process from the network is in high demand for robust scientific generalizations to hold. In this work we aim to motivate the need for and demonstrate the use of post-hoc explainability methods when applied to AI methods used in scientific applications. To this end, we introduce explainability add-ons to the existing graph neural network (GNN) for neutrino tagging, NuGraph2. The explanations take the form of a suite of techniques examining the output of the network (node classifications) and the edge connections between them, and probing of the latent space using novel general-purpose tools applied to this network. We show how none of these methods are singularly sufficient to show network ‘understanding’, but together can give insights into the processes used in classification. While these methods are tested on the NuGraph2 application, they can be applied to a broad range of networks, not limited to GNNs. The code for this work is publicly available on GitHub at https://github.com/voetberg/XNuGraph.

Voetberg, Margaret [Fermilab] (ORCID:0009000527154↗
DOE OSTI2021

Efficient Sampling of Complex Interdependent and Multiplex Networks

Efficient sampling of interdependent and multiplex infrastructure networks is critical for effectively applying failure and recovery algorithms in real-world settings, as well as to generate property-preserving reduced-order graph-based ensembles that address topological uncertainties. In this paper, we first explore the performance, i.e. the success in preserving graph properties, of graph sampling algorithms for interdependent and multiplex networks with synthetic and real-world graphs. We simulate sampling algorithms under different parameter settings. These settings include probabilistic graph generators, coupling patterns, and various performance metrics. Our results show that while Random Node and Random Walk sampling algorithms perform best for interdependent networks, Random Edge and Forest Fire sampling algorithms perform best for multiplex networks. Second, we propose and implement a novel similarity-based sampling algorithm for multiplex networks that samples only log(N) number of layers of an N-layer multiplex network while yielding computational savings with performance guarantees. Experimental results show that similarity sampling outperforms complete sampling of all layers while decreasing performance costs from a linear scale to a logarithmic one. Our results also indicate that similarity-based sampling outperforms complete sampling and random selection in nearly all scenarios when tested with real-world data.

Subasi, Omer↗
DOE OSTI2025

Analysis and optimization of seismic monitoring networks with Bayesian optimal experimental design

SUMMARY Monitoring networks increasingly aim to assimilate data from a large number of diverse sensors covering many sensing modalities. Bayesian optimal experimental design (OED) seeks to identify data, sensor configurations or experiments which can optimally reduce uncertainty and hence increase the performance of a monitoring network. Information theory guides OED by formulating the choice of experiment or sensor placement as an optimization problem that maximizes the expected information gain (EIG) about quantities of interest given prior knowledge and models of expected observation data. Therefore, within the context of seismo-acoustic monitoring, we can use Bayesian OED to configure sensor networks by choosing sensor locations, types and fidelity in order to improve our ability to identify and locate seismic sources. In this work, we develop the framework necessary to use Bayesian OED to optimize a sensor network’s ability to locate seismic events from arrival time data of detected seismic phases at the regional-scale. This framework requires five elements: (i) A likelihood function that describes the distribution of detection and traveltime data from the sensor network, (ii) A prior distribution that describes a priori belief about seismic events, (iii) A Bayesian solver that uses a prior and likelihood to identify the posterior distribution of seismic events given the data, (iv) An algorithm to compute EIG about seismic events over a data set of hypothetical prior events, (v) An optimizer that finds a sensor network which maximizes EIG. Once we have developed this framework, we explore many relevant questions to monitoring such as: how to trade off sensor fidelity and earth model uncertainty; how sensor types, number and locations influence uncertainty; and how prior models and constraints influence sensor placement.

58 GEOSCIENCES↗
DOE OSTI2019

Random walks on jammed networks: Spectral properties

Using random walk analyses we explore diffusive transport on networks obtained from contacts between isotropically compressed, monodisperse, frictionless sphere packings generated over a range of pressures in the vicinity of the jamming transition p → 0 . For conductive particles in an insulating medium, conduction is determined by the particle contact network with nodes representing particle centers and edges contacts between particles. The transition rate is not homogeneous, but is distributed inhomogeneously due to the randomness of packing and concomitant disorder of the contact network, e.g., the distribution of the coordination number. A narrow escape time scale is used to write a Markov process for random walks on the particle contact network. This stochastic process is analyzed in terms of spectral density of the random, sparse, Euclidean and real, symmetric, positive, semidefinite transition rate matrix. Findings reveal network structures derived from jammed particles have properties similar to ordered, euclidean lattices but also some unique properties that distinguish them from other structures that are in some sense more homogeneous. Specifically, the distribution of eigenvalues of the transition rate matrix follow a power law with spectral dimension 3. Yet, quantitative details of the statistics of the eigenvectors show subtle differences with homogeneous lattices and allow us to distinguish between topological and geometric sources of disorder in the network.

42 ENGINEERING↗
DOE OSTI2026

Community detection robustness of graph neural networks

Graph neural networks (GNNs) are increasingly widely used for community detection in attributed networks. They combine structural topology with node attributes through message passing and pooling. However, their robustness or lack thereof with respect to different perturbations and targeted attacks in conjunction with community detection tasks is not well understood. To shed light on latent mechanisms behind GNN sensitivity on community detection tasks, we conduct a systematic computational evaluation of six widely adopted GNN architectures graph convolutional network, graph attention network, graph sample and aggregate (GraphSAGE), differentiable pooling (DiffPool), minimum cut pooling (MinCUT), and deep modularity networks (DMoN). The analysis covers three perturbation categories: node attribute manipulations, edge topology distortions, and adversarial attacks. We use element-centric similarity as the evaluation metric on synthetic benchmarks and real-world citation networks. Our findings indicate that supervised GNNs tend to achieve higher baseline accuracy, while unsupervised methods, particularly DMoN, maintain stronger resilience under targeted and adversarial perturbations. Furthermore, robustness appears to be strongly influenced by community strength, with well-defined communities reducing performance loss. Across all models, node attribute perturbations associated with targeted edge deletions and shifts in attribute distributions tend to cause the largest degradation in community recovery. These findings highlight important trade-offs between accuracy and robustness in GNN-based community detection and offer insights into selecting architectures resilient to noise and adversarial attacks.

Goel, Jaidev [Virginia Polytechnic Inst. and State↗
DOE OSTI2026

Loop series expansions for tensor networks

Belief propagation (BP) can be a useful tool to approximately contract a tensor network, provided that the contributions from any closed loops in the network are sufficiently weak. In this article, we describe how a loop series expansion can be applied to systematically improve the accuracy of a BP approximation to a tensor network contraction, in principle converging arbitrarily close to the exact result. More generally, our result provides a framework for expanding a tensor network as a sum of component networks in a hierarchy of increasing complexity. We benchmark this proposal for the contraction of infinite projected entangled pair states, either representing the ground state of an Affleck-Kennedy-Lieb-Tasaki (AKLT) model or with randomly defined tensors, where it is shown to improve in accuracy over standard BP by several orders of magnitude while incurring only a minor increase in computational cost. These results indicate that the proposed series expansions could be a useful tool to accurately evaluate tensor networks in cases that otherwise exceed the limits of established contraction routines.

Evenbly, Glen [AWS Center for Quantum Computing, P↗
DOE OSTI2015

Deformable complex network for refining low-resolution X-ray structures

A new refinement algorithm called the deformable complex network that combines a novel angular network-based restraint with a deformable elastic network model in the target function has been developed to aid in structural refinement in macromolecular X-ray crystallography. In macromolecular X-ray crystallography, building more accurate atomic models based on lower resolution experimental diffraction data remains a great challenge. Previous studies have used a deformable elastic network (DEN) model to aid in low-resolution structural refinement. In this study, the development of a new refinement algorithm called the deformable complex network (DCN) is reported that combines a novel angular network-based restraint with the DEN model in the target function. Testing of DCN on a wide range of low-resolution structures demonstrated that it constantly leads to significantly improved structural models as judged by multiple refinement criteria, thus representing a new effective refinement tool for low-resolution structural determination.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2016

Synchronization of Lienard-Type Oscillators in Uniform Electrical Networks

This paper presents a condition for global asymptotic synchronization of Lienard-type nonlinear oscillators in uniform LTI electrical networks with series R-L circuits modeling interconnections. By uniform electrical networks, we mean that the per-unit-length impedances are identical for the interconnecting lines. We derive conditions for global asymptotic synchronization for a particular feedback architecture where the derivative of the oscillator output current supplements the innate current feedback induced by simply interconnecting the oscillator to the network. Our proof leverages a coordinate transformation to a set of differential coordinates that emphasizes signal differences and the particular form of feedback permits the formulation of a quadratic Lyapunov function for this class of networks. This approach is particularly interesting since synchronization conditions are difficult to obtain by means of quadratic Lyapunov functions when only current feedback is used and for networks composed of series R-L circuits. Our synchronization condition depends on the algebraic connectivity of the underlying network, and reiterates the conventional wisdom from Lyapunov- and passivity-based arguments that strong coupling is required to ensure synchronization.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Efficient Contingency Analysis in Power Systems via Network Trigger Nodes

Modeling failure dynamics within a power system is a complex and challenging process due to multiple inter-dependencies and convoluted inter-domain relationships. Subject matter experts (SMEs) are interested in understanding these failure dynamics for reducing the impact from future disasters (i.e., losses or failures of power system components, such as transmission lines). Contingency analysis (CA) tools enable such ’what-if’ scenario analyses to evaluate the impacts on the power system. Analyzing all possible contingencies among N system components can be computationally expensive. An important step for performing CA is identifying a set of k ‘trigger’ components, which when failed initially can significantly impact the overall system by causing multiple failures. Currently SMEs focus on identifying these trigger components by running expensive simulations on all possible subsets, which quickly becomes infeasible. Hence finding a relevant set of trigger components (contingencies) rapidly to enable efficient and useful CA is crucial.In a collaboration between computer scientists and power system experts, we propose an efficient method for performing CA by exploiting network inter-dependencies in power system components. First, we construct a network with multiple electric grid infrastructure components and dependencies as connections among them. We reformulate the problem of finding a set of trigger components as a problem of identifying critical nodes in the network, which can cascade power failures through connected nodes and cause significant damage to the network. To guide the practical CA tools, we develop a network-based model with a probabilistic edge-weights setup using intricate domain rules. Then we conduct an empirical study on real power system data in the US for both regional and national levels. Firstly, we use power system datasets for the US to create a national-scale domain-driven model. Secondly, we demonstrate that network-based model outperforms the outputs from a real CA tool and show on average 25 × improved selection of contingencies, thereby showcasing practical benefits to the power experts.

Tabassum, Anika↗
DOE OSTI2015

UCX: An Open Source Framework for HPC Network APIs and Beyond, In: 2015 IEEE 23rd Annual Symposium on High-Performance Interconnects

This paper presents Unified Communication X (UCX), a set of network APIs and their implementations for high throughput computing. UCX comes from the combined effort of national laboratories, industry, and academia to design and implement a high-performing and highly-scalable network stack for next generation applications and systems. UCX design provides the ability to tailor its APIs and network functionality to suit a wide variety of application domains and hardware. We envision these APIs to satisfy the networking needs of many programming models such as Message Passing Interface (MPI), OpenSHMEM, Partitioned Global Address Space (PGAS) languages, task-based paradigms and I/O bound applications. To evaluate the design we implement the APIs and protocols, and measure the performance of overhead-critical network primitives fundamental for implementing many parallel programming models and system libraries. Our results show that the latency, bandwidth, and message rate achieved by the portable UCX prototype is very close to that of the underlying driver. With UCX, we achieved a message exchange latency of 0.89 us, a bandwidth of 6138.5 MB/s, and a message rate of 14 million messages per second. As far as we know, this is the highest bandwidth and message rate achieved by any network stack (publicly known) on this hardware.

Computer Science↗
DOE OSTI2023

Effectiveness and predictability of in-network storage cache for Scientific Workflows

Large scientific collaborations often have multiple scientists accessing the same set of files while doing different analyses, which create repeated accesses to the large amounts of shared data located far away. These data accesses have long latency due to distance and occupy the limited bandwidth available over the wide-area network. To reduce the wide-area network traffic and the data access latency, regional data storage caches have been installed as a new networking service. To study the effectiveness of such a cache system in scientific applications, we examine the Southern California Petabyte Scale Cache for a high-energy physics experiment. By examining about 3TB of operational logs, we show that this cache removed 67.6% of file requests from the wide-area network and reduced the traffic volume on wide-area network by 12. 3TB (or 35.4%) an average day. The reduction in the traffic volume (35.4%) is less than the reduction in file counts (67.6%) because the larger files are less likely to be reused. Due to this difference in data access patterns, the cache system has implemented a policy to avoid evicting smaller files when processing larger files. We also build a machine learning model to study the predictability of the cache behavior. Tests show that this model is able to accurately predict the cache accesses, cache misses, and network throughput, making the model useful for future studies on resource provisioning and planning.

Sim, Caitlin↗
DOE OSTI2018

Flowzilla: A Methodology for Detecting Data Transfer Anomalies in Research Networks

© 2018 IEEE. Research networks are designed to support high volume scientific data transfers that span multiple network links. Like any other network, research networks experience anomalies. Anomalies are deviations from profiles of normality in a research network's traffic levels. Diagnosing anomalies is critical both for network operators and users (e.g., scientists). In this paper we present Flowzilla, a general framework for detecting and quantifying anomalies on scientific data transfers of arbitrary size. Flowzilla incorporates Random Forest Regression(RFR) for predicting the size of data transfers and utilizes an adaptive threshold mechanism for detecting outliers. Our results demonstrate that our framework achieves up to 92.5% detection accuracy. Furthermore, we are able to predict data transfer sizes up to 10 weeks after training with accuracy above 90%.

Giannakou, Anna↗