Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,189 records · Page 66

TPSAS-NF1676L-23557-DND

The Cloud-Aerosol LIdar with Orthogonal Polarization (CALIOP) measures both parallel and perpendicular backscatter of linearly polarized 532 nm light from cloud particles in the atmosphere. The perpendicular component of the return signal allows differentiation between cloud layers consisting of spherical water droplets from those with non-spherical ice particles. A two-way distribution of layer-integrated 532 nm total backscatter and the layer-integrated 532 nm depolarization ratio further differentiates between water cloud layers with significant multiple scattering, horizontally-oriented ice particles that cause specular reflections, and randomly-oriented ice particles, as described in Hu et al., 2009. The cloud phase algorithm functions well for the majority of clouds, but there have been some recent changes and improvements that are described in this poster. The impact of the CALIOP viewing angle change from near-nadir (0.3 degrees) to slightly tilted (3.0 degrees) on the optical properties of the various CALIOP cloud particle phases is also shown. A major improvement to the phase algorithm is the limitation of a spatial coherence test for horizontally-oriented ice to cloud layers that have sufficient integrated attenuated backscatter to likely contain HOI. This change reduces a "striping" effect caused by noisiness in the spatial coherence test for thin cloud layers. Additional temperature tests are considered, and the regional and vertical distribution of cloud layers with the various CALIOP cloud phases is shown. Only one cloud particle phase is allowed for each 5 km portion of a cloud layer that is considered by the cloud phase algorithm, so we use in situ aircraft and CloudSat observations to determine how the CALIOP cloud phase algorithm is treating optically and thermally thick clouds, which may be mixed-phase.

Melody Avery↗

An Integrated Data Analytics Platform

An Integrated Science Data Analytics Platform is an environment that enables the confluence of resources for scientific investigation. It harmonizes data, tools and computational resources which subsequently enable the research community to focus on the investigation rather than spending time on security, data preparation, management, etc. OceanWorks is a NASA technology integration project to establish a cloud-based Integrated Ocean Science Data Analytics Platform at NASA’s Physical Oceanography Distributed Active Archive Center (PO.DAAC) for big ocean science. It focuses on advancement and maturity by bringing together several NASA open-source, big data projects for parallel analytics, anomaly detection, in-situ to satellite data matchup, quality-screened data subsetting, search relevancy, and data discovery. Our communities are relying on data distributed through data centers such as the PO.DAAC, COAPS, NCAR, and many others to conduct their research. In typical investigations, scientists would engage in: search for data, evaluate the relevance of that data, download it, and then apply algorithms to identify trends. Such workflow cannot scale if the research involves a massive amount of data or multi-variate measurements. NASA’s Surface Water and Ocean Topography (SWOT) mission is expected to produce massive amount of observational data during its 3-year nominal mission. Collections like SWOT challenges all existing Earth Science data archival, distribution and analysis paradigms. In this paper, we will discuss how OceanWorks enhances the analysis of physical ocean data where the computation is done on an elastic cloud platform next to the archive to deliver fast, web-accessible services for working with oceanographic measurements.

Yang, Chaowei↗

A Single-Lap Joint Adhesive Bonding Optimization Method Using Gradient and Genetic Algorithms

A natural process for any engineer, scientist, educator, etc. is to seek the most efficient method for accomplishing a given task. In the case of structural design, an area that has a significant impact on the structural efficiency is joint design. Unless the structure is machined from a solid block of material, the individual components which compose the overall structure must be joined together. The method for joining a structure varies depending on the applied loads, material, assembly and disassembly requirements, service life, environment, etc. Using both metallic and fiber reinforced plastic materials limits the user to two methods or a combination of these methods for joining the components into one structure. The first is mechanical fastening and the second is adhesive bonding. Mechanical fastening is by far the most popular joining technique; however, in terms of structural efficiency, adhesive bonding provides a superior joint since the load is distributed uniformly across the joint. The purpose of this paper is to develop a method for optimizing single-lap joint adhesive bonded structures using both gradient and genetic algorithms and comparing the solution process for each method. The goal of the single-lap joint optimization is to find the most efficient structure that meets the imposed requirements while still remaining as lightweight, economical, and reliable as possible. For the single-lap joint, an optimum joint is determined by minimizing the weight of the overall joint based on constraints from adhesive strengths as well as empirically derived rules. The analytical solution of the sin-le-lap joint is determined using the classical Goland-Reissner technique for case 2 type adhesive joints. Joint weight minimization is achieved using a commercially available routine, Design Optimization Tool (DOT), for the gradient solution while an author developed method is used for the genetic algorithm solution. Results illustrate the critical design variables as a function of adhesive properties and convergences of different joints based on the two optimization methods.

Smeltzer, Stanley S., III↗

Employing Relaxed Smoothness Constraints on Imaginary Part of Refractive Index in AERONET Aerosol Retrieval Algorithm

In the Aerosol Robotic Network (AERONET) retrieval algorithm, smoothness constraints on the imaginary part of the refractive index provide control of retrieved spectral dependence of aerosol absorption by preventing the inversion code from fitting the noise in optical measurements and thus avoiding unrealistic oscillations of retrievals with wavelength. The history of implementation of the smoothness constraints in the AERONET retrieval algorithm is discussed. It is shown that the latest version of the smoothness constraints on the imaginary part of refractive index, termed standard and employed by Version 3 of the retrieval algorithm, should be modified to account for strong variability of light absorption by brown-carbon-containing aerosols in UV through mid-visible parts of the solar spectrum. In Version 3 strong spectral constraints were imposed at high values of the Ångström exponent (440–870 nm) since black carbon was assumed to be the primary absorber, while the constraints became increasingly relaxed as aerosol exponent deceased to allow for wavelength dependence of absorption for dust aerosols. The new version of the smoothness constraints on the imaginary part of the refractive index assigns different weights to different pairs of wavelengths, which are the same for all values of the Ångström exponent. For example, in the case of four-wavelength input, the weights assigned to short-wavelength pairs (440–675, 675–870 nm) are small so that smoothness constraints do not suppress natural spectral variability of the imaginary part of the refractive index. At longer wavelengths (870–1020 nm), however, the weight is 10 times higher to provide additional constraints on the imaginary part of refractive index retrievals of aerosols with a high Ångström exponent due to low sensitivity to aerosol absorption for longer channels at relatively low aerosol optical depths. The effect of applying the new version of smoothness constraints, termed relaxed, on retrievals of single-scattering albedo is analyzed for case studies of different aerosol types: black- and brown-carbon-containing fine mode aerosols, mineral dust coarse mode aerosols, and urban industrial fine mode aerosol. It is shown that for brown-carbon-containing aerosols employing the relaxed smoothness constraints resulted in significant reduction in retrieved single-scattering albedo and spectral residual errors (compared to standard) at the short wavelengths. For example, biomass burning smoke cases showed a reduction in single-scattering albedo and spectral residual error at 380 nm of ∼ 0.033 and ∼ 17 %, respectively, for the Rexburg site and ∼ 0.04 and ∼ 12.7 % for the Rimrock site, both AERONET sites in Idaho, USA. For a site with very high levels of black-carbon-containing aerosols (Mongu, Zambia), the effect of modification in the smoothness constraints was minor. For mineral dust aerosols at small Ångström exponent values (Mezaira site, UAE), the spectral constraint on the imaginary part of the refractive index was already relaxed in Version 3; therefore the new relaxed constraint results in minimal change. In the case of weakly absorbing urban industrial aerosols at the GSFC site, there are significant changes in retrieved single-scattering albedo using relaxed assumption, especially reductions at longer wavelengths: ∼ 0.016 and ∼ 0.02 at 875 and 1020 nm, respectively, for 440 nm aerosol optical depth (AOD) ∼ 0.3. The modification of smoothness constraints on the imaginary part of the refractive index has a minor effect on retrievals of other aerosol parameters such as the real part of the refractive index and parameters of the aerosol size distribution. The implementation of the relaxed smoothness constraints on the imaginary part of the refractive index in the next version of the AERONET inversion algorithm will produce significant impacts at some sites in short wavelength channels (380 and 440 nm) for some biomass burning smoke cases with significant brown carbon content and possibly in mid-visible channels (500 and 675 nm) to near-infrared channels (870 to 1020 nm) for some urban industrial aerosol types. However, most differences in single-scattering albedo retrievals between those applying the new relaxed constraint and the standard constraint will be within the uncertainty of the single-scattering albedo retrievals, depending on the level of aerosol optical depth, Ångström exponent, brown carbon content and wavelength.

Aliaksandr Siniuk↗

Snow Depth from AMSR-2 Using Multispectral Satellite Data in an Artificial Neural Network

By using diffusion theory and Monte Carlo lidar radiative transfer simulations, Hu et al. (2022b) has derived snow depth from the first-, second- and third-order moments of the lidar backscattering pathlength distribution. Lu et al. (2022) calculated the snow depth by applying the methods to the satellite ICESat-2 lidar measurements over the Arctic sea ice, as well as land surfaces of Northern Hemisphere. In this paper, an artificial neural network (ANN) algorithm, employing several channels from Advanced Microwave Scanning Radiometer 2 (AMSR-2) and the humidity vertical profiles from Global Modeling and Assimilation Office (GMAO) Goddard Earth Observing System for Instrument Teams (GEOS-IT) product, is trained to determine snow depth identified by time and geolocation matched 2019 ICESat-2 snow-depth data during winter months over the Arctic sea ice. The trained ANN snow-depth was applied to 2018 AMSR-2 clear pixel data, although the algorithms perform reasonably well in thinner clouds. The validation data (different from the training set) of ANN snow depth from AMSR-2 showed a good agreement with time matched and co-located snow-depth values from ICESat-2. The bias was near zero, with mean absolute error (MAE) 0.05 cm and a root-mean-square-error (RMSE) 0.08 cm. Prior applying the trained ANN snow depth to AMSR-2 data, a cloud screening algorithm was developed with a similar approach. A separate ANN cloud mask was trained to determine an AMSR-2 pixel is clear or cloudy with time and geolocation matched 2015 CALIOP Vertical Feature Mask (VFM) over Arctic sea ice. The ANN cloud mask from AMSR-2 under-estimated cloud fraction by 3-6% compared to CALIOP . The additional research is needed to conclusively evaluate the ANN cloud mask accuracy. Finally, this paper will lay the foundation for a sustained long-term snowfall and snow-storm monitoring system. The future Cloud Aerosol LIdar for Global scale Observations of the ocean-Land Atmosphere system (CALIGOLA) mission will provide a means to calculate snow depth from the lidar backscattering pathlength distribution, benefiting from the UV, visible and infrared pulses. With the calculated snow depth as the truth one could develop a machine learning algorithm, as it was done in this paper, using a passive microwave instrument available at that time to generate a wide range of snow depth data, covering extensive spatial areas in the cross-orbit direction.

Neural Network↗

Development of a space-systems network testbed

This paper describes a communications network testbed which has been designed to allow the development of architectures and algorithms that meet the functional requirements of future NASA communication systems. The central hardware components of the Network Testbed are programmable circuit switching communication nodes which can be adapted by software or firmware changes to customize the testbed to particular architectures and algorithms. Fault detection, isolation, and reconfiguration has been implemented in the Network with a hybrid approach which utilizes features of both centralized and distributed techniques to provide efficient handling of faults within the Network.

Lala, Jaynarayan↗

Task reports on developing techniques for scattering by 3D composite structures and to generate new solutions in diffraction theory using higher order boundary conditions

There are two tasks described in this report. First, an extension of a two dimensional formulation is presented for a three dimensional body of revolution. With the introduction of a Fourier expansion of the vector electric and magnetic fields, a coupled two dimensional system is generated and solved via the finite element method. An exact boundary condition is employed to terminate the mesh and the fast fourier transformation is used to evaluate the boundary integrals for low O(n) memory demand when an iterative solution algorithm is used. Second, the diffraction by a material discontinuity in a thick dielectric/ferrite layer is considered by modeling the layer as a distributed current sheet obeying generalized sheet transition conditions (GSTC's).

Volakis, John L.↗

Some fast elliptic solvers on parallel architectures and their complexities

The discretization of separable elliptic partial differential equations leads to linear systems with special block triangular matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconsistant coefficients. A method was recently proposed to parallelize and vectorize BCR. Here, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches, including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational complexity lower than that of parallel BCR.

Gallopoulos, E.↗

Earth observing system. Output data products and input requirements, version 2.0. Volume 1: Instrument data product characteristics

Information on Earth Observing System (EOS) output data products and input data requirements that has been compiled by the Science Processing Support Office (SPSO) at GSFC is presented. Since Version 1.0 of the SPSO Report was released in August 1991, there have been significant changes in the EOS program. In anticipation of a likely budget cut for the EOS Project, NASA HQ restructured the EOS program. An initial program consisting of two large platforms was replaced by plans for multiple, smaller platforms, and some EOS instruments were either deselected or descoped. Updated payload information reflecting the restructured EOS program superseding the August 1991 version of the SPSO report is included. This report has been expanded to cover information on non-EOS data products, and consists of three volumes (Volumes 1, 2, and 3). Volume 1 provides information on instrument outputs and input requirements. Volume 2 is devoted to Interdisciplinary Science (IDS) outputs and input requirements, including the 'best' and 'alternative' match analysis. Volume 3 provides information about retrieval algorithms, non-EOS input requirements of instrument teams and IDS investigators, and availability of non-EOS data products at seven primary Distributed Active Archive Centers (DAAC's).

Lu, Yun-Chi↗

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on an MIMD (multiple instruction/multiple data stream) parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed, one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the iPSC/860.

Venkatakrishnan, V.↗

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on a multiple-instruction/multiple-data stream parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed: one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All of the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the Intel iPSC/860.

TRT-THEORETICAL↗

Integration of On-board EOS Schedule Revision with Space Communication Emulation System

The need for on-board decision-making for planning science observations on Earth Observing Satellites is based on the fact that the desirability of acquiring an image can change dynamically, because of changes in meteorological conditions (e.g. cloud cover), unforeseen events such as fires, floods, or volcanic eruptions, or unexpected changes in satellite or ground station capability. In such cases, satellite resources, such as power and SSR capacity can potentially be better utilized taking another image that is of higher quality. Currently, typical Earth observing satellites cannot communicate directly with each other, and can only communicate with ground stations about 5% to 10% of the time. Because of the limited communication windows, as well as the cost and effort that would need to be expended in revising a mission schedule, a ground-based scheduler would have little or no opportunity to revise the schedule in response to the contingencies that may arise. For this reason, a distributed science planning system combining a ground-based scheduler with on-board schedule revision capabilities is warranted. This paper will describe algorithms for on-board decision-making for science planning and their integration with the advanced satellite control and communications technology developed at the Space Communication Emulation Facility (SCEF) at NASA Glenn Research Center. Our objective of demonstrating how advanced communications and scheduling technology can be combined to improve the scientific utility of images acquired by Earth observing systems will be discussed via a description of a number of realistic flight scenarios.

Khatib, Lina↗

A computational-grid based system for continental drainage network extraction using SRTM digital elevation models

We describe a new effort for the computation of elevation derivatives using the Shuttle Radar Topography Mission (SRTM) results. Jet Propulsion Laboratory's (JPL) SRTM has produced a near global database of highly accurate elevation data. The scope of this database enables computing precise stream drainage maps and other derivatives on Continental scales. We describe a computing architecture for this computationally very complex task based on NASA's Information Power Grid (IPG), a distributed high performance computing network based on the GLOBUS infrastructure. The SRTM data characteristics and unique problems they present are discussed. A new algorithm for organizing the conventional extraction algorithms [1] into a cooperating parallel grid is presented as an essential component to adapt to the IPG computing structure. Preliminary results are presented for a Southern California test area, established for comparing SRTM and its results against those produced using the USGS National Elevation Data (NED) model.

stream extraction↗

Weather, Climate, and Society: New Demands on Science and Services

A new algorithm has been constructed to estimate the path length of lightning channels for the purpose of improving the model predictions of lightning NOx in both regional air quality and global chemistry/climate models. This algorithm was tested and applied to VHF signals detected by the North Alabama Lightning Mapping Array (NALMA). The accuracy of the algorithm was characterized by comparing algorithm output to the plots of individual discharges whose lengths were computed by hand. Several thousands of lightning flashes within 120 km of the NALMA network centroid were gathered from all four seasons, and were analyzed by the algorithm. The mean, standard deviation, and median statistics were obtained for all the flashes, the ground flashes, and the cloud flashes. Channel length distributions were also obtained for the different seasons.

Source record↗

Eye Tracking Metrics for Workload Estimation in Flight Deck Operation

Flight decks of the future are being enhanced through improved avionics that adapt to both aircraft and operator state. Eye tracking allows for non-invasive analysis of pilot eye movements, from which a set of metrics can be derived to effectively and reliably characterize workload. This research identifies eye tracking metrics that correlate to aircraft automation conditions, and identifies the correlation of pilot workload to the same automation conditions. Saccade length was used as an indirect index of pilot workload: Pilots in the fully automated condition were observed to have on average, larger saccadic movements in contrast to the guidance and manual flight conditions. The data set itself also provides a general model of human eye movement behavior and so ostensibly visual attention distribution in the cockpit for approach to land tasks with various levels of automation, by means of the same metrics used for workload algorithm development.

Ellis, Kyle↗

Fully Automated Detection of Cloud and Aerosol Layers in the CALIPSO Lidar Measurements

Accurate knowledge of the vertical and horizontal extent of clouds and aerosols in the earth s atmosphere is critical in assessing the planet s radiation budget and for advancing human understanding of climate change issues. To retrieve this fundamental information from the elastic backscatter lidar data acquired during the Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO) mission, a selective, iterated boundary location (SIBYL) algorithm has been developed and deployed. SIBYL accomplishes its goals by integrating an adaptive context-sensitive profile scanner into an iterated multiresolution spatial averaging scheme. This paper provides an in-depth overview of the architecture and performance of the SIBYL algorithm. It begins with a brief review of the theory of target detection in noise-contaminated signals, and an enumeration of the practical constraints levied on the retrieval scheme by the design of the lidar hardware, the geometry of a space-based remote sensing platform, and the spatial variability of the measurement targets. Detailed descriptions are then provided for both the adaptive threshold algorithm used to detect features of interest within individual lidar profiles and the fully automated multiresolution averaging engine within which this profile scanner functions. The resulting fusion of profile scanner and averaging engine is specifically designed to optimize the trade-offs between the widely varying signal-to-noise ratio of the measurements and the disparate spatial resolutions of the detection targets. Throughout the paper, specific algorithm performance details are illustrated using examples drawn from the existing CALIPSO dataset. Overall performance is established by comparisons to existing layer height distributions obtained by other airborne and space-based lidars.

Vaughan, Mark A.↗

The GLAS Science Algorithm Software (GSAS) Detailed Design Document Version 6

The Geoscience Laser Altimeter System (GLAS) is the primary instrument for the ICESat (Ice, Cloud and Land Elevation Satellite) laser altimetry mission. ICESat was the benchmark Earth Observing System (EOS) mission for measuring ice sheet mass balance, cloud and aerosol heights, as well as land topography and vegetation characteristics. From 2003 to 2009, the ICESat mission provided multi-year elevation data needed to determine ice sheet mass balance as well as cloud property information, especially for stratospheric clouds common over polar areas. It also provided topography and vegetation data around the globe, in addition to the polar-specific coverage over the Greenland and Antarctic ice sheets.This document describes the detailed design of GLAS Science Algorithm Software (GSAS). The GSAS is used to create the ICESat GLAS standard data products. The National Snow and Ice Data Center (NSDIC) distribute these products. The document contains descriptions, flow charts, data flow diagrams, and structure charts for each major component of the GSAS. The purpose of this document is to present the detailed design of the GSAS. It is intended as a reference source to assist the maintenance programmer in making changes that fix or enhance the documented software.

Lee, Jeffrey E.↗

The Use of Software Agents for Autonomous Control of a DC Space Power System

In order to enable manned deep-space missions, the spacecraft must be controlled autonomously using on-board algorithms. A control architecture is proposed to enable this autonomous operation for an spacecraft electric power system and then implemented using a highly distributed network of software agents. These agents collaborate and compete with each other in order to implement each of the control functions. A subset of this control architecture is tested against a steadystate power system simulation and found to be able to solve a constrained optimization problem with competing objectives using only local information.

autonomous control↗