Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network operations”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Lyapunov stability of smart inverters using linearized distflow approximation

Fast-acting smart inverters that utilize preset operating conditions to determine real and reactive power injection/consumption can create voltage instabilities (over-voltage, voltage oscillations and more) in an electrical distribution network if set-points are not properly configured. In this work, linear distribution power flow equations and droop-based Volt–Var and Volt–Watt control curves are used to analytically derive a stability criterion using Lyapunov analysis that includes the network operating condition. The methodology is generally applicable for control curves that can be represented as Lipschitz functions. The derived Lipschitz constants account for smart inverter hardware limitations for reactive power generation. A local policy is derived from the stability criterion that allows inverters to adapt their control curves by monitoring only local voltage, thus avoiding centralized control or information sharing with other inverters. The criterion is independent of the internal time-delays of smart inverters. Simulation results for inverters with and without the proposed stabilization technique demonstrate how smart inverters can mitigate voltage oscillations locally and mitigate real and reactive power flow disturbances at the substation under multiple scenarios. The study concludes with illustrations of how the control policy can dampen oscillations caused by solar intermittency and cyberattacks.

42 ENGINEERING↗
DOE OSTI2025

Improving the Transportability of a Deep Learning Denoising Model Using Transfer Learning Techniques

The adoption of machine learning techniques in the seismology community has led to great performance improvements in several areas, including signal processing. Specifically, the development of deep learning–based seismic waveform denoising models has the potential to yield improvements in signal detection capabilities for networks operating in particularly noisy environments. Recent advancements in the design of these deep learning denoising models have included the incorporation of continuous and discrete wavelet transform functions into the network architecture to improve the learning capabilities and efficiency of said models. These wavelet transform–based seismic denoising models have shown improved denoising capabilities in regions where there is good agreement between the data features present in the training and evaluation datasets. However, questions remain about the overall transportability of these models to other monitoring regions. Here, in this study, we will determine the baseline transportability of a newly developed multilevel wavelet‐transform convolutional neural network (MWCNN) seismic denoising model. We accomplish this by taking a version of the MWCNN denoising model trained on data collected from the Utah region and evaluating its denoising performance on datasets collected from the neighboring Nevada region, which differ with regard to monitoring sensor types and event histories. We find that there is a notable variability in denoising performance related to the degree of similarity between the initial and new target datasets. The most notable difference in denoising performance is the ability of the denoising model to preserve accurate amplitude information associated with the signal energy present in the waveform data. Finally, we evaluate the ability of transfer learning techniques to improve the transportability of the MWCNN denoising model. We find that although there is still a performance gap present in the denoising results of the MWCNN model, transfer learning did yield improved results.

Quinones, Louis [Sandia National Laboratories (SNL↗
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

Physics-informed latent neural operator for real-time predictions of time-dependent parametric PDEs

Deep operator network (DeepONet) has shown significant promise as surrogate models for systems governed by partial differential equations (PDEs), enabling accurate mappings between infinite-dimensional function spaces. However, when applied to systems with high-dimensional input-output mappings arising from large numbers of spatial and temporal collocation points, these models often require heavily overparameterized networks, leading to long training times. Latent DeepONet addresses some of these challenges by introducing a two-step approach: first learning a reduced latent space using a separate model, followed by operator learning within this latent space. While efficient, this method is inherently data-driven and lacks mechanisms for incorporating physical laws, limiting its robustness and generalizability in data-scarce settings. Here, in this work, we propose PI-Latent-NO, a physics-informed latent neural operator framework that integrates governing physics directly into the learning process. Our architecture features two coupled DeepONets trained end-to-end: a Latent-DeepONet that learns a low-dimensional representation of the solution, and a Reconstruction-DeepONet that maps this latent representation back to the physical space. By embedding PDE constraints into the training via automatic differentiation, our method eliminates the need for labeled training data and ensures physics-consistent predictions. The proposed framework is both memory and compute-efficient, exhibiting near-constant scaling with problem size and demonstrating significant speedups over traditional physics-informed operator models. We validate our approach on a range of parametric PDEs, showcasing its accuracy, scalability, and suitability for real-time prediction in complex physical systems.

Latent representations↗
DOE OSTI2020

Distributed gather/scatter operations across a network of memory nodes

Devices, methods, and systems for distributed gather and scatter operations in a network of memory nodes. A responding memory node includes a memory; a communications interface having circuitry configured to communicate with at least one other memory node; and a controller. The controller includes circuitry configured to receive a request message from a requesting node via the communications interface. The request message indicates a gather or scatter operation, and instructs the responding node to retrieve data elements from a source memory data structure and store the data elements to a destination memory data structure. The controller further includes circuitry configured to transmit a response message to the requesting node via the communications interface. The response message indicates that the data elements have been stored into the destination memory data structure.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Throughput Estimation of Data Transport Networks From Digital Twin Measurements

Digital twins of networked infrastructures, known as Virtual Infrastructure Twins (VITs), are increasingly used for software development, pre-deployment testing, and design space exploration. While VITs avoid the costs and potential disruptions associated with experiments on operational networks, their throughput measurements are typically not sufficiently accurate for performance profiling of wide-area networks that they emulate. Here, machine learning (ML) methods are developed to transform these inaccurate VIT network throughput measurements to closely match in peak and overall profile of those from a physical testbed or production network. First, a micro kernel network reflecting a physical network is utilized to collect one-time measurements on a host to support this ML transformation. Then, a generic multi-modal ML method is developed to learn a map that transforms measurements from subsequent VITs on the same host to match past, current and follow-on testbed and cloud networks. ML generalization equations are derived to establish its correctness and probabilistically guarantee its generalization accuracy. Experimental results are presented for a variety of VIT hosts with target testbed and cloud networks; they include a case study of a four-site science ecosystem wherein inaccurate convex VIT measurement profiles are transformed into accurate concave profiles of target networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Efficient Reformulation and Optimization for SC-ACOPF with Line Switching

This project aims to develop efficient and robust computational methods for solving the security-constrained alternating current optimal power flow problem (SC-ACOPF). The SC-ACOPF problem is a central problem in operating the electric power grids in the United States. It determines the most economically efficient way to operate the generation and transmission system to meet daily electricity demand. The solution found by solving an SC-ACOPF problem must satisfy the physics of the alternating current (AC) power flows, various generator and network operational constraints, and must maintain secure operation under various contingency scenarios, where a generator, a transmission branch, or a transformer may unexpectedly trip offline.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Secure and Adaptive Hierarchical Multi-Timescale Framework for Resilient Load Restoration Using a Community Microgrid

Distribution system integrated community microgrids (CMGs) can partake in restoring loads during extended duration outages. At such times, the CMGs are challenged with limited resource availability, absence of robust grid support, and heightened demand-supply uncertainty. Here, this paper proposes a secure and adaptive three-stage hierarchical multi-timescale framework for scheduling and real-time (RT) dispatch of CMGs with hybrid PV systems to address these challenges. The framework enables the CMG to dynamically expand its boundary to support the neighboring grid sections and is adaptive to the changing forecast error impacts. The first stage solves a stochastic extended duration scheduling (EDS) problem to obtain referral plans for optimal resource rationing. The intermediate near-real-time (NRT) scheduling stage updates the EDS schedule closer to the dispatch time using new obtained forecasts, followed by the RT dispatch stage. To make the decisions more secure and robust against forecast errors, a novel concept called delayed recourse is designed. The approach is evaluated via numerical simulations on a modified IEEE 123-bus system and validated using OpenDSS and hardware-in-loop simulations. The results show superior performance in maximizing load supply and continuous secure distribution network operation under different operating scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Scale-bridging Optimization Framework for Desalination Integrated Produced Water Networks

Produced water (PW) management poses a major challenge to U.S. oil and gas development. Due to freshwater scarcity and PW injection curtailments, desalination may become a necessity in some parts of the country. Integrating rigorous desalination process models within a produced water network for co-optimization of desalination design and network operation can be challenging to scale-up due to computational complexity. In this work we use the trust region filter framework to decompose the integrated optimization problem into an optimization master problem consisting of the network model and simplified surrogates for the desalination units and an optimization sub problem for the rigorous desalination unit model. The approach is demonstrated on a multiperiod produced water network from the PARETO library with thermal desalination units.

Naik, Sakshi↗
DOE OSTI2022

Valuation of Novel Waste Heat Sources and a Path Towards Adoption: Preprint

It is recognized that beneficial electrification of most space heating will be necessary to avert the worst consequences of climate change. Fifth generation district heating and cooling (5GDHC) networks operate at near-ambient temperatures and thus facilitate heating electrification, as well as the use of waste heat sources at a wide range of temperatures. In this paper, we analyze the potential of waste heat to supply the required heat to these networks and describe the business models that could expand the use of these waste heat sources. Showcase single family and commercial districts in the US are discussed to demonstrate emerging technologies, district infrastructure approaches, and third-party thermal utility funding models for these leading 5GDHC networks. As part of this work, heat flow and temperature profiles from five different types of waste heat sources are analyzed. An example district is used to examine the integration potential and to quantify the potential reduction in energy consumption. The results indicate that 5GDHC networks are highly suitable systems for utilizing low to moderate temperature waste heat sources. In the studied district, waste heat can cover a share of up to 66% of the heat supplied to the ambient loop and reduce the overall electricity consumption for heating by up to 51%, depending on the characteristics of the specific power, temperature, and type of waste heat source. Through their moderate operating temperatures and use of waste heat sources combined with third party financed infrastructure, 5GDHC districts have significant potential to reduce carbon emissions associated with space conditioning.

district energy↗
DOE OSTI2026

Latent Twins

Over the past decade, scientific machine learning has transformed the development of mathematical and computational frameworks for analyzing, modeling, and predicting complex systems. From inverse problems to numerical partial differential equations (PDEs), dynamical systems, and model reduction, these advances have pushed the boundaries of what can be simulated. Yet they have often progressed in parallel, with representation learning and algorithmic solution methods evolving largely as separate pipelines. With Latent Twins, we propose a unifying mathematical framework that creates a hidden surrogate in latent space for the underlying equations. Whereas digital twins mirror physical systems in the digital world, Latent Twins mirror mathematical systems in a learned latent space governed by operators. Through this lens, classical modeling, inversion, model reduction, and operator approximation all emerge as special cases of a single principle. We establish the fundamental approximation properties of Latent Twins for both ordinary differential equations (ODEs) and PDEs and demonstrate the framework across three representative settings: (i) canonical ODEs, capturing diverse dynamical regimes; (ii) a PDE benchmark using the shallow-water equations, contrasting Latent Twin simulations with deep operator network and forecasts with a four-dimensional variational method baseline; and (iii) a challenging real-data geopotential reanalysis dataset, reconstructing and forecasting from sparse, noisy observations. Latent Twins provide a compact, interpretable surrogate for solution operators that evaluate across arbitrary time gaps in a single-shot, while remaining compatible with scientific pipelines such as assimilation, control, and uncertainty quantification. Looking forward, this framework offers scalable, theory-grounded surrogates that bridge data-driven representation learning and classical scientific modeling across disciplines.

Latent Twins↗
DOE OSTI2020

Toward lower-diameter large-scale HPC and data center networks with co-packaged optics

We investigate the advantages of using co-packaged optics for building low-diameter, large-scale high-performance computing (HPC) and data center networks. The increased escape bandwidth offered by co-packaged optics can enable high-radix switch implementations of more than 150 switch ports, which can be combined with data rates of up to 400 Gb/s per port. From the network architecture perspective, the key benefits of using co-packaged optics in future fat-tree networks include (a) the ability to implement large-scale topologies of > <#comment/> 11 , 000 end points by eliminating the need for a third switching layer and (b) the ability to provide up to 4 × <#comment/> higher bisection bandwidth compared to existing solutions, reducing at the same time the number of required switch application-specific integrated circuits by > <#comment/> 80 % <#comment/> . From the network operation perspective, both reduced energy consumption and lower packet delays can be achieved since fewer hops are required; i.e., packets need to traverse fewer serializer/deserializer lanes and fewer switch buffers, which reduces the probability of contending with other packets and improves the tolerance of network congestion. The performance of the proposed architecture is evaluated via discrete-event simulations for a wide range of representative HPC synthetic-traffic cases that include both hotspot and non-hotspot scenarios. The simulation results suggest that co-packaged optics form a promising solution to keep up with bandwidth scaling in future networks, while the reduced number of switching layers can lead to significant mean packet delay improvements that start from 30% and reach up to 74% for high-load conditions.

Maniotis, Pavlos (ORCID:0000000244905253)↗
DOE OSTI2022

Resolving extreme jet substructure

We study the effectiveness of theoretically-motivated high-level jet observables in the extreme context of jets with a large number of hard sub-jets (up to N = 8). Previous studies indicate that high-level observables are powerful, interpretable tools to probe jet substructure for N ≤ 3 hard sub-jets, but that deep neural networks trained on low-level jet constituents match or slightly exceed their performance. We extend this work for up to N = 8 hard sub-jets, using deep particle-flow networks (PFNs) and Transformer based networks to estimate a loose upper bound on the classification performance. A fully-connected neural network operating on a standard set of high-level jet observables, 135 N-subjetiness observables and jet mass, reach classification accuracy of 86.90%, but fall short of the PFN and Transformer models, which reach classification accuracies of 89.19% and 91.27% respectively, suggesting that the constituent networks utilize information not captured by the set of high-level observables. We then identify additional high-level observables which are able to narrow this gap, and utilize LASSO regularization for feature selection to identify and rank the most relevant observables and provide further insights into the learning strategies used by the constituent-based neural networks. The final model contains only 31 high-level observables and is able to match the performance of the PFN and approximate the performance of the Transformer model to within 2%.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Synergistic learning with multi-task DeepONet for efficient PDE problem solving

Multi-task learning (MTL) is an inductive transfer mechanism designed to leverage useful information from multiple tasks to improve generalization performance compared to single-task learning. It has been extensively explored in traditional machine learning to address issues such as data sparsity and overfitting in neural networks. In this work, we apply MTL to problems in science and engineering governed by partial differential equations (PDEs). However, implementing MTL in this context is complex, as it requires task-specific modifications to accommodate various scenarios representing different physical processes. To this end, we present a multi-task deep operator network (MT-DeepONet) to learn solutions across various functional forms of source terms in a PDE and multiple geometries in a single concurrent training session. We introduce modifications in the branch network of the vanilla DeepONet to account for various functional forms of a parameterized coefficient in a PDE. Additionally, we handle parameterized geometries by introducing a binary mask in the branch network and incorporating it into the loss term to improve convergence and generalization to new geometry tasks. Our approach is demonstrated on three benchmark problems: (1) learning different functional forms of the source term in the Fisher equation; (2) learning multiple geometries in a 2D Darcy Flow problem and showcasing better transfer learning capabilities to new geometries; and (3) learning 3D parameterized geometries for a heat transfer problem and demonstrate the ability to predict on new but similar geometries. Finally, our MT-DeepONet framework offers a novel approach to solving PDE problems in engineering and science under a unified umbrella based on synergistic learning that reduces the overall training cost for neural operators.

42 ENGINEERING↗
DOE OSTI2024

RandONets: Shallow networks with random projections for learning linear and nonlinear operators

Deep neural networks have been extensively used for the solution of both the forward and the inverse problem for dynamical systems. However, their implementation necessitates optimizing a high-dimensional space of parameters and hyperparameters. This fact, along with the requirement of substantial computational resources, pose a barrier to achieving high numerical accuracy, but also interpretability. Here, to address the above challenges, we present Random Projection-based Operator Networks (RandONets): shallow networks with random projections and tailor-made numerical analysis methods that learn accurately and fast linear and nonlinear operators. Building on previous works, we prove that RandOnets are universal approximators of linear and nonlinear operators. Due to their simplicity, RandONets provide a one-step transformation of the input space, facilitating interpretability. For the evaluation of their performance, we focus on operators of PDEs. We show, that RandONets outperform by several orders of magnitude, both in terms of numerical approximation accuracy and computational cost, the “vanilla” DeepONets. Hence, we believe that our method will trigger further developments in the field of scientific machine learning, for the development of new ‘’light”schemes that will provide high accuracy while reducing dramatically the computational cost. A MATLAB toolbox for RandONets, including demos, is available on GitHub at https://github.com/GianlucaFabiani/RandONets.

Interpretable machine learning↗
DOE OSTI2024

First-generation college student forges ahead, now key to Lab's mission

Fatima Woody was just 17 and a student at Pojoaque Valley High School when she first started her career as a Los Alamos Neutron Science Center receptionist. Now she's in a crucial role that keeps plutonium pit production and other mission processes operating with as little interruption as possible. Over nearly four decades, Fatima has gradually advanced from her initial positions as a receptionist and administrative secretary to become a computer technician, then a computer system professional who specializes in project management. Today, she coordinates the workflow for nearly two dozen deployed information technology technicians who keep the computer systems and networks operating at the high-tech complex that houses the Lab's Plutonium Facility.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2020

Online Optimization for Networked Distributed Energy Resources With Time-Coupling Constraints

This paper proposes a Lyapunov optimization-based online distributed (LOOD) algorithmic framework for active distribution networks (ADNs) with numerous photovoltaic inverters and inverter air conditionings (IACs). In the proposed scheme, ADNs can track an active power setpoint reference at the substation in response to transmission-level requests while concurrently minimizing the social utility loss and ensuring the security of voltages. Conventional distributed optimization methods are rarely feasible to track the optimal solutions in fast variable environments using a fine-grained sampling interval where the underlying optimization problem evolves with the iterations of the algorithms. In contrast, based on the framework of online convex optimization (OCO), the developed approach uses a distributed algebraic update to compute the next round decisions relying on the current feedback of measurements. Notably, the time-coupling constraints of IACs are decoupled for online implementation with Lyapunov optimization technique. An incentive scheme is tailored to coordinate the customer-owned assets in lieu of the direct control from network operators. Optimality and convergency are characterized analytically. Finally, we corroborate the proposed method on a modified version of 33-node test feeder. Benchmark tests show that the proposed method is computationally and economically efficient, and outperforming existing algorithms.

active distribution networks↗