Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed algorithm”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Retrieval of the sea spray aerosol mode from submicron particle size distributions and supermicron scattering during LASIC

Abstract. Improved quantification of sea spray aerosol concentration and size is important for determining aerosol effects on clouds and the climate, though attempts to accurately capture the size distribution of the sea spray mode remain limited by the availability of supermicron size distributions. In this work, we introduce a new approach to retrieving lognormal mode fit parameters for a sea spray aerosol mode by combining submicron size distributions with supermicron scattering measurements using a Mie inversion. Submicron size distributions were measured by an ultra-high-sensitivity aerosol spectrometer (UHSAS), and supermicron scattering was taken as the difference between <10 µm and <1 µm three-wavelength integrating nephelometer measurements (NEPH). This UHSAS-NEPH method was applied during background marine periods of the Department of Energy Atmospheric Radiation Measurement Layered Atlantic Smoke Interactions with Clouds (LASIC) campaign on Ascension Island (November 2016–May 2017), when the contribution of sea spray aerosol was expected to represent a large fraction of the aerosol mass and total scattering. Lognormal sea spray modal parameters were retrieved from comparisons between nephelometer measurements and a lookup table of Mie theory-simulated scattering coefficients for low-error solutions that minimized the 0.4–1 µm residual in the UHSAS size distribution. We evaluated the UHSAS-NEPH method with a set of clean marine measurements in the North Atlantic that included supermicron size and chemical measurements, showing that measured supermicron size distributions are needed to constrain the sea spray number concentration but that mass concentration was reasonably characterized using supermicron scattering. For LASIC, the UHSAS-NEPH method retrieved sea spray mode properties for approximately 88 % of the background marine times when the scattering variability and total particle concentration were low (<± 5 Mm−1 and <400 cm−3, respectively), with mass mean diameter ranging from 0.6 to 1.9 µm (1.47 ± 0.17 µm), modal width ranging from 1.1 to 3.97 (2.4±0.3), and mass concentration ranging from 0.18 to 23.0 µg m−3 (8.37. ± 4.1 µg m−3). The measured nephelometer scattering at three wavelengths was found to constrain the mode width marginally at the largest particle sizes in the absence of additional size and chemical measurements for defining parameters for the Mie solutions. Comparing UHSAS-NEPH retrievals to those of a fitting algorithm applied only to the submicron UHSAS number size distribution showed that correlations between retrieved mass concentration and the available mass-based sea spray tracers (coarse scattering, wind speed, and chloride) are low when supermicron measurements are not considered. This work demonstrates the added value of supermicron scattering measurements for retrieving reasonable sea spray mass concentrations, providing the best-available observationally constrained estimate of the sea spray mode properties when supermicron size distribution measurements are not available.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

A Hierarchical OPF Algorithm with Improved Gradient Evaluation in Three-Phase Networks

Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient algorithms converge to solutions with voltage violation. In this paper, we improve a recent hierarchical OPF algorithm that rested on primal-dual gradients evaluated with a linearized distribution power flow model. Specifically, we propose a more accurate gradient evaluation method based on an unbalanced three-phase nonlinear distribution power flow model to mitigate the errors arising from linearization. The resultant gradients feature a blocked structure that enables our development of an improved hierarchical primal-dual algorithm to solve the OPF problem. Numerical results on the IEEE 123-bus test feeder and a 4,518-node test feeder show that the proposed method can enhance voltage safety at comparable computational efficiency with the linearized algorithm.

approximation algorithms↗
DOE OSTI2022

Safety-assured, real-time neural active fault management for resilient microgrids integration

Federated-learning-based active fault management (AFM) is devised to achieve real-time safety assurance for microgrids and the main grid during faults. AFM was originally formulated as a distributed optimization problem. Here, federated learning is used to train each microgrid's network with training data achieved from distributed optimization. The main contribution of this work is to replace the optimization-based AFM control algorithm with a learning-based AFM control algorithm. The replacement transfers computation from online to offline. With this replacement, the control algorithm can meet real-time requirements for a system with dozens of microgrids. By contrast, distributed-optimization-based fault management can output reference values fast enough for a system with several microgrids. More microgrids, however, lead to more computation time with optimization-based method. Distributed-optimization-based fault management would fail real-time requirements for a system with dozens of microgrids. Controller hardware-in-the-loop real-time simulations demonstrate that learning-based AFM can output reference values within 10 ms irrespective of the number of microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Rare Events via Cross-Entropy Population Monte Carlo

Rare events are events that happen with very low frequency. Estimating rare event probabilities using Monte Carlo techniques is computationally expensive, often to the point of intractability, and special methods are required. Importance sampling (IS) is a well known technique that uses a proposal distribution in place of a target distribution to lower the variance of the estimator. Key to the success of IS methods is the choice of a proposal distribution, or the parameters governing the distribution. Adaptive importance sampling improves the parameters of a family or population of proposal distributions iteratively through trials. We present a novel cross-entropy population Monte Carlo algorithm, which adapts the parameters of proposals through the cross-entropy method. The proposed method stands apart from previous work in that we are not optimizing a mixture distribution. Instead, we leverage deterministic mixture weights and optimize the distributions individually through a reinterpretation of the typical derivation of the cross-entropy method. Demonstrations on rare event examples show that the algorithm can outperform existing resampling based population Monte Carlo methods, especially for higher-dimensional problems. Finally, we also demonstrate efficacy on a conjunction analysis problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Computing water flow through complex landscapes – Part 3: Fill–Spill–Merge: flow routing in depression hierarchies

Abstract. Depressions – inwardly draining regions – are common to many landscapes. When there is sufficient moisture, depressions take the form of lakes and wetlands; otherwise, they may be dry. Hydrological flow models used in geomorphology, hydrology, planetary science, soil and water conservation, and other fields often eliminate depressions through filling or breaching; however, this can produce unrealistic results. Models that retain depressions, on the other hand, are often undesirably expensive to run. In previous work we began to address this by developing a depression hierarchy data structure to capture the full topographic complexity of depressions in a region. Here, we extend this work by presenting the Fill–Spill–Merge algorithm that utilizes our depression hierarchy data structure to rapidly process and distribute runoff. Runoff fills depressions, which then overflow and spill into their neighbors. If both a depression and its neighbor fill, they merge. We provide a detailed explanation of the algorithm and results from two sample study areas. In these case studies, the algorithm runs 90–2600 times faster (with a reduction in compute time of 2000–63 000 times) than the commonly used Jacobi iteration and produces a more accurate output. Complete, well-commented, open-source code with 97 % test coverage is available on GitHub and Zenodo.

58 GEOSCIENCES↗
DOE OSTI2024

Fiber optic computing using distributed feedback

Abstract The widespread adoption of machine learning and other matrix intensive computing algorithms has renewed interest in analog optical computing, which has the potential to perform large-scale matrix multiplications with superior energy scaling and lower latency than digital electronics. However, most optical techniques rely on spatial multiplexing, requiring a large number of modulators and detectors, and are typically restricted to performing a single kernel convolution operation per layer. Here, we introduce a fiber-optic computing architecture based on temporal multiplexing and distributed feedback that performs multiple convolutions on the input data in a single layer. Using Rayleigh backscattering in standard single mode fiber, we show that this technique can efficiently apply a series of random nonlinear projections to the input data, facilitating a variety of computing tasks. The approach enables efficient energy scaling with orders of magnitude lower power consumption than GPUs, while maintaining low latency and high data-throughput.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Kinetic theory of particle-in-cell simulation plasma and the ensemble averaging technique

Abstract We derive the kinetic theory of fluctuations in physically and numerically stable particle-in-cell (PIC) simulations of electrostatic plasmas. The starting point is the single-time correlation at the start of the simulation between the statistical fluctuations of the weighted densities of macroparticle centers in the plasma particle phase-space. The fluctuations are associated with different initial conditions, typically due to the random initial conditions (in velocity space) of the macroparticles/simulation plasma, assigned according to their initial distribution of probability. The single-time correlations at all time steps and in each spatial grid cell are then determined from the Laplace–Fourier transforms of the discretized Klimontovich-like equation for the macroparticles and Maxwell’s equations for the fields, as computed by modern PIC codes. We recover the expressions for the electrostatic field and the plasma particle density fluctuation autocorrelation spectra as well as the kinetic equations describing the average evolution of PIC-simulated plasma particles, first derived by Langdon (1970b Proc. 4th Conf. Numerical Simulation of Plasmas ) using a test macroparticle approach perturbing a discretized Vlasovian plasma and then averaging the obtained physical quantity over the initial macroparticle velocity distribution. We generalize and extend these results to the modern algorithms in PIC codes using arbitrary macroparticle weights. Analytical estimates of statistical fluctuation amplitudes are derived as a function of the plasma simulation parameters, using the central limit theorem in the limit of a large number of macroparticles per cell. The theory is then used to analyze the ensemble averaging technique of PIC simulations where statistical averages are performed over ensembles of PIC simulations, modeling the same plasma physics problem but using different statistical realizations of the initial distribution functions of the macroparticles. This method is illustrated by linear Landau damping uncovering (from noise, which is usually considered numerical) the physical fluctuations driven by a single small amplitude electrostatic wave perturbing a PIC simulation plasma in equilibrium.

fluctuations correlations↗
DOE OSTI2024

Lion Cub: Minimizing Communication Overhead in Distributed Lion

Communication overhead is a key challenge in distributed deep learning, especially on slower Ethernet intercon nects, and given current hardware trends, communication is likely to become a major bottleneck. While gradient compression techniques have been explored for SGD and Adam, the Lion optimizer has the distinct advantage that its update vectors are the output of a sign operation, enabling straightforward quantization. However, simply compressing updates for communication and using techniques like majority voting fails to lead to end-to-end speedups due to inefficient communication algorithms and reduced convergence. We analyze three factors critical to distributed learning with Lion: optimizing communication methods, identifying effective quantization methods, and assessing the necessity of momentum synchronization. Our findings show that quantization techniques adapted to Lion and selective momentum synchronization can significantly reduce communication costs while maintaining convergence. We combine these into Lion Cub, which enables up to 5x speedups in end-to-end training compared to Lion. This highlights Lion’s potential as a communication-efficient solution for distributed training.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Joint Estimation of Topology and Injection Statistics in Distribution Grids with Missing Nodes

Optimal operation of distribution grid resources relies on accurate estimation of its state and topology. Practical estimation of such quantities is complicated by the limited presence of real-time meters. This article discusses a theoretical framework to jointly estimate the operational topology and statistics of injections in radial distribution grids under limited availability of nodal voltage measurements. In particular, we show that our proposed algorithms are able to provably learn the exact grid topology and injection statistics at all unobserved nodes as long as they are not adjacent. The algorithm design is based on novel ordered trends in voltage magnitude fluctuations at node groups, that are independently of interest for radial physical flow networks. The complexity of the designed algorithms is theoretically analyzed and their performance is validated using both linearized and nonlinear ac power flow samples in test distribution grids.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Algorithms for Forward and Inverse Problem Solutions in Phase Contrast Tomography

PhaseTorch is a python package that implements algorithms for forward and inverse problem solutions in X-ray phase contrast tomography (XPCT). XPCT is useful to reconstruct the 3D distribution of the refractive index decrement and absorption index of an imaged object. PhaseTorch implements algorithms for simulation, reconstruction, and analysis of XPCT data. PhaseTorch provides algorithms for simulation of XPCT data of an object with known refractive and absorption indices. It contains algorithms for reconstructing the projections of the absorption index and refractive index decrement.

Sridhar, Venkatesh↗
DOE OSTI2024

Flexible dynamic boundary microgrid operation considering network and load unbalances

Flexible microgrids with dynamic boundaries have recently been introduced in the literature. With the ability to reconfigure the topology of the microgrids dynamically through remotely controlled switches, flexible microgrids with dynamic boundaries can further improve the resiliency and energy efficiency of microgrids with distributed energy resources (DERs). This paper focuses on the optimal operation considering one of the predominant characteristics of microgrids and distribution systems – unbalanced networks and loads. In existing literature, balanced modeling of microgrids is more common due to its attractive simplicity. The three-phase power unbalance has not been considered as a constraint on the generation units in a microgrid. Further, negative sequence constraints have also been neglected. In this article, we propose a set of constraints that is specifically related to the capabilities of inverter interfaced resources to supply unbalanced current/power when the microgrid is islanded from the main distribution grid. We incorporate the new set of constraints into two optimization formulations leveraging two convex relaxations of the three-phase power flow equations: mixed-integer linear programming (MILP) and mixed-integer semidefinite programming (MISDP) that optimize the dispatch of controllable switches and DERs in the microgrid. The algorithms are then extended to networked microgrids with grid-forming sources. We test the algorithms on a realistic community microgrid model in Puerto Rico as well as standardized IEEE distribution test feeders. The testing results demonstrate the performance of the proposed algorithms. The MILP is fast and scalable, and the MISDP enforces the negative sequence voltage constraints.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Estimating Cosmological Constraints from Galaxy Cluster Abundance using Simulation-Based Inference

Inferring the values and uncertainties of cosmological parameters in a cosmology model is of paramount importance for modern cosmic observations. In this paper, we use the simulation-based inference (SBI) approach to estimate cosmological constraints from a simplified galaxy cluster observation analysis. Using data generated from the Quijote simulation suite and analytical models, we train a machine learning algorithm to learn the probability function between cosmological parameters and the possible galaxy cluster observables. The posterior distribution of the cosmological parameters at a given observation is then obtained by sampling the predictions from the trained algorithm. Our results show that the SBI method can successfully recover the truth values of the cosmological parameters within the 2σ limit for this simplified galaxy cluster analysis, and acquires similar posterior constraints obtained with a likelihood-based Markov Chain Monte Carlo method, the current state-of the-art method used in similar cosmological studies.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Optimal Energy Storage Schedules for Load Leveling and Ramp Rate Control in Distribution Systems

Continued integration of distributed energy resources (DERs) into the grid, such as solar PVs, at a large-scale, contributes into the famous Duck Curve. New DER management algorithms are therefore deemed necessary to alleviate rapid variations within net load profiles of distribution systems. Herein this paper proposes a process to determine the optimal energy storage schedules for leveling the distribution circuit feederhead net load. A series of sensitivity analyses shows how the proposed method can be used to determine the optimal energy storage schedules with different capacities, state of charge requirements, and net load ramp rate limitations.

25 ENERGY STORAGE↗
DOE OSTI2021

Subfield crop yields and temporal stability in thousands of US Midwest fields

Understanding subfield crop yields and temporal stability is critical to better manage crops. Several algorithms have proposed to study within-field temporal variability but they were mostly limited to few fields. In this study, a large dataset composed of 5520 yield maps from 768 fields provided by farmers was used to investigate the influence of subfield yield distribution skewness on temporal variability. The data are used to test two intuitive algorithms for mapping stability: one based on standard deviation and the second based on pixel ranking and percentiles. The analysis of yield monitor data indicates that yield distribution is asymmetric, and it tends to be negatively skewed (p < 0.05) for all of the four crops analyzed, meaning that low yielding areas are lower in frequency but cover a larger range of low values. The mean yield difference between the pixels classified as high-and-stable and the pixels classified as low-and-stable was 1.04 Mg ha –1 for maize, 0.39 Mg ha –1 for cotton, 0.34 Mg ha –1 for soybean, and 0.59 Mg ha —1 for wheat. The yield of the unstable zones was similar to the pixels classified as low-and-stable by the standard deviation algorithm, whereas the two-way outlier algorithm did not exhibit this bias. Furthermore, the increase in the number years of yield maps available induced a modest but significant increase in the certainty of stability classifications, and the proportion of unstable pixels increased with the precipitation heterogeneity between the years comprising the yield maps.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

A quantum encryption design featuring confusion, diffusion, and mode of operation

Abstract Quantum cryptography—the application of quantum information processing and quantum computing techniques to cryptography has been extensively investigated. Two major directions of quantum cryptography are quantum key distribution (QKD) and quantum encryption, with the former focusing on secure key distribution and the latter focusing on encryption using quantum algorithms. In contrast to the success of the QKD, the development of quantum encryption algorithms is limited to designs of mostly one-time pads (OTP) that are unsuitable for most communication needs. In this work we propose a non-OTP quantum encryption design utilizing a quantum state creation process to encrypt messages. As essentially a non-OTP quantum block cipher the method stands out against existing methods with the following features: 1. complex key-ciphertext relation (i.e. confusion) and complex plaintext-ciphertext relation (i.e. diffusion); 2. mode of operation design for practical encryption on multiple blocks. These features provide key reusability and protection against eavesdropping and standard cryptanalytic attacks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗
DOE OSTI2025

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

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

58 GEOSCIENCES↗
DOE OSTI2022

pnnl/eqc

EQC is a software framework for smart distributed quantum computer management and organization for variational quantum algorithms. EQC utilizes smart real time management of multiple independent quantum processors to maximize variational quantum algorithm throughput, for improved converged performance and improved rate of convergance.

Central, PNNL Developer↗