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,171 records · Page 65

Weather prediction using a genetic memory

Kanaerva's sparse distributed memory (SDM) is an associative memory model based on the mathematical properties of high dimensional binary address spaces. Holland's genetic algorithms are a search technique for high dimensional spaces inspired by evolutional processes of DNA. Genetic Memory is a hybrid of the above two systems, in which the memory uses a genetic algorithm to dynamically reconfigure its physical storage locations to reflect correlations between the stored addresses and data. This architecture is designed to maximize the ability of the system to scale-up to handle real world problems.

Rogers, David↗

Redundant Disk Arrays in Transaction Processing Systems

We address various issues dealing with the use of disk arrays in transaction processing environments. We look at the problem of transaction undo recovery and propose a scheme for using the redundancy in disk arrays to support undo recovery. The scheme uses twin page storage for the parity information in the array. It speeds up transaction processing by eliminating the need for undo logging for most transactions. The use of redundant arrays of distributed disks to provide recovery from disasters as well as temporary site failures and disk crashes is also studied. We investigate the problem of assigning the sites of a distributed storage system to redundant arrays in such a way that a cost of maintaining the redundant parity information is minimized. Heuristic algorithms for solving the site partitioning problem are proposed and their performance is evaluated using simulation. We also develop a heuristic for which an upper bound on the deviation from the optimal solution can be established.

Mourad, Antoine Nagib↗

Truncated Gaussians as tolerance sets

This work focuses on the use of truncated Gaussian distributions as models for bounded data measurements that are constrained to appear between fixed limits. The authors prove that the truncated Gaussian can be viewed as a maximum entropy distribution for truncated bounded data, when mean and covariance are given. The characteristic function for the truncated Gaussian is presented; from this, algorithms are derived for calculation of mean, variance, summation, application of Bayes rule and filtering with truncated Gaussians. As an example of the power of their methods, a derivation of the disparity constraint (used in computer vision) from their models is described. The authors' approach complements results in Statistics, but their proposal is not only to use the truncated Gaussian as a model for selected data; they propose to model measurements as fundamentally in terms of truncated Gaussians.

Cozman, Fabio↗

Challenges Facing Design and Analysis Tools

The design and analysis of future aerospace systems will strongly rely on advanced engineering analysis tools used in combination with risk mitigation procedures. The implications of such a trend place increased demands on these tools to assess off-nominal conditions, residual strength, damage propagation, and extreme loading conditions in order to understand and quantify these effects as they affect mission success. Advances in computer hardware such as CPU processing speed, memory, secondary storage, and visualization provide significant resources for the engineer to exploit in engineering design. The challenges facing design and analysis tools fall into three primary areas. The first area involves mechanics needs such as constitutive modeling, contact and penetration simulation, crack growth prediction, damage initiation and progression prediction, transient dynamics and deployment simulations, and solution algorithms. The second area involves computational needs such as fast, robust solvers, adaptivity for model and solution strategies, control processes for concurrent, distributed computing for uncertainty assessments, and immersive technology. Traditional finite element codes still require fast direct solvers which when coupled to current CPU power enables new insight as a result of high-fidelity modeling. The third area involves decision making by the analyst. This area involves the integration and interrogation of vast amounts of information - some global in character while local details are critical and often drive the design. The proposed presentation will describe and illustrate these areas using composite structures, energy-absorbing structures, and inflatable space structures. While certain engineering approximations within the finite element model may be adequate for global response prediction, they generally are inadequate in a design setting or when local response prediction is critical. Pitfalls to be avoided and trends for emerging analysis tools will be described.

Knight, Norman F., Jr.↗

Protein Kinase Classification with 2866 Hidden Markov Models and One Support Vector Machine

The main application considered in this paper is predicting true kinases from randomly permuted kinases that share the same length and amino acid distributions as the true kinases. Numerous methods already exist for this classification task, such as HMMs, motif-matchers, and sequence comparison algorithms. We build on some of these efforts by creating a vector from the output of thousands of structurally based HMMs, created offline with Pfam-A seed alignments using SAM-T99, which then must be combined into an overall classification for the protein. Then we use a Support Vector Machine for classifying this large ensemble Pfam-Vector, with a polynomial and chisquared kernel. In particular, the chi-squared kernel SVM performs better than the HMMs and better than the BLAST pairwise comparisons, when predicting true from false kinases in some respects, but no one algorithm is best for all purposes or in all instances so we consider the particular strengths and weaknesses of each.

Weber, Ryan↗

Symmetric normal mixtures

We consider mixture density estimation under the symmetry constraint x = Az for an orthogonal matrix A. This distributional constraint implies a corresponding constraint on the mixture parameters. Focusing on the gaussian case, we derive an expectation-maximization (EM) algorithm to enforce the constraint and show results for modeling of image feature vectors.

symmetry constraint↗

Implementation of an Integrated On-Board Aircraft Engine Diagnostic Architecture

An on-board diagnostic architecture for aircraft turbofan engine performance trending, parameter estimation, and gas-path fault detection and isolation has been developed and evaluated in a simulation environment. The architecture incorporates two independent models: a realtime self-tuning performance model providing parameter estimates and a performance baseline model for diagnostic purposes reflecting long-term engine degradation trends. This architecture was evaluated using flight profiles generated from a nonlinear model with realistic fleet engine health degradation distributions and sensor noise. The architecture was found to produce acceptable estimates of engine health and unmeasured parameters, and the integrated diagnostic algorithms were able to perform correct fault isolation in approximately 70 percent of the tested cases

Armstrong, Jeffrey B.↗

The GPM Combined Algorithm

In this paper, the operational Global Precipitation Measurement (GPM) mission combined radar-radiometer algorithm is thoroughly described. The operational combined algorithm is designed to reduce uncertainties in GPM Core Observatory precipitation estimates by effectively integrating complementary information from the GPM Dual-Frequency Precipitation Radar (DPR) and the GPM Microwave Imager (GMI) into an optimal, physically consistent precipitation product. Although similar in many respects to previously developed combined algorithms, the GPM combined algorithm has several unique features that are specifically designed to meet the GPM objectives of deriving, based on GPM Core Observatory information, accurate and physically consistent precipitation estimates from multiple spaceborne instruments, and ancillary environmental data from reanalyses. The algorithm features an optimal estimation framework based on a statistical formulation of the Gauss-Newton method, a parameterization for the nonuniform distribution of precipitation within the radar fields of view, a methodology to detect and account for multiple scattering in Ka-band DPR observations, and a statistical deconvolution technique that allows for an efficient sequential incorporation of radiometer information into DPR precipitation retrievals.

Grecu, Mircea↗

Improving the SMAP Level-4 Soil Moisture Product

The NASA Soil Moisture Active Passive (SMAP) mission generates, among other data sets, the Level 4 Soil Moisture (L4 SM) product. The L4 SM algorithm is based on the assimilation of SMAP radiometer brightness temperature observations into the NASA Catchment land surface model using a spatially distributed ensemble Kalman filter. The L4 SM data are published with a mean latency of approx. 2.5 days from the time of observation and provide global, three-hourly, 9 km resolution estimates of surface and root-zone soil moisture and related land surface states and fluxes. In 2018, the product was upgraded from Version 3 to Version 4. Underlying the new version is a revised modeling system that includes improved input parameter datasets for land cover, topography, and vegetation height that are based on recent, high quality space-borne remote sensing observations. Land cover inputs were updated to the GlobCover2009 product, which is based on satellite observations from the Medium Resolution Imaging Spectrometer. Topographic statistics now rely on observations from the Shuttle Radar Topography Mission. Finally, vegetation height inputs are derived from space-borne Lidar measurements. Additionally, SMAP Level-2 soil moisture retrievals and in situ soil moisture measurements were used to calibrate a particular Catchment model parameter that governs the recharge of soil moisture from the models root-zone excess reservoir into the surface excess reservoir. Specifically, the replenishment of soil moisture near the surface from below under non-equilibrium conditions was substantially reduced, which brings the models surface soil moisture more in line with the SMAP Level 2 and in situ soil moisture. Finally, the calibration of the assimilated SMAP brightness temperatures changed substantially from Version 3 to Version 4. Considerable effort went into the version upgrade, creating an expectation that the new version is improved over the old version. Indeed, some aspects of the new version are clearly better. However, other aspects are not, and on balance, the overall improvement is modest at best. In this presentation we summarize the skill of the new and old versions vs. independent in situ measurements and in terms of data assimilation diagnostics, including, for example, the statistics of the (soil moisture) analysis increments and the observation minus forecast (brightness temperatures) residuals. We share our experience with trying to improve to the L4 SM product and the lessons learned from the effort.

Reichle, Rolf↗

Thermal Hydraulic Disaggregation of SMAP Soil Moisture Over the Continental United States

Thermal Hydraulic disaggregation of Soil Moisture (THySM) algorithm was implemented to downscale NASA’s Soil Moisture Active Passive (SMAP) Enhanced soil moisture (SM) product to 1 km over the continental United States (CONUS). This algorithm was developed by combining thermal inertia theory with a soil hydraulic-based approach that considers fine-scale SM spatial distribution driven by both heat fluxes and hydraulic conductivity in soils. Relative soil wetness values were estimated using land surface temperature and normalized difference vegetation index for the thermal inertia model and using soil properties for the hydraulic model. The relative soil wetness values at 1 km from both models were then combined by using weighting functions whereby the spatial distribution of SM was governed more by thermal fluxes during times of strong heat transport and infiltration during moisture abundant soil conditions. THySM values were evaluated using in situ SM measurements from SMAP Core Validation Sites (CVS), the USDA Soil Climate Analysis Network, and the NOAA Climate Reference Network over CONUS. THySM shows higher accuracy than the SMAP / Sentinel-1 (SPL2SMAP_S) 1 km SM product when compared to in situ measurements. The accuracy of THySM is 0.048 m3/m3 based on unbiased root mean square error (ubRMSE), outperforming SPL2SMAP_S by 0.01-0.02 m3/m3. The ubRMSE of THySM 1km SM over the SMAP grassland/rangeland-dominated CVS sites is better than 0.04 m3/m3, which meets the SMAP mission SM accuracy requirement applied at 9 and 36 km.

SMAP↗

NASA's Moon to Mars Autonomous Habitat Status

NASA is developing a strategy for sending humans to the Mars vicinity, known broadly as the Moon to Mars (M2M) Campaign. A critical part of this campaign is the development of in-space and surface habitation systems capable of substantially extending human presence beyond Low Earth Orbit (LEO). Mars missions feature an in-space transit habitat capable of supporting crews of four on ~850-1200-day missions, including transit to and from Mars and time in Mars orbit. Surface and transit habitats are complex elements which must keep crewmembers healthy and productive in deep-space environments with limited resources, long rescue times in contingency situations, and communication delays; all within constrained mass, volume, and power budgets. These habitats provide crew both living and workspace as well as most of the resources needed to support crew life. For deep space habitats, automation needs to be employed due to latency and for significant amounts of time when the habitats are uncrewed. Automation of systems is possible in space applications, but there are limitations. Outside of the Earth’s (or any) magnetosphere, radiation environments are harsh to both the physical hardware and the software components. Radiation (charged particles and ionizing electromagnetic waves) degrades and damages the hardware and causes single event upsets (SEUs) in software. If the hardware is damaged, data can be lost, or control actions not made. For software, SEUs cause algorithms to result in different solutions, or incorrect commands to be sent out. This means that algorithms and hardware used for deep space systems are different than what is used on Earth. Radiation-tolerant hardware is generations behind the current state-of-the-art hardware. Recent NASA missions, such as James Webb Space Telescope, continue to rely on older technologies such as the RAD750 processor, and the most advanced processors are still single core and less than 1.5 GHz. There have been attempts to use higher performance processors, but these often take multiple mitigation steps to handle the radiation environments, which limits the processing power and/or throughput. Current techniques for radiation mitigation have been redundancies, voting, physical separation of hardware, encasing materials, under-clocking hardware, and more. Some radiation mitigation techniques do provide benefits such as having a redundant system to improve the probability that a system will be available when needed. Autonomous software systems will have fewer interactions with humans on deep space missions and therefore need to be able to handle more off-nominal conditions. Microgravity also complicates the autonomous aspects of the mission because autonomous systems are usually built from known deterministic states, but microgravity causes physical objects to shift and move changing the location an autonomous system placed the object. Not only does the software need to be reliable and deterministic, losing resources due to a software error is not only costly but detrimental to reputation. The combination of having lower performance hardware and having to be able to verify and deterministically run software and an ever-changing environment makes deep space autonomous systems more complicated. Multiple gaps have been identified including verification of autonomous software algorithms (including artificial intelligence and machine learning), higher performance processors (graphics and general purpose), high speed networks (onboard and transmissions), memory, power distribution, data security, and variations from these. These gaps need to be closed for more advanced systems to be deployed and reduce the size, weight, and power impacts on the habitats.

Scott B. Tashakkor↗

Improvements to the Simulated CubeSpark Satellite Constellation and Their Effects on Lightning Geolocation Accuracy from Orbit

The CubeSpark mission concept is being developed as a constellation of up to six satellites in low-Earth orbit (LEO) for high resolution 3D lightning mapping using optical and radio frequency (RF) sensors. Individual lightning VHF signals are simulated from Earth’s atmosphere through the ionosphere to each satellite, using their arrival times to reconstruct source locations. Here we present recent updates to these simulations based on improved ionospheric modeling, with a focus on the expected three-dimensional resolution. These studies include testing from the equator up to high latitudes, with varying vertical total electron content (vTEC), and using between one and six orbiting stations. In addition to the more robust ionosphere model, the constellation formation has also been updated to reduce its resulting errors and increase the effective range of VHF geolocation from space. The goals of CubeSpark include mapping thundercloud charge structure as well as lightning channel lengths relevant to climatology, meteorology, and more. These applications require location uncertainty less than 1-2 km in each dimension. This improved algorithm shows sufficient resolution up to high latitudes, including significantly larger areas having 3D resolution less than 1 km. Analysis of the distributions of biases in simulated arrival times has also revealed the unexpected relationship between the shape of those distributions and the resulting uncertainties. This work helps to refine our understanding of the sources of error in lightning geolocation and reinforces the potential for post-processing improvements in this and other similar systems.

Lightning↗

Lila: Optimal Dispatching in Probabilistic Temporal Networks using Monte Carlo Tree Search

Executing a Probabilistic Simple Temporal Network (PSTN) amounts at scheduling, i.e. \textit{dispatch}, a set of events under time uncertainty. This constitutes a NP-hard online optimization problem. The right execution time must be dynamically assigned to each event of the PSTN such that the temporal constraints are met, whereas activity durations are progressively observed as the execution unfolds. We propose a dispatching algorithm based on Monte Carlo Tree Search, called Lila, with the following characteristics: (i) it is an anytime algorithm, both offline and online, proven asymptotically optimal; (ii) it returns the current probability of success, either before or at any moment during operations; (iii) it handles any possible continuous or discrete, even non-parametric, probability distributions, as well as inter-dependencies between random variables, exogenous and endogenous uncertainty; and (iv) can be easily extended to handle probabilistic external events, PSTNs with resources, PSTNs with cutoff times and precondition chains, etc. Lila is universal in the sense that it can handle any dispatching protocol, simply by specifying it to the algorithm. It has the unlimited flexibility offered by the simulation paradigm, whilst it asymptotically converges to optimal decisions and/or robustness approximations.

Chien, Steve A.↗

TPSAS-NF1676L-21193-DND

Researchers at NASA Langley Research Center have been developing an automated pattern recognition algorithm to identify overshooting convective cloud tops (OTs) in support of the GOES-R satellite program. This algorithm identify regions of overshooting at the individual 1-4 km geostationary satellite pixel scale using visible (during daytime only) and infrared channel imagery and numerical weather analysis data. The algorithm has been developed based upon analysis of 0.25-1 km spatial resolution Aqua MODIS imagery, using a database of over 2000 manually identified OT features throughout the world in storms with varying intensity and morphology. The OT database includes storms ranging from small, warm topped cells in Alaska and Mongolia, tornadic supercells over the U.S. Central Plains and Europe, large tropical mesoscale convective systems, and overshooting in the eyewalls and spiral bands of category 5 tropical cyclones. This database is available for use by the research community. The algorithm is designed to operate on data from any current and historical satellite imager, allowing for development of a highly accurate global OT detection climatology that extends back into the 1990's at up to a 15-30 min temporal resolution throughout the diurnal cycle. As members of the McIDAS Users Group, NASA LaRC has immediate access to the full global archive of geostationary imager data which would allows rapid development of OT climatologies and short-term databases. This type of capability has never been available within the weather and climate research community. Regional geostationary OT databases have been already developed over CONUS during SEAC4RS, for 18-years over the Eastern U.S., and for 5-10 years over Australia, Europe, Southeast Asia, and East Africa among many other regions. Some of these datasets are being used by climate researchers and private industry to examine UTLS-penetrating storm spatial distributions and their temporal variability, in addition to weather hazards associated with these storms at unprecedented spatial detail. This presentation will describe the OT pattern recognition algorithm and highlight recent product applications.

Kristopher Bedka↗

A Novel Atmospheric Correction Algorithm to Exploit the Diurnal Variability in Hypertemporal Geostationary Observations

This study developed a new atmospheric correction algorithm, GeoNEX-AC, that is independent from the traditional use of spectral band ratios but dedicated to exploiting information from the diurnal variability in the hypertemporal geostationary observations. The algorithm starts by evaluating smooth segments of the diurnal time series of the top-of-atmosphere (TOA) reflectance to identify clear-sky and snow-free observations. It then attempts to retrieve the Ross-Thick–Li-Sparse (RTLS) surface bi-directional reflectance distribution function (BRDF) parameters and the daily mean atmospheric optical depth (AOD) with an atmospheric radiative transfer model (RTM) to optimally simulate the observed diurnal variability in the clear-sky TOA reflectance. Once the initial RTLS parameters are retrieved after the algorithm’s burn-in period, they serve as the prior information to estimate the AOD levels for the following days and update the surface BRDF information with the new clear-sky observations. This process is iterated through the full time span of the observations, skipping only totally cloudy days or when surface snow is detected. We tested the algorithm over various Aerosol Robotic Network (AERONET) sites and the retrieved results well agree with the ground-based measurements. This study demonstrates that the high-frequency diurnal geostationary observations contain unique information that can help to address the atmospheric correction problem from new directions.

atmospheric correction↗

The distribution of early- and late-type galaxies in the Coma cluster

The spatial distribution and the morohology-density relation of Coma cluster galaxies are studied using a new homogeneous photmetric sample of 450 galaxies down to B = 16.0 mag with quantitative morphology classification. The sample covers a wide area (10 deg X 10 deg), extending well beyond the Coma cluster. Morphological classifications into early- (E+SO) and late-(S) type galaxies are made by an automated algorithm using simple photometric parameters, with which the misclassification rate is expected to be approximately 10% with respect to early and late types given in the Third Reference Catalogue of Bright Galaxies. The flattened distribution of Coma cluster galaxies, as noted in previous studies, is most conspicuously seen if the early-type galaxies are selected. Early-type galaxies are distributed in a thick filament extended from the NE to the WSW direction that delineates a part of large-scale structure. Spiral galaxies show a distribution with a modest density gradient toward the cluster center; at least bright spiral galaxies are present close to the center of the Coma cluster. We also examine the morphology-density relation for the Coma cluster including its surrounding regions.

Doi, M.↗

Spectrally Resolved Flux Derived from Collocated AIRS and CERES Observations and its Application in Model Validation: Clear-Sky Over the Tropic Oceans - Part I

Spectrally resolved outgoing IR flux, the integrand of the outgoing longwave radiation (OLR), has its unique value in evaluating model simulations. Here we describe an algorithm of deriving such clear-sky outgoing spectral flux through the whole IR region from the collocated Atmospheric Infrared Sounder (AIRS) and the Clouds & the Earth's Radiant Energy System (CERES) measurements over the tropical oceans. Based on the scene types and corresponding angular distribution models (ADMs) used in the CERES Single Satellite Footprint (SSF) dataset, spectrally-dependent ADMs are developed and used to estimate the spectral flux at each AIRS channel. A multivariate linear prediction scheme is then used to estimate spectral fluxes at frequencies not covered by the AIRS instrument. The whole algorithm is validated using synthetic spectra as well as the CERES OLR measurements. Using the GFDL AM2 model simulation as a case study, the application of the derived clear-sky outgoing spectral flux in model evaluation is illustrated. By comparing the observed and simulated spectral flux in 2004, compensating errors in the simulated OLR from different absorption bands can be revealed, so does the errors from frequencies within a given absorption band. Discrepancies between the simulated and observed spatial distributions and seasonal evolutions of the spectral fluxes at different spectral ranges are further discussed. The methodology described in this study can be applied to other surface types as well as cloudy-sky observations and corresponding model evaluations.

Huang, Xianglei↗

An implicit algorithm for the transonic full-potential equation in conservative form

A fast, implicit approximate factorization algorithm for the solution of the conservative full-potential equation for transonic flow in two and three dimensions is presented. Stability in supersonic regions is maintained by the use of an upwind evaluation of the density coefficient along all coordinate directions, providing an effective upwind difference of the streamwise terms for any orientation of the velocity vector and thereby enhancing the reliability of the algorithm. The algorithm is shown to provide rapid convergence for the computation of certain difficult two-dimensional test cases, including cases with fishtail shock patterns, demonstrating the reliability and efficiency of the procedure. Surface pressure coefficient distributions obtained by the present method are also found to be in good agreement with those computed by successive-line overrelaxation and a hybrid direct-solver/successive-line overrelaxation scheme, with significant reductions in CPU time required. A three-dimensional solution for a swept wing mounted between parallel walls is also presented which demonstrates the high convergence rate of the algorithm in three dimensions as well as two.

Holst, T.↗