Search NASA⌕ Search

SEARCH · Search NASA

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 595 records · Page 33

Selective Recovery From Failures In A Task Parallel Programming Model

We present a fault tolerant task pool execution environment that is capable of performing fine-grain selective restart using a lightweight, distributed task completion tracking mechanism. Compared with conventional checkpoint/restart techniques, this system offers a recovery penalty that is proportional to the degree of failure rather than the system size. We evaluate this system using the Self Consistent Field (SCF) kernel which forms an important component in ab initio methods for computational chemistry. Experimental results indicate that fault tolerant task pools are robust in the presence of an arbitrary number of failures and that they offer low overhead in the absence of faults.

97 MATHEMATICS AND COMPUTING↗

eFESTA: Ensemble Feature Exploration with Surface Density Estimates

We propose surface density estimate (SDE) to model the spatial distribution of surface features-isosurfaces, ridge surfaces, and streamsurfaces-in 3D ensemble simulation data. The inputs of SDE computation are surface features represented as polygon meshes, and no field datasets are required (e.g., scalar fields or vector fields). The SDE is defined as the kernel density estimate of the infinite set of points on the input surfaces and is approximated by accumulating the surface densities of triangular patches. We also propose an algorithm to guide the selection of a proper kernel bandwidth for SDE computation. An ensemble Feature Exploration method based on Surface densiTy EstimAtes (eFESTA) is then proposed to extract and visualize the major trends of ensemble surface features. For an ensemble of surface features, each surface is first transformed into a density field based on its contribution to the SDE, and the resulting density fields are organized into a hierarchical representation based on the pairwise distances between them. The hierarchical representation is then used to guide visual exploration of the density fields as well as the underlying surface features. We demonstrate the application of our method using isosurface in ensemble scalar fields, Lagrangian coherent structures in uncertain unsteady flows, and streamsurfaces in ensemble fluid flows.

Computational modeling↗

Two-dimensional inverse planning and delivery with a preclinical image guided microirradiator

Purpose: Recent advances in preclinical radiotherapy systems have provided the foundation for scaling many of the elements of clinical radiation therapy practice to the dimensions and energy demanded in small animal studies. Such systems support the technical capabilities to accurately deliver highly complex dose distributions, but methods to optimize and deliver such distributions remain in their infancy. This study developed an optimization method based on empirically measured two-dimensional dose kernel measurements to deliver arbitrary planar dose distributions on a recently developed small animal radiotherapy platform.Methods: A two-dimensional dose kernel was measured with repeated radiochromic film measurements for the circular 1 mm diameter fixed collimator of the small animal radiotherapy system at 1 cm depth in a solid water phantom. This kernel was utilized in a sequential quadratic programming optimization framework to determine optimal beam positions and weights to deliver an arbitrary desired dose distribution. The positions and weights were then translated to a set of stage motions to automatically deliver the optimized dose distribution. End-to-end efficacy of the framework was quantified through five repeated deliveries of two dosimetric challenges: (1) a 5 mm radius bullseye distribution, and (2) a “sock” distribution contained within a 9 × 13 mm bounding box incorporating rectangular, semicircular, and exponentially decaying geometric constructs and a rectangular linear dose gradient region. These two challenges were designed to gauge targeting, geometric, and dosimetric fidelity.Results: Optimization of the bullseye and sock distributions required 2.1 and 5.9 min and utilized 50 and 77 individual beams for delivery, respectively. Automated delivery of the resulting optimized distributions, validated using radiochromic film measurements, revealed an average targeting accuracy of 0.32 mm, and a dosimetric delivery error along four line profiles taken through the sock distribution of 3.9%. Mean absolute delivery error across the 0–1 Gy linear dose gradient over 7.5 mm was 0.01 Gy.Conclusions: The work presented here demonstrates the potential for complex dose distributions to be planned and automatically delivered with millimeter scale heterogeneity at submillimeter accuracy. This capability establishes the technical foundation for preclinical validation of biologically guided radiotherapy investigations and development of unique radiobiological experiments.

61 RADIATION PROTECTION AND DOSIMETRY↗

Parameterized Micro-benchmarking: An Auto-tuning Approach for Complex Applications

Auto-tuning has emerged as an important practical method for creating highly optimized implementations of key computational kernels and applications. However, the growing complexity of architectures and applications is creating new challenges for auto-tuning. Complex applications can involve a prohibitively large search space that precludes empirical auto-tuning. Similarly, architectures are becoming increasingly complicated, making it hard to model performance. In this paper, we focus on the challenge to auto-tuning presented by applications with a large number of kernels and kernel instantiations. While these kernels may share a somewhat similar pattern, they differ considerably in problem sizes and the exact computation performed. We propose and evaluate a new approach to auto-tuning which we refer to as parameterized micro-benchmarking. It is an alternative to the two existing classes of approaches to auto-tuning: analytical model-based and empirical search-based. Particularly, we argue that the former may not be able to capture all the architectural features that impact performance, whereas the latter might be too expensive for an application that has several different kernels. In our approach, different expressions in the application, different possible implementations of each expression, and the key architectural features, are used to derive a simple micro-benchmark and a small parameter space. This allows us to learn the most significant features of the architecture that can impact the choice of implementation for each kernel. We have evaluated our approach in the context of GPU implementations of tensor contraction expressions encountered in excited state calculations in quantum chemistry. We have focused on two aspects of GPUs that affect tensor contraction execution: memory access patterns and kernel consolidation. Using our parameterized micro-benchmarking approach, we obtain a speedup of up to 2 over the version that used default optimizations, but no auto-tuning. We demonstrate that observations made from microbenchmarks match the behavior seen from real expressions. In the process, we make important observations about the memory hierarchy of two of the most recent NVIDIA GPUs, which can be used in other optimization frameworks as well.

auto-tuning↗

Improving the spatial dynamic range of digital inline particle holography

Digital in-line holography (DIH) has been proven to provide three-dimensional droplet position, size, and velocity distributions with a single-camera. This data is crucial for understanding multi-phase flows. In this work, we examine the performance of this diagnostic in the limit of very small particles, on the order of a pixel in diameter and smaller, and propose a post-processing method to improve them: Lanczos interpolation. The Lanczos interpolation kernel is the digital implementation of the Whittaker sinc filter, and strikes a compromise between maintaining the spatial frequency ceiling of the original digital image and computational cost of the interpolation. Without Lanczos interpolation, or super-sampling, the ultimate detectable particle size floor is on the order of 4 pixel widths. We show in this work that this limit can be reduced by 50% or more with super-sampling, depending upon the desired diameter accuracy, and examine the effect of super-sampling on the resulting accuracy of the extracted size and position of spherical particles. Extending this resolution limit increases the overall detection efficiency of the diagnostic. Since this increases the spatial dynamic range of the diagnostic, it can also allow a larger field-of-view to be captured with the same particle size floor.

47 OTHER INSTRUMENTATION↗

Improving Memory Error Handling Using Linux

As supercomputers continue to get faster and more powerful in the future, they will also have more nodes. If nothing is done, then the amount of memory in supercomputer clusters will soon grow large enough that memory failures will be unmanageable to deal with by manually replacing memory DIMMs. "Improving Memory Error Handling Using Linux" is a process oriented method to solve this problem by using the Linux kernel to disable (offline) faulty memory pages containing bad addresses, preventing them from being used again by a process. The process of offlining memory pages simplifies error handling and results in reducing both hardware and manpower costs required to run Los Alamos National Laboratory (LANL) clusters. This process will be necessary for the future of supercomputing to allow the development of exascale computers. It will not be feasible without memory error handling to manually replace the number of DIMMs that will fail daily on a machine consisting of 32-128 petabytes of memory. Testing reveals the process of offlining memory pages works and is relatively simple to use. As more and more testing is conducted, the entire process will be automated within the high-performance computing (HPC) monitoring software, Zenoss, at LANL.

97 MATHEMATICS AND COMPUTING↗

Advanced Visualization of Silent Error Propagation in HPC Applications

Last year, we refactored the major components of the SpotSDC visualization platform and added a visualization component for fault tolerance boundary. Also, we designed a new analysis framework to understand an application resiliency with a significantly less amount of samples compared to previous approaches. We evaluated the visualization platform and analysis framework for multiple critical HPC computation kernels and collected evidence for the effectiveness of the method developed.

97 MATHEMATICS AND COMPUTING↗

Advanced Visualization of Silent Error Propagation in HPC Applications

Last year, we refactored the major components of the SpotSDC visualization platform and added a visualization component for fault tolerance boundary. Also, we designed a new analysis framework to understand an application resiliency with a significantly less amount of samples compared to previous approaches. We evaluated the visualization platform and analysis framework for multiple critical HPC computation kernels and collected evidence for the effectiveness of the method developed. We published the findings of our research in the IEEE Transactions on Visualization and Computer Graphics (TVCG), the top journal in visualization. Moreover, we submitted a new paper, "Understanding a Program's Resiliency Through Error Propagation," to the PPOPP 2021 conference.

97 MATHEMATICS AND COMPUTING↗

Demonstration of Full Core Reactor Depletion with MPACT

MPACT is a three-dimensional (3-D) whole core transport code capable of generating sub-pin level power distributions. This feature is accomplished by obtaining the integral transport solutions to the heterogeneous reactor problem in which the actual detailed geometrical configuration of fuel components such as the pellet and cladding is modelled explicitly.. The cross section data needed for the neutron transport calculation are obtained directly from a multigroup microscopic cross section library similar to those used in lattice physics codes. Hence MPACT involves neither a priori homogenization nor group condensation for the core spatial solution. The integral transport solution is obtained by means of the method of characteristics (MOC) that employs discrete ray tracing. Since the direct application of the 3-D MOC capability in MPACT to 3-D core configuration requires considerable amounts of memory and computing time for practical reactor applications, an alternative approximate 3-D solution method was implemented in MPACT based on a 2D-1D approach which employs planar MOC solutions in the framework of the 3-D coarse mesh finite difference (CMFD) formulation. The axial coupling is resolved by one-dimensional (1-D) diffusion solutions and the planar and axial problems are coupled through the transverse leakage. The use of a lower order 1-D solution in the axial direction is justified by the fact that most heterogeneity in the core occurs in the radial direction rather than the axial. However, it is possible to use one of the higher order methods in MPACT such as the 1-D SN kernel if improved solution accuracy is desired. The CMFD formulation which originally served as an efficient nodal formulation is used in MPACT to accelerate the whole core transport calculation. The basic mesh in the CMFD formulation is a pin cell which is much coarser than the flat source regions defined for MOC calculations. The concept of dynamic homogenization of group constants for the pin cells provides the basis of the CMFD formulation in whole core transport calculation. The intra-cell flux distribution determined from the MOC calculation is used to generate the homogenized cell constants while the MOC cell surface averaged currents are used to determine the radial nodal coupling coefficients. This dynamic implementation of the equivalence theory formulation ensures the same transport solution is obtained with CMFD as the one obtained using unaccelerated MOC calculations alone. The ability of MPACT to predict the Hot, Zero Power (HZP) condition of a reactor was reported in CASL-U-2014-0045-000. The purpose of this report is to demonstrate the capability of MPACT to simulate the operation of a reactor at Hot, Full Power (HFP) conditions during normal operation throughout a full operating cycle. The time scale for a reactor burnup cycle is typically one to two years and therefore short time phenomena such as the effect of delayed neutrons can be neglected. Instead the time dependence can be treated quasi-statically using the depletion algorithm presented in CASL-U-2013-0276-001. The full power operation requires thermal hydraulic feedback to be present during the entire simulation which will utilize the work in CASL-U-2014-0051-000. However, due to the significant computational burden of the coupled physics simulation, a simplified thermal hydraulic model is used for the analysis reported here which is principally intended to demonstrate the full core neutronics depletion. In addition to the thermal hydraulic feedback, the effect of Boron 10 depletion should be modeled in cases where major boron additions are not performed for extended periods of time. Each of these capabilities will be described in the following sections.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

The intrinsic shape of Sagittarius A* at 3.5 mm wavelength

The radio emission from Sgr A{sup ∗} is thought to be powered by accretion onto a supermassive black hole of ∼4×10{sup 6} M{sub ⊙} at the Galactic Center. At millimeter wavelengths, Very Long Baseline Interferometry (VLBI) observations can directly resolve the bright innermost accretion region of Sgr A{sup ∗}. Motivated by the addition of many sensitive long baselines in the north–south direction, we developed a full VLBI capability at the Large Millimeter Telescope Alfonso Serrano (LMT). We successfully detected Sgr A{sup ∗} at 3.5 mm with an array consisting of six Very Long Baseline Array telescopes and the LMT. We model the source as an elliptical Gaussian brightness distribution and estimate the scattered size and orientation of the source from closure amplitude and self-calibration analysis, obtaining consistent results between methods and epochs. We then use the known scattering kernel to determine the intrinsic two-dimensional source size at 3.5 mm: (147±7 μas)×(120±12 μas), at position angle 88{sup ∘}±7{sup ∘} east of north. Finally, we detect non-zero closure phases on some baseline triangles, but we show that these are consistent with being introduced by refractive scattering in the interstellar medium and do not require intrinsic source asymmetry to explain.

79 ASTRONOMY AND ASTROPHYSICS↗

Application of the matrix exponential kernel

A point matrix kernel for radiation transport, developed by the transmission matrix method, has been used to develop buildup factors and energy spectra through slab layers of different materials for a point isotropic source. Combinations of lead-water slabs were chosen for examples because of the extreme differences in shielding properties of these two materials.

Rohach, A. F.↗

Analysis of a model for transport of charged particles in a random magnetic field

A model for the transport of charged particles in a random magnetic field is a Volterra integrodifferential equation with a long-range kernel. The integrodifferential equation is solved numerically with the method of Bellman, Kalaba, and Lockett (1966). The results are shown to be in excellent agreement with analytical asymptotic results.-

Hanson, F. B.↗

Improvement of the NOvA Near Detector Event Reconstruction and Primary Vertexing through the Application of Machine Learning Methods

The purpose of this work is to examine the application of a deep learning model in event reconstruction of neutrino interactions. The challenges faced in event reconstruction include the placement of an accurate primary neutrino interaction vertex which is used to support the particle track and prong algorithms. The result of accurate primary vertex ensures all particles involved in a neutrino interaction are included. We propose a regression-based Convolutional Neural Network (CNN) method to predict the primary vertex of a particle interaction. We show that with raw two-dimensional pixel map views as input, the regression-based CNN can predict the primary vertex in all three coordinates. This work is applied as part of the NOvA (NuMI Off-axis $\nu_e$ Appearance) near detector reconstruction efforts. The primary vertex predicted by the regression-based CNN model shows promising results for future applications. This deep learning method can be extended to secondary vertexing through a Kernel Density Estimate algorithm discussed in this work.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Gaussian process analysis of electron energy loss spectroscopy data: multivariate reconstruction and kernel control

Abstract Advances in hyperspectral imaging including electron energy loss spectroscopy bring forth the challenges of exploratory and physics-based analysis of multidimensional data sets. The multivariate linear unmixing methods generally explore similarities in the energy dimension, but ignore correlations in the spatial domain. At the same time, Gaussian process (GP) explicitly incorporate spatial correlations in the form of kernel functions but is computationally intensive. Here, we implement a GP method operating on the full spatial domain and reduced representations in the energy domain. In this multivariate GP, the information between the components is shared via a common spatial kernel structure, while allowing for variability in the relative noise magnitude or image morphology. We explore the role of kernel constraints on the quality of the reconstruction, and suggest an approach for estimating them from the experimental data. We further show that spatial information contained in higher-order components can be reconstructed and spatially localized.

36 MATERIALS SCIENCE↗

Linear response time-dependent density functional theory of the Hubbard dimer

The asymmetric Hubbard dimer is used to study the density-dependence of the exact frequency-dependent kernel of linear-response time-dependent density functional theory. The exact form of the kernel is given, and the limitations of the adiabatic approximation utilizing the exact ground-state functional are shown. The oscillator strength sum rule is proven for lattice Hamiltonians, and relative oscillator strengths are defined appropriately. The method of Casida for extracting oscillator strengths from a frequency-dependent kernel is demonstrated to yield the exact result with this kernel. An unambiguous way of labelling the nature of excitations is given. The fluctuation-dissipation theorem is proven for the ground-state exchange-correlation energy. The distinction between weak and strong correlation is shown to depend on the ratio of interaction to asymmetry. A simple interpolation between carefully defined weak-correlation and strong-correlation regimes yields a density-functional approximation for the kernel that gives accurate transition frequencies for both the single and double excitations, including charge-transfer excitations. In conclusion, many exact results, limits, and expansions about those limits are given in the Appendices.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Anelastic sensitivity kernels with parsimonious storage for adjoint tomography and full waveform inversion

We introduce a technique to compute exact anelastic sensitivity kernels in the time domain using parsimonious disk storage. The method is based on a reordering of the time loop of time-domain forward/adjoint wave propagation solvers combined with the use of a memory buffer. It avoids instabilities that occur when time-reversing dissipative wave propagation simulations. The total number of required time steps is unchanged compared to usual acoustic or elastic approaches. The cost is reduced by a factor of 4/3 compared to the case in which anelasticity is partially accounted for by accommodating the effects of physical dispersion. We validate our technique by performing a test in which we compare the Kα sensitivity kernel to the exact kernel obtained by saving the entire forward calculation. This benchmark confirms that our approach is also exact. We illustrate the importance of including full attenuation in the calculation of sensitivity kernels by showing significant differences with physical-dispersion-only kernels.

Geochemistry & Geophysics↗

Electronic nose with a new feature reduction method and a multi-linear classifier for Chinese liquor classification

An electronic nose (e-nose) was designed to classify Chinese liquors of the same aroma style. A new method of feature reduction which combined feature selection with feature extraction was proposed. Feature selection method used 8 feature-selection algorithms based on information theory and reduced the dimension of the feature space to 41. Kernel entropy component analysis was introduced into the e-nose system as a feature extraction method and the dimension of feature space was reduced to 12. Classification of Chinese liquors was performed by using back propagation artificial neural network (BP-ANN), linear discrimination analysis (LDA), and a multi-linear classifier. The classification rate of the multi-linear classifier was 97.22%, which was higher than LDA and BP-ANN. Finally the classification of Chinese liquors according to their raw materials and geographical origins was performed using the proposed multi-linear classifier and classification rate was 98.75% and 100%, respectively.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SELF-GRAVITATIONAL FORCE CALCULATION OF SECOND-ORDER ACCURACY FOR INFINITESIMALLY THIN GASEOUS DISKS IN POLAR COORDINATES

Investigating the evolution of disk galaxies and the dynamics of proto-stellar disks can involve the use of both a hydrodynamical and a Poisson solver. These systems are usually approximated as infinitesimally thin disks using two-dimensional Cartesian or polar coordinates. In Cartesian coordinates, the calculations of the hydrodynamics and self-gravitational forces are relatively straightforward for attaining second-order accuracy. However, in polar coordinates, a second-order calculation of self-gravitational forces is required for matching the second-order accuracy of hydrodynamical schemes. We present a direct algorithm for calculating self-gravitational forces with second-order accuracy without artificial boundary conditions. The Poisson integral in polar coordinates is expressed in a convolution form and the corresponding numerical complexity is nearly linear using a fast Fourier transform. Examples with analytic solutions are used to verify that the truncated error of this algorithm is of second order. The kernel integral around the singularity is applied to modify the particle method. The use of a softening length is avoided and the accuracy of the particle method is significantly improved.

79 ASTRONOMY AND ASTROPHYSICS↗