Search NASA⌕ Search

SEARCH · Search NASA

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 235 records · Page 13

Fault-Tolerant Decentralized Control for Large-Scale Inverter-Based Resources for Active Power Tracking

Integration of inverter-based resources (IBRs) which lack the intrinsic characteristics such as the inertial response of the traditional synchronous-generator (SG)-based sources presents a new challenge in the form of analyzing the grid stability under their presence. While the dynamic composition of IBRs differs from that of the SGs, the control objective remains similar in terms of tracking the desired active power. This letter presents a decentralized primal-dual-based fault-tolerant control framework for the power allocation in IBRs. Overall, a hierarchical control algorithm is developed with a lower level addressing the current control and the parameter estimation for the IBRs and the higher level acting as the reference power generator to the low level based on the desired active power profile. The decentralized network-based algorithm adaptively splits the desired power between the IBRs taking into consideration the health of the IBRs transmission lines. The proposed framework is tested through a simulation on the network of IBRs and the high-level controller performance is compared against the existing framework in the literature. The proposed algorithm shows significant performance improvement in the magnitude of power deviation and settling time to the nominal value under faulty conditions as compared to the algorithm in the literature.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Attack Identification and Correction for PMU GPS Spoofing in Unbalanced Distribution Systems

Due to the vulnerability of civilian global positioning system (GPS) signals, the accuracy of phasor measurement units (PMUs) can be greatly compromised by GPS spoofing attacks (GSAs), which introduce phase shifts into true phase angle measurements. Focusing on simultaneous GSAs for multiple PMU locations, this paper proposes a novel identification and correction algorithm in distribution systems. A sensitivity analysis of state estimation residuals on a single GSA phase angle is firstly implemented. An identification algorithm using a probing technique is proposed to determine the locations of spoofed PMUs and the ranges of GSA phase shifts. Based on the identification results, these GSA phase shifts are determined via an estimation algorithm that minimizes the mismatch between measurements and system states. Finally, with the attacked PMU data corrected, the system states are recovered. Simulations in unbalanced IEEE 34-bus and 123-bus distribution systems demonstrates the efficiency and accuracy of the proposed method.

97 MATHEMATICS AND COMPUTING↗

Hierarchical Management of Distributed Energy Resources Using Chance-Constrained OPF and Extremum Seeking Control: Preprint

Distributed energy resources (DERs) are becoming an important part of distribution systems because of their economic and environmental benefits. Although their inherent intermittency and volatility introduce uncertainties into the system, they have potential to provide controllability to the system under proper coordination. In this paper, we propose a hierarchical control algorithm for distribution systems with DERs so that they have controllability similar to that of a generator bus. The upper level scheduler solves a chance-constrained optimal power flow (OPF) problem to plan the operation of the DERs based on forecasts, and the lower level distributed DER controllers leverage the extremum seeking approach to deliver the planned power at the feeder head. The proposed algorithm is tested on a modified IEEE 13-node feeder, demonstrating its effectiveness.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Numerical Algorithm to Calculate the Pressure Distribution of the TPS Front End Due to Desorption Induced by Synchrotron Radiation

The pressure distribution is an important aspect of a UHV subsystem in either a storage ring or a front end. The design of the 3-GeV, 400-mA Taiwan Photon Source (TPS) foresees outgassing induced by photons and due to a bending magnet and an insertion device. An algorithm to calculate the photon-stimulated absorption (PSD) due to highly energetic radiation from a synchrotron source is presented. Several results using undulator sources such as IU20 are also presented, and the pressure distribution is illustrated.

43 PARTICLE ACCELERATORS↗

Hierarchical Management of Distributed Energy Resources Using Chance-Constrained OPF and Extremum Seeking Control

Distributed energy resources (DERs) are becoming an important part of distribution systems, because of their economic and environmental benefits. Although their inherent intermittency and volatility introduce uncertainties into the electric power system, they have the potential to provide controllability to the system under proper coordination. In this paper, we propose a hierarchical control algorithm for distribution systems with DERs so that they have controllability similar to a generator bus. The upper level scheduler solves a chance-constrained optimal power flow (OPF) problem to plan the operation of the DERs based on forecasts, and the lower level distributed DER controllers leverage the extremum seeking approach to deliver the planned power at the feeder head. The proposed algorithm is tested on a modified IEEE 13-node feeder, demonstrating its effectiveness.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Bayesian approach to real-time 3D tumor localization via monoscopic x-ray imaging during treatment delivery

Purpose: Monoscopic x-ray imaging with on-board kV devices is an attractive approach for real-time image guidance in modern radiation therapy such as VMAT or IMRT, but it falls short in providing reliable information along the direction of imaging x-ray. By effectively taking consideration of projection data at prior times and/or angles through a Bayesian formalism, the authors develop an algorithm for real-time and full 3D tumor localization with a single x-ray imager during treatment delivery. Methods: First, a prior probability density function is constructed using the 2D tumor locations on the projection images acquired during patient setup. Whenever an x-ray image is acquired during the treatment delivery, the corresponding 2D tumor location on the imager is used to update the likelihood function. The unresolved third dimension is obtained by maximizing the posterior probability distribution. The algorithm can also be used in a retrospective fashion when all the projection images during the treatment delivery are used for 3D localization purposes. The algorithm does not involve complex optimization of any model parameter and therefore can be used in a ''plug-and-play'' fashion. The authors validated the algorithm using (1) simulated 3D linear and elliptic motion and (2) 3D tumor motion trajectories of a lung and a pancreas patient reproduced by a physical phantom. Continuous kV images were acquired over a full gantry rotation with the Varian TrueBeam on-board imaging system. Three scenarios were considered: fluoroscopic setup, cone beam CT setup, and retrospective analysis. Results: For the simulation study, the RMS 3D localization error is 1.2 and 2.4 mm for the linear and elliptic motions, respectively. For the phantom experiments, the 3D localization error is < 1 mm on average and < 1.5 mm at 95th percentile in the lung and pancreas cases for all three scenarios. The difference in 3D localization error for different scenarios is small and is not statistically significant. Conclusions: The proposed algorithm eliminates the need for any population based model parameters in monoscopic image guided radiotherapy and allows accurate and real-time 3D tumor localization on current standard LINACs with a single x-ray imager.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Theoretical limit of spatial resolution in diffuse optical tomography using a perturbation model

We have assessed the limit of spatial resolution of timedomain diffuse optical tomography (DOT) based on a perturbation reconstruction model. From the viewpoint of the structure reconstruction accuracy, three different approaches to solving the inverse DOT problem are compared. The first approach involves reconstruction of diffuse tomograms from straight lines, the second – from average curvilinear trajectories of photons and the third – from total banana-shaped distributions of photon trajectories. In order to obtain estimates of resolution, we have derived analytical expressions for the point spread function and modulation transfer function, as well as have performed a numerical experiment on reconstruction of rectangular scattering objects with circular absorbing inhomogeneities. It is shown that in passing from reconstruction from straight lines to reconstruction using distributions of photon trajectories we can improve resolution by almost an order of magnitude and exceed the accuracy of reconstruction of multi-step algorithms used in DOT. (optical tomography)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fast and Accurate Support Vector Machines on Large Scale Systems

Support Vector Machines (SVM) is a supervised Machine Learning and Data Mining (MLDM) algorithm, which has become ubiquitous largely due to its high accuracy and obliviousness to dimensionality. The objective of SVM is to find an optimal boundary --- also known as hyperplane --- which separates the samples (examples in a dataset) of different classes by a maximum margin. Usually, very few samples contribute to the definition of the boundary. However, existing parallel algorithms use the entire dataset for finding the boundary, which is sub-optimal for performance reasons. In this paper, we propose a novel distributed memory algorithm to eliminate the samples which do not contribute to the boundary definition in SVM. We propose several heuristics, which range from early (aggressive) to late (conservative) elimination of the samples, such that the overall time for generating the boundary is reduced considerably. In a few cases, a sample may be eliminated (shrunk) pre-emptively --- potentially resulting in an incorrect boundary. We propose a scalable approach to synchronize the necessary data structures such that the proposed algorithm maintains its accuracy. We consider the necessary trade-offs of single/multiple synchronization using in-depth time-space complexity analysis. We implement the proposed algorithm using MPI and compare it with libsvm--- de facto sequential SVM software --- which we enhance with OpenMP for multi-core/many-core parallelism. Our proposed approach shows excellent efficiency using up to 4096 processes on several large datasets such as UCI HIGGS Boson dataset and Offending URL dataset.

Vishnu, Abhinav↗

Hierarchical Clock Synchronization in MPI

We present a new distributed community detection algorithm for large graphs based on the Louvain method. We exploit a distributed delegate partitioning to ensure the workload and communication balancing among processors. In addition, we design a new heuristic strategy to carefully coordinate the community constitution in a distributed environment, and ensure the convergence of the distributed clustering algorithm. Our intensive experimental study has demonstrated the scalability and the correctness of our algorithm with various large-scale real-world and synthetic graph datasets using up to 32,768 processors

Computer Science↗

SU-E-T-520: Four-Dimensional Dose Calculation Algorithm Considering Variations in Dose Distribution Induced by Sinusoidal One-Dimensional Motion Patterns

Purpose: To investigate quantitatively the variations in dose-distributions induced by motion by measurements and modeling. A four-dimensional (4D) motion model of dose distributions that accounts for different motion parameters was developed. Methods: Variations in dose distributions induced by sinusoidal phantom motion were measured using a multiple-diode-array-detector (MapCheck2). MapCheck2 was mounted on a mobile platform that moves with adjustable calibrated motion patterns in the superior-inferior direction. Various plans including open and intensity-modulated fields were used to irradiate MapCheck2. A motion model was developed to predict spatial and temporal variations in the dose-distributions and dependence on the motion parameters using pencil-beam spread-out superposition function. This model used the superposition of pencil-beams weighted with a probability function extracted from the motion trajectory. The model was verified with measured dose-distributions obtained from MapCheck2. Results: Dose-distribution varied considerably with motion where in the regions between isocenter and 50% isodose-line, dose decreased with increase of the motion amplitude. Dose levels increased with increase in the motion amplitude in the region beyond 50% isodose-line. When the range of motion (ROM=twice amplitude) was smaller than the field length both central axis dose and the 50% isodose-line did not change with variation of motion amplitude and remained equal to the dose of stationary phantom. As ROM became larger than the field length, the dose level decreased at central axis dose and 50% isodose-line. Motion frequency and phase did not affect the dose distributions which were delivered over an extended time longer than few motion cycles, however, they played an important role for doses delivered with high-dose-rates within one motion cycle . Conclusion: A 4D-dose motion model was developed to predict and correct variations in dose distributions induced by one-dimensional sinusoidal motion. This model was verified with measured dose-distributions and can be expanded to consider complicated patient motion patterns.

07 ISOTOPE AND RADIATION SOURCES↗

Genetic-algorithm retrieval of the molecular alignment distribution with high-order harmonics generated from transiently aligned CO 2 molecules

Using genetic algorithm, we propose a method to retrieve the alignment distribution of transiently aligned CO 2 molecules from the high-order harmonic generation (HHG) spectra. The retrieval method is based on the quantitative rescattering (QRS) model where averaged photorecombination transition dipole can be factored out from the parallel (or perpendicular) harmonic spectra after the propagation of the harmonic fields in the gas medium. We examine how the retrieved alignment distributions are affected by uncertainty in alignment dependent ionization probability and on multiple orbital contribution to the HHG. We further confirm that alignment distribution is more accurately retrieved by using the minima in the HHG spectra driven by a long-wavelength laser. In addition, we show that earlier experimental data on the ratios between the perpendicular and the parallel HHG components of aligned CO 2 molecules are in better agreement with the QRS model if the macroscopic propagation and multiple orbital interference are included in the theoretical calculation.

74 ATOMIC AND MOLECULAR PHYSICS↗

A novel multi-model neuro-fuzzy-based MPPT for three-phase grid-connected photovoltaic system

This paper presents a novel methodology for Maximum Power Point Tracking (MPPT) of a grid-connected 20 kW photovoltaic (PV) system using neuro-fuzzy network. The proposed method predicts the reference PV voltage guarantying optimal power transfer between the PV generator and the main utility grid. The neuro-fuzzy network is composed of a fuzzy rule-based classifier and three multi-layered feed forwarded Artificial Neural Networks (ANN). Inputs of the network (irradiance and temperature) are classified before they are fed into the appropriated ANN for either training or estimation process while the output is the reference voltage. The main advantage of the proposed methodology, comparing to a conventional single neural network-based approach, is the distinct generalization ability regarding to the nonlinear and dynamic behavior of a PV generator. In fact, the neuro-fuzzy network is a neural network based multi-model machine learning that defines a set of local models emulating the complex and nonlinear behavior of a PV generator under a wide range of operating conditions. Simulation results under several rapid irradiance variations proved that the proposed MPPT method fulfilled the highest efficiency comparing to a conventional single neural network and the Perturb and Observe (P and O) algorithm dispositive. (author)

14 SOLAR ENERGY↗

Detailed End Use Load Modeling for Distribution System Analysis

The field of distribution system analysis has made significant advances in the past ten years. It is now standard practice when performing a power flow simulation to use an algorithm that is capable of unbalanced per-phase analysis. Recent work has also focused on examining the need for time-series simulations instead of examining a single time period, i.e., peak loading. One area that still requires a significant amount of work is the proper modeling of end use loads. Currently it is common practice to use a simple load model consisting of a combination of constant power, constant impedance, and constant current elements. While this simple form of end use load modeling is sufficient for a single point in time, the exact model values are difficult to determine and it is inadequate for some time-series simulations. This paper will examine how to improve simple time invariant load models as well as develop multi-state time variant models.

99 GENERAL AND MISCELLANEOUS↗

Reliable algorithms for power system analysis in the presence of data uncertainties

A robust and reliable power flow analysis represents an essential requirement for many power systems applications as far as network optimization, voltage control, state estimation, and service restoration are concerned. The most common power flow approach, referred to here as a deterministic power flow (PLF), requires precise or 'crisp' values chosen by the analyst for each input variable. The solution provides precise network voltages and flows through each line. The specified values rest upon assumptions about the operating condition derived from historical measurements or predictions about future conditions and thus, cannot be considered accurate. Even in the case where the inputs are based on measurements, inaccuracies arise from time-skew problems, three-phase unbalance, static modeling approximations of dynamic components (e.g., transformer tap changers), variations in line parameters, and so on. The advent of deregulation and competitive power markets will only exacerbate this problem as well-known generation patterns change, loading becomes less predictable and the transmission paths grow more diverse. Conventional methodologies proposed in literature address tolerance analysis of power flow solution by means of detailed probabilistic methods, accounting for the variability and stochastic nature of the input data, and sampling based approaches. In particular uncertainty propagation using sampling based methods, such as the Monte Carlo, requires several model runs that sample various combinations of input values. Since the number of model runs can sometimes be very large, the required computer resources can sometimes be prohibitively expensive resulting in substantial computational demands. As far as probabilistic methods are concerned, they represent a useful tool, especially for planning studies, but, as evidenced by the many discussions reported in literature, they could reveal some shortcomings principally arising from: (1) the non-normal distribution and the statistical dependence of the input data; and (2) the difficulty arising in accurately identifying probability distributions for some input data, such as the power generated by wind or photovoltaic generators. All these could result in time consuming computations with several limitations in practical applications especially in power flow analysis of complex power networks. In order to try and overcome some of these limitations, obtaining thereby comprehensive power flow solution tolerance analysis at adequate computational costs, self validated computation could play a crucial role. Armed with such a vision, this chapter will analyze two advanced techniques for power flow analysis in the presence of data uncertainty namely the boundary power flow and the affine arithmetic power flow.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly

One of the most computationally intensive tasks in computational biology is de novo genome assembly, the decoding of the sequence of an unknown genome from redundant and erroneous short sequences. A common assembly paradigm identifies overlapping sequences, simplifies their layout, and creates consensus. Despite many algorithms developed in the literature, the efficient assembly of large genomes is still an open problem. In this work, we introduce new distributed-memory parallel algorithms for overlap detection and layout simplification steps of de novo genome assembly, and implement them in the diBELLA 2D pipeline. Our distributed memory algorithms for both overlap detection and layout simplification are based on linear-algebra operations over semirings using 2D distributed sparse matrices. Our layout step consists of performing a transitive reduction from the overlap graph to a string graph. We provide a detailed communication analysis of the main stages of our new algorithms. diBELLA 2D achieves near linear scaling with over 80% parallel efficiency for the human genome, reducing the runtime for overlap detection by 1.2-1.3× for the human genome and 1.5-1.9× for C.elegans compared to the state-of-the-art. Our transitive reduction algorithm outperforms an existing distributed-memory implementation by 10.5-13.3× for the human genome and 18-29× for the C. elegans. Our work paves the way for efficient de novo assembly of large genomes using long reads in distributed memory.

59 BASIC BIOLOGICAL SCIENCES↗

Probabilistic Look-ahead Contingency Analysis Integrated with GE EMS Tool

This report documents implementation of the smart sampling-based probabilistic look-ahead contingency analysis algorithm, the integration with General Electric (GE) Grid Solutions’ commercial energy management system (EMS) tool, and the case study results using real world data from the Bonneville Power Administration (BPA).The probabilistic look-ahead contingency analysis algorithm incorporates forecast errors of renewable energy and load into contingency analysis functions to enable a predictive capability with a more complete picture, revealing the potential violations that are not normally detected by traditional deterministic approaches. To test its performance under practical environments, the probabilistic look-ahead contingency analysis algorithm has been integrated with the dominant GE EMS tool as a proof-of-concept for a seamless integration. To meet the output format of GE EMS tool, an extreme value distribution (EVD) algorithm is newly adapted to analyze the GE EMS’s violation-only output. Real world data from BPA are used to test its performance, and the results clearly show the effectiveness of the developed algorithm and improved situational awareness. This effort is an example of successful technology transition and cooperation under a real-world environment because it is a joint effort from department of energy, a national laboratory, a commercial vendor, and a large utility.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributed Tomographic Reconstruction with Quantization

Conventional tomographic reconstruction typically depends on centralized servers for both data storage and computation, leading to concerns about memory limitations and data privacy. Distributed reconstruction algorithms mitigate these issues by partitioning data across multiple nodes, reducing server load and enhancing privacy. However, these algorithms often encounter challenges related to memory constraints and communication overhead between nodes. In this paper, we introduce a decentralized Alternating Directions Method of Multipliers (ADMM) with configurable quantization. By distributing local objectives across nodes, our approach is highly scalable and can efficiently reconstruct images while adapting to available resources. To overcome communication bottlenecks, we propose two quantization techniques based on K-means clustering and JPEG compression. Numerical experiments with benchmark images illustrate the tradeoffs between communication efficiency, memory use, and reconstruction accuracy.

Miao, Runxuan↗

Families of Graph Algorithms: SSSP Case Study

Single-Source Shortest Paths (SSSP) is a well-studied graph problem. Examples of SSSP algorithms include the original Dijkstra’s algorithm and the parallel Δ-stepping and KLA-SSSP algorithms. In this paper, we use a novel Abstract Graph Machine (AGM) model to show that all these algorithms share a common logic and differ from one another by the order in which they perform work. We use the AGM model to thoroughly analyze the family of algorithms that arises from the common logic. We start with the basic algorithm without any ordering (Chaotic), and then we derive the existing and new algorithms by methodically exploring semantic and spatial ordering of work. Our experimental results show that new derived algorithms show better performance than the existing distributed memory parallel algorithms, especially at higher scales.

distributed-memory graph algorithms↗