Search NASASearch

SEARCH · Search NASA

Results for “randomized algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

Western Montana Ecological Forecasting: Modeling Habitat Suitability of Mustelid Species to Guide Detection Dog Surveys for Contaminants Monitoring, via Collected Scats in River Systems of Western Montana

Environmental contaminants are becoming increasingly prevalent in riverine ecosystems. The status of contaminants in western Montana’s relatively pristine river systems is largely unknown. Monitoring for heavy metals, brominated flame-retardants (BFRs), and pharmaceuticals is important due to their negative effects on ecosystems. Exposure to these contaminants can have significant endocrine, neurological, and reproductive effects. Contaminants easily travel up the food chain and bioaccumulate in apex predators. As predators with a largely aquatic diet, American mink (Mustela vison) and North American river otter (Lontra canadensis) serve as reliable indicator species of environmental health and the status of contaminants. Analysis of scat from these species is a noninvasive method to measure contaminant levels, and detection dogs from Working Dogs for Conservation (WD4C) have been used to locate these scat samples. To aid in the search of these samples, habitat suitability models were created for mink and otter for the years 2013-2020 and projected to 2040 using the random forest algorithm in the Software for Assisted Habitat Modeling (SAHM). Predictor variable data were acquired from Landsat 8 Operational Land Imager (OLI), Terra Moderate Resolution Imaging Spectroradiometer (MODIS), Global Precipitation Measurement Integrated Multi-satellite Retrievals for GPM (GPM IMERG), Shuttle Radar Topography Mission (SRTM), and Soil Moisture Active Passive (SMAP). Within these models, the most important variable for mink and otter habitat was distance to river. Suitable habitat also corresponded with emergent herbaceous land cover and deeper river locations. These habitat suitability models will inform sampling site section for further contaminant analysis.

Anna Winter

Colorado Front Range Disasters: Understanding the Impact of Forest Management on the Cameron Peak and CalWood Fire

Along the Colorado Front Range, forest management has gained significant attention due to uncharacteristically large fires that burned late in 2020. The Cameron Peak Fire (largest in Colorado recorded history) and the CalWood Fire collectively burned an estimated 219,019 acres from August through December of 2020. Project partners at the Coalition for the Poudre River Watershed, Colorado State Forest Service, Ben Delatour Scout Ranch, The Nature Conservancy, Colorado Forest Restoration Institute, and Colorado State University were interested in understanding the effectiveness of previous forest treatments in reducing burn severity within the Cameron Peak Fire and the CalWood Fire. We first collated a forest treatment dataset from pre-existing datasets by reclassifying over 29,000 treatments, which occurred across the Northern Colorado Front Range between 1970-2020. Secondly, we mapped three burn severity indices using Landsat 8 OLI and Sentinel-2 MSI Earth observations and compared them to soil burn severity field data. Thirdly, a total of 35 topographic, disturbance, forest structure, and treatment predictor variables were generated across the fires. Finally, we assessed relationships between these predictor variables and burn severity using the random forest algorithm. Model results indicate that the primary drivers of burn severity were elevation and distance to treatment edge for the Cameron Peak Fire and fire area and forest canopy cover for the CalWood Fire. Further analysis of these variables paired with field data is necessary to understand the relationship between burn severity and treatments to guide future restoration efforts, improve forest resiliency, and mitigate fire risks.

Neal Swayze

Maya Forest Water Resources I: Using NASA Earth Observations to Map Forested Inundation in the Maya Forest

As climate change increases the severity and frequency of extreme weather events in the tropics, it is vital for the safety of local communities and the health of ecosystems to monitor seasonal inundation. Forested inundation affects the ability of forested wetlands to provide ecosystem services, such as flood mitigation, water filtration, carbon storage, and erosion mitigation. While ground-based monitoring has traditionally been used to map inundation extent, those methods are costly and time-intensive. The NASA DEVELOP team focused on seasonal inundation throughout 2008 in the Maya Forest, when changes in inundation were drastic. To monitor seasonal inundation, our team used in situ field data and Earth observations from Landsat 7 Enhanced Thematic Mapper (ETM+), Advanced Land Observing Satellite (ALOS) Phased Array type L-band Synthetic Aperture Radar (PALSAR) 1, Shuttle Radar Topography Mission (SRTM), and products from the Ice, Cloud, and Land Elevation Satellite (ICESat). The team applied a Random Forest algorithm to Landsat 7 imagery, generating an object-level land cover classification with an overall accuracy of 72.1% and forest class with 100% recall and 78% precision. The team applied L-band backscatter thresholds from existing literature to forest-masked ALOS imagery and refined the thresholds in an iterative process using field data and hydrology models to delineate seasonal inundation extent. These publicly available data products help end users from Belize’s Land Information Center (LIC) and Forest Department, Guatemala’s Center for Monitoring and Evaluation (CEMEC), and Mexico’s El Colegio de la Frontera Sur (ECOSUR) to inform land management and protect community infrastructure.

Madelyn Savan

Powder River Basin Water Resources: Mapping Russian Olive in the Powder River Basin to Inform Invasive Species Management

Since its introduction in the late 1800s, Elaeagnus augustifolia (Russian olive) has become a widespread invasive shrub that poses a threat to native riparian species in the United States by competing with native riparian plants for space and resources. To date, limited information on the distribution of Russian olive in the Powder River Basin of Montana and Wyoming have hampered management efforts and decision making. Here, we detect and model the distribution of Russian Olive using field surveys, ocular sampling, and variables from Landsat 8 Operational Land Imager (OLI), Sentinel-2 MultiSpectral Instrument (MSI), and Shuttle Radar Topography Mission (SRTM) using the Random Forest algorithm. We derived topographic, spectral, and hydrological variables from Landsat 8 OLI, Sentinel-2 MSI, and SRTM to utilize as model inputs. The team was able to successfully create a spectral Russian olive detection map for the Powder River Basin (RMSE =15.44%, R2 = 0.6482). The team also examined change in stream channel geomorphology from 1984-2020 in a time-series analysis using Landsat visible imagery and the RivMap MATLAB package and found little change. Our results will help our partners at the Powder River County Weed Board, Gay Ranch, United States Geological Survey, and University of Northern Colorado to locate and prioritize areas for riparian habitat restoration and to understand the region’s hydrology and geomorphology.

Catherine Buczek

Mapping tree canopy cover and canopy height with L-band SAR using LiDAR data and Random Forests

Light detection and ranging (LiDAR) data can provide direct measurements of vegetation structures but are limited by the sparse spatial coverage. Polarimetric synthetic aperture radar (SAR) can perform large-scale high-resolution mapping without weather constraints but the information about vegetation and ground subsurface are mixed in the backscatter data. In this paper, we adopted the Random Forests algorithm to train an upscaling function using tree canopy cover (TCC) and canopy height model (CHM) derived from Goddard’s LiDAR, Hyperspectral and Thermal Imager (G-LiHT) data. The regression model is then applied to the L-band Uninhabited Aerial Vehicle Synthetic Aperture Radar (UAVSAR) data acquired during the 2017 Arctic-Boreal Vulnerability Experiment (ABoVE) airborne campaign to map the TCC and CHM over the Delta Junction area in interior Alaska.

Moghaddam, Mahta

Maya Forest Water Resources II: Mapping Inundation Below the Forest Canopy in the Maya Tri-National Forest

To monitor seasonal flooding within the tri-National Maya Forest the team completed the methodology started by the Summer 2021 term to analyze changes in inundation dynamic throughout 2017. The team analyzed inundation dynamics in Google Earth Engine (GEE) using Earth observation products from the Landsat 8 Operational Land Imager (OLI), Advanced Land Observing Satellite (ALOS) Phased Array type L-band Synthetic Aperture Radar (PALSAR) 2, and International Space Station (ISS) Global Ecosystem Dynamics Investigation LiDAR (GEDI). The team improved the landcover classification using the Random Forest algorithm in GEE by adding canopy height data derived from GEDI, elevation and slope data from Copernicus, and additional multi-spectral band ratios from Landsat 8. The pixel-based land cover classification produced an overall accuracy of 88%. Experiments measuring inundation extent using L-band SAR included comparing results with a priori knowledge, topography datasets, and auxiliary datasets. We iteratively tested and found threshold values for identifying forested inundation using the ratio for HH divided by HV. The resulting methodology and products helped end users from Belize’s Land Information Center (LIC) and Forest Department, Guatemala’s Center for Monitoring and Evaluation (CEMEC), and Mexico’s El Colegio de la Frontera Sur (ECOSUR) manage land and water resources and protect communities.

Stephanie Jiménez

Landslide Likelihood Prediction using Machine Learning Algorithms

The supply of electricity via power plants is criticalto the operation of many critical infrastructure systems in mod-ern society. Natural hazards can disrupt the power supply, causepower outages that can halt economic growth, and impede emer-gency response until power is restored. The proposed work aimsto predict the landslides likelihood in these critical infrastructurelocations in the Northeastern USA using integrated databases ofexplanatory variables and machine learning algorithms. First,data related to landslides are obtained and merged, includingtopographic, soil moisture, and precipitation-related data. Fiveregression algorithms, namely: Random Forest, Extreme Gradi-ent Boosting (XGBoost), K-Nearest Neighbor regression (KNN),Linear Support Vector Regressor (SVR), and Linear regression,are utilized to predict the landslide probability and evaluatedon the dataset. The accuracy of the models is assessed by usingstatistical metrics such as mean absolute error (MAE), meansquared error (MSE), and root mean squared error (RMSE).The study results show that Random Forest outperformed othermodels with the mutual information feature selection method.It achieved an MSE of 0.0011 with mutual information-basedfeature selection and an MSE of 0.00157 without feature selection.KNN regressor outperformed the other models with an MSEof 0.00139 with correlation-based information selection. Theproposed landslide identification model with Random Forestalgorithm shows outstanding robustness and great potential intackling the landslide likelihood prediction by employing MLalgorithms.

Vasundhara Acharya

Adaptive box filters for removal of random noise from digital images

Adaptive box-filtering algorithms to remove random bit errors and to smooth noisy data have been developed. For both procedures, the standard deviation of those pixels within a local box surrounding each pixel is used. A series of two or three filters with decreasing box sizes can be run to clean up extremely noisy images and to remove bit errors near sharp edges. The second filter, for noise smoothing, is similar to the 'sigma filter' of Lee (1983). The technique effectively reduces speckle in radar images without eliminating fine details.

Eliason, Eric M.

Generating Random Number Pairs

Algorithm generates pairs drawn from bivariate normal distribution with any desired values of two means, two standard deviations, and correlation coefficient.

Campbell, C. W.

Rotorcraft Blade Mode Damping Identification from Random Responses Using a Recursive Maximum Likelihood Algorithm

An on line technique is presented for the identification of rotor blade modal damping and frequency from rotorcraft random response test data. The identification technique is based upon a recursive maximum likelihood (RML) algorithm, which is demonstrated to have excellent convergence characteristics in the presence of random measurement noise and random excitation. The RML technique requires virtually no user interaction, provides accurate confidence bands on the parameter estimates, and can be used for continuous monitoring of modal damping during wind tunnel or flight testing. Results are presented from simulation random response data which quantify the identified parameter convergence behavior for various levels of random excitation. The data length required for acceptable parameter accuracy is shown to depend upon the amplitude of random response and the modal damping level. Random response amplitudes of 1.25 degrees to .05 degrees are investigated. The RML technique is applied to hingeless rotor test data. The inplane lag regressing mode is identified at different rotor speeds. The identification from the test data is compared with the simulation results and with other available estimates of frequency and damping.

Molusis, J. A.

Multiple input/output random vibration control system

A multi-input/output random vibration control algorithm was developed based on system identification concepts derived from random vibration spectral analysis theory. The unique features of the algorithm are: (1) the number of input excitors and the number of output control responses need not be identical; (2) the system inverse response matrix is obtained directly from the input/output spectral matrix; and (3) the system inverse response matrix is updated every control loop cycle to accommodate system amplitude nonlinearities. A laboratory demonstration case of two imputs with three outputs is presented to demonstrate the system capabilities.

Unruh, James F.

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, Vadius

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum excitation gap. g min, = O(n 2(exp -n/2), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to 'the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, V. N.

A parallel particle-in-cell model for the massively parallel processor

The availability of the nearest-neighbor communication-incorporating Massively Parallel Processor has prompted the development of a two-dimensional, particle-in-cell algorithm which loads particles in a cell randomly onto a row of processors, filling only half of them with particles. Due to the simplification of communications among processors achieved in a row by the vacant processors and the random-particle sequence, the algorithm efficiently sorts particles and performs gather/scatter procedures for collecting charge density according to their cells. The algorithm calculates electric fields at the cells by FFT.

Lin, C. S.

A Practical Comparison of Motion Planning Techniques for Robotic Legs in Environments with Obstacles

ATHLETE is a large six-legged tele-operated robot. Each foot is a wheel; travel can be achieved by walking, rolling, or some combination of the two. Operators control ATHLETE by selecting parameterized commands from a command dictionary. While rolling can be done efficiently, any motion involving steps is cumbersome - each step can require multiple commands and take many minutes to complete. In this paper, we consider four different algorithms that generate a sequence of commands to take a step. We consider a baseline heuristic, a randomized motion planning algorithm, and two variants of A* search. Results for a variety of terrains are presented, and we discuss the quantitative and qualitative tradeoffs between the approaches.

Smith, Tristan B.

Evaluation of Classifier Complexity for Delay Tolerant Network Routing

The growing popularity of small cost effective satellites (SmallSats, CubeSats, etc.) creates the potential for a variety of new science applications involving multiple nodes functioning together or independently to achieve a task, such as swarms and constellations. As this technology develops and is deployed for missions in Low Earth Orbit and beyond, the use of delay tolerant networking (DTN) techniques may improve communication capabilities within the network. In this paper, a network hierarchy is developed from heterogeneous networks of SmallSats, surface vehicles, relay satellites and ground stations which form an integrated network. There is a tradeoff between complexity, flexibility, and scalability of user defined schedules versus autonomous routing as the number of nodes in the network increases. To address these issues, this work proposes a machine learning classifier based on DTN routing metrics. A framework is developed which will allow for the use of several categories of machine learning algorithms (decision tree, random forest and deep learning) to be applied to a dataset of historical network statistics, which allows for the evaluation of algorithm complexity versus performance to be explored. We develop the emulation of a hierarchical network, consisting of tens of nodes which form a cognitive network architecture. CORE (Common Open Research Emulator) is used to emulate the network using bundle protocol and DTN IP neighbor discovery.

Dudukovich, Rachel

Coronado Ecological Conservation: Assessing Vegetation Change Due to Border Wall Construction and Shifting Social Trails

Species monitoring is essential for mitigating the impacts of plant invasion, such as radical changes in an area’s ecosystem, degraded soil health, increased wildfire severity, landslides, and increased flooding. For this project, NASA DEVELOP partnered with the National Park Service (NPS) to investigate invasive species in disturbed lands: specifically, areas affected by off-trail travel and U.S.-Mexico border construction activities. The team assessed how construction has impacted the distribution of Lehmann’s lovegrass and Russian thistle invasives throughout Coronado National Memorial, AZ from 1986-2022. Using data from Landsat 5 and 8, Sentinel-2, NAIP, and PlanetScope, the team computed NDVI, NDMI, MSAVI2, EVI, and Tasseled Cap Wetness, Brightness, and Greenness transformations as vegetation health indicators to input into various machine learning algorithms. To minimize noise, the team conducted Principal Component Analysis on vegetation indices and spectral bands before running k-means clustering and random forest classification algorithms. Between all datasets, the team found that the median area fully overtaken by invasive plants was 5.37% of the park’s total area in 2022. The NPS will use end products to help increase restoration efforts in disturbed areas with high concentrations of invasive plants, and this project can serve as a jumping off point for future invasive species monitoring. The NPS’s collection of ground data for 2022-2023, in conjunction with future data collection, will notably improve the accuracy of classification models, leading to more precise monitoring of invasive species spread over time.

Coronado National Memorial

Modeling for Ultrasonic Health Monitoring of Foams with Embedded Sensors

In this report analytical and numerical methods are proposed to estimate the effective elastic properties of regular and random open-cell foams. The methods are based on the principle of minimum energy and on structural beam models. The analytical solutions are obtained using symbolic processing software. The microstructure of the random foam is simulated using Voronoi tessellation together with a rate-dependent random close-packing algorithm. The statistics of the geometrical properties of random foams corresponding to different packing fractions have been studied. The effects of the packing fraction on elastic properties of the foams have been investigated by decomposing the compliance into bending and axial compliance components. It is shown that the bending compliance increases and the axial compliance decreases when the packing fraction increases. Keywords: Foam; Elastic properties; Finite element; Randomness

Wang, L.