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,549 records · Page 86

Entrainment and aerosol effects on marine boundary-layer clouds: An investigation using ACE-ENA data from HOLODEC, G1, Pico and ACTOS (Final Report on Project Activities)

Marine boundary-layer clouds cover large regions of the globe and are known to strongly influence radiative balances. The microphysical properties and persistence of these clouds are tightly coupled with cloud-top entrainment and aerosol properties within both the boundary layer and the overlying free troposphere. This work addressed the microphysical response to entrainment and aerosol properties in marine stratocumulus clouds, using data from the Aerosol and Cloud Experiments in the Eastern North Atlantic (ACE-ENA) project. Specifically, emphasis was placed on 1. extensive in situ measurements taken with the Atmospheric Radiation Measurement (ARM) G1 aircraft using the Holographic Detector for Clouds (Holodec) instrument; 2. airborne measurements obtained with the helicopter-borne Airborne Cloud Turbulence Observation System (ACTOS) operated by the Leibniz Institute for Tropospheric Research (TROPOS) during the first phase of ACE-ENA; and 3. above-boundary-layer, mountain-top measurements taken at the Pico Mountain Observatory (OMP) by the research group of the co-investigator and scientists from TROPOS during the first phase of ACE-ENA. The work is aligned with the topic “Warm Boundary-Layer Atmospheric Processes.” Key results include the following. Data from the Holographic Detector for Clouds (Holodec) were reprocessed, refined, and validated through a careful instrument intercomparison, resulting in a high-quality dataset available on the ARM archive for ACE-ENA. High-resolution ACTOS measurements of thermodynamics, microphysical, and turbulence properties were analyzed to explore the behavior of the entrainment velocity at cloud top. Analysis of the vertical variability of cloud droplet size distribution shape suggests that mixing is more inhomogeneous near cloud top, and more homogeneous deeper into the cloud. Analysis of aerosol measurements from OMP explored the mixing state and cloud condensation nucleus properties, as well as the implications for radiative forcing. Finally, a machine learning algorithm was developed for identifying characteristic cloud droplet size distributions, and was employed to explore microphysical regimes in stratocumulus clouds observed during ACE-ENA. The characteristic size distributions are narrow, and only when spatially averaged do they produce the broad “gamma” distributions typically assumed in models. This implies that precipitation development should account for variability and correlations in the distribution shape as well as the number concentration of cloud droplets.

54 ENVIRONMENTAL SCIENCES↗

Probabilistic Guidance of a Swarm Deployed from the Back Shell of the Mars Spacecraft

This paper presents a probabilistic guidance algorithm for a swarm of assets deployed from the back shell of the Mars spacecraft. Such a swarm could provide valuable science data, with large spatiotemporal variation, from the Martian surface. Our probabilistic swarm guidance algorithm maximizes the coverage area of the swarm while uniformly distributing the assets on the Martian surface and guaranteeing strong connectivity of the swarm’s communication network topology. Numerical simulations demonstrate the effectiveness and versatility of our probabilistic swarm guidance algorithm.

Hadaegh, Fred↗

Towards Resilient Design of Leader-following Consensus with Attack Identification and Privacy Preservation Capabilities

This paper considers a leader-following consensus in the presence of unknown but bounded cyber-attacks. Specifically, we consider the following cyber-attack scenarios: (i) an attacker aims to destabilize the consensus dynamics by injecting exogenous signals to both the actuators of the followers and/or the communication network, (ii) an eavesdropper adversary aims to obtain information on the physical state of the agents. To this end, a novel resilient leader-following consensus algorithm based on a competitive interaction method is proposed. In addition, it is demonstrated that by appropriately choosing the information exchanged between the agents, the proposed control framework also enables the cooperative system to either distributively identify the compromised communication links in real-time or to protect the privacy of the physical state of the agents from the eavesdropper. Here, a numerical example is provided to illustrate the proposed resilient control algorithms.

Gusrialdi, Azwirman↗

Robust Localization of an Arbitrary Distribution of Radioactive Sources for Aerial Inspection - 18094

Radiation source detection has seen various applications in the past decade, ranging from the detection of dirty bombs in public places to scanning critical nuclear facilities for leakage or flaws, and in the autonomous inspection of nuclear sites. Despite the success in detecting single point sources, or a small number of spatially separated point sources, most of the existing algorithms fail to localize sources in complex scenarios with a large number of point sources or non-trivial distributions and bulk sources. Even in simpler environments, most existing algorithms are not scalable to larger regions and/or higher dimensional spaces. For effective autonomous inspection, we not only need to estimate the positions of the sources, but also the number, distribution and intensities of each of them. In this paper, we present a novel algorithm for the robust localization of an arbitrary distribution of radiation sources using multi-layer sequential Monte Carlo methods coupled with suitable clustering algorithms. We achieve near-perfect accuracy, in terms of F1-scores (> 0.95), while allowing the algorithm to scale, both to large regions in space, and to higher dimensional spaces (5 tested). (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Field-Programmable Gate Array Computer in Structural Analysis: An Initial Exploration

This paper reports on an initial assessment of using a Field-Programmable Gate Array (FPGA) computational device as a new tool for solving structural mechanics problems. A FPGA is an assemblage of binary gates arranged in logical blocks that are interconnected via software in a manner dependent on the algorithm being implemented and can be reprogrammed thousands of times per second. In effect, this creates a computer specialized for the problem that automatically exploits all the potential for parallel computing intrinsic in an algorithm. This inherent parallelism is the most important feature of the FPGA computational environment. It is therefore important that if a problem offers a choice of different solution algorithms, an algorithm of a higher degree of inherent parallelism should be selected. It is found that in structural analysis, an 'analog computer' style of programming, which solves problems by direct simulation of the terms in the governing differential equations, yields a more favorable solution algorithm than current solution methods. This style of programming is facilitated by a 'drag-and-drop' graphic programming language that is supplied with the particular type of FPGA computer reported in this paper. Simple examples in structural dynamics and statics illustrate the solution approach used. The FPGA system also allows linear scalability in computing capability. As the problem grows, the number of FPGA chips can be increased with no loss of computing efficiency due to data flow or algorithmic latency that occurs when a single problem is distributed among many conventional processors that operate in parallel. This initial assessment finds the FPGA hardware and software to be in their infancy in regard to the user conveniences; however, they have enormous potential for shrinking the elapsed time of structural analysis solutions if programmed with algorithms that exhibit inherent parallelism and linear scalability. This potential warrants further development of FPGA-tailored algorithms for structural analysis.

Singleterry, Robert C., Jr.↗

Grid tied PV system energy smoothing.

Grid-tied PV energy smoothing was implemented by using a valve regulated lead-acid (VRLA) battery as a temporary energy storage device to both charge and discharge as required to smooth the inverter energy output from the PV array. Inverter output was controlled by the average solar irradiance over the previous 1h time interval. On a clear day the solar irradiance power curve is offset by about 1h, while on a variable cloudy day the inverter output power curve will be smoothed based on the average solar irradiance. Test results demonstrate that this smoothing algorithm works very well. Battery state of charge was more difficult to manage because of the variable system inefficiencies. Testing continued for 30-days and established consistent operational performance for extended periods of time under a wide variety of resource conditions. Both battery technologies from Exide (Absolyte) and East Penn (Advanced Valve Regulated Lead-Acid) proved to cycle well at a partial state of charge over the time interval tested.

14 SOLAR ENERGY↗

A Parallel Solver for Graph Laplacians

Problems from graph drawing, spectral clustering, network flow and graph partitioning can all be expressed in terms of graph Laplacian matrices. There are a variety of practical approaches to solving these problems in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essential to solve such problems quickly. We present an unsmoothed aggregation multigrid method for solving graph Laplacians in a distributed memory setting. We introduce new parallel aggregation and low degree elimination algorithms targeted specifically at irregular degree graphs. These algorithms are expressed in terms of sparse matrix-vector products using generalized sum and product operations. This formulation is amenable to linear algebra using arbitrary distributions and allows us to operate on a 2D sparse matrix distribution, which is necessary for parallel scalability. Our solver outperforms the natural parallel extension of the current state of the art in an algorithmic comparison. We demonstrate scalability to 576 processes and graphs with up to 1.7 billion edges.

Konolige, Tristan↗

Distributed Control with Collective Intelligence

We consider systems of interacting reinforcement learning (RL) algorithms that do not work at cross purposes , in that their collective behavior maximizes a global utility function. We call such systems COllective INtelligences (COINs). We present the theory of designing COINs. Then we present experiments validating that theory in the context of two distributed control problems: We show that COINs perform near-optimally in a difficult variant of Arthur's bar problem [Arthur] (and in particular avoid the tragedy of the commons for that problem), and we also illustrate optimal performance in the master-slave problem.

Wolpert, David H.↗

Casimir meets Poisson: improved quark/gluon discrimination with counting observables

Charged track multiplicity is among the most powerful observables for discriminating quark- from gluon-initiated jets. Despite its utility, it is not infrared and collinear (IRC) safe, so perturbative calculations are limited to studying the energy evolution of multiplicity moments. While IRC-safe observables, like jet mass, are perturbatively calculable, their distributions often exhibit Casimir scaling, such that their quark/gluon discrimination power is limited by the ratio of quark to gluon color factors. In this paper, we introduce new IRC-safe counting observables whose discrimination performance exceeds that of jet mass and approaches that of track multiplicity. The key observation is that track multiplicity is approximately Poisson distributed, with more suppressed tails than the Sudakov peak structure from jet mass. By using an iterated version of the soft drop jet grooming algorithm, we can define a “soft drop multiplicity” which is Poisson distributed at leading-logarithmic accuracy. In addition, we calculate the next-to-leading-logarithmic corrections to this Poisson structure. If we allow the soft drop groomer to proceed to the end of the jet branching history, we can define a collinear-unsafe (but still infrared-safe) counting observable. Exploiting the universality of the collinear limit, we define generalized fragmentation functions to study the perturbative energy evolution of collinear-unsafe multiplicity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

An efficient reconstruction algorithm for differential phase-contrast tomographic images from a limited number of views

The main focus of this paper is reconstruction of tomographic phase-contrast image from a set of projections. We propose an efficient reconstruction algorithm for differential phase-contrast computed tomography that can considerably reduce the number of projections required for reconstruction. The key result underlying this research is a projection theorem that states that the second derivative of the projection set is linearly related to the Laplacian of the tomographic image. The proposed algorithm first reconstructs the Laplacian image of the phase-shift distribution from the second-derivative of the projections using total variation regularization. The second step is to obtain the phase-shift distribution by solving a Poisson equation whose source is the Laplacian image previously reconstructed under the Dirichlet condition. We demonstrate the efficacy of this algorithm using both synthetically generated simulation data and projection data acquired experimentally at a synchrotron. The experimental phase data were acquired from a human coronary artery specimen using dark-field-imaging optics pioneered by our group. Our results demonstrate that the proposed algorithm can reduce the number of projections to approximately 33% as compared with the conventional filtered backprojection method, without any detrimental effect on the image quality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Select Advances in Computational Accelerator Physics

Computational accelerator physics has changed and broadened over the last decade or so. Part of the change is due to the advent of multiple ways of parallel computing. Another part comes from algorithmic developments. The multiple ways of parallel computing include distributed memory parallelism and on-chip parallelism, with the latter coming from architectures (CPU and GPU) having multiple processing elements (cores or streaming multiprocessors) and wide vector (SIMD) instruction units. The basics of these new architectures and their application to computational accelerator physics are briefly reviewed. Algorithmic advances in the select areas of spin tracking, cavity calculations, plasma acceleration, and electron cooling are also reviewed. In some cases the algorithms provide increased fidelity improving the overall accuracy, while in other cases, such as controlled dispersion, the algorithms provide increased fidelity by better modeling the essential physical interaction. Finally, the use of computational frameworks, which provide the basic computational infrastructure, while allowing the capability developer to concentrate on the math and physics, is reviewed in the context of the Vorpal application, which has found use across accelerator physics and many other fields.

Engineering↗

Machine learning based energy management system for grid disaster mitigation

The recent increase in infiltration of distributed resources has challenged the traditional operation of power systems. Simultaneously, devastating effects of recent natural disasters have questioned the resilience of power infrastructure for an electricity dependent community. In this study, a solution has been presented in the form of a resilient smart grid network which utilizes Distributed Energy Resources (DERs) and Machine Learning (ML) algorithms to improve the power availability during disastrous events. In addition to power electronics with load categorization features, the presented system utilizes ML tools to use the information from neighbouring units and external sources to make complicated logical decisions directed towards provide power to critical loads at all times. Furthermore, provided model encourages consideration of ML tools as a part of smart grid design process together with power electronics and controls, not as an additional feature.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Parallel processing for scientific computations

The scope of this project dealt with the investigation of the requirements to support distributed computing of scientific computations over a cluster of cooperative workstations. Various experiments on computations for the solution of simultaneous linear equations were performed in the early phase of the project to gain experience in the general nature and requirements of scientific applications. A specification of a distributed integrated computing environment, DICE, based on a distributed shared memory communication paradigm has been developed and evaluated. The distributed shared memory model facilitates porting existing parallel algorithms that have been designed for shared memory multiprocessor systems to the new environment. The potential of this new environment is to provide supercomputing capability through the utilization of the aggregate power of workstations cooperating in a cluster interconnected via a local area network. Workstations, generally, do not have the computing power to tackle complex scientific applications, making them primarily useful for visualization, data reduction, and filtering as far as complex scientific applications are concerned. There is a tremendous amount of computing power that is left unused in a network of workstations. Very often a workstation is simply sitting idle on a desk. A set of tools can be developed to take advantage of this potential computing power to create a platform suitable for large scientific computations. The integration of several workstations into a logical cluster of distributed, cooperative, computing stations presents an alternative to shared memory multiprocessor systems. In this project we designed and evaluated such a system.

Alkhatib, Hasan S.↗

Estimating Microwave Delay by Atmospheric Water

Tropospheric path delays for microwave very-long-baseline interferometry (VLBI) estimated with algorithm that determines and explicitly integrates simple water-vapor distribution based on temperature data from water-vapor radiometer (WVR) and emission model. Although computationally complex, method readily accommodates even dramatic changes in observation conditions, emission model, and WVR equipment. Algorithm accommodates changes in observation conditions, emission model, and radiometer hardware.

Robinson, S. E.↗

Accuracy Assessments of Cloud Droplet Size Retrievals from Polarized Reflectance Measurements by the Research Scanning Polarimeter

We present an algorithm for the retrieval of cloud droplet size distribution parameters (effective radius and variance) from the Research Scanning Polarimeter (RSP) measurements. The RSP is an airborne prototype for the Aerosol Polarimetery Sensor (APS), which was on-board of the NASA Glory satellite. This instrument measures both polarized and total reflectance in 9 spectral channels with central wavelengths ranging from 410 to 2260 nm. The cloud droplet size retrievals use the polarized reflectance in the scattering angle range between 135deg and 165deg, where they exhibit the sharply defined structure known as the rain- or cloud-bow. The shape of the rainbow is determined mainly by the single scattering properties of cloud particles. This significantly simplifies both forward modeling and inversions, while also substantially reducing uncertainties caused by the aerosol loading and possible presence of undetected clouds nearby. In this study we present the accuracy evaluation of our algorithm based on the results of sensitivity tests performed using realistic simulated cloud radiation fields.

Rainbow↗

A Distributed Prognostic Health Management Architecture

This paper introduces a generic distributed prognostic health management (PHM) architecture with specific application to the electrical power systems domain. Current state-of-the-art PHM systems are mostly centralized in nature, where all the processing is reliant on a single processor. This can lead to loss of functionality in case of a crash of the central processor or monitor. Furthermore, with increases in the volume of sensor data as well as the complexity of algorithms, traditional centralized systems become unsuitable for successful deployment, and efficient distributed architectures are required. A distributed architecture though, is not effective unless there is an algorithmic framework to take advantage of its unique abilities. The health management paradigm envisaged here incorporates a heterogeneous set of system components monitored by a varied suite of sensors and a particle filtering (PF) framework that has the power and the flexibility to adapt to the different diagnostic and prognostic needs. Both the diagnostic and prognostic tasks are formulated as a particle filtering problem in order to explicitly represent and manage uncertainties; however, typically the complexity of the prognostic routine is higher than the computational power of one computational element ( CE). Individual CEs run diagnostic routines until the system variable being monitored crosses beyond a nominal threshold, upon which it coordinates with other networked CEs to run the prognostic routine in a distributed fashion. Implementation results from a network of distributed embedded devices monitoring a prototypical aircraft electrical power system are presented, where the CEs are Sun Microsystems Small Programmable Object Technology (SPOT) devices.

Bhaskar, Saha↗

Design and Development of a 200-kW Turbo-Electric Distributed Propulsion Testbed

The National Aeronautics and Space Administration (NASA) Armstrong Flight Research Center (AFRC) (Edwards, California) is developing a Hybrid-Electric Integrated Systems Testbed (HEIST) Testbed as part of the HEIST Project, to study power management and transition complexities, modular architectures, and flight control laws for turbo-electric distributed propulsion technologies using representative hardware and piloted simulations. Capabilities are being developed to assess the flight readiness of hybrid electric and distributed electric vehicle architectures. Additionally, NASA will leverage experience gained and assets developed from HEIST to assist in flight-test proposal development, flight-test vehicle design, and evaluation of hybrid electric and distributed electric concept vehicles for flight safety. The HEIST test equipment will include three trailers supporting a distributed electric propulsion wing, a battery system and turbogenerator, dynamometers, and supporting power and communication infrastructure, all connected to the AFRC Core simulation. Plans call for 18 high performance electric motors that will be powered by batteries and the turbogenerator, and commanded by a piloted simulation. Flight control algorithms will be developed on the turbo-electric distributed propulsion system.

distributed↗

Cloud-based Testbed for Adaptive Under-Frequency Load Shedding with High DER Penetration

Increasing penetration of distributed energy resources and behind-the-meter renewables may soon disrupt the efficacy of critical protection schemes, such as under-frequency load shedding (UFLS). Improved data exchange and coordination across the transmission-distribution boundary will be required to maintain reliability of bulk electric system. Standards-based data integration platforms using agreed-upon semantic vocabularies, such as the Common Information Model, will be key to enabling adaptive protection schemes requiring synthesized data from both the bulk power system and behind-the-meter resources. This paper introduces a cloud-based open-source data integration environment and UFLS clustering algorithm being developed to enable adaptive relay coordination between transmission and distribution utilities in the state of Vermont.

Anderson, Alexander A.↗