Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed algorithms”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Parallel Monte Carlo Simulation for control system design

The research during the 1993/94 academic year addressed the design of parallel algorithms for stochastic robustness synthesis (SRS). SRS uses Monte Carlo simulation to compute probabilities of system instability and other design-metric violations. The probabilities form a cost function which is used by a genetic algorithm (GA). The GA searches for the stochastic optimal controller. The existing sequential algorithm was analyzed and modified to execute in a distributed environment. For this, parallel approaches to Monte Carlo simulation and genetic algorithms were investigated. Initial empirical results are available for the KSR1.

Schubert, Wolfgang M.↗
NASA NTRS1994

Comparison of TOPEX/POSEIDON sigma(sub 0) and significant wave height distributions to Geosat

Monthly Ku band sigma(sub 0) and significant wave height (SWH) histograms from the NASA altimeter on the TOPEX/POSEIDON satellite are preseneted for January through June 1993 for three latitude bands between +/- 60 degrees. The data are compared to distributions from the Geosat mission for the same months in 1987-1989. Generally, the distributions agree quite well, although there are some seasonal/hemispherical differences. The sigma(sub 0) comparison reveals an overall bias between the two altimeters with the TOPEX sigma(sub 0) higher by about 0.7 dB, which is consistent with algorithm improvements for TOPEX. The SWH distributions show strong hemispherical/seasonal changes. The seasonal/hemispherical differences between TOPEX and Geosat are consistent for SWH and sigma(sub 0). The joint distribution of sigma(sub 0) and SWH is extremely stable friom month to month. The typical SWH is independent of sigma(sub 0) for sigma(sub 0) greater than 11.3 dB. The minimum SWH grows exponentially with wind speed. This joint distribution may be useful for understanding electromagnetic bias in altimeter measurements. Finally, altimeter data are compared to buoy values from 21 overflights of the NASA verification site near Pt. Conception, California. Wave heights agree well with an root mean square (RMS) difference of only 0.2 m. Altimeter sigma(sub 0) values are compared to buoy wind speeds. The results are consistent with the -0.7 dB sigma(sub 0) offset from the histogram comparisons.

Callahan, Philip S.↗
DOE OSTI2024

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2022

A Unifying View of Estimation and Control Using Belief Propagation With Application to Path Planning

The use of estimation techniques on stochastic models to solve control problems is an emerging paradigm that falls under the rubric of Active Inference (AI) and Control as Inference (CAI). In this work, we use probability propagation on factor graphs to show that various algorithms proposed in the literature can be seen as specific composition rules in a factor graph. We show how this unified approach, presented both in probability space and in log of the probability space, provides a very general framework that includes the Sum-product, the Max-product, Dynamic programming and mixed Reward/Entropy criteria-based algorithms. The framework also expands algorithmic design options that lead to new smoother or sharper policy distributions. We propose original recursions such as: a generalized Sum/Max-product algorithm, a Smooth Dynamic programming algorithm and a modified versions of the Reward/Entropy algorithm. The discussion is carried over with reference to a path planning problem where the recursions that arise from various cost functions, although they may appear similar in scope, bear noticeable differences. We provide a comprehensive table of composition rules and a comparison through simulations, first on a synthetic small grid with a single goal with obstacles, and then on a grid extrapolated from a real-world scene with multiple goals and a semantic map.

Francesco A. N. Palmieri↗
NASA NTRS2000

DMSP SSJ4 Data Restoration, Classification, and On-Line Data Access

Compress and clean raw data file for permanent storage We have identified various error conditions/types and developed algorithms to get rid of these errors/noises, including the more complicated noise in the newer data sets. (status = 100% complete). Internet access of compacted raw data. It is now possible to access the raw data via our web site, http://www.jhuapl.edu/Aurora/index.html. The software to read and plot the compacted raw data is also available from the same web site. The users can now download the raw data, read, plot, or manipulate the data as they wish on their own computer. The users are able to access the cleaned data sets. Internet access of the color spectrograms. This task has also been completed. It is now possible to access the spectrograms from the web site mentioned above. Improve the particle precipitation region classification. The algorithm for doing this task has been developed and implemented. As a result, the accuracies improved. Now the web site routinely distributes the results of applying the new algorithm to the cleaned data set. Mark the classification region on the spectrograms. The software to mark the classification region in the spectrograms has been completed. This is also available from our web site.

Wing, Simon↗
NASA NTRS1977

Ku-band antenna acquisition and tracking performance study, volume 4

The results pertaining to the tradeoff analysis and performance of the Ku-band shuttle antenna pointing and signal acquisition system are presented. The square, hexagonal and spiral antenna trajectories were investigated assuming the TDRS postulated uncertainty region and a flexible statistical model for the location of the TDRS within the uncertainty volume. The scanning trajectories, shuttle/TDRS signal parameters and dynamics, and three signal acquisition algorithms were integrated into a hardware simulation. The hardware simulation is quite flexible in that it allows for the evaluation of signal acquisition performance for an arbitrary (programmable) antenna pattern, a large range of C/N sub O's, various TDRS/shuttle a priori uncertainty distributions, and three distinct signal search algorithms.

Huang, T. C.↗
NASA NTRS1999

Energetic Neutral Atom Imaging at Low Altitudes from the Swedish Microsatellite Astrid: Extraction of the Equatorial Ion Distribution

Energetic neutral atom (ENA) images obtained by the ENA imager on- board the Astrid satellite in the polar cap at 1000 km during a moderate magnetic storm (Dst greater than or equal to 80 nT) on 8 February 1995 are simulated using a parameterized model of the equatorial ion distribution and a six-component Chamberlain exo-sphere with parameters from the MSISE-90 model. By changing the ion parameters until a matching ENA image is obtained one can extract the equatorial ion distribution. Four consecutive images from different view points several of minutes apart are simulated assuming H(+) and O(+), respectively, as parent ions. The optimal set of parameters is extracted by minimizing the chi(exp 2) difference between simulated and observed ENA image using Powell's minimization algorithm. The optimal equatorial model ion distribution consists of O(+) peaked in around dusk. The lower intensity of fluxes obtained from vantage points closer to the pole is an effect of the loss cone of the parent ion distribution being empty.

Brandt, Pontus C:son↗
NASA NTRS2006

An Ensemble-Based Smoother with Retrospectively Updated Weights for Highly Nonlinear Systems

Monte Carlo computational methods have been introduced into data assimilation for nonlinear systems in order to alleviate the computational burden of updating and propagating the full probability distribution. By propagating an ensemble of representative states, algorithms like the ensemble Kalman filter (EnKF) and the resampled particle filter (RPF) rely on the existing modeling infrastructure to approximate the distribution based on the evolution of this ensemble. This work presents an ensemble-based smoother that is applicable to the Monte Carlo filtering schemes like EnKF and RPF. At the minor cost of retrospectively updating a set of weights for ensemble members, this smoother has demonstrated superior capabilities in state tracking for two highly nonlinear problems: the double-well potential and trivariate Lorenz systems. The algorithm does not require retrospective adaptation of the ensemble members themselves, and it is thus suited to a streaming operational mode. The accuracy of the proposed backward-update scheme in estimating non-Gaussian distributions is evaluated by comparison to the more accurate estimates provided by a Markov chain Monte Carlo algorithm.

Monte Carlo↗
NASA NTRS1999

TRMM Realtime Data Production, Transfer, and Future Plans

The Tropical Rainfall Measuring Mission, a joint US NASA and Japan NASDA mission, was launched on November 27, 1997 from Tanegashima Island, Japan on a NASDA provided H-II launch vehicle. The TRMM objectives are: to obtain and study multi-year science data sets of tropical and sub- tropical rainfall measurement; to understand how interactions between the sea, air, and land masses produce changes in global rainfall and climate; to help improve modeling of tropical rainfall processes; to test, evaluate, and improve the performance of satellite rainfall estimates measurements and techniques. The routine production and quick distribution of standard products provides an important underpinning to these objectives. The determination of standard TRMM algorithms and the requirements for routine production and distribution fall within the authority of the joint US-Japan Science Team. In April of 1998, the Joint TRMM Science team requested that TRMM data be made available in near real-time to approved international agencies and modelers. This request was an addition to the routine production of the standard TRMM data products. The science team requested that near-realtime products be as small as possible to facilitate their transfer via networks. Indeed, it was determined that only network transfer would be available. This presentation provides an overview of the type of products available from the realtime system and how the TRMM system was developed at the lowest cost in the shortest amount of time. It then describes the real-time data flow. The presentation also summarizes how the science quality of real-time data is maintained. It describes how interested groups can get access to this data and the importance of networks for the future of real-time data expansion. The presentation concludes real-time possibilities and improvements possible as part of the proposed Global Precipitation Mission. High speed network access availability is an important catalyst to real-time data flow during the proposed mission.

Stocker, Erich Franz↗
NASA NTRS1994

Rapid solution of large-scale systems of equations

The analysis and design of complex aerospace structures requires the rapid solution of large systems of linear and nonlinear equations, eigenvalue extraction for buckling, vibration and flutter modes, structural optimization and design sensitivity calculation. Computers with multiple processors and vector capabilities can offer substantial computational advantages over traditional scalar computer for these analyses. These computers fall into two categories: shared memory computers and distributed memory computers. This presentation covers general-purpose, highly efficient algorithms for generation/assembly or element matrices, solution of systems of linear and nonlinear equations, eigenvalue and design sensitivity analysis and optimization. All algorithms are coded in FORTRAN for shared memory computers and many are adapted to distributed memory computers. The capability and numerical performance of these algorithms will be addressed.

Storaasli, Olaf O.↗
NASA NTRS2017

NASA Computational Case Study: Spectral Energy Distribution Fitting

The need for faster, more efficient algorithms is an important aspect of scientific computing. Generally, scientists are only exposed to computational issues that arise in their field. Thus, collaboration between a numerical analyst and a scientist is becoming necessary for scientific computing. The purpose of this case study is to expose computer scientists to processes that an astronomer would use to obtain useful results from raw data. For example, astronomers are interested in determining the properties of galaxies and measuring changes in those properties as a function of time throughout cosmic history. To do so, they use certain models that are designed and refined over time via observations at different wavelengths of the light spectrum. The process of matching these models with observed data from studying celestial bodies is referred to as Spectral Energy Distribution (SED) fitting. In this case study, we learn how to perform the SED fit. This process requires knowledge of both the astronomical and computational issues involved when fitting flux, the total energy from a source as seen from Earth, to a set of physical templates. Once a fit is complete, one can classify the source and estimate a number of physical parameters. The goal is to demonstrate how the computer science skill set can be used in the scientific community and to possibly improve one or more of the computational aspects of this problem. The following provides some background on the astronomy issues, including information on the spectral energy distribution and related physical parameters, and the computational issues, including the fitting procedure..

modeling↗
DOE OSTI2025

Distributed Coordination of Demand-side Flexible Resources in Microgrid with All-Time Feasibility

The prevalence of distributed renewable generators motivates microgrid operators to exploit demand-side flexible resources (DFRs). Due to their dispersed nature, distributed DFR coordination has been a vibrant research area, while there are several issues awaiting to be addressed. On one hand, DFR power is internally coupled through power flow, while DFR usually cannot access grid information. On the other hand, in time-restricted scenarios, solution feasibility cannot be guaranteed by conventional dual-based algorithms. To fill these gaps, we propose a distributed DFR coordination framework with all-time feasibility. The proposed framework accounts for the distinct access of microgrid entities to grid information. A distributed and all-time feasible algorithm is proposed for optimal DFR coordination, which allows DFRs to make local decisions without violating constraints throughout iterations. The effectiveness of the proposed algorithm is demonstrated through case studies. The impact of peer-to-peer communication links on algorithm convergence is also investigated, which emphasizes the balance between communication investment and algorithm performance.

Li, Hongyi [Iowa State Univ., Ames, IA (United Sta↗
NASA NTRS1974

Cluster analysis based on dimensional information with applications to feature selection and classification

A new clustering algorithm is presented that is based on dimensional information. The algorithm includes an inherent feature selection criterion, which is discussed. Further, a heuristic method for choosing the proper number of intervals for a frequency distribution histogram, a feature necessary for the algorithm, is presented. The algorithm, although usable as a stand-alone clustering technique, is then utilized as a global approximator. Local clustering techniques and configuration of a global-local scheme are discussed, and finally the complete global-local and feature selector configuration is shown in application to a real-time adaptive classification scheme for the analysis of remote sensed multispectral scanner data.

Eigen, D. J.↗
NASA NTRS1993

A formally verified algorithm for interactive consistency under a hybrid fault model

Consistent distribution of single-source data to replicated computing channels is a fundamental problem in fault-tolerant system design. The 'Oral Messages' (OM) algorithm solves this problem of Interactive Consistency (Byzantine Agreement) assuming that all faults are worst-cass. Thambidurai and Park introduced a 'hybrid' fault model that distinguished three fault modes: asymmetric (Byzantine), symmetric, and benign; they also exhibited, along with an informal 'proof of correctness', a modified version of OM. Unfortunately, their algorithm is flawed. The discipline of mechanically checked formal verification eventually enabled us to develop a correct algorithm for Interactive Consistency under the hybrid fault model. This algorithm withstands $a$ asymmetric, $s$ symmetric, and $b$ benign faults simultaneously, using $m+1$ rounds, provided $n is greater than 2a + 2s + b + m$, and $m\geg a$. We present this algorithm, discuss its subtle points, and describe its formal specification and verification in PVS. We argue that formal verification systems such as PVS are now sufficiently effective that their application to fault-tolerance algorithms should be considered routine.

Lincoln, Patrick↗
NASA NTRS2003

Production, Outflow Velocity, and Radial Distribution of H2O and OH in the Coma of Comet C/1995 O1 [Hale-Bopp] from Wide Field Imaging of OH

Observations of OH are a useful proxy of the water production rate (Q(sub H2O)) and outflow velocity (V(sub out)) in comets. From wide field images taken on 03/28/1997 and 04/08/1997 that capture the entire scale length of the OH coma of comet C/1995 O1 (Hale-Bopp), we obtain Q(sub H2O) from the model-independent method of aperture summation. With an adaptive ring summation algorithm, we extract the radial brightness distribution of OH 0-0 band emission out to cometocentric distances of up to 10(exp 6) km, both as azimuthal averages and in quadrants covering different position angles relative to the comet-Sun line. These profiles are fit using both fixed and variable velocity 2-component spherical expansion models to estimate V(sub OH) with increasing distance from the nucleus. The OH coma of Hale-Bopp was more spatially extended than previous comets, and this extension is best matched by a variable acceleration of H2O and OH that acted across the entire coma, but was strongest within 1-2 x 10(exp 4) km from the nucleus. Our models indicate that V(sub OH) at the edge of our detectable field of view (10(exp 6) km) was approx. 2-3 times greater in Hale-Bopp than for a 1P/Halley-class comet at 1 AU, which is consistent with the results of more sophisticated gas-kinetic models, extrapolation from previous observations of OH in comets with Q(sub H2O) greater than 10(exp 29)/s , and direct radio measurements of the outer coma Hale-Bopp OH velocity. The most probable source of this acceleration is thermalization of the excess energy of dissociation of H2O and OH over an extended collisional coma. When the coma is broken down by quadrants in position angle, we find an azimuthal asymmetry in the radial distribution that is characterized by an increase in the spatial extent of OH in the region between the orbit-trailing and anti-sunward directions. Model fits specific to this area and comparison with radio OH measurements suggest greater acceleration here, with V(sub OH) approx. 1.5 times greater at a 10(exp 6) km cometocentric distance than elsewhere in the coma. We discuss several mechanisms that may have acted within the coma to produce the observed effect.

Harris, Walter M.↗
NASA NTRS1991

Efficient computation of aerodynamic influence coefficients for aeroelastic analysis on a transputer network

Aeroelastic analysis is multi-disciplinary and computationally expensive. Hence, it can greatly benefit from parallel processing. As part of an effort to develop an aeroelastic capability on a distributed memory transputer network, a parallel algorithm for the computation of aerodynamic influence coefficients is implemented on a network of 32 transputers. The aerodynamic influence coefficients are calculated using a 3-D unsteady aerodynamic model and a parallel discretization. Efficiencies up to 85 percent were demonstrated using 32 processors. The effect of subtask ordering, problem size, and network topology are presented. A comparison to results on a shared memory computer indicates that higher speedup is achieved on the distributed memory system.

Janetzke, David C.↗