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 865 records · Page 48

Combined Radiometer-Radar Microphysical Profile Estimations with Emphasis on High Frequency Brightness Temperature Observations

Information about the vertical microphysical cloud structure is useful in many modeling and predictive practices. Radiometers and radars are used to observe hydrometeor properties. This paper describes an iterative retrieval algorithm that combines the use of airborne active and wideband (10 to 340 GHz) passive observations to estimate the vertical content and particle size distributions of liquid and frozen hydrometeors. The physically-based retrieval algorithm relies on the high frequencies (greater than 89 GHz) to provide details on the frozen hydrometeors. Neglecting the high frequencies yielded acceptable estimates of the liquid profiles, but the ice profiles were poorly retrieved. Airborne radar and radiometer observations from the third Convection and Moisture EXperiment (CAMEX-3) were used in the retrieval algorithm as constraints. Nadir profiles were estimated for a minute each of flight time (approximately 12.5 km along track) from an anvil, convection, and quasi- stratiform rain. The complex structure of the frozen hydrometeors required the most iterations for convergence for the anvil cloud type. The wideband observations were found to more than double the estimated frozen hydrometeor content as compared to retrievals using only 90-GHz and below. The convective and quasi-stratiform quickly reached convergence (minimized difference between observations and calculations using the estimated profiles). A qualitative validation using coincident in situ CAMEX-3 observations shows that the retrieved particle size distributions are well corroborated with independent measurements.

Gail Skofronick-Jackson↗

Automatic detection of mass-resolved ion conics

A processing algorithm to automatically detect a specific type of ion distribution (called the ion conic distribution) in data obtained from a space-based mass spectrometer has been devised. Automation of this task is necessary due to the sparseness of conic events within the very large databases typical of space plasma instruments. This paper reports on the algorithm used to perform this automated analysis, along with a description of the methods used to verify the algorithm and a summary of initial results on the characterization of the near-earth space plasma.

Doherty, Mark F.↗

Properly Learning Decision Trees in almost Polynomial Time

We give an n O (log log n ) -time membership query algorithm for properly and agnostically learning decision trees under the uniform distribution over { ± 1} n . Even in the realizable setting, the previous fastest runtime was n O (log n ) , a consequence of a classic algorithm of Ehrenfeucht and Haussler. Our algorithm shares similarities with practical heuristics for learning decision trees, which we augment with additional ideas to circumvent known lower bounds against these heuristics. To analyze our algorithm, we prove a new structural result for decision trees that strengthens a theorem of O’Donnell, Saks, Schramm, and Servedio. While the OSSS theorem says that every decision tree has an influential variable, we show how every decision tree can be “pruned” so that every variable in the resulting tree is influential.

Computer Science↗

An algorithm for computing the number of distinct spectral vectors in thematic mapper data

A computationally efficient method was developed to compute the number of distinct spectral vectors and their frequency of occurrence in Landsat-4 Thematic Mapper (TM) data. The algorithm first partitions the image into spectrally disjoint subsets and then computes the frequency distribution of distinct spectral vectors within each subset from a multidimensional histogram. The overall frequency distribution is tabulated by accumulating the results from each subset. The number of distinct spectral vectors could be used as a measure of potential storage compaction of alternate data representations for data compression, or as a measure of information content in the comparison of spectral band combinations and/or spatial resolutions for an image. Results from processing three 512 x 512 pixel Landsat-4 TM images and one Landsat-4 Multispectral Scanner (MSS) image are presented as examples. An algorithm for computing the frequency distribution of distinct spectral vectors in MSS data is given in the Appendix.

Wharton, S. W.↗

Rubik’s Cube Topology Based Particle Swarm Algorithm for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g. renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as, reducing power loss, stabilizing the main power grid, etc. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. In addition, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush-Kuhn-Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubiks Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubiks Cube topology based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology based PSO and its scalability on larger scale applications.

Feng, Xiaochun↗

Phase Space Reconstruction from Accelerator Beam Measurements Using Neural Networks and Differentiable Simulations

Characterizing the phase space distribution of particle beams in accelerators is a central part of accelerator understanding and performance optimization. However, conventional reconstruction-based techniques either use simplifying assumptions or require specialized diagnostics to infer high-dimensional (> $2D$) beam properties. In this Letter, we introduce a general-purpose algorithm that combines neural networks with differentiable particle tracking to efficiently reconstruct high-dimensional phase space distributions without using specialized beam diagnostics or beam manipulations. Furthermore, we demonstrate that our algorithm accurately reconstructs detailed 4D phase space distributions with corresponding confidence intervals in both simulation and experiment using a single focusing quadrupole and diagnostic screen. This technique allows for the measurement of multiple correlated phase spaces simultaneously, which will enable simplified 6D phase space distribution reconstructions in the future.

47 OTHER INSTRUMENTATION↗

Salvaging Data Records with Missing Data: Data Imputation using the Multivariate t Distribution

When doing multivariate data analysis, one commonobstacle is the presence of incomplete observations, i.e., observationsfor which one or more key fields are blank. Missing datais often countered by deleting entire observations that containmissing data. The negative effects of deleting entire observationsare multiple: deleting observations reduces sample size andcan also result in biased inferences even if data is missing atrandom. In addition, knowledge contained within incompleteobservations is knowledge lost when they are deleted– and theeffort spent collecting that knowledge is effort wasted. Data imputationmethods, or methods of statistically “filling-in” missingdata, can help combat small sample sizes by using the existinginformation in partially complete observations with the end goalof producing less biased and higher confidence inferences. Whena sample from a multivariate normal population is only partiallycomplete, and the missing data meets appropriate assumptions(missing at random), robust data imputation of the missing datacan be implemented with monotone data augmentation (MDA)using the multivariate t distribution.Missing data imputation is applied to data from the NASA InstrumentCost Model (NICM) using the MDA algorithm underthe assumption of having a multivariate t distribution with fixeddegrees of freedom. A sensitivity analysis to the degrees offreedom parameter is presented to demonstrate robustness ofthe multivariate t distribution when dealing with small samplesas compared to the multivariate normal distribution.

DiNicola, Michael↗

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↗

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.↗

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.↗

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.↗