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 325 records · Page 18

Machine learning-accelerated discovery of iron cobalt phosphides as rare-earth-free magnets

Here, the discovery of rare-earth-free permanent magnets has been a goal of scientists for decades. The absence of rare-earth elements will alleviate a pressing concern about the availability of rare-earth elements used in permanent magnets. These magnets are crucial for applications such as wind turbines, electric cars, and memory devices. Rare-earth magnets are special owing to a large magnetic anisotropy energy (K 1 ). In contrast, iron cobalt phosphides hold promise since doping P into cubic FeCo can induce anisotropy, leading to a large coercivity, without introducing rare-earth elements. We present a comprehensive search over the Fe-Co-P ternary space for magnets, utilizing recently developed adaptive machine learning feedback to efficiently screen over 850 000 structures. We focus on machine learning acceleration as a paradigm for materials design. Further adaptive genetic algorithm searches and first-principles calculations aid in the identification of 16 new structures below the known convex hull. Five of them possess high magnetic polarization (J s > 1 T). The structures with desirable magnetic properties center on (Fe,Co) 2⁢ P. This supports conventional wisdom, which focuses on the mixture of the two known end compounds: Fe 2 ⁢P and Co 2 ⁢P. Our work provides guidance for synthesis. We find Fe 7 ⁢CoP 4 shows the most promise (J s = 1.03T and K 1 = 0.83MJ/m 3 ).

36 MATERIALS SCIENCE↗

Localization in Energy Materials (Final Project Report)

The last year of this award we have continued our research on using quantum machine learning to identify phase transitions. By combining quantum machine learning with quantum computing, we extended a hybrid classical-quantum algorithm to capture the metal-insulator quantum phase transition of the Hubbard model. We have also continued our studies of non-equilibrium dynamics of interacting disordered systems. In particular, we studied the non-equilibrium transient dynamics of a system described by the Anderson-Hubbard model following an interaction and disorder quench, and the effect of disorder on the out-of-time-order correlator on the Hubbard model.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A machine learning based approach to online electron reconstruction at CLAS12

Online reconstruction is key for monitoring purposes and real time analysis in High Energy and Nuclear Physics experiments. A necessary component of reconstruction algorithms is particle identification that combines information left by a particle passing through several detector components to identify the particle’s type. Of particular interest to electro-production Nuclear Physics experiments such as CLAS12 is electron identification which is used to trigger data recording. A machine learning approach was developed for CLAS12 to reconstruct and identify electrons by combining raw signals at the data acquisition level from several detector components. Here, this approach achieves an electron identification purity above 75% whilst retaining an efficiency close to 100%. The machine learning tools are capable of running at high rates exceeding the data acquisition rates and will allow electron reconstruction in real-time. This work enhances online analyses and monitoring and can contribute to improved triggering at CLAS12. This machine learning driven approach will also be crucial for experiments aiming to transition to streaming readout operations where online reconstruction will be a key component of the data taking paradigm.

Artificial intelligence↗

Decentralized Microgrid Protection Through Relative Fault Direction Classification: Preprint

Protection in inverter-based resources (IBRs) dominated microgrids generally face significant challenges due to the low fault current and inconsistent fault behaviors from IBRs. Recently, machine learning-based approaches have attracted considerable attention to address these challenges. This paper introduces a novel decentralized protection strategy for microgrids. The proposed method decomposes the protection challenge into several distributed learning tasks, enabling individual relays to autonomously determine the direction of faults using a binary classification framework based on support vector machine (SVM) algorithms. Following the distributed fault direction estimation, classifier outcomes are shared among neighboring relays, facilitating a local decision-making process to ascertain the presence of faults within the neighborhood. Finally, a tripping signal is generated based on the classifier results of each relay to operate the circuit breaker. To test and validate this approach, a 100% renewable microgrid model is simulated in MATLAB/Simulink. In the numerical analysis, the application of SVM classifiers in our approach yields impressive results: an average relay classification accuracy of 98%, and a 96% accuracy in circuit breaker control. These findings highlight the potential of machine-learning-based approaches in enhancing the efficiency and reliability of microgrid protection systems.

decentralized algorithm↗

Fast Machine Learning for Quantum Control of Microwave Qudits on Edge Hardware

Quantum optimal control is a promising approach to improve the accuracy of quantum gates, but it relies on complex algorithms to determine the best control settings. CPU or GPU-based approaches often have delays that are too long to be applied in practice. It is paramount to have systems with extremely low delays to quickly and with high fidelity adjust quantum hardware settings, where fidelity is defined as overlap with a target quantum state. Here, we utilize machine learning (ML) models to determine control-pulse parameters for preparing Selective Number-dependent Arbitrary Phase (SNAP) gates in microwave cavity qudits, which are multi-level quantum systems that serve as elementary computation units for quantum computing. The methodology involves data generation using classical optimization techniques, ML model development, design space exploration, and quantization for hardware implementation. Our results demonstrate the efficacy of the proposed approach, with optimized models achieving low gate trace infidelity near $10^{-3}$ and efficient utilization of programmable logic resources.

Sanders, Flor [Columbia U.]↗

Subspace-Driven Learning for Anomaly Detection in Process Transients

Nuclear power plant (NPP) monitoring and diagnostic centers are actively investigating and implementing automated anomaly detection algorithms to help plants catch anomalies sooner, thereby preventing or reducing the duration of unexpected shutdowns. Current machine learning-based anomaly detection methods are expected to be highly effective during stable, full-power operations because NPPs typically operate as baseload power generators, meaning there are extensive operating data available from plant equipment. However, it is expected that anomaly detection methods will face significant challenges during transient conditions (i.e., when power output falls below full power) because plants only occasionally operate at these lower power levels, generating sparse transient operational data, and resulting in false alarms or missed detections. Here, to address this issue, transfer learning is used, which for this problem leverages knowledge (in the form of learned features) from stable, full-power operations to improve detection accuracy during transient conditions, even with limited data. In this effort, a novel subspace approach is developed to transfer a subset of the data features from full power operation to transients. This approach is validated through experiments using synthetic data and was found to outperform two baseline transfer learning approaches in anomaly detection performance across a range of amounts of transient data used in the training process.

46 - INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AN↗

SQMS Quantum R&D in Machine Learning, Optimization and Sensing beyond Fundamental Physics Applications

This newly formed team at SQMS under the Ecosystem Thrust is looking to develop capabilities impacting societal advances outside the core domain of HEP and condensed matter physics. We explicitly leverage the experimental and algorithmic innovations developed across all groups as well as connect to broad-scope external projects of the diverse team of PIs. As the inaugural set of projects, we are studying numerically quantum machine learning models inspired by efficiently trainable echo-state and orthogonal neural networks and developing designs for related experiments to be performed on quantum processors based on SQMS SRF cQED technology and Rigetti s transmon arrays. Investigated models exploit ideas and lessons learned from multiple prior work by SQMS team members in a variety of internal and external activities [R1]. Target initial applications include noisy signal processing, potentially captured by quantum sensors or noisy QPUs, as well as simulation and classification of healthcare data. For instance, image reconstruction of the brain s electrical properties by solving the inverse Maxwell equation problem with uncertainty [R2] through a hybrid quantum-classical physics-informed architecture for time-dependent processes [R3]. The group is also investigating the application and development of novel quantum sensors based on magnetic levitation of a superconducting sphere coupled to a superconducting qubit. This coupling enables high-precision measurements of the position of the sphere, which can be used for sensitive detection of forces, enabling practical applications such as gravimetry for geophysics analysis, or accelerometry for GPS-denied navigation [R4] [R1] Rieffel, Eleanor G., Ata Akbari Asanjan, M. Sohaib Alam, Namit Anand, David E. Bernal Neira, Sophie Block, Lucas T. Brady et al. "Assessing and advancing the potential of quantum computing: A NASA case study." Future Generation Computer Systems (2024). [R2] Yu, X., Serrall s, J.E., Giannakopoulos, I.I., Liu, Z., Daniel, L., Lattanzi, R. and Zhang, Z., 2023. Pifon-ept: Mr-based electrical property tomography using physics-informed fourier networks. IEEE Journal on Multiscale and Multiphysics Computational Techniques. [R3] Wudarski, Filip, Daniel OConnor, Shaun Geaney, Ata Akbari Asanjan, Max Wilson, Elena Strbac, P. Aaron Lott, and Davide Venturelli. "Hybrid quantum-classical reservoir computing for simulating chaotic systems." arXiv preprint arXiv:2311.14105 (2023). [R4] Higgins, Gerard, Saarik Kalia, and Zhen Liu. "Maglev for dark matter: Dark-photon and axion dark matter sensing with levitated superconductors." Physical Review D 109.5 (2024): 055024.

Venturelli, Davide↗

Digital twin framework for PIP-II linac: AI-driven multi-scale modeling from ion source to 800 MeV

The PIP-II superconducting linac at Fermilab is designed to deliver multi-megawatt proton beams for neutrino physics and other high-intensity applications. To expedite commissioning and enhance operational reliability, we have developed an EPICS-based data flow framework that seamlessly integrates digital twins (DT) with physical twins (PT). These digital twins comprise high-fidelity beam dynamics models or data-driven surrogate models connected to their physical counterparts through real-time diagnostics and advanced machine-learning algorithms.Central to this framework is Linac_Gen, an accelerated simulation tool that incorporates convolutional neural networks, random forests, and genetic algorithms to provide up to a tenfold speedup in optimizing the accelerator geometry model. An EPICS translator layer ensures interoperability by efficiently mapping lattice parameters across diverse simulation platforms.Our EPICS-based framework supports multiple operational modes—monitoring, passive learning, closed-loop control, and online learning—covering the entire machine lifecycle. By leveraging HPC resources and multi-objective optimization techniques, the digital twin enables adaptive trajectory correction, real-time fault detection, and predictive modeling of beam stability. This comprehensive approach paves the way for robust, high-intensity operation and data-driven accelerator R&D at Fermilab.

Pathak, Abhishek [Fermilab]↗

Generalized representative structures for atomistic systems

A new method is presented to generate atomic structures that reproduce the essential characteristics of arbitrary material systems, phases, or ensembles. Previous methods allow one to reproduce the essential characteristics (e.g. the chemical disorder) of a large random alloy within a small crystal structure. The ability to generate small representations of random alloys, along with the restriction to crystal systems, results from using the fixed-lattice cluster correlations to describe structural characteristics. A more general description of the structural characteristics of atomic systems is obtained using complete sets of atomic environment descriptors. These are used within for generating representative atomic structures without restriction to fixed lattices. A general data-driven approach is provided here utilizing the atomic cluster expansion (ACE) basis. The N-body ACE descriptors are a complete set of atomic environment descriptors that span both chemical and spatial degrees of freedom and are used within for describing atomic structures. The generalized representative structure (GRS) method presented within generates small atomic structures that reproduce ACE descriptor distributions corresponding to arbitrary structural and chemical complexity. It is shown that systematically improvable representations of crystalline systems on fixed parent lattices, amorphous materials, liquids, and ensembles of atomic structures may be produced efficiently through optimization algorithms. With the GRS method, we highlight reduced representations of atomistic machine-learning training datasets that contain similar amounts of information and small 40–72 atom representations of liquid phases. The ability to use GRS methodology as a driver for informed novel structure generation is also demonstrated. The advantages over other data-driven methods and state-of-the-art methods restricted to high-symmetry systems are highlighted.

atomic cluster expansion↗

Machine learning models for segmentation and classification of cyanobacterial cells

Abstract Timelapse microscopy has recently been employed to study the metabolism and physiology of cyanobacteria at the single-cell level. However, the identification of individual cells in brightfield images remains a significant challenge. Traditional intensity-based segmentation algorithms perform poorly when identifying individual cells in dense colonies due to a lack of contrast between neighboring cells. Here, we describe a newly developed software package called Cypose which uses machine learning (ML) models to solve two specific tasks: segmentation of individual cyanobacterial cells, and classification of cellular phenotypes. The segmentation models are based on the Cellpose framework, while classification is performed using a convolutional neural network named Cyclass. To our knowledge, these are the first developed ML-based models for cyanobacteria segmentation and classification. When compared to other methods, our segmentation models showed improved performance and were able to segment cells with varied morphological phenotypes, as well as differentiate between live and lysed cells. We also found that our models were robust to imaging artifacts, such as dust and cell debris. Additionally, the classification model was able to identify different cellular phenotypes using only images as input. Together, these models improve cell segmentation accuracy and enable high-throughput analysis of dense cyanobacterial colonies and filamentous cyanobacteria.

Huffine, Clair A.↗

A Workflow to Optimize Fast Neutron Irradiation in A Thermal Neutron Spectrum Test Reactor Leveraging Open-Source Tools

The Advanced Test Reactor (ATR) located at Idaho National Laboratory (INL) is one of the key nuclear engineering research and testing facilities within the US Department of Energy (DOE). The ATR is one of few high-power research reactors in the world with different application including accelerated testing of nuclear fuel, materials irradiation in a very high neutron flux environment, and medical radioisotope production [1]. Also, the ATR offers opportunities for testing fast spectrum fission and fusion reactor materials. The key challenges in this area are in further detailing and optimizing a fast spectrum environment within a thermal test reactor. This challenge involves researching, developing, and testing novel concepts for the multiplying of neutron populations into ever higher energy spectra in high flux test reactors like ATR. The main objective of this work is to investigate candidate materials for establishing a fast neutron experiment irradiation in thermal neutron spectrum test reactors which can be accomplished by filtering thermal and epithermal neutrons and boosting fast neutrons at designated irradiation positions. However, adding these filters will render the neutron spectrum and the criticality of the system. The selection of the thickness and material layers should be accomplished by developing an optimization design algorithm that is applicable for ATR to enhance the fast neutron spectrum irradiation utilizing high-fidelity Monte Carlo methods along with advanced machine learning capabilities. This paper presents workflow for design optimization to enhance fast neutron irradiation in the ATR. The workflow leverages open-source tools to develop an algorithm that is viable to ATR and can be leveraged in other reactors. The following sections discuss the development of the experiment design optimization workflow and its application to ATR irradiation positions.

42 - ENGINEERING↗

Spectral Clustering-Based Partitioning of Large-Scale Power Electronics-Based Power Systems for Small-Signal Stability Analysis

The nodal admittance matrix (NAM)-based approach is well-suited for small-signal stability analysis of large-scale power electronics-based power systems (PEPSs), as it preserves the system structure through its admittance matrix. Previous studies have explored partitioning such systems into subareas and interconnections to reduce computational burden; however, they lacked a formal algorithmic procedure for determining feasible partitions. While several grid partitioning methods, such as those based on graph theory or machine learning, exist in the literature, they cannot be directly applied to NAM-based analysis due to differing objectives and constraints. Here, this paper addresses this gap by presenting a systematic, step-by-step procedure for applying a spectral partitioning algorithm that yields a division of the system into subareas suitable for NAM-based analysis. The computational complexity of the proposed method is also derived to demonstrate its efficiency and justify the practicality of the resulting subarea decomposition. The performance of the partitioning method is evaluated by applying the spectral clustering-derived subareas and interconnections to the NAM-based partitioning approach on a 140-bus system. Computational times for the full-system and partitioned NAM analyses are compared using MATLAB. Additionally, PSCAD simulations of the complete system and partitioned subareas are carried out to verify the effectiveness of the proposed method.

Nupur [Univ. of Tennessee, Knoxville, TN (United S↗

Reduced-Order Modeling of Multigroup Neutron Cross Sections for High-Temperature Gas-cooled Reactors

Abstract – Deterministic neutronics calculations rely on multigroup neutron cross section libraries, which consist of databases of tabulated values, used to calculate the neutron cross sections through multivariate linear interpolation. However, interpolation of the multidimensional cross section data becomes memory inefficient and time consuming as the number of tabulations increases, significantly slowing down the neutronics calculation, especially in the case of microscopic cross section libraries where every isotope (on the order of hundreds) has its own set of specific reactions and cross sections. In order to address this challenge, this work constructs efficient and robust reduced-order models (ROMs) of the multi-group cross sections to support the Griffin simulation of high-temperature gas-cooled reactors (HTGRs). The first part of the study investigates the linearity of the multigroup cross section data across isotopes, reaction types, and energy groups on pre-generated datasets for the purpose of dimensionality reduction. Secondly, a down-selection of ROM techniques is presented on representative classical machine learning (ML) techniques, including variants of linear regression, kernel-based methods, tree-based algorithms, and artificial neural networks. The selection criteria jointly consider the memory efficiency, predictive accuracy, prediction speed, and scalability in comparison to the multidimensional interpolation. Among all the ML techniques, deep neural networks (DNNs) have proven to be the best selection with sufficient accuracy, high robustness, good memory efficiency, great scalability, and superior flexibility. DNNs have been trained for all isotopes in this work and systematic Griffin testing is ongoing to ensure the feasibility of this ROM technique for predicting cross section and reducing memory requirements without a significant sacrifice in computational performance.

42 - ENGINEERING↗

Queue wait time prediction in high performance computing (HPC) systems

High Performance Computing (HPC) systems are critical enablers for groundbreaking scientific research across various domains. Efficient resource allocation, facilitated by job scheduling, is paramount for maximizing the utilization of HPC systems. However, the variability in wait times for queued jobs poses challenges for users, necessitating accurate job wait time estimation. This paper explores the influence of job characteristics, including job size (the number of nodes requested and walltime), the queue to which the job is submitted and other resource requirements, on job wait times in leadership-class HPC systems. Focusing on the Theta Cray XC40 and Polaris machines at Argonne National Laboratory, the study evaluates the performance of different supervised learning algorithms in predicting job wait times. It also evaluates the impact of data preprocessing, including outlier detection, Principal Component Analysis (PCA), and feature selection, on the performance of wait time prediction models. The findings reveal insights into the relationship between job characteristics and wait times, offering a foundation for optimizing resource allocation and enhancing user experience. The methodologies and tools developed in this study are adaptable to other leadership-class HPC systems, providing a valuable contribution to the broader HPC community aiming to improve job scheduling efficiency and user satisfaction.

Okafor, Nwamaka↗

Kinetic Deep Learning v0.1

Here, we present a method that uses protein levels to predict times series of metabolite concentrations. Understanding this type of pathway dynamics is important in order to predict the behavior of the pathway and, more pragmatically, to be able to design biological systems (such as strains bioengineered to produce chemical products) reliably. Typically, for this purpose, kinetic models consisting of differential equations based on the Michaelis-Menten dynamics have been used in the past. However, these methods can rarely produce good fits to measured data time series. Possibly, this happens because the kinetic constants are unknown or are different from the ones measured in vivo, or perhaps because Michaelis-Menten dynamics is not a satisfactory description. In order to improve the predictive nature of these kinetic models we have eliminated the Michaelis-Menten description of pathway dynamics and we have substituted it by algorithms that automatically learn these dynamics from previously obtained metabolomics and proteomics data using machine learning approaches. Specifically, kinetic deep learning uses deep learning to map proteomics time series to metabolite concentration time series, instead of learning the first metabolite derivative and integrating in (as in the first version of kinetic learning). This approach is shown to provide good to excellent results with a data set specifically collected for this purpose.

Garcia Martin, Hector [Joint BioEnergy Institute (↗

Machine learning approaches for influenza A virus risk assessment identifies predictive correlates using ferret model in vivo data

In vivo assessments of influenza A virus (IAV) pathogenicity and transmissibility in ferrets represent a crucial component of many pandemic risk assessment rubrics, but few systematic efforts to identify which data from in vivo experimentation are most useful for predicting pathogenesis and transmission outcomes have been conducted. To this aim, we aggregated viral and molecular data from 125 contemporary IAV (H1, H2, H3, H5, H7, and H9 subtypes) evaluated in ferrets under a consistent protocol. Three overarching predictive classification outcomes (lethality, morbidity, transmissibility) were constructed using machine learning (ML) techniques, employing datasets emphasizing virological and clinical parameters from inoculated ferrets, limited to viral sequence-based information, or combining both data types. Among 11 different ML algorithms tested and assessed, gradient boosting machines and random forest algorithms yielded the highest performance, with models for lethality and transmission consistently better performing than models predicting morbidity. Comparisons of feature selection among models was performed, and highest performing models were validated with results from external risk assessment studies. Our findings show that ML algorithms can be used to summarize complex in vivo experimental work into succinct summaries that inform and enhance risk assessment criteria for pandemic preparedness that take in vivo data into account.

59 BASIC BIOLOGICAL SCIENCES↗

Benchmarking Optimizers for Qumode State Preparation with Variational Quantum Algorithms

Quantum state preparation involves preparing a target state from an initial system, a process integral to applications such as quantum machine learning and solving systems of linear equations. Recently, there has been a growing interest in qumodes due to advancements in the field and their potential applications. However there is a notable gap in the literature specifically addressing this area. This paper aims to bridge this gap by providing performance benchmarks of various optimizers used in state preparation with Variational Quantum Algorithms. We conducted extensive testing across multiple scenarios, including different target states, both ideal and sampling simulations, and varying numbers of basis gate layers. Our evaluations offer insights into the complexity of learning each type of target state and demonstrate that some optimizers perform better than others in this context. Notably, the Powell optimizer was found to be exceptionally robust against sampling errors, making it a preferred choice in scenarios prone to such inaccuracies. Additionally, the Simultaneous Perturbation Stochastic Approximation optimizer was distinguished for its efficiency and ability to handle increased parameter dimensionality effectively.

Kan, Shuwen [Fordham University]↗

SIGHT: Stacked Integration of Geospatial Hierarchical Typologies for Inferring Building Characteristics

Building characteristics are often absent in building stock datasets, particularly in regions most vulnerable to climate change and requiring effective disaster management strategies. Traditional machine learning approaches, while widely used to predict building attributes, typically neglect the spatial context of the data, leading to less accurate and reliable outcomes. To address these challenges, this paper introduces a novel algorithm, the Stacked Integration of Geospatial Hierarchical Typologies. This algorithm adapts a meta-learning framework to incorporate geospatial context into the predictive modeling process. We demonstrate the utility of the algorithm through two primary use cases: building use type classification and building height prediction. The algorithm consistently achieved or exceeded a 0.94 macro average F1 score across five geographically distinct countries for building use type classification. For building height prediction, it accurately predicted heights with a root mean square error of 3.01 in a comprehensive study using roughly 3.6 million buildings in Japan. These results underscore the benefits of integrating spatial hierarchies into machine learning models, enhancing both predictive accuracy and reliability in geospatial modeling. This work introduces a new algorithm to address the pervasive data sparsity issue in existing building stock datasets.

Adams, Daniel [ORNL] (ORCID:0000000196950577)↗