Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network convergence”

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

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

Simultaneously improving accuracy and computational cost under parametric constraints in materials property prediction tasks

Abstract Modern data mining techniques using machine learning (ML) and deep learning (DL) algorithms have been shown to excel in the regression-based task of materials property prediction using various materials representations. In an attempt to improve the predictive performance of the deep neural network model, researchers have tried to add more layers as well as develop new architectural components to create sophisticated and deep neural network models that can aid in the training process and improve the predictive ability of the final model. However, usually, these modifications require a lot of computational resources, thereby further increasing the already large model training time, which is often not feasible, thereby limiting usage for most researchers. In this paper, we study and propose a deep neural network framework for regression-based problems comprising of fully connected layers that can work with any numerical vector-based materials representations as model input. We present a novel deep regression neural network, iBRNet, with branched skip connections and multiple schedulers, which can reduce the number of parameters used to construct the model, improve the accuracy, and decrease the training time of the predictive model. We perform the model training using composition-based numerical vectors representing the elemental fractions of the respective materials and compare their performance against other traditional ML and several known DL architectures. Using multiple datasets with varying data sizes for training and testing, We show that the proposed iBRNet models outperform the state-of-the-art ML and DL models for all data sizes. We also show that the branched structure and usage of multiple schedulers lead to fewer parameters and faster model training time with better convergence than other neural networks. Scientific contribution: The combination of multiple callback functions in deep neural networks minimizes training time and maximizes accuracy in a controlled computational environment with parametric constraints for the task of materials property prediction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Enhancing Security and Resiliency in Operational Technology Environments Through Network Slicing and Federated Learning

The growing convergence of Information Technology (IT) and Operational Technology (OT) within Industry 4.0 environments has introduced new demands on industrial network infrastructure. As cyber-physical systems become increasingly interconnected, ensuring the secure, timely, and efficient exchange of critical data is essential. This thesis explores how network slicing, a method of creating isolated virtual network segments, can be applied within OT environments to address challenges such as latency, security, and resource allocation. The first research question addressed in this thesis is: How can OT networks take advantage of NFV and SDN technology to become cyber resilient? This study examines the operational, security, and architectural implications of introducing network slicing into traditionally static OT infrastructures such as Industrial Control Systems (ICS) and SCADA. Through simulated deployments and case studies, the research demonstrates how slicing enables better isolation between critical and non-critical services, thereby improving response time, throughput, and security in sensitive environments. The second question considers: How to dynamically implement network slicing and take advantage of network resources towards integrating decentralized machine learning? In response, this thesis proposes a framework that combines Software-Defined Networking (SDN), Network Function Virtualization (NFV), and Federated Learning (FL) to enable real-time analytics while maintaining data locality. The proposed approach reduces the burden on centralized infrastructure and minimizes privacy risks by supporting on-site training of models across distributed OT nodes, coordinated through dynamically allocated network slices. The third focus explores: How slicing helps to increase the resiliency of OT networks through the orchestration of a dynamic DMZ? To answer this, the thesis presents a method for creating and managing Dynamic Demilitarized Zones (DMZs) using network slicing. This enables flexible and automated isolation of sensitive subsystems during threat scenarios or high-risk operations. Coupled with intelligent orchestration and containerized security services, the dynamic DMZ significantly enhances the system's ability to respond to cyber incidents without halting production. Ultimately, this thesis contributes a comprehensive architecture that blends network slicing with machine learning, secure segmentation, and automation, paving the way for resilient, adaptive, and intelligent OT environments. Performance evaluations across multiple scenarios show improvements in system reliability, threat response time, model accuracy, and resource utilization, providing a strong foundation for future industrial automation systems.

Rodiles Delgado, Brian G↗
DOE OSTI2022

Deep-learning-based workflow for boundary and small target segmentation in digital rock images using UNet++ and IK-EBM

We report three-dimensional (3D) X-ray micro-computed tomography (μCT) has been widely used in petroleum engineering because it can provide detailed pore structural information for a reservoir rock, which can be imported into a pore-scale numerical model to simulate the transport and distribution of multiple fluids in the pore space. The partial volume blurring (PVB) problem is a major challenge in segmenting raw μCT images of rock samples, which impacts boundaries and small targets near the resolution limit. We developed a deep-learning (DL)-based workflow for accurate and fast partial volume segmentation. The DL model's performance depends primarily on the training data quality and model architecture. This study employed the entropy-based-masking indicator kriging (IK-EBM) to segment 3D Berea sandstone images as training datasets. The comparison between IK-EBM and manual segmentation using a 3D synthetic sphere pack, which had a known ground truth, showed that IK-EBM had higher accuracy on partial volume segmentation. We then trained and tested the UNet++ model, a state-of-the-art supervised encoder-decoder model, for binary (i.e., void and solid) and four-class segmentation. We compared the UNet++ with the commonly used U-Net and wide U-Net models and showed that the UNet++ had the best performance in terms of pixel-wise and physics-based evaluation metrics. Specifically, boundary-scaled accuracy demonstrated that the UNet++ architecture outperformed the regular U-Net architecture in the segmentation of pixels near boundaries and small targets, which were subjected to the PVB effect. Feature map visualization illustrated that the UNet++ bridged the semantic gaps between the feature maps extracted at different depths of the network, thereby enabling faster convergence and more accurate extraction of fine-scale features. The developed workflow significantly enhances the performance of supervised encoder-decoder models in partial volume segmentation, which has extensive applications in fundamental studies of subsurface energy, water, and environmental systems.

02 PETROLEUM↗
DOE OSTI2022

Inferring the Contribution of Microbial Taxa and Organic Matter Molecular Formulas to Ecological Assembly

Understanding the mechanisms underlying the assembly of communities has long been the goal of many ecological studies. While several studies have evaluated community wide ecological assembly, fewer have focused on investigating the impacts of individual members within a community or assemblage on ecological assembly. Here, we adapted a previous null model β-nearest taxon index (βNTI) to measure the contribution of individual features within an ecological community to overall assembly. This new metric, called feature-level βNTI (βNTI feat ), enables researchers to determine whether ecological features (e.g., individual microbial taxa) contribute to divergence, convergence, or have insignificant impacts across spatiotemporally resolved metacommunities or meta-assemblages. Using βNTI feat , we revealed that unclassified microbial lineages often contributed to community divergence while diverse groups (e.g., Crenarchaeota, Alphaproteobacteria, and Gammaproteobacteria) contributed to convergence. We also demonstrate that βNTI feat can be extended to other ecological assemblages such as organic molecules comprising organic matter (OM) pools. OM had more inconsistent trends compared to the microbial community though CHO-containing molecular formulas often contributed to convergence, while nitrogen and phosphorus-containing formulas contributed to both convergence and divergence. A network analysis was used to relate βNTI feat values from the putatively active microbial community and the OM assemblage and examine potentially common contributions to ecological assembly across different communities/assemblages. This analysis revealed that P-containing formulas often contributed to convergence/divergence separately from other ecological features and N-containing formulas often contributed to assembly in coordination with microorganisms. Additionally, members of Family Geobacteraceae were often observed to contribute to convergence/divergence in conjunction with both N- and P-containing formulas, suggesting a coordinated ecological role for family members and the nitrogen/phosphorus cycle. Overall, we show that βNTI feat offers opportunities to investigate the community or assemblage members, which shape the phylogenetic or functional landscape, and demonstrate the potential to evaluate potential points of coordination across various community types.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1989

Network-Control Algorithm

Algorithm developed for optimal routing of packets of data along links of multilink, multinode digital communication network. Algorithm iterative and converges to cost-optimal assignment independent of initial assignment. Each node connected to other nodes through links, each containing number of two-way channels. Algorithm assigns channels according to message traffic leaving and arriving at each node. Modified to take account of different priorities among packets belonging to different users by using different delay constraints or imposing additional penalties via cost function.

Chan, Hak-Wai↗
DOE OSTI2020

Learning-Accelerated ADMM for Distributed DC Optimal Power Flow

We suggest a novel data-driven method to accelerate the convergence of Alternating Direction Method of Multipliers (ADMM) for solving distributed DC optimal power flow (DC-OPF) where lines are shared between independent network partitions. Using previous observations of ADMM trajectories for a given system under varying load, the method trains a recurrent neural network (RNN) to predict the converged values of dual and consensus variables. Given a new realization of system load, a small number of initial ADMM iterations is taken as input to infer the converged values and directly inject them into the iteration. We empirically demonstrate that the online injection of these values into the ADMM iteration accelerates convergence by a significant factor for partitioned 14-, 118-and 2848-bus test systems under differing load scenarios. The proposed method has several advantages: it maintains the security of private decision variables inherent in consensus ADMM; inference is fast and so may be used in online settings; RNN-generated predictions can dramatically improve time to convergence but, by construction, can never result in infeasible ADMM subproblems; it can be easily integrated into existing software implementations. While we focus on the ADMM formulation of distributed DC-OPF in this paper, the ideas presented are naturally extended to other distributed optimization problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Learning-Accelerated ADMM for Distributed DC Optimal Power Flow

We propose a novel data-driven method to accelerate the convergence of Alternating Direction Method of Multipliers (ADMM) for solving distributed DC optimal power flow (DC-OPF) where lines are shared between independent network partitions. Using previous observations of ADMM trajectories for a given system under varying load, the method trains a recurrent neural network (RNN) to predict the converged values of dual and consensus variables. Given a new realization of system load, a small number of initial ADMM iterations is taken as input to infer the converged values and directly inject them into the iteration. We empirically demonstrate that the online injection of these values into the ADMM iteration accelerates convergence by a significant factor for partitioned 14-, 118- and 2848-bus test systems under differing load scenarios. The proposed method has several advantages: it maintains the security of private decision variables inherent in consensus ADMM; inference is fast and so may be used in online settings; RNN-generated predictions can dramatically improve time to convergence but, by construction, can never result in infeasible ADMM subproblems; it can be easily integrated into existing software implementations. While we focus on the ADMM formulation of distributed DC-OPF in this paper, the ideas presented are naturally extended to other distributed optimization problems.

alternating direction method of multipliers↗
NASA NTRS2016

Converging Supergranular Flows and the Formation of Coronal Plumes

Earlier studies have suggested that coronal plumes are energized by magnetic reconnection between unipolar flux concentrations and nearby bipoles, even though magnetograms sometimes show very little minority-polarity flux near the footpoints of plumes. Here we use high-resolution extreme-ultraviolet (EUV) images and magnetograms from the Solar Dynamics Observatory (SDO) to clarify the relationship between plume emission and the underlying photospheric field. We find that plumes form where unipolar network elements inside coronal holes converge to form dense clumps, and fade as the clumps disperse again. The converging flows also carry internetwork fields of both polarities. Although the minority-polarity flux is sometimes barely visible in the magnetograms, the corresponding EUV images almost invariably show loop-like features in the core of the plumes, with the fine structure changing on timescales of minutes or less. We conclude that the SDO observations are consistent with a model in which plume emission originates from interchange reconnection in converging flows, with the plume lifetime being determined by the approximately 1-day evolutionary timescale of the supergranular network. Furthermore, the presence of large EUV bright points and/or ephemeral regions is not a necessary precondition for the formation of plumes, which can be energized even by the weak, mixed-polarity internetwork fields swept up by converging flows.

Sun: corona↗
NASA NTRS2012

Method and apparatus for determining and utilizing a time-expanded decision network

A method, apparatus and computer program for determining and utilizing a time-expanded decision network is presented. A set of potential system configurations is defined. Next, switching costs are quantified to create a "static network" that captures the difficulty of switching among these configurations. A time-expanded decision network is provided by expanding the static network in time, including chance and decision nodes. Minimum cost paths through the network are evaluated under plausible operating scenarios. The set of initial design configurations are iteratively modified to exploit high-leverage switches and the process is repeated to convergence. Time-expanded decision networks are applicable, but not limited to, the design of systems, products, services and contracts.

Silver, Matthew↗
DOE OSTI2026

Cohort organized learning: clustering through agreement

In this article we describe cohort organized learning (CoOL), a method for clustering data without explicit distance or similarity computations. Herein, we will describe CoOL, derive the gradients determined by expectation maximization to train the networks, show how to monitor convergence during training and evaluate the clusters after training, and discuss a series of examples and use cases. We also discuss CoOL’s limitations and future prospects on related tasks. Because CoOL uses neural networks to estimate the clusters, it can be used to cluster any data that can be made compatible and we illustrate this on vector data and images.

clustering↗
NASA NTRS1992

Sea ice classification using fast learning neural networks

A first learning neural network approach to the classification of sea ice is presented. The fast learning (FL) neural network and a multilayer perceptron (MLP) trained with backpropagation learning (BP network) were tested on simulated data sets based on the known dominant scattering characteristics of the target class. Four classes were used in the data simulation: open water, thick lossy saline ice, thin saline ice, and multiyear ice. The BP network was unable to consistently converge to less than 25 percent error while the FL method yielded an average error of approximately 1 percent on the first iteration of training. The fast learning method presented can significantly reduce the CPU time necessary to train a neural network as well as consistently yield higher classification accuracy than BP networks.

Dawson, M. S.↗
NASA NTRS2004

Real-Time Adaptive Color Segmentation by Neural Networks

Artificial neural networks that would utilize the cascade error projection (CEP) algorithm have been proposed as means of autonomous, real-time, adaptive color segmentation of images that change with time. In the original intended application, such a neural network would be used to analyze digitized color video images of terrain on a remote planet as viewed from an uninhabited spacecraft approaching the planet. During descent toward the surface of the planet, information on the segmentation of the images into differently colored areas would be updated adaptively in real time to capture changes in contrast, brightness, and resolution, all in an effort to identify a safe and scientifically productive landing site and provide control feedback to steer the spacecraft toward that site. Potential terrestrial applications include monitoring images of crops to detect insect invasions and monitoring of buildings and other facilities to detect intruders. The CEP algorithm is reliable and is well suited to implementation in very-large-scale integrated (VLSI) circuitry. It was chosen over other neural-network learning algorithms because it is better suited to realtime learning: It provides a self-evolving neural-network structure, requires fewer iterations to converge and is more tolerant to low resolution (that is, fewer bits) in the quantization of neural-network synaptic weights. Consequently, a CEP neural network learns relatively quickly, and the circuitry needed to implement it is relatively simple. Like other neural networks, a CEP neural network includes an input layer, hidden units, and output units (see figure). As in other neural networks, a CEP network is presented with a succession of input training patterns, giving rise to a set of outputs that are compared with the desired outputs. Also as in other neural networks, the synaptic weights are updated iteratively in an effort to bring the outputs closer to target values. A distinctive feature of the CEP neural network and algorithm is that each update of synaptic weights takes place in conjunction with the addition of another hidden unit, which then remains in place as still other hidden units are added on subsequent iterations. For a given training pattern, the synaptic weight between (1) the inputs and the previously added hidden units and (2) the newly added hidden unit is updated by an amount proportional to the partial derivative of a quadratic error function with respect to the synaptic weight. The synaptic weight between the newly added hidden unit and each output unit is given by a more complex function that involves the errors between the outputs and their target values, the transfer functions (hyperbolic tangents) of the neural units, and the derivatives of the transfer functions.

Duong, Tuan A.↗
NASA NTRS1988

The velocity pattern of weak solar magnetic fields

The proper motion of magnetic elements on the quiet sun has been measured by means of local correlation tracking. The existence of a pattern in the intranetwork (IN) flow is confirmed. This velocity field is consistent with the direct Doppler measurement of the horizontal component of the supergranular velocity field. The IN elements generally move toward the network boundaries. By tracking test points, it is confirmed that the magnetic elements converge in areas corresponding to the magnetic network. But because the IN elements are of random polarity, they cannot contribute to the growth or maintenance of the magnetic network. By calculating the cross correlation between the magnetogram and Dopplergram, it is confirmed that the supergranule boundaries and the magnetic network are roughly correlated.

Wang, H.↗
DOE OSTI2020

Wide neural networks with bottlenecks are deep Gaussian processes

There has recently been much work on the "wide limit" of neural networks, where Bayesian neural networks (BNNs) are shown to converge to a Gaussian process (GP) as all hidden layers are sent to infinite width. However, these results do not apply to architectures that require one or more of the hidden layers to remain narrow. In this paper, we consider the wide limit of BNNs where some hidden layers, called "bottlenecks", are held at finite width. The result is a composition of GPs that we term a "bottleneck neural network Gaussian process" (bottleneck NNGP). Although intuitive, the subtlety of the proof is in showing that the wide limit of a composition of networks is in fact the composition of the limiting GPs. We also analyze theoretically a single-bottleneck NNGP, finding that the bottleneck induces dependence between the outputs of a multi-output network that persists through extreme post-bottleneck depths, and prevents the kernel of the network from losing discriminative power at extreme post-bottleneck depths.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Robust Decentralized Learning Using ADMM With Unreliable Agents

Many signal processing and machine learning problems can be formulated as consensus optimization problems which can be solved efficiently via a cooperative multi-agent system. However, the agents in the system can be unreliable due to a variety of reasons: noise, faults and attacks. Providing erroneous updates leads the optimization process in a wrong direction, and degrades the performance of distributed machine learning algorithms. This paper considers the problem of decentralized learning using ADMM in the presence of unreliable agents. First, we rigorously analyze the effect of erroneous updates (in ADMM learning iterations) on the convergence behavior of the multi-agent system. We show that the algorithm linearly converges to a neighborhood of the optimal solution under certain conditions and characterize the neighborhood size analytically. Next, we provide guidelines for network design to achieve a faster convergence to the neighborhood. Here, we also provide conditions on the erroneous updates for exact convergence to the optimal solution. Finally, to mitigate the influence of unreliable agents, we propose ROAD , a robust variant of ADMM, and show its resilience to unreliable agents with an exact convergence to the optimum.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

Short-term forecasting of thunderstorms at Kennedy Space Center, based on the surface wind field

Techniques incorporating wind convergence that can be used for the short-term prediction of thunderstorm development are described. With these techniques, the convergence signal is sensed by the wind network array 15 to 90 min before actual storm development. Particular attention is given to the convergence cell technique (which has been applied at the Kennedy Space Center) where each convective region is analyzed independently. It is noted that, while the monitoring of areal and cellular convergence can be used to help locate the seeds of developing thunderstorms and pinpoint the lightning threat areas, this forecasting aid cannot be used in isolation.

Watson, Andrew I.↗
DOE OSTI2025

Global River Topology (GRIT): A Bifurcating River Hydrography

Existing global river networks underpin a wide range of hydrological applications but do not represent channels with divergent river flows (bifurcations, multi‐threaded channels, canals), as these features defy the convergent flow assumption that elevation‐derived networks (e.g., HydroSHEDS, MERIT Hydro) are based on. Yet, bifurcations are important features of the global river drainage system, especially on large floodplains and river deltas, and are also often found in densely populated regions. Here we developed the first raster and vector‐based Global RIver Topology that not only represents the tributaries of the global drainage network but also the distributaries, including multi‐threaded rivers, canals and deltas. We achieve this by merging a 30 m Landsat‐based river mask with elevation‐generated streams to ensure a homogeneous drainage density outside of the river mask for rivers narrower than approximately 30 m. Crucially, we employ the new 30 m digital terrain model, FABDEM, based on TanDEM‐X, which shows greater accuracy over the traditionally used SRTM derivatives. After vectorization and pruning, directionality is assigned by a series of elevation, flow angle and continuity approaches. The new global network and its attributes are validated using gauging stations, comparison with existing networks, and randomized manual checks. The new network represents 19.6 million km of streams and rivers with drainage areas greater than 50 km 2 and includes 67,495 bifurcations. With the advent of hyper‐resolution modeling and artificial intelligence, GRIT is expected to greatly improve the accuracy of many river‐based applications such as flood forecasting, water availability and quality simulations, or riverine habitat mapping.

54 ENVIRONMENTAL SCIENCES↗