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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

SNAD transient miner: Finding missed transient events in ZTF DR4 using k-D trees

Here we report the automatic detection of 11 transients (7 possible supernovae and 4 active galactic nuclei candidates) within the Zwicky Transient Facility fourth data release (ZTF DR4), all of them observed in 2018 and absent from public catalogs. Among these, three were not part of the ZTF alert stream. Our transient mining strategy employs 41 physically motivated features extracted from both real light curves and four simulated light curve models (SN Ia, SN II, TDE, SLSN-I). These features are input to a k-D tree algorithm, from which we calculate the 15 nearest neighbors. After pre-processing and selection cuts, our dataset contained approximately a million objects among which we visually inspected the 105 closest neighbors from seven of our brightest, most well-sampled simulations, comprising 89 unique ZTF DR4 sources. Our result illustrates the potential of coherently incorporating domain knowledge and automatic learning algorithms, which is one of the guiding principles directing the SNAD team. It also demonstrates that the ZTF DR is a suitable testing ground for data mining algorithms aiming to prepare for the next generation of astronomical data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

High redshift LBGs from deep broadband imaging for future spectroscopic surveys

Lyman break galaxies (LBGs) are promising probes for clustering measurements at high redshift, z > 2, a region only covered so far by Lyman-α forest measurements. Here, in this paper, we investigate the feasibility of selecting LBGs by exploiting the existence of a strong deficit of flux shortward of the Lyman limit, due to various absorption processes along the line of sight. The target selection relies on deep imaging data from the HSC and CLAUDS surveys in the g, r, z and u bands, respectively, with median depths reaching 27 AB in all bands. The selections were validated by several dedicated spectroscopic observation campaigns with DESI. Visual inspection of spectra has enabled us to develop an automated spectroscopic typing and redshift estimation algorithm specific to LBGs. Based on these data and tools, we assess the efficiency and purity of target selections optimised for different purposes. Selections providing a wide redshift coverage retain 57% of the observed targets after spectroscopic confirmation with DESI, and provide an efficiency for LBGs of 83 ± 3%, for a purity of the selected LBG sample of 90 ± 2%. This would deliver a confirmed LBG density of ~ 620 deg$^{-2}$ in the range 2.3 < z < 3.5 for a r-band limiting magnitude r < 24.2. Selections optimised for high redshift efficiency retain 73% of the observed targets after spectroscopic confirmation, with 89 ± 4% efficiency for 97 ± 2% purity. This would provide a confirmed LBG density of ~ 470 deg$^{-2}$ in the range 2.8 < z < 3.5 for a r-band limiting magnitude r < 24.5.A preliminary study of the LBG sample 3d-clustering properties is also presented and used to estimate the LBG linear bias. A value of b$_{LBG}$ = 3.3 ± 0.2 (stat.) is obtained for a mean redshift of 2.9 and a limiting magnitude in r of 24.2, in agreement with results reported in the literature.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Improved learning from data competitions through strategic design of training and test data sets

Leveraging the depth and breadth of solutions generated through crowdsourcing can be a powerful accelerator to method development for high consequence problems. While data science competitions have become quite popular and prevalent, particularly in supervised learning formats, their implementations by the host are highly variable. Without careful planning, a supervised learning competition is vulnerable to overfitting, where the winning solutions are so closely tuned to the particular set of provided data that they cannot generalize to the general underlying problem of interest to the host. This paper outlines important considerations for strategically designing relevant and informative data sets to maximize the learning outcome from hosting a competition. These include: precisely defining the scope of the problem, encouraging participation by competitors from diverse technical backgrounds, specifying the most interesting solution space in order to encourage improvement and distinguish between competitors, strategically generating data sets that enable testing for interpolation and extrapolation to new scenarios of interest, leveraging design of experiment principles for strategic data design while preventing unintentional artifacts in the competition data set that an algorithm could exploit without addressing the real problem of interest, and carefully designing the leaderboard scoring metric to select top solutions that exactly match the overall competition goals. The methods are illustrated with a recently completed competition in the context of urban radiological search to evaluate algorithms capable of detecting, identifying, and locating radioactive materials. Simulated data were used in the urban search competition. Ideas for using measured real data in competitions are also suggested

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

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

Solving MaxCut with quantum imaginary time evolution

We introduce a method to solve the MaxCut problem efficiently based on quantum imaginary time evolution (QITE). We employ a linear Ansatz for unitary updates and an initial state involving no entanglement, as well as an imaginary-time-dependent Hamiltonian interpolating between a given graph and a subgraph with two edges excised. We apply the method to thousands of randomly selected graphs with up to fifty vertices. We show that our algorithm exhibits a 93% and above performance converging to the maximum solution of the MaxCut problem for all considered graphs. Our results compare favorably with the performance of classical algorithms, such as the greedy and Goemans–Williamson algorithms. We also discuss the overlap of the final state of the QITE algorithm with the ground state as a performance metric, which is a quantum feature not shared by other classical algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Bayesian Optimized Deep Ensemble for Uncertainty Quantification of Deep Neural Networks: a System Safety Case Study on Sodium Fast Reactor Thermal Stratification Modeling

Deep neural networks (DNNs) are increasingly important to scientific computing and engineering system simulations. Accurate uncertainty quantification (UQ) for DNNs is critical in safety-sensitive engineering domains. Traditional Deep Ensemble (DE) methods, while easy to implement, frequently suffer from poorly calibrated uncertainty estimates and limited predictive accuracy due to reliance on fixed architectures with varied weight initializations. To address these issues, we introduce a workflow that combines Bayesian Optimization (BO) and DE. The workflow is modular, scalable, and integrates parallel BO initialized with Sobol sequences to individually optimize the hyperparameters of each ensemble member. This method enhances ensemble diversity, improves predictive accuracy, and provides reliable uncertainty estimates. We evaluate the proposed BODE approach in a sodium fast reactor thermal stratification modeling case study, where we used a densely connected convolutional neural network to predict turbulent viscosity during the reactor transient with consideration of data noise. We benchmark its performance against several optimization approaches, including baseline deep ensemble, evolutionary algorithm-optimized ensemble, ensemble formed via random search combined with greedy selection, and a BO ensemble using random initialization. Here, our results demonstrate superior performance of the developed BODE approach. In noise-free scenarios, BODE notably reduces incorrect aleatoric uncertainty and significantly enhances predictive accuracy. Under conditions of 5% and 10% Gaussian noise, BODE adaptively quantifies uncertainty proportional to data noise, achieving up to an 80% reduction in root mean square error compared to baseline methods and producing well-calibrated prediction intervals.

Bayesian optimization↗
DOE OSTI2022

A lightweight, user-configurable detector ASIC digital architecture with on-chip data compression for MHz X-ray coherent diffraction imaging

Today, most X-ray pixel detectors used at light sources transmit raw pixel data off the detector ASIC. With the availability of more advanced ASIC technology nodes for scientific application, more digital functionalities from the computing domains (e.g., compression) can be integrated directly into a detector ASIC to increase data velocity. In this paper, we describe a lightweight, user-configurable detector ASIC digital architecture with on-chip compression which can be implemented in 130 nm technologies in a reasonable area on the ASIC periphery. In addition, we present a design to efficiently handle the variable data from the stream of parallel compressors. The architecture includes user-selectable lossy and lossless compression blocks. The impact of lossy compression algorithms is evaluated on simulated and experimental X-ray ptychography datasets. This architecture is a practical approach to increase pixel detector frame rates towards the continuous 1 MHz regime for not only coherent imaging techniques such as ptychography, but also for other diffraction techniques at X-ray light sources.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

First measurement of Λ c + production down to p T = 0 in p p and p -Pb collisions at s N N = 5.02 TeV

The production of prompt $Λ_{c}^{+}$ baryons has been measured at midrapidity in the transverse momentum interval 0 < p T < 1 GeV/c for the first time, in pp and p–Pb collisions at a center-of-mass energy per nucleon-nucleon collision $\sqrt{s_{NN}}$ = 5.02 TeV . The measurement was performed in the decay channel $Λ_{c}^{+}$ → p$K_{S}^{0}$ by applying new decay reconstruction techniques using a Kalman-Filter vertexing algorithm and adopting a machine-learning approach for the candidate selection. The p T -integrated $Λ_{c}^{+}$ production cross sections in both collision systems were determined and used along with the measured yields in Pb–Pb collisions to compute the p T -integrated nuclear modification factors R pPb and R AA of $Λ_{c}^{+}$ baryons, which are compared to model calculations that consider nuclear modification of the parton distribution functions. The $Λ_{c}^{+}$/D 0 baryon-to-meson yield ratio is reported for pp and p–Pb collisions. Comparisons with models that include modified hadronization processes are presented, and the implications of the results on the understanding of charm hadronization in hadronic collisions are discussed. A significant (3.7σ) modification of the mean transverse momentum of $Λ_{c}^{+}$ baryons is seen in p –Pb collisions with respect to pp collisions, while the p T -integrated $Λ_{c}^{+}$/D 0 yield ratio was found to be consistent between the two collision systems within the uncertainties.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2018

ProgLIMI: Programmable LInk Metric Identification in Software-Defined Networks

In this paper, we propose the Programmable LInk Metric Identification (ProgLIMI) infrastructure for software-defined networking (SDN) networks. ProgLIMI identifies round-trip link metrics (RTLMs) from accumulated end-to-end metrics of selected measurement paths by leveraging the flexible routing control capability of SDN networks. ProgLIMI mainly solves three sub-problems: (1) monitor placement; (2) linearly independent measurement path construction; and (3) flow rule design. To reduce measurement cost, ProgLIMI tries to minimize the number of required monitors and flow rules. In this paper, we address the three sub-problems for both full and hybrid SDN networks. For full SDN networks, ProgLIMI can achieve full RTLM identification using only one monitor and two flow rules in each SDN switch. In contrast, the RTLM identification in hybrid SDN networks is more complicated due to the routing constraint of hybrid SDN networks. We first prove that the monitor placement problem in hybrid SDN networks is NP-hard. We then formulate the monitor placement and measurement path selection problem in hybrid SDN networks and propose a greedy heuristic algorithm to solve the problem efficiently. Our evaluations on both physical testbed and simulation platform reveal that ProgLIMI can accurately identify the RTLMs (delay and loss rate). Besides, ProgLIMI is also resource efficient, i.e., it only requires two flow rules in each SDN switch and a small number of monitors, and the extra probing traffic load incurred by ProgLIMI is also low.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Comparative genetics of Enterococcus faecalis intestinal tissue isolates before and after surgery in a rat model of colon anastomosis

We have recently demonstrated that collagenolytic Enterococcus faecalis plays a key and causative role in the pathogenesis of anastomotic leak, an uncommon but potentially lethal complication characterized by disruption of the intestinal wound following segmental removal of the colon (resection) and its reconnection (anastomosis). Here we hypothesized that comparative genetic analysis of E. faecalis isolates present at the anastomotic wound site before and after surgery would shed insight into the mechanisms by which collagenolytic strains are selected for and predominate at sites of anastomotic disruption. Whole genome optical mapping of four pairs of isolates from rat colonic tissue obtained following surgical resection (herein named "pre-op" isolates) and then 6 days later from the anastomotic site (herein named "post-op" isolates) demonstrated that the isolates with higher collagenolytic activity formed a distinct cluster. In order to perform analysis at a deeper level, a single pair of E. faecalis isolates (16A pre-op and 16A post-op) was selected for whole genome sequencing and assembled using a hybrid assembly algorithm. Comparative genomics demonstrated absence of multiple gene clusters, notably a pathogenicity island in the post-op isolate. No differences were found in the fsr-gelE-sprE genes (EF1817-1822) responsible for regulation and production of collagenolytic activity. Analysis of unique genes among the 16A pre-op and post-op isolates revealed the predominance of transporter systems-related genes in the pre-op isolate and phage-related and hydrolytic enzyme-encoding genes in the post-op isolate. Despite genetic differences observed between pre-op and post-op isolates, the precise genetic determinants responsible for their differential expression of collagenolytic activity remains unknown.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Centralized and Decentralized Optimal Control of Variable Speed Heat Pumps

Utility service providers are often challenged with the synchronization of thermostatically controlled loads. Load synchronization, as a result of naturally occurring and demand-response events, has the potential to damage power distribution equipment. Because thermostatically controlled loads constitute most of the power consumed by the grid at any given time, the proper control of such devices can lead to significant energy savings and improved grid stability. The contribution of this paper is the development of an optimal control algorithm for commonly used variable speed heat pumps. By means of selective peer-to-peer communication, our control architecture allows for the regulation of home temperatures while simultaneously minimizing aggregate power consumption, and aggregate load volatility. An optimal centralized controller is also explored and compared against its decentralized counterpart.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2019

The NOvA Test Beam Program

NOvA is a two-detector long-baseline neutrino oscillation experiment which aims to make a determination of the neutrino mass hierarchy, the octant of ${\theta}_{23}$, and measure possible CP violation. The NOvA Test Beam program consists of a scaled-down NOvA detector placed in a beamline capable of delivering 0.3 - 2.0 GeV/c protons, electrons, pions, and kaons. The beamline detectors provide us with particle identification and momentum measurements so we can study our detector technology with known inputs. Studying these particles will provide us a more detailed understanding of our calibration, detector response, and energy scale, which are some of the largest sources of systematic uncertainty in NOvA analyses. We will also collect a selection of single-particle data events for training particle identification algorithms. I will present the current status of the NOvA Test Beam program and discuss plans for data taking and analysis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

FY22 Progress Report: SRNL Analysis of ICCWR LCM and WAMS Data for Corrosion and Cracking

Algorithms for machine learning and data analysis for the 3013 Surveillance Program are being developed in an ongoing collaborative effort by the Savannah River National Laboratory (SRNL) and the University of South Carolina (USC). To detect the presence of corrosion and cracking, data is collected from large binary files generated by a Laser Confocal Microscope (LCM) or Wide Area 3D Measurement System (WAMS). Software is being developed to use the physical attributes in the data files (e.g., height, color, and grayscale values; all as functions of a location in a plane projection) to detect the presence of surface corrosion and cracking. A user-friendly Matlab Graphical User Interface (GUI) that reads data from either LCM or WAMS files was developed to integrate input data with software developed for processing and evaluation. The GUI can selectively download binary data, interrogate data attributes, label data for training ML algorithms, flag significant features, execute Machine Learning (ML) algorithms, output parameters from trained ML algorithms, report ML model accuracy with respect to labeled data, and generate graphical representations for various analyses. Surface defects can be called out by setting user-specified thresholds, feature based analysis or machine learning algorithms. Enhancements to data labeling capability have been developed to address this essential precursor to application of ML routines. Efficient labeling is particularly important in view of the very large volume of data required to train ML algorithms.

3013 Corrosion↗
DOE OSTI2018

Damage Mechanism Evaluation of Large-Scale Concrete Structures Affected by Alkali-Silica Reaction Using Acoustic Emission

Alkali-silica reaction has caused damage to concrete structures, endangering structural serviceability and integrity. This is of concern in sensitive structures such as nuclear power plants. In this study, acoustic emission (AE) was employed as a structural health monitoring strategy in large-scale, reinforced concrete specimens affected by alkali-silica reaction with differing boundary conditions resembling the common conditions found in nuclear containments. An agglomerative hierarchical algorithm was utilized to classify the AE data based on energy-frequency based features. The AE signals were transferred into the frequency domain and the energies in several frequency bands were calculated and normalized to the total energy of signals. Principle component analysis was used to reduce feature redundancy. Then the selected principal components were considered as features in an input of the pattern recognition algorithm. The sensor located in the center of the confined specimen registered the largest portion of AE energy release, while in the unconfined specimen the energy is distributed more uniformly. This confirms the results of the volumetric strain, which shows that the expansion in the confined specimen is oriented along the thickness of the specimen.

36 MATERIALS SCIENCE↗
DOE OSTI2026

An Adaptive Multiparameter Penalty Selection Method for Multiconstraint and Multiblock ADMM

This work presents a new method for online selection of multiple penalty parameters for the alternating direction method of multipliers (ADMM) algorithm applied to optimization problems with multiple constraints or functions with block matrix components. ADMM is widely used for solving constrained optimization problems in a variety of fields, including signal and image processing. Implementations of ADMM often utilize a single hyperparameter, referred to as the penalty parameter, which needs to be tuned to control the rate of convergence. However, in problems with multiple constraints, ADMM may demonstrate slow convergence regardless of penalty parameter selection due to scale differences between constraints. Accounting for scale differences between constraints to improve convergence in these cases requires introducing a penalty parameter for each constraint. The proposed method is able to adaptively account for differences in scale between constraints, providing robustness with respect to problem transformations and initial selection of penalty parameters. It is also simple to understand and implement. Our numerical experiments demonstrate that the proposed method performs favorably compared to a variety of existing penalty parameter selection methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Alpha Shape Analysis (ASA) Framework for Post- Clustering Property Determination in Atom Probe Tomographic Data

While application of clustering algorithms to atom probe tomography data have enabled quantification of solute clusters in terms of number density, size, and subcomposition there exist other properties (e.g., volume, surface area, and composition) that are better determined by defining an interface between the cluster and the surrounding matrix. The limitation in composition results from an ion selection step where the expected matrix ion types are omitted from the cluster search algorithm to enhance the contrast between the matrix and cluster and to reduce the complexity of the search. Previously, composition determination within solute clusters has utilized a secondary envelopment and erosion step on top of conventional methods such as maximum separation. In this work, we present a novel stochastic method that combines the particle identification fidelity of a conventional clustering algorithm with the analytical flexibility of mesh-based approaches through the generation of alpha shapes for each identified cluster. Furthermore, the corresponding mesh accounts for concave components of the clusters and determines the volume and surface area of the clusters; additionally, the mesh boundary is utilized to update the total composition according to the internal ions.

42 ENGINEERING↗
DOE OSTI2026

Machine Learning–Augmented Laser-Induced Breakdown Spectroscopy for Spectral Discrimination of Iron Oxalates

Enhanced characterization and phase identification of post-PUREX Pu Oxalates (PuOXA) are pivotal for nonproliferation and pre-detonation nuclear forensics. Despite significant advances in the characterization of PuO 2 samples, little is known about the impact of both the chemical structure and oxidation states of PuOXA (i.e., Pu(III) and Pu(IV)) have on optical emission signatures. Here, we demonstrate the analytical capabilities of laser-induced breakdown spectroscopy (LIBS) applied to Fe(II) and Fe(III) oxalate samples as surrogates for PuOXA, highlighting the discriminating features in the LIBS emission spectra arising from differences in the oxidation states within mixed FeOXA samples. We report the enhancement of spectral feature selection using Principal Component Analysis (PCA), which enables the analytical superiority of machine learning algorithms such as Linear Discriminant Analysis (LDA), Quadratic Discriminant Analysis (QDA), Partial Least Squares Regression (PLSR), Support Vector Regression (SVR), and Random Forest Regression (RFR) over conventional univariate techniques for phase discrimination and chemometric analysis. Cluster analysis revealed how both matrix effects and laser ablation influence cluster separability by introducing spectral artifacts that misdirect the maximization of variance. PCA-selected emission lines were used in the regression models, demonstrating that both univariate and multivariate linear regression models (i.e., PLSR and SVR) can achieve acceptable performance, with machine learning models outperforming conventional calibration regressions. Furthermore, the application of non-linearly activated PCA-selected emission lines illustrates how simplifying the data while retaining captured variance enables the use of less complex and more computationally efficient models. Furthermore, this is particularly evident in the underperformance of RFR, which suffers from increased computational costs and overfitting owing to its high complexity.

Oxalates↗
DOE OSTI2025

MetaHeuristic Feature Selection for Energy Group Optimization and Analysis

Energy discretization is a crucial component of deterministic neutron transport simulations. Metaheuristic (MH) optimizers are effective algorithms to determine group structures that maximize both solution accuracy and computational efficiency. This project establishes a framework for optimizing group structures for PARTISN simulations using the Python library MEALPY. Group structure optimization is formulated as a binary feature selection problem, and results are investigated with permutation and material importance techniques to determine physically relevant energy bounds. We conclude that MH optimizers find group structures that drastically improve flux calculations while preserving k-effective accuracy. Further, we find that individual energy bounds are not necessarily physically relevant, but rather specific energy ranges are.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗