Search NASA⌕ Search

SEARCH · Search NASA

Results for “Machine learning 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 685 records · Page 38

Best of both worlds: Enforcing detailed balance in machine learning models of transition rates

The slow microstructural evolution of materials often plays a key role in determining material properties. When the unit steps of the evolution process are slow, direct simulation approaches such as molecular dynamics become prohibitive and Kinetic Monte-Carlo (kMC) algorithms, where the state-to-state evolution of the system is represented in terms of a continuous-time Markov chain, are instead frequently relied upon to efficiently predict long-time evolution. The accuracy of kMC simulations however relies on the complete and accurate knowledge of reaction pathways and corresponding kinetics. This requirement becomes extremely stringent in complex systems such as concentrated alloys where the astronomical number of local atomic configurations makes the a priori tabulation of all possible transitions impractical. Machine learning models of transition kinetics have been used to mitigate this problem by enabling the efficient on-the-fly prediction of kinetic parameters. While conventional KMC methods based on transition state theory naturally yield reversible dynamics that exactly obey the detailed balance criterion, providing strong guarantees on the properties of the stationary distribution, many recently-proposed ML-based approaches to barrier predictions provide no such guarantees. In this study, we derive conditions under which physics-informed ML architectures exactly enforce the detailed balance condition by construction, even when relying on non-extensive descriptions of states in terms of local environments around mobile defects. In conclusion, using the diffusion of a vacancy in a concentrated alloy as an example, we show that such ML architectures also exhibit superior performance in terms of prediction accuracy, demonstrating that the imposition of physical constraints can facilitate the accurate learning of barriers at no increase in computational cost.

36 MATERIALS SCIENCE↗

A Chlorophyll-a Algorithm for Landsat-8 Based on Mixture Density Networks

Retrieval of aquatic biogeochemical variables, such as the near-surface concentration of chlorophyll-a (Chla) in inland and coastal waters via remote observations, has long been regarded as a challenging task. This manuscript applies Mixture Density Networks (MDN) that use the visible spectral bands available by the Operational Land Imager (OLI) aboard Landsat-8 to estimate Chla. We utilize a database of co-located in situ radiometric and Chla measurements (N = 4,354), referred to as Type A data, to train and test an MDN model (MDN(A)). This algorithm’s performance, having been proven for other satellite missions, is further evaluated against other widely used machine learning models (e.g., support vector machines), as well as other domain-specific solutions (OC3), and shown to offer significant advancements in the field. Our performance assessment using a held-out test data set suggests that a 49% (median) accuracy with near-zero bias can be achieved via the MDN(A) model, offering improvements of 20 to 100% in retrievals with respect to other models. The sensitivity of the MDN(A) model and benchmarking methods to uncertainties from atmospheric correction (AC) methods, is further quantified through a semi-global matchup dataset (N = 3,337), referred to as Type B data. To tackle the increased uncertainties, alternative MDN models (MDN(B)) are developed through various features of the Type B data (e.g., Rayleigh-corrected reflectance spectra ρ(s)). Using held-out data, along with spatial and temporal analyses, we demonstrate that these alternative models show promise in enhancing the retrieval accuracy adversely influenced by the AC process. Results lend support for the adoption of MDN(B) models for regional and potentially global processing of OLI imagery, until a more robust AC method is developed. Index Terms—Chlorophyll-a, coastal water, inland water, Landsat-8, machine learning, ocean color, aquatic remote sensing.

Brandon Smith↗

Prediction of Stiffness and Fatigue Lives of Polymer Matrix Composite Laminates Using Artificial Neural Networks

Machine learning (ML) models are increasingly being used in many engineering fields due to the advancements in ML algorithms and availability of high-speed computing power. One of the most popular ML class of models is artificial neural networks (ANN). ML is increasingly being used in the design and analysis of composite materials and structures, specifically in the constitutive modeling of composite materials with the focus on greatly accelerating multiscale analyses of composite materials and structures through development of surrogate models. Towards that end, both Python and MATLAB-based neural nets have been developed to predict initial stiffness and fatigue life of an eight-ply symmetric polymer matrix composite laminate. Two types of neural networks, a Multilayer Perceptron (MLP) and a Recurrent Neural Network (RNN), have been developed for both platforms. Results show that the both neural net types can provide an excellent estimate of initial stiffness as well as fatigue life of eight-ply symmetric polymer matrix composite laminate. RNNs are better able to capture the shape of the fatigue curve of a laminate. This tool can be very useful for system level studies to obtain an estimate of desired properties and life of PMC composite laminates. The associated surrogate models could also be used in composite multiscale analyses to replace the actual physics-based calculations at lower scales and thereby significantly increase the computational efficiency of such analyses and thus make multiscale analyses a viable industrial tool for large scale structural problems.

Composite↗

Artificial Neural Network (ANN) Surface Longwave and Shortwave Fluxes Trained on CERES Observations

The Clouds and Earth’s Radiant Energy System (CERES) project provides satellite-based observations of the radiative fluxes and clouds systems. CERES climate quality data products typically take several months of calibration and validation before release to the public. The Fast Longwave and Shortwave Radiative Flux (FLASHFlux) data product was developed to provide key data for the applied sciences and educational users within a week of observation. FLASHFlux achieves this by using simplified calibration, an operational meteorological product from Global Modeling and Assimilation Office (GMAO), and its own surface parameterizations model. The CERES FLASHFlux provides two data products: 1) an hourly Level 2 Single Scanner Footprint (SSF) data separately for Terra and NOAA-20 observations, and 2) a daily Level 3 Time Interpolated and Spatially Averaged (TISA) 1o x 1o gridded data that combines Terra and NOAA-20 observations. Currently, FLASHFlux uses the Langley Parameterized Shortwave Algorithm (LPSA) and Langley Parameterized Longwave Algorithm (LPLA) to derive its surface fluxes (Kratz et al., 2010; Gupta et al, 2001). A new Machine Learning (ML) based approach using Artificial Neural Networks to derive Surface Longwave (LW) & Shortwave (SW) fluxes based on training data from the CERES Clouds Radiative Swath (CRS) product is being investigated to replace LPSA and LPLA in the SSF surface flux products. One of the biggest hurdles in training ML model is model fitting. To overcome the problem of overfitting we use feature engineering that helps in finding the important feature and remove features that are irrelevant to the model. In our training we employed the Leave-One-Feature-Out Importance (LOFO) to evaluate the significance of each feature in our training. We intercompare ANN fluxes against surface fluxes produced from the Fu-Liou model in CRS and the LPSA/LPLA in FLASHFlux SSF. Furthermore, we validated ANN derived fluxes to the Baseline Surface Radiation Network (BSRN).

P C Sawaengphokhai↗

Machine learning for fundamental spectroscopic and thermodynamic data of actinides and lanthanides

Accurately modeling optical spectra with absolute radiometric intensities is vital for nuclear forensics applications that depend on characterizing optical emissions from energetic nuclear phenomena. This requires precise knowledge of the individual atomic transition probabilities, known as Einstein A-coefficients, for each emission line. Obtaining these values theoretically or experimentally is often impractical due to the complex electronic structures and the number of transitions involved in atoms relevant to nuclear applications. In this study, we explore the use of machine learning to predict the Einstein A coefficients for atomic transitions. Seven models were evaluated that ranged from deep learning to decision tree algorithms, and found that gradient boosting performed best, specifically the Extreme Gradient Boosting (XGB) architecture, achieving a precision of 86% across transitions of 36 elements. Furthermore, the model was cross-validated using published transition probabilities reported in the literature and applied to estimate Pu plasma temperatures from a previous experiment conducted at Savannah River National Laboratory.

Atomic spectroscopy↗

The Application of Artificial Intelligence and Deep Learning to Visually Identify Micrometeoroid and Orbital Debris Impacts

Recent advancements in Artificial Intelligence (AI) have made Machine Learning (ML) techniques readily available for practical applications while using a fraction of time that was previously required. In particular, the use of Deep Learning (DL) algorithms has advanced the field of image and pattern recognition. With the use of Deep Learning algorithms, Micrometeoroid and Orbital Debris(MMOD) penetrations can be identified with high accuracy and give possibilities to new understandings of hypervelocity impacts.

Deep Learning↗

High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder

Recent progress in quantum algorithms and hardware indicates the potential importance of quantum computing in the near future. However, finding suitable application areas remains an active area of research. Quantum machine learning is touted as a potential approach to demonstrate quantum advantage within both the gate-model and the adiabatic schemes. For instance, the QVAE has been proposed as a quantum enhancement to the discrete VAE. We extend on previous work and study the real-world applicability of a QVAE by presenting a proof-of-concept for similarity search in large-scale high-dimensional datasets. While exact and fast similarity search algorithms are available for low dimensional datasets, scaling to high-dimensional data is non-trivial. We show how to construct a space-efficient search index based on the latent space representation of a QVAE. Our experiments show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the MODIS dataset. Further, we find real-world speedups compared to linear search and demonstrate memory-efficient scaling to half a billion data points.

Data mining, similarity search, quantum machine le↗

Speedup of UEDGE Parameter Scans Using Machine-Learning Optimized OpenMP Parallelization and a Continuation Solver

This article presents the OpenMP parallelization of the preconditioning Jacobian assembly and right‐hand side residual evaluation in UEDGE. A continuation algorithm, utilizing the internal NKSOL implicit Jacobian‐Free Newton‐Krylov solver to efficiently scan physical parameters, is also presented. The implemented parallelization reduces the computational time for a benchmark scan run on 32 threads by compared to the serial version when using trained random forest regression models to identify the optimal decomposition of the system of equations. Random forest regression models applied to the UEDGE time‐dependent and continuation solver algorithms did not yield meaningful improvement in computational performance. A benchmark DIII‐D gas injection rate scan in the 0.35–0.75 kA interval, performed on a test cluster using the parallelized code and continuation solver, produced 1066 steady‐state solutions with a 22 s average wall‐clock computational time per steady‐state solution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Unsupervised Learning for Improved Gamma-Ray Spectrometry in Pixelated Cadmium Zinc Telluride (CZT) Detectors

Machine learning has been found to be ubiquitously useful across many industries, presenting an opportunity to improve radiation detection performance using data-driven algorithms. Improved detector resolution can aid in the detection, identification, and quantification of radionuclides. Here, in this work, a novel, data-driven, unsupervised learning approach is developed to improve detector spectral characteristics by learning, and subsequently rejecting, poorly performing regions of the pixelated detector. Feature engineering is used to fit individual characteristic photo peaks to a Doniach lineshape with a linear background model. Then, principal component analysis is used to learn a lower-dimension latent space representation of each photo peak where the pixels are clustered, and subsequently ranked, based on the cluster mean distance to an optimal point. Pixels within the worst cluster(s) are rejected to improve the full-width at half-maximum (FWHM) by 10% to 15% (relative to the bulk detector) at 50% net efficiency when applied to training data obtained from measurements of a 100 μCi 154 Eu source using a H3D M400i pixelated cadmium zinc telluride detector. These results compare well with, but do not outperform, a greedy algorithm that accumulates pixels in order of FWHM from lowest to highest used as a benchmark. In the future, this approach can be extended to include the detector energy and angular response. Finally, the model is applied to newly seen natural and enriched uranium spectra relevant for nuclear safeguards applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Model-free stabilization via Extremum Seeking using a cost neural estimator

In this paper, a fully model-free architecture for vertical stabilization of thermonuclear plasmas in tokamak experimental reactors is presented. For the first time, an Extremum Seeking control algorithm is combined with neural networks to estimate the Lyapunov function to be minimized, resulting in a fully data-driven control architecture. The performance of different neural networks are compared. Specifically, Multilayer Perceptrons and Extreme Learning Machines are considered. The proposed architecture is tested in simulation to show that it can counteract relevant plasma disturbances, resulting in a significant improvement in terms of the achievable operative space compared to the Extremum Seeking algorithm, which still relies on model-based cost estimator.

42 ENGINEERING↗

Rapid data acquisition and machine learning-assisted composition design of functionally graded alloys via wire arc additive manufacturing

Abstract The lack of high-quality datasets in materials science hinders artificial intelligence (AI)-driven alloy design. To address this challenge, wire arc additive manufacturing (WAAM) was employed to fabricate graded alloys, generating extensive data for machine learning (ML)-assisted property prediction. ML models were developed using high-throughput experiments, computational models, and genetic algorithm to optimize feature selection, successfully predicting hardness and porosity. The ML model demonstrated its efficacy by designing a gradient alloy with enhanced properties. However, scaling up revealed uncertainties in tensile property and porosity due to differences in size and thermal conditions between the designed alloy build and the gradient print used to construct the ML model. This underscores the need for uncertainty quantification and process optimization in WAAM-driven alloy design. Our work advances AI-integrated additive manufacturing, offering a rapid approach to exploring process–structure–property relationships and accelerating materials development.

Wang, Xin↗

Quantum Software Engineering (Dagstuhl Seminar 24512)

The Dagstuhl Seminar 24512 on "Quantum Software Engineering" was held from December 15 to 20, 2024. It brought together 26 participants from industry and academia from 13 different countries, including senior and junior researchers as well as practitioners in the field of Quantum Software Engineering. The aim of the seminar was to advance software engineering methods and tools for the engineering of hybrid quantum systems by promoting personal interaction and open discussion among researchers who are already working in this emerging area of knowledge. The first day of the seminar was devoted to the topic "When software engineering meets quantum mechanics", while the second day focused on "Quantum software engineering and its challenges." During both days, 16 invited presentations were given. The rest of the seminar was organized into three working groups to address the topics "Quantum Software Design, Modelling and Architecturing", "Adaptive Hybrid Quantum Systems", and "Quantum Software Quality Assurance". The seminar was a very fruitful experience for all participants both in terms of scientific outcomes and in terms of the personal relationships that were generated to jointly address future experiences.

97 MATHEMATICS AND COMPUTING↗

Review and Analysis of Algorithmic Approaches Developed for Prognostics on CMAPSS Dataset

Benchmarking of prognostic algorithms has been challenging due to limited availability of common datasets suitable for prognostics. In an attempt to alleviate this problem several benchmarking datasets have been collected by NASA's prognostic center of excellence and made available to the Prognostics and Health Management (PHM) community to allow evaluation and comparison of prognostics algorithms. Among those datasets are five C-MAPSS datasets that have been extremely popular due to their unique characteristics making them suitable for prognostics. The C-MAPSS datasets pose several challenges that have been tackled by different methods in the PHM literature. In particular, management of high variability due to sensor noise, effects of operating conditions, and presence of multiple simultaneous fault modes are some factors that have great impact on the generalization capabilities of prognostics algorithms. More than 70 publications have used the C-MAPSS datasets for developing data-driven prognostic algorithms. The C-MAPSS datasets are also shown to be well-suited for development of new machine learning and pattern recognition tools for several key preprocessing steps such as feature extraction and selection, failure mode assessment, operating conditions assessment, health status estimation, uncertainty management, and prognostics performance evaluation. This paper summarizes a comprehensive literature review of publications using C-MAPSS datasets and provides guidelines and references to further usage of these datasets in a manner that allows clear and consistent comparison between different approaches.

Uncertainty↗

Image Labeler: A Web Interface to Catalog Earth Science Events

Advances in machine learning (ML) have made it possible to automatically detect Earth science phenomena from satellite imagery. While useful, ML algorithms typically require an extensive dataset containing labeled images for training. Systematic labeling and management of such datasets is quite cumbersome. With this in mind, we present the Image Labeler. Image Labeler is a fast and scalable cloud-based tool that facilitates the rapid development of Earth science event databases, in order to aid automated ML-based image classification.

Case Study↗

Deep Learning Method for Detecting Precursors to Adverse Events

With the recent advancements in Deep Learning methods, the ability to model large complex heterogeneous data sets are fundamentally changing industry and research. Coupled with hardware improvements, and ease of implementation, a wide variety of deep neural network architectures can quickly be developed to solve a sweeping range of problems such as: object detection in images, automatic healthcare diagnosis using heterogenous data sources, real time language translating and sentence prediction, upscaling low resolution images, and forecasting of multivariate timeseries. Generally, many of these architectures outperform classical machine learning approaches in their respective tasks, however, this typically comes at a cost of interpretability. These black box algorithms generally suffer from lack of transparency in both model complexity as well as the rationale behind the prediction. This lack of comprehension, is driving an emerging area of interest in “Explainable AI”. An algorithm called: “Deep Temporal Multiple Instance Learning”1 was a recently developed to identify precursors to adverse events and has been applied in the aviation domain. The deep learning architecture is designed to capture the evolution of the probability of the outcome over the time preceding the adverse event using a multiple instance learning approach as illustrated in Figure 1. Precursors are defined when the probability of the event has exceeded a threshold at some point in the timeseries, at which point, a sensitivity analysis is performed to determine contributing factors. The contributing factors are used to explain and define the precursor during the periods where the probability score is high. The identified contributing factors are then presented to subject matter experts to provide objective insights into the leading factors associated with the particular adverse event. The algorithm has been tested on flight data from a commercial airline and has the ability to discover precursors to known adverse events that take the form of safety critical operations, such as unstable approach events on final approach. Apart from detecting precursors to adverse events, the converse can also be leveraged to discover corrective actions. These positive actions manifest themselves as periods in the timeseries when the precursor score has been lowered from an elevated state; meaning that if the system had been left uncorrected, it would have eventually reached the adverse event state. Characterizing these state changes can help identify successful interventions that may not have been known before. Policy makers and procedure designers can use this additional knowledge to craft more safety and efficient resilient procedures for future operations and therefore improve the overall performance of the National Airspace.

Matthews, Bryan L.↗

A generalizable machine learning approach to predict land surface temperature

Monitoring of land surface and atmospheric states is highly reliant on satellite data. Traditionally, data products are generated using carefully tuned and validated algorithms for low-earth orbit (LEO) sensors. However, the emerging constellation of geostationary (GEO) sensors contributes global, high temporal resolution observations which can better capture the diurnal variability of key observables like land surface temperature (LST). Using high performance computing and datasets from the NASA Earth Exchange, we exploit co-located, co-temporal observations from LEO and GEO satellites to develop a deep learning-based method for sensor-to-sensor algorithm emulation. Our model is trained on GOES-16 thermal bands to predict MODIS Terra LST and achieves a validation error <2K. Further, application of the model to unseen times of day and a second GEO sensor observing an unseen spatial domain demonstrate the generalization of the deep learning model across space, time and spectra. We anticipate that the synergies between a variety of active orbit configurations can be used to accelerate application of existing algorithms to new datasets.

Kate Marie Duffy↗

Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth

Matrix chain multiplication -- computing $\mathcal{W} = M^{(0)}\cdots M^{(K-1)}$ where $M^{(k)} \in \mathbb{R}^{P_k \times P_{k+1}}$-- arises in scientific computing, machine learning, and graph analysis. Despite the importance of this problem, for chains of distinct matrices, the classical number of operations grows linearly with the chain length $K$ and polynomially in the matrix dimensions. We present \emph{Two-Tower Matrix Multiplication}, a quantum subroutine that encodes the product $\mathcal{W}$ of the $K$ matrices into a quantum state in circuit depth $\mathcal{O}(\max_{k} \mathrm{polylog} (P_k P_{k+1}))$, which is independent of~$K$ within the QRAM-based state-preparation model, whereas the qubit count is $\mathcal{O}\bigl(\sum_{k} \log P_k \bigr)$; the total gate count remains linear in $K$, so the gain is in the circuit depth. The construction interleaves state-preparation operators across two layers; within each layer, all operators act on disjoint registers and execute in parallel. This subroutine can be specialized for the chain-vector case, which computes the product of $K-1$ matrices applied to a vector. We prove the correctness of the subroutine for all $K$ and provide two implementations using the Qiskit and QCLAB frameworks. The subroutine is applicable to any downstream quantum algorithm that operates on a matrix encoded in the statevector, including norm estimation, graph-matrix powers, linear system solving, and quantum machine learning kernels.

Antonioli, Giacomo [Pisa U.] (ORCID:00090000668703↗

Event Detection and Classification Using Machine Learning Applied to PMU Data for the Western US Power System

Smart grid technology enhances our comprehension and reliability of the power grid, leveraging Phasor Measurement Unit (PMU) data—time-synchronized, high-frequency measurements gathered across the US power grid. This paper employs machine learning techniques to effectively analyze the vast PMU data in Wide Area Monitoring Systems (WAMS) for power grid event detection and classification. Analyzing several months of real-world PMU data, the paper focuses on machine learning for fast, precise event detection and classification, corroborated by utility event logs. Practical challenges like feature extraction, dimensionality reduction, and model selection are addressed. A novel feature yielding improved results is discovered, and a supplementary algorithm for detecting small power grid faults is developed. The final algorithm is validated using a month-long real PMU data set, demonstrating its capability in accurately identifying power grid events in near real-time.

machine learning, event detection, PMU↗