Search NASA⌕ Search

SEARCH · Search NASA

Results for “Statistical 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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
NASA NTRS2015

Estimating Uncertainties in the Multi-Instrument SBUV Profile Ozone Merged Data Set

The MOD data set is uniquely qualified for use in long-term ozone analysis because of its long record, high spatial coverage, and consistent instrument design and algorithm. The estimated MOD uncertainty term significantly increases the uncertainty over the statistical error alone. Trends in the post-2000 period are generally positive in the upper stratosphere, but only significant at 1-1.6 hPa. Remaining uncertainties not yet included in the Monte Carlo model are Smoothing Error ( 1 from 10 to 1 hPa) Relative calibration uncertainty between N11 and N17Seasonal cycle differences between SBUV records.

Uncertainties↗
NASA NTRS2020

On the Use of Complexity Algorithms: a Cautionary Lesson from Climate Research

Complexity algorithms provide information about datasets which is radically different from classical moment statistics. Instead of focusing on the divergences from central values, they quantify other characteristics such as order, pattern repetitions, or the existence of attractors. However, those analyses must be done with the proper statistical treatment, which is, unfortunately, not always the case. In this contribution, I provide an example of the hazards of applying complexity measures without sufficient care by correcting a previously published analysis that aimed to quantify the complexity of climate. I clarify some misconceptions about the use of Sample Entropy and revise the incorrect assessments and conclusions drawn from the previous misapplication of the methods.

Delgado-Bonal, Alfonso↗
NASA NTRS2004

The coverage of elliptical orbits using Ergodic theory

One of the key performance metrics for satellite constellations is the statistics of the visibility periods between the satellites and poins on the ground. Associated with this are other desirable communications statistis such as data through-put, link qualities, etc. Typically, the computation of coverage statistics requires the propagation of the trajectories. In this paper a new algorithm using differential geometry enables us to extend the Ergodic theory to eliptical orbits.

Lo, Martin W.↗
NASA NTRS2005

BEAM Technology Flight Demonstration

As technologies advance, their growing complexity makes them harder to maintain. Detection methods for isolating and identifying impending problems are needed to balance this complexity. Through comparison of signal pairs from onboard sensors, the Beacon-based Exception Analysis For Multimissions (BEAM) algorithm can identify and help classify deviations in system operation from a data-trained statistical model. The goal of this task is to mature BEAM and validate its performance on a flying test bed. A series of F-18 flight demonstrations with BEAM monitoring engine parameters in real time was used to demonstrate in-the-field readiness. Captured F-18 and simulated F-18 engine data were used in model creation and training. The algorithm was then ported to the embedded system with a data buffering, file writing, and data-time-stamp monitoring shell to reduce the impact of embedded system faults on BEAM'S ability to correctly identify engine faults. Embedded system testing identified hardware related restrictions and contributed to iterative improvements in the code's runtime performance. The system was flown with forced engine flameouts and other pilot induced faults to simulate operation out of the norm. Successful detection of these faults, confirmed through post-flight data analysis, helped BEAM achieve TRL6.

Wang, David↗
NASA NTRS1973

A constrained discrete optimal guidance strategy for low-thrust space flight

A low-thrust guidance algorithm suitable for operational use is formulated. Using linear stochastic control theory, a linear feedback control law is obtained for a minimum terminal miss performance criterion. The control variables are restricted to constant values over specified time intervals and are explicitly limited. Both fixed and variable time-of-arrival guidance are considered. Guidance equations are presented in deterministic (operational) and in statistical form; and computational procedures necessary for implementation are outlined. The performance of the guidance algorithm is evaluated by applying it to the approach phase of the 1980 rendezvous mission with the comet Encke.

Jacobson, R. A.↗
NASA NTRS1983

Investigation of energy management strategies for photovoltaic systems - A predictive control algorithm

The present investigation is concerned with the formulation of energy management strategies for stand-alone photovoltaic (PV) systems, taking into account a basic control algorithm for a possible predictive, (and adaptive) controller. The control system controls the flow of energy in the system according to the amount of energy available, and predicts the appropriate control set-points based on the energy (insolation) available by using an appropriate system model. Aspects of adaptation to the conditions of the system are also considered. Attention is given to a statistical analysis technique, the analysis inputs, the analysis procedure, and details regarding the basic control algorithm.

Cull, R. C.↗
NASA NTRS2018

New Neural Network Cloud Mask Algorithm Based on Radiative Transfer Simulations

Cloud detection and screening constitute critically important first steps required to derive many satellite data products. Traditional threshold-based cloud mask algorithms require a complicated design process and fine tuning for each sensor, and they have difficulties over areas partially covered with snow/ice. Exploiting advances in machine learning techniques and radiative transfer modeling of coupled environmental systems, we have developed a new, threshold-free cloud mask algorithm based on a neural network classifier driven by extensive radiative transfer simulations. Statistical validation results obtained by using collocated CALIOP and MODIS data show that its performance is consistent over different ecosystems and significantly better than the MODIS Cloud Mask (MOD35 C6) during the winter seasons over snow-covered areas in the mid-latitudes. Simulations using a reduced number of satellite channels also show satisfactory results, indicating its flexibility to be configured for different sensors. Comparedto threshold-based methods and previous machine-learning approaches, this new cloud mask (i) does not rely on thresholds, (ii) needs fewer satellite channels, (iii) has superior performance during winter seasons in mid-latitude areas, and (iv) can easily be applied to different sensors.

cloud mask algorithms↗
NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗
NASA NTRS2004

Putting Priors in Mixture Density Mercer Kernels

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. We describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using predefined kernels. These data adaptive kernels can en- code prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS). The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains template for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic- algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code. The results show that the Mixture Density Mercer-Kernel described here outperforms tree-based classification in distinguishing high-redshift galaxies from low- redshift galaxies by approximately 16% on test data, bagged trees by approximately 7%, and bagged trees built on a much larger sample of data by approximately 2%.

Srivastava, Ashok N.↗
NASA NTRS1987

Knowledge-based vision for space station object motion detection, recognition, and tracking

Computer vision, especially color image analysis and understanding, has much to offer in the area of the automation of Space Station tasks such as construction, satellite servicing, rendezvous and proximity operations, inspection, experiment monitoring, data management and training. Knowledge-based techniques improve the performance of vision algorithms for unstructured environments because of their ability to deal with imprecise a priori information or inaccurately estimated feature data and still produce useful results. Conventional techniques using statistical and purely model-based approaches lack flexibility in dealing with the variabilities anticipated in the unstructured viewing environment of space. Algorithms developed under NASA sponsorship for Space Station applications to demonstrate the value of a hypothesized architecture for a Video Image Processor (VIP) are presented. Approaches to the enhancement of the performance of these algorithms with knowledge-based techniques and the potential for deployment of highly-parallel multi-processor systems for these algorithms are discussed.

Symosek, P.↗
NASA NTRS2011

Multiple-Beam Detection of Fast Transient Radio Sources

A method has been designed for using multiple independent stations to discriminate fast transient radio sources from local anomalies, such as antenna noise or radio frequency interference (RFI). This can improve the sensitivity of incoherent detection for geographically separated stations such as the very long baseline array (VLBA), the future square kilometer array (SKA), or any other coincident observations by multiple separated receivers. The transients are short, broadband pulses of radio energy, often just a few milliseconds long, emitted by a variety of exotic astronomical phenomena. They generally represent rare, high-energy events making them of great scientific value. For RFI-robust adaptive detection of transients, using multiple stations, a family of algorithms has been developed. The technique exploits the fact that the separated stations constitute statistically independent samples of the target. This can be used to adaptively ignore RFI events for superior sensitivity. If the antenna signals are independent and identically distributed (IID), then RFI events are simply outlier data points that can be removed through robust estimation such as a trimmed or Winsorized estimator. The alternative "trimmed" estimator is considered, which excises the strongest n signals from the list of short-beamed intensities. Because local RFI is independent at each antenna, this interference is unlikely to occur at many antennas on the same step. Trimming the strongest signals provides robustness to RFI that can theoretically outperform even the detection performance of the same number of antennas at a single site. This algorithm requires sorting the signals at each time step and dispersion measure, an operation that is computationally tractable for existing array sizes. An alternative uses the various stations to form an ensemble estimate of the conditional density function (CDF) evaluated at each time step. Both methods outperform standard detection strategies on a test sequence of VLBA data, and both are efficient enough for deployment in real-time, online transient detection applications.

Thompson, David R.↗
NASA NTRS2000

Cloud and Aerosol Retrieval for the 2001 GLAS Satellite Lidar Mission

The Geoscience Laser Altimeter System (GLAS) is scheduled for launch in July of 2001 aboard the Ice, Cloud and Land Elevation Satellite (ICESAT). In addition to being a precision altimeter for mapping the height of the Earth's icesheets, GLAS will be an atmospheric lidar, sensitive enough to detect gaseous, aerosol, and cloud backscatter signals, at horizontal and vertical resolutions of 175 and 75m, respectively. GLAS will be the first lidar to produce temporally continuous atmospheric backscatter profiles with nearly global coverage (94-degree orbital inclination). With a projected operational lifetime of five years, GLAS will collect approximately six billion lidar return profiles. The large volume of data dictates that operational analysis algorithms, which need to keep pace with the data yield of the instrument, must be efficient. So, we need to evaluate the ability of operational algorithms to detect atmospheric constituents that affect global climate. We have to quantify, in a statistical manner, the accuracy and precision of GLAS cloud and aerosol observations. Our poster presentation will show the results of modeling studies that are designed to reveal the effectiveness and sensitivity of GLAS in detecting various atmospheric cloud and aerosol features. The studies consist of analyzing simulated lidar returns. Simulation cases are constructed either from idealized renditions of atmospheric cloud and aerosol layers or from data obtained by the NASA ER-2 Cloud Lidar System (CLS). The fabricated renditions permit quantitative evaluations of operational algorithms to retrieve cloud and aerosol parameters. The use of observational data permits the evaluations of performance for actual atmospheric conditions. The intended outcome of the presentation is that climatology community will be able to use the results of these studies to evaluate and quantify the impact of GLAS data upon atmospheric modeling efforts.

Hart, William D.↗
NASA NTRS1982

Evaluation of the potential of one to three SEASAT-SMMR channels in retrieving sea surface temperature

The scanning multichannel microwave radiometer (SMMR) aboard the SEASAT satellite measured emitted radiation in both horizontal and vertical polarizations at microwave frequencies of 6.6, 10.69, 18.0, 21.0 and 37.0 GHz. Retrieval algorithms, for sea surface temperature (SST) determination, from subsets of one to three SMMR channels are obtained by a two step statistical technique. The technique first selects the best subsets of a given size defined by an R2 criterion (coefficient of determination), of a given size by the application of an efficient 'leaps and bounds' technique on a statistical data base. It then performs a regression analysis on the selected subsets. The statistical data base employed a large (600) set of seasonally and geographically diverse atmospheric and surface parameters for radiative transfer calculations. The results of the study of one to three channel subset retrieval algorithms indicate the possibility of using 6.6V, 6.6H and 18V channels for SST determination from SEASAT-SMMR data.

Pandey, P. C.↗
NASA NTRS2010

Hidden Statistics Approach to Quantum Simulations

Recent advances in quantum information theory have inspired an explosion of interest in new quantum algorithms for solving hard computational (quantum and non-quantum) problems. The basic principle of quantum computation is that the quantum properties can be used to represent structure data, and that quantum mechanisms can be devised and built to perform operations with this data. Three basic non-classical properties of quantum mechanics superposition, entanglement, and direct-product decomposability were main reasons for optimism about capabilities of quantum computers that promised simultaneous processing of large massifs of highly correlated data. Unfortunately, these advantages of quantum mechanics came with a high price. One major problem is keeping the components of the computer in a coherent state, as the slightest interaction with the external world would cause the system to decohere. That is why the hardware implementation of a quantum computer is still unsolved. The basic idea of this work is to create a new kind of dynamical system that would preserve the main three properties of quantum physics superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. In other words, such a system would reinforce the advantages and minimize limitations of both quantum and classical aspects. Based upon a concept of hidden statistics, a new kind of dynamical system for simulation of Schroedinger equation is proposed. The system represents a modified Madelung version of Schroedinger equation. It preserves superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for simulating quantum systems. The model includes a transitional component of quantum potential (that has been overlooked in previous treatment of the Madelung equation). The role of the transitional potential is to provide a jump from a deterministic state to a random state with prescribed probability density. This jump is triggered by blowup instability due to violation of Lipschitz condition generated by the quantum potential. As a result, the dynamics attains quantum properties on a classical scale. The model can be implemented physically as an analog VLSI-based (very-large-scale integration-based) computer, or numerically on a digital computer. This work opens a way of developing fundamentally new algorithms for quantum simulations of exponentially complex problems that expand NASA capabilities in conducting space activities. It has been illustrated that the complexity of simulations of particle interaction can be reduced from an exponential one to a polynomial one.

Zak, Michail↗
NASA NTRS1992

The ACTS propagation program

The success or failure of the ACTS experiment will depend on how accurately the rain-fade statistics and fade dynamics can be predicted in order to derive an appropriate algorithm that will combat weather vagaries, specifically for links with small terminals, such as very small aperture terminals (VSAT's) where the power margin is a premium. The planning process and hardware development program that will comply with the recommendations of the ACTS propagation study groups are described.

Chakraborty, D.↗
NASA NTRS1991

The ACTS propagation program

The purpose of the Advanced Communications Technology Satellite (ACTS) is to demonstrate the feasibility of the Ka-band (20 and 30 GHz) spectrum for satellite communications, as well as to help maintain U.S. leadership in satellite communications. ACTS incorporates such innovative schemes as time division multiple access (TDMA), microwave and baseband switching, onboard regeneration, and adaptive application of coding during rain-fade conditions. The success or failure of the ACTS experiment will depend on how accurately the rain-fade statistics and fade dynamics can be predicted in order to derive an appropriate algorithm that will combat weather vagaries, specifically for links with small terminals, such as very small aperture terminals (VSAT's) where the power margin is a premium. This article describes the planning process and hardware development program that will comply with the recommendations of the ACTS propagation study groups.

Chakraborty, Dayamoy↗
NASA NTRS1998

Efficient 3D 'Atomistic' Simulation Technique for Studying of Random Dopant Induced Threshold Voltage Lowering and Fluctuations in Decanano MOSFETs

A 3D 'atomistic' simulation technique to study random dopant induced threshold voltage lowering and fluctuations in sub 0.1 micron MOSFETs is presented. It allows statistical analysis of random impurity effects down to the individual impurity level. Efficient algorithms based on a single solution of Poisson's equation, followed by the solution of a simplified current continuity equation are used in the simulations.

Asenov, Asen↗