Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling algorithm”

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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Coincidence anomaly detection for unsupervised locating of edge localized modes in the DIII-D tokamak dataset

Using supervised learning to train a machine learning model to predict an on-coming edge localized mode (ELM) requires a large number of labeled samples. Creating an appropriate data set from the very large database of discharges at a long-running tokamak, such as DIII-D, would be a very time-consuming process for a human. Considering this need and difficulty, we use coincidence anomaly detection, an unsupervised learning technique, to train an ELM-identifier to identify and label ELMs in the DIII-D discharge database. This ELM-identifier shows, simultaneously, a precision of 0.68 and a recall of 0.63 (AUC is 0.73) on identifying ELMs in example time series pulled from thousands of discharges spanning five years. In a test set of 50 discharges, the algorithm finds over 26 thousand ELM candidates, more than 5 times the existing catalog of ELMs labeled by humans.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

Low-mass Active Galaxies in the SAMI Galaxy Survey with Spatially Resolved Spectroscopy

The smallest supermassive black holes (BHs), which provide constraints on BH seeds, reside in low-mass galaxies. Here, we present a systematic analysis of 990 low-mass galaxies in the SAMI Galaxy Survey to identify emission from accreting BHs using integral field spectroscopy (IFS). Employing a novel automated scoring algorithm based on spatially resolved narrow emission-line diagnostics, we find signatures of active galactic nuclei (AGNs) in 41 galaxies, as well as an additional 46 (less secure) candidates. The galaxies have stellar masses between 10 9.4 ≲ M ⋆ /M ⊙ ≲ 10 10 (down to 10 8.5 , including less secure candidates), redshifts z ≲ 0.06, and morphologies ranging from early-type ellipticals to late-type spirals. Our AGN fraction of 4% (9% if we include the less secure candidates) is significantly higher than those reported by studies using single-fiber spectroscopy (≲1%–2%). Indeed, our additional analysis of single-fiber spectra of the objects in our sample demonstrates that many of our AGN candidates detected via IFS are missed. This work highlights the advantages of IFS, especially the ability to capture extended or decentralized emission from accreting BHs.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Enhancing Cluster Identification in Atom Probe Tomography Data Using Transfer Learning

Atom Probe Tomography (APT) is a powerful technique for visualizing the atomic-scale distribution of solutes in materials, but quantitative cluster analysis of APT datasets remains a challenge due to the need for subjective parameter selection in clustering algorithms. While distance-based and density-based methods such as HDBSCAN are widely used, their performance is highly sensitive to user-defined parameters, which undermines reproducibility and accuracy. This study proposes an image-based, deep learning-aided workflow for automating parameter selection and cluster detection in APT data analysis. By projecting 3D APT point clouds onto 2D planes, we leverage pretrained convolutional neural networks (ConvNeXt-Tiny and ResNet-50) through transfer learning to predict the number of clusters present in synthetic datasets. The output is used to guide K-means clustering and estimate HDBSCAN parameters, specifically minimum cluster size and minimum sample points. This approach reduces reliance on manual parameter tuning, improving consistency and scalability. The methodology demonstrates the feasibility of using image-based deep learning for interpreting complex spatial patterns in APT data, enabling faster and more objective analysis. The complete workflow and code are made publicly available to support reproducibility and future research.

Density-based clustering↗
DOE OSTI2024

Sub-millisecond keyhole pore detection in laser powder bed fusion using sound and light sensors and machine learning

Laser powder bed fusion is a mainstream additive manufacturing technology widely used to manufacture complex parts in prominent sectors, including aerospace, biomedical, and automotive industries. However, during the printing process, the presence of an unstable vapor depression can lead to a type of defect called keyhole porosity, which is detrimental to the part quality. In this study, we developed an effective approach to locally detect the generation of keyhole pores during the printing process by leveraging machine learning and a suite of optical and acoustic sensors. Simultaneous synchrotron x-ray imaging allows the direct visualization of pore generation events inside the sample, offering high-fidelity ground truth. A neural network model adopting SqueezeNet architecture using single-sensor data was developed to evaluate the fidelity of each sensor for capturing keyhole pore generation events. Our comparative study shows that the near infrared images gave the highest prediction accuracy, followed by 100 kHz and 20 kHz microphones, and the photodiode sensitive to processing laser wavelength had the lowest accuracy. Using a single sensor, over 90% prediction accuracy can be achieved with a temporal resolution as short as 0.1 ms. A data fusion scheme was also developed with features extracted using SqueezeNet neural network architecture and classification using different machine learning algorithms. Our work demonstrates the correlation between the characteristic optical and acoustic emissions and the keyhole oscillation behavior, and thereby provides strong physics support for the machine learning approach.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Dual X-ray computed tomography-aided classification of melt pool boundaries and flaws in crept additively manufactured parts

In metal additive manufacturing (AM), understanding the process-structure-performance relationships requires a combination of multi-scale characterization techniques that allows for the measurement of the melt pool shape and boundary and classifying various defects and flaws in the AM parts. Such approaches can be destructive, only 2D in nature, or have a small field of view and can be complex to co-register and analyze. Here, in this work, we present a non-destructive 3D inspection technique that employs dual-energy X-ray computed tomography (XCT) along with a model-based iterative reconstruction (MBIR) and a new segmentation algorithm. The proposed approach and algorithm are not only capable of classifying and quantifying flaws such as pores, cracks, and inclusions, but they also allow for the extraction of microstructural features such as melt pool boundaries (MPB) and melt pool regions (MPR), that can help understand process-structure-performance relationships for alloys under study. As an exemplar application, we employed the method for characterization of an additively manufactured aluminum alloy crept under tensile stress at 300 °C for 1064 h. Our results demonstrate high quality segmentation and classification of various flaws and MPB and MPR, for the first time, using 3D X-ray CT inspection. The delineated MPB and MPR in the crept samples reveal the preferential growth paths of cracks that formed during creep deformation. The technique was used for successfully quantifying the characteristics (number of defects, their density, volume fraction, etc.) of the manufacturing-induced pores and creep-induced cracks, which is necessary to better understand the creep failure mechanisms of the material.

36 MATERIALS SCIENCE↗
DOE OSTI2025

High-power test of a C-band linear accelerating structure with an RFSoC-based LLRF system

Normal conducting linear particle accelerators consist of multiple rf stations with accelerating structure cavities. Low-level rf (LLRF) systems are employed to set the phase and amplitude of the field in the accelerating structure and to compensate for the pulse-to-pulse fluctuation of the rf field in the accelerating structures with a feedback loop. The LLRF systems are typically implemented with analog rf mixers, heterodyne-based architectures, and discrete data converters. There are multiple rf signals from each of the rf stations, so the number of rf channels required increases rapidly with multiple rf stations. With a large number of rf channels, the footprint, component cost, and system complexity of the LLRF hardware will increase significantly. To meet the design goals of being compact and affordable for future accelerators, we have designed the next-generation LLRF (NG-LLRF) with a higher integration level based on RFSoC technology. The NG-LLRF system samples rf signals directly and performs rf mixing digitally. Further, the NG-LLRF has been characterized in loopback mode to evaluate the performance of the system and has also been tested with a standing-wave accelerating structure, a prototype for the Cool Copper Collider (C 3 ) with a peak rf power level up to 16.45 MW. The loopback test demonstrated amplitude fluctuation below 0.15% and phase fluctuation below 0.15°, which are considerably better than the requirements of C 3 . The rf signals from the different stages of the accelerating structure at different power levels are measured by the NG-LLRF, which will be critical references for the control algorithm designs. The NG-LLRF also offers flexibility in waveform modulation, so we have used rf pulses with various modulation schemes, which could be useful for controlling some of the rf stations in accelerators. In this paper, the high-power test results at different stages of the test setup will be summarized, analyzed, and discussed.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Designing Yield Grids for Airborne Nuclear Explosions to Maintain Decrements in Rayleigh Waveform Amplitudes

This document details a method for selecting grid points that sample the yields of airborne, low yield nuclear explosions that constrains the relative size of seismic waveforms sourced by explosions that are parameterized by this grid. In detail, we impose this constraint so that the vertical component of ground displacement that is sourced by explosions with a fixed height of burst (HoB) at grid point k change by a fixed factor of a when compared to the waveform amplitudes sourced by explosions at grid point k + 1, as observed at a fixed standoff distance. This gridding thereby preserves amplitude ratios along the grid so that they are agnostic to k. We assert that this method is useful in tests that apply algorithms against synthetic or augmented datasets for which the performance of the algorithm must be measured against source size, and waveform amplitudes must change uniformly (e.g., Berg et al, 2025).

58 GEOSCIENCES↗
DOE OSTI2024

Toward Accelerated Nuclear-physics Parameter Estimation from Binary Neutron Star Mergers: Emulators for the Tolman–Oppenheimer–Volkoff Equations

Abstract Gravitational-wave observations of binary neutron-star (BNS) mergers have the potential to revolutionize our understanding of the nuclear equation of state (EOS) and the fundamental interactions that determine its properties. However, Bayesian parameter estimation frameworks do not typically sample over microscopic nuclear-physics parameters that determine the EOS. One of the major hurdles in doing so is the computational cost involved in solving the neutron-star structure equations, known as the Tolman–Oppenheimer–Volkoff (TOV) equations. In this paper, we explore approaches to emulating solutions for the TOV equations: multilayer perceptrons (MLPs), Gaussian processes, and a data-driven variant of the reduced basis method (RBM). We implement these emulators for three different parameterizations of the nuclear EOS, each with a different degree of complexity represented by the number of model parameters. We find that our MLP-based emulators are generally more accurate than the other two algorithms, whereas the RBM results in the largest speedup with respect to the full high-fidelity TOV solver. We employ these emulators for a simple parameter inference using a potentially loud BNS observation and show that the posteriors predicted by our emulators are in excellent agreement with those obtained from the full TOV solver.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Surrogate optimization of variational quantum circuits

Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits.

Gustafson, Erik J. [RIACS, Mtn. View] (ORCID:00000↗
DOE OSTI2025

Semi-supervised permutation invariant particle-level anomaly detection

The development of analysis methods to distinguish potential beyond the Standard Model phenomena in a model-agnostic way can significantly enhance the discovery reach in collider experiments. However, the typical machine learning (ML) algorithms employed for this task require fixed length and ordered inputs that break the natural permutation invariance in collision events. To address this, a semi-supervised anomaly detection tool is presented that takes a variable number of particle-level inputs and leverages a signal model to encode this information into a permutation invariant, event-level representation via supervised training with a Particle Flow Network (PFN). Data events are then encoded into this representation and given as input to an autoencoder for unsupervised ANomaly deTEction on particLe flOw latent sPacE (ANTELOPE), classifying anomalous events based on a low-level and permutation invariant input modeling. Performance of the ANTELOPE architecture is evaluated on simulated samples of hadronic processes in a high energy collider experiment, showing good capability to distinguish disparate models of new physics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Emulating ab initio computations of infinite nucleonic matter

We construct efficient emulators for the computation of the infinite nuclear matter equation of state. These emulators are based on the subspace-projected coupled-cluster method for which we here develop a new algorithm called small-batch voting to eliminate spurious states that might appear when emulating quantum many-body methods based on a non-Hermitian Hamiltonian. The efficiency and accuracy of these emulators facilitate a rigorous statistical analysis within which we explore nuclear matter predictions for > 10 6 different parametrizations of a chiral interaction model with explicit Δ -isobars at next-to-next-to leading order. Constrained by nucleon-nucleon scattering phase shifts and bound-state observables of light nuclei up to He 4 , we use history matching to identify nonimplausible domains for the low-energy coupling constants of the chiral interaction. Within these domains we perform a Bayesian analysis using sampling and importance resampling with different likelihood calibrations and study correlations between interaction parameters, calibration observables in light nuclei, and nuclear matter saturation properties. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Defect And Damage Characterization Of Additively Manufactured Titanium Alloy Ti-5553 Using Traditional Computed Tomography Volume Segmentation And Machine Learning Algorithms

The mechanical response of a component is affected by defects, such as porosity, arising from the laser powder bed fusion (LPBF) fabrication process. Thus, it is important to develop accurate and efficient inspection methods for identifying porosity. In this work, porosity identified in an X-ray computed tomography (XCT) volume of a Ti-5553 coupon was compared to pores identified in a serial sectioned volume that represented the ground truth. The porosity of the XCT scan was identified using contrast-based, ISO-based, and machine learning (ML) methods for segmentation. Large inherent porosity was easy to identify, but the ISO thresholding still struggled due to the intensity gradient resulting from both the beam hardening in XCT and the uneven lighting of the serial sectioning panels. Further, the results show that ML-based methods were better suited for identifying small pores and reducing the amount of false positives. Additionally, high strain-rate impact testing was done on some of the XCT samples as well as post-mortem XCT inspection, and the same suite of segmentation and quantification tools were used to identify the large spallation cavities. The comparison of porosity pre- and post-mortem provides insight on the influence of the LPBF porosity on the formation of spall cavities.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool \texttt{JuliQAOA} to perform classical angle finding for up to $49$ QAOA layers ($p$). Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States (PEPS), Matrix Product State (MPS), and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of $p$ - there are many cases where the performance temporarily decreases as a function of $p$ - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the $100+$ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to $p=5$ on \texttt{ibm\_fez}, up to $p=9$ on \texttt{ibm\_torino}, and up to $p=10$ on \texttt{ibm\_pittsburgh}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Advanced Method Optimization for Sampling and Analysis Instrumentation

This work presents a generalized approach for analytical method optimization that branches the gap between techniques historically employed and accurate modern optimization techniques suitable for various applications. The novelty of the described strategy is the utilization of multivariate, multiobjective optimization with Karush-Kuhn-Tucker conditions to bound the optimization space to solutions within the physical limitations of instrumentation. Briefly, the basic steps outlined in this paper are to (1) determine the objective(s) that should be maximized or minimized based on the goals of the analytical application, (2) conduct a screening experiment, (3) perform ANOVA to determine the parameters which have a statistically significant effect on the objective, (4) conduct an experiment (e.g., Box-Behnken design) to collect data for fitting the objective equation, and (5) determine the physical constraints of the parameters and solve the Lagrangian to determine the optimal method parameters. A broad approach to optimization target selection allows for robust method tuning to develop improved data sets amenable for chemometrics and machine learning algorithm development. Gas chromatography-mass spectrometry was selected as a use case due to its broad use across scientific fields and time-consuming method development involving numerous parameters. In conclusion, this strategy can reduce the cost of research, improve data quality, and enable the rapid development of new analytical technique.

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

The DECADE cosmic shear project I: A new weak lensing shape catalog of 107 million galaxies

We present the Dark Energy Camera All Data Everywhere (DECADE) weak lensing dataset: a catalog of 107 million galaxies observed by the Dark Energy Camera (DECam) in the northern Galactic cap. This catalog was assembled from public DECam data including survey and standard observing programs. These data were consistently processed with the Dark Energy Survey Data Management pipeline as part of the DECADE campaign and serve as the basis of the DECam Local Volume Exploration survey (DELVE) Early Data Release 3 (EDR3). We apply the Metacalibration measurement algorithm to generate and calibrate galaxy shapes. After cuts, the resulting cosmology-ready galaxy shape catalog covers a region of $5,\!412 \,\,{\rm deg}^2$ with an effective number density of $4.59\,\, {\rm arcmin}^{-2}$. The coadd images used to derive this data have a median limiting magnitude of $r = 23.6$, $i = 23.2$, and $z = 22.6$, estimated at ${\rm S/N} = 10$ in a 2 arcsecond aperture. We present a suite of detailed studies to characterize the catalog, measure any residual systematic biases, and verify that the catalog is suitable for cosmology analyses. In parallel, we build an image simulation pipeline to characterize the remaining multiplicative shear bias in this catalog, which we measure to be $m = (-2.454 \pm 0.124) \times10^{-2}$ for the full sample. Despite the significantly inhomogeneous nature of the data set, due to it being an amalgamation of various observing programs, we find the resulting catalog has sufficient quality to yield competitive cosmological constraints.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2026

Monte Carlo Simulations of Crystal Defects in Open Ensembles

Zero- and two-dimensional crystal defects form in open statistical ensembles, such as the grand canonical, that are usually inaccessible with conventional simulation techniques. This longstanding challenge is overcome with a new Hamiltonian Monte Carlo method that samples energy-biased gradual transformations. In conclusion, the method enables free energy calculations for nonideal point defects and the direct prediction of finite-temperature interface structures.

Grain boundaries↗