Search NASA⌕ Search

SEARCH · Search NASA

Results for “Kernel methods”

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 757 records · Page 42

The Transition Density Formalism in the First Compton Computation on $^4$He

The method and results of the first theory description of 4He Compton scattering at nuclear energies is presented, with a focus on figures. It uses the same Compton kernels familiar from proton, deuteron and 3He Compton scattering in Chiral Effective Field Theory with explicit Delta degrees of freedom, applicable between about 50 and 130MeV. The result compares well to data from HIγS, MAXlab and Illinois. The sensitivity of the cross section on the (static) scalar-isoscalar polarisabilities of the nucleon is explored. The project is part of the synergetic international effort of experimentalists and theorists in Compton scattering on one- and few-nucleon systems.

Griesshammer, Harald [The George Washington Univer↗

Predicting Cycle-to-cycle Variations in a Spark-ignition Engine using Multi-cycle Large Eddy Simulation

Multi-cycle large eddy simulation (LES) of a spark-ignition engine has been performed to predict cycle-to-cycle variations (CCV). To describe spark-ignited premixed flame propagation, the front propagation formulation (FPF) method is combined with a laminar-to-turbulent flame transition model that describes the non-equilibrium flame development processes during the initial stage of the kernel growth. In the laminar-to-turbulent flame transition model, the effects of turbulence on the variations in the laminar-to-turbulent flame transition time are modeled based on the Kolmogorov energy cascade. 15 consecutive cycle LES of in-cylinder processes in a spark-ignition four-valve single cylinder engine is conducted. The predicted in-cylinder pressure is compared with the experimental measurements. The range of CCV observed in the experiment is reproduced to an acceptable degree. The predicted CCV is found to be closely related to the difference in the turbu- lence field near the spark plug around the time of spark discharging, which is consistent with the previous LES studies. The current results also suggest the importance of capturing the variations of the laminar-to-turbulent flame transition in predicting CCV.

Su, Yunde↗

Predicting Cycle-to-cycle Variations in a Spark-ignition Engine using Multi-cycle Large Eddy Simulation

Multi-cycle large eddy simulation (LES) of a spark-ignition engine has been performed to predict cycle-to-cycle variations (CCV). To describe spark-ignited premixed flame propagation, the front propagation formulation (FPF) method is combined with a laminar-to-turbulent flame transition model that describes the non-equilibrium flame development processes during the initial stage of the kernel growth. In the laminar-to-turbulent flame transition model, the effects of turbulence on the variations in the laminar-to-turbulent flame transition time are modeled based on the Kolmogorov energy cascade. 15 consecutive cycle LES of in-cylinder processes in a spark-ignition four-valve single cylinder engine is conducted. The predicted in-cylinder pressure is compared with the experimental measurements. The range of CCV observed in the experiment is reproduced to an acceptable degree. The predicted CCV is found to be closely related to the difference in the turbulence field near the spark plug around the time of spark discharging, which is consistent with the previous LES studies. The current results also suggest the importance of capturing the variations of the laminar-to-turbulent flame transition in predicting CCV.

Yu, Yunde↗

Evaluating Operating System Vulnerability to Memory Errors

Reliability is of great concern to the scalability of extreme-scale systems. Of particular concern are soft errors in main memory, which are a leading cause of failures on current systems and are predicted to be the leading cause on future systems. While great effort has gone into designing algorithms and applications that can continue to make progress in the presence of these errors without restarting, the most critical software running on a node, the operating system (OS), is currently left relatively unprotected. OS resiliency is of particular importance because, though this software typically represents a small footprint of a compute node's physical memory, recent studies show more memory errors in this region of memory than the remainder of the system. In this paper, we investigate the soft error vulnerability of two operating systems used in current and future high-performance computing systems: Kitten, the lightweight kernel developed at Sandia National Laboratories, and CLE, a high-performance Linux-based operating system developed by Cray. For each of these platforms, we outline major structures and subsystems that are vulnerable to soft errors and describe methods that could be used to reconstruct damaged state. Our results show the Kitten lightweight operating system may be an easier target to harden against memory errors due to its smaller memory footprint, largely deterministic state, and simpler system structure.

99 GENERAL AND MISCELLANEOUS↗

Alpha image reconstruction (AIR): A new iterative CT image reconstruction approach using voxel-wise alpha blending

Purpose: Iterative image reconstruction gains more and more interest in clinical routine, as it promises to reduce image noise (and thereby patient dose), to reduce artifacts, or to improve spatial resolution. Among vendors and researchers, however, there is no consensus of how to best achieve these aims. The general approach is to incorporatea priori knowledge into iterative image reconstruction, for example, by adding additional constraints to the cost function, which penalize variations between neighboring voxels. However, this approach to regularization in general poses a resolution noise trade-off because the stronger the regularization, and thus the noise reduction, the stronger the loss of spatial resolution and thus loss of anatomical detail. The authors propose a method which tries to improve this trade-off. The proposed reconstruction algorithm is called alpha image reconstruction (AIR). One starts with generating basis images, which emphasize certain desired image properties, like high resolution or low noise. The AIR algorithm reconstructs voxel-specific weighting coefficients that are applied to combine the basis images. By combining the desired properties of each basis image, one can generate an image with lower noise and maintained high contrast resolution thus improving the resolution noise trade-off. Methods: All simulations and reconstructions are performed in native fan-beam geometry. A water phantom with resolution bar patterns and low contrast disks is simulated. A filtered backprojection (FBP) reconstruction with a Ram-Lak kernel is used as a reference reconstruction. The results of AIR are compared against the FBP results and against a penalized weighted least squares reconstruction which uses total variation as regularization. The simulations are based on the geometry of the Siemens Somatom Definition Flash scanner. To quantitatively assess image quality, the authors analyze line profiles through resolution patterns to define a contrast factor for contrast-resolution plots. Furthermore, the authors calculate the contrast-to-noise ratio with the low contrast disks and the authors compare the agreement of the reconstructions with the ground truth by calculating the normalized cross-correlation and the root-mean-square deviation. To evaluate the clinical performance of the proposed method, the authors reconstruct patient data acquired with a Somatom Definition Flash dual source CT scanner (Siemens Healthcare, Forchheim, Germany). Results: The results of the simulation study show that among the compared algorithms AIR achieves the highest resolution and the highest agreement with the ground truth. Compared to the reference FBP reconstruction AIR is able to reduce the relative pixel noise by up to 50% and at the same time achieve a higher resolution by maintaining the edge information from the basis images. These results can be confirmed with the patient data. Conclusions: To evaluate the AIR algorithm simulated and measured patient data of a state-of-the-art clinical CT system were processed. It is shown, that generating CT images through the reconstruction of weighting coefficients has the potential to improve the resolution noise trade-off and thus to improve the dose usage in clinical CT.

60 APPLIED LIFE SCIENCES↗

Prediction of bacterial E3 ubiquitin ligase effectors using reduced amino acid peptide fingerprinting

Background Although pathogenic Gram-negative bacteria lack their own ubiquitination machinery, they have evolved or acquired virulence effectors that can manipulate the host ubiquitination process through structural and/or functional mimicry of host machinery. Many such effectors have been identified in a wide variety of bacterial pathogens that share little sequence similarity amongst themselves or with eukaryotic ubiquitin E3 ligases. Methods To allow identification of novel bacterial E3 ubiquitin ligase effectors from protein sequences we have developed a machine learning approach, the SVM-based Identification and Evaluation of Virulence Effector Ubiquitin ligases (SIEVE-Ub). We extend the string kernel approach used previously to sequence classification by introducing reduced amino acid (RED) alphabet encoding for protein sequences. Results We found that 14mer peptides with amino acids represented as simply either hydrophobic or hydrophilic provided the best models for discrimination of E3 ligases from other effector proteins with a receiver-operator characteristic area under the curve (AUC) of 0.90. When considering a subset of E3 ubiquitin ligase effectors that do not fall into known sequence based families we found that the AUC was 0.82, demonstrating the effectiveness of our method at identifying novel functional family members. Feature selection was used to identify a parsimonious set of 10 RED peptides that provided good discrimination, and these peptides were found to be located in functionally important regions of the proteins involved in E2 and host target protein binding. Our general approach enables construction of models based on other effector functions. We used SIEVE-Ub to predict nine potential novel E3 ligases from a large set of bacterial genomes. SIEVE-Ub is available for download at https://doi.org/10.6084/m9.figshare.7766984.v1 or https://github.com/biodataganache/SIEVE-Ub for the most current version.

59 BASIC BIOLOGICAL SCIENCES↗

TU-CD-BRA-12: Coupling PET Image Restoration and Segmentation Using Variational Method with Multiple Regularizations

Purpose: To propose a new variational method which couples image restoration with tumor segmentation for PET images using multiple regularizations. Methods: Partial volume effect (PVE) is a major degrading factor impacting tumor segmentation accuracy in PET imaging. The existing segmentation methods usually need to take prior calibrations to compensate PVE and they are highly system-dependent. Taking into account that image restoration and segmentation can promote each other and they are tightly coupled, we proposed a variational method to solve the two problems together. Our method integrated total variation (TV) semi-blind deconvolution and Mumford-Shah (MS) segmentation. The TV norm was used on edges to protect the edge information, and the L{sub 2} norm was used to avoid staircase effect in the no-edge area. The blur kernel was constrained to the Gaussian model parameterized by its variance and we assumed that the variances in the X-Y and Z directions are different. The energy functional was iteratively optimized by an alternate minimization algorithm. Segmentation performance was tested on eleven patients with non-Hodgkin’s lymphoma, and evaluated by Dice similarity index (DSI) and classification error (CE). For comparison, seven other widely used methods were also tested and evaluated. Results: The combination of TV and L{sub 2} regularizations effectively improved the segmentation accuracy. The average DSI increased by around 0.1 than using either the TV or the L{sub 2} norm. The proposed method was obviously superior to other tested methods. It has an average DSI and CE of 0.80 and 0.41, while the FCM method — the second best one — has only an average DSI and CE of 0.66 and 0.64. Conclusion: Coupling image restoration and segmentation can handle PVE and thus improves tumor segmentation accuracy in PET. Alternate use of TV and L2 regularizations can further improve the performance of the algorithm. This work was supported in part by National Natural Science Foundation of China (NNSFC), under Grant No.61375018, and Fundamental Research Funds for the Central Universities, under Grant No. 2012QN086. Wei Lu was supported in part by the National Institutes of Health (NIH) Grant No. R01 CA172638.

60 APPLIED LIFE SCIENCES↗

Manifestation of exchange effects in heavy-ion interactions

Three different approaches to taking into account exchange effects in heavy-ion collisions are studied. Within the first of them, the lowest eigenstates of the Hamiltonian are treated as forbidden states. In the second approach, the eigenstates of the normalization kernel of the resonating-group model that correspond to zero eigenvalues are treated as forbidden states. The third approach takes additionally into account semiforbidden states. The {sup 16}O + {sup 16}O system is considered. A hybrid approach that combines the methods of discrete and continuous mathematics is developed for calculating the widths of narrow resonance states. The resonance width calculated within the approach that takes into account semiforbidden states proves to be sharply different from the widths obtained within traditional approaches.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Modeling Deep Burn TRISO Particle Nuclear Fuel

Under the DOE Deep Burn program TRISO fuel is being investigated as a fuel form for consuming plutonium and minor actinides, and for greater efficiency in uranium utilization. The result will thus be to drive TRISO particulate fuel to very high burn-ups. In the current effort the various phenomena in the TRISO particle are being modeled using a variety of techniques. The chemical behavior is being treated utilizing thermochemical analysis to identify phase formation/transformation and chemical activities in the particle, including kernel migration. First principles calculations are being used to investigate the critical issue of fission product palladium attack on the SiC coating layer. Density functional theory is being used to understand fission product diffusion within the plutonia oxide kernel. Kinetic Monte Carlo techniques are shedding light on transport of fission products, most notably silver, through the carbon and SiC coating layers. The diffusion of fission products through an alternative coating layer, ZrC, is being assessed via DFT methods. Finally, a multiscale approach is being used to understand thermal transport, including the effect of radiation damage induced defects, in a model SiC material.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Implementing Molecular Dynamics on Hybrid High Performance Computers - Particle-Particle Particle-Mesh

The use of accelerators such as graphics processing units (GPUs) has become popular in scientific computing applications due to their low cost, impressive floating-point capabilities, high memory bandwidth, and low electrical power requirements. Hybrid high-performance computers, machines with nodes containing more than one type of floating-point processor (e.g. CPU and GPU), are now becoming more prevalent due to these advantages. In this paper, we present a continuation of previous work implementing algorithms for using accelerators into the LAMMPS molecular dynamics software for distributed memory parallel hybrid machines. In our previous work, we focused on acceleration for short-range models with an approach intended to harness the processing power of both the accelerator and (multi-core) CPUs. To augment the existing implementations, we present an efficient implementation of long-range electrostatic force calculation for molecular dynamics. Specifically, we present an implementation of the particle-particle particle-mesh method based on the work by Harvey and De Fabritiis. We present benchmark results on the Keeneland InfiniBand GPU cluster. We provide a performance comparison of the same kernels compiled with both CUDA and OpenCL. We discuss limitations to parallel efficiency and future directions for improving performance on hybrid or heterogeneous computers.

97 MATHEMATICS AND COMPUTING↗

Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations

We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolis–Hastings kernel, borrowing ideas from deterministic approximation theory, optimization, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the sampler’s exactness or efficiency; our work seeks to address these limitations by exploiting useful convergence characteristics of local approximations. We prove the ergodicity of our approximate Markov chain, showing that it samples asymptotically from the exact posterior distribution of interest. We describe variations of the algorithm that employ either local polynomial approximations or local Gaussian process regressors. Our theoretical results reinforce the key observation underlying this article: when the likelihood has some local regularity, the number of model evaluations per Markov chain Monte Carlo (MCMC) step can be greatly reduced without biasing the Monte Carlo average. Numerical experiments demonstrate multiple order-of-magnitude reductions in the number of forward model evaluations used in representative ordinary differential equation (ODE) and partial differential equation (PDE) inference problems, with both synthetic and real data. Supplementary materials for this article are available online.

97 MATHEMATICS AND COMPUTING↗

Systematics in asteroseismic modelling: application of a correlated noise model for oscillation frequencies

ABSTRACT The detailed modelling of stellar oscillations is a powerful approach to characterizing stars. However, poor treatment of systematics in theoretical models leads to misinterpretations of stars. Here, we propose a more principled statistical treatment for the systematics to be applied to fitting individual mode frequencies with a typical stellar model grid. We introduce a correlated noise model based on a Gaussian process (GP) kernel to describe the systematics given that mode frequency systematics are expected to be highly correlated. We show that tuning the GP kernel can reproduce general features of frequency variations for changing model input physics and fundamental parameters. Fits with the correlated noise model better recover stellar parameters than traditional methods that either ignore the systematics or treat them as uncorrelated noise.

Li, Tanda (ORCID:0000000163962563)↗

Probabilistic Solar Power Forecasting Using Bayesian Model Averaging

There is rising interest in probabilistic forecasting to mitigate risks from solar power uncertainty, but the numerical weather prediction (NWP) ensembles readily available to system operators are often biased and underdispersed. We propose a Bayesian model averaging (BMA) post-processing method suitable for forecasting power from utility-scale photovoltaic (PV) plants at multiple time horizons up to at least the day-ahead timescale. BMA is a kernel dressing technique for NWP ensembles in which the forecast is a weighted sum of member-specific probability density functions. We tailor BMA for utility-scale PV forecasting by modeling power clipping at the AC inverter rating and advance the theory of BMA with a new beta kernel parameterization that accommodates theoretical constraints not previously addressed. BMA is demonstrated for a case study of 11 utility-scale PV plants in Texas, forecasting at hourly resolution for the complete year 2018. BMA's mixture-model approach mitigates underdispersion of the raw ensemble to significantly improve forecast calibration, while consistently outperforming an ensemble model output statistics (EMOS) parametric approach from the literature. At 4-hour lead time, the BMA post-processing achieves continuous ranked probability skill scores of 2--36% over the raw ensemble, with consistent performance at multiple lead times suitable for power system operations.

14 SOLAR ENERGY↗

Optimizing Irregular Applications for Energy and Performance on the Tilera Many-core Architecture

Optimizing applications simultaneously for energy and performance is a complex problem. High performance, parallel, irregular applications are notoriously hard to optimize due to their data-dependent memory accesses, lack of structured locality and complex data structures and code patterns. Irregular kernels are growing in importance in applications such as machine learning, graph analytics and combinatorial scientific computing. Performance- and energy-efficient implementation of these kernels on modern, energy efficient, multicore and many-core platforms is therefore an important and challenging problem. We present results from optimizing two irregular applications { the Louvain method for community detection (Grappolo), and high-performance conjugate gradient (HPCCG) { on the Tilera many-core system. We have significantly extended MIT's OpenTuner auto-tuning framework to conduct a detailed study of platform-independent and platform-specific optimizations to improve performance as well as reduce total energy consumption. We explore the optimization design space along three dimensions: memory layout schemes, compiler-based code transformations, and optimization of parallel loop schedules. Using auto-tuning, we demonstrate whole node energy savings of up to 41% relative to a baseline instantiation, and up to 31% relative to manually optimized variants.

irregular applications, energy opttimization, many↗

POEK

POEK (Python Optimization Expression Kernel) is a Python library that supports the expression and manipulation of algebraic expressions commonly used in optimization applications. POEK interfaces with the COEK library to support fast methods for defining and managing expressions and performing automatic differentiation. POEK also interfaces with COEK to directly interface with optimization solvers (i.e. without relying on file I/O). SAND2019-14492 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Hart, William↗

Towards Efficient Uncertainty estimation in deep learning for robust energy prediction in crystal materials

In material science, recent studies have started to explore the potential of using deep learning to improve property prediction from high-fidelity simulations, e.g, density functional theory (DFT). However, the design spaces are sometimes too large and intractable to sample completely. This results in a critical question that is how to evaluate the confidence and robustness of the prediction. In this paper, we propose an efficient approach to estimate uncertainty in deep learning using a single forward pass and then apply it for robust prediction of the total energy in crystal lattice structures. Our approach is built upon the deep kernel learning (DKL) that originally introduces to leverage the expressiveness of deep neural networks as input with a probabilistic prediction of Gaussian processes (GPs) as output. Existing DKL methods have difficulties in the accuracy of predictive uncertainty, training stability, and scaling to large datasets, which lead to significant barriers in real-world applications. We propose to address these challenges by using an inducing point approximate GP in feature space combined with spectral normalization as a regularization. We finally demonstrate our robust performance on an artificial example and a real-world application from materials chemistry.

Bi, Sirui↗

Multiresolution quantum chemistry in multiwavelet bases: excited states from time-dependent Hartree–Fock and density functional theory via linear response

Using the fully numerical method for time-dependent Hartree–Fock and density functional theory (TD-HF/DFT) with the Tamm–Dancoff (TD) approximation we use a multiresolution analysis (MRA) approach to present our findings. From a reformulation with effective use of the density matrix operator, we obtain a general form of the HF/DFT linear response equation in the first quantization formalism. It can be readily rewritten as an integral equation with the bound-state Helmholtz (BSH) kernel for the Green's function. The MRA implementation of the resultant equation permits excited state calculations without virtual orbitals. Moreover, the integral equation is efficiently and adaptively solved using a numerical multiresolution solver with multiwavelet bases. Our implementation of the TD-HF/DFT methods is applied for calculating the excitation energies of H 2 , Be, N 2 , H 2 O, and C 2 H 4 molecules. The numerical errors of the calculated excitation energies converge in proportion to the residuals of the equation in the molecular orbitals and response functions. The energies of the excited states at a variety of length scales ranging from short-range valence excitations to long-range Rydberg-type ones are consistently accurate. It is shown that the multiresolution calculations yield the correct exponential asymptotic tails for the response functions, whereas those computed with Gaussian basis functions are too diffuse or decay too rapidly. Finally, we introduce a simple asymptotic correction to the local spin-density approximation (LSDA) so that in the TDDFT calculations, the excited states are correctly bound.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

FSISPH: An SPH formulation for impacts between dissimilar materials

Here, we present an SPH formulation with several new features designed to better model the fully-compressible interaction of dissimilar materials. We developed the new method to simulate the atmospheric entry and break-up of small celestial bodies in planetary atmospheres. The formulation uses a unity-based, density-energy discretization of the hydrodynamic conservation laws with linear-corrected kernel gradients. To account for variations in compressibility, we use an HLLC approximate Riemann solver to adjust the velocity gradient at material interfaces. To handle large transverse velocity discontinuities, we introduce a simple slip interface model that limits the artificial viscosity at material interfaces. Diffusion is optionally applied through the velocity gradient and this allows the density and specific thermal energy to evolve in a manner more consistent with the first law of thermodynamics in comparison to other more direct diffusion schemes. We also introduce a material-local second-order artificial conduction scheme used to smooth the specific thermal energy field. Material damage fits neatly under this framework by treating the damage front as a material interface. The method has been implemented as a solver, FSISPH, within the code, Spheral++, and is publicly available on github. We test our new solver on a number of classic shock, mixing, and multi-material problem. The components we outline can significantly improve accuracy of SPH for problems with sharp contact discontinuities.

79 ASTRONOMY AND ASTROPHYSICS↗