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 1,333 records · Page 74

SU-E-T-144: Bayesian Inference of Local Relapse Data Using a Poisson-Based Tumour Control Probability Model

Purpose: The purpose of this project is to develop a robust method of parameter estimation for a Poisson-based TCP model using Bayesian inference. Methods: Bayesian inference was performed using the PyMC3 probabilistic programming framework written in Python. A Poisson-based TCP regression model that accounts for clonogen proliferation was fit to observed rates of local relapse as a function of equivalent dose in 2 Gy fractions for a population of 623 stage-I non-small-cell lung cancer patients. The Slice Markov Chain Monte Carlo sampling algorithm was used to sample the posterior distributions, and was initiated using the maximum of the posterior distributions found by optimization. The calculation of TCP with each sample step required integration over the free parameter α, which was performed using an adaptive 24-point Gauss-Legendre quadrature. Convergence was verified via inspection of the trace plot and posterior distribution for each of the fit parameters, as well as with comparisons of the most probable parameter values with their respective maximum likelihood estimates. Results: Posterior distributions for α, the standard deviation of α (σ), the average tumour cell-doubling time (Td), and the repopulation delay time (Tk), were generated assuming α/β = 10 Gy, and a fixed clonogen density of 10{sup 7} cm−{sup 3}. Posterior predictive plots generated from samples from these posterior distributions are in excellent agreement with the observed rates of local relapse used in the Bayesian inference. The most probable values of the model parameters also agree well with maximum likelihood estimates. Conclusion: A robust method of performing Bayesian inference of TCP data using a complex TCP model has been established.

60 APPLIED LIFE SCIENCES↗

Scalable in-memory RDFS closure on billions of triples.

We present an RDFS closure algorithm, specifically designed and implemented on the Cray XMT supercomputer, that obtains inference rates of 13 million inferences per second on the largest system configuration we used. The Cray XMT, with its large global memory (4TB for our experiments), permits the construction of a conceptually straightforward algorithm, fundamentally a series of operations on a shared hash table. Each thread is given a partition of triple data to process, a dedicated copy of the ontology to apply to the data, and a reference to the hash table into which it inserts inferred triples. The global nature of the hash table allows the algorithm to avoid a common obstacle for distributed memory machines: the creation of duplicate triples. On LUBM data sets ranging between 1.3 billion and 5.3 billion triples, we obtain nearly linear speedup except for two portions: file I/O, which can be ameliorated with the additional service nodes, and data structure initialization, which requires nearly constant time for runs involving 32 processors or more.

99 GENERAL AND MISCELLANEOUS↗

AveBoost2: Boosting for Noisy Data

AdaBoost is a well-known ensemble learning algorithm that constructs its constituent or base models in sequence. A key step in AdaBoost is constructing a distribution over the training examples to create each base model. This distribution, represented as a vector, is constructed to be orthogonal to the vector of mistakes made by the pre- vious base model in the sequence. The idea is to make the next base model's errors uncorrelated with those of the previous model. In previous work, we developed an algorithm, AveBoost, that constructed distributions orthogonal to the mistake vectors of all the previous models, and then averaged them to create the next base model s distribution. Our experiments demonstrated the superior accuracy of our approach. In this paper, we slightly revise our algorithm to allow us to obtain non-trivial theoretical results: bounds on the training error and generalization error (difference between training and test error). Our averaging process has a regularizing effect which, as expected, leads us to a worse training error bound for our algorithm than for AdaBoost but a superior generalization error bound. For this paper, we experimented with the data that we used in both as originally supplied and with added label noise-a small fraction of the data has its original label changed. Noisy data are notoriously difficult for AdaBoost to learn. Our algorithm's performance improvement over AdaBoost is even greater on the noisy data than the original data.

Oza, Nikunj C.↗

Conceptual Design of a Counter-Rotating Fan System for Distributed Boundary Layer Ingesting Propulsion

The present paper details the design of the counter rotating fans for a Turboelectric Distributed Propulsion (TeDP) system. Sixteen propulsors installed in mail-slot-shape nacelles are embedded on an aerodynamically optimized hybrid wing-body configuration. The hybrid-wing/body (HWB) configuration which was previously designed to satisfy the conditions of trim, longitudinally static stability and specific cargo space is employed as the baseline configuration in pursuing an optimal distributed propulsion system. A set of distributed propulsors is conceptually designed and the collective performance is evaluated against the target thrust mandated by the mission requirements. The concept of the distributed propulsion allows the fan pressure ratio to be around 1.27~1.32 for the target thrust. In addition, further splitting of the fan pressure ratio by using the counter-rotating fans for each slot realizes the target pressure ratio with low tip speed. In the distributed propulsion system, the nature of the flow conditions and/or the thickness of the ingested boundary layer may differ and result in different propulsive reaction of each individual propulsor. The optimization is, thus, approached from both the propulsion system and individual propulsor perspectives. An optimal distribution of the thrust and power output is determined by how the system utilizes each passage's propulsive characteristics and its interaction with the airframe. These system level analysis and optimization are conducted using an actuator disk model to account for the propulsion-airframe integration numerically. With respect to the propulsor level, aerodynamic shape optimizations of the fan blades are performed in a sequential multi-objective optimization process for various design objectives, such as mass flow rate condition, fan pressure ratio, efficiency and the exit flow angle of the fan stage by using a genetic algorithm, NSGA-II. The radial chord distribution, and meanline distribution of the rotors are designed on the circumferentially averaged axi-symmetric inlet profiles and tested on the six inlet profiles from six divided sectors to reckon flow distortion. The performances of the counter rotating fans are, thus, evaluated accordingly for obtaining distortion tolerant fan. The performance of the distributed propulsion system is evaluated by two CFD tools, i.e., a multi-stage turbo-machinery CFD code and one propulsion-airframe integration flow solver coupled with a body-force model. The optimized boundary layer ingestion propulsion system of 16 distributed slots not only reaches the system target thrust, but also delivers a close to 20% fuel saving benefit against its counterpart 12 distributed clean inlet propulsion system.

Boundary-Layer-Ingestion Propulsion↗

Distributed Disdrometer and Rain Gauge Measurement Infrastructure Developed for GPM Ground Validation

Global Precipitation Mission (GPM)retrieval algorithm validation requires datasets characterizing the 4-D structure, variability, and correlation properties of hydrometeor particle size distributions (PSD) and accumulations over satellite fields of view (FOV;<10 km). Collection of this data provides a means to assess retrieval errors related to beam filling and algorithm PSD assumptions. Hence, GPM Ground Validation is developing a deployable network of precipitation gauges and disdrometers to provide fine-scale measurements of PSD and precipitation accumulation variability. These observations will be combined with dual-frequency, polarimetric, and profiling radar data in a bootstrapping fashion to extend validated PSD measurements to a large coverage domain. Accordingly, a total of 24 Parsivel disdrometers(PD), 5 3rd-generation 2D Video Disdrometers (2DVD), 70 tipping bucket rain gauges (TBRG),9 weighing gauges, 7 Hot-Plate precipitation sensors (HP), and 3 Micro Rain Radars (MRR) have been procured. In liquid precipitation the suite of TBRG, PD and 2DVD instruments will quantify a broad spectrum of rain rate and PSD variability at sub-kilometer scales. In the envisioned network configuration 5 2DVDs will act as reference points for 16 collocated PD and TBRG measurements. We find that PD measurements provide similar measures of the rain PSD as observed with collocated 2DVDs (e.g., D0, Nw) for rain rates less than 15 mm/hr. For heavier rain rates we will rely on 2DVDs for PSD information. For snowfall we will combine point-redundant observations of SWER distributed over three or more locations within a FOV. Each location will contain at least one fenced weighing gauge, one HP, two PDs, and a 2DVD. MRRs will also be located at each site to extend the measurement to the column. By collecting SWER measurements using different instrument types that employ different measurement techniques our objective is to separate measurement uncertainty from natural variability in SWER and PSD. As demonstrated using C3VP polarimetric radar, gauge, and 2DVD/PD datasets these measurements can be combined to bootstrap an area wide SWER estimate via constrained modification of density-diameter and radar reflectivity-snowfall relationships. These data will be combined with snowpack, airborne microphysics, radar, radiometer, and tropospheric sounding data to refine GPM snowfall retrievals. The gauge and disdrometer instruments are being developed to operate autonomously when necessary using solar power and wireless communications. These systems will be deployed in numerous field campaigns through 2016. Planned deployment of these systems include field campaigns in Finland (2010), Oklahoma (2011), Canada (2012) and North Carolina (2013). GPM will also deploy 20 pairs of TBRGs within a 25 km2 region along the Virginia coast under NASA NPOL radar coverage in order to quantify errors in point-area rainfall measurements.

Petersen, Walter A.↗

Multiscale hysteresis threshold detection algorithm for a small infrared target in a complex background

In the infrared small target detection, the clutter formed by buildings, trees and protruding clouds is densely distributed and difficult to filter out. The hysteresis threshold detection algorithm utilizes the geometric features of small target to reduce false alarms. Images are filtered in multiple scales, the location and scale of the points of interest are extracted by non-maximum suppression. To determine the connection state of the focus and clutter, local gradient second-order origin moment is proposed to eliminate strong edges. The hysteresis threshold segmentation is performed to exclude stubborn false alarms and detect small targets. Experiments show that the proposed algorithm has a significant effect in removing false alarms, and achieves both the high detection probability and low false alarm probability.

42 ENGINEERING↗

Stochastic Filtering of Rain Profiles Using Radar, Surface-Referenced Radar, or Combined Radar-Radiometer Measurements

This paper describes a computationally efficient nearly optimal Bayesian algorithm to estimate rain (and drop size distribution) profiles, given a radar reflectivity profile at a single attenuating wavelength. In addition to estimating the averages of all the mutually ambiguous combinations of rain parameters that can produce the data observed, the approach also calculates the n-ns uncertainty in its estimates (this uncertainty thus quantifies "the amount of ambiguity" in the "solution"). The paper also describes a more general approach that can make estimates based on a radar reflectivity profile together with an approximate measurement of the path-integrated attenuation, or a radar reflectivity profile and a set of passive microwave brightness temperatures. This more general "combined" algorithm is currently being adapted for the Tropical Rainfall Measuring Mission.

Haddad, Ziad S.↗

Risk-Informed Condition Evaluation of Solar-centered Energy Generation and Distribution Networks through Bayesian Learning and Inference

We develop a methodology based on Bayesian inference over Probabilistic Graphical Models (PGMs) to understand and quantify risk in solar-centered grids using targeted measurements and learned system behavior. Being non-prescriptive but, rather, able to infer system behavior and, ultimately, address risk queries from data, our machine learning-type paradigm is tailored for diverse topologies and threat scenarios often associated with distributed energy generation and photovoltaic distributed energy resources (PV-DERs) in particular. We describe algorithmic processes for: (i) learning the structure of PGMs that result from attack-prone PV-DER-proliferated distribution systems, (ii) quantifying cause-effect relationships, and (iii) evaluating risk queries based on diverse evidence. The contributions are illustrated on a residential grid subject to output impairment attacks on its PV-DER infrastructure.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimizing Fast Charging and Wetting in Lithium-Ion Batteries with Optimal Microstructure Patterns Identified by Genetic Algorithm

To sustain the high-rate current required for fast charging electric vehicle batteries, electrodes must exhibit sufficiently high effective ionic diffusion. Additionally, to reduce battery manufacturing costs, wetting time must decrease. Both of these issues can be addressed by structuring the electrodes with mesoscale pore channels. However, their optimal spatial distribution, or patterns, is unknown. Herein, a genetic algorithm has been developed to identify these optimal patterns using a CPU-cheap proxy distance-based model to evaluate the impact of the added pore networks. Both coin-cell and pouch cell form factors have been considered for the wetting analysis, with their respective electrolyte infiltration mode. Regular hexagonal and mud-crack-like patterns, respectively, for fast charging and fast wetting were found to be optimal and have been compared with pre-determined, easier to manufacture, patterns. The model predicts that using cylindrical channels arranged in a regular hexagonal pattern is ∼6.25 times more efficient for fast charging as compared to grooved lines with both structuring strategies being restricted to a 5% electrode total volume loss. The model also shows that only a very limited electrode volume loss (1%–2%) is required to dramatically improve the wetting (5–20 times) compared to an unstructured electrode.

25 ENERGY STORAGE↗

Trust-Based Detection and Mitigation of Cyber Attacks in Distributed Cooperative Control of Islanded AC Microgrids

In this study, we address the challenge of detecting and mitigating cyber attacks in the distributed cooperative control of islanded AC microgrids, with a particular focus on detecting False Data Injection Attacks (FDIAs), a significant threat to the Smart Grid (SG). The SG integrates traditional power systems with communication networks, creating a complex system with numerous vulnerable links, making it a prime target for cyber attacks. These attacks can lead to the disclosure of private data, control network failures, and even blackouts. Unlike machine learning-based approaches that require extensive datasets and mathematical models dependent on accurate system modeling, our method is free from such dependencies. To enhance the microgrid’s resilience against these threats, we propose a resilient control algorithm by introducing a novel trustworthiness parameter into the traditional cooperative control algorithm. Our method evaluates the trustworthiness of distributed energy resources (DERs) based on their voltage measurements and exchanged information, using Kullback-Leibler (KL) divergence to dynamically adjust control actions. We validated our approach through simulations on both the IEEE-34 bus feeder system with eight DERs and a larger microgrid with twenty-two DERs. The results demonstrated a detection accuracy of around 100%, with millisecond range mitigation time, ensuring rapid system recovery. Additionally, our method improved system stability by up to almost 100% under attack scenarios, showcasing its effectiveness in promptly detecting attacks and maintaining system resilience. These findings highlight the potential of our approach to enhance the security and stability of microgrid systems in the face of cyber threats.

Computer Science↗

Listing triangles in expected linear time on a class of power law graphs.

Enumerating triangles (3-cycles) in graphs is a kernel operation for social network analysis. For example, many community detection methods depend upon finding common neighbors of two related entities. We consider Cohen's simple and elegant solution for listing triangles: give each node a 'bucket.' Place each edge into the bucket of its endpoint of lowest degree, breaking ties consistently. Each node then checks each pair of edges in its bucket, testing for the adjacency that would complete that triangle. Cohen presents an informal argument that his algorithm should run well on real graphs. We formalize this argument by providing an analysis for the expected running time on a class of random graphs, including power law graphs. We consider a rigorously defined method for generating a random simple graph, the erased configuration model (ECM). In the ECM each node draws a degree independently from a marginal degree distribution, endpoints pair randomly, and we erase self loops and multiedges. If the marginal degree distribution has a finite second moment, it follows immediately that Cohen's algorithm runs in expected linear time. Furthermore, it can still run in expected linear time even when the degree distribution has such a heavy tail that the second moment is not finite. We prove that Cohen's algorithm runs in expected linear time when the marginal degree distribution has finite 4/3 moment and no vertex has degree larger than {radical}n. In fact we give the precise asymptotic value of the expected number of edge pairs per bucket. A finite 4/3 moment is required; if it is unbounded, then so is the number of pairs. The marginal degree distribution of a power law graph has bounded 4/3 moment when its exponent {alpha} is more than 7/3. Thus for this class of power law graphs, with degree at most {radical}n, Cohen's algorithm runs in expected linear time. This is precisely the value of {alpha} for which the clustering coefficient tends to zero asymptotically, and it is in the range that is relevant for the degree distribution of the World-Wide Web.

99 GENERAL AND MISCELLANEOUS↗

Microgrid Service Restoration Incorporating Unmonitored Automatic Voltage Controllers and Net Metered Loads

Islanded microgrids may experience voltage and frequency instability due to uncontrolled state changes of voltage regulation devices and inaccurate demand forecasts. Uncontrolled state changes can occur if optimal microgrid restoration and dispatch algorithms, used for generating control commands for distributed energy resources, do not incorporate the behavior of automatic controllers of voltage regulation devices. Inaccurate demand forecasts may be encountered since post-outage demand of behind-the-meter net metered (NM) loads can vary significantly from their historical NM profiles. Here, this paper proposes an optimization formulation which allows optimal control of voltage regulators and capacitor banks without remote control and communication capabilities. A generalized demand model for NM loads is proposed which incorporates the cold load pickup phenomenon and their time varying post-outage demand in accordance with the IEEE 1547 standard. The time dependent optimal control formulation and the NM demand model are integrated in a sequential microgrid restoration algorithm by linearization of the involved logic propositions. A detailed case study on the unbalanced IEEE 123-node test system in OpenDSS validates the effectiveness of the proposed approach.

30 DIRECT ENERGY CONVERSION↗

Separating Peaks in X-Ray Spectra

Deconvolution algorithm assists in analysis of x-ray spectra from scanning electron microscopes, electron microprobe analyzers, x-ray fluorescence spectrometers, and like. New algorithm automatically deconvolves x-ray spectrum, identifies locations of spectral peaks, and selects chemical elements most likely producing peaks. Technique based on similarities between zero- and second-order terms of Taylor-series expansions of Gaussian distribution and of damped sinusoid. Principal advantage of algorithm: no requirement to adjust weighting factors or other parameters when analyzing general x-ray spectra.

Nicolas, David↗

Agent-Based Coordination Scheme for PV Integration (ABC4PV)

Renewables and especially photovoltaics (PV) have benefitted significantly from a host of incentives and policies targeted toward enhanced integration and adoption of specific energy technologies. However, with the push to move forward into a subsidy-free market framework, behind-the-meter residential PV applications have generally struggled to retain their value (unlike utility scale and commercial projects) [1]. This project focused on developing control-theoretic solutions aimed at improving the integration and interaction of behind-the-meter residential PV with other distribution system assets (controllable and non-controllable) to enhance the integrated value of residential PV. To this end, a suite of decentralized control methodologies have been developed to enable effective coordination and control of behind-the-meter residential load customers’ PV, battery storage systems (BSS), controllable loads and other similar assets within a distribution feeder. This interaction aims at procuring energy savings and, thus, energy bill savings. The main source of savings is drawn from reducing the effect of demand charge pricing and is realized at the feeder level, assuming community level interaction and management among the aforementioned assets. Optimal control of the assets is implemented with a distributed optimization methodology, leveraging consensus-based algorithms. The results gathered from the optimal control simulations demonstrates that the savings can be duly achieved and the algorithm decision times (to dynamically control asset set points, for example) are fast. As for the overall efficiency of PV+BSS systems, to procure energy savings from curtailment of the demand charge pricing effects, the optimal control is set up so as to minimize the variance of the load for all customers, throughout a feeder and throughout time in a rolling horizon scheduling with model predictive control. The control takes into account inter-temporal electrochemical storage (battery) degradation costs: specifically, we have developed a long-term lifetime model for the BSS that weighs in the effect of the degradation factor in the dispatch formulations, thus, a considerable operating cost that affects energy decision making. The levelized cost of energy (LCOE – redefined for the purpose of quantifying asset integration effectiveness through the customers’ energy cost) is shown to be below the threshold set for the combined PV+BSS topology of $ 0.14/kWh for multiple cases of PV penetration all the way up to 50%, provided that a policy of shared ownership of and savings is in place. Further, the LCOE calculated for the case before the deployment PV+BSS systems is also achievable, i.e. the deployment of PV+BSS, if planned and scheduled optimally. will have no effect on customers’ energy costs. From the control methodology viewpoint, the developed consensus-based algorithms are shown to converge for a wide range of problem cases (spanning normal operating scenarios and contingencies), guaranteeing dispatch solutions under forecasting errors, communication break-downs and cyber-security attacks. The proposed control solutions are scalable and real-time implementable, with dispatch computations and device set-point updates converging in less than 2s in most practical instances of the above events.

14 SOLAR ENERGY↗

Identifying high-redshift gamma-ray bursts with RATIR

We present a template-fitting algorithm for determining photometric redshifts, z {sub phot}, of candidate high-redshift gamma-ray bursts (GRBs). Using afterglow photometry, obtained by the Reionization and Transients InfraRed (RATIR) camera, this algorithm accounts for the intrinsic GRB afterglow spectral energy distribution, host dust extinction, and the effect of neutral hydrogen (local and cosmological) along the line of sight. We present the results obtained by this algorithm and the RATIR photometry of GRB 130606A, finding a range of best-fit solutions, 5.6 < z {sub phot} < 6.0, for models of several host dust extinction laws (none, the Milky Way, Large Magellanic Clouds, and Small Magellanic Clouds), consistent with spectroscopic measurements of the redshift of this GRB. Using simulated RATIR photometry, we find that our algorithm provides precise measures of z {sub phot} in the ranges of 4 < z {sub phot} ≲ 8 and 9 < z {sub phot} < 10 and can robustly determine when z {sub phot} > 4. Further testing highlights the required caution in cases of highly dust-extincted host galaxies. These tests also show that our algorithm does not erroneously find z {sub phot} < 4 when z {sub sim} > 4, thereby minimizing false negatives and allowing us to rapidly identify all potential high-redshift events.

79 ASTRONOMY AND ASTROPHYSICS↗

Distributed Solution Approach for a Stackelberg Pricing Game of Aggregated Demand Response

Demand-side management is a fundamental up-to-date strategy that transforms the traditional power grid to a modern smart grid where the flexible pricing mechanisms play a critical role in its successful implementation. In this paper, the pricing-demand response between a distribution system operator (DSO) and load aggregators (LAs) is modeled as a Stackelberg game, where the DSO is the price maker that adjusts its strategy based on observed responses from LAs. With the concerns of computational cost and privacy protection, two distributed solution approaches, particle swarm optimization and pattern search algorithm, are conducted and compared with the classical centralized backward induction approach. Numerical results on a small case study demonstrate the effectiveness of the proposed distributed solution approaches in leveraging flexible demand response potential.

Chen, Yang↗

Network, system, and status software enhancements for the autonomously managed electrical power system breadboard. Volume 2: Protocol specification

This volume (2 of 4) contains the specification, structured flow charts, and code listing for the protocol. The purpose of an autonomous power system on a spacecraft is to relieve humans from having to continuously monitor and control the generation, storage, and distribution of power in the craft. This implies that algorithms will have been developed to monitor and control the power system. The power system will contain computers on which the algorithms run. There should be one control computer system that makes the high level decisions and sends commands to and receive data from the other distributed computers. This will require a communications network and an efficient protocol by which the computers will communicate. One of the major requirements on the protocol is that it be real time because of the need to control the power elements.

Mckee, James W.↗