Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized algorithms”

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

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

At least 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS2026

Methods for Validation of Random Uncertainty Estimates and Their Applications to Ozone Profiles From Limb-Viewing Satellite Instruments

For satellite measurements of atmospheric composition, the random uncertainty estimates provided by retrieval algorithms might be imperfect due to various approximations used in the retrievals or the presence of unknown error sources. This paper presents an overview of the methods used for the validation of random uncertainty estimates. All methods discussed in this study are categorized, and assumptions and limitations of each method are discussed. This overview evaluates these methods in application to ozone profile measurements from limb and occultation satellite instruments and provides practical illustrations of random uncertainty validation.

Viktoria F Sofieva↗
NASA NTRS1974

Square-root algorithm for evaluating mismodeled process noise

As the application of sequential filters has grown, the need has arisen to evaluate the sensitivity of these filters to mismodeling of the random process. A numerically reliable square-root algorithm is developed for calculating the covariances of estimates from a sequential filter which incorrectly models process noise. Mismodeling is restricted to the correlation time and standard deviation of a random process represented as a first-order Gauss-Markov sequence. Using a computer program which employs this algorithm, a sensitivity analysis was performed for several types of earth-based tracking data from an interplanetary spacecraft.

Thornton, C. L.↗
NASA NTRS1989

Thermodynamic cost of computation, algorithmic complexity and the information metric

Algorithmic complexity is discussed as a computational counterpart to the second law of thermodynamics. It is shown that algorithmic complexity, which is a measure of randomness, sets limits on the thermodynamic cost of computations and casts a new light on the limitations of Maxwell's demon. Algorithmic complexity can also be used to define distance between binary strings.

Zurek, W. H.↗
NASA NTRS1996

Feedback shift register sequences versus uniformly distributed random sequences for correlation chromatography

Two alternative input sequences are commonly employed in correlation chromatography (CC). They are sequences derived according to the algorithm of the feedback shift register (i.e., pseudo random binary sequences (PRBS)) and sequences derived by using the uniform random binary sequences (URBS). These two sequences are compared. By applying the "cleaning" data processing technique to the correlograms that result from these sequences, we show that when the PRBS is used the S/N of the correlogram is much higher than the one resulting from using URBS.

NASA Discipline Exobiology↗
NASA NTRS1990

Studies in astronomical time series analysis. IV - Modeling chaotic and random processes with linear filters

While chaos arises only in nonlinear systems, standard linear time series models are nevertheless useful for analyzing data from chaotic processes. This paper introduces such a model, the chaotic moving average. This time-domain model is based on the theorem that any chaotic process can be represented as the convolution of a linear filter with an uncorrelated process called the chaotic innovation. A technique, minimum phase-volume deconvolution, is introduced to estimate the filter and innovation. The algorithm measures the quality of a model using the volume covered by the phase-portrait of the innovation process. Experiments on synthetic data demonstrate that the algorithm accurately recovers the parameters of simple chaotic processes. Though tailored for chaos, the algorithm can detect both chaos and randomness, distinguish them from each other, and separate them if both are present. It can also recover nonminimum-delay pulse shapes in non-Gaussian processes, both random and chaotic.

Scargle, Jeffrey D.↗
NASA NTRS2020

A Machine Learning-Based Cloud Detection and Thermodynamic Phase Classification Algorithm using Passive Spectral Observations

We trained two Random Forest (RF) machine-learning models for cloud mask and cloud thermodynamic phase detection using spectral observations from VIIRS on Suomi NPP (SNPP). Observations from CALIOP were carefully selected to provide reference labels. The two RF models were trained for all-day and daytime-only conditions using a 4-year collocated VIIRS/CALIOP dataset from 2013 to 2016. Due to the orbit difference, the collocated CALIOP and SNPP VIIRS training samples cover a broad viewing zenith angle range, which is a great benefit to overall model performance. The all-day model uses 3 VIIRS infrared (IR) bands (8.6,11, and 12 μm) and the daytime model uses 5 Near-IR (NIR) and Shortwave-IR (SWIR) bands (0.86, 1.24, 1.38, 1.64 and 2.25 μm) together with the 3 IR bands to detect clear, liquid water, and ice cloud pixels. Up to 7 surface types, namely, ocean/water, forest, cropland, grassland, snow/ice, barren/desert, and shrubland, were considered separately to enhance performance for both models. Detection of cloudy pixels and thermodynamic phase with the two RF models were compared against collocated CALIOP products from 2017. It is shown that, with a conservative screening process that excludes the most challenging cloudy pixels for passive remote sensing, the two RF models have high accuracy rates in comparison with the CALIOP reference for both cloud detection and thermodynamic phase. Other existing SNPP VIIRS and Aqua MODIS cloud mask and phase products are also evaluated, with results showing that the two RF models and the MODIS MYD06 optical property phase product are the top 3 algorithms with respect to lidar observations during the daytime. During the nighttime, the RF all-day model works best for both cloud detection and phase, in particular for pixels over snow/ice surfaces. The present RF models can be extended to other similar passive instruments if training samples can be collected from CALIOP or other lidars. However, the quality of reference labels and potential sampling issues that may impact model performance would need further attention.

cloud detection↗
NASA NTRS1977

Modal identification of structures from the responses and random decrement signatures

The theory and application of a method which utilizes the free response of a structure to determine its vibration parameters is described. The time-domain free response is digitized and used in a digital computer program to determine the number of modes excited, the natural frequencies, the damping factors, and the modal vectors. The technique is applied to a complex generalized payload model previously tested using sine sweep method and analyzed by NASTRAN. Ten modes of the payload model are identified. In case free decay response is not readily available, an algorithm is developed to obtain the free responses of a structure from its random responses, due to some unknown or known random input or inputs, using the random decrement technique without changing time correlation between signals. The algorithm is tested using random responses from a generalized payload model and from the space shuttle model.

Brahim, S. R.↗
NASA NTRS1991

Measuring the effects of heterogeneity on distributed systems

Distributed computer systems in daily use are becoming more and more heterogeneous. Currently, much of the design and analysis studies of such systems assume homogeneity. This assumption of homogeneity has been mainly driven by the resulting simplicity in modeling and analysis. A simulation study is presented which investigated the effects of heterogeneity on scheduling algorithms for hard real time distributed systems. In contrast to previous results which indicate that random scheduling may be as good as a more complex scheduler, this algorithm is shown to be consistently better than a random scheduler. This conclusion is more prevalent at high workloads as well as at high levels of heterogeneity.

El-Toweissy, Mohamed↗
NASA NTRS1988

Robust vector quantization for noisy channels

The paper briefly discusses techniques for making vector quantizers more tolerant to tranmsission errors. Two algorithms are presented for obtaining an efficient binary word assignment to the vector quantizer codewords without increasing the transmission rate. It is shown that about 4.5 dB gain over random assignment can be achieved with these algorithms. It is also proposed to reduce the effects of error propagation in vector-predictive quantizers by appropriately constraining the response of the predictive loop. The constrained system is shown to have about 4 dB of SNR gain over an unconstrained system in a noisy channel, with a small loss of clean-channel performance.

Demarca, J. R. B.↗
NASA NTRS2004

Toward a Global Map of Raindrop Size Distributions: Rain-Type Classification and Its Implications for Validating Global Rainfall Products - Part 1

Variability in the global distribution of precipitation is recognized as a key element in assessing the impact of climate change for life on earth. The response of precipitation to climate forcings is, however, poorly understood because of discrepancies in the magnitude and sign of climatic trends in satellite-based rainfall estimates. Quantifying and ultimately removing these biases is critical for studying the response of the hydrologic cycle to climate change. In addition, estimates of random errors owing to variability in algorithm assumptions on local spatial and temporal scales are critical for establishing how strongly their products should be weighted in data assimilation or model validation applications and for assigning a level of confidence to climate trends diagnosed from the data. This paper explores the potential for refining assumed drop size distributions (DSDs) in global radar rainfall algorithms by establishing a link between satellite observables and information gleaned from regional validation experiments where polarimetric radar, Doppler radar, and disdrometer measurements can be used to infer raindrop size distributions. By virtue of the limited information available in the satellite retrieval framework, the current method deviates from approaches adopted in the ground-based radar community that attempt to relate microphysical processes and resultant DSDs to local meteorological conditions. Instead, the technique exploits the fact that different microphysical pathways for rainfall production are likely to lead to differences in both the DSD of the resulting raindrops and the three-dimensional structure of associated radar reflectivity profiles. Objective rain-type classification based on the complete three-dimensional structure of observed reflectivity profiles is found to partially mitigate random and systematic errors in DSDs implied by differential reflectivity measurements. In particular, it is shown that vertical and horizontal reflectivity structure obtained from spaceborne radar can be used to reproduce significant differences in Z(sub dr) between the easterly and westerly climate regimes observed in the Tropical Rainfall Measuring Mission Large-scale Biosphere-Atmosphere (TRMM-LBA) field experiment as well as the even larger differences between Amazonian rainfall and that observed in eastern Colorado. As such, the technique offers a potential methodology for placing locally observed DSD information into a global framework.

L'Ecuyer, Tristan S.↗
NASA NTRS2004

Precipitation and Latent Heating Distributions from Satellite Passive Microwave Radiometry: Method and Uncertainties - Part 1

A revised Bayesian algorithm for estimating surface rain rate, convective rain proportion, and latent heating/drying profiles from satellite-borne passive microwave radiometer observations over ocean backgrounds is described. The algorithm searches a large database of cloud-radiative model simulations to find cloud profiles that are radiatively consistent with a given set of microwave radiance measurements. The properties of these radiatively consistent profiles are then composited to obtain best estimates of the observed properties. The revised algorithm is supported by an expanded and more physically consistent database of cloud-radiative model simulations. The algorithm also features a better quantification of the convective and non-convective contributions to total rainfall, a new geographic database, and an improved representation of background radiances in rain-free regions. Bias and random error estimates are derived from applications of the algorithm to synthetic radiance data, based upon a subset of cloud resolving model simulations, and from the Bayesian formulation itself. Synthetic rain rate and latent heating estimates exhibit a trend of high (low) bias for low (high) retrieved values. The Bayesian estimates of random error are propagated to represent errors at coarser time and space resolutions, based upon applications of the algorithm to TRMM Microwave Imager (TMI) data. Errors in instantaneous rain rate estimates at 0.5 deg resolution range from approximately 50% at 1 mm/h to 20% at 14 mm/h. These errors represent about 70-90% of the mean random deviation between collocated passive microwave and spaceborne radar rain rate estimates. The cumulative algorithm error in TMI estimates at monthly, 2.5 deg resolution is relatively small (less than 6% at 5 mm/day) compared to the random error due to infrequent satellite temporal sampling (8-35% at the same rain rate).

Olson, William S.↗
NASA NTRS2010

Analyzing Non Stationary Processes in Radiometers

The lack of well-developed techniques for modeling changing statistical moments in our observations has stymied the application of stochastic process theory for many scientific and engineering applications. Non linear effects of the observation methodology is one of the most perplexing aspects to modeling non stationary processes. This perplexing problem was encountered when modeling the effect of non stationary receiver fluctuations on the performance of radiometer calibration architectures. Existing modeling approaches were found not applicable; particularly problematic is modeling processes across scales over which they begin to exhibit non stationary behavior within the time interval of the calibration algorithm. Alternatively, the radiometer output is modeled as samples from a sequence random variables; the random variables are treated using a conditional probability distribution function conditioned on the use of the variable in the calibration algorithm. This approach of treating a process as a sequence of random variables with non stationary stochastic moments produce sensible predictions of temporal effects of calibration algorithms. To test these model predictions, an experiment using the Millimeter wave Imaging Radiometer (MIR) was conducted. The MIR with its two black body calibration references was configured in a laboratory setting to observe a third ultra-stable reference (CryoTarget). The MIR was programmed to sequentially sample each of the three references in approximately a 1 second cycle. Data were collected over a six-hour interval. The sequence of reference measurements form an ensemble sample set comprised of a series of three reference measurements. Two references are required to estimate the receiver response. A third reference is used to estimate the uncertainty in the estimate. Typically, calibration algorithms are designed to suppress the non stationary effects of receiver fluctuations. By treating the data sequence as an ensemble collection, it is possible to apply temporal algorithms which exacerbate the non stationary effects. By varying the algorithm, information about the properties of the non stationary receiver fluctuations is obtained. Comparisons of analytical calculations and statistical analysis of data demonstrate impressive agreement.

Racette, Paul↗
NASA NTRS1976

Standard random number generation for MBASIC

A machine-independent algorithm is presented and analyzed for generating pseudorandom numbers suitable for the standard MBASIC system. The algorithm used is the polynomial congruential or linear recurrence modulo 2 method. Numbers, formed as nonoverlapping adjacent 28-bit words taken from the bit stream produced by the formula a sub m + 532 = a sub m + 37 + a sub m (modulo 2), do not repeat within the projected age of the solar system, show no ensemble correlation, exhibit uniform distribution of adjacent numbers up to 19 dimensions, and do not deviate from random runs-up and runs-down behavior.

Tausworthe, R. C.↗
NASA NTRS2004

Active learning in the presence of unlabelable examples

We propose a new active learning framework where the expert labeler is allowed to decline to label any example. This may be necessary because the true label is unknown or because the example belongs to a class that is not part of the real training problem. We show that within this framework, popular active learning algorithms (such as Simple) may perform worse than random selection because they make so many queries to the unlabelable class. We present a method by which any active learning algorithm can be modified to avoid unlabelable examples by training a second classifier to distinguish between the labelable and unlabelable classes. We also demonstrate the effectiveness of the method on two benchmark data sets and a real-world problem.

active learning↗
NASA NTRS1981

The stochastic evolution of asteroidal regoliths and the origin of brecciated and gas-rich meteorites

A model is constructed which views regolith evolution on asteroids as a stochastic process. Average values are shown to be poor descriptors of regolith depth. The utility of the average depth is not significantly increased by avoiding large craters or thick ejecta deposits, a procedure adopted in previous regolith studies. The statistical uncertainty associated with regolith depth severely limits the power of regolith models in predicting parent-body size for brecciated meteorites. A Monte Carlo algorithm was used to simulate the random walks and corresponding charged-particle irradiation histories of grains in regoliths. On rocky asteroids, only about 20 percent of the grains was exposed to solar cosmic ray ions. Results based on present-day conditions in the asteroid belt agree well with irradiation features observed in gas-rich meteorites. An origin during epochs of early solar system evolution is not required.

Housen, K. R.↗
NASA NTRS1986

Modular VLSI Reed-Solomon Decoder

Proposed Reed-Solomon (RS) decoder assembled from very-large-scale integrated-circuit (VLSI) building blocks. Decoder exploits recursive forms in RS decoding algorithms. RS codes capable of correcting random or burst errors in telemetry and other data-communication signals. Because of small size and low power consumption, advantageous to employ several such decoders in parallel-processing scheme to increase decoding speed.

Liu, K. Y.↗
NASA NTRS1986

Broadcasting satellite service synthesis using gradient and cyclic coordinate search procedures

Two search techniques are considered for solving satellite synthesis problems. Neither is likely to find a globally optimal solution. In order to determine which method performs better and what factors affect their performance, we design an experiment and solve the same problem under a variety of starting solution configuration-algorithm combinations. Since there is no randomization in the experiment, we present results of practical, rather than statistical, significance. Our implementation of a cyclic coordinate search procedure clearly finds better synthesis solutions than our implementation of a gradient search procedure does with our objective of maximizing the minimum C/I ratio computed at test points on the perimeters of the intended service areas. The length of the available orbital arc and the configuration of the starting solution are shown to affect the quality of the solutions found.

Reilly, C. H.↗
NASA NTRS1986

Broadcasting satellite service synthesis using gradient and cyclic coordinate search procedures

Two search techniques are considered for solving satellite synthesis problems. Neither is likely to find a globally optimal solution. In order to determine which method performs better and what factors affect their performance, an experiment is designed and the same problem is solved under a variety of starting solution configuration-algorithm combinations. Since there is no randomization in the experiment, results of practical, rather than statistical, significance are presented. Implementation of a cyclic coordinate search procedure clearly finds better synthesis solutions than implementation of a gradient search procedure does with the objective of maximizing the minimum C/I ratio computed at test points on the perimeters of the intended service areas. The length of the available orbital arc and the configuration of the starting solution are shown to affect the quality of the solutions found.

Reilly, C. H.↗