Search NASA⌕ Search

SEARCH · Search NASA

Results for “prediction 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 289 records · Page 16

Development and Implementation of a Hardware In-the-Loop Test Bed for Unmanned Aerial Vehicle Control Algorithms

Successful prediction and management of battery life using prognostic algorithms through ground and flight tests is important for performance evaluation of electrical systems. This paper details the design of test beds suitable for replicating loading profiles that would be encountered in deployed electrical systems. The test bed data will be used to develop and validate prognostic algorithms for predicting battery discharge time and battery failure time. Online battery prognostic algorithms will enable health management strategies. The platform used for algorithm demonstration is the EDGE 540T electric unmanned aerial vehicle (UAV). The fully designed test beds developed and detailed in this paper can be used to conduct battery life tests by controlling current and recording voltage and temperature to develop a model that makes a prediction of end-of-charge and end-of-life of the system based on rapid state of health (SOH) assessment.

Battery Testbed↗

Ternary alloy material prediction using genetic algorithm and cluster expansion

This thesis summarizes our study on the crystal structures prediction of Fe-V-Si system using genetic algorithm and cluster expansion. Our goal is to explore and look for new stable compounds. We started from the current ten known experimental phases, and calculated formation energies of those compounds using density functional theory (DFT) package, namely, VASP. The convex hull was generated based on the DFT calculations of the experimental known phases. Then we did random search on some metal rich (Fe and V) compositions and found that the lowest energy structures were body centered cube (bcc) underlying lattice, under which we did our computational systematic searches using genetic algorithm and cluster expansion. Among hundreds of the searched compositions, thirteen were selected and DFT formation energies were obtained by VASP. The stability checking of those thirteen compounds was done in reference to the experimental convex hull. We found that the composition, 24-8-16, i.e., Fe 3 VSi 2 is a new stable phase and it can be very inspiring to the future experiments.

36 MATERIALS SCIENCE↗

SU-C-BRF-07: A Pattern Fusion Algorithm for Multi-Step Ahead Prediction of Surrogate Motion

Purpose: To assure that tumor motion is within the radiation field during high-dose and high-precision radiosurgery, real-time imaging and surrogate monitoring are employed. These methods are useful in providing real-time tumor/surrogate motion but no future information is available. In order to anticipate future tumor/surrogate motion and track target location precisely, an algorithm is developed and investigated for estimating surrogate motion multiple-steps ahead. Methods: The study utilized a one-dimensional surrogate motion signal divided into three components: (a) training component containing the primary data including the first frame to the beginning of the input subsequence; (b) input subsequence component of the surrogate signal used as input to the prediction algorithm: (c) output subsequence component is the remaining signal used as the known output of the prediction algorithm for validation. The prediction algorithm consists of three major steps: (1) extracting subsequences from training component which best-match the input subsequence according to given criterion; (2) calculating weighting factors from these best-matched subsequence; (3) collecting the proceeding parts of the subsequences and combining them together with assigned weighting factors to form output. The prediction algorithm was examined for several patients, and its performance is assessed based on the correlation between prediction and known output. Results: Respiratory motion data was collected for 20 patients using the RPM system. The output subsequence is the last 50 samples (∼2 seconds) of a surrogate signal, and the input subsequence was 100 (∼3 seconds) frames prior to the output subsequence. Based on the analysis of correlation coefficient between predicted and known output subsequence, the average correlation is 0.9644±0.0394 and 0.9789±0.0239 for equal-weighting and relative-weighting strategies, respectively. Conclusion: Preliminary results indicate that the prediction algorithm is effective in estimating surrogate motion multiple-steps in advance. Relative-weighting method shows better prediction accuracy than equal-weighting method. More parameters of this algorithm are under investigation.

60 APPLIED LIFE SCIENCES↗

TU-AB-BRA-12: Impact of Image Registration Algorithms On the Prediction of Pathological Response with Radiomic Textures

Purpose: Tumor regions-of-interest (ROI) can be propagated from the pre-onto the post-treatment PET/CT images using image registration of their CT counterparts, providing an automatic way to compute texture features on longitudinal scans. This exploratory study assessed the impact of image registration algorithms on textures to predict pathological response. Methods: Forty-six esophageal cancer patients (1 tumor/patient) underwent PET/CT scans before and after chemoradiotherapy. Patients were classified into responders and non-responders after the surgery. Physician-defined tumor ROIs on pre-treatment PET were propagated onto the post-treatment PET using rigid and ten deformable registration algorithms. One co-occurrence, two run-length and size zone matrix textures were computed within all ROIs. The relative difference of each texture at different treatment time-points was used to predict the pathologic responders. Their predictive value was assessed using the area under the receiver-operating-characteristic curve (AUC). Propagated ROIs and texture quantification resulting from different algorithms were compared using overlap volume (OV) and coefficient of variation (CoV), respectively. Results: Tumor volumes were better captured by ROIs propagated by deformable rather than the rigid registration. The OV between rigidly and deformably propagated ROIs were 69%. The deformably propagated ROIs were found to be similar (OV∼80%) except for fast-demons (OV∼60%). Rigidly propagated ROIs with run-length matrix textures failed to significantly differentiate between responders and non-responders (AUC=0.65, p=0.07), while the differentiation was significant with other textures (AUC=0.69–0.72, p<0.03). Among the deformable algorithms, fast-demons was the least predictive (AUC=0.68–0.71, p<0.04). ROIs propagated by all other deformable algorithms with any texture significantly predicted pathologic responders (AUC=0.71–0.78, p<0.01) despite substantial variation in texture quantification (CoV>70%). Conclusion: Propagated ROIs using deformable registration for all textures can lead to accurate prediction of pathologic response, potentially expediting the temporal texture analysis process. However, rigid and fast-demons deformable algorithms are not recommended due to their inferior performance compared to other algorithms. The project was supported in part by a Kaye Scholar Award.

60 APPLIED LIFE SCIENCES↗

An algorithmic approach to predicting mechanical draft cooling tower fan speeds from infrasound signals

Mechanical draft cooling towers (MDCTs) serve a critical heat management role in a variety of industries. For nuclear reactors in particular, the consistent, predictable operation of MDCTs is required to avoid damage to infrastructure and reduce the potential for catastrophic failure. Accurate, reliable measurement of MDCT fan speed is therefore an important maintenance and safety requirement. To that end, we have developed an algorithm for automatically predicting the rotational speeds of multiple, simultaneously operating fan rotors using contactless, infrasound measurements. The algorithm is based on identifying the blade passing frequencies (BPFs), their harmonics, as well as the motor frequencies (MFs) for each fan in operation. Using the algorithm, these frequencies can be automatically identified in the acoustic waveform’s short-time Fourier transform spectrogram. Attribution is aided by a set of filters that rely on the unique spectral and temporal characteristics of fan operation, as well as the intrinsic frequency ratios of the BPF harmonics and the BPF/MF signals. The algorithm was tested against infrasound data acquired from infrasound sensors deployed at two research reactors: the Advanced Test Reactor (ATR) located at Idaho National Laboratory (INL) and the High Flux Isotope Reactor (HFIR) located at Oak Ridge National Laboratory (ORNL). After manually identifying the MDCT gearbox ratio, the algorithm was able to quickly yield fan speeds at both reactors in good agreement with ground truth. Ultimately, this work demonstrates the ease by which MDCT fans may be monitored in order to optimize operational conditions and avoid infrastructure damage.

42 ENGINEERING↗

Formulation and Comparison of Two Real-Time Predictive Gear Shift Algorithms for Connected/Automated Heavy-Duty Vehicles

Our work investigates the problem of predictive gear scheduling for fuel consumption minimization in connected/automated heavy trucks. The literature highlights the fuel economy benefits of such predictive scheduling, but there is a need to optimize such scheduling online, in real time. To address this need, we begin by using dynamic programming (DP) to schedule gear shifting offline, in a manner that achieves a globally optimal Pareto tradeoff between the conflicting objectives of minimizing fuel consumption and shift frequency. The computational cost of DP is unfavorable for online implementation, but we present two algorithms addressing this issue. Both algorithms rely on the fact that in the Pareto limit where fuel consumption minimization is the sole objective, DP furnishes a simple static shift map . Our first algorithm trains a recurrent neural network to prune the shift schedule generated by this map. The second algorithm performs this pruning in a direct manner tailored to reduce the schedule's rain flow count. We simulate these algorithms for different drive cycles. Both algorithms achieve a reasonable tradeoff between fuel consumption and gear shift frequency. Yet, the rain flow count algorithm is both more effective in approaching the DP-based Pareto front and more computationally efficient.

33 ADVANCED PROPULSION SYSTEMS↗

A Case Study on Investigating the Effect of Genetic Algorithm Operators on Predicting the Global Minimum Hardness Value of Biomaterial Extrudate

Crossover and mutation are the main search operators of genetic algorithm, one of the most important features which distinguish it from other search algorithms like simulated annealing. A genetic algorithm adopts crossover and mutation as their main genetic operators. The present work was aimed to see the effect of genetic algorithm operators like crossover and mutation (Pc & Pm), population size (n), and number of iterations (I) on predicting the minimum hardness (N) of the biomaterial extrudate. The second order polynomial regression equation developed for the extrudate property hardness in terms of the independent variables like barrel temperature, screw speed, fish content of the feed, and feed moisture content was used as the objective function in the GA analysis. A simple genetic algorithm (SGA) with a crossover and mutation operators was used in the present study. A program was developed in C language for a SGA with a rank based fitness selection method. The upper limit of population and iterations were fixed at 100. It was observed that increasing population and iterations the prediction of function minimum improved drastically. Minimum predicted hardness values were achievable with a medium population of 50, iterations of 50 and crossover and mutation probabilities of 50 % and 0.5 %. Further the Pareto charts indicated that the effect of Pc was found to be more significant when population is 50 and Pm played a major role at low population ( 10). A crossover probability of 50 % and mutation probability of 0.5 % are the threshold values for the convergence of GA to reach a global search space. A minimum predicted hardness value of 3.82 (N) was observed for n = 60 and I = 100 and Pc & Pm of 85 % and 0.5 %.

59 BASIC BIOLOGICAL SCIENCES↗

Preprocessing Prediction of Advanced Algorithms for Medical Imaging

Advanced medical imaging algorithms (such as bone removal, vessel segmentation, or a lung nodule detection) can provide extremely valuable information to the radiologists, but they might sometimes be very time consuming. Being able to run the algorithms in advance can be a possible solution. However, we do not know which algorithm to run on a given dataset before it is actually used. It is possible to manually insert matching rules for preprocessing algorithms, but it requires high maintenance and does not work well in practice. This paper presents a dynamic machine learning solution for predicting which advanced visualization (AV) algorithm needs to be applied on a given series. The system gets a handful of free text DICOM tags as an input and builds a model in the clinical setting. It incorporates a Bag of Words (BOW) feature extractor and a Random Forest classifier. The approach was tested on two datasets from clinical sites which use different languages and varying scanner models. We show that even without feature extraction, sensitivity of above 90% can be reached on both of them. By using BOW feature extractor, precision and sensitivity can usually be further improved. Even on a noisy and highly unbalanced dataset, only around 100 samples were needed to reach sensitivity of above 80% and specificity of above 97%. We show how the solution can be part of a Smart Preprocessing mechanism in a viewing software. Using such a system will ultimately minimize the time to launch studies and improve radiologists reading time efficiency.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

An adaptive genetic algorithm for crystal structure prediction

We present a genetic algorithm (GA) for structural search that combines the speed of structure exploration by classical potentials with the accuracy of density functional theory (DFT) calculations in an adaptive and iterative way. This strategy increases the efficiency of the DFT-based GA by several orders of magnitude. This gain allows a considerable increase in the size and complexity of systems that can be studied by first principles. The performance of the method is illustrated by successful structure identifications of complex binary and ternary intermetallic compounds with 36 and 54 atoms per cell, respectively. The discovery of a multi-TPa Mg-silicate phase with unit cell containing up to 56 atoms is also reported. Such a phase is likely to be an essential component of terrestrial exoplanetary mantles.

36 MATERIALS SCIENCE↗

Deploying a Model Predictive Traffic Signal Control Algorithm - A Field Deployment Experiment Case Study: Preprint

This paper presents a field deployment experiment of a real-time traffic signal control algorithm. We implemented the Model Predictive Control (MPC) algorithm based on Virtual Phase-Link (VPL) model. We selected the deployment locations and times based on an energy saving potential concept. We developed a set of experiment systems to enable the deployment including sensing, processing, and actuating components. We tested the systems rigorously before the experiment days. We reported the key procedures on the experiment days including the steps took, real-time control procedure, and the monitoring of the experiment. We evaluated the impact of the deployment with the changes in delay and energy consumption.

deployment↗

BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

BigNeuron is an open community bench-testing platform with the goal of setting open standards for accurate and fast automatic neuron tracing. We gathered a diverse set of image volumes across several species that is representative of the data obtained in many neuroscience laboratories interested in neuron tracing. Here, we report generated gold standard manual annotations for a subset of the available imaging datasets and quantified tracing quality for 35 automatic tracing algorithms. The goal of generating such a hand-curated diverse dataset is to advance the development of tracing algorithms and enable generalizable benchmarking. Together with image quality features, we pooled the data in an interactive web application that enables users and developers to perform principal component analysis, t-distributed stochastic neighbor embedding, correlation and clustering, visualization of imaging and tracing data, and benchmarking of automatic tracing algorithms in user-defined data subsets. The image quality metrics explain most of the variance in the data, followed by neuromorphological features related to neuron size. Furthermore, we observed that diverse algorithms can provide complementary information to obtain accurate results and developed a method to iteratively combine methods and generate consensus reconstructions. The consensus trees obtained provide estimates of the neuron structure ground truth that typically outperform single algorithms in noisy datasets. However, specific algorithms may outperform the consensus tree strategy in specific imaging conditions. Finally, to aid users in predicting the most accurate automatic tracing results without manual annotations for comparison, we used support vector machine regression to predict reconstruction quality given an image volume and a set of automatic tracings.

97 MATHEMATICS AND COMPUTING↗

Construction of Women’s All-Around Speed Skating Event Performance Prediction Model and Competition Strategy Analysis Based on Machine Learning Algorithms

Introduction Accurately predicting the competitive performance of elite athletes is an essential prerequisite for formulating competitive strategies. Women’s all-around speed skating event consists of four individual subevents, and the competition system is complex and challenging to make accurate predictions on their performance. Objective The present study aims to explore the feasibility and effectiveness of machine learning algorithms for predicting the performance of women’s all-around speed skating event and provide effective training and competition strategies. Methods The data, consisting of 16 seasons of world-class women’s all-around speed skating competition results, used in the present study came from the International Skating Union (ISU). According to the competition rules, distinct features are filtered using lasso regression, and a 5,000 m race model and a medal model are built using a fivefold cross-validation method. Results The results showed that the support vector machine model was the most stable among the 5,000 m race and the medal models, with the highest AUC (0.86, 0.81, respectively). Furthermore, 3,000 m points are the main characteristic factors that decide whether an athlete can qualify for the final. The 11th lap of the 5,000 m, the second lap of the 500 m, and the fourth lap of the 1,500 m are the main characteristic factors that affect the athlete’s ability to win medals. Conclusion Compared with logistic regression, random forest, K-nearest neighbor, naive Bayes, neural network, support vector machine is a more viable algorithm to establish the performance prediction model of women’s all-around speed skating event; excellent performance in the 3,000 m event can facilitate athletes to advance to the final, and athletes with outstanding performance in the 500 m event are more likely competitive for medals.

Liu, Meng↗

XtalOpt version r9: An open-source evolutionary algorithm for crystal structure prediction

This is a new version of XtalOpt, an evolutionary algorithm for crystal structure prediction available for download from the CPC library or the XtalOpt website, http://xtalopt.github.io. XtalOpt is published under the Gnu Public License (GPL), which is an open source license that is recognized by the Open Source Initiative. We have detailed the new version incorporates many bug-fixes and new features here and predict the crystal structure of a system from its stoichiometry alone, using evolutionary algorithms.

97 MATHEMATICS AND COMPUTING↗

Salience Assignment for Multiple-Instance Data and Its Application to Crop Yield Prediction

An algorithm was developed to generate crop yield predictions from orbital remote sensing observations, by analyzing thousands of pixels per county and the associated historical crop yield data for those counties. The algorithm determines which pixels contain which crop. Since each known yield value is associated with thousands of individual pixels, this is a multiple instance learning problem. Because individual crop growth is related to the resulting yield, this relationship has been leveraged to identify pixels that are individually related to corn, wheat, cotton, and soybean yield. Those that have the strongest relationship to a given crop s yield values are most likely to contain fields with that crop. Remote sensing time series data (a new observation every 8 days) was examined for each pixel, which contains information for that pixel s growth curve, peak greenness, and other relevant features. An alternating-projection (AP) technique was used to first estimate the "salience" of each pixel, with respect to the given target (crop yield), and then those estimates were used to build a regression model that relates input data (remote sensing observations) to the target. This is achieved by constructing an exemplar for each crop in each county that is a weighted average of all the pixels within the county; the pixels are weighted according to the salience values. The new regression model estimate then informs the next estimate of the salience values. By iterating between these two steps, the algorithm converges to a stable estimate of both the salience of each pixel and the regression model. The salience values indicate which pixels are most relevant to each crop under consideration.

Wagstaff, Kiri L.↗