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.
Statistical Learning Techniques for Variational Quantum Algorithms.
Abstract not provided.
Spatial Statistics of Large Astronomical Databases: An Algorithmic Approach
In this AISRP, the we have demonstrated that the correlation function i) can be calculated for MAP in minutes (about 45 minutes for Planck) on a modest 500Mhz workstation ii) the corresponding method, although theoretically suboptimal, produces nearly optimal results for realistic noise and cut sky. This trillion fold improvement in speed over the standard maximum likelihood technique opens up tremendous new possibilities, which will be persued in the follow up.
Analysis of sequencing and scheduling methods for arrival traffic
The air traffic control subsystem that performs scheduling is discussed. The function of the scheduling algorithms is to plan automatically the most efficient landing order and to assign optimally spaced landing times to all arrivals. Several important scheduling algorithms are described and the statistical performance of the scheduling algorithms is examined. Scheduling brings order to an arrival sequence for aircraft. First-come-first-served scheduling (FCFS) establishes a fair order, based on estimated times of arrival, and determines proper separations. Because of the randomness of the traffic, gaps will remain in the scheduled sequence of aircraft. These gaps are filled, or partially filled, by time-advancing the leading aircraft after a gap while still preserving the FCFS order. Tightly scheduled groups of aircraft remain with a mix of heavy and large aircraft. Separation requirements differ for different types of aircraft trailing each other. Advantage is taken of this fact through mild reordering of the traffic, thus shortening the groups and reducing average delays. Actual delays for different samples with the same statistical parameters vary widely, especially for heavy traffic.
A Locally Adaptive Method for Boundary Detection
Edge detection techniques predict boundaries between objects or regions in an image. Many classical methods rely on sharp changes in luminance, chromaticity, or texture, and images without these features are difficult to partition correctly. We present a supervised boundary detection method named Locally Adaptive Discriminant Analysis (LADA) that finds edges in images containing high noise and gradual changes between classes. The user trains the algorithm by providing locations of known materials within the image, but no assumptions are made on the material geometries in the image. The algorithm then uses statistics of anisotropic local data to place each pixel in the most probable class. The algorithm’s success is demonstrated on an optical image of a laser-induced shockwave.
Software for Data Analysis with Graphical Models
Probabilistic graphical models are being used widely in artificial intelligence and statistics, for instance, in diagnosis and expert systems, as a framework for representing and reasoning with probabilities and independencies. They come with corresponding algorithms for performing statistical inference. This offers a unifying framework for prototyping and/or generating data analysis algorithms from graphical specifications. This paper illustrates the framework with an example and then presents some basic techniques for the task: problem decomposition and the calculation of exact Bayes factors. Other tools already developed, such as automatic differentiation, Gibbs sampling, and use of the EM algorithm, make this a broad basis for the generation of data analysis software.
A histogram-free multicanonical Monte Carlo algorithm for the construction of analytical density of states
We report a new multicanonical Monte Carlo (MC) algorithm to obtain the density of states (DOS) for physical systems with continuous state variables in statistical mechanics. Our algorithm is able to obtain an analytical form for the DOS expressed in a chosen basis set, instead of a numerical array of finite resolution as in previous variants of this class of MC methods such as the multicanonical (MUCA) sampling and Wang-Landau (WL) sampling. This is enabled by storing the visited states directly in a data set and avoiding the explicit collection of a histogram. This practice also has the advantage of avoiding undesirable artificial errors caused by the discretization and binning of continuous state variables. Our results show that this scheme is capable of obtaining converged results with a much reduced number of Monte Carlo steps, leading to a significant speedup over existing algorithms.
Fully quantum algorithm for mesoscale fluid simulations with application to partial differential equations
Fluid flow simulations marshal our most powerful computational resources. In many cases, even this is not enough. Quantum computers provide an opportunity to speed up traditional algorithms for flow simulations. We show that lattice-based mesoscale numerical methods can be executed as efficient quantum algorithms due to their statistical features. This approach revises a quantum algorithm for lattice gas automata to reduce classical computations and state preparation at every time step. For this, the algorithm approximates the qubit relative phases and subtracts them at the end of each time step. Phases are evaluated using the iterative phase estimation algorithm and subtracted using single-qubit rotation phase gates. Further, this method optimizes the quantum resource required and makes it more appropriate for near-term quantum hardware. We also demonstrate how the checkerboard deficiency that the D1Q2 scheme presents can be resolved using the D1Q3 scheme. The algorithm is validated by simulating two canonical partial differential equations: the diffusion and Burgers' equations on different quantum simulators. We find good agreement between quantum simulations and classical solutions for the presented algorithm.
Multiresolution spatiotemporal mechanical model of the heart as a prior to constrain the solution for 4D models of the heart
In several nuclear cardiac imaging applications (SPECT and PET), images are formed by reconstructing tomographic data using an iterative reconstruction algorithm with corrections for physical factors involved in the imaging detection process and with corrections for cardiac and respiratory motion. The physical factors are modeled as coefficients in the matrix of a system of linear equations and include attenuation, scatter, and spatially varying geometric response. The solution to the tomographic problem involves solving the inverse of this system matrix. This requires the design of an iterative reconstruction algorithm with a statistical model that best fits the data acquisition. The most appropriate model is based on a Poisson distribution. Using Bayes Theorem, an iterative reconstruction algorithm is designed to determine the maximum a posteriori estimate of the reconstructed image with constraints that maximizes the Bayesian likelihood function for the Poisson statistical model. The a priori distribution is formulated as the joint entropy (JE) to measure the similarity between the gated cardiac PET image and the cardiac MRI cine image modeled as a FE mechanical model. In conclusion, the developed algorithm shows the potential of using a FE mechanical model of the heart derived from a cardiac MRI cine scan to constrain solutions of gated cardiac PET images.
A covariance analysis algorithm for interconnected systems
A covariance analysis algorithm for propagation of signal statistics in arbitrarily interconnected nonlinear systems is presented which is applied to six-degree-of-freedom systems. The algorithm uses statistical linearization theory to linearize the nonlinear subsystems, and the resulting linearized subsystems are considered in the original interconnection framework for propagation of the signal statistics. Some nonlinearities commonly encountered in six-degree-of-freedom space-vehicle models are referred to in order to illustrate the limitations of this method, along with problems not encountered in standard deterministic simulation analysis. Moreover, the performance of the algorithm shall be numerically exhibited by comparing results using such techniques to Monte Carlo analysis results, both applied to a simple two-dimensional space-intercept problem.
Robust Cubature Kalman Filter for Dynamic State Estimation of Synchronous Machines Under Unknown Measurement Noise Statistics
The Kalman-type filtering techniques including cubature Kalman filter (CKF) does not work well in non-Gaussian environments, especially in the presence of outliers. To solve this problem, Huber's M-estimation-based robust CKF (RCKF) is proposed for synchronous machines by combining the Huber's M-estimation theory with the classical CKF, which is capable of coping with the deterioration in performance and discretization of tracking curves when measurement noise statistics deviate from the prior noise statistics. The proposed RCKF algorithm has good adaptability to unknown measurement noise statistics characteristics including non-Gaussian measurement noise and outliers. The simulation results on the WSCC 3-machine 9-bus system and New England 16-machine 68-bus system verify the effectiveness of the proposed method and its advantage over the classical CKF.
Constraining Galaxy-Halo connection using machine learning
We investigate the potential of machine learning (ML) methods to model small-scale galaxy clustering for constraining Halo Occupation Distribution (HOD) parameters. Our analysis reveals that while many ML algorithms report good statistical fits, they often yield likelihood contours that are significantly biased in both mean values and variances relative to the true model parameters. This highlights the importance of careful data processing and algorithm selection in ML applications for galaxy clustering, as even seemingly robust methods can lead to biased results if not applied correctly. ML tools offer a promising approach to exploring the HOD parameter space with significantly reduced computational costs compared to traditional brute-force methods if their robustness is established. Using our ANN-based pipeline, we successfully recreate some standard results from recent literature. Properly restricting the HOD parameter space, transforming the training data, and carefully selecting ML algorithms are essential for achieving unbiased and robust predictions. Among the methods tested, artificial neural networks (ANNs) outperform random forests (RF) and ridge regression in predicting clustering statistics, when the HOD prior space is appropriately restricted. We demonstrate these findings using the projected two-point correlation function (w p (r p )), angular multipoles of the correlation function (ξ ℓ (r)), and the void probability function (VPF) of Luminous Red Galaxies from Dark Energy Spectroscopic Instrument mocks. Our results show that while combining w p (r p ) and VPF improves parameter constraints, adding the multipoles ξ 0 , ξ 2 , and ξ 4 to w p (r p ) does not significantly improve the constraints.
Nonlinear Curve-Fitting Program
Nonlinear optimization algorithm helps in finding best-fit curve. Nonlinear Curve Fitting Program, NLINEAR, interactive curve-fitting routine based on description of quadratic expansion of X(sup 2) statistic. Utilizes nonlinear optimization algorithm calculating best statistically weighted values of parameters of fitting function and X(sup 2) minimized. Provides user with such statistical information as goodness of fit and estimated values of parameters producing highest degree of correlation between experimental data and mathematical model. Written in FORTRAN 77.
Multivariate Pointwise Information-Driven Data Sampling and Visualization
With increasing computing capabilities of modern supercomputers, the size of the data generated from the scientific simulations is growing rapidly. As a result, application scientists need effective data summarization techniques that can reduce large-scale multivariate spatiotemporal data sets while preserving the important data properties so that the reduced data can answer domain-specific queries involving multiple variables with sufficient accuracy. While analyzing complex scientific events, domain experts often analyze and visualize two or more variables together to obtain a better understanding of the characteristics of the data features. Therefore, data summarization techniques are required to analyze multi-variable relationships in detail and then perform data reduction such that the important features involving multiple variables are preserved in the reduced data. To achieve this, in this work, we propose a data sub-sampling algorithm for performing statistical data summarization that leverages pointwise information theoretic measures to quantify the statistical association of data points considering multiple variables and generates a sub-sampled data that preserves the statistical association among multi-variables. Using such reduced sampled data, we show that multivariate feature query and analysis can be done effectively. The efficacy of the proposed multivariate association driven sampling algorithm is presented by applying it on several scientific data sets.
A New Ensemble Canonical Correlation Prediction Scheme for Seasonal Precipitation
Department of Mathematical Sciences, University of Alberta, Edmonton, Canada This paper describes the fundamental theory of the ensemble canonical correlation (ECC) algorithm for the seasonal climate forecasting. The algorithm is a statistical regression sch eme based on maximal correlation between the predictor and predictand. The prediction error is estimated by a spectral method using the basis of empirical orthogonal functions. The ECC algorithm treats the predictors and predictands as continuous fields and is an improvement from the traditional canonical correlation prediction. The improvements include the use of area-factor, estimation of prediction error, and the optimal ensemble of multiple forecasts. The ECC is applied to the seasonal forecasting over various parts of the world. The example presented here is for the North America precipitation. The predictor is the sea surface temperature (SST) from different ocean basins. The Climate Prediction Center's reconstructed SST (1951-1999) is used as the predictor's historical data. The optimally interpolated global monthly precipitation is used as the predictand?s historical data. Our forecast experiments show that the ECC algorithm renders very high skill and the optimal ensemble is very important to the high value.
Stochastic relativistic viscous hydrodynamics from the Metropolis algorithm
We propose an algorithm for simulating stochastic relativistic fluid dynamics based on Metropolis updates. Each step of the algorithm begins with an update based on ideal hydrodynamics. This is followed by proposing random (spatial) momentum transfers between fluid cells, keeping the total energy fixed. These proposals are then accepted or rejected using the change in entropy as a statistical weight. The algorithm reproduces relativistic viscous hydrodynamics in the “density frame,” which is a formulation of viscous hydrodynamics we review and clarify here. This formulation is first order in time and requires no auxiliary dynamical fields such as Π 𝜇𝜈 . The only parameters are the shear and bulk viscosities and the equation of state. Here, by adopting the 3+1 split of general relativity, we extend the Metropolis algorithm to general space-time coordinates, such as Bjorken coordinates, which are commonly used to simulate heavy-ion collisions.
ARC algorithm: A novel approach to forecast and manage daily electrical maximum demand
This paper proposes an innovative algorithm for predicting short-term electrical maximum demand by using historical demand data. The ability to recognize in peak demand pattern for commercial or industrial customers would propose numerous direct and indirect benefits to the customers and utility providers in terms of demand reduction, cost control, and system stability. Prior works in electrical maximum demand forecasting have been mainly focused on seasonal effects, which is not a feasible approach for industrial manufacturing facilities in short-term load forecasting. The proposed algorithm, denoted as the Adaptive Rate of Change (ARC), determines the logarithmic rate-of-change in load profile prior to a peak by postulating the demand curve as a stochastic, mean-reverting process. The rationale behind this analysis, is that the energy efficient program requires not only demand estimation but also to warn the user of imminent maximum peak occurrence. This paper analyzes demand trend data and incorporates stochastic model and mean reverting half-life to develop an electrical maximum demand forecasting algorithm, which is statistically evaluated by cross-table and F-score for three different manufacturing facilities. Lastly, the aggregate results show an overall accuracy of 0.91 and a F-score of 0.43, which indicates that the algorithm is effective predicting peak demand in predicting peak demand.
Seasat scanning multichannel microwave radiometer - Results of the Gulf of Alaska workshop
Scanning multichannel microwave radiometer results obtained by the Gulf of Alaska Seasat Experiment Workshop are reported. The Seasat SMMR provided data from five channels operating at 6.6, 10.7, 18, 21, and 37 GHz at vertical and horizontal polarizations. Two preliminary algorithms were used to retrieve geophysical parameters from the data: the Wentz algorithm (Bierman et al., 1978) based on a theoretically derived function for computing brightness temperatures and the Wilheit algorithm, based on statistical relationships between brightness temperatures and the geophysical parameters obtained from an ensemble of realistic sea-surface temperature values, wind speeds, atmospheric temperature profiles, water vapor profiles and cloud models. In spite of the immaturity of the data-processing algorithms, results are encouraging. For open ocean, rain-free cells of high-quality surface truth wind determinations display standard deviations of 3 m/sec about a bias of 1.5 m/sec. The sea-surface temperature exhibits a standard deviation of about 1.5 deg C about a bias of 3 to 5 deg C under a variety of meteorological conditions.