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 811 records · Page 45

Lossless Astronomical Image Compression and the Effects of Random Noise

In this paper we compare a variety of modern image compression methods on a large sample of astronomical images. We begin by demonstrating from first principles how the amount of noise in the image pixel values sets a theoretical upper limit on the lossless compression ratio of the image. We derive simple procedures for measuring the amount of noise in an image and for quantitatively predicting how much compression will be possible. We then compare the traditional technique of using the GZIP utility to externally compress the image, with a newer technique of dividing the image into tiles, and then compressing and storing each tile in a FITS binary table structure. This tiled-image compression technique offers a choice of other compression algorithms besides GZIP, some of which are much better suited to compressing astronomical images. Our tests on a large sample of images show that the Rice algorithm provides the best combination of speed and compression efficiency. In particular, Rice typically produces 1.5 times greater compression and provides much faster compression speed than GZIP. Floating point images generally contain too much noise to be effectively compressed with any lossless algorithm. We have developed a compression technique which discards some of the useless noise bits by quantizing the pixel values as scaled integers. The integer images can then be compressed by a factor of 4 or more. Our image compression and uncompression utilities (called fpack and funpack) that were used in this study are publicly available from the HEASARC web site.Users may run these stand-alone programs to compress and uncompress their own images.

Pence, William↗

On obtaining the forward phase functions of Saturn ring features from radio occultation observations

It is noted that the near-forward scattering functions of particles in Saturn ring features are related to 3.6 cm radio occultation power spectra by a Fredholm integral equation of the first kind. The equation reduces to an algebraic system of equation whose solution by usual inversion techniques (that is, least mean squares) is ruled out by the near singularity of the forward transformation matrix. A combination of constrained linear inversion and a filtering algorithm based on eigenvector decomposition of the matrix reduces the instabilities; this yields derived phase functions valid over the range of zero to about 12 mrad. It is noted that these functions represent the collective forward diffraction lobe of particles greater than about 1 m in radius. Since multiple scattering of the signal is a significant effect, the measured phase functions must be adjusted to obtain the singly scattered component. This single-scattering correction is examined for two physical models, namely the monolayer and the classical discrete random slab; in addition, the fraction of opacity in submeter particles for each model for particular ring features is estimated.

Zebker, H. A.↗

From pixels to patterns: Coupling Optical Coherence Tomography and machine learning for monitoring coastal wetland root systems

Coastal wetlands are crucial in shoreline stabilization, carbon sequestration, and storm protection. Yet, due to limitations in traditional destructive sampling techniques, the belowground biomass (live root mass) and necromass (dead and decaying roots) remain difficult to assess in coastal wetlands, limiting our understanding on coastal resilience, nutrient cycling, and soil structure. This study employs Optical Coherence Tomography (OCT) as a high-resolution imaging technique to analyze root biomass and necromass in the Terrebonne Basin, Louisiana. A Random Forest (RF) model was developed to classify root health states based on OCT-derived features, achieving an accuracy of 70% in distinguishing live from dead root segments. The results demonstrate that OCT, combined with ML, offers a promising novel approach to root analysis, providing fine-scale insights into root morphology and decay patterns that are not easily captured by conventional methods. This research lays the foundation for future integration of OCT with complementary imaging modalities such as X-ray Computed Tomography (XCT) and advanced ML algorithms to enhance classification accuracy and scalability. Future work aims to expand the dataset diversity across different wetland types and apply the methodology for large-scale, repeatable assessments of root biomass turnover and accumulation, with important implications for wetland monitoring, conservation, and restoration under changing environmental conditions.

AI/ML↗

Non-Gaussian approach for parametric random vibration of non-linear structures

The dynamic response of a nonlinear, single degree of freedom structural system subjected to a physically white noise parametric excitation is investigated. The Ito stochastic calculus is employed to derive a general differential equation for the moments of the response coordinates. The differential equations of moments of any order are found to be coupled with higher order moments. A non-Gaussian closure scheme is developed to truncate the moment equations up to fourth order. The statistical of the stationary response are computed numerically and compared with analytical solutions predicted by a Gaussian closure scheme and the stochastic averaging method. It is found that the computed results exhibit the jump phenomenon which is typical of the characteristics of deterministic nonlinear systems. In addition, the numerical algorithm leads to multiple solutions all of which give positive mean squares. However, two of these solutions are found to violate the properties of high order moments. One solution preserves the moments properties and demonstrates that the system achieves a stationary response.

Ibrahim, R. A.↗

Development and optimization of a nonlinear multiparameter model for the human operator

A systematic method is proposed for the development, optimization, and comparison of controller-models for the human operator. This is suitable for any designed model, even multiparameter systems. A random search technique is chosen for the parameter optimization. As valuation criteria for the quality of the model development the criterion function - the comparison between the input and output functions of the human operator and those of the model - and the most important characteristic values and functions of the statistical signal theory are used. A nonlinear multiparameter model for the human operator is being designed which considers the complex input information rate per time in a single display. The nonlinear features of the model are effected by a modified threshold element and a decision algorithm. Different display-configurations as well as various transfer functions of the controlled element are explained by different optimized parameter-combinations.

Johannsen, G.↗

The ground-truth problem for satellite estimates of rain rate

In this paper a scheme is proposed to use a point raingage to compare contemporaneous measurements of rain rate from a single-field-of-view (FOV) estimate based on a satellite remote sensor such as a microwave radiometer. Even in the ideal case the measurements are different because one is at a point and the other is an area average over the field of view. Also the point gage will be located randomly inside the field of view on different overpasses. A space-time spectral formalism is combined with a simple stochastic rain field to find the mean-square deviations between the two systems. It is found that by combining about 60 visits of the satellite to the ground-truth site, the expected error can be reduced to about 10% of the standard deviation of the fluctuations of the systems alone. This seems to be a useful level of tolerance in terms of isolating and evaluating typical biases that might be contaminating retrieval algorithms.

North, Gerald R.↗

On the distribution of computation for sequential decoding using the stack algorithm

A method is developed for estimating the computational distribution for the stack algorithm for sequential decoding, that is, the probability that the computation required to decode the first branch of the tree is greater than or equal to N, for small N. The analysis relies heavily on the theory of multitype branching processes. A step in the analysis is the determination of the distribution of the minimum of the cumulative metrics along the transmitted path in the code tree. This is used to obtain the distribution of the number of computations made by the decoder in order to decode the first branch in the tree, and this random variable serves as an approximation of the average number of computations per decoded branch. At information rates below the cutoff rate, the calculated computational performance is virtually identical to that obtained by time-consuming simulations.

Johannesson, R.↗

The Influence of Correlated Crustal Signals in Modelling the Main Geomagnetic Field

Algorithms used in geomagnetic main-field modelling have for the most part treated the noise in the field measurements as if it were white. A major component of the noise consists of the field due to magnetization in the crust and it has been realized for some time that such signals are highly correlated at satellite altitude. Hence approximation by white noise, while of undoubted utility, is of unknown validity. In this paper we study two plausible statistical models for the crustal magnetization, in which the magnetization is a realization of a stationary, isotropic, random process. At a typical satellite altitude the associated fields exhibit significant correlation over ranges as great as 15 deg. or more, which introduces off-diagonal elements into the covariance matrix, elements that have usually been neglected in modelling procedures. Dealing with a full covariance matrix for a large data set would present a formidable computational challenge, but fortunately most of the entries in the covariance matrix are so small that they can be replaced by zeros. The resultant matrix comprises only about 3 per cent non-zero entries and thus we can take advantage of efficient sparse matrix techniques to solve the numerical system. We construct several main-field models based on vertical-component data from a selected 5 deg. by 5 deg. data set derived from the Magsat mission. Models with and without off-diagonal terms are compared.

Rygaard-Hjalsted, C.↗

Measurements of Turbulence Attenuation by a Dilute Dispersion of Solid Particles in Homogeneous Isotropic Turbulence

This research addresses turbulent gas flows laden with fine solid particles at sufficiently large mass loading that strong two-way coupling occurs. By two-way coupling we mean that the particle motion is governed largely by the flow, while the particles affect the gas-phase mean flow and the turbulence properties. Our main interest is in understanding how the particles affect the turbulence. Computational techniques have been developed which can accurately predict flows carrying particles that are much smaller than the smallest scales of turbulence. Also, advanced computational techniques and burgeoning computer resources make it feasible to fully resolve very large particles moving through turbulent flows. However, flows with particle diameters of the same order as the Kolmogorov scale of the turbulence are notoriously difficult to predict. Some simple flows show strong turbulence attenuation with reductions in the turbulent kinetic energy by up to a factor of five. On the other hand, some seemingly similar flows show almost no modification. No model has been proposed that allows prediction of when the strong attenuation will occur. Unfortunately, many technological and natural two-phase flows fall into this regime, so there is a strong need for new physical understanding and modeling capability. Our objective is to study the simplest possible turbulent particle-laden flow, namely homogeneous, isotropic turbulence with a uniform dispersion of monodisperse particles. We chose such a simple flow for two reasons. First, the simplicity allows us to probe the interaction in more detail and offers analytical simplicity in interpreting the results. Secondly, this flow can be addressed by numerical simulation, and many research groups are already working on calculating the flow. Our detailed data can help guide some of these efforts. By using microgravity, we can further simplify the flow to the case of no mean velocity for either the turbulence or the particles. In fact the addition of gravity as a variable parameter may help us to better understand the physics of turbulence attenuation. The experiments are conducted in a turbulence chamber capable of producing stationary or decaying isotropic turbulence with nearly zero mean flow and Taylor microscale Reynolds numbers up to nearly 500. The chamber is a 410 mm cubic box with the corners cut off to make it approximately spherical. Synthetic jet turbulence generators are mounted in each of the eight corners of the box. Each generator consists of a loudspeaker forcing a plenum and producing a pulsed jet through a 20 mm diameter orifice. These synthetic jets are directed into ejector tubes pointing towards the chamber center. The ejector tubes increase the jet mass flow and decrease the velocity. The jets then pass through a turbulence grid. Each of the eight loudspeakers is forced with a random phase and frequency. The resulting turbulence is highly Isotropic and matches typical behavior of grid turbulence. Measurements of both phases are acquired using particle image velocimetry (PIV). The gas is seeded with approximately 1 micron diameter seeding particles while the solid phase is typically 150 micron diameter spherical glass particles. A double-pulsed YAG laser and a Kodak ES-1.0 10-bit PIV camera provide the PIV images. Custom software is used to separate the images into individual images containing either gas-phase tracers or large particles. Modern high-resolution PIV algorithms are then used to calculate the velocity field. A large set of image pairs are acquired for each case, then the results are averaged both spatially and over the ensemble of acquired images. The entire apparatus is mounted in two racks which are carried aboard NASA's KC-135 Flying Microgravity Laboratory. The rack containing the turbulence chamber, the laser head, and the camera floats freely in the airplane cabin (constrained by competent NASA personnel) to minimize g-jitter.

Eaton, John↗

A methodology for airplane parameter estimation and confidence interval determination in nonlinear estimation problems

An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. With the fitted surface, sensitivity information can be updated at each iteration with less computational effort than that required by either a finite-difference method or integration of the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, and thus provides flexibility to use model equations in any convenient format. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. The degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels and to predict the degree of agreement between CR bounds and search estimates.

Murphy, P. C.↗

Machine Learning-Driven Reliability Estimation of PV Inverters Considering Alert-Ambient Variability

Weather-induced spatio-temporal degradation limits outdoor PV inverter lifetime and reliability, necessitating advanced data analysis. This study employs a top-down, data-driven approach utilizing multiple machine learning (ML) algorithms to estimate inverter reliability in a 1.4 MW PV power plant, considering factors such as irradiance, humidity, temperature, time of day, and weather conditions. An extensive alert dataset from 17 identical inverters, including alert types, propagation, and frequency, reveals significant correlations with environmental factors and inverter output power, enabling the construction of a performance reliability model. Dual-stage supervised-ML models are evaluated for accuracy, with the ‘classification-regression’ model by an artificial neural network (ANN) tested on the averaged “Alert-Ambient” dataset, which is outperformed by ‘clustering-regression’ models using random forest (RF) and K-Nearest Neighbors (KNN) on individual inverter datasets. K-means clustering applies principal component analysis to reduce dimensions, achieving improved accuracy beyond the 80% achieved by ANN on the averaged dataset. Second-stage regression estimates inverter reliability with a mean square error of 0.0195 on the averaged dataset and as low as 0.002 on individual inverter datasets using RF. Furthermore, these findings highlight the method's suitability for estimating PV inverter output reliability under ambient conditions, essential for digital twin development and related applications.

14 SOLAR ENERGY↗

Discrete Random Media Techniques for Microwave Modeling of Vegetated Terrain

Microwave remote sensing of vegetated terrain has been studied. Vegetation is modeled so that backscattered radar signals can be used to infer parameters which characterize the vegetation and underlying ground. The vegetation is modeled by discrete lossy dielectric scatterers with prescribed characteristics. The goal of the modeling effort is to remotely sense vegetation type (classification), growth stage, and plant/ground moisture. This information can then be used as input into agricultural, forestry and global circulation models. The microwave frequency spectrum, particularly L and C bands, are especially appropriate for this purpose since the wavelength is comparable to plant leaf and stem size. The resulting resonant interaction leads to backscattered data highly depend on plant shape and orientation. In addition, the transparent nature of the atmosphere in this frequency regime allows for algorithm development which requires no atmospheric correction.

Lang, R. H.↗

Modal methods in optimal control synthesis

Efficient algorithms for solving linear smoother-follower problems with quadratic criteria are presented. For time-invariant systems, the algorithm consists of one backward integration of a linear vector equation and one forward integration of another linear vector equation. Furthermore, the backward and forward Riccati matrices can be expressed in terms of the eigenvalues and eigenvectors of the Euler-Lagrange equations. Hence, the gains of the forward and backward Kalman-Bucy filters and of the optimal state-feedback regulator can be determined without integration of matrix Riccati equations. A computer program has been developed, based on this method of determining the gains, to synthesize the optimal time-invariant compensator in the presence of random disturbance inputs and random measurement errors. The program also computes the rms state and control variables of the optimal closed-loop system.

Bryson, A. E., Jr.↗

Stable Kalman filters for processing clock measurement data

Kalman filters have been used for some time to process clock measurement data. Due to instabilities in the standard Kalman filter algorithms, the results have been unreliable and difficult to obtain. During the past several years, stable forms of the Kalman filter have been developed, implemented, and used in many diverse applications. These algorithms, while algebraically equivalent to the standard Kalman filter, exhibit excellent numerical properties. Two of these stable algorithms, the Upper triangular-Diagonal (UD) filter and the Square Root Information Filter (SRIF), have been implemented to replace the standard Kalman filter used to process data from the Deep Space Network (DSN) hydrogen maser clocks. The data are time offsets between the clocks in the DSN, the timescale at the National Institute of Standards and Technology (NIST), and two geographically intermediate clocks. The measurements are made by using the GPS navigation satellites in mutual view between clocks. The filter programs allow the user to easily modify the clock models, the GPS satellite dependent biases, and the random noise levels in order to compare different modeling assumptions. The results of this study show the usefulness of such software for processing clock data. The UD filter is indeed a stable, efficient, and flexible method for obtaining optimal estimates of clock offsets, offset rates, and drift rates. A brief overview of the UD filter is also given.

Clements, P. A.↗

Mapping unstructured grid computations to massively parallel computers

Investigated here is this mapping problem: assign the tasks of a parallel program to the processors of a parallel computer such that the execution time is minimized. First, a taxonomy of objective functions and heuristics used to solve the mapping problem is presented. Next, we develop a highly parallel heuristic mapping algorithm, called Cyclic Pairwise Exchange (CPE), and discuss its place in the taxonomy. CPE uses local pairwise exchanges of processor assignments to iteratively improve an initial mapping. A variety of initial mapping schemes are tested and recursive spectral bipartitioning (RSB) followed by CPE is shown to result in the best mappings. For the test cases studied here, problems arising in computational fluid dynamics and structural mechanics on unstructured triangular and tetrahedral meshes, RSB and CPE outperform methods based on simulated annealing. Much less time is required to do the mapping and the results obtained are better. Compared with random and naive mappings, RSB and CPE reduce the communication time two fold for the test problems used. Finally, we use CPE in two applications on a CM-2. The first application is a data parallel mesh-vertex upwind finite volume scheme for solving the Euler equations on 2-D triangular unstructured meshes. CPE is used to map grid points to processors. The performance of this code is compared with a similar code on a Cray-YMP and an Intel iPSC/860. The second application is parallel sparse matrix-vector multiplication used in the iterative solution of large sparse linear systems of equations. We map rows of the matrix to processors and use an inner-product based matrix-vector multiplication. We demonstrate that this method is an order of magnitude faster than methods based on scan operations for our test cases.

Hammond, Steven Warren↗

Validation of MODIS 3 km Land Aerosol Optical Depth from NASA's EOS Terra and Aqua Missions

In addition to the standard resolution product (10km), the MODerate resolution Imaging Spectroradiometer (MODIS) Collection 6 (C006) data release included a higher resolution (3km). Other than accommodations for the two different resolutions, the 10 and 3km Dark Target (DT) algorithms are basically the same. In this study, we perform global validation of the higher-resolution aerosol optical depth (AOD) over global land by comparing against AErosol RObotic NETwork (AERONET) measurements. The MODIS-AERONET collocated data sets consist of 161410 high-confidence AOD pairs from 2000 to 2015 for Terra MODIS and 2003 to 2015 for Aqua MODIS. We find that 62.5 and 68.4% of AODs retrieved from Terra MODIS and Aqua MODIS, respectively, fall within previously published expected error bounds of +/-(0.05+0.2 × AOD), with a high correlation (R = 0.87). The scatter is not random, but exhibits a mean positive bias of ∼ 0.06 for Terra and ∼ 0.03 for Aqua. These biases for the 3km product are approximately 0.03 larger than the biases found in similar validations of the 10km product. The validation results for the 3km product did not have a relationship to aerosol loading (i.e., true AOD), but did exhibit dependence on quality flags, region, viewing geometry, and aerosol spatial variability. Time series of global MODIS-AERONET differences show that validation is not static, but has changed over the course of both sensors' lifetimes, with Terra MODIS showing more change over time. The likely cause of the change of validation over time is sensor degradation, but changes in the distribution of AERONET stations and differences in the global aerosol system itself could be contributing to the temporal variability of validation.

Gupta, Pawan↗

Testing convolutional neural network based deep learning systems: a statistical metamorphic approach

Machine learning technology spans many areas and today plays a significant role in addressing a wide range of problems in critical domains,i.e., healthcare, autonomous driving, finance, manufacturing, cybersecurity,etc. Metamorphic testing (MT) is considered a simple but very powerful approach in testing such computationally complex systems for which either an oracle is not available or is available but difficult to apply. Conventional metamorphic testing techniques have certain limitations in verifying deep learning-based models (i.e., convolutional neural networks (CNNs)) that have a stochastic nature (because of randomly initializing the network weights) in their training. In this article, we attempt to address this problem by using a statistical metamorphic testing (SMT) technique that does not require software testers to worry about fixing the random seeds (to get deterministic results) to verify the metamorphic relations (MRs). We propose seven MRs combined with different statistical methods to statistically verify whether the program under test adheres to the relation(s) specified in the MR(s). We further use mutation testing techniques to show the usefulness of the proposed approach in the healthcare space and test two CNN-based deep learning models (used for pneumonia detection among patients). The empirical results show that our proposed approach uncovers 85.71% of the implementation faults in the classifiers under test (CUT). Furthermore, we also propose an MRs minimization algorithm for the CUT, thus saving computational costs and organizational testing resources.

Computer Science↗

Electromagnetic Scattering by Discrete Random Media. IV: Coherent Backscattering

The problem of backscattering of light by a discrete random medium illuminated by an obliquely incident plane electromagnetic wave is considered.The analysis is performed in a linear-polarization basis and includes a complete derivation of the cross reflection matrix for a layer with densely and sparsely distributed particles, the design of an approximate method for computing the ladder and cross reflection matrices in the case of a semi-infinite medium with a sparse distribution of particles, the derivation of the relations between the elements of the ladder and cross reflection matrices in the exact backscattering direction for dense and sparse media, and the development of practical algorithms for solving the underlying integral equations by the method of Picard iterations and the discrete ordinate method. Simulation results for particles with large size parameters are also presented.

Adrian Doicu↗