Search NASA⌕ Search

SEARCH · Search NASA

Results for “Learning 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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A Multi-Sensor Approach for Measuring Bird and Bat Collisions with Offshore Wind Turbines (Final Technical Report)

Collision of birds and bats with wind turbines is a conservation concern for both land-based and offshore wind projects. The fatality rates of birds and bats at land-based turbines are well documented. The measurement strategies on land focus on finding carcasses following collision, estimating the number of carcasses missed through searcher efficiency, carcass persistence trials and carcass fall distributions, and modeling statistically robust fatality rates. Few technologies have been developed to monitor offshore bird and bat collisions, and many that have been developed focused on detecting collisions with large birds. The few studies that have attempted to document collisions at offshore turbines do not account for smaller bodied animals or for collisions that might be missed, which prevents the calculation of statistically robust fatality rates. The overall goal of this report, A Multi-Sensor Approach for Measuring Bird and Bat Collisions with Offshore Wind Turbines (Project), was to develop an effective multi-sensor system for quantifying bird and bat collision rates, specifically for offshore wind facilities. The Project goal and resulting automated collision detection system was achieved through two major technological advancements: 1) refining The Netherlands Organisation for Applied Scientific Research’s (TNO’s) existing WT-Bird® vibration sensing system, that had successfully detected large bird collisions during daytime, to allow for improved detection of smaller birds and bats during both daytime and nighttime hours and 2) improving image processing systems and developing and integrating machine learning algorithms to automatically detect and classify small and large bird and bat collisions with offshore turbines. This final technical report (FTR) summarizes Methods , Results , Conclusions , and Lessons Learned during each of the five Tasks identified for this research and development effort. This FTR includes summaries of the following: Task 1. Initial Engineering Tests to Improve WT-Bird® Task 2. Installation of WT‐Bird® on a Utility-scale Turbine at the National Wind Technology Center – National Renewable Energy Laboratory Task 3. Field Tests and Refinement of the Object Detection System Task 4. Validation of WT-Bird® on a Land-based Turbine Task 5. Preparation for the Implementation of WT-Bird® on an Offshore Turbine. This research and development effort documented successful improvement of the WT Bird® collision detection system to detect small birds and bats, and WT-Bird® is the first collision detection system to validate results compared to land-based post-construction monitoring. The collision trials provide estimates of missed targets that can be used to estimate fatality rates, a significant improvement relative to other offshore collision monitoring systems. Advances were made in developing an edge-processing solution to reduce data storage requirements, which is important if the system is deployed for long periods of time at offshore turbines. The improved WT-Bird® system also provides an important option for wind operators on land or offshore who need to document specific details about when collisions occur, particularly efforts to further research on bat impact minimization, or when standard fatality searches are impractical (e.g. offshore) or inadequate (e.g. challenging locations on land).

17 WIND ENERGY↗
NASA NTRS1991

Modular, Multilayer Perceptron

Combination of proposed modular, multilayer perceptron and algorithm for its operation recognizes new objects after relatively brief retraining sessions. (Perceptron is multilayer, feedforward artificial neural network fully connected and trained via back-propagation learning algorithm.) Knowledge pertaining to each object to be recognized resides in subnetwork of full network, therefore not necessary to retrain full network to recognize each new object.

Cheng, Li-Jen↗
NASA NTRS2018

Earth Science Deep Learning: Applications and Lessons Learned

Deep Learning: A subfield of machine learning; Algorithms inspired by function of the brain; Scales with amount of training data; Powerful tool without the need for feature engineering; Suitable for Earth Science applications. Deep Learning for Earth science at MSFC (Marshall Space Flight Center): Phenomena identification; Hurricane intensity (wind speed) estimation; Severe storm (hailstorm) detection; Transverse bands detection; Entity extraction for knowledge graph creation; Ephemeral water detection.

Labeled Data↗
DOE OSTI2022

Constructing A New CHF Look-Up Table Based on the Domain Knowledge Informed Machine Learning Methodology

Accurate prediction of CHF under various fluid flow conditions continues to be required for design, operation and safety analysis of light water reactor rod bundles. Due to the lack of in-depth physical understanding as well as limited high-resolution data in the micro-scale flow and heat transfer, the existing models feature a sub-optimal uncertainty band. In this study, driven by the prior domain knowledge information obtained, an improved CHF look-up table is developed through unified machine learning algorithms for the vertical flow conditions within tube and annulus geometry. The Groeneveld 2006 look-up table is used as the domain knowledge to train machine learning process against tube and annulus CHF data for both DNB and DO type. The new look-up table shows improved accuracy for conditions relevant to PWRs and BWRs. In addition, its domain knowledge informed nature ensures that a rationale prediction can be made, thus accounting for previous valuable information in the machine learning model training process.

Jin, Yue↗
DOE OSTI2019

Data-driven approach for synchrotron X-ray Laue microdiffraction scan analysis

A novel data-driven approach is proposed for analyzing synchrotron Laue X-ray microdiffraction scans based on machine learning algorithms. The basic architecture and major components of the method are formulated mathematically. It is demonstrated through typical examples including polycrystalline BaTiO 3 , multiphase transforming alloys and finely twinned martensite. The computational pipeline is implemented for beamline 12.3.2 at the Advanced Light Source, Lawrence Berkeley National Laboratory. The conventional analytical pathway for X-ray diffraction scans is based on a slow pattern-by-pattern crystal indexing process. Here, this work provides a new way for analyzing X-ray diffraction 2D patterns, independent of the indexing process, and motivates further studies of X-ray diffraction patterns from the machine learning perspective for the development of suitable feature extraction, clustering and labeling algorithms.

42 ENGINEERING↗
DOE OSTI2022

Automated Identification of Characteristic Droplet Size Distributions in Stratocumulus Clouds Utilizing a Data Clustering Algorithm

Abstract Droplet-level interactions in clouds are often parameterized by a modified gamma fitted to a “global” droplet size distribution. Do “local” droplet size distributions of relevance to microphysical processes look like these average distributions? This paper describes an algorithm to search and classify characteristic size distributions within a cloud. The approach combines hypothesis testing, specifically, the Kolmogorov–Smirnov (KS) test, and a widely used class of machine learning algorithms for identifying clusters of samples with similar properties: density-based spatial clustering of applications with noise (DBSCAN) is used as the specific example for illustration. The two-sample KS test does not presume any specific distribution, is parameter free, and avoids biases from binning. Importantly, the number of clusters is not an input parameter of the DBSCAN-type algorithms but is independently determined in an unsupervised fashion. As implemented, it works on an abstract space from the KS test results, and hence spatial correlation is not required for a cluster. The method is explored using data obtained from the Holographic Detector for Clouds (HOLODEC) deployed during the Aerosol and Cloud Experiments in the Eastern North Atlantic (ACE-ENA) field campaign. The algorithm identifies evidence of the existence of clusters of nearly identical local size distributions. It is found that cloud segments have as few as one and as many as seven characteristic size distributions. To validate the algorithm’s robustness, it is tested on a synthetic dataset and successfully identifies the predefined distributions at plausible noise levels. The algorithm is general and is expected to be useful in other applications, such as remote sensing of cloud and rain properties. Significance Statement A typical cloud can have billions of drops spread over tens or hundreds of kilometers in space. Keeping track of the sizes, positions, and interactions of all of these droplets is impractical, and, as such, information about the relative abundance of large and small drops is typically quantified with a “size distribution.” Droplets in a cloud interact locally, however, so this work is motivated by the question of whether the cloud droplet size distribution is different in different parts of a cloud. A new method, based on hypothesis testing and machine learning, determines how many different size distributions are contained in a given cloud. This is important because the size distribution describes processes such as cloud droplet growth and light transmission through clouds.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS2020

Prognostics for Systems Health Management - Model and Hybrid Based Approaches. Where are We Heading?

To facilitate and solve the prediction problem, awareness of the current state and health of the system is key, since it is necessary to perform condition-based system health predictions. To accurately predict the future state of any system, it is required to possess knowledge of its current health state and future operational conditional. In case of next generation electric aircrafts, computing remaining flying time is safety-critical, since an aircraft that runs out of power (battery charge) while in the air will eventually lose control leading to catastrophe. In order to tackle and solve the prediction problem, it is essential to have awareness of the current health state of the system, especially since it is necessary to perform condition-based predictions. To be able to predict the future state of the system, it is also required to possess knowledge of the current and future operational conditions and flight profiles for accurate estimation of end-of-discharge (EOD) for the batteries. Similar framework can be implemented to other complex systems and subsystems. Our research approach is to develop a system level health monitoring safety indicator which runs estimation and prediction algorithms to estimate remaining useful life predictions at system, subsystem swell as component levels. Given models of the current and future system behavior, a general approach of model-based prognostics is discussed as a solution to the prediction problem and further for decision making. Data driven prognostics approaches have been equally used with good results in the past, where respective approaches have their own challenges to tackle. This limits their applicability to complex real-world domains: (a) high complexity or incompleteness of physics-based models and (b) limited representativeness of the training dataset for data-driven models. With the advent of internet of things for data collection and increased use of ML algorithms, hybrid approaches are the next avenue to reduce the challenges and achieve better results. An hybrid framework for fusing information from physics-based performance models along with deep learning algorithms for prognostics of complex safety critical systems is presented. In this framework, we use physics-based performance models to infer unobservable model parameters related to the system's components health solving a calibration problem.

Prognostics↗
DOE OSTI2022

Distilling Knowledge from Ensembles of Cluster-Constrained-Attention Multiple-Instance Learners for Whole Slide Image Classification

The peculiar nature of whole slide imaging (WSI), digitizing conventional glass slides to obtain multiple high resolution images which capture microscopic details of a patient’s histopathological features, has garnered increased interest from the computer vision research community over the last two decades. Given the unique computational space and time complexity inherent to gigapixel-size whole slide image data, researchers have proposed novel machine learning algorithms to aid in the performance of diagnostic tasks in clinical pathology. One effective algorithm represents a Whole slide image as a bag of smaller image patches, which can be represented as low-dimension image patch embeddings. Weakly supervised deep-learning methods, such as cluster-constrained-attention multiple instance learning (CLAM), have shown promising results when combined with image patch embeddings. While traditional ensemble classifiers yield improved task performance, such methods come with a steep cost in model complexity. Through knowledge distillation, it is possible to retain some performance improvements from an ensemble, while minimizing costs to model complexity. In this work, we implement a weakly supervised ensemble using clustering-constrained-attention multiple-instance learners (CLAM), which uses attention and instance-level clustering to identify task salient regions and feature extraction in whole slides. By applying logit-based and attention-based knowledge distillation, we show it is possible to retain some performance improvements resulting from the ensemble at zero cost to model complexity.

Alamudun, Folami↗
DOE OSTI2018

Sparse Coding for N-Gram Feature Extraction and Training for File Fragment Classification

File fragment classification is an important step in the task of file carving in digital forensics. In file carving, files must be reconstructed based on their content as a result of their fragmented storage on disk or in memory. Existing methods for classification of file fragments typically use hand-engineered features such as byte histograms or entropy measures. In this paper, we propose an approach using sparse coding that enables automated feature extraction. Sparse coding, or sparse dictionary learning, is an unsupervised learning algorithm, and is capable of extracting features based simply on how well those features can be used to reconstruct the original data. With respect to file fragments, we learn sparse dictionaries for n-grams, continuous sequences of bytes, of different sizes. These dictionaries may then be used to estimate n-gram frequencies for a given file fragment, but for significantly larger n-gram sizes than are typically found in existing methods which suffer from combinatorial explosion. To demonstrate the capability of our sparse coding approach, we used the resulting features to train standard classifiers such as support vector machines (SVMs) over multiple file types. Experimentally, we achieved significantly better classification results with respect to existing methods, especially when the features were used in supplement to existing hand-engineered features.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Deep active learning for classifying cancer pathology reports

Abstract Background Automated text classification has many important applications in the clinical setting; however, obtaining labelled data for training machine learning and deep learning models is often difficult and expensive. Active learning techniques may mitigate this challenge by reducing the amount of labelled data required to effectively train a model. In this study, we analyze the effectiveness of 11 active learning algorithms on classifying subsite and histology from cancer pathology reports using a Convolutional Neural Network as the text classification model. Results We compare the performance of each active learning strategy using two differently sized datasets and two different classification tasks. Our results show that on all tasks and dataset sizes, all active learning strategies except diversity-sampling strategies outperformed random sampling, i.e., no active learning. On our large dataset (15K initial labelled samples, adding 15K additional labelled samples each iteration of active learning), there was no clear winner between the different active learning strategies. On our small dataset (1K initial labelled samples, adding 1K additional labelled samples each iteration of active learning), marginal and ratio uncertainty sampling performed better than all other active learning techniques. We found that compared to random sampling, active learning strongly helps performance on rare classes by focusing on underrepresented classes. Conclusions Active learning can save annotation cost by helping human annotators efficiently and intelligently select which samples to label. Our results show that a dataset constructed using effective active learning techniques requires less than half the amount of labelled data to achieve the same performance as a dataset constructed using random sampling.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Measurement-induced entanglement phase transitions in variational quantum circuits

Variational quantum algorithms (VQAs), which classically optimize a parametrized quantum circuit to solve a computational task, promise to advance our understanding of quantum many-body systems and improve machine learning algorithms using near-term quantum computers. Prominent challenges associated with this family of quantum-classical hybrid algorithms are the control of quantum entanglement and quantum gradients linked to their classical optimization. Known as the barren plateau phenomenon, these quantum gradients may rapidly vanish in the presence of volume-law entanglement growth, which poses a serious obstacle to the practical utility of VQAs. Inspired by recent studies of measurement-induced entanglement transition in random circuits, we investigate the entanglement transition in variational quantum circuits endowed with intermediate projective measurements. Considering the Hamiltonian Variational Ansatz (HVA) for the XXZ model and the Hardware Efficient Ansatz (HEA), we observe a measurement-induced entanglement transition from volume-law to area-law with increasing measurement rate. Moreover, we provide evidence that the transition belongs to the same universality class of random unitary circuits. Importantly, the transition coincides with a “landscape transition” from severe to mild/no barren plateaus in the classical optimization. Our work may provide an avenue for improving the trainability of quantum circuits by incorporating intermediate measurement protocols in currently available quantum hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Objective Phenotyping of Root System Architecture Using Image Augmentation and Machine Learning in Alfalfa (Medicago sativa L.)

Active breeding programs specifically for root system architecture (RSA) phenotypes remain rare; however, breeding for branch and taproot types in the perennial crop alfalfa is ongoing. Phenotyping in this and other crops for active RSA breeding has mostly used visual scoring of specific traits or subjective classification into different root types. While image-based methods have been developed, translation to applied breeding is limited. This research is aimed at developing and comparing image-based RSA phenotyping methods using machine and deep learning algorithms for objective classification of 617 root images from mature alfalfa plants collected from the field to support the ongoing breeding efforts. Our results show that unsupervised machine learning tends to incorrectly classify roots into a normal distribution with most lines predicted as the intermediate root type. Encouragingly, random forest and TensorFlow-based neural networks can classify the root types into branch-type, taproot-type, and an intermediate taproot-branch type with 86% accuracy. With image augmentation, the prediction accuracy was improved to 97%. Coupling the predicted root type with its prediction probability will give breeders a confidence level for better decisions to advance the best and exclude the worst lines from their breeding program. This machine and deep learning approach enables accurate classification of the RSA phenotypes for genomic breeding of climate-resilient alfalfa.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2019

Prediction of Pushback Times and Ramp Taxi Times for Departures at Charlotte Airport

When optimizing the takeoff sequence and schedule for departures at busy airports, it is important to accurately predict the taxi times from gate to runway because those are used to calculate the earliest possible takeoff times. Several airports like Charlotte Douglas International Airport show relatively long taxi times inside the ramp area with large variations, with respect to the travel times in the airport movement area. Also, the pushback process times have not been accurately modeled so far mainly due to the lack of accurate data. The recent deployment of the integrated arrival, departure, and surface traffic management system at Charlotte airport by NASA enables more accurate flight data in the airport surface operations to be obtained. Taking advantage of this system, actual pushback times and ramp taxi times from historical flight data at this airport are analyzed. Based on the analysis, a simple, data-driven prediction model is introduced for estimating pushback times and ramp transit times of individual departure flights. To evaluate the performance of this prediction model, several machine learning techniques are also applied to the same dataset. The prediction results show that the data-driven prediction model is as good as the machine learning algorithms when comparing various prediction performance metrics.

airport surface operations↗
DOE OSTI2023

Harness the power of atomistic modeling and deep learning in biofuel separation

Biofuels offer a remarkable, sustainable energy source for a future of clean energy. The development of efficient biofuel separation plays a crucial role in achieving cost-effective utilization of biofuel. In this chapter, we provide an overview of the recent advancements in atomistic-level modeling and deep learning in the rational design of novel, efficient biofuel separation. The fundamental principles of quantum and statistical mechanics are covered in appropriate detail to highlight their underlying differences in theory. The methodologies of several molecular representations and deep learning algorithms applicable to biofuel separation are briefly demonstrated as well. The applications, successes, and risks of employing density functional theory, ab initio molecular dynamics, classical molecular dynamics, and deep learning are provided to showcase their recent accomplishments in biofuel separation as well as potential improvements in both methodology and application. Lastly, a vision for the future growth of these methods is illustrated.

deep learning, artificial intelligence, biofuels, ↗
DOE OSTI2016

Machine learning strategy for accelerated design of polymer dielectrics

The ability to efficiently design new and advanced dielectric polymers is hampered by the lack of sufficient, reliable data on wide polymer chemical spaces, and the difficulty of generating such data given time and computational/experimental constraints. Here, we address the issue of accelerating polymer dielectrics design by extracting learning models from data generated by accurate state-of-the-art first principles computations for polymers occupying an important part of the chemical subspace. The polymers are ‘fingerprinted’ as simple, easily attainable numerical representations, which are mapped to the properties of interest using a machine learning algorithm to develop an on-demand property prediction model. Further, a genetic algorithm is utilised to optimise polymer constituent blocks in an evolutionary manner, thus directly leading to the design of polymers with given target properties. Furthermore, while this philosophy of learning to make instant predictions and design is demonstrated here for the example of polymer dielectrics, it is equally applicable to other classes of materials as well.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Deep probabilistic direction prediction in 3D with applications to directional dark matter detectors

Abstract We present the first method to probabilistically predict 3D direction in a deep neural network model. The probabilistic predictions are modeled as a heteroscedastic von Mises-Fisher distribution on the sphere S 2 , giving a simple way to quantify aleatoric uncertainty. This approach generalizes the cosine distance loss which is a special case of our loss function when the uncertainty is assumed to be uniform across samples. We develop approximations required to make the likelihood function and gradient calculations stable. The method is applied to the task of predicting the 3D directions of electrons, the most complex signal in a class of experimental particle physics detectors designed to demonstrate the particle nature of dark matter and study solar neutrinos. Using simulated Monte Carlo data, the initial direction of recoiling electrons is inferred from their tortuous trajectories, as captured by the 3D detectors. For 40 keV electrons in a 70% He 30% CO 2 gas mixture at STP, the new approach achieves a mean cosine distance of 0.104 (26 ∘ ) compared to 0.556 (64 ∘ ) achieved by a non-machine learning algorithm. We show that the model is well-calibrated and accuracy can be increased further by removing samples with high predicted uncertainty. This advancement in probabilistic 3D directional learning could increase the sensitivity of directional dark matter detectors.

Computer Science↗
DOE OSTI2020

Scalable Wind Turbine Generator Bearing Fault Prediction Using Machine Learning: A Case Study

Operation and maintenance (O&M) costs for wind turbines pose a risk to competitiveness and asset owners. With machine-learning technologies and digitalization rapidly maturing, the wind industry is actively investigating these new technologies to optimize O&M practices and reduce costs. This paper reviews recent work on machine-learning approaches to generator bearing failure prediction and presents a relevant real-world case study through a collaboration between the National Renewable Energy Laboratory and Envision Digital Corporation. In the case study, we evaluate the performance of representative machine-learning algorithms for predicting wind turbine generator bearing failures. Operational supervisory control and data acquisition data from one wind power plant was used to train and test the machine-learning models. The investigated data channels are chosen based on whether physically they reflect the failed generator bearing conditions and the component historical usage, including both environmental and operational conditions. Benefits and drawbacks of different methods are identified.

generator bearing failures↗
DOE OSTI2020

The importance of round-robin validation when assessing machine-learning-based vertical extrapolation of wind speeds

The extrapolation of wind speeds measured at a meteorological mast to wind turbine rotor heights is a key component in a bankable wind farm energy assessment and a significant source of uncertainty. Industry-standard methods for extrapolation include the power-law and logarithmic profiles. The emergence of machine-learning applications in wind energy has led to several studies demonstrating substantial improvements in vertical extrapolation accuracy in machine-learning methods over these conventional power-law and logarithmic profile methods. In all cases, these studies assess relative model performance at a measurement site where, critically, the machine-learning algorithm requires knowledge of the rotor-height wind speeds in order to train the model. This prior knowledge provides fundamental advantages to the site-specific machine-learning model over the power-law and log profiles, which, by contrast, are not highly tuned to rotor-height measurements but rather can generalize to any site. Furthermore, there is no practical benefit in applying a machine-learning model at a site where winds at the heights relevant for wind energy production are known; rather, its performance at nearby locations (i.e., across a wind farm site) without rotor-height measurements is of most practical interest. To more fairly and practically compare machine-learning-based extrapolation to standard approaches, we implemented a round-robin extrapolation model comparison, in which a random-forest machine-learning model is trained and evaluated at different sites and then compared against the power-law and logarithmic profiles. We consider 20 months of lidar and sonic anemometer data collected at four sites between 50 and 100 km apart in the central United States. We find that the random forest outperforms the standard extrapolation approaches, especially when incorporating surface measurements as inputs to include the influence of atmospheric stability. When compared at a single site (the traditional comparison approach), the machine-learning improvement in mean absolute error was 28 % and 23 % over the power-law and logarithmic profiles, respectively. Using the round-robin approach proposed here, this improvement drops to 20 % and 14 %, respectively. These latter values better represent practical model performance, and we conclude that round-robin validation should be the standard for machine-learning-based wind speed extrapolation methods.

17 WIND ENERGY↗