Search NASA⌕ Search

SEARCH · Search NASA

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 145 records · Page 8

Pleiotropic and Epistatic Network-Based Discovery: Integrated Networks for Target Gene Discovery

Biological organisms are complex systems that are composed of functional networks of interacting molecules and macro-molecules. Complex phenotypes are the result of orchestrated, hierarchical, heterogeneous collections of expressed genomic variants. However, the effects of these variants are the result of historic selective pressure and current environmental and epigenetic signals, and, as such, their co-occurrence can be seen as genome-wide correlations in a number of different manners. Biomass recalcitrance (i.e., the resistance of plants to degradation or deconstruction, which ultimately enables access to a plant's sugars) is a complex polygenic phenotype of high importance to biofuels initiatives. This study makes use of data derived from the re-sequenced genomes from over 800 different Populus trichocarpa genotypes in combination with metabolomic and pyMBMS data across this population, as well as co-expression and co-methylation networks in order to better understand the molecular interactions involved in recalcitrance, and identify target genes involved in lignin biosynthesis/degradation. A Lines Of Evidence (LOE) scoring system is developed to integrate the information in the different layers and quantify the number of lines of evidence linking genes to target functions. This new scoring system was applied to quantify the lines of evidence linking genes to lignin-related genes and phenotypes across the network layers, and allowed for the generation of new hypotheses surrounding potential new candidate genes involved in lignin biosynthesis in P. trichocarpa, including various AGAMOUS-LIKE genes. Lastly, the resulting Genome Wide Association Study networks, integrated with Single Nucleotide Polymorphism (SNP) correlation, co-methylation, and co-expression networks through the LOE scores are proving to be a powerful approach to determine the pleiotropic and epistatic relationships underlying cellular functions and, as such, the molecular basis for complex phenotypes, such as recalcitrance.

09 BIOMASS FUELS↗

Software-defined network abstractions and configuration interfaces for building programmable quantum networks

Well-defined and stable quantum networks are essential to realize functional quantum applications. Quantum networks are complex and must use both quantum and classical channels to support quantum applications like QKD, teleportation, and superdense coding. In particular, the no-cloning theorem prevents the reliable copying of quantum signals such that the quantum and classical channels must be highly coordinated using robust and extensible methods. We develop new network abstractions and interfaces for building programmable quantum networks. Our approach leverages new OpenFlow data structures and table type patterns to build programmable quantum networks and to support quantum applications.

quantum communiction↗

Scale–Bridging in Three–Dimensional Fracture Networks: Characterizing the Effects of Variable Fracture Apertures on Network–Scale Flow Channelization

Here, we incorporate observations of real fracture aperture variability observed in laboratory experiments into an ensemble of three-dimensional discrete fracture network (DFN) simulations to characterize how variations of this micro-scale feature can influence flow and transport behavior at the network scale. A shear fracture is created within a Marcellus shale sample, and the fracture aperture is measured using a triaxial direct-shear device coupled with real-time X-ray imaging at in-situ stress conditions. We construct an ensemble of fracture networks based on natural fractures in Marcellus shale and project regions of the experimental aperture field onto each fracture in the networks. Our calculations demonstrate that the degree of flow channelization, a network-scale flow field structure, is dramatically increased by local changes in the aperture field that in turn affects flow and transport properties.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Impedance-Aware Graph Convolutional Networks for Voltage Estimation in Active Distribution Networks

Voltage estimation plays a key role in ensuring the effective control and reliability of distribution networks. However, traditional machine learning methods often fail to capture the details of the distribution network’s topology. To overcome this challenge, graph convolutional networks (GCN) have emerged as an alternative. Graph convolutional networks inherently capture the topology of the grid, utilizing correlations to achieve precise voltage estimation. Other machine learning models and conventional GCNs fail to account for the distribution line characteristics found in the real world, limiting their effectiveness. This paper proposes an advanced variant of GCN called the Impedance-Aware Graph Convolutional Network (IA-GCN). The IA-GCN layer incorporates the magnitude of the impedance into the graph convolution mechanism, allowing it to capture topological nuances and provide valuable insights into node interrelationships by considering impedance as an intrinsic dimension. The performance of the IA-GCN layer is then compared with that of GCN and GraphSAGE layers through a surrogate model for voltage estimation. The performance analysis demonstrates that IA-GCN outperforms GCN by reducing the MAE by 87.55% and improving the R-squared value by 98%.

Ravi, Abhijith↗

Flexspander: augmenting expander networks in high-performance systems with optical bandwidth steering

Communication efficiency is one of the deciding factors in determining many of today’s high-performance computing (HPC) applications. Traditionally, HPC systems have been on static network topologies, making them inflexible to the variety of skewed traffic demands that may arise due to the spatial locality inherent in many applications. To handle traffic locality, researchers have proposed integrating optical circuit switches (OCSs) into the network architecture, which reconfigures the network topology to alter and dynamically adapt to the predicted traffic. In this paper, we present a novel reconfigurable network topology called Flexspander. Beyond offering a flexible interconnect, Flexspander also offers full flexibility in terms of construction and can be built with any arbitrary combination of commercial electrical packet switches and OCSs. We evaluate Flexspander performance through extensive simulations with multiple network traces, and our results show improved performance for Flexspander over currently proposed static and reconfigurable topologies in terms of the flow completion time.

Teh, Min Yee↗

DOE Network 2025: Network Research Problems and Challenges for DOE Scientists (Workshop Report)

The growing investments in large science instruments and supercomputers by the US Department of Energy (DOE) hold enormous promise for accelerating the scientific discovery process. They facilitate unprecedented collaborations of geographically dispersed teams of scientists that use these resources. These collaborations critically depend on the production, sharing, moving, and management of, as well as interactive access to, large, complex data sets at sites dispersed across the country and around the globe. In particular, they call for significant enhancements in network capacities to sustain large data volumes and, equally important, the capabilities to collaboratively access the data across computing, storage, and instrument facilities by science users and automated scripts and systems. Improvements in network backbone capacities of several orders of magnitude are essential to meet these challenges, in particular, to support exascale initiatives. Yet, raw network speed represents only a part of the solution. Indeed, the speed must be matched by network and transport layer protocols and higher layer tools that scale in ways that aggregate, compose, and integrate the disparate subsystems into a complete science ecosystem. Just as important, agile monitoring and management services need to be developed to operate the network at peak performance levels. Finally, these solutions must be made an integral part of the production facilities by using sound approaches to develop, deploy, diagnose, operate, and maintain them over the science infrastructure.

97 MATHEMATICS AND COMPUTING↗

Fusion Energy Sciences Network Requirements Review. Final Report, April - October 2021

The Energy Sciences Network (ESnet) is the high-performance network user facility for the US Department of Energy (DOE) Office of Science (SC) and delivers highly reliable data transport capabilities optimized for the requirements of data-intensive science. In essence, ESnet is the circulatory system that enables the DOE science mission by connecting all of its laboratories and facilities in the US and abroad. ESnet is funded and stewarded by the Advanced Scientific Computing Research (ASCR) program and managed and operated by the Scientific Networking Division at Lawrence Berkeley National Laboratory (LBNL). ESnet is widely regarded as a global leader in the research and education networking community. Throughout 2021, ESnet and the Office of Fusion Energy Sciences (FES) of the DOE SC organized an ESnet requirements review of FES-supported 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 their relationship to the FES 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.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum Gauge Networks: A New Kind of Tensor Network

Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks: a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k-point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(M k ). In comparison, for just k = 1, an exponentially larger bond dimension of 2 M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ℤ2 × ℤ2 Equivariant Quantum Neural Networks: Benchmarking against Classical Neural Networks

This paper presents a comparative analysis of the performance of Equivariant Quantum Neural Networks (EQNNs) and Quantum Neural Networks (QNNs), juxtaposed against their classical counterparts: Equivariant Neural Networks (ENNs) and Deep Neural Networks (DNNs). We evaluate the performance of each network with three two-dimensional toy examples for a binary classification task, focusing on model complexity (measured by the number of parameters) and the size of the training dataset. Our results show that the Z2×Z2 EQNN and the QNN provide superior performance for smaller parameter sets and modest training data samples.

Dong, Zhongtian (ORCID:0000000210003454)↗

A graph neural network (GNN) approach to basin-scale river network learning: the role of physics-based connectivity and data fusion

Abstract. Rivers and river habitats around the world are under sustained pressure from human activities and the changing global environment. Our ability to quantify and manage the river states in a timely manner is critical for protecting the public safety and natural resources. In recent years, vector-based river network models have enabled modeling of large river basins at increasingly fine resolutions, but are computationally demanding. This work presents a multistage, physics-guided, graph neural network (GNN) approach for basin-scale river network learning and streamflow forecasting. During training, we train a GNN model to approximate outputs of a high-resolution vector-based river network model; we then fine-tune the pretrained GNN model with streamflow observations. We further apply a graph-based, data-fusion step to correct prediction biases. The GNN-based framework is first demonstrated over a snow-dominated watershed in the western United States. A series of experiments are performed to test different training and imputation strategies. Results show that the trained GNN model can effectively serve as a surrogate of the process-based model with high accuracy, with median Kling–Gupta efficiency (KGE) greater than 0.97. Application of the graph-based data fusion further reduces mismatch between the GNN model and observations, with as much as 50 % KGE improvement over some cross-validation gages. To improve scalability, a graph-coarsening procedure is introduced and is demonstrated over a much larger basin. Results show that graph coarsening achieves comparable prediction skills at only a fraction of training cost, thus providing important insights into the degree of physical realism needed for developing large-scale GNN-based river network models.

54 ENVIRONMENTAL SCIENCES↗

Optimizing the optimizer for physics-informed neural networks and Kolmogorov-Arnold networks

Physics-Informed Neural Networks (PINNs) have revolutionized the computation of PDE solutions by integrating partial differential equations (PDEs) into the neural network’s training process as soft constraints, becoming an important component of the scientific machine learning (SciML) ecosystem. More recently, physics-informed Kolmogorv-Arnold networks (PIKANs) have also shown to be effective and comparable in accuracy with PINNs. In their current implementation, both PINNs and PIKANs are mainly optimized using first-order methods like Adam, as well as quasi-Newton methods such as BFGS and its low-memory variant, L-BFGS. However, these optimizers often struggle with highly nonlinear and non-convex loss landscapes, leading to challenges such as slow convergence, local minima entrapment, and (non)degenerate saddle points. In this study, we investigate the performance of Self- Scaled BFGS (SSBFGS), Self-Scaled Broyden (SSBroyden) methods and other advanced quasi-Newton schemes, including BFGS and L-BFGS with different line search strategies. These methods dynamically rescale updates based on historical gradient information, thus enhancing training efficiency and accuracy. We systematically compare these optimizers – using both PINNs and PIKANs – on key challenging PDEs, including the Burgers, Allen-Cahn, Kuramoto-Sivashinsky, Ginzburg-Landau, and Stokes equations. Additionally, we evaluate the performance of SSBFGS and SSBroyden for Deep Operator Network (DeepONet) architectures, demonstrating their effectiveness for data-driven operator learning. Our findings provide state-of-the-art results with orders-of-magnitude accuracy improvements without the use of adaptive weights or any other enhancements typically employed in PINNs. More broadly, our work reveal insights into the effectiveness of quasi-Newton optimization strategies in significantly improving the convergence and accurate generalization of PINNs and PIKANs.

97 MATHEMATICS AND COMPUTING↗

Self-adaptive weights based on balanced residual decay rate for physics-informed neural networks and deep operator networks

Physics-informed deep learning has emerged as a promising alternative for solving partial differential equations. However, for complex problems, training these networks can still be challenging, often resulting in unsatisfactory accuracy and efficiency. In this work, we demonstrate that the failure of plain physics-informed neural networks arises from the significant discrepancy in the convergence rate of residuals at different training points, where the slowest convergence rate dominates the overall solution convergence. Based on these observations, we propose a pointwise adaptive weighting method that balances the residual decay rate across different training points. The performance of our proposed adaptive weighting method is compared with current state-of-the-art adaptive weighting methods on benchmark problems for both physics-informed neural networks and physics-informed deep operator networks. In conclusion, through extensive numerical results we demonstrate that our proposed approach of balanced residual decay rates offers several advantages, including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.

Balanced convergence rate↗

Towards A Network-of-Networks Framework for Cyber Security

Networks-of-networks (NoN) is a graph-theoretic model of interdependent networks that have distinct dynamics at each network (layer). By adding special edges to represent relationships between nodes in different layers, NoN provides a unified mechanism to study interdependent systems intertwined in a complex relationship. While NoN based models have been proposed for cyber-physical systems, in this paper we build towards a three-layer NoN model for an enterprise cyber system. Each layer captures a different facet of a cyber system. We then discuss the potential benefits of graph-theoretic analysis enabled from such a model. Our goal is to provide a novel and powerful tool for modeling and analyzing problems in cyber security.

cyber security↗

Investigating the Vulnerabilities of the Direct Transfer Trip Scheme for Network Protector Units in the Secondary Networks of Electric Power Distribution Grids

Network protector units (NPUs) are crucial parts of the protection of secondary networks to effectively isolate faults occurring on the primary feeders. When a fault occurs on the primary feeder, there is a path of the fault current going through the service transformers that causes a negative flow of current on the NPU connected to the faulted feeder. Conventionally, NPUs rely on the direction of current with respect to the voltage to detect faults and make a correct trip decision. However, the conventional NPU logic does not allow the reverse power flow caused by distributed energy resources installed on secondary networks. The communication-assisted direct transfer trip logic for NPUs can be used to address this challenge. However, the communication-assisted scheme is exposed to some vulnerabilities arising from the disruption or corruption of the communicated data that can endanger the reliable operation of NPUs. This paper evaluates the impact of the malfunction of the communication system on the operation of communication-assisted NPU logic. To this end, the impact of packet modification and denial-of-service cyberattacks on the communication-assisted scheme are evaluated. The evaluation was performed using a hardware-in-the-loop (HIL) co-simulation testbed that includes both real-time power system and communication network digital simulators. This paper evaluates the impact of the cyberattacks for different fault scenarios and provides a list of recommendations to improve the reliability of communication-assisted NPU protection.

direct transfer trip↗

An Artificial Neural Network Model to Predict the Bainite Plate Thickness of Nanostructured Bainitic Steels Using an Efficient Network-Learning Algorithm

Nanostructured bainitic steel has an extraordinary ultrahigh strength of about 2.0 GPa along with good toughness of 30 MPa m{sup 1/2}. The finer thickness of plate 20-80 nm is largely responsible for achieving such a large hardness of 690-720 HV. In this work, a multilayer perceptron-based artificial neural network (ANN) model has been developed to predict the thickness of bainite plate pertaining to nanostructured bainitic steels. The inputs of the ANN model are, namely, Gibbs free energy for bainitic transformation, austenite strength, transformation temperature for bainite and carbon concentration in the steel. The model prediction revealed that the bainite plate thickness critically depends on austenite strength and Gibbs free energy. From the neural prediction, it is concluded that formation of nanostructured bainitic steel is feasible only if sufficient austenite strength (above 165 MPa) has been achieved. This can be accomplished with a minimum carbon content of 0.5 wt.% in steel and transformation temperature below 300 °C. Higher driving force (Gibbs free energy) below − 1800 J/mol is another prerequisite condition of formation of nanostructured bainite steel. The network-learning architecture has been optimized using the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to minimize the network training error within eight training cycles. The algorithm facilitates a faster convergence of network training and testing errors.

36 MATERIALS SCIENCE↗

Network of networks: Time series clustering of AmeriFlux sites

Environmental observation networks, such as AmeriFlux, are foundational for monitoring ecosystem response to climate change, management practices, and natural disturbances; however, their effectiveness depends on their representativeness for the regions or continents. We proposed an empirical, time series approach to quantify the similarity of ecosystem fluxes across AmeriFlux sites. We extracted the diel and seasonal characteristics (i.e., amplitudes, phases) from carbon dioxide, water vapor, energy, and momentum fluxes, which reflect the effects of climate, plant phenology, and ecophysiology on the observations, and explored the potential aggregations of AmeriFlux sites through hierarchical clustering. While net radiation and temperature showed latitudinal clustering as expected, flux variables revealed a more uneven clustering with many small (number of sites < 5), unique groups and a few large (> 100) to intermediate (15–70) groups, highlighting the significant ecological regulations of ecosystem fluxes. Many identified unique groups were from under-sampled ecoregions and biome types of the International Geosphere-Biosphere Programme (IGBP), with distinct flux dynamics compared to the rest of the network. At the finer spatial scale, local topography, disturbance, management, edaphic, and hydrological regimes further enlarge the difference in flux dynamics within the groups. Nonetheless, our clustering approach is a data-driven method to interpret the AmeriFlux network, informing future cross-site syntheses, upscaling, and model-data benchmarking research. Finally, we highlighted the unique and underrepresented sites in the AmeriFlux network, which were found mainly in Hawaii and Latin America, mountains, and at under-sampled IGBP types (e.g., urban, open water), motivating the incorporation of new/unregistered sites from these groups.

54 ENVIRONMENTAL SCIENCES↗