Search NASA⌕ Search

SEARCH · Search NASA

Results for “Randomized 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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
NASA NTRS2013

Creating a Satellite-Based Record of Tropospheric Ozone

The TES retrieval algorithm has been applied to IASI radiances. We compare the retrieved ozone profiles with ozone sonde profiles for mid-latitudes for the year 2008. We find a positive bias in the IASI ozone profiles in the UTLS region of up to 22 %. The spatial coverage of the IASI instrument allows sampling of effectively the same air mass with several IASI scenes simultaneously. Comparisons of the root-mean-square of an ensemble of IASI profiles to theoretical errors indicate that the measurement noise and the interference of temperature and water vapour on the retrieval together mostly explain the empirically derived random errors. The total degrees of freedom for signal of the retrieval for ozone are 3.1 +/- 0.2 and the tropospheric degrees of freedom are 1.0 +/- 0.2 for the described cases. IASI ozone profiles agree within the error bars with coincident ozone profiles derived from a TES stare sequence for the ozone sonde station at Bratt's Lake (50.2 deg N, 104.7 deg W).

pollutant↗
NASA NTRS2011

Prioritized LT Codes

The original Luby Transform (LT) coding scheme is extended to account for data transmissions where some information symbols in a message block are more important than others. Prioritized LT codes provide unequal error protection (UEP) of data on an erasure channel by modifying the original LT encoder. The prioritized algorithm improves high-priority data protection without penalizing low-priority data recovery. Moreover, low-latency decoding is also obtained for high-priority data due to fast encoding. Prioritized LT codes only require a slight change in the original encoding algorithm, and no changes at all at the decoder. Hence, with a small complexity increase in the LT encoder, an improved UEP and low-decoding latency performance for high-priority data can be achieved. LT encoding partitions a data stream into fixed-sized message blocks each with a constant number of information symbols. To generate a code symbol from the information symbols in a message, the Robust-Soliton probability distribution is first applied in order to determine the number of information symbols to be used to compute the code symbol. Then, the specific information symbols are chosen uniform randomly from the message block. Finally, the selected information symbols are XORed to form the code symbol. The Prioritized LT code construction includes an additional restriction that code symbols formed by a relatively small number of XORed information symbols select some of these information symbols from the pool of high-priority data. Once high-priority data are fully covered, encoding continues with the conventional LT approach where code symbols are generated by selecting information symbols from the entire message block including all different priorities. Therefore, if code symbols derived from high-priority data experience an unusual high number of erasures, Prioritized LT codes can still reliably recover both high- and low-priority data. This hybrid approach decides not only "how to encode" but also "what to encode" to achieve UEP. Another advantage of the priority encoding process is that the majority of high-priority data can be decoded sooner since only a small number of code symbols are required to reconstruct high-priority data. This approach increases the likelihood that high-priority data is decoded first over low-priority data. The Prioritized LT code scheme achieves an improvement in high-priority data decoding performance as well as overall information recovery without penalizing the decoding of low-priority data, assuming high-priority data is no more than half of a message block. The cost is in the additional complexity required in the encoder. If extra computation resource is available at the transmitter, image, voice, and video transmission quality in terrestrial and space communications can benefit from accurate use of redundancy in protecting data with varying priorities.

Woo, Simon S.↗
NASA NTRS2012

A Parameterized Inversion Model for Soil Moisture and Biomass from Polarimetric Backscattering Coefficients

A semi-empirical algorithm for the retrieval of soil moisture, root mean square (RMS) height and biomass from polarimetric SAR data is explained and analyzed in this paper. The algorithm is a simplification of the distorted Born model. It takes into account the physical scattering phenomenon and has three major components: volume, double-bounce and surface. This simplified model uses the three backscattering coefficients ( sigma HH, sigma HV and sigma vv) at low-frequency (P-band). The inversion process uses the Levenberg-Marquardt non-linear least-squares method to estimate the structural parameters. The estimation process is entirely explained in this paper, from initialization of the unknowns to retrievals. A sensitivity analysis is also done where the initial values in the inversion process are varying randomly. The results show that the inversion process is not really sensitive to initial values and a major part of the retrievals has a root-mean-square error lower than 5% for soil moisture, 24 Mg/ha for biomass and 0.49 cm for roughness, considering a soil moisture of 40%, roughness equal to 3cm and biomass varying from 0 to 500 Mg/ha with a mean of 161 Mg/ha

soil moisture↗
NASA NTRS2019

Using Deep Learning to Automate Inference of Meteoroid Pre-Entry Properties

Properly assessing the asteroid threat depends on the knowledge of asteroid pre-entry parameters, such as size, velocity, mass, density, and strength. Although a vast number of possible bodies to study exist, such characterization of asteroid populations is currently limited by substantial costs associated with space rendezvous missions and rare meteorite findings. As asteroids fragment, ablate, and decelerate in the atmosphere, they emit light detectable by ground-based and space-borne instruments. Earth’s atmosphere, thus, becomes an accessible laboratory that enables impactor risk assessments by facilitating inference of the pre-entry parameters. These asteroid pre-entry conditions are typically deduced by modeling the entry and breakup physics that best reproduce the observed light or energy deposition curve. However, this process requires extensive manual trial-and-error of uncertain modeling parameters. Automating meteor modeling and inference would improve property distributions used in risk assessments and enable population characterization as more light curves become more readily available through the presence of space assets and ground-based camera networks. We previously developed a genetic algorithm to automate meteor modeling by using the fragment-cloud model (FCM) to search for the values of the FCM input parameters (e.g., diameter) that generate energy deposition profiles that match the observed one. Now, we apply deep learning to infer asteroid diameter, velocity, and density from observed energy deposition curves. We trained and tested our neural network models with synthetic energy deposition curves modeled using the FCM rubble pile implementation. We present an application of a 1D convolutional neural network and compare its performance to other attempted regressors and machine learning techniques, such as a fully connected neural network and Random Forest regression, to demonstrate its capabilities. We validate our model weights and approach using the Chelyabinsk, Tagish Lake, Benešov, Košice, and Lost City meteors.

Tarano, Ana Maria↗
NASA NTRS1984

On the utilization of engineering knowledge in design optimization

Some current research work conducted at the University of Michigan is described to illustrate efforts for incorporating knowledge in optimization in a nontraditional way. The incorporation of available knowledge in a logic structure is examined in two circumstances. The first examines the possibility of introducing global design information in a local active set strategy implemented during the iterations of projection-type algorithms for nonlinearly constrained problems. The technique used algorithms for nonlinearly constrained problems. The technique used combines global and local monotinicity analysis of the objective and constraint functions. The second examines a knowledge-based program which aids the user to create condigurations that are most desirable from the manufacturing assembly viewpoint. The data bank used is the classification scheme suggested by Boothroyd. The important aspect of this program is that it is an aid for synthesis intended for use in the design concept phase in a way similar to the so-called idea-triggers in creativity-enhancement techniques like brain-storming. The idea generation, however, is not random but it is driven by the goal of achieving the best acceptable configuration.

Papalambros, P.↗
NASA NTRS2006

Using a Quadtree Algorithm To Assess Line of Sight

A matched pair of computer algorithms determines whether line of sight (LOS) is obstructed by terrain. These algorithms were originally designed for use in conjunction with combat-simulation software in military training exercises, but could also be used for such commercial purposes as evaluating lines of sight for antennas or determining what can be seen from a "room with a view." The quadtree preparation algorithm operates on an array of digital elevation data and only needs to be run once for a terrain region, which can be quite large. Relatively little computation time is needed, as each elevation value is considered only one and one-third times. The LOS assessment algorithm uses that quadtree to answer LOS queries. To determine whether LOS is obstructed, a piecewise-planar (or higher-order) terrain skin is computationally draped over the digital elevation data. Adjustments are made to compensate for curvature of the Earth and for refraction of the LOS by the atmosphere. Average computing time appears to be proportional to the number of queries times the logarithm of the number of elevation data points. Accuracy is as high as is possible for the available elevation data, and symmetric results are assured. In the simulation, the LOS query program runs as a separate process, thereby making more random-access memory available for other computations.

Gonzalez, Joseph↗
NASA NTRS2020

An Algorithm for Characterization of Fiber Aggregation in Composite Microstructures

Composite structures are susceptible to localized flaws, or variability, that drive global failure. To capture this variance, a multiscale model needs to be introduced that not only accurately represents the statistical nature of the composite microstructure but is also efficient. At the microscale, fiber aggregation creates local stress concentrations, where failure is likely to occur sooner than expected. A method of rapid microstructure generation, in conjunction with cluster characterization, is examined to develop accurate reproductions of 2D composite cross-sections. Parameterization of shape and size of fiber clusters is used to characterize representative volume elements. The discrete element method is used to generate pseudo-microstructures. The clustering parameters from the pseudo- and actual microstructure arrangements (obtained from micrographs) can be compared to determine the validity of the representative volume element generated with the discrete element method. Results show a promising approach to evaluating randomness of fiber distributions and how to accurately recreate microstructures for strength analysis.

Carbon fiber↗
NASA NTRS1999

Parallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing

The ability to dynamically adapt an unstructured grid is a powerful tool for efficiently solving computational problems with evolving physical features. In this paper, we report on our experience parallelizing an edge-based adaptation scheme, called 3D_TAG. using message passing. Results show excellent speedup when a realistic helicopter rotor mesh is randomly refined. However. performance deteriorates when the mesh is refined using a solution-based error indicator since mesh adaptation for practical problems occurs in a localized region., creating a severe load imbalance. To address this problem, we have developed PLUM, a global dynamic load balancing framework for adaptive numerical computations. Even though PLUM primarily balances processor workloads for the solution phase, it reduces the load imbalance problem within mesh adaptation by repartitioning the mesh after targeting edges for refinement but before the actual subdivision. This dramatically improves the performance of parallel 3D_TAG since refinement occurs in a more load balanced fashion. We also present optimal and heuristic algorithms that, when applied to the default mapping of a parallel repartitioner, significantly reduce the data redistribution overhead. Finally, portability is examined by comparing performance on three state-of-the-art parallel machines.

Oliker, Leonid↗
NASA NTRSDate not supplied

Algorithmic Analysis of the Effect of Human Behavior on Future Urban Air Mobility Operations

The demand for a ride to work without running into the inefficiencies of traffic in a bustling, metropolitan area beckons for a system to tackle on-the ground traffic congestion, thus fueling the need for Urban Air Mobility (UAM). The instant gratification culture, notably its effect on Generation Z, has given way to the nature of impulsive decision making. The 2020 COVID-19 crisis, with its use of tap-to-gratify technology, highlights passengers preferring late booking. This last-minute airport reorganization crisis spearheaded our research goal to create a more user-personalized assessment of cancellation rates. Our research highlights that there will be a market in the 2030s for UAM, short-distance air transportation, and the world must prepare for the challenges that come with this new market. Through a two-part model, we obtained two randomized sets of profiles of user-specific and ridership attributes and their relationship with cancellations. Recommendations for future research include factoring this personalized aspect into cancellation projections to provide reasoned user discounts as well as a remedy for the scheduling chaos that stems from the airport organizational crisis.

Harbani Jaggi↗
NASA NTRS1992

Fault-tolerant wait-free shared objects

A concurrent system consists of processes and shared objects. Previous research focused on the problem of tolerating process failure. We study the complementary problem of tolerating failures. We divide object failures into two broad classes: responsive and non-responsive. With responsive failures, a faulty object responds to every invocation, but responses may be incorrect. With non-responsive failures, a faulty object may also 'hang' without responding. For each class, we consider crash, and arbitrary types of failures. For each type of failure, we are seeking a universal implementation for fault-tolerant wait-free shared objects. We present (deterministic) implementations for all types of responsive failures, including arbitrary failures. In contrast, we show that even the most benign type of non-responsive failures requires the use of randomization. Of special interest is the problem of implementing fault-tolerant objects using only objects of the same type. We present such fault-tolerant self-implementations for many common object types. Graceful degradation is a desirable property of fault-tolerant implementations: the implemented object never fails more severely than the base objects it is derived from, even if all the base objects fail. For several failure models, we show whether this property can be achieved, and, if so, how. In addition to the above possibility/impossibility results, we also consider the resources complexity of fault-tolerant implementations. In many cases, we present lower bounds and give matching algorithms.

Jayanti, Prasad↗
NASA NTRS1994

Acquisition and processing of data for isotope-ratio-monitoring mass spectrometry

Methods are described for continuous monitoring of signals required for precise analyses of 13C, 18O, and 15N in gas streams containing varying quantities of CO2 and N2. The quantitative resolution (i.e. maximum performance in the absence of random errors) of these methods is adequate for determination of isotope ratios with an uncertainty of one part in 10(5); the precision actually obtained is often better than one part in 10(4). This report describes data-processing operations including definition of beginning and ending points of chromatographic peaks and quantitation of background levels, allowance for effects of chromatographic separation of isotopically substituted species, integration of signals related to specific masses, correction for effects of mass discrimination, recognition of drifts in mass spectrometer performance, and calculation of isotopic delta values. Characteristics of a system allowing off-line revision of parameters used in data reduction are described and an algorithm for identification of background levels in complex chromatograms is outlined. Effects of imperfect chromatographic resolution are demonstrated and discussed and an approach to deconvolution of signals from coeluting substances described.

NASA Discipline Exobiology↗
NASA NTRS2008

Onboard Image Registration from Invariant Features

This paper describes a feature-based image registration technique that is potentially well-suited for onboard deployment. The overall goal is to provide a fast, robust method for dynamically combining observations from multiple platforms into sensors webs that respond quickly to short-lived events and provide rich observations of objects that evolve in space and time. The approach, which has enjoyed considerable success in mainstream computer vision applications, uses invariant SIFT descriptors extracted at image interest points together with the RANSAC algorithm to robustly estimate transformation parameters that relate one image to another. Experimental results for two satellite image registration tasks are presented: (1) automatic registration of images from the MODIS instrument on Terra to the MODIS instrument on Aqua and (2) automatic stabilization of a multi-day sequence of GOES-West images collected during the October 2007 Southern California wildfires.

descriptors↗
NASA NTRS2002

Automated Escape Guidance Algorithms for An Escape Vehicle

An escape vehicle was designed to provide an emergency evacuation for crew members living on a space station. For maximum escape capability, the escape vehicle needs to have the ability to safely evacuate a station in a contingency scenario such as an uncontrolled (e.g., tumbling) station. This emergency escape sequence will typically be divided into three events: The fust separation event (SEP1), the navigation reconstruction event, and the second separation event (SEP2). SEP1 is responsible for taking the spacecraft from its docking port to a distance greater than the maximum radius of the rotating station. The navigation reconstruction event takes place prior to the SEP2 event and establishes the orbital state to within the tolerance limits necessary for SEP2. The SEP2 event calculates and performs an avoidance burn to prevent station recontact during the next several orbits. This paper presents the tools and results for the whole separation sequence with an emphasis on the two separation events. The fust challenge includes collision avoidance during the escape sequence while the station is in an uncontrolled rotational state, with rotation rates of up to 2 degrees per second. The task of avoiding a collision may require the use of the Vehicle's de-orbit propulsion system for maximum thrust and minimum dwell time within the vicinity of the station vicinity. The thrust of the propulsion system is in a single direction, and can be controlled only by the attitude of the spacecraft. Escape algorithms based on a look-up table or analytical guidance can be implemented since the rotation rate and the angular momentum vector can be sensed onboard and a-priori knowledge of the position and relative orientation are available. In addition, crew intervention has been provided for in the event of unforeseen obstacles in the escape path. The purpose of the SEP2 burn is to avoid re-contact with the station over an extended period of time. Performing this maneuver properly requires knowledge of the orbital state, which is obtained during the navigation state reconstruction event. Since the direction of the delta-v of the SEPI maneuver is a random variable with respect to the Local Vertical Local Horizontal (LVLH) coordinate system, calculating the required SEP2 burn is a challenge. This problem was solved using a neural network as a model-free function approximation technique.

Flanary, Ronald↗
NASA NTRS1984

Maximum likelihood algorithm using an efficient scheme for computing sensitivities and parameter confidence intervals

Improved techniques for estimating airplane stability and control derivatives and their standard errors are presented. A maximum likelihood estimation algorithm is developed which relies on an optimization scheme referred to as a modified Newton-Raphson scheme with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort compared to integrating the analytically-determined sensitivity equations or using a finite difference scheme. An aircraft estimation problem is solved using real flight data to compare MNRES with the commonly used modified Newton-Raphson technique; MNRES is found to be faster and more generally applicable. Parameter standard errors are determined using a random search technique. The confidence intervals obtained are compared with Cramer-Rao lower bounds at the same confidence level. It is observed that the nonlinearity of the cost function is an important factor in the relationship between Cramer-Rao bounds and the error bounds determined by the search technique.

Murphy, P. C.↗
NASA NTRS1995

Field lines and magnetic surfaces in a two-component slab/2D model of interplanetary magnetic fluctuations

A two-component model for the spectrum of interplanetary magnetic fluctuations was proposed on the basis of ISEE observations, and has found an intriguing level of application in other solar wind studies. The model fluctuations consist of a fraction of 'slab' fluctuations, varying only in the direction parallel to the locally uniform mean magnetic field B(0) and a complement of 2D (two-dimensional) fluctuations that vary in the directions transverse to B(0). We have developed an spectral method computational algorithm for computing the magnetic flux surfaces (flux tubes) associated with the composite model, based upon a precise analogy with equations for ideal transport of a passive scalar in planar two dimensional geometry. Visualization of various composite models will be presented, including the 80 percent 2D/ 20 percent slab model with delta B/B(0) approximately equals 1 and a minus 5/3 spectral law, that is thought to approximately represent a snapshot of solar wind turbulence. Characteristically, the visualizations show that flux tubes, even when defined as regular on some plane, shred and disperse rapidly as they are viewed along the parallel direction. This diffusive process, which generalizes the standard picture of field line random walk, will be discussed in detail. Evidently, the traditional picture that flux tubes randomize like strands of spaghetti with a uniform tangle along the axial direction is in need of modification.

Matthaeus, W. H.↗
NASA NTRS2007

Automated Knowledge Discovery From Simulators

A computational method, SimLearn, has been devised to facilitate efficient knowledge discovery from simulators. Simulators are complex computer programs used in science and engineering to model diverse phenomena such as fluid flow, gravitational interactions, coupled mechanical systems, and nuclear, chemical, and biological processes. SimLearn uses active-learning techniques to efficiently address the "landscape characterization problem." In particular, SimLearn tries to determine which regions in "input space" lead to a given output from the simulator, where "input space" refers to an abstraction of all the variables going into the simulator, e.g., initial conditions, parameters, and interaction equations. Landscape characterization can be viewed as an attempt to invert the forward mapping of the simulator and recover the inputs that produce a particular output. Given that a single simulation run can take days or weeks to complete even on a large computing cluster, SimLearn attempts to reduce costs by reducing the number of simulations needed to effect discoveries. Unlike conventional data-mining methods that are applied to static predefined datasets, SimLearn involves an iterative process in which a most informative dataset is constructed dynamically by using the simulator as an oracle. On each iteration, the algorithm models the knowledge it has gained through previous simulation trials and then chooses which simulation trials to run next. Running these trials through the simulator produces new data in the form of input-output pairs. The overall process is embodied in an algorithm that combines support vector machines (SVMs) with active learning. SVMs use learning from examples (the examples are the input-output pairs generated by running the simulator) and a principle called maximum margin to derive predictors that generalize well to new inputs. In SimLearn, the SVM plays the role of modeling the knowledge that has been gained through previous simulation trials. Active learning is used to determine which new input points would be most informative if their output were known. The selected input points are run through the simulator to generate new information that can be used to refine the SVM. The process is then repeated. SimLearn carefully balances exploration (semi-randomly searching around the input space) versus exploitation (using the current state of knowledge to conduct a tightly focused search). During each iteration, SimLearn uses not one, but an ensemble of SVMs. Each SVM in the ensemble is characterized by different hyper-parameters that control various aspects of the learned predictor - for example, whether the predictor is constrained to be very smooth (nearby points in input space lead to similar output predictions) or whether the predictor is allowed to be "bumpy." The various SVMs will have different preferences about which input points they would like to run through the simulator next. SimLearn includes a formal mechanism for balancing the ensemble SVM preferences so that a single choice can be made for the next set of trials.

Burl, Michael↗
NASA NTRS2004

Examination of Surface Roughness on Light Scattering by Long Ice Columns by Use of a Two-Dimensional Finite-Difference Time-Domain Algorithm

Natural particles such as ice crystals in cirrus clouds generally are not pristine but have additional micro-roughness on their surfaces. A two-dimensional finite-difference time-domain (FDTD) program with a perfectly matched layer absorbing boundary condition is developed to calculate the effect of surface roughness on light scattering by long ice columns. When we use a spatial cell size of 1/120 incident wavelength for ice circular cylinders with size parameters of 6 and 24 at wavelengths of 0.55 and 10.8 mum, respectively, the errors in the FDTD results in the extinction, scattering, and absorption efficiencies are smaller than similar to 0.5%. The errors in the FDTD results in the asymmetry factor are smaller than similar to 0.05%. The errors in the FDTD results in the phase-matrix elements are smaller than similar to 5%. By adding a pseudorandom change as great as 10% of the radius of a cylinder, we calculate the scattering properties of randomly oriented rough-surfaced ice columns. We conclude that, although the effect of small surface roughness on light scattering is negligible, the scattering phase-matrix elements change significantly for particles with large surface roughness. The roughness on the particle surface can make the conventional phase function smooth. The most significant effect of the surface roughness is the decay of polarization of the scattered light.

Sun, W.↗
NASA NTRS2014

A New Hybrid Spatio-temporal Model for Estimating Daily Multi-year PM2.5 Concentrations Across Northeastern USA Using High Resolution Aerosol Optical Depth Data

The use of satellite-based aerosol optical depth (AOD) to estimate fine particulate matter PM(sub 2.5) for epidemiology studies has increased substantially over the past few years. These recent studies often report moderate predictive power, which can generate downward bias in effect estimates. In addition, AOD measurements have only moderate spatial resolution, and have substantial missing data. We make use of recent advances in MODIS satellite data processing algorithms (Multi-Angle Implementation of Atmospheric Correction (MAIAC), which allow us to use 1 km (versus currently available 10 km) resolution AOD data.We developed and cross validated models to predict daily PM(sub 2.5) at a 1X 1 km resolution across the northeastern USA (New England, New York and New Jersey) for the years 2003-2011, allowing us to better differentiate daily and long term exposure between urban, suburban, and rural areas. Additionally, we developed an approach that allows us to generate daily high-resolution 200 m localized predictions representing deviations from the area 1 X 1 km grid predictions. We used mixed models regressing PM(sub 2.5) measurements against day-specific random intercepts, and fixed and random AOD and temperature slopes. We then use generalized additive mixed models with spatial smoothing to generate grid cell predictions when AOD was missing. Finally, to get 200 m localized predictions, we regressed the residuals from the final model for each monitor against the local spatial and temporal variables at each monitoring site. Our model performance was excellent (mean out-of-sample R(sup 2) = 0.88). The spatial and temporal components of the out-of-sample results also presented very good fits to the withheld data (R(sup 2) = 0.87, R(sup)2 = 0.87). In addition, our results revealed very little bias in the predicted concentrations (Slope of predictions versus withheld observations = 0.99). Our daily model results show high predictive accuracy at high spatial resolutions and will be useful in reconstructing exposure histories for epidemiological studies across this region.

Air pollution↗