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

Development and Evaluation of Sensor Concepts for Ageless Aerospace Vehicles: Report 4 - Phase 1 Implementation of the Concept Demonstrator

This report describes the first phase of the implementation of the Concept Demonstrator. The Concept Demonstrator system is a powerful and flexible experimental test-bed platform for developing sensors, communications systems, and multi-agent based algorithms for an intelligent vehicle health monitoring system for deployment in aerospace vehicles. The Concept Demonstrator contains sensors and processing hardware distributed throughout the structure, and uses multi-agent algorithms to characterize impacts and determine an appropriate response to these impacts.

Abbott, David↗

Job Scheduling in a Heterogeneous Grid Environment

Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must be overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids is the efficient scheduling of jobs. This work addresses this problem by describing and evaluating a grid scheduling architecture and three job migration algorithms. The architecture is scalable and does not assume control of local site resources. The job migration policies use the availability and performance of computer systems, the network bandwidth available between systems, and the volume of input and output data associated with each job. An extensive performance comparison is presented using real workloads from leading computational centers. The results, based on several key metrics, demonstrate that the performance of our distributed migration algorithms is significantly greater than that of a local scheduling framework and comparable to a non-scalable global scheduling approach.

Shan, Hong-Zhang↗

A Simple Stochastic Model for Generating Broken Cloud Optical Depth and Top Height Fields

A simple and fast algorithm for generating two correlated stochastic twodimensional (2D) cloud fields is described. The algorithm is illustrated with two broken cumulus cloud fields: cloud optical depth and cloud top height retrieved from Moderate Resolution Imaging Spectrometer (MODIS). Only two 2D fields are required as an input. The algorithm output is statistical realizations of these two fields with approximately the same correlation and joint distribution functions as the original ones. The major assumption of the algorithm is statistical isotropy of the fields. In contrast to fractals and the Fourier filtering methods frequently used for stochastic cloud modeling, the proposed method is based on spectral models of homogeneous random fields. For keeping the same probability density function as the (first) original field, the method of inverse distribution function is used. When the spatial distribution of the first field has been generated, a realization of the correlated second field is simulated using a conditional distribution matrix. This paper is served as a theoretical justification to the publicly available software that has been recently released by the authors and can be freely downloaded from http://i3rc.gsfc.nasa.gov/Public codes clouds.htm. Though 2D rather than full 3D, stochastic realizations of two correlated cloud fields that mimic statistics of given fields have proved to be very useful to study 3D radiative transfer features of broken cumulus clouds for better understanding of shortwave radiation and interpretation of the remote sensing retrievals.

Prigarin, Sergei M.↗

Contextual classification of multispectral image data - An unbiased estimator for the context distribution

Recent investigations have demonstrated the effectiveness of a contextual classifier that combines spatial and spectral information employing a general statistical approach. This statistical classification algorithm exploits the tendency of certain ground-cover classes to occur more frequently in some spatial contexts than in others. Indeed, a key input to this algorithm is a statistical characterization of the context: the context distribution. Here a discussion is given of an unbiased estimator of the context distribution which, besides having the advantage of statistical unbiasedness, has the additional advantage over other estimation techniques of being amenable to an adaptive implementation in which the context distribution estimate varies according to local contextual information. Results from applying the unbiased estimator to the contextual classification of three real Landsat data sets are presented and contrasted with results from noncontextual classifications and from contextual classifications utilizing other context distribution estimation techniques.

Tilton, J. C.↗

Comparison of Surface Radiation Budget Satellite algorithms for downwelled shortwave irradiance with Wisconsin Fire/SRB surface-truth data

Surface radiation instruments were operated at various locations during the Wisconsin First ISSCP (International Satellite Cloud Climatology Project) Regional Experiment (FIRE) and Surface Radiation Budget (SRB) experiment in October 1986. Satellite data were distributed to scientists who had previously developed satellite algorithms to estimate downwelled shortwave irradiance. Results of intercomparison of ground-truth values with the satellite-derived estimates are described.

Whitlock, C. H.↗

Geometry modeling and grid generation using 3D NURBS control volume

The algorithms for volume grid generation using NURBS geometric representation are presented. The parameterization algorithm is enhanced to yield a desired physical distribution on the curve, surface and volume. This approach bridges the gap between CAD surface/volume definition and surface/volume grid generation. Computational examples associated with practical configurations have shown the utilization of these algorithms.

Yu, Tzu-Yi↗

Optimal source codes for geometrically distributed integer alphabets

An approach is shown for using the Huffman algorithm indirectly to prove the optimality of a code for an infinite alphabet if an estimate concerning the nature of the code can be made. Attention is given to nonnegative integers with a geometric probability assignment. The particular distribution considered arises in run-length coding and in encoding protocol information in data networks. Questions of redundancy of the optimal code are also investigated.

Gallager, R. G.↗

Improved Results for Route Planning in Stochastic Transportation Networks

In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times are not determined by a fixed schedule but instead may be random. the problem requires more than standard shortest path techniques. In recent work, Datar and Ranade provide algorithms in the case where bus arrivals are assumed to be independent and exponentially distributed. We offer solutions to two important generalizations of the problem, answering open questions posed by Datar and Ranade. First, we provide a polynomial time algorithm for a much wider class of arrival distributions, namely those with increasing failure rate. This class includes not only exponential distributions but also uniform, normal, and gamma distributions. Second, in the case where bus arrival times are independent and geometric discrete random variable,. we provide an algorithm for transportation networks of buses and trains, where trains run according to a fixed schedule.

Boyan, Justin↗

Computer-aided design and distributed system technology development for large space structures

Proposed large space structures have many characteristics that make them difficult to analyze and control. They are highly flexible, with components mathematically modeled by partial differential equations or very large systems of ordinary differential equations. They have many resonant frequencies, typically low and closely spaced. Natural damping may be low and/or improperly modeled. Coupled with stringent operational requirements of orientation, shape control, and vibration suppression, and the inability to perform adequate ground testing, these characteristics present an unconventional identification and control design problem to the systems theorist. Some of the research underway within Langley's Spacecraft Control Branch, Guidance and Control Division aimed at developing theory and algorithms to treat large space structures systems identification and control problems is described. The research areas to be considered are computer-aided design algorithms, and systems identification and control of distributed systems.

Armstrong, Ernest S.↗

Cluster compression algorithm: A joint clustering/data compression concept

The Cluster Compression Algorithm (CCA), which was developed to reduce costs associated with transmitting, storing, distributing, and interpreting LANDSAT multispectral image data is described. The CCA is a preprocessing algorithm that uses feature extraction and data compression to more efficiently represent the information in the image data. The format of the preprocessed data enables simply a look-up table decoding and direct use of the extracted features to reduce user computation for either image reconstruction, or computer interpretation of the image data. Basically, the CCA uses spatially local clustering to extract features from the image data to describe spectral characteristics of the data set. In addition, the features may be used to form a sequence of scalar numbers that define each picture element in terms of the cluster features. This sequence, called the feature map, is then efficiently represented by using source encoding concepts. Various forms of the CCA are defined and experimental results are presented to show trade-offs and characteristics of the various implementations. Examples are provided that demonstrate the application of the cluster compression concept to multi-spectral images from LANDSAT and other sources.

Hilbert, E. E.↗

Anomaly Detection in Test Equipment via Sliding Mode Observers

Nonlinear observers were originally developed based on the ideas of variable structure control, and for the purpose of detecting disturbances in complex systems. In this anomaly detection application, these observers were designed for estimating the distributed state of fluid flow in a pipe described by a class of advection equations. The observer algorithm uses collected data in a piping system to estimate the distributed system state (pressure and velocity along a pipe containing liquid gas propellant flow) using only boundary measurements. These estimates are then used to further estimate and localize possible anomalies such as leaks or foreign objects, and instrumentation metering problems such as incorrect flow meter orifice plate size. The observer algorithm has the following parts: a mathematical model of the fluid flow, observer control algorithm, and an anomaly identification algorithm. The main functional operation of the algorithm is in creating the sliding mode in the observer system implemented as software. Once the sliding mode starts in the system, the equivalent value of the discontinuous function in sliding mode can be obtained by filtering out the high-frequency chattering component. In control theory, "observers" are dynamic algorithms for the online estimation of the current state of a dynamic system by measurements of an output of the system. Classical linear observers can provide optimal estimates of a system state in case of uncertainty modeled by white noise. For nonlinear cases, the theory of nonlinear observers has been developed and its success is mainly due to the sliding mode approach. Using the mathematical theory of variable structure systems with sliding modes, the observer algorithm is designed in such a way that it steers the output of the model to the output of the system obtained via a variety of sensors, in spite of possible mismatches between the assumed model and actual system. The unique properties of sliding mode control allow not only control of the model internal states to the states of the real-life system, but also identification of the disturbance or anomaly that may occur.

Solano, Wanda M.↗

WetNet: Using SSM/I data interactively for global distribution of rainfall and precipitable water

By completing hardware installation, preparing for comparative studies of SSM/I, radar, and lightning data, it is believed that this will be a powerful combination for evaluating the global distribution of tropical rainfall, and the vertical distribution of latent heating, with strong application to algorithms for use on TRMM, EOS-A, and future GOES spacecraft. Potential data bases will be surveyed, about 5 case studies with surface rainfall, radar, lightning, and sounding data will be identified. SSM/I algorithms will be used to identify convective regions of MCSs. A catalog will be developed of the global profile of heavy tropical rainfall, and how these zones are organized within larger tropical weather systems. Beginning with the first few months of SSM/I data distributed over WetNet, SSM/I radiances will be compared with TOVS radiance (moisture and thermal) and OLR observations. The purpose is to improve understanding of how real world water vapor profiles in the tropical atmosphere are perceived by SSM/I precipitable water algorithm and, at the same time, by the TOVS water vapor channel.

Zipser, Edward J.↗

Applications of a transonic wing design method

A method for designing wings and airfoils at transonic speeds using a predictor/corrector approach was developed. The procedure iterates between an aerodynamic code, which predicts the flow about a given geometry, and the design module, which compares the calculated and target pressure distributions and modifies the geometry using an algorithm that relates differences in pressure to a change in surface curvature. The modular nature of the design method makes it relatively simple to couple it to any analysis method. The iterative approach allows the design process and aerodynamic analysis to converge in parallel, significantly reducing the time required to reach a final design. Viscous and static aeroelastic effects can also be accounted for during the design or as a post-design correction. Results from several pilot design codes indicated that the method accurately reproduced pressure distributions as well as the coordinates of a given airfoil or wing by modifying an initial contour. The codes were applied to supercritical as well as conventional airfoils, forward- and aft-swept transport wings, and moderate-to-highly swept fighter wings. The design method was found to be robust and efficient, even for cases having fairly strong shocks.

Campbell, Richard L.↗

Modal characterization of the ASCIE segmented optics testbed: New algorithms and experimental results

New frequency response measurement procedures, on-line modal tuning techniques, and off-line modal identification algorithms are developed and applied to the modal identification of the Advanced Structures/Controls Integrated Experiment (ASCIE), a generic segmented optics telescope test-bed representative of future complex space structures. The frequency response measurement procedure uses all the actuators simultaneously to excite the structure and all the sensors to measure the structural response so that all the transfer functions are measured simultaneously. Structural responses to sinusoidal excitations are measured and analyzed to calculate spectral responses. The spectral responses in turn are analyzed as the spectral data become available and, which is new, the results are used to maintain high quality measurements. Data acquisition, processing, and checking procedures are fully automated. As the acquisition of the frequency response progresses, an on-line algorithm keeps track of the actuator force distribution that maximizes the structural response to automatically tune to a structural mode when approaching a resonant frequency. This tuning is insensitive to delays, ill-conditioning, and nonproportional damping. Experimental results show that is useful for modal surveys even in high modal density regions. For thorough modeling, a constructive procedure is proposed to identify the dynamics of a complex system from its frequency response with the minimization of a least-squares cost function as a desirable objective. This procedure relies on off-line modal separation algorithms to extract modal information and on least-squares parameter subset optimization to combine the modal results and globally fit the modal parameters to the measured data. The modal separation algorithms resolved modal density of 5 modes/Hz in the ASCIE experiment. They promise to be useful in many challenging applications.

Carrier, Alain C.↗

SAR image data compression for an on-line archive system

This paper summarizes the investigation of SAR image data compression for an on-line archive data distribution system. This system is planned for the ground processing system of Alaska SAR Facility (ASF) and Shuttle Imaging Radar (SIR-C). The objective of the SAR image data compression is to enable the data archive system to provide the remote users a large data base with good image quality, short response time, low transfer cost, and minimal decoding complexity. The requirements and limitations of the on-line archive data distribution system are presented. The effects of SAR image data characteristics on data compression are addressed. The users' survey results suggest that compression ratios between 10:1 and 20:1 appear suitable. Based on the algorithm evaluation results, the two-level tree-searched vector quantization technique has been recommended as the SAR image data compression algorithm for the on-line archive data distribution system.

Chang, C. Y.↗

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