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 181 records · Page 10

Laboratory for Engineering Man/Machine Systems (LEMS): System identification, model reduction and deconvolution filtering using Fourier based modulating signals and high order statistics

Several important problems in the fields of signal processing and model identification, such as system structure identification, frequency response determination, high order model reduction, high resolution frequency analysis, deconvolution filtering, and etc. Each of these topics involves a wide range of applications and has received considerable attention. Using the Fourier based sinusoidal modulating signals, it is shown that a discrete autoregressive model can be constructed for the least squares identification of continuous systems. Some identification algorithms are presented for both SISO and MIMO systems frequency response determination using only transient data. Also, several new schemes for model reduction were developed. Based upon the complex sinusoidal modulating signals, a parametric least squares algorithm for high resolution frequency estimation is proposed. Numerical examples show that the proposed algorithm gives better performance than the usual. Also, the problem was studied of deconvolution and parameter identification of a general noncausal nonminimum phase ARMA system driven by non-Gaussian stationary random processes. Algorithms are introduced for inverse cumulant estimation, both in the frequency domain via the FFT algorithms and in the domain via the least squares algorithm.

Pan, Jianqiang↗

COWALKER:EFFECTIVE TRANSPORT PROPERTIES OF COMPOSITE MATERIALS

SF-23-026 This software computes effective transport properties of composite materials involving fibers and nanoparticles using a random-walk algorithm that efficiently scales to an arbitrary number of processes and cores. Effective transport properties (thermal, electrical) are key to bridge the microstructure of complex materials with its macroscopic behavior. Traditional approaches either use effective medium approximations (closed mathematical expressions that are approximation for certain conditions) or continuum simulation models such as finite element or finite volume, which require the generation of a mesh for each configuration explored. cowalker leverages the equivalence between laplacian or heat equation-based models and random walks to compute the asymptotic transport properties from an ensemble of first sojourn times of a random walker moving through the composite material. This allows us to directly define a composite material as a collection of particles and use algorithms developed for molecular dynamics to quickly compute the intersection of the walker with the different interfaces in the material. cowalker is developed in C++, and it relies on the GNU Scientific Library for random generation. cowalker is currently delivered as source code, so the GSL library is not included in cowalker's distribution. A more userfriendly version, cowalker.jl is currently in development and will be released as part of cowalker.

YANGUAS-GIL, ANGEL↗

Hashed Binary Search Sampling for Convolutional Network Training with Large Overhead Image Patches

Very large overhead imagery associated with ground truth maps has the potential to generate billions of training image patches for machine learning algorithms. However, random sampling selection criteria often leads to redundant and noisy-image patches for model training. With minimal research efforts behind this challenge, the current status spells missed opportunities to develop supervised learning algorithms that generalize over wide geographical scenes. In addition, much of the computational cycles for large scale machine learning are poorly spent crunching through noisy and redundant image patches. We demonstrate a potential framework to address these challenges specifically, while evaluating a human settlement detection task. A novel binary search tree sampling scheme is fused with a kernel based hashing procedure that maps image patches into hash-buckets using binary codes generated from image content. The framework exploits inherent redundancy within billions of image patches to promote mostly high variance preserving samples for accelerating algorithmic training and increasing model generalization.

Lunga, Dalton↗

A Comparison of Forecast Error Generators for Modeling Wind and Load Uncertainty

This paper presents four algorithms to generate random forecast error time series, including a truncated-normal distribution model, a state-space based Markov model, a seasonal autoregressive moving average (ARMA) model, and a stochastic-optimization based model. The error time series are used to create real-time (RT), hour-ahead (HA), and day-ahead (DA) wind and load forecast time series that statistically match historically observed forecasting data sets, used for variable generation integration studies. A comparison is made using historical DA load forecast and actual load values to generate new sets of DA forecasts with similar stoical forecast error characteristics. This paper discusses and compares the capabilities of each algorithm to preserve the characteristics of the historical forecast data sets.

Lu, Ning↗

Machine Learning Application to Atmospheric Chemistry Modeling

Atmospheric chemistry is a high-dimensionality, large-data problem and thus may be suited to machine-learning algorithms. We show here the potential of a random forest regression algorithm to replace the gas-phase chemistry solver in the GEOS-Chem chemistry model. In this proof-of-concept study, we used one month of model output to train random forest regression models to predict the concentrations of each long-lived chemical species after integration based upon the physical and chemical conditions before the chemical integration. The choice of prediction type has a strong impact on the skill of the regression model. We find best results from predicting the change in concentration for very long-lived species and the absolute concentration for shorter lived species. The skill of the machine learning algorithm is further improved by using a family approach for NO and NO2 rather than treating them independently.By replacing the numerical integrator with the random forest algorithm and running this model for one month, we find that the model is able to reproduce many of the features of the reference chemistry simulation. Replacing the integration methodology with a machine learning algorithm has the potential to be substantially faster. There are a wide range of applications for such an approach, e.g. to generate boundary conditions, for use in air quality forecasts or chemical data assimilation systems, etc.

Keller, Christoph A.↗

Developing a SARS-CoV-2 main protease binding prediction random forest model for drug repurposing for COVID-19 treatment

The coronavirus disease 2019 (COVID-19) global pandemic resulted in millions of people becoming infected with the severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) virus and close to seven million deaths worldwide. It is essential to further explore and design effective COVID-19 treatment drugs that target the main protease of SARS-CoV-2, a major target for COVID-19 drugs. In this study, machine learning was applied for predicting the SARS-CoV-2 main protease binding of Food and Drug Administration (FDA)-approved drugs to assist in the identification of potential repurposing candidates for COVID-19 treatment. Ligands bound to the SARS-CoV-2 main protease in the Protein Data Bank and compounds experimentally tested in SARS-CoV-2 main protease binding assays in the literature were curated. These chemicals were divided into training (516 chemicals) and testing (360 chemicals) data sets. To identify SARS-CoV-2 main protease binders as potential candidates for repurposing to treat COVID-19, 1188 FDA-approved drugs from the Liver Toxicity Knowledge Base were obtained. A random forest algorithm was used for constructing predictive models based on molecular descriptors calculated using Mold2 software. Model performance was evaluated using 100 iterations of fivefold cross-validations which resulted in 78.8% balanced accuracy. The random forest model that was constructed from the whole training dataset was used to predict SARS-CoV-2 main protease binding on the testing set and the FDA-approved drugs. Model applicability domain and prediction confidence on drugs predicted as the main protease binders discovered 10 FDA-approved drugs as potential candidates for repurposing to treat COVID-19. Our results demonstrate that machine learning is an efficient method for drug repurposing and, thus, may accelerate drug development targeting SARS-CoV-2.

Research & Experimental Medicine↗

Random Matrix Approach to Quantum Adiabatic Evolution Algorithms

We analyze the power of quantum adiabatic evolution algorithms (Q-QA) for solving random NP-hard optimization problems within a theoretical framework based on the random matrix theory (RMT). We present two types of the driven RMT models. In the first model, the driving Hamiltonian is represented by Brownian motion in the matrix space. We use the Brownian motion model to obtain a description of multiple avoided crossing phenomena. We show that the failure mechanism of the QAA is due to the interaction of the ground state with the "cloud" formed by all the excited states, confirming that in the driven RMT models. the Landau-Zener mechanism of dissipation is not important. We show that the QAEA has a finite probability of success in a certain range of parameters. implying the polynomial complexity of the algorithm. The second model corresponds to the standard QAEA with the problem Hamiltonian taken from the Gaussian Unitary RMT ensemble (GUE). We show that the level dynamics in this model can be mapped onto the dynamics in the Brownian motion model. However, the driven RMT model always leads to the exponential complexity of the algorithm due to the presence of the long-range intertemporal correlations of the eigenvalues. Our results indicate that the weakness of effective transitions is the leading effect that can make the Markovian type QAEA successful.

Boulatov, Alexei↗

Search on a hypercubic lattice using a quantum random walk. I. d>2

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighboring locations. We construct a quantum random walk algorithm, based on discretization of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, that is, to find a marked vertex on a d-dimensional hypercubic lattice. The restriction on movement hardly matters for d>2, and scaling behavior close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimize the proportionality constants of the scaling behavior, and demonstrate the approach to that for Grover's algorithm (equivalent to the mean-field theory or the d{yields}{infinity} limit). In particular, the scaling behavior for d=3 is only about 25% higher than the optimal d{yields}{infinity} value.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rocky Mountain Disasters - Using NASA Earth Observations to Monitor Post-Fire Vegetation Recovery in the Colorado Front Range

Forest composition and structure in the Colorado Front Range has been altered by changing wildfire regimes. In particular, increased moderate- and high-severity fire significantly reduces forest cover following fire and often results in reduced seedling regeneration. Reduced tree canopy regrowth has chronic effects on upland ecological function and downstream water quality. This project partnered with the US Forest Service to estimate long-term vegetation recovery following four Colorado Front Range fires between 1996 and 2002—the Bobcat, Buffalo Creek, Hayman, and High Meadows fires—using Landsat 5 Thematic Mapper (TM),Landsat 7 Enhanced Thematic Mapper (ETM+), and Landsat 8 Operational Land Imager (OLI). The random forest algorithm was applied to produce maps of percent forest canopy cover for coniferous trees, deciduous trees, and all trees using time-series variables for pre- and post-fire as inputs. Similarly, maps of post-fire seedling regeneration were produced using random forest for coniferous trees,deciduous trees, and all trees using ecological drivers (soil, climate, fire, and topography) and pre-fire remote sensing predictors. Relationships between ecological drivers of post-fire vegetation trajectories were also evaluated. Additional analyses were conducted to (1) assess whether seedlings could be detected by Landsat or synthetic aperture radar (SAR) time-series analysis (2) assess pre-fire and post-fire Landsat variables against pre-fire and post-fire tree cover estimates to evaluate whether magnitude of forest change can be detected. Understanding variables that influence vegetative recovery, vegetation type conversion, and watershed characteristics will aid forest restoration efforts and water quality management.

Eric Jensen↗

Model-based optimization of near-field binary-pixelated beam shapers

The optimization of components that rely on spatially dithered distributions of transparent or opaque pixels and an imaging system with far-field filtering for transmission control is demonstrated. The binary-pixel distribution can be iteratively optimized to lower an error function that takes into account the design transmission and the characteristics of the required far-field filter. Simulations using a design transmission chosen in the context of high-energy lasers show that the beam-fluence modulation at an image plane can be reduced by a factor of 2, leading to performance similar to using a non-optimized spatial-dithering algorithm with pixels of size reduced by a factor of 2 without the additional fabrication complexity or cost. The optimization process preserves the pixel distribution statistical properties. Analysis shows that the optimized pixel distribution starting from a high-noise distribution defined by a random-draw algorithm should be more resilient to fabrication errors than the optimized pixel distributions starting from a low-noise, error-diffusion algorithm, while leading to similar beamshaping performance. Furthermore, this is confirmed by experimental results obtained with various pixel distributions and induced fabrication errors.

43 PARTICLE ACCELERATORS↗

A MACHINE-LEARNING METHOD TO INFER FUNDAMENTAL STELLAR PARAMETERS FROM PHOTOMETRIC LIGHT CURVES

A fundamental challenge for wide-field imaging surveys is obtaining follow-up spectroscopic observations: there are >10{sup 9} photometrically cataloged sources, yet modern spectroscopic surveys are limited to ∼few× 10{sup 6} targets. As we approach the Large Synoptic Survey Telescope era, new algorithmic solutions are required to cope with the data deluge. Here we report the development of a machine-learning framework capable of inferring fundamental stellar parameters (T {sub eff}, log g, and [Fe/H]) using photometric-brightness variations and color alone. A training set is constructed from a systematic spectroscopic survey of variables with Hectospec/Multi-Mirror Telescope. In sum, the training set includes ∼9000 spectra, for which stellar parameters are measured using the SEGUE Stellar Parameters Pipeline (SSPP). We employed the random forest algorithm to perform a non-parametric regression that predicts T {sub eff}, log g, and [Fe/H] from photometric time-domain observations. Our final optimized model produces a cross-validated rms error (RMSE) of 165 K, 0.39 dex, and 0.33 dex for T {sub eff}, log g, and [Fe/H], respectively. Examining the subset of sources for which the SSPP measurements are most reliable, the RMSE reduces to 125 K, 0.37 dex, and 0.27 dex, respectively, comparable to what is achievable via low-resolution spectroscopy. For variable stars this represents a ≈12%-20% improvement in RMSE relative to models trained with single-epoch photometric colors. As an application of our method, we estimate stellar parameters for ∼54,000 known variables. We argue that this method may convert photometric time-domain surveys into pseudo-spectrographic engines, enabling the construction of extremely detailed maps of the Milky Way, its structure, and history.

79 ASTRONOMY AND ASTROPHYSICS↗

Impacts of Snow and Cloud Covers on Satellite-Derived PM 2.5 Levels

Satellite aerosol optical depth (AOD) has been widely employed to evaluate ground fine particle (PM 2.5 ) levels, whereas snow/cloud covers often lead to a large proportion of non-random missing AOD. As a result, the fully covered and unbiased PM 2.5 estimates will be hard to generate. Among the current approaches to deal with the data gap issue, few have considered the cloud-AOD relationship and none of them have considered the snow-AOD relationship. This study examined the impacts of snow and cloud covers on AOD and PM 2.5 and made full-coverage PM 2.5 predictions with the consideration of these impacts. To estimate the missing AOD, daily gap-filling models with snow/cloud fractions and meteorological covariates were developed using the random forest algorithm. By using these models in New York State, a daily AOD data set with a 1-km resolution was generated with a complete coverage. The“out-of-bag” R 2 of the gap-filling models averaged 0.93 with an interquartile range from 0.90 to 0.95. Subsequently, a random forest-based PM 2.5 prediction model with the gap-filled AOD and covariates was built to predict fully covered PM 2.5 estimates. A ten-fold cross-validation for the prediction model showed a good performance with an R 2 of 0.82. In the gap-filling models, the snow fraction was of higher significance in the snow season compared with the rest of the year. The prediction models fitted with/without the snow fraction also suggested the discernible changes in PM 2.5 patterns, further confirming the significance of this parameter. Compared with the methods without considering snow and cloud covers, our PM 2.5 prediction surfaces showed more spatial details and reflected small-scale terrain-driven PM 2.5 patterns. The proposed methods can be generalized to the areas with extensive snow/cloud covers and large proportions of missing satellite AOD for predicting PM 2.5 levels with high resolutions and complete coverage.

AOD↗

SPLENDAQ: A Detector-Agnostic Data Acquisition System for Small-Scale Physics Experiments

Many scientific applications from rare-event searches to condensed matter system characterization to high-rate nuclear experiments require time-domain triggering on a raw stream of data, where the triggering is generally threshold-based or randomly acquired. When carrying out detector R &D, there is a need for a general data acquisition (DAQ) system to quickly and efficiently process such data. In the SPLENDOR collaboration, we are developing the Python-based SPLENDAQ package for this exact purpose—it offers two main features for offline analysis of continuous data: a threshold triggering algorithm based on the time-domain optimal filter formalism and an algorithm for randomly choosing nonoverlapping segments for noise measurements. Further, combined with the commercially available Moku platform, developed by Liquid Instruments, we have a full pipeline of event building off raw data with minimal setup. Here, we review the underlying principles of this detector-agnostic DAQ package and give concrete examples of its utility in various applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

FORMATION OF FORMALDEHYDE AND CARBON DIOXIDE ON AN ICY GRAIN ANALOG USING FAST HYDROGEN ATOMS

Formaldehyde (H{sub 2}CO) and carbon dioxide (CO{sub 2}) were produced in collisions of a superthermal, 3 eV beam of H({sup 2}S) atoms with CO molecules adsorbed on a gold surface at 4.8 K. The reaction-generated products were detected and analyzed using the techniques of temperature programmed desorption (TPD), quadrupole mass spectrometry, and a novel application of the Metropolis algorithm, random-walk procedure to identify the unique fractionation patterns of H{sub 2}CO and CO{sub 2} from the patterns of other species such as N{sub 2}, CO, and H{sub 2}O embedded in the CO blanket and devolved in the TPD/mass spectrometry process. Reaction sequences are given to account for the formation of H{sub 2}CO and CO{sub 2}.

79 ASTRONOMY AND ASTROPHYSICS↗

Using machine learning to identify extragalactic globular cluster candidates from ground-based photometric surveys of M87

Globular clusters (GCs) have been at the heart of many longstanding questions in many sub-fields of astronomy and, as such, systematic identification of GCs in external galaxies has immense impacts. In this study, we take advantage of M87’s well-studied GC system to implement supervised machine learning (ML) classification algorithms – specifically random forest and neural networks – to identify GCs from foreground stars and background galaxies, using ground-based photometry from the Canada–France–Hawaii Telescope (CFHT). We compare these two ML classification methods to studies of ‘human-selected’ GCs and find that the best-performing random forest model can reselect 61.2 per cent ± 8.0 per cent of GCs selected from HST data (ACSVCS) and the best-performing neural network model reselects 95.0 per cent ± 3.4 per cent. When compared to human-classified GCs and contaminants selected from CFHT data – independent of our training data – the best-performing random forest model can correctly classify 91.0 per cent ± 1.2 per cent and the best-performing neural network model can correctly classify 57.3 per cent ± 1.1 per cent. ML methods in astronomy have been receiving much interest as Vera C. Rubin Observatory prepares for first light. The observables in this study are selected to be directly comparable to early Rubin Observatory data and the prospects for running ML algorithms on the upcoming data set yields promising results.

79 ASTRONOMY AND ASTROPHYSICS↗

Diverging climate response of corn yield and carbon use efficiency across the U.S.

Abstract In this paper, we developed an open-source package to analyze the overall trend and responses of both carbon use efficiency (CUE) and corn yield to climate factors for the contiguous United States. Our algorithm enables automatic retrieval of remote sensing data through the Google Earth Engine (GEE) and U.S. Department of Agriculture (USDA) agricultural production data at the county level through application programming interface (API). Firstly, we integrated satellite products of net primary productivity and gross primary productivity based on the Moderate Resolution Imaging Spectroradiometer (MODIS) sensor, and climatic variables from the European Centre for Medium-Range Weather Forecasts. Secondly, we calculated CUE and commonly used climate metrics. Thirdly, we investigated the spatial heterogeneity of these variables. We applied a random forest algorithm to identify the key climate drivers of CUE and crop yield, and estimated the responses of CUE and yield to climate variability using the spatial moving window regression across the U.S. Our results show that growing degree days (GDD) has the highest predictive power for both CUE and yield, while extreme degree days (EDD) is the least important explanatory variable. Moreover, we observed that in most areas of the U.S., yield increases or stays the same with higher GDD and precipitation. However, CUE decreases with higher GDD in the north and shows more mixed and fragmented interactions in the south. Notably, there are some exceptions where yield is negatively correlated with precipitation in the Missouri and Mississippi River Valleys. As global warming continues, we anticipate a decrease in CUE throughout the vast northern part of the country, despite the possibility of yield remaining stable or increasing.

54 ENVIRONMENTAL SCIENCES↗

Grouper: A Compact, Streamable Triangle Mesh Data Structure

Here, we present Grouper: an all-in-one compact file format, random-access data structure, and streamable representation for large triangle meshes. Similarly to the recently published SQuad representation, Grouper represents the geometry and connectivity of a mesh by grouping vertices and triangles into fixed-size records, most of which store two adjacent triangles and a shared vertex. Unlike SQuad, however, Grouper interleaves geometry with connectivity and uses a new connectivity representation to ensure that vertices and triangles can be stored in a coherent order that enables memory-efficient sequential stream processing. We also present a linear-time construction algorithm that allows streaming out Grouper meshes using a small memory footprint while preserving the initial ordering of vertices. In this construction, we show how the problem of assigning vertices and triangles to groups reduces to a well-known NP-hard optimization problem, and present a simple yet effective heuristic solution that performs well in practice. Our array-based Grouper representation also doubles as a triangle mesh data structure that allows direct access to vertices and triangles. Storing only about two integer references per triangle-i.e., less than the three vertex references stored with each triangle in a conventional indexed mesh format-Grouper answers both incidence and adjacency queries in amortized constant time. Our compact representation enables data-parallel processing on multicore computers, instant partitioning and fast transmission for distributed processing, as well as efficient out-of-core access. We demonstrate the versatility and performance benefits of Grouper using a suite of example meshes and processing kernels.

97 MATHEMATICS AND COMPUTING↗

Automatic fitting of multiple-field solid-state NMR spectra

The NMR lineshapes produced by half-integer quadrupolar nuclei are sensitive to 11 distinct fit parameters per inequivalent site. To date, automatic fitting routines have failed to replace manual parameter insertion and evaluation due to the importance of local minima and the need for fitting multiple-field magic-angle spinning (MAS) and static spectra simultaneously. Herein we introduce a new tool, AMES-Fit (Automatic Multiple Experiment Simulation and Fitting), to automatically find the global best-fit simulation parameters for a series of multiple-field NMR lineshapes. AMES-Fit uses an adaptive step size random search algorithm to dynamically probe parameter space and requires minimal human input. Importantly, the best fits are obtained in a few minutes of computation time that would otherwise have required several person-hours of work. The program is freely available and open-source.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗