Search NASA⌕ Search

SEARCH · Search NASA

Results for “networked”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

GNET2: an R package for constructing gene regulatory networks from transcriptomic data

Abstract Motivation The Gene Network Estimation Tool (GNET) is designed to build gene regulatory networks (GRNs) from transcriptomic gene expression data with a probabilistic graphical model. The data preprocessing, model construction and visualization modules of the original GNET software were developed on different programming platforms, which were inconvenient for users to deploy and use. Results Here, we present GNET2, an improved implementation of GNET as an integrated R package. GNET2 provides more flexibility for parameter initialization and regulatory module construction based on the core iterative modeling process of the original algorithm. The data exchange interface of GNET2 is handled within an R session automatically. Given the growing demand for regulatory network reconstruction from transcriptomic data, GNET2 offers a convenient option for GRN inference on large datasets. Availability and implementation The source code of GNET2 is available at https://github.com/jianlin-cheng/GNET2. Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2026

Quantum-inspired weight-constrained neural network: Reducing variable numbers by 100× compared to standard neural networks

Although quantum machine learning has shown great promise, the practical application of quantum computers remains constrained in the noisy intermediate-scale quantum era. To take advantage of quantum machine learning, we investigate the underlying mathematical principles of these quantum models and find that the quantum neural network with amplitude encoding is equivalent to a weight-constrained neural network. Motivated by this discovery, we develop a classical weight-constrained neural network. We find that this approach can reduce the number of variables in a classical neural network by a factor of 135 while preserving its accuracy. In addition, we develop a dropout method to enhance the robustness of quantum machine learning models, which are highly susceptible to adversarial attacks. This technique can also be applied to improve the adversarial robustness of the classical weight-constrained neural network, which is essential for industry applications, such as self-driving vehicles. Our work offers an approach to reduce the complexity of large classical neural networks, addressing a critical challenge in machine learning.

quantum algorithms & computation↗
DOE OSTI2026

Interpretable Models for Workflow Differentiation in High-Performance Scientific Networks

Scientific workflows in high-performance networks spawn hundreds of interdependent flows that must be managed collectively—yet existing network classifiers treat each flow in isolation, leading to fragmented QoS decisions and missed interflow patterns. We present a novel traffic classification solution that operates at the workflow level, distinguishing entire filetransfer operations from streaming analytics by capturing how concurrent flows interact and burst together. We introduce a workflow identification window (WIW) that ingests raw packet headers from parallel flows into unified tensors, preserving the spatial-temporal patterns that differentiate scientific workflows. This approach achieves 98.7% accuracy using CNN, LSTM, and hybrid architectures, while maintaining 84% accuracy on production traffic collected a week later—demonstrating robustness to temporal drift. By integrating SHAP and GradCAM explainability, we reveal that early-packet timing patterns and cross-flow correlations drive classification decisions, providing operators with interpretable insights. Our system enables coherent workflow-level QoS enforcement and dynamic bandwidth allocation in scientific networks, eliminating manual per-flow configuration while maintaining classification latency at millisecond level.

Giannakou, Anna [LBL, Berkeley]↗
DOE OSTI2020

Hyperparameter Optimization in Binary Communication Networks for Neuromorphic Deployment

Training neural networks for neuromorphic deployment is non-trivial. There have been a variety of approaches proposed to adapt back-propagation or back-propagation-like algorithms appropriate for training. Considering that these networks often have very different performance characteristics than traditional neural networks, it is often unclear how to set either the network topology or the hyperparameters to achieve optimal performance. In this work, we introduce a Bayesian approach for optimizing the hyperparameters of an algorithm for training binary communication networks that can be deployed to neuromorphic hardware. We show that by optimizing the hyperparameters on this algorithm for each dataset, we can achieve improvements in accuracy over the previous state-of-the-art for this algorithm on each dataset (by up to 15 percent). This jump in performance continues to emphasize the potential when converting traditional neural networks to binary communication applicable to neuromorphic hardware.

Parsa, Maryam↗
DOE OSTI2022

Data-Driven Chance-Constrained Design of Voltage Droop Control for Distribution Networks: Preprint

This paper addresses the design of local control methods for voltage control in distribution networks with high level of distributed energy resources (DERs). The designed control methods adapt the active and reactive power output of distributed energy resources proportional to the deviation of the local measured voltage magnitudes from a reference voltage, which is referred to as droop control. Thus, the design focuses on determining the droop characteristics which satisfy network-wide voltage magnitude constraints. The uncertainty and variability of DERs renders the design of optimal droop controls very challenging. Hence, this paper proposes chance constraints to limit the risk from intermittent DERs, by designing droop control coefficients that guarantee the satisfaction of network operational constraints with a specific probability. In addition, the proposed approach relies entirely on historical data rather than assuming knowledge of the probability distributions that characterize the uncertainty of DERs. The efficacy of the proposed method is demonstrated on a 37-bus distribution feeder.

chance-constrained optimization↗
DOE OSTI2024

Voltage Calculations in Secondary Distribution Networks via Physics-Inspired Neural Network Using Smart Meter Data

The increasing penetration of distributed energy resources (DERs) leads to voltage issues across distribution networks, necessitating voltage calculations by utilities. Electric model-free voltage calculation offers an enticing solution. However, most researches mainly focus on primary distribution networks ignoring secondary distribution networks and commonly overlook extreme voltage case calculations, which require the model’s extrapolation abilities. Here, in addressing the gaps, this paper presents a customized physics-inspired neural network (PINN) model, the structure of which is inspired by the derived coupled power flow model of primary-secondary distribution networks. To ensure precision and rapid convergence, a crafted training framework for the PINN model is proposed. The PINN’s “structure-mimetic” design enables superior extrapolation for unseen scenarios and enhances physical information awareness. We demonstrate this through two applications: hosting capacity analysis and customer-transformer connectivity. The effectiveness and advantages of the proposed PINN model are validated on two public testing systems and one utility distribution feeder model.

Distribution network↗
DOE OSTI2025

Evaluation of Station Performance of the Idaho National Laboratory Seismic Monitoring Network Using Network Detection Thresholds

The Idaho National Laboratory (INL) Seismic Monitoring Network is located in eastern Idaho and monitors a portion of the intermountain seismic belt. It has been in place for 50 yr and has undergone several major changes, the most recent of which has been the transition to the Antelope real‐time acquisition system and the implementation of automatic phase picking algorithms to aid in analysis. This study discusses the efforts to evaluate the performance of the INL seismic monitoring network (and other surrounding stations) using the new real‐time acquisition system. The method outlined by Wilson et al. (2021) is used to develop an empirical relationship between the observability of local earthquakes as a function of magnitude and distance. This relationship is used to produce detection thresholds for Pwaves for all stations of interest. The INL seismic network has two main goals: monitor tectonic‐and volcanic‐related events and measure ground motions for input into seismic hazard analysis. Because of these two overall objectives, several seismic stations have been installed near critical facilities and, therefore, are not as quiet as stations that are used primarily for earthquake detection. This is reflected in their detection thresholds, which are much smaller for stations away from facilities. This study shows that the INL Seismic Monitoring Network is able to detect earthquakes near INL facilities with M L > 1.2, with redundancies built in to ensure this sensitivity even if data became unavailable from some stations. This study also shows “holes” in the monitoring network where the detection of smaller earthquakes is highly dependent on sparsely placed seismic stations. In conclusion, the results of this study will be used to govern plans for expansion of earthquake monitoring in Idaho and the surrounding region and to fine‐tune the detection thresholds for individual stations.

58 - GEOSCIENCES↗
DOE OSTI2021

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↗
DOE OSTI2024

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↗
DOE OSTI2020

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 OSTI2022

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↗
DOE OSTI2023

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↗
DOE OSTI2024

ℤ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)↗
DOE OSTI2022

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↗
DOE OSTI2025

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↗
DOE OSTI2025

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↗
DOE OSTI2025

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↗
DOE OSTI2025

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↗