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 1,261 records · Page 70
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

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↗
DOE OSTI2022

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↗
DOE OSTI2025

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↗
DOE OSTI2017

Lowering the CUORE energy threshold

The Cryogenic Underground Observatory for Rare Events (CUORE) is a ton-scale double beta decay experiment based on TeO2 cryogenic bolometers and is currently in the last construction stage at the Gran Sasso National Laboratory (LNGS). Its primary goal is to observe neutrino-less double beta decay of 130Te, however thanks to the ultra-low background and large projected exposure it could also be suitable for other rare event searches, as the detection of solar axions, neutrinos from type II supernovae or direct detection of dark matter. The sensitivity for these searches will depend on the performance achieved at the low energy threshold. For this reason a trigger algorithm based on continuous data filtering has been developed which will allow lowering the threshold down to the few keV region. The new trigger has been tested in CUORE-0, a single-tower CUORE prototype consisting of 52 TeO2 bolometers and recently concluded, and here we present the results in terms of trigger efficiency, data selection and low-energy calibration.

Copello, S↗
DOE OSTI2016

Poster – 02: Positron Emission Tomography (PET) Imaging Reconstruction using higher order Scattered Photon Coincidences

PET images are affected by the presence of scattered photons. Incorrect scatter-correction may cause artifacts, particularly in 3D PET systems. Current scatter reconstruction methods do not distinguish between single and higher order scattered photons. A dual-scattered reconstruction method (GDS-MLEM) that is independent of the number of Compton scattering interactions and less sensitive to the need for high energy resolution detectors, is proposed. To avoid overcorrecting for scattered coincidences, the attenuation coefficient was calculated by integrating the differential Klein-Nishina cross-section over a restricted energy range, accounting only for scattered photons that were not detected. The optimum image can be selected by choosing an energy threshold which is the upper energy limit for the calculation of the cross-section and the lower limit for scattered photons in the reconstruction. Data was simulated using the GATE platform. 500,000 multiple scattered photon coincidences with perfect energy resolution were reconstructed using various methods. The GDS-MLEM algorithm had the highest confidence (98%) in locating the annihilation position and was capable of reconstructing the two largest hot regions. 100,000 photon coincidences, with a scatter fraction of 40%, were used to test the energy resolution dependence of different algorithms. With a 350–650 keV energy window and the restricted attenuation correction model, the GDS-MLEM algorithm was able to improve contrast recovery and reduce the noise by 7.56%–13.24% and 12.4%–24.03%, respectively. This approach is less sensitive to the energy resolution and shows promise if detector energy resolutions of 12% can be achieved.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

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↗
DOE OSTI2017

A single-stage flux-corrected transport algorithm for high-order finite-volume methods

We present a new limiter method for solving the advection equation using a high-order, finite-volume discretization. The limiter is based on the flux-corrected transport algorithm. Here, we modify the classical algorithm by introducing a new computation for solution bounds at smooth extrema, as well as improving the preconstraint on the high-order fluxes. We compute the high-order fluxes via a method-of-lines approach with fourth-order Runge-Kutta as the time integrator. For computing low-order fluxes, we select the corner-transport upwind method due to its improved stability over donor-cell upwind. Several spatial differencing schemes are investigated for the high-order flux computation, including centered- difference and upwind schemes. We show that the upwind schemes perform well on account of the dissipation of high-wavenumber components. The new limiter method retains high-order accuracy for smooth solutions and accurately captures fronts in discontinuous solutions. Further, we need only apply the limiter once per complete time step.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Free Energy Landscapes of Membrane Transport Proteins

Molecular dynamics (MD) is now a widespread tool for investigating biochemical and biomolecular systems, its prevalence, in no small part, being due to significant advances in computational hardware over the last few decades. Even non-experts can now routinely use MD for protein and nucleic acid structure refinement, studying conformational switching events, and investigating solvation effects due to ligand/drug binding. Nonetheless, the vast majority of simulations being done today utilize only rudimentary algorithmic approaches – so-called “brute force” MD – which only permit access to a small fraction of what the approach has to offer. This is largely because the core algorithm is simple, while advanced techniques can require everything from more sophisticated models and data structures to complicated on-the-fly analysis. A core goal of this early science project is to bring one such advanced MD approach into the broader arena of high-performance computing.In particular, the powerful method of constant-pH MD has long been a relegated to experienced users and specialized model systems. In this work we develop and implement a constant-pH MD algorithm in the NAMD simulation engine making it suitable for deployment on large-scale, next-generation supercomputers as well as ambitious, cutting-edge biological applications. We report,for the first time, constant-pH simulations of a membrane transport protein and use the results to analyze its free energy landscape for ion-selectivity.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Ab Initio Thermodynamics and Kinetics for Coalescence of Two-Dimensional Nanoislands and Nanopits on Metal (100) Surfaces

Postdeposition coalescence or sintering of pairs of lowstrain two-dimensional nanoislands and nanopits on unreconstructed metal (100) surfaces is typically mediated by diffusion along step edges, and is highly sensitive to the associated kinetics. Thus, for selected systems, we provide an ab initio density functional theory (DFT) level description of both system thermodynamics and kinetics. Specifically, we assess lateral pair and trio interactions both conventionally with adatoms at 4-fold hollow adsorption sites, and unconventionally with one adatom at the bridge-site transition state for hopping. Rather than use standard cluster expansion algorithms, these interactions are determined subject to the constraint that key step-edge properties are recovered exactly. Together, both classes of interactions determine barriers for edge diffusion processes for any local step configuration, including diffusion along close-packed $\langle$110$\rangle$ edges, kink rounding, meandering processes at kinked $\langle$100$\rangle$ steps, and extraction processes at pit corners. Our formalism applies for homoepitaxial systems, and also for several lattice-matched heteroepitaxial systems. The barriers provide input for stochastic models of nanocluster evolution, which are analyzed by kinetic Monte Carlo simulation. Such modeling with DFT energetics from the PBEsol functional recovers extensive experimental observations of both the time scale and the island-size dependence for sintering of Ag islands on Ag(100). In conclusion, description of pit sintering on Ag(100) is more delicate, being sensitive to specific unconventional trio interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

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↗
DOE OSTI2018

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 ↗
DOE OSTI2015

First neutrino interactions observed with the MicroBooNE Liquid-Argon TPC detector

The MicroBooNE liquid-argon TPC detector started to take its first neutrino data from the Booster Neutrino Beam at the Fermi National Accelerator Laboratory on October 17, 2015. We have performed fullyautomated 3D reconstruction on these first data events using algorithms we have developed for the LArSoft software package, and we have developed a filter to distinguish neutrino interaction candidate events from the large number of events that contain activity originating mostly from cosmic rays. This is the first-time events from a large liquid argon TPC operating on/near the surface have been automatically reconstructed and selected for analysis. We describe the reconstruction and automated filtering procedure, and show displays of some of the first neutrino interactions observed with the detector using 1.86 × 10 18 protons on target.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2019

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↗
DOE OSTI2016

WE-DE-201-04: Cross Validation of Knowledge-Based Treatment Planning for Prostate LDR Brachytherapy Using Principle Component Analysis

Purpose: To validate a knowledge-based algorithm for prostate LDR brachytherapy treatment planning. Methods: A dataset of 100 cases was compiled from an active prostate seed implant service. Cases were randomized into 10 subsets. For each subset, the 90 remaining library cases were registered to a common reference frame and then characterized on a point by point basis using principle component analysis (PCA). Each test case was converted to PCA vectors using the same process and compared with each library case using a Mahalanobis distance to evaluate similarity. Rank order PCA scores were used to select the best-matched library case. The seed arrangement was extracted from the best-matched case and used as a starting point for planning the test case. Any subsequent modifications were recorded that required input from a treatment planner to achieve V100>95%, V150<60%, V200<20%. To simulate operating-room planning constraints, seed activity was held constant, and the seed count could not increase. Results: The computational time required to register test-case contours and evaluate PCA similarity across the library was 10s. Preliminary analysis of 2 subsets shows that 9 of 20 test cases did not require any seed modifications to obtain an acceptable plan. Five test cases required fewer than 10 seed modifications or a grid shift. Another 5 test cases required approximately 20 seed modifications. An acceptable plan was not achieved for 1 outlier, which was substantially larger than its best match. Modifications took between 5s and 6min. Conclusion: A knowledge-based treatment planning algorithm for prostate LDR brachytherapy is being cross validated using 100 prior cases. Preliminary results suggest that for this size library, acceptable plans can be achieved without planner input in about half of the cases while varying amounts of planner input are needed in remaining cases. Computational time and planning time are compatible with clinical practice.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

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↗
DOE OSTI2016

A refined methodology for stress inversions of earthquake focal mechanisms: Refined Stress Inversion Methodology

We develop an improved methodology for reliable high-resolution inversions of focal mechanisms to background stress field orientation and stress ratio R in two or three dimensions. The earthquake catalog is declustered to remove events likely affected strongly by local stress interactions rather than reflecting the large-scale background stress field. The declustered data are discretized with the k-means algorithm into groups containing a number of focal mechanisms between a minimum number N min and 2N min . Synthetic tests indicate that N min ≈ 30 provides stable inversion results under different stress regimes and noise conditions when R ≈ 0.5, while N min ≈ 45 is needed for R near 0 or 1. Additional synthetic tests compare the performance of selecting the fault plane of each focal mechanism using (a) the plane with lowest misfit angle between the slip vector from the focal mechanism and shear traction from the stress tensor and (b) the plane with highest instability coefficient representing proximity to the optimally oriented fault for given stress field and friction coefficient. The instability criterion is found to provide more accurate inversion results under all tested stress regimes, stress ratios, and noise conditions. The refined inversion methodology combines selecting fault planes using the instability criterion iteratively with a damped simultaneous inversion of different focal mechanism groups. Results characterizing neighborhoods of discretized domains merged during the damped inversion provide high-resolution information independent of the discretization. Some aspects of the methodology are illustrated with focal mechanism data from the San Jacinto Fault Zone in Southern California.

58 GEOSCIENCES↗
DOE OSTI2016

Limited‐memory adaptive snapshot selection for proper orthogonal decomposition

Summary Reduced order models are useful for accelerating simulations in many‐query contexts, such as optimization, uncertainty quantification, and sensitivity analysis. However, offline training of reduced order models (ROMs) can have prohibitively expensive memory and floating‐point operation costs in high‐performance computing applications, where memory per core is limited. To overcome this limitation for proper orthogonal decomposition, we propose a novel adaptive selection method for snapshots in time that limits offline training costs by selecting snapshots according an error control mechanism similar to that found in adaptive time‐stepping ordinary differential equation solvers. The error estimator used in this work is related to theory bounding the approximation error in time of proper orthogonal decomposition‐based ROMs, and memory usage is minimized by computing the singular value decomposition using a single‐pass incremental algorithm. Results for a viscous Burgers' test problem demonstrate convergence in the limit as the algorithm error tolerances go to zero; in this limit, the full‐order model is recovered to within discretization error. A parallel version of the resulting method can be used on supercomputers to generate proper orthogonal decomposition‐based ROMs, or as a subroutine within hyperreduction algorithms that require taking snapshots in time, or within greedy algorithms for sampling parameter space. Copyright © 2016 John Wiley & Sons, Ltd.

Oxberry, Geoffrey M.↗
DOE OSTI2024

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↗