Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm selection”

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 937 records · Page 52

Machine learning-guided design, synthesis, and characterization of atomically dispersed electrocatalysts

The recent integration of machine learning into materials design has revolutionized the understanding of structure–property relationships and optimization of material properties beyond the trial-and-error paradigm. On one hand, machine learning has significantly accelerated the development of atomically dispersed metal-nitrogen-carbon (M-N-C) electrocatalysts, which traditionally heavily relied on heuristic approaches. On the other hand, the primary challenge of leveraging machine learning to expedite M-N-C materials discovery lies in the cost associated with data collection. Here, we review recent machine learning integration strategies for M-N-C catalyst development, including discussions on the typical algorithms such as symbolic regression and convolutional neural networks employed for the theoretical design, synthesis optimization via active learning, and advanced microscopy characterization. Subsequently, we provide our perspective on potential near-future directions for furthering machine learning-assisted development of new M-N-C catalysts and elucidating the complex physicochemical mechanisms governing the selectivity, activity, and durability in this class of materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Discovery of peculiar radio morphologies with ASKAP using unsupervised machine learning

Abstract We present a set of peculiar radio sources detected using an unsupervised machine learning method. We use data from the Australian Square Kilometre Array Pathfinder (ASKAP) telescope to train a self-organizing map (SOM). The radio maps from three ASKAP surveys, Evolutionary Map of Universe pilot survey (EMU-PS), Deep Investigation of Neutral Gas Origins pilot survey (DINGO), and Survey With ASKAP of GAMA-09 + X-ray (SWAG-X), are used to search for the rarest or unknown radio morphologies. We use an extension of the SOM algorithm that implements rotation and flipping invariance on astronomical sources. The SOM is trained using the images of all ‘complex’ radio sources in the EMU-PS which we define as all sources catalogued as ‘multi-component’. The trained SOM is then used to estimate a similarity score for complex sources in all surveys. We select 0.5% of the sources that are most complex according to the similarity metric and visually examine them to find the rarest radio morphologies. Among these, we find two new odd radio circle (ORC) candidates and five other peculiar morphologies. We discuss multiwavelength properties and the optical/infrared counterparts of selected peculiar sources. In addition, we present examples of conventional radio morphologies including: diffuse emission from galaxy clusters, and resolved, bent-tailed, and FR-I and FR-II type radio galaxies. We discuss the overdense environment that may be the reason behind the circular shape of ORC candidates.

Astronomy & Astrophysics↗

Semi-analytical covariance matrices for two-point correlation function for DESI 2024 data

We present an optimized way of producing the fast semi-analytical covariance matrices for the Legendre moments of the two-point correlation function, taking into account survey geometry and mimicking the non-Gaussian effects. We validate the approach on simulated (mock) catalogs for different galaxy types, representative of the Dark Energy Spectroscopic Instrument (DESI) Data Release 1, used in 2024 analyses. We find only a few percent differences between the mock sample covariance matrix and our results, which can be expected given the approximate nature of the mocks, although we do identify discrepancies between the shot-noise properties of the DESI fiber assignment algorithm and the faster approximation (emulator) used in the mocks. Importantly, we find a close agreement (≤ 8% relative differences) in the projected errorbars for distance scale parameters for the baryon acoustic oscillation measurements. This confirms our method as an attractive alternative to simulation-based covariance matrices, especially for non-standard models or galaxy sample selections, making it particularly relevant to the broad current and future analyses of DESI data.

79 ASTRONOMY AND ASTROPHYSICS↗

HBMax: Optimizing Memory Efficiency for Parallel Influence Maximization on Multicore Architectures

The goal of influence maximization is to select k most-influential vertices or seeds in a network, where influence is defined by a given diffusion process. The problem has a number of important applications such as viral marketing, information spread, and epidemic control. Although computing optimal seed set is NP-Hard, due to the submodular nature of the problem efficient approximation algorithms exist. However, even state-of-the-art parallel implementations are limited by a sampling step that incurs large memory footprints. This in turn limits the problem size reach and approximation quality. In this work, we study the memory footprint of the sampling process collecting reverse reachability information in the IMM algorithm over large real-world social networks. We present an adaptive and memory-efficient optimization approach for a state-of-the-art multi-threaded parallel influence maximization algorithm. Our approach,HuffMax, uses a portion of the reverse reachable (RR) sets collected by the algorithm to learn the characteristics of the graph. Then, it compresses the intermediate reverse reachability information with Huffman coding, and queries directly on the compressed data to preserve the memory savings obtained through compression. We also propose an efficient sampling strategy based on the distribution of RR sets, which can further reduce the computation time for typical social networks with long-tail distributions. Considering a NUMA architecture, we scale up our solution on 128-core CPUs and reduce the memory footprint by up to 45.7% with negligible time overhead (or even faster) and without perceivable loss of accuracy.

Chen, Xinyu↗

Primordial non-Gaussianity from the completed SDSS-IV extended Baryon Oscillation Spectroscopic Survey – I: Catalogue preparation and systematic mitigation

ABSTRACT We investigate the large-scale clustering of the final spectroscopic sample of quasars from the recently completed extended Baryon Oscillation Spectroscopic Survey (eBOSS). The sample contains 343 708 objects in the redshift range 0.8 < z < 2.2 and 72 667 objects with redshifts 2.2 < z < 3.5, covering an effective area of $4699\, {\rm deg}^{2}$. We develop a neural network-based approach to mitigate spurious fluctuations in the density field caused by spatial variations in the quality of the imaging data used to select targets for follow-up spectroscopy. Simulations are used with the same angular and radial distributions as the real data to estimate covariance matrices, perform error analyses, and assess residual systematic uncertainties. We measure the mean density contrast and cross-correlations of the eBOSS quasars against maps of potential sources of imaging systematics to address algorithm effectiveness, finding that the neural network-based approach outperforms standard linear regression. Stellar density is one of the most important sources of spurious fluctuations, and a new template constructed using data from the Gaia spacecraft provides the best match to the observed quasar clustering. The end-product from this work is a new value-added quasar catalogue with the improved weights to correct for non-linear imaging systematic effects, which will be made public. Our quasar catalogue is used to measure the local-type primordial non-Gaussianity in a companion paper.

79 ASTRONOMY AND ASTROPHYSICS↗

Application of Multivariate Data Analysis Techniques for the Portable Isotopic Neutron Spectroscopy system

The Portable Isotopic Neutron Spectroscopy (PINS) is a commercialized system developed by Idaho National Laboratory (INL) to examine chemical compounds non-destructively, utilizing Prompt Gamma Neutron Activation Analysis (PGNAA) techniques. The PINS systems have been successfully deployed around the world to identify chemical munitions and containers. The PINS system takes advantage of a high-resolution gamma-ray spectrum from a high-purity germanium (HPGe) detector, and gamma-ray peak analysis provides input to its chemical identification logic with the probabilistic decision tree (PDT). Gamma-ray peak analyses, however, require knowledge of pre-selected gamma-ray peaks whose energies, intensities, and origins are well studied, and some peaks might be excluded from the decision making processes due to lack of current nuclear data. In contrast, Multivariate Analysis (MVA) treats a whole gamma-ray spectrum as a collection of multiple variables or a pattern. The effectiveness of chemical identification algorithm is determined by the availability of a wide range of data to train an algorithm to identify chemical fills with accuracy. INL has a collection of gamma-ray spectra of various chemical-fills from the field-deployed PINS systems over the years, and it was envisaged to combine such a database with the principle of multivariate statistics. Therefore, in parallel with the current decision tree algorithm, an MVA-based chemical identification algorithm was developed as an independent verification of the current results. The Principal Component Analysis (PCA) method was adopted to build an MVA-based identification algorithm, using the collected field data to refine and validate the algorithm. A benchmarking study of the MVA-based algorithm’s performance was conducted alongside the current algorithm, with the results presented and discussed in this study.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Selective Information Extraction Strategies for Cancer Pathology Reports with Convolutional Neural Networks

To trust model predictions, it is important to ensure new data scored by the model comes from the same population used for model training. If the model is used to score new data different than the model’s training data, then predictions and model performance metrics cannot be trusted. Identifying and excluding these anomalous data points is an important task when using models in the real world. Traditional machine learning algorithms and classifiers don’t have the capability to abstain in this case. Here we propose a data-novelty detection algorithm for the Convolutional Neural Network classifier, yielding a rejection score for each new data point scored. It is a post-modeling procedure which examines the distribution of convolution filters to determine if the prediction should be trusted. We apply this algorithm to an information extraction model for a natural language text corpus. We evaluated the algorithm performance using a primary cancer site classification model applied to cancer pathology reports. Results demonstrate that the algorithm is an effective way to exclude cancer pathology reports from model scoring when they do not contain the expected information necessary to accurately classify the primary cancer type.

Yoon, Hong-Jun↗

Heat transfer optimization of uo 2 -mo fuel using genetic algorithms

Two genetic algorithm (GA) methods were applied to thermal finite element models to optimize the heat transfer efficacy of a UO 2 -Mo composite fuel pellet with typical pressurized water reactor fuel geometry. Mo additions to UO 2 have been shown to increase the thermal conductivity, thus reducing centerline temperatures and temperature gradients. Previous studies evaluated uniformly dispersed Mo or continuous Mo internal geometries (e.g., fins, plates, discs) that were selected using engineering intuition. The current study uses two different implementations of the same GA to optimize Mo placement and minimize the fuel temperature with the only constraint being a maximum 10% Mo volume fraction. One approach superimposed Mo line elements onto the monolithic UO 2 pellet model, and the other converted entire UO 2 volume elements to Mo. The former method generated 1D heat transfer connections between nodes, whereas the latter method allowed for the formation of 3D structures. Features of the optimal fuel design produced by the GAs included dispersed Mo near the centerline that shifted the peak fuel temperature outward by 0.6 mm, Mo chains in the high-heat-flux region in the mid-to-outer radial zone, and a large continuous structure that spanned the full radius and height of the pellet and accounted for 87.7 % of the total Mo in the pellet. Analysis of this design indicates that the optimal Mo configuration is a balance between creating continuous heat transfer pathways and optimally dispersing Mo to minimize the heat transfer distance through UO 2 . This architecture ultimately produced an effective thermal conductivity of 11.3 W/m·K under the assumed boundary conditions. This result is higher than any previous values from the literature. In conclusion, potential fabrication methods and challenges are discussed in addition to the implications on fuel performance.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Ground state property calculations of LiH n complexes using IBM Qiskit’s quantum simulator

In this study, the variational quantum eigensolver (VQE) on a quantum simulator is used in calculating ground state electronic structure properties of the LiH n , n = 1–3, complexes including their singly charged ions. Results calculated using classical electronic structure algorithms are also included. We investigate the use of the unitary coupled cluster with singles and doubles (UCCSD) Ansatz using VQE within Qiskit and compare results to full configuration interaction (FCI) calculations. Computed ground state energies, electron affinities, ionization potentials, and dipole moments are considered. We report the first-of-its-kind simulated quantum computing results of selected LiH n species and use the parity orbital to qubit mapping scheme. We find that VQE/UCCSD results are comparable to classical coupled clusters with singles and doubles for all considered systems with respect to FCI. A VQE calculation cost evaluation is included in which we evaluate performance using both Jordan–Wigner and parity orbital to qubit mapping schemes. We also discuss some of the current limitations of utilizing VQE for the study of chemical systems.

97 MATHEMATICS AND COMPUTING↗

Dark Energy Survey Year 3 results: galaxy sample for BAO measurement

Here, we present and validate the galaxy sample used for the analysis of the baryon acoustic oscillation (BAO) signal in the Dark Energy Survey (DES) Y3 data. The definition is based on a colour and redshift-dependent magnitude cut optimized to select galaxies at redshifts higher than 0.5, while ensuring a high-quality determination. The sample covers ~ 4100 square degrees to a depth of i = 22.3 (AB) at 10σ. It contains 7,031,993 galaxies in the redshift range from z = 0.6 to 1.1, with a mean effective redshift of 0.835. Redshifts are estimated with the machine learning algorithm DNF, and are validated using the VIPERS PDR2 sample. We find a mean redshift bias of z bias ~ 0.01 and a mean uncertainty, in units of 1 + z, of σ 68 ~ 0.03$. We evaluate the galaxy population of the sample, showing it is mostly built upon Elliptical to Sbc types. Furthermore, we find a low level of stellar contamination of ≲ 4 %. We present the method used to mitigate the effect of spurious clustering coming from observing conditions and other large-scale systematics. We apply it to the BAO sample and calculate weights that are used to get a robust estimate of the galaxy clustering signal. This paper is one of a series dedicated to the analysis of the BAO signal in DES Y3. In the companion papers, we present the galaxy mock catalogues used to calibrate the analysis and the angular diameter distance constraints obtained through the fitting to the BAO scale.

79 ASTRONOMY AND ASTROPHYSICS↗

LEMD

Deep neural network-based force field enables researchers to study materials systems of large size and/or time scale efficiently with comparable accuracy to DFT-based methods. However, such force fields, if improperly trained or mistakenly selected, could result in ill-conditioned results. This SBIR Phase I project has explored the possibility to characterize and index force fields in Deep potential theme by quantizing local atomic environments of atoms in a simulation system. This project has also demonstrated the feasibility of building a public accessible web infrastructure providing high quality machine learning algorithm-based force field for next generation materials modeling and simulation to accelerate the study and discovery of new energy-related materials.

Su, Ninghai↗

Selecting 1D projections for 2D tomography reconstruction

Previous works on reconstructing the 4D phase space using tomography require optimal selection of projection views to achieve accurate reconstruction. In 2D reconstruction, the process is straightforward, as an object can be evenly sampled by dividing the angles evenly. However, extending this concept from 2D to 4D is not intuitive. This work demonstrates that quaternions can be used to more effectively describe views in 4D and introduces the Fibonacci Flower algorithm and repulsive force algorithm to evenly space views in 4D space in order to achieve higher reconstruction accuracy.

Accelerator Physics↗

Network reconfiguration and distributed energy resource scheduling for improved distribution system resilience

Electric utility companies work to restore as much load as possible after power outages caused by extreme weather events. In this paper, an outage management strategy is proposed to enhance distribution system resilience through network reconfiguration and distributed energy resources (DERs) scheduling. After a line fault, the proposed algorithm can identify radial network topology based on the rank of the incidence matrix. The reconfiguration is implemented by switching tie lines and sectionalizing lines. With the new network topology, an optimal DER scheduling problem is solved to minimize the accumulative cost for dispatchable DER operation and load reduction. Finally, the optimal topology that minimizes the accumulative cost is selected from all radial topologies. The computational workload is relatively low because only linear programming needs to be solved. Using the case studies of the IEEE 69-bus and IEEE 123-bus systems, we consider the worst-case scenarios in which faults occur in the upstream feeder. The simulation results demonstrate that the proposed strategy allows for a relatively high percentage of the load to remain in service after line faults. Furthermore, compared with microgrid-formation approaches, the proposed strategy has advantages when applied to the distribution systems with several normally-open tie lines and low DER penetration.

42 ENGINEERING↗

Off-Stoichiometric Restructuring and Sliding Dynamics of Hexagonal Boron Nitride Edges in Conditions of Oxidative Dehydrogenation of Propane

Boron-containing materials, such as hexagonal boron nitride (h-BN), recently shown to be active and selective catalysts for the oxidative dehydrogenation of propane (ODHP), have been shown to undergo significant surface oxyfunctionalization and restructuring. Although experimental ex situ studies have probed the change in chemical environment on the surface, the structural evolution of it under varying reaction conditions has not been established. Herein, we perform global optimization structure search with a grand canonical genetic algorithm to explore the chemical space of off-stoichiometric restructuring of the h-BN surface under ambient as well as ODHP-relevant conditions. A grand canonical ensemble representation of the surface is established, and the predicted 11B solid-state NMR spectra are consistent with previous experimental reports. In addition, we investigated the relative sliding of h-BN sheets and how it influences the surface chemistry with ab initio molecular dynamics simulations. Furthermore, the B–O linkages on the edges are found to be significantly strained during the sliding, causing the metastable sliding configurations to have higher reactivity toward the activation of propane and water.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Verification and validation of developed short-term forecasting models

Recent advancements in machine learning (ML) and artificial intelligence (AI) technologies provide an opportunity for leveraging data-driven algorithms to predict future nuclear power plant (NPP) operating conditions by using recorded plant process data. Successfully implementing these models can lead to cost-reducing, conditioned-based predictive maintenance through optimized maintenance schedules and a reduction of unnecessary maintenance activities. This report discusses the verification and validation of short-term forecasting processes (i.e., data cleaning, feature selection, model optimization, and forecasting) developed in previous reports. The verification and validation (V&V) process demonstrates the expected precision and accuracy when the ML model encounters new datasets from different systems. Shapley additive explanations were used as the primary means of feature selection across these different data set. Individual models were trained for each data set, then validated through a cross-validation procedure. In this report, two different ML models were tasked to predict variables from three different plant process data sets with varying prediction horizons. The results indicate that support vector regression (SVR) outperformed long short-term memory (LSTM) neural networks in regard to each data set and each prediction horizon in this study, but further tuning and optimization could improve long short-term memory results. However, each forecasting model showed reduced performance as the prediction horizon was extended from 1 hour to 1 day ahead. Research is ongoing to evaluate the optimal input variable space, which is based on a given set of process parameters, to further improve forecasting accuracy.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A priori analysis on deep learning of subgrid-scale parameterizations for Kraichnan turbulence

In the present study, we investigate different data-driven parameterizations for large eddy simulation of two-dimensional turbulence in the a priori settings. These models utilize resolved flow field variables on the coarser grid to estimate the subgrid-scale stresses. We use data-driven closure models based on localized learning that employs a multilayer feedforward artificial neural network with point-to-point mapping and neighboring stencil data mapping, and convolutional neural network fed by data snapshots of the whole domain. The performance of these data-driven closure models is measured through a probability density function and is compared with the dynamic Smagorinksy model (DSM). The quantitative performance is evaluated using the cross-correlation coefficient between the true and predicted stresses. We analyze different frameworks in terms of the amount of training data, selection of input and output features, their characteristics in modeling with accuracy, and training and deployment computational time. We also demonstrate computational gain that can be achieved using the intelligent eddy viscosity model that learns eddy viscosity computed by the DSM instead of subgrid-scale stresses. Here, we detail the hyperparameters optimization of these models using the grid search algorithm.

42 ENGINEERING↗

Impact of graph structures for QAOA on MaxCut

The quantum approximate optimization algorithm (QAOA) is a promising method of solving combinatorial optimization problems using quantum computing. QAOA on the MaxCut problem has been studied extensively on graphs with specific structure; however, little is known about the general performance of the algorithm on arbitrary graphs. Here, we investigate how different graph characteristics correlate with QAOA performance at depths at most three on the MaxCut problem for all connected non-isomorphic graphs with at most eight vertices. Some good predictors of QAOA success relate to graph symmetries, odd cycles, and density. For example, on eight vertex graphs, the average probability for selecting an optimal solution for graphs that contain no odd cycles after three iterations of QAOA is 60.6% compared to 48.2% for those that do. The data generated from these studies are shared in a publicly accessible database to serve as a benchmark for QAOA calculations and experiments. Knowing the relationship between structure and performance can be used to identify classes of combinatorial problems that are likely to exhibit a quantum advantage.

97 MATHEMATICS AND COMPUTING↗

State-of-the-art on research and applications of machine learning in the building life cycle

Fueled by big data, powerful and affordable computing resources, and advanced algorithms, machine learning has been explored and applied to buildings research for the past decades and has demonstrated its potential to enhance building performance. This study systematically surveyed how machine learning has been applied at different stages of building life cycle. By conducting a literature search on the Web of Knowledge platform, we found 9579 papers in this field and selected 153 papers for an in-depth review. The number of published papers is increasing year by year, with a focus on building design, operation, and control. However, no study was found using machine learning in building commissioning. There are successful pilot studies on fault detection and diagnosis of HVAC equipment and systems, load prediction, energy baseline estimate, load shape clustering, occupancy prediction, and learning occupant behaviors and energy use patterns. None of the existing studies were adopted broadly by the building industry, due to common challenges including (1) lack of large scale labeled data to train and validate the model, (2) lack of model transferability, which limits a model trained with one data-rich building to be used in another building with limited data, (3) lack of strong justification of costs and benefits of deploying machine learning, and (4) the performance might not be reliable and robust for the stated goals, as the method might work for some buildings but could not be generalized to others. Finally, findings from the study can inform future machine learning research to improve occupant comfort, energy efficiency, demand flexibility, and resilience of buildings, as well as to inspire young researchers in the field to explore multidisciplinary approaches that integrate building science, computing science, data science, and social science.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗