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 1,063 records · Page 59

Study to assess the importance of errors introduced by applying NOAA 6 and NOAA 7 AVHRR data as an estimator of vegetative vigor: Feasibility study of data normalization

The use of NOAA AVHRR data to map and monitor vegetation types and conditions in near real-time can be enhanced by using a portion of each GAC image that is larger than the central 25% now considered. Enlargement of the cloud free image data set can permit development of a series of algorithms for correcting imagery for ground reflectance and for atmospheric scattering anisotropy within certain accuracy limits. Empirical correction algorithms used to normalize digital radiance or VIN data must contain factors for growth stage and for instrument spectral response. While it is not possible to correct for random fluctuations in target radiance, it is possible to estimate the necessary radiance difference between targets in order to provide target discrimination and quantification within predetermined limits of accuracy. A major difficulty lies in the lack of documentation of preprocessing algorithms used on AVHRR digital data.

Duggin, M. J.↗

Quantitative Detection of Single Molecules in Fluorescence Microscopy Images

Fluorescence imaging and counting of single molecules adsorbed or bound to surfaces are being employed in a number of quantitative analysis applications. Reliable molecular counts with knowledge of counting uncertainties, both false-positive and false-negative probabilities, are critical to these applications. By counting stationary single molecules on a surface, spatial criteria may be applied to the image analysis to improve confidence in detection, which is especially critical when detecting single fluorescent labels. In this work, we describe a simple approach to incorporating spatial criteria for counting single molecules by using an intensity threshold to locate regions with multiple, adjacent intense pixels, where the size of these regions is guided by the point-spread function of the microscope. By requiring multiple, spatially correlated bright pixels, false-positive events resulting from random samples of background noise are minimized. The reliability of detection is established by quantitative knowledge of the distributions of background and signals. By measuring and modeling both the background and single-molecule intensity distributions, false-positive and false-negative detection probabilities are estimated for arbitrary threshold parameters by using combinatorial statistics. From this theory, detection parameters can be optimized to minimize false-positive and false-negative probabilities, which can be calculated explicitly. For detection of single rhodamine 6G molecules at a threshold set at 2.5 times the standard deviation above background, the false-negative probability was only 1.5%, determined from distributions of single-molecule intensities on well-populated surfaces, and the false-positive probability from background noise was 2.8 spots per 50 × 50 μm image. Furthermore, the false-positive events compare favorably with theoretical probabilities calculated using combinatorial statistical analysis and simulated false-positive events counted in images of random noise.

36 MATERIALS SCIENCE↗

Probabilistic Independence Networks for Hidden Markov Probability Models

In this paper we explore hidden Markov models(HMMs) and related structures within the general framework of probabilistic independence networks (PINs). The paper contains a self-contained review of the basic principles of PINs. It is shown that the well-known forward-backward (F-B) and Viterbi algorithms for HMMs are special cases of more general enference algorithms for arbitrary PINs.

random variables pattern recognition signal proces↗

Inferring Group Processes from Computer-Mediated Affective Text Analysis

Political communications in the form of unstructured text convey rich connotative meaning that can reveal underlying group social processes. Previous research has focused on sentiment analysis at the document level, but we extend this analysis to sub-document levels through a detailed analysis of affective relationships between entities extracted from a document. Instead of pure sentiment analysis, which is just positive or negative, we explore nuances of affective meaning in 22 affect categories. Our affect propagation algorithm automatically calculates and displays extracted affective relationships among entities in graphical form in our prototype (TEAMSTER), starting with seed lists of affect terms. Several useful metrics are defined to infer underlying group processes by aggregating affective relationships discovered in a text. Our approach has been validated with annotated documents from the MPQA corpus, achieving a performance gain of 74% over comparable random guessers.

99 GENERAL AND MISCELLANEOUS↗

On the synchronizability and detectability of random PPM sequences

The problem of synchronization and detection of random pulse-position-modulation (PPM) sequences is investigated under the assumption of perfect slot synchronization. Maximum-likelihood PPM symbol synchronization and receiver algorithms are derived that make decisions based both on soft as well as hard data; these algorithms are seen to be easily implementable. Bounds derived on the symbol error probability as well as the probability of false synchronization indicate the existence of a rather severe performance floor, which can easily be the limiting factor in the overall system performance. The performance floor is inherent in the PPM format and random data and becomes more serious as the PPM alphabet size Q is increased. A way to eliminate the performance floor is suggested by inserting special PPM symbols in the random data stream.

Georghiades, Costas N.↗

On the synchronizability and detectability of random PPM sequences

The problem of synchronization and detection of random pulse-position modulation (PPM) sequences is investigated under the assumption of perfect slot synchronization. Maximum-likelihood PPM symbol synchronization and receiver algorithms are derived that make decisions based on both soft as well as hard data; these algorithms are seen to be easily implementable. Bounds were derived on the symbol error probability as well as the probability of false synchronization that indicate the existence of a rather severe performance floor, which can easily be the limiting factor in the overall system performance. The performance floor is inherent in the PPM format and random data and becomes more serious as the PPM alphabet size Q is increased. A way to eliminate the performance floor is suggested by inserting special PPM symbols in the random data stream.

Georghiades, Costas N.↗

Multiobjective insensitive design of airplane control systems with uncertain parameters

A multiobjective computer-aided design algorithm has been developed which minimizes the sensitivity of the design objectives to uncertainties in system parameters. The more important uncertain parameters are described by a gaussian random vector with known covariance matrix, and a vector sensitivity objective function is defined as the probabilities that the design objectives will violate specified requirements constraints. Control system parameters are found which minimize the sensitivity vector in a Pareto-optimal sense, using constrained minimization algorithms. Example results are shown for lateral stability augmentation system (SAS) design for three Shuttle flight conditions.

Schy, A. A.↗

Unmixing hyperspectral images using Markov random fields

This paper proposes a new spectral unmixing strategy based on the normal compositional model that exploits the spatial correlations between the image pixels. The pure materials (referred to as endmembers) contained in the image are assumed to be available (they can be obtained by using an appropriate endmember extraction algorithm), while the corresponding fractions (referred to as abundances) are estimated by the proposed algorithm. Due to physical constraints, the abundances have to satisfy positivity and sum-to-one constraints. The image is divided into homogeneous distinct regions having the same statistical properties for the abundance coefficients. The spatial dependencies within each class are modeled thanks to Potts-Markov random fields. Within a Bayesian framework, prior distributions for the abundances and the associated hyperparameters are introduced. A reparametrization of the abundance coefficients is proposed to handle the physical constraints (positivity and sum-to-one) inherent to hyperspectral imagery. The parameters (abundances), hyperparameters (abundance mean and variance for each class) and the classification map indicating the classes of all pixels in the image are inferred from the resulting joint posterior distribution. To overcome the complexity of the joint posterior distribution, Markov chain Monte Carlo methods are used to generate samples asymptotically distributed according to the joint posterior of interest. Simulations conducted on synthetic and real data are presented to illustrate the performance of the proposed algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Narrowing Frequency Probability Density Function for Achieving Minimized Uncertainties in Power Systems Operation – a Stochastic Distribution Control Perspective

With the increased penetration of renewables and other distributed energy resources (DERs), the frequency response in power systems exhibits stochastic nature, where the standard deterministic swing equation should be either represented or transferred into an Ito stochastic differential equation whose solution should be the non-stationary transient behavior of the probability density function (PDF) of the frequency. This transfers the frequency quality control for power systems into a stochastic distribution control problem, where the shape of the frequency distribution, namely the frequency PDF, needs to be directly controlled. In this context, this requires the development of control strategies via controlling the power balance so that the PDF of the frequency is made as narrow as possible whilst centered at its required mean value simple because such a sharp distribution shape means less uncertainties or randomness for the frequency response. In this paper, the formulation of the stochastic swing equation will be made first taking into account of DERs. This will then be followed by the development of stochastic distribution control model that links the power sources with the PDF of the frequency using Fokker Planck Kolmogorov (FPK) equations. A generic constrained optimization problem will be formulated where the cost function is composed of a functional distance between the actual and the desired PDFs of the frequency. A feasible solution using B-spine Neural Networks based stochastic distribution control model will be described. Using the obtained stochastic distribution control model, a set of control algorithms will be described that uses available power sources to shape the PDF of the frequency or to minimize the randomness of the frequency via minimized entropy approach. Future directions will be discussed in the later part of the paper

Swing equation, Power Systems, stchastic distribut↗

Windowed Fourier transform and cross-correlation algorithms for molecular tagging velocimetry

In this study, simulated and experimental molecular tagging velocimetry (MTV) images have been analyzed with a technique commonly used to process grid images on surfaces, the windowed Fourier transform with local spectrum analysis (WFT-LSA). A systematic synthetic image study of the modulation transfer function (MTF) and error tendencies of the WFT-LSA was performed and compared with a PIV-style cross-correlation algorithm to see if advanced strategies such as iterative image deformation can improve analysis of gridded images with high noise levels. Testing of single-pass algorithms showed that in typical MTV images, the WFT-LSA yields significantly lower bias errors than cross-correlation (CC) at displacements greater than 1 pixel but slightly higher random error at all displacements and image conditions. Analysis of the MTF shows that CC provided better resolution of spatial fluctuations than the WFT-LSA in many combinations of grid size and interrogation window. Tests of image deformation algorithms showed that the gap in performance between CC and WFT-LSA is maintained even as both methods improve. Additionally, WFT-LSA and CC methods are applied to real MTV experiments in high-speed gas jet flows. A preliminary analysis of phosphorescence lifetime provided by acetone vapor excited at 266 nm is used for assessing the required gas speeds for making MTV application feasible. The application of WFT-LSA to real MTV images demonstrates the ability of the algorithm to handle further real-world effects that could not be considered in the synthetic image analysis, like reduced signal-to-noise ratio and non-uniform intensity of the tagging grid across the image introduced by the actual laser beam energy distribution. With experimental images, CC is more accurate with shear flows but less robust to high noise levels than WFT-LSA, as predicted by the synthetic image analysis.

42 ENGINEERING↗

Arrival time of satellite-broadened laser pulses

A method for measuring the time of arrival of very narrow laser pulses which have been reflected and randomly broadened by a target is examined. It is known that these return pulses from the target have very small rise times. A threshold detection algorithm that detects the rising edge of the pulse is used for obtaining the pulse arrival times. The errors of the scheme are evaluated numerically for different pulse shapes, and a loose bound on the errors of detecting a typical pulse is obtained. A gamma-density model is used to characterize the random gain processes of the optical receiver, and the effect of such random gains on the errors of threshold detection is analyzed.

Iyer, R. S.↗

An Efficient Algorithm for Automatic Structure Optimization in X-ray Standing-Wave Experiments

We present that x-ray standing-wave photoemission experiments involving multilayered samples are emerging as unique probes of the buried interfaces that are ubiquitous in current device and materials research. Such data require for their analysis a structure optimization process comparing experiment to theory that is not straightforward. In this work, we present a new computer program for optimizing the analysis of standing-wave data, called SWOPT, that automates this trial-and-error optimization process. The program includes an algorithm that has been developed for computationally expensive problems: so-called black-box simulation optimizations. It also includes a more efficient version of the Yang X-ray Optics Program (YXRO) [Yang, S.-H., Gray, A.X., Kaiser, A.M., Mun, B.S., Sell, B.C., Kortright, J.B., Fadley, C.S., J. Appl. Phys. 113, 1 (2013)] which is about an order of magnitude faster than the original version. Human interaction is not required during optimization. We tested our optimization algorithm on real and hypothetical problems and show that it finds better solutions significantly faster than a random search approach. The total optimization time ranges, depending on the sample structure, from minutes to a few hours on a modern laptop computer, and can be up to 100x faster than a corresponding manual optimization. Finally, these speeds make the SWOPT program a valuable tool for realtime analyses of data during synchrotron experiments.

36 MATERIALS SCIENCE↗

Calibration of linear contact stiffnesses in discrete element models using a hybrid analytical-computational framework

Efficient selections of particle-scale contact parameters in discrete element modelling remain an open question. The purpose of this study is to provide a hybrid calibration framework to estimate linear contact stiffnesses (normal and tangential) for both two-dimensional and three-dimensional simulations. Analytical formulas linking macroscopic parameters (Young's modulus, Poisson's ratio) to mesoscopic particle parameters for granular systems are derived based on statistically isotropic packings under small-strain isotropic stress conditions. By taking the derived analytical solutions as initial approximations, the gradient descent algorithm automatically obtains a reliable numerical estimation. The introduced framework is validated with several numerical cases including randomly distributed monodisperse and polydisperse packings. The results show that this hybrid method practically reduces the time for artificial trials and errors to obtain reasonable stiffness parameters. The proposed framework can also be extended to other parameter calibration problems in DEM.

Calibration method↗

Thermodynamic non-ideality and disorder heterogeneity in actinide silicate solid solutions

Non-ideal thermodynamics of solid solutions can greatly impact materials degradation behavior. We have investigated an actinide silicate solid solution system (USiO 4 –ThSiO 4 ), demonstrating that thermodynamic non-ideality follows a distinctive, atomic-scale disordering process, which is usually considered as a random distribution. Neutron total scattering implemented by pair distribution function analysis confirmed a random distribution model for U and Th in first three coordination shells; however, a machine-learning algorithm suggested heterogeneous U and Th clusters at nanoscale (~2 nm). The local disorder and nanosized heterogeneous is an example of the non-ideality of mixing that has an electronic origin. Partial covalency from the U/Th 5f–O 2p hybridization promotes electron transfer during mixing and leads to local polyhedral distortions. The electronic origin accounts for the strong non-ideality in thermodynamic parameters that extends the stability field of the actinide silicates in nature and under typical nuclear waste repository conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the Investigation of Phase Fault Classification in Power Grid Signals: A Case Study for Support Vector Machines, Decision Tree and Random Forest

In monitoring the power grid, an ability to differentiate between fault types is essential to ensuring electrical safety. Accordingly, this study introduces a fault detection and classification method by considering different machine learning (ML) and feature extraction (FE) methods combinations. Specifically, the proposed method is established in two classification layers; the first layer determines the fault, and the second layer distinguishes the type of fault. Based on the proposed system model, this study seeks to determine the influential data attributes in a power grid signal using FE methods, including fast Fourier transform, power spectral density (PSD), auto-correlation, and wavelet transform (WT). A cross-comparison of the effectiveness of the Support Vector Machine (SVM), Decision Tree (DT), and Random Forest (RF) is also performed to accomplish the classification layers of the proposed method. The designed algorithm is analyzed under the various combinations of FE and ML methods, and outcomes are presented by considering the trade-off between computational complexity and prediction accuracy. The results reveal that the RF-based ML algorithm shows the most accurate classification performance with PSD, and the most time-saving of the models is the DT WT. Also, SVM emerges superior on a subsequent test of the simulated models on real-world signals.

Galbraith, Kelli↗

Measuring and Improving the Core Resilience of Networks

The concept of k-cores is important for understanding the global structure of networks, as well as for identifying central or important nodes within a network. It is often valuable to understand the resilience of the k-cores of a network to attacks and dropped edges (i.e., damaged communications links). We provide a formal definition of a network»s core resilience, and examine the problem of characterizing core resilience in terms of the network»s structural features: in particular, which structural properties cause a network to have high or low core resilience? To measure this, we introduce two novel node properties,Core Strength andCore Influence, which measure the resilience of individual nodes» core numbers and their influence on other nodes» core numbers. Using these properties, we propose theMaximize Resilience of k-Core algorithm to add edges to improve the core resilience of a network. We consider two attack scenarios - randomly deleted edges and randomly deleted nodes. Through experiments on a variety of technological and infrastructure network datasets, we verify the efficacy of our node-based resilience measures at predicting the resilience of a network, and evaluate MRKC at the task of improving a network»s core resilience. We find that on average, for edge deletion attacks, MRKC improves the resilience of a network by 11.1% over the original network, as compared to the best baseline method, which improves the resilience of a network by only 2%. For node deletion attacks, MRKC improves the core resilience of the original network by 19.7% on average, while the best baseline improves it by only 3%.

Laishram, Ricky↗

Rectification of terrain induced distortions in radar imagery

This paper describes a technique to generate geocoded synthetic aperture radar (SAR) imagery corrected for terrain induced geometric distortions. This algorithm transforms the raw slant range image, generated by the signal processor, into a map registered product, resampled to either Universal Transverse Mercator (UTM) or Polar Stereographic projections, and corrected for foreshortening. The technique utilizes the space platform trajectory information in conjunction with a digital elevation map (DEM) of the target area to generate an ortho-radar map with near-autonomous operation. The current procedure requires only two to three tie-points to compensate for the platform position uncertainty that results in translational error between the image and the DEM. This approach is unique in that it does not require generation of a simulated radar image from the DEM or a grid of tie-points to characterize the image-to-map distortions. Rather, it models the inherent distortions based on knowledge of the radar data collection characteristics, the signal Doppler parameters, and the local terrain height to automatically predict the registration transformation. This algorithm has been implemented on a minicomputer system equipped with an array processor and a large random-access memory to optimize the throughput.

Kwok, Ronald↗