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 721 records · Page 40

Theoretical Basis for the Surface Spectral Reflectance Relationships Used in the MODIS Aerosol Algorithm

The analysis of data from the MODIS instrument on the Terra platform to derive global distribution of aerosols assumes a set of relationships between the blue, rho (sub blue), the red, rho (sub red), and 2.1 micrometers, rho (sub 2.1), spectral channels. These relations have been established from a series of measurements indicating that rho (sub blue) approximately 0.5 rho (sub red) approximately 0.25 rho (sub 2.1). Here we use a model to describe the transfer of radiation through a vegetation canopy composed of randomly oriented leaves to assess the theoretical foundations for these relationships. The influence of varying fractional vegetation coverage is simulated simply as a linear combination of pure soil and pure vegetation conditions, also known as Independent Pixel Approximation (IPA). Calculations for a wide range of leaf area indices and vegetation fractions show that rho (sub blue) is consistently about 1/4 of rho (sub 2.1) as used by MODIS for the whole range of analyzed cases, except for very dark soils, such as those found in burn scars. For its part, the ratio rho (sub red)/rho (sub 2.1) varies from less than the empirically derived value of 1/2 for dense and dark vegetation (rho (sub 2.1) less than 0.1), to more than 1/2 for bright mixture of soil and vegetation. This is in agreement with measurements over uniform dense vegetation, but not with measurements over mixed dark scenes. In the later case, the discrepancy is probably mitigated by shadows due to uneven canopy and terrain on a large scale. It is concluded that the value of this ratio should ideally be made dependent on the land cover type in the operational processing of MODIS data, especially over dense forests.

Kaufman, Yoram J.↗

Continental Scale Aerosol Optical Properties Over East Asia as Measured by Aeronet and Comparison to Satellite and Modeled Results

The AERONET program has operated in E. Asia since 1995 providing time continuous and time averaged ground-based column-integrated aerosol optical properties in a variety of aerosol regimes In the last four years the distribution has greatly increased in Siberia, China, SE Asia and India in particular. Commensurate with that, significant improvement in data processing algorithms (Version 2.0) and access to ancillary data products through the WWW have become available to the scientific community. At this writing the following distribution represents E and S. Asia: 5 sites operate in Siberia (2 years), 1 in Mongolia (9 years), 3 in Korea (3 to 6 years), 3 in Japan (2 to 7 years), China 11 (6 to 0 years), Taiwan 4 (7 to 2 yrs), Viet Nam 2 (4 years), Thailand 2 to 5 (4 years), and Singapore 1 (4 months), India 1 to 3 (7 to 1 years), Pakistan 2 (1 year), and UAE 3 (3 years). An analysis of the aerosol optical depth at 500 nm using annual average quality assured AERONET data (pre 2006) was used to estimate the mean annual aerosol loading by continent, sub continent and ocean. The individual site data were assumed representative of regional aerosol loading and aggregated to the sub-continental, continental and oceanic areas and presented. This analysis will be updated with more recent data with particular emphasis on seasonal results for Asia and the addition of single scattering albedo retrievals. The ground based results will be compared to MODIS collection 5 results and model estimates for E. Asia using the AERONET Synergy Tool.

Holben, B. N.↗

Lidar-Radiometer Inversion Code (LIRIC) for the Retrieval of Vertical Aerosol Properties from Combined Lidar Radiometer Data: Development and Distribution in EARLINET

This paper presents a detailed description of LIRIC (LIdar-Radiometer Inversion Code)algorithm for simultaneous processing of coincident lidar and radiometric (sun photometric) observations for the retrieval of the aerosol concentration vertical profiles. As the lidar radiometric input data we use measurements from European Aerosol Re-search Lidar Network (EARLINET) lidars and collocated sun-photometers of Aerosol Robotic Network (AERONET). The LIRIC data processing provides sequential inversion of the combined lidar and radiometric data by the estimations of column-integrated aerosol parameters from radiometric measurements followed by the retrieval of height-dependent concentrations of fine and coarse aerosols from lidar signals using integrated column characteristics of aerosol layer as a priori constraints. The use of polarized lidar observations allows us to discriminate between spherical and non-spherical particles of the coarse aerosol mode. The LIRIC software package was implemented and tested at a number of EARLINET stations. Inter-comparison of the LIRIC-based aerosol retrievals was performed for the observations by seven EARLNET lidars in Leipzig, Germany on 25 May 2009. We found close agreement between the aerosol parameters derived from different lidars that supports high robustness of the LIRIC algorithm. The sensitivity of the retrieval results to the possible reduction of the available observation data is also discussed.

Chaikovsky, A.↗

Autonomous In-Situ Resources Prospector

This presentation will describe the concept of an autonomous, intelligent, rover-based rapid surveying system to identify and map several key lunar resources to optimize their ISRU (In Situ Resource Utilization) extraction potential. Prior to an extraction phase for any target resource, ground-based surveys are needed to provide confirmation of remote observation, to quantify and map their 3-D distribution, and to locate optimal extraction sites (e.g. ore bodies) with precision to maximize their economic benefit. The system will search for and quantify optimal minerals for oxygen production feedstock, water ice, and high glass-content regolith that can be used for building materials. These are targeted because of their utility and because they are, or are likely to be, variable in quantity over spatial scales accessible to a rover (i.e., few km). Oxygen has benefits for life support systems and as an oxidizer for propellants. Water is a key resource for sustainable exploration, with utility for life support, propellants, and other industrial processes. High glass-content regolith has utility as a feedstock for building materials as it readily sinters upon heating into a cohesive matrix more readily than other regolith materials or crystalline basalts. Lunar glasses are also a potential feedstock for oxygen production, as many are rich in iron and titanium oxides that are optimal for oxygen extraction. To accomplish this task, a system of sensors and decision-making algorithms for an autonomous prospecting rover is described. One set of sensors will be located in the wheel tread of the robotic search vehicle providing contact sensor data on regolith composition. Another set of instruments will be housed on the platform of the rover, including VIS-NIR imagers and spectrometers, both for far-field context and near-field characterization of the regolith in the immediate vicinity of the rover. Also included in the sensor suite are a neutron spectrometer, ground-penetrating radar, and an instrumented cone penetrometer for subsurface assessment. Output from these sensors will be evaluated autonomously in real-time by decision-making software to evaluate if any of the targeted resources has been detected, and if so, to quantify their abundance. Algorithms for optimizing the mapping strategy based on target resource abundance and distribution are also included in the autonomous software. This approach emphasizes on-the-fly survey measurements to enable efficient and rapid prospecting of large areas, which will improve the economics of ISRU system approaches. The mature technology will enable autonomous rovers to create in-situ resource maps of lunar or other planetary surfaces, which will facilitate human and robotic exploration.

Dissly, R. W.↗

Global Retrieval of Cloud Particle Size and Optical Thickness Using ISCCP Data

The primary thrust of this investigation is to develop an algorithm to retrieve cloud particle sizes using ISCCP data. The research under this grant has been successful in obtaining initial results of global distribution of ice-particle sizes. Further research about possible problems caused by nonsphericity of ice particle sizes is currently underway. An algorithm of retrieving ice-cloud particle sizes using ISCCP CX data has been developed. The first survey of ice-particle size in a near-global scale has been completed. Comparison with in situ measurements of ice crystal sizes during FIRE I shows good agreement. The initial results show that the global mean size of ice crystals (De) is about 60 micron. This result is consistent with the range of in situ measurements all over the world if definitions of effective particle size are unified (see next section). The survey also shows that there is no distinct difference of ice-particle sizes between continental and maritime ice-clouds. There are many different definitions of effective particle size used in ice-cloud research. Simple comparisons between values of in situ measurement and satellite remote sensing are misleading and may lead to incorrect conclusions. We reviewed different definitions of effective particle sizes used in the literature and compared their relative magnitudes.

Welch, Ronald M.↗

GRB Diversity vs. Utility as Cosmological Probes

Recent detections of apparent gamma-ray burst (GRB) counterparts in optical and radio wavebands strongly favor the cosmological distance scale, at least for some GRBs, opening the possibility of GRBs serving as cosmological probes. But GRBs exhibit great diversity: in total duration; in number, width and pulse configuration; and in pulse and overall spectral evolution. However, it is possible that a portion of this behavior reflects a luminosity distribution, and possible that evolution of with cosmic time introduces dispersion into the average GRB characteristics -- issues analogous to those encountered with quasars. The temporal domain offers a rich avenue to investigate this problem. When corrected for assumed spectral redshift, time dilation of event durations, pulse widths, and intervals between pulses must yield the same time-dilation factor as a function of peak flux, or else a luminosity distribution may be the cause of observed time dilation effects. We describe results of burst analysis using an automated, Bayesian-based algorithm to determine burst temporal characteristics for different peak flux groups, and derived constraints on any physical process that would introduce a luminosity distribution.

Norris, J. P.↗

A reliable multicast for XTP

Multicast services needed for current distributed applications on LAN's fall generally into one of three categories: datagram, semi-reliable, and reliable. Transport layer multicast datagrams represent unreliable service in which the transmitting context 'fires and forgets'. XTP executes these semantics when the MULTI and NOERR mode bits are both set. Distributing sensor data and other applications in which application-level error recovery strategies are appropriate benefit from the efficiency in multidestination delivery offered by datagram service. Semi-reliable service refers to multicasting in which the control algorithms of the transport layer--error, flow, and rate control--are used in transferring the multicast distribution to the set of receiving contexts, the multicast group. The multicast defined in XTP provides semi-reliable service. Since, under a semi-reliable service, joining a multicast group means listening on the group address and entails no coordination with other members, a semi-reliable facility can be used for communication between a client and a server group as well as true peer-to-peer group communication. Resource location in a LAN is an important application domain. The term 'semi-reliable' refers to the fact that group membership changes go undetected. No attempt is made to assess the current membership of the group at any time--before, during, or after--the data transfer.

Dempsey, Bert J.↗

Evaluation of on-line pulse control for vibration suppression in flexible spacecraft

A numerical simulation was performed, by means of a large-scale finite element code capable of handling large deformations and/or nonlinear behavior, to investigate the suitability of the nonlinear pulse-control algorithm to suppress the vibrations induced in the Spacecraft Control Laboratory Experiment (SCOLE) components under realistic maneuvers. Among the topics investigated were the effects of various control parameters on the efficiency and robustness of the vibration control algorithm. Advanced nonlinear control techniques were applied to an idealized model of some of the SCOLE components to develop an efficient algorithm to determine the optimal locations of point actuators, considering the hardware on the SCOLE project as distributed in nature. The control was obtained from a quadratic optimization criterion, given in terms of the state variables of the distributed system. An experimental investigation was performed on a model flexible structure resembling the essential features of the SCOLE components, and electrodynamic and electrohydraulic actuators were used to investigate the applicability of the control algorithm with such devices in addition to mass-ejection pulse generators using compressed air.

Masri, Sami F.↗

Intercomparison of Various Algorithms in Determining Convective and Stratiform Precipitation

The paper presents the intercomparison of various algorithms in determining the convective and stratiform precipitation in tropical convection. The latent heat released from precipitation is the driving mechanism for the general circulation of the atmosphere and exhibits different vertical profile in convective and stratiform regimes of the tropical convection. The primary goal of this paper is to evaluate the performance of the operational convective/stratiform algorithm that is employed by the NASA Tropical Rainfall Measuring Mission (TRMM) ground validation program. The operational algorithm is based on the texture of radar reflectivity field at constant altitude. The TRMM ground validation program continuously monitors the tropical convection through ground based radar and rain gauge network at selected sites around the tropics and generates the rainfall products including the convective/stratiform rainfall map that can readily be used by the TRMM satellite program. An evaluation and improvement of these rainfall products requires additional measurements that can be available through field campaigns. The data used in this study was collected during the second phase of the Texas Florida Underflights (TEFLUN-B) field campaign in East Central Florida, a primary site of the TRMM ground validation program. The TEFLUN-B field campaign was conducted in August and September 1998 in support of the NASA Tropical Rainfall Measuring Mission (TRMM) satellite observations. An objective of the TEFLUN-B field campaign was to obtain the ground based precipitation measurements of Florida convection at different temporal and spatial scales. The field campaign had various components of precipitation measurements including dual wavelength precipitation profiler, various types of disdrometers and rain gauges, collocated about 40 km southwest of Melbourne NEXRAD radar. In this study, we examine the profiler based reflectivity and Doppler velocity and the disdrometer based drop size distribution observations to evaluate the operational scanning radar (i.e. NEXRAD) based convective/stratiform algorithm.

Tokay, Ali↗

Structured adaptive grid generation using algebraic methods

The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration of points to the grid redistribution scheme. The evaluation of the weighting mesh is accomplished by utilizing the weight function representing the solution variation and the equidistribution law. The selection of the weight function plays a key role in grid adaptation. A new weight function utilizing a properly weighted boolean sum of various flowfield characteristics is defined. The redistribution scheme is developed utilizing Non-Uniform Rational B-Splines (NURBS) representation. The application of NURBS representation results in a well distributed smooth grid by maintaining the fidelity of the geometry associated with boundary curves. Several algebraic methods are applied to smooth and/or nearly orthogonalize the grid lines. An elliptic solver is utilized to smooth the grid lines if there are grid crossings. Various computational examples of practical interest are presented to demonstrate the success of these methods.

Yang, Jiann-Cherng↗

The Application of New Software Technology to the Architecture of the National Cycle Program

As part of the Numerical Propulsion System Simulation (NPSS) effort of NASA Lewis in conjunction with the United States aeropropulsion industry, a new system simulation framework, the National Cycle Program (NCP), capable of combining existing empirical engine models with new detailed component-based computational models is being developed. The software architecture of the NCP program involves a generalized object- oriented framework and a base-set of engine component models along with supporting tool kits which will support engine simulation in a distributed environment. As the models are extended to contain two and three dimensions the computing load increases rapidly and it is intended that this load be distributed across multiple work stations executing concurrently in order to get acceptably fast results. The research carried out was directed toward performance analysis of the distributed object system. More specifically, the performance of the actor-based distributed object design I created earlier was desired. To this end, the research was directed toward the design and implementation of suitable performance-analysis techniques and software to demonstrate those techniques. There were three specific results which are reported in two separate reports submitted separately as NASA Technical Memoranda. The results are: (1) Design, implementation, and testing of a performance analysis program for a set of active objects (actor based objects) which allowed the individual actors to be assigned to arbitrary processes on an arbitrary set of machines. (2) The global-balance-equation approach has the fundamental limitation that the number of equations increases exponentially with the number of actors. Hence, unlike many approximate approaches to this problem, the nearest-neighbor approach allows checking of the solution and an estimate of the error. The technique was demonstrated in a prototype analysis program as part of this research. The results of the program were checked against the global-balance solution discussed above. Late during the grant, a much better approximation was developed and this is discussed in result below. As a consequence, a proposal was submitted to continue the research by developing the new approximation including development of a complete program from the prototype. (3) The source of approximation in the nearest-neighbor algorithm is the requirement for estimating some joint probabilities from some marginal distributions. A completely ad hoc estimate was used in the prototype.

Schoeffler, James D.↗

Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors

Two parallel algorithms for standard cell placement using simulated annealing are developed to run on distributed-memory message-passing hypercube multiprocessors. The cells can be mapped in a two-dimensional area of a chip onto processors in an n-dimensional hypercube in two ways, such that both small and large cell exchange and displacement moves can be applied. The computation of the cost function in parallel among all the processors in the hypercube is described, along with a distributed data structure that needs to be stored in the hypercube to support the parallel cost evaluation. A novel tree broadcasting strategy is used extensively for updating cell locations in the parallel environment. A dynamic parallel annealing schedule estimates the errors due to interacting parallel moves and adapts the rate of synchronization automatically. Two novel approaches in controlling error in parallel algorithms are described: heuristic cell coloring and adaptive sequence control.

Banerjee, Prithviraj↗

Accounting for the Effects of Surface BRDF on Satellite Cloud and Trace-Gas Retrievals: A New Approach Based on Geometry-Dependent Lambertian-Equivalent Reflectivity Applied to OMI Algorithms

Most satellite nadir ultraviolet and visible cloud, aerosol, and trace-gas algorithms make use of climatological surface reflectivity databases. For example, cloud and NO2 retrievals for the Ozone Monitoring Instrument (OMI) use monthly gridded surface reflectivity climatologies that do not depend upon the observation geometry. In reality, reflection of incoming direct and diffuse solar light from land or ocean surfaces is sensitive to the sun-sensor geometry. This dependence is described by the bidirectional reflectance distribution function (BRDF). To account for the BRDF, we propose to use a new concept of geometry-dependent Lambertian equivalent reflectivity (LER). Implementation within the existing OMI cloud and NO2 retrieval infrastructure requires changes only to the input surface reflectivity database. The geometry-dependent LER is calculated using a vector radiative transfer model with high spatial resolution BRDF information from the Moderate Resolution Imaging Spectroradiometer (MODIS) over land and the Cox-Munk slope distribution over ocean with a contribution from water-leaving radiance. We compare the geometry-dependent and climatological LERs for two wavelengths, 354 and 466 nm, that are used in OMI cloud algorithms to derive cloud fractions. A detailed comparison of the cloud fractions and pressures derived with climatological and geometry-dependent LERs is carried out. Geometry-dependent LER and corresponding retrieved cloud products are then used as inputs to our OMI NO2 algorithm. We find that replacing the climatological OMI-based LERs with geometry-dependent LERs can increase NO2 vertical columns by up to 50% in highly polluted areas; the differences include both BRDF effects and biases between the MODIS and OMI-based surface reflectance data sets. Only minor changes to NO2 columns (within 5 %) are found over unpolluted and overcast areas.

Lambert-equivalent reflectivity↗

Cloud cover estimation using bispectral satellite measurements

An algorithm has been developed for cloud cover estimation using bispectral satellite measurements. Based on the distribution of pixels in albedo-brightness temperature space, a number of threshold values are applied to identify those pixels which are most likely totally cloud filled. Mean cloudy-column albedo in a region much larger than a single pixel is then estimated and cloud cover computed. The algorithm has been applied to the International Satellite Cloud Climatology Project Geostationary Meteorological Satellite B2 data. Locations of tropical convective cells and the passage of fronts in higher latitudes are identified. Since these features represent the states of large-scale atmospheric circulations, it is concluded that the algorithm can yield consistent cloud data sets useful for climate studies.

Chou, M.-D.↗

Computational mechanics analysis tools for parallel-vector supercomputers

Computational algorithms for structural analysis on parallel-vector supercomputers are reviewed. These parallel algorithms, developed by the authors, are for the assembly of structural equations, 'out-of-core' strategies for linear equation solution, massively distributed-memory equation solution, unsymmetric equation solution, general eigen-solution, geometrically nonlinear finite element analysis, design sensitivity analysis for structural dynamics, optimization algorithm and domain decomposition. The source code for many of these algorithms is available from NASA Langley.

Storaasli, O. O.↗

Analytical and Computational Properties of Distributed Approaches to MDO

Historical evolution of engineering disciplines and the complexity of the MDO problem suggest that disciplinary autonomy is a desirable goal in formulating and solving MDO problems. We examine the notion of disciplinary autonomy and discuss the analytical properties of three approaches to formulating and solving MDO problems that achieve varying degrees of autonomy by distributing the problem along disciplinary lines. Two of the approaches-Optimization by Linear Decomposition and Collaborative Optimization-are based on bi-level optimization and reflect what we call a structural perspective. The third approach, Distributed Analysis Optimization, is a single-level approach that arises from what we call an algorithmic perspective. The main conclusion of the paper is that disciplinary autonomy may come at a price: in the bi-level approaches, the system-level constraints introduced to relax the interdisciplinary coupling and enable disciplinary autonomy can cause analytical and computational difficulties for optimization algorithms. The single-level alternative we discuss affords a more limited degree of autonomy than that of the bi-level approaches, but without the computational difficulties of the bi-level methods. Key Words: Autonomy, bi-level optimization, distributed optimization, multidisciplinary optimization, multilevel optimization, nonlinear programming, problem integration, system synthesis

Alexandrov, Natalia M.↗

Neural network for processing both spatial and temporal data with time based back-propagation

Neural networks are computing systems modeled after the paradigm of the biological brain. For years, researchers using various forms of neural networks have attempted to model the brain's information processing and decision-making capabilities. Neural network algorithms have impressively demonstrated the capability of modeling spatial information. On the other hand, the application of parallel distributed models to the processing of temporal data has been severely restricted. The invention introduces a novel technique which adds the dimension of time to the well known back-propagation neural network algorithm. In the space-time neural network disclosed herein, the synaptic weights between two artificial neurons (processing elements) are replaced with an adaptable-adjustable filter. Instead of a single synaptic weight, the invention provides a plurality of weights representing not only association, but also temporal dependencies. In this case, the synaptic weights are the coefficients to the adaptable digital filters. Novelty is believed to lie in the disclosure of a processing element and a network of the processing elements which are capable of processing temporal as well as spacial data.

Villarreal, James A.↗

Optimal parallel evaluation of AND trees

A quantitative analysis based on both preemptive and nonpreemptive critical-path scheduling algorithms is presently conducted for the optimal degree of parallelism required in evaluating a given AND tree. The optimal degree of parallelism is found to depend on problem complexity, precedence-graph shape, and task-time distribution along each path. In addition to demonstrating the optimality of the preemptive critical-path scheduling algorithm for evaluating an arbitrary AND tree on a fixed number of processors, the possibility of efficiently ascertaining tight bounds on the number of processors for optimal processor-time efficiency is illustrated.

Wah, Benjamin W.↗