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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 541 records · Page 30

All sources NASA NTRS DOE OSTI

DOE OSTI2018

Outlier analyses of the Protein Data Bank archive using a probability-density-ranking approach

Outlier analyses are central to scientific data assessments. Conventional outlier identification methods do not work effectively for Protein Data Bank (PDB) data, which are characterized by heavy skewness and the presence of bounds and/or long tails. We have developed a data-driven nonparametric method to identify outliers in PDB data based on kernel probability density estimation. Unlike conventional outlier analyses based on location and scale, Probability Density Ranking can be used for robust assessments of distance from other observations. Analyzing PDB data from the vantage points of probability and frequency enables proper outlier identification, which is important for quality control during deposition-validation-biocuration of new three-dimensional structure data. Ranking of Probability Density also permits use of Most Probable Range as a robust measure of data dispersion that is more compact than Interquartile Range. The Probability-Density-Ranking approach can be employed to analyze outliers and data-spread on any large data set with continuous distribution.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2014

TH-A-18C-09: Ultra-Fast Monte Carlo Simulation for Cone Beam CT Imaging of Brain Trauma

Purpose: Application of cone-beam CT (CBCT) to low-contrast soft tissue imaging, such as in detection of traumatic brain injury, is challenged by high levels of scatter. A fast, accurate scatter correction method based on Monte Carlo (MC) estimation is developed for application in high-quality CBCT imaging of acute brain injury. Methods: The correction involves MC scatter estimation executed on an NVIDIA GTX 780 GPU (MC-GPU), with baseline simulation speed of ~1e7 photons/sec. MC-GPU is accelerated by a novel, GPU-optimized implementation of variance reduction (VR) techniques (forced detection and photon splitting). The number of simulated tracks and projections is reduced for additional speed-up. Residual noise is removed and the missing scatter projections are estimated via kernel smoothing (KS) in projection plane and across gantry angles. The method is assessed using CBCT images of a head phantom presenting a realistic simulation of fresh intracranial hemorrhage (100 kVp, 180 mAs, 720 projections, source-detector distance 700 mm, source-axis distance 480 mm). Results: For a fixed run-time of ~1 sec/projection, GPU-optimized VR reduces the noise in MC-GPU scatter estimates by a factor of 4. For scatter correction, MC-GPU with VR is executed with 4-fold angular downsampling and 1e5 photons/projection, yielding 3.5 minute run-time per scan, and de-noised with optimized KS. Corrected CBCT images demonstrate uniformity improvement of 18 HU and contrast improvement of 26 HU compared to no correction, and a 52% increase in contrast-tonoise ratio in simulated hemorrhage compared to “oracle” constant fraction correction. Conclusion: Acceleration of MC-GPU achieved through GPU-optimized variance reduction and kernel smoothing yields an efficient (<5 min/scan) and accurate scatter correction that does not rely on additional hardware or simplifying assumptions about the scatter distribution. The method is undergoing implementation in a novel CBCT dedicated to brain trauma imaging at the point of care in sports and military applications. Research grant from Carestream Health. JY is an employee of Carestream Health.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2011

Image filtering as an alternative to the application of a different reconstruction kernel in CT imaging: Feasibility study in lung cancer screening

Purpose: While the acquisition of projection data in a computed tomography (CT) scanner is generally carried out once, the projection data is often removed from the system, making further reconstruction with a different reconstruction filter impossible. The reconstruction kernel is one of the most important parameters. To have access to all the reconstructions, either prior reconstructions with multiple kernels must be performed or the projection data must be stored. Each of these requirements would increase the burden on data archiving. This study aimed to design an effective method to achieve similar image quality using an image filtering technique in the image space, instead of a reconstruction filter in the projection space for CT imaging. The authors evaluated the clinical feasibility of the proposed method in lung cancer screening. Methods: The proposed technique is essentially the same as common image filtering, which performs processing in the spatial-frequency domain with a filter function. However, the filter function was determined based on the quantitative analysis of the point spread functions (PSFs) measured in the system. The modulation transfer functions (MTFs) were derived from the PSFs, and the ratio of the MTFs was used as the filter function. Therefore, using an image reconstructed with a kernel, an image reconstructed with a different kernel was obtained by filtering, which used the ratio of the MTFs obtained for the two kernels. The performance of the method was evaluated by using routine clinical images obtained from CT screening for lung cancer in five subjects. Results: Filtered images for all combinations of three types of reconstruction kernels (''smooth,''''standard,'' and ''sharp'' kernels) showed good agreement with original reconstructed images regarded as the gold standard. On the filtered images, abnormal shadows suspected as being lung cancers were identical to those on the reconstructed images. The standard deviations (SDs) for the difference between filtered images and reconstructed images ranged from 1.9 to 23.5 Hounsfield units for all kernel combinations; these SDs were much smaller than the noise SDs in the reconstructed images. Conclusions: The proposed method has good performance and is clinically feasible in lung cancer screening. This method can be applied to images reconstructed on any scanner by measuring the PSFs in each system.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

DOE OSTI2013

Adjoint design sensitivity analysis of reduced atomic systems using generalized Langevin equation for lattice structures

An efficient adjoint design sensitivity analysis method is developed for reduced atomic systems. A reduced atomic system and the adjoint system are constructed in a locally confined region, utilizing generalized Langevin equation (GLE) for periodic lattice structures. Due to the translational symmetry of lattice structures, the size of time history kernel function that accounts for the boundary effects of the reduced atomic systems could be reduced to a single atom’s degrees of freedom. For the problems of highly nonlinear design variables, the finite difference method is impractical for its inefficiency and inaccuracy. However, the adjoint method is very efficient regardless of the number of design variables since one additional time integration is required for the adjoint GLE. Through numerical examples, the derived adjoint sensitivity turns out to be accurate and efficient through the comparison with finite difference sensitivity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2016

Hybrid PSO-ASVR-based method for data fitting in the calibration of infrared radiometer

The present paper describes a hybrid particle swarm optimization-adaptive support vector regression (PSO-ASVR)-based method for data fitting in the calibration of infrared radiometer. The proposed hybrid PSO-ASVR-based method is based on PSO in combination with Adaptive Processing and Support Vector Regression (SVR). The optimization technique involves setting parameters in the ASVR fitting procedure, which significantly improves the fitting accuracy. However, its use in the calibration of infrared radiometer has not yet been widely explored. Bearing this in mind, the PSO-ASVR-based method, which is based on the statistical learning theory, is successfully used here to get the relationship between the radiation of a standard source and the response of an infrared radiometer. Main advantages of this method are the flexible adjustment mechanism in data processing and the optimization mechanism in a kernel parameter setting of SVR. Numerical examples and applications to the calibration of infrared radiometer are performed to verify the performance of PSO-ASVR-based method compared to conventional data fitting methods.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2022

Next-Cycle Optimal Dilute Combustion Control via Online Learning of Cycle-to-Cycle Variability Using Kernel Density Estimators

Dilute combustion using exhaust gas recirculation (EGR) presents a cost-effective method for increasing the efficiency of spark-ignition (SI) engines. However, the maximum amount of EGR that can be used at a given condition is limited by a rapid increment of cycle-to-cycle variability (CCV). This study describes a methodology to design a model-based stochastic optimal controller to adjust the cycle-to-cycle fuel injection quantity in order to reduce CCV and further extend the dilute limit. Given the complexity and chaotic nature of combustion events, the controller was enhanced with online learning in order to identify the statistical properties of combustion efficiency, which are needed to generate predictions for next-cycle events. This study showed that a kernel density estimator (KDE) can be used to learn the combustion properties in real time and can be incorporated into the feedback policy in order to calculate the optimal control command. Experimental results suggested that the dilute limit can be extended from 18.5% to 21% EGR fraction at an operating condition relevant for highway cruising. Additionally, the proposed controller can achieve a large CCV reduction with less fuel enrichment compared to previous methods, overall contributing to an increase in 0.2% indicated fuel conversion efficiency.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2015

SU-E-T-74: A Simple Model of Dose Falloff for Highly Convergent SBRT Beams

Purpose: The purpose of this study was to create a simple model of dose falloff outside the target for a SBRT system employing a highly convergent beam geometry. With an estimate of the rate of reduction in dose away from a target of a given size, dose to tissues at a given distance from the target can be estimated. Our hypothesis is that dose at a given distance away from the edge of a target can be approximated using an inverse square model. Methods: With the GammaPod™ system used for this study, thirty-six rotating Co-60 beams with circular cross section converge at an isocenter and then diverge distal to the isocenter. Dose falloff beyond the target is mainly due to reduction in beam overlap, which in turn depends on projected area of all beams and projected beam area swept out during rotation. Beams also decrease in intensity beyond the isocenter. The GammaPod™ TPS calculates dose via superposition of Monte Carlo-generated kernels, each corresponding to the convergence of beams at an isocenter within a stereotactic breast cup. Results: The factors above yield a simple inverse square-based model that has been compared with TPS predictions and measurements for a variety of targets. Good agreement is seen considering the simple nature of the model. Fitting of the treatment planning and measured dose falloff data with a power law expression yields a negative exponent close to 2, confirming the inverse square nature of dose falloff. Conclusion: It is possible to apply a simple inverse square dose falloff model for SBRT or SRS systems such as the GammaPod which employ a highly-convergent beam geometry. This can be useful in estimating the “worst case scenario” for dose to critical organs at a known distance from the edge of the target volume. Authors are employees of Xcision Medical Systems.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2015

Efficient approach to obtain free energy gradient using QM/MM MD simulation

The efficient computational approach denoted as charge and atom dipole response kernel (CDRK) model to consider polarization effects of the quantum mechanical (QM) region is described using the charge response and the atom dipole response kernels for free energy gradient (FEG) calculations in the quantum mechanical/molecular mechanical (QM/MM) method. CDRK model can reasonably reproduce energies and also energy gradients of QM and MM atoms obtained by expensive QM/MM calculations in a drastically reduced computational time. This model is applied on the acylation reaction in hydrated trypsin-BPTI complex to optimize the reaction path on the free energy surface by means of FEG and the nudged elastic band (NEB) method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

General field evaluation in high-order meshes on GPUs

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes, and Lagrangian particle tracking. This is a challenging problem, particularly for high-order unstructured meshes partitioned in parallel with MPI, as it requires identifying the element that overlaps a given point and computing the corresponding reference space coordinates. Here, we present a robust and efficient technique for general field evaluation in large-scale high-order meshes with quadrilaterals and hexahedra. In the proposed method, a combination of globally partitioned and processor-local maps are used to first determine a list of candidate MPI ranks, and then locally candidate elements that could contain a given point. Next, element-wise bounding boxes further reduce the list of candidate elements. Finally, Newton’s method with trust region is used to determine the overlapping element and corresponding reference space coordinates. Since GPU-based architectures have become popular for accelerating computational analyses using meshes with tensor-product elements, specialized kernels have been developed to utilize the proposed methodology on GPUs. The method is also extended to enable general field evaluation on surface meshes. The paper concludes by demonstrating the use of the proposed method in various applications ranging from mesh-to-mesh transfer during r-adaptivity to Lagrangian particle tracking.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

New approach to folding with the Coulomb wave function

Due to the long-range character of the Coulomb interaction theoretical description of low-energy nuclear reactions with charged particles still remains a formidable task. One way of dealing with the problem in an integral-equation approach is to employ a screened Coulomb potential. A general approach without screening requires folding of kernels of the integral equations with the Coulomb wave. A new method of folding a function with the Coulomb partial waves is presented. The partial-wave Coulomb function both in the configuration and momentum representations is written in the form of separable series. Each term of the series is represented as a product of a factor depending only on the Coulomb parameter and a function depending on the spatial variable in the configuration space and the momentum variable if the momentum representation is used. Using a trial function, the method is demonstrated to be efficient and reliable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2016

Minimum local distance density estimation

We present a local density estimator based on first-order statistics. To estimate the density at a point, $x$, the original sample is divided into subsets and the average minimum sample distance to $x$ over all such subsets is used to define the density estimate at $x$. The tuning parameter is thus the number of subsets instead of the typical bandwidth of kernel or histogram-based density estimators. The proposed method is similar to nearest-neighbor density estimators but it provides smoother estimates. We derive the asymptotic distribution of this minimum sample distance statistic to study globally optimal values for the number and size of the subsets. Simulations are used to illustrate and compare the convergence properties of the estimator. The results show that the method provides good estimates of a wide variety of densities without changes of the tuning parameter, and that it offers competitive convergence performance.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

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↗

DOE OSTI2013

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↗

DOE OSTI2012

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↗

DOE OSTI2018

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↗

DOE OSTI2014

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↗

DOE OSTI2020

Advanced Visualization of Silent Error Propagation in HPC Applications

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

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↗