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 541 records · Page 30

Distributed Automatic Generation Control Considering DPV Using T&D Dynamic Co-Simulation

The increasing adoption of distributed energy resources (DERs) over the last decade warrants a reconsideration of control of generation resources. This paper proposes a distributed Automatic Generation Control (AGC) using transmission-and-distribution (T&D) dynamic co-simulation framework for the efficient DPV frequency regulation services. The co-simulation framework allows AGC units to exchange the information for distributed AGC, based on their adopted communication network topology. As a result, a cost-effective automatic generation control is achieved with DPV and conventional generators. The proposed distributed AGC is based on the gossip algorithm in which the neighboring AGC units share the relevant local information with each other and updates their share of AGC regulation signal. Distributed photovoltaics (DPV) unit contribute to AGC response based on their headroom capacity via DER aggregators. The algorithm is tested on IEEE-14 bus transmission system under conditions of generation failure and random load variation to observe effective frequency regulations service offered by DPVs and other AGC units. The study shows that DPV can effectively participate in AGC with the proposed distributed control framework.

automatic generation control↗

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗

Understanding Impacts of Frequency Calculations on Underfrequency Load Shedding

Power system fundamental frequency-dependent protection decisions and control decisions are increasingly common in the distribution system space. Understanding the algorithms used in frequency measurements is critical to understanding the decisions made by the many intelligent electronic devices in the power system. These decisions are critically important for reliability analysis for interconnected power systems as they bear directly on resource planning to mitigate under-frequency conditions that would result in under-frequency load shedding (UFLS). This work aims to improve the understanding of frequency measurement algorithms, evaluate the intelligent electronic devices that use frequency measurements for decision making, and understand the algorithms' direct impact on frequency related decision making. First, this work presents background information on the use of frequency measurements in protection logic, specifically UFLS. Second, the paper presents a relay hardware evaluation test bed used to detect and protect systems from under-frequency events. Finally, the paper presents the dynamic events used to evaluate commercially available, off-the-shelf relay equipment and the results from the relay evaluation.

COMTRADE↗

Design and implementation of dynamic I/O control scheme for large scale distributed file systems

In this paper, we have analyzed the input/output (I/O) activities of Cori, which is a high-performance computing system at the National Energy Research Scientific Computing Center at Lawrence Berkeley National Laboratory. Our analysis results indicate that most users do not adjust storage configurations but rather use the default settings. In addition, owing to the interference from many applications running simultaneously, the performance varies based on the system status. To configure file systems autonomously in complex environments, we developed DCA-IO, a dynamic distributed file system configuration adjustment algorithm that utilizes the system log information to adjust storage configurations automatically. Our scheme aims to improve the application performance and avoid interference from other applications without user intervention. Moreover, DCA-IO uses the existing system logs and does not require code modifications, an additional library, or user intervention. To demonstrate the effectiveness of DCA-IO, we performed experiments using I/O kernels of real applications in both an isolated small-sized Lustre environment and Cori. Our experimental results shows that our scheme can improve the performance of HPC applications by up to 263% with the default Lustre configuration.

97 MATHEMATICS AND COMPUTING↗

pyDRESCALk

Modern data scientists are tasked to analyze ever-growing data sets with increasingly complex relationships. Tensor decompositions have come to play a central role in identifying underlying latent structures in higher-order data. The problem of fitting tensor models to different distributions is complicated by the combinations of size, dimensionality, and sparsity present in real world data. The situation demands efficient algorithms designed for shared-memory and distributed systems. This work will present new research that tackles these challenges on several different fronts, leveraging optimizations in numerical algorithms and sparse tensor representations in heterogeneous high performance computing environments.

Bhattarai, Manish↗

Deep Reinforcement Learning Based Volt-VAR Optimization in Smart Distribution Systems

This paper develops a model-free volt-VAR optimization (VVO) algorithm via multi-agent deep reinforcement learning (DRL) in unbalanced distribution systems. This method is novel since we cast the VVO problem in distribution networks to an intelligent deep Q-network (DQN) framework, which avoids solving a specific optimization model directly when facing time-varying operating conditions in the systems. We consider statuses/ratios of switchable capacitors, voltage regulators, and smart inverters installed at distributed generators as the action variables of the agents. A delicately designed reward function guides these agents to interact with the distribution system, in the direction of reinforcing voltage regulation and power loss reduction simultaneously. The forward-backward sweep method for radial three-phase distribution systems provides accurate power flow results within a few iterations to the DRL environment. The proposed method realizes the dual goals for VVO. We test this algorithm on the unbalanced IEEE 13-bus and 123-bus systems. Numerical simulations validate the excellent performance of this method in voltage regulation and power loss reduction.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Validation of Synthetic U.S. Electric Power Distribution System Data Sets

There is a strong need for synthetic yet realistic distribution system test data sets that are as diverse, large, and complex to solve as real systems. Such data sets can facilitate the development of advanced algorithms and the assessment of emerging distributed energy resources while avoiding the need to acquire proprietary critical infrastructure or private data. Such synthetic data sets, however, are useful only if they are realistic enough to look and behave similarly to actual systems. This paper presents a comprehensive framework for validating synthetic distribution data sets using a three-pronged statistical, operational, and expert validation approach. Furthermore, it also presents a set of statistical and operational metric targets for achieving realistic data sets based on detailed characterization of more than 10,000 real U.S. utility feeders. The paper demonstrates the use of the proposed validation approach to validate three large-scale synthetic data sets developed by the authors representing Santa Fe, New Mexico; Greensboro, North Carolina; and the San Francisco Bay Area, California.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Correcting for filter-based aerosol light absorption biases at the Atmospheric Radiation Measurement program's Southern Great Plains site using photoacoustic measurements and machine learning

Abstract. Measurement of light absorption of solar radiation by aerosols is vital for assessing direct aerosol radiative forcing, which affects local and global climate. Low-cost and easy-to-operate filter-based instruments, such as the Particle Soot Absorption Photometer (PSAP), that collect aerosols on a filter and measure light attenuation through the filter are widely used to infer aerosol light absorption. However, filter-based absorption measurements are subject to artifacts that are difficult to quantify. These artifacts are associated with the presence of the filter medium and the complex interactions between the filter fibers and accumulated aerosols. Various correction algorithms have been introduced to correct for the filter-based absorption coefficient measurements toward predicting the particle-phase absorption coefficient (Babs). However, the inability of these algorithms to incorporate into their formulations the complex matrix of influencing parameters such as particle asymmetry parameter, particle size, and particle penetration depth results in prediction of particle-phase absorption coefficients with relatively low accuracy. The analytical forms of corrections also suffer from a lack of universal applicability: different corrections are required for rural and urban sites across the world. In this study, we analyzed and compared 3 months of high-time-resolution ambient aerosol absorption data collected synchronously using a three-wavelength photoacoustic absorption spectrometer (PASS) and PSAP. Both instruments were operated on the same sampling inlet at the Department of Energy's Atmospheric Radiation Measurement program's Southern Great Plains (SGP) user facility in Oklahoma. We implemented the two most commonly used analytical correction algorithms, namely, Virkkula (2010) and the average of Virkkula (2010) and Ogren (2010)–Bond et al. (1999) as well as a random forest regression (RFR) machine learning algorithm to predict Babs values from the PSAP's filter-based measurements. The predicted Babs was compared against the reference Babs measured by the PASS. The RFR algorithm performed the best by yielding the lowest root mean square error of prediction. The algorithm was trained using input datasets from the PSAP (transmission and uncorrected absorption coefficient), a co-located nephelometer (scattering coefficients), and the Aerosol Chemical Speciation Monitor (mass concentration of non-refractory aerosol particles). A revised form of the Virkkula (2010) algorithm suitable for the SGP site has been proposed; however, its performance yields approximately 2-fold errors when compared to the RFR algorithm. To generalize the accuracy and applicability of our proposed RFR algorithm, we trained and tested it on a dataset of laboratory measurements of combustion aerosols. Input variables to the algorithm included the aerosol number size distribution from the Scanning Mobility Particle Sizer, absorption coefficients from the filter-based Tricolor Absorption Photometer, and scattering coefficients from a multiwavelength nephelometer. The RFR algorithm predicted Babs values within 5 % of the reference Babs measured by the multiwavelength PASS during the laboratory experiments. Thus, we show that machine learning approaches offer a promising path to correct for biases in long-term filter-based absorption datasets and accurately quantify their variability and trends needed for robust radiative forcing determination.

54 ENVIRONMENTAL SCIENCES↗

Multiplicity distributions in interaction models used for cascade simulations

In cascade simulations, conservation of energy is of paramount importance. It is pointed out that it is possible to construct algorithms in which energies of secondaries are chosen from physically correct distributions in such a way as to conserve energy, and give physically correct multiplicity distributions without further adjustment. The resulting non-Poissonian nature of the distribution and the approximate KNO scaling are related to the large fluctuations in the energy available for pion production and to the detailed shape of the inclusive momentum distribution. Two multiparticle production algorithms are described which have these features. One is the algorithm used in the simulation of C jets, the other is for a hadron-nucleus interaction model used in the calculation of muon and neutrino fluxes.

Ellsworth, R. W.↗

Verification of an energy-conserving semi-implicit electrostatic particle-in-cell scheme for modeling high-density plasma at scale

A verification study of a semi-implicit energy-conserving electrostatic particle-in-cell algorithm is presented. The algorithm relaxes the time-step and mesh-size constraints that require resolution of the plasma period and Debye length associated with traditional explicit momentum-conserving particle-in-cell algorithms. Physical implications and applicability of using the semi-implicit scheme for modeling high-density plasmas are discussed. Where possible, numerical results are compared against analytical solutions. The simulation results indicate that the algorithm is stable at time steps larger than twice the inverse plasma frequency and cell sizes larger than the Debye length. It is found that the algorithm gives adequate results, provided that the distribution function and the spatiotemporal scales dictating the physics of the problem are resolved. As such, the algorithm may provide a robust method for kinetic modeling of high-density plasmas at scale.

Cyclotron resonance↗

Context distribution estimation for contextual classification of multispectral image data

A classification algorithm incorporating contextual information in a general, statistical manner is presented. Methods are investigated for obtaining adequate estimates of the context distribution (a statistical characterization of context) upon which the classification algorithm depends. Finally, a method of estimating optimal algorithm parameters prior to performing preliminary classifications is explored.

Tilton, J. C.↗

Use of Probability Distribution Functions for Discriminating Between Cloud and Aerosol in Lidar Backscatter Data

In this paper we describe the algorithm hat will be used during the upcoming Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO) mission for discriminating between clouds and aerosols detected in two wavelength backscatter lidar profiles. We first analyze single-test and multiple-test classification approaches based on one-dimensional and multiple-dimensional probability density functions (PDFs) in the context of a two-class feature identification scheme. From these studies we derive an operational algorithm based on a set of 3-dimensional probability distribution functions characteristic of clouds and aerosols. A dataset acquired by the Cloud Physics Lidar (CPL) is used to test the algorithm. Comparisons are conducted between the CALIPSO algorithm results and the CPL data product. The results obtained show generally good agreement between the two methods. However, of a total of 228,264 layers analyzed, approximately 5.7% are classified as different types by the CALIPSO and CPL algorithm. This disparity is shown to be due largely to the misclassification of clouds as aerosols by the CPL algorithm. The use of 3-dimensional PDFs in the CALIPSO algorithm is found to significantly reduce this type of error. Dust presents a special case. Because the intrinsic scattering properties of dust layers can be very similar to those of clouds, additional algorithm testing was performed using an optically dense layer of Saharan dust measured during the Lidar In-space Technology Experiment (LITE). In general, the method is shown to distinguish reliably between dust layers and clouds. The relatively few erroneous classifications occurred most often in the LITE data, in those regions of the Saharan dust layer where the optical thickness was the highest.

Liu, Zhaoyan↗

Modeling and measurement of error propagation in a multimodule computing system

An error propagation model has been developed for multimodule computing systems in which the main parameters are the distribution functions of error propagation times. A digraph model is used to represent a multimodule computing system, and error propagation in the system is modeled by general distributions of error propagation times between all pairs of modules. Two algorithms are developed to compute systematically and efficiently the distributions of error propagation times. Experiments are also conducted to measure the distributions of error propagation times with the fault-tolerant microprocessor (FTMP). Statistical analysis of experimental data shows that the error propagation times in FTMP do not follow a well-known distribution, thus justifying the use of general distributions in the present model.

Shin, Kang G.↗

Qualitative Event-Based Diagnosis: Case Study on the Second International Diagnostic Competition

We describe a diagnosis algorithm entered into the Second International Diagnostic Competition. We focus on the first diagnostic problem of the industrial track of the competition in which a diagnosis algorithm must detect, isolate, and identify faults in an electrical power distribution testbed and provide corresponding recovery recommendations. The diagnosis algorithm embodies a model-based approach, centered around qualitative event-based fault isolation. Faults produce deviations in measured values from model-predicted values. The sequence of these deviations is matched to those predicted by the model in order to isolate faults. We augment this approach with model-based fault identification, which determines fault parameters and helps to further isolate faults. We describe the diagnosis approach, provide diagnosis results from running the algorithm on provided example scenarios, and discuss the issues faced, and lessons learned, from implementing the approach

Daigle, Matthew↗

Comparison of Visual and LiDAR SLAM Algorithms using NASA Flight Test Data

Simultaneous Localization and Mapping (SLAM) is a promising technique that provides localization information and precise mapping of the physical environment without having much prior knowledge of the surroundings. SLAM may have a vital role in aeronautics and aerospace, where vehicles and aircraft must operate in complex environments with traditional localization services that may be degraded or unavailable. This paper compares several pre-canned 3D SLAM algorithms based on vision and LiDAR, namely ORB-SLAM, ORB-SLAM2, LOAM, A-LOAM, and F-LOAM on NASA UAS (Unmanned Aircraft System) flight test data. The NASA ARC UAS flight test demonstrates preliminary SLAM algorithm results, which serve as a stepping stone to simulated AAM (Advanced Air Mobility) concepts. Conducting AFRC UAS flight test for simulated AAM approach and landing with SLAM algorithms provides an Alternative Precision Navigation and Timing solution based on distributed landmarks and fiducials in the landing zone. These algorithms use the telemetry data as ground truth for a baseline comparison. The criteria of the performance comparison include robustness, accuracy, re-localization, response to environmental changes, and real-time effectiveness, which are currently qualitative but to be quantitative in the future.

computer vision↗

Comparison of Visual and LiDAR SLAM Algorithms using NASA Flight Test Data

Simultaneous Localization and Mapping (SLAM) is a promising technique that provides localization information and precise mapping of the physical environment without having much prior knowledge of the surroundings. SLAM may have a vital role in aeronautics and aerospace, where vehicles and aircraft must operate in complex environments with traditional localization services that may be degraded or unavailable. This paper compares several pre-canned 3D SLAM algorithms based on vision and LiDAR, namely ORB-SLAM, ORB-SLAM2, LOAM, A-LOAM, and F-LOAM on NASA UAS (Unmanned Aircraft System) flight test data. The NASA ARC UAS flight test demonstrates preliminary SLAM algorithm results, which serve as a stepping stone to simulated AAM (Advanced Air Mobility) concepts. Conducting AFRC UAS flight test for simulated AAM approach and landing with SLAM algorithms provides an Alternative Precision Navigation and Timing solution based on distributed landmarks and fiducials in the landing zone. These algorithms use the telemetry data as ground truth for a baseline comparison. The criteria of the performance comparison include robustness, accuracy, re-localization, response to environmental changes, and real-time effectiveness, which are currently qualitative but to be quantitative in the future.

computer vision↗

An algorithm for resolving intragranular orientation fields using coupled far-field and near-field high energy $\mathrm{X}$-ray diffraction microscopy

Here, we present a novel algorithm for reconstructing spatial intragranular lattice orientation fields using both far-field and near-field high energy X-ray diffraction microscopy (HEDM) measurements. An established far-field indexing algorithm is modified to include lattice orientation distribution information (grain orientation envelopes) in addition to average grain orientations. The near-field data reduction algorithm utilizes this enriched far-field orientation data as a seed for reconstructing intragranular spatial maps of lattice orientation from the diffraction images. The primary benefit of the new algorithm is a significant decrease in the number of trial calculations that must be performed in the reconstruction process compared to existing methodologies while maintaining scalability. The resulting gains in efficiency facilitate the use of relatively modest computational resources and improve throughput at the point of measurement. We provide two example applications: volumetric orientation field reconstructions for a Ti-Al alloy both before and after the application of 3% uniaxial strain. The results showcase the efficiency of the new method and the ability to resolve subtle changes in microstructure, which are associated with incipient plastic deformation.

36 MATERIALS SCIENCE↗

Continuous Filament Network of the Local Universe

Simulated galaxy distributions are suitable for developing filament detection algorithms. However, samples of observed galaxies, being of limited size, cause difficulties that lead to a discontinuous distribution of filaments. We created a new galaxy filament catalog composed of a continuous cosmic web with no lone filaments. The core of our approach is a ridge filter used within the framework of image analysis. We considered galaxies from the HyperLeda database with redshifts 0.02 ≤ z ≤ 0.1, and in the solid angle 120° ≤ R.A. ≤ 240°, 0° ≤ decl. ≤ 60°. We divided the sample into 16 two-dimensional celestial projections with redshift bin Δ z = 0.005, and compared our continuous filament network with a similar recent catalog covering the same region of the sky. We tested our catalog on two application scenarios. First, we compared the distributions of the distances to the nearest filament of various astrophysical sources (Seyfert galaxies and other active galactic nuclei, radio galaxies, low-surface-brightness galaxies, and dwarf galaxies), and found that all source types trace the filaments well, with no systematic differences. Next, among the HyperLeda galaxies, we investigated the dependence of the g - r color distribution on the distance to the nearest filament, and confirmed that early-type galaxies are located on average further from the filaments than late-type ones.

79 ASTRONOMY AND ASTROPHYSICS↗