Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “kernel method”

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 145 records · Page 8

Smoothing Lexis diagrams using kernel functions: A contemporary approach

Lexis diagrams are rectangular arrays of event rates indexed by age and period. Analysis of Lexis diagrams is a cornerstone of cancer surveillance research. Typically, population-based descriptive studies analyze multiple Lexis diagrams defined by sex, tumor characteristics, race/ethnicity, geographic region, etc. Inevitably the amount of information per Lexis diminishes with increasing stratification. Several methods have been proposed to smooth observed Lexis diagrams up front to clarify salient patterns and improve summary estimates of averages, gradients, and trends. In this article, we develop a novel bivariate kernel-based smoother that incorporates two key innovations. First, for any given kernel, we calculate its singular values decomposition, and select an optimal truncation point—the number of leading singular vectors to retain—based on the bias-corrected Akaike information criterion. Second, we model-average over a panel of candidate kernels with diverse shapes and bandwidths. The truncated model averaging approach is fast, automatic, has excellent performance, and provides a variance-covariance matrix that takes model selection into account. We present an in-depth case study (invasive estrogen receptor-negative breast cancer incidence among non-Hispanic white women in the United States) and simulate operating characteristics for 20 representative cancers. The truncated model averaging approach consistently outperforms any fixed kernel. Our results support the routine use of the truncated model averaging approach in descriptive studies of cancer.

60 APPLIED LIFE SCIENCES↗

Methods in PES-Learn: Direct-Fit Machine Learning of Born–Oppenheimer Potential Energy Surfaces

The release of PES-L EARN version 1.0 as an open-source software package for the automatic construction of machine learning models of semi-global molecular potential energy surfaces (PESs) is presented. Improvements to PES-L EARN ’s interoperability are stressed with new Python API that simplifies workflows for PES construction via interaction with QCSchema input and output infrastructure. In addition, a new machine learning method is introduced to PES-L EARN : kernel ridge regression (KRR). The capabilities of KRR are emphasized with examination of select semi-global PESs. All machine learning methods available in PES-L EARN are benchmarked with benzene and ethanol datasets from the rMD17 database to illustrate PES-L EARN ’s performance ability. Fitting performance and timings are assessed for both systems. Finally, the ability to predict gradients with neural network models is presented and benchmarked with ethanol and benzene. PES-L EARN is an active project and welcomes community suggestions and contributions.

kernel ridge regression↗

Propagation Pattern for Moment Representation of the Lattice Boltzmann Method

A propagation pattern for the moment representation of the regularized lattice Boltzmann method (LBM) in three dimensions is presented. Using effectively lossless compression, the simulation state is stored as a set of moments of the lattice Boltzmann distribution function, instead of the distribution function itself. An efficient cache-aware propagation pattern for this moment representation has the effect of substantially reducing both the storage and memory bandwidth required for LBM simulations. This article extends recent work with the moment representation by expanding the performance analysis on central processing unit (CPU) architectures, considering how boundary conditions are implemented, and demonstrating the effectiveness of the moment representation on a graphics processing unit (GPU) architecture.

42 ENGINEERING↗

Contributions From Cloud Morphological Changes to the Interannual Shortwave Cloud Feedback Based on MODIS and ISCCP Satellite Observations

The surface temperature-mediated change in cloud properties, referred to as the cloud feedback, continues to dominate the uncertainty in climate projections. A larger number of contemporary global climate models (GCMs) project a higher degree of warming than the previous generation of GCMs. This greater projected warming has been attributed to a less negative cloud feedback in the Southern Ocean. Here, we apply a novel “double decomposition method” that employs the “cloud radiative kernel” and “cloud regime” concepts, to two data sets of satellite observations to decompose the interannual cloud feedback into contributions arising from changes within and shifts between cloud morphologies. Our results show that contributions from the latter to the cloud feedback are large for certain regimes. We then focus on interpreting how both changes within and between cloud morphologies impact the shortwave cloud optical depth feedback over the Southern Ocean in light of additional observations. Results from the former cloud morphological changes reveal the importance of the wind response to warming increases low- and mid-level cloud optical thickness in the same region. Results from the latter cloud morphological changes reveal that a general shift from thick storm-track clouds to thinner oceanic low-level clouds contributes to a positive feedback over the Southern Ocean that is offset by shifts from thinner broken clouds to thicker mid- and low-level clouds. Our novel analysis can be applied to evaluate GCMs and potentially diagnose shortcomings pertaining to their physical parameterizations of particular cloud morphologies.

58 GEOSCIENCES↗

Radiological Source Term Estimation and Isotopic Identification with Parallel Log Domain Particle Filters

This paper presents a parallel log-domain particle filtering algorithm combined with gamma spectrum unfolding to perform localization, identification, and evaluation of multiple point sources of various isotopes in an environment with attenuating obstacles. The method uses sets of precomputed attenuation kernels that map the attenuation characteristics of the environment. These kernels are specific to the energy level of a photopeak of interest. The spectral measurements are deconvolved into count measurements of each photopeak. These count measurements are fed into a set of parallel particle filters using attenuation kernels computed for that photopeak’s energy level. The individual regularized particle filters perform all likelihood calculations in the logarithmic domain to mitigate the effects of particle degeneracy. The output of each particle filter is combined to estimate which isotopes are present as well as their positions and strengths. The performance of the algorithm is characterized in a lab-scale environment using a mobile robot equipped with a gamma ray spectrometer in the presence of up to three different radioactive isotopes simultaneously. The sources were localized to within 10 cm, and their strengths were estimated within 10% of their true values. Furthermore, the isotopes were all correctly identified, and no spurious sources were reported.

42 ENGINEERING↗

BASIC HARTREE-FOCK PROXY APPLICTION

This proxy application simulates the compute load and data-movement of the kernel of the Hartree-Fock method in quantum chemistry. The proxy features a simplified algorithm for computing electron repulsion integrals that is easily offloaded to GPUs.

FLETCHER, GRAHAMD↗

KeNary

A Probabilistic Kernel-Based n-ary Classification Method for Sets of Observations

Stricklin, PhD, Madeline [Los Alamos National Labo↗

Sharp front tracking with geometric interface reconstruction

Here, this paper presents a novel sharp front-tracking method designed to address limitations in classical front-tracking approaches, specifically their reliance on smooth interpolation kernels and extended stencils for coupling the front and fluid mesh. In contrast, the proposed method employs exclusively sharp, localized interpolation and spreading kernels, restricting the coupling to the interfacial fluid cells–those containing the interface/front. This localized coupling is achieved by integrating a divergence-preserving velocity interpolation method with a piecewise parabolic interface calculation (PPIC) and a polyhedron intersection algorithm to compute the indicator function and local interface curvature. Surface tension is computed using the Continuum Surface Force (CSF) method, maintaining consistency with the sharp representation. Additionally, we propose an efficient local roughness smoothing implementation to account for surface mesh undulations, which is easily applicable to any triangulated surface mesh. Building on our previous work, the primary innovation of this study lies in the localization of the coupling for both the indicator function and surface tension calculations. By reducing the interface thickness on the fluid mesh to a single cell, as opposed to the 4–5 cell spans typical in classical methods, the proposed sharp front-tracking method achieves a highly localized and accurate representation of the interface. This sharper representation mitigates parasitic currents and improves force balancing, making it particularly suitable for scenarios where the interface plays a critical role, such as microfluidics, fluid-fluid interactions, and fluid-structure interactions. The proposed method is comprehensively validated and tested on canonical interfacial flow problems, including stationary and translating Laplace equilibria, oscillating droplets, and rising bubbles. The presented results demonstrate that the sharp front-tracking method significantly outperforms the classical approach in terms of accuracy, stability, and computational efficiency. Notably, parasitic currents are reduced by approximately two orders of magnitude and stable results are obtained for parameter ranges where classical front tracking fails to converge.

42 ENGINEERING↗

Discovery of Probabilistic Dirichlet-to-Neumann Maps on Graphs

Dirichlet-to-Neumann maps enable the coupling of multiphysics simulations across computational subdomains by ensuring continuity of state variables and fluxes at artificial interfaces. We present a novel method for learning Dirichlet-to-Neumann maps on graphs using Gaussian processes, specifically for problems where the data obey a conservation law arising from an underlying partial differential equation. Our approach combines discrete exterior calculus and nonlinear optimal recovery to infer relationships between vertex and edge values. This framework yields data-driven predictions with uncertainty quantification across the entire graph, even when observations are limited to a subset of vertices and edges. By minimizing the reproducing kernel Hilbert space norm while penalizing kernel complexity through maximum likelihood estimation, our method ensures that the resulting surrogate strictly enforces conservation laws without overfitting. We demonstrate our method on two representative applications: subsurface flow in fracture networks and arterial blood flow. Finally, the results demonstrate that the method maintains high accuracy and well-calibrated uncertainty estimates even under severe data scarcity, highlighting its potential for scientific applications where limited data and reliable uncertainty quantification are critical.

Dirichlet-to-Neumann map↗

Decoupled Fréchet kernels based on a fractional viscoacoustic wave equation

We formulate the Fréchet kernel computation using the adjoint-state method based on a fractional viscoacoustic wave equation. We first numerically prove that both the 1/2- and the 3/2-order fractional Laplacian operators are self-adjoint. Using this property, we show that the adjoint wave propagator preserves the dispersion and compensates the amplitude, while the time-reversed adjoint wave propagator behaves identically as the forward propagator with the same dispersion and dissipation characters. Without introducing rheological mechanisms, this formulation adopts an explicit Q parameterization, which avoids the implicit Q in the conventional viscoacoustic/viscoelastic full waveform inversion (Q-FWI). In addition, because of the decoupling of operators in the wave equation, the viscoacoustic Fréchet kernel is separated into three distinct contributions with clear physical meanings: lossless propagation, dispersion, and dissipation. Here, we find that the lossless propagation kernel dominates the velocity kernel, while the dissipation kernel dominates the attenuation kernel over the dispersion kernel.

58 GEOSCIENCES↗

Automated Defect Identification for Tri-structural Isotropic Fuels (AUDIT)

During the manufacture of tri-structural isotropic (TRISO)-coated nuclear fuel particles, the potential exists for the formation of internal fissure defects in the uranium oxycarbide (UCO) kernels. These fissures result in a defective fuel particle that can fracture during subsequent fuel processing. Therefore, it is necessary to detect the presence of fissured kernels in a batch to determine if the batch meets specification prior to blending with other batches and upgrading processes. Previous attempts at identifying fissures involved manual inspection of micrographs of UCO fuel kernel cross-sections. This process is tedious, time-consuming and may introduce counting errors making it a good candidate for automation. This work presents a method for the automated detection of fissures in UCO kernels. Image segmentation is used for the extraction of relevant features in the micrographs which then serve as the input to a convolutional neural network used to automatically distinguish between fissured and non-fissured kernels.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Graphical Gaussian Process Regression Model for Aqueous Solvation Free Energy Prediction of Organic Molecules in Redox Flow Battery

The solvation free energy of organic molecules is a critical parameter in determining emergent properties such as solubility, liquid-phase equilibrium constants, and pKa and redox potentials in an organic redox flow battery. In this work, we present a machine learning (ML) model that can learn and predict the aqueous solvation free energy of an organic molecule using Gaussian process regression method based on a new molecular graph kernel. To investigate the performance of the ML model on electrostatic interaction, the nonpolar interaction contribution of solvent and the conformational entropy of solute in solvation free energy, three data sets with implicit or explicit water solvent models, and contribution of conformational entropy of solute are tested. We demonstrate that our ML model can predict the solvation free energy of molecules at chemical accuracy with a mean absolute error of less than 1 kcal/mol for subsets of the QM9 dataset and the Freesolv database. To solve the general data scarcity problem for a graph-based ML model, we propose a dimension reduction algorithm based on the distance between molecular graphs, which can be used to examine the diversity of the molecular data set. It provides a promising way to build a minimum training set to improve prediction for certain test sets where the space of molecular structures is predetermined.

25 ENERGY STORAGE↗

Adjoint Waveform Tomography for Next Generation Seismic Analyses and Monitoring

The development of methods and capabilities to compute complete waveform simulations in three-dimensional (3D) Earth models along with adjoint methods for computing the fully 3D sensitivity kernels in the 2000's set the stage for new advances in seismic imaging. I believe that the full benefits of adjoint waveform tomography (AWT) are not yet fully realized and this will be an important direction for the future of seismic tomography.

58 GEOSCIENCES↗

Time-dependent orbital-free density functional theory: Background and Pauli kernel approximations

Time-dependent orbital-free density functional theory (DFT) is an efficient method for calculating the dynamic properties of large-scale quantum systems due to the low computational cost compared to standard time-dependent DFT. In this work, we formalize this method by mapping the real system of interacting fermions onto a fictitious system of noninteracting bosons. The dynamic Pauli potential and associated kernel emerge as key ingredients of time-dependent orbital-free DFT. Using the uniform electron gas as a model system, we derive an approximate frequency-dependent Pauli kernel. Pilot calculations suggest that space nonlocality is a key feature for this kernel. Nonlocal terms arise already in the second-order expansion with respect to unitless frequency and reciprocal space variable ($\frac{ω}{qk_F}$ and $\frac{q}{2k_F}$, respectively). Given the encouraging performance of the proposed kernel, we expect it will lead to more accurate orbital-free DFT simulations of nanoscale systems out of equilibrium. Additionally, the proposed path to formulate nonadiabatic Pauli kernels presents several avenues for further improvements which can be exploited in future work to improve the results.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Clustering in massive neutrino cosmologies via Eulerian Perturbation Theory

We introduce an Eulerian Perturbation Theory to study the clustering of tracers for cosmologies in the presence of massive neutrinos. Our approach is based on mapping recently-obtained Lagrangian Perturbation Theory results to the Eulerian framework. We add Effective Field Theory counterterms, IR-resummations and a biasing scheme to compute the one-loop redshift-space power spectrum. To assess our predictions, we compare the power spectrum multipoles against synthetic halo catalogues from the QUIJOTE simulations, finding excellent agreement on scales k ≲ 0.25 h Mpc-1. One can obtain the same fitting accuracy using higher wave-numbers, but then the theory fails to give a correct estimation of the linear bias parameter. We further discuss the implications for the tree-level bispectrum. Finally, calculating loop corrections is computationally costly, hence we derive an accurate approximation wherein we retain only the main features of the kernels, as produced by changes to the growth rate. As a result, we show how FFTLog methods can be used to further accelerate the loop computations with these reduced kernels.

79 ASTRONOMY AND ASTROPHYSICS↗

PV-Finder: ML Based Algorithm for Primary Vertex Identification

he CMS detector at the High-Luminosity Large Hadron Collider (HL-LHC) will operate in challenging conditions with expected pile-up of up to 200 collisions per bunch crossing, necessitating the development of a more resilient primary vertex (PV) reconstruction method to ensure the integrity of data analysis and the efficiency of the CMS triggering system. This contribution describes preliminary studies on a new ML based PV-Finder method for PV identification. The method is based on a model trained using Kernel Density Estimations (KDEs) derived from the positions of reconstructed tracks at the beamline, incorporating uncertainties from track parameters. It also utilizes target histograms, modeled as Gaussian distributions centered on the actual ground truth values of specific primary vertices.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DMTN-197: Streak Masking in DM Image Processing

Streaks caused by satellites are a persistent problem in optical images, and their occurrence will likely increase in the coming years. Many Hyper Suprime-Cam images are already affected by streaks, and the same is expected for Rubin Observatory data. In the LSST Data Release Production (DRP), most streaks and other artifacts are already detected and masked by the algorithm CompareWarpAssembleCoadd. However, some streaks are not caught at this stage and can contaminate the final coadds and detection catalogs. To find and mask these, we adopt a morphologically-based method for detecting streaks, which uses the Kernel-Based Hough Transform to detect straight lines. Once the lines are detected, the streak profile is fit and the affected portion of the image is masked out. This algorithm, maskStreaks, is included in the meas_algorithms package and is used in CompareWarpAssembleCoadd to remove streaks from coadds. Similar implementation in the Alert Production Pipeline is possible but has not been implemented.

79 ASTRONOMY AND ASTROPHYSICS↗