Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “kernel”

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 199 records · Page 11

Kernel learning backward SDE filter for data assimilation

In this paper, we develop a kernel learning backward SDE filter method to estimate the state of a stochastic dynamical system based on its partial noisy observations. A system of forward backward stochastic differential equations is used to propagate the state of the target dynamical model, and Bayesian inference is applied to incorporate the observational information. Further, to characterize the dynamical model in the entire state space, we introduce a kernel learning method to learn a continuous global approximation for the conditional probability density function of the target state by using discrete approximated density values as training data. Numerical experiments demonstrate that the kernel learning backward SDE is highly effective.

97 MATHEMATICS AND COMPUTING↗

A kernel machine method for detecting higher order interactions in multimodal datasets: Application to schizophrenia

Technological advances are enabling us to collect multimodal datasets at an increasing depth and resolution while with decreasing labors. Understanding complex interactions among multimodal datasets, however, is challenging. Here in this study, we tested the interaction effect of multimodal datasets using a novel method called the kernel machine for detecting higher order interactions among biologically relevant multimodal data. Using a semiparametric method on a reproducing kernel Hilbert space, we formulated the proposed method as a standard mixed-effects linear model and derived a score-based variance component statistic to test higher order interactions between multimodal datasets. The method was evaluated using extensive numerical simulation and real data from the Mind Clinical Imaging Consortium with both schizophrenia patients and healthy controls. Our method identified 13-triplets that included 6 gene-derived SNPs, 10 ROIs, and 6 gene-specific DNA methylations that are correlated with the changes in hippocampal volume, suggesting that these triplets may be important for explaining schizophrenia-related neurodegeneration. The performance of the proposed method is compared with the following methods: test based on only first and first few principal components followed by multiple regression, and full principal component analysis regression, and the sequence kernel association test. With strong evidence (p-value ≤0.000001), the triplet (MAGI2, CRBLCrus1.L, FBXO28) is a significant biomarker for schizophrenia patients. This novel method can be applicable to the study of other disease processes, where multimodal data analysis is a common task.

59 BASIC BIOLOGICAL SCIENCES↗

Measurement of kernel swelling and buffer densification in irradiated UCO-TRISO particles

Radiation-induced volume changes in the fuel kernels and buffer layers of UCO-TRISO particles irradiated to an average burnup of 16.1% FIMA have been determined. Measurements of particle dimensions were made on polished cross-sections of 56 irradiated particles at several different polish planes. The data were then analyzed to compute the equivalent spherical diameters of the kernels and the various coating layers, and these were compared to the average as-fabricated values to determine changes due to irradiation. Finally, the kernel volume was found to have increased by an average of 26 ± 6%. Buffer volume decreased by an average of 39 ± 2% due to densification.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Determination and verification of a 2D pencil-beam kernel for a radiosurgery system with cones

The quality and correctness of dosimetric data of small fields in stereotactic radiosurgery (SRS) depends significantly on the election of the detector employed in the measurements. This work provides an independent method of verification of these data through the determination of a polyenergetic 2-dimensional pencil-beam kernel for a BrainLAB SRS system with cones, employing the deconvolution/convolution of a reference experimental off-axis ratio (OAR) profile (cone diameter c{sub 0} = 35 mm). The kernel in real space k{sub c{sub 0}}(r,z{sub 0}) is convolved with the ideal fluence Φ for the cones 7.5 to 35 mm in diameter to obtain the OAR profiles, and the total scatter factors, S{sub t}, which are compared with experimental values of the same quantities. The experimental OARs and S{sub t} factors are measured in water with a PTW 60003 diamond detector. Additionally, the reference OAR is corrected for beam divergence and spectral fluence fluctuations defining a function of boundary correction factors (BF). The BF and Φ functions are transformed to the conjugate space with the zeroth-order Hankel transform, appropriated to the radial symmetry of the cones. Therefore, the kernel in real space k{sub c{sub 0}}(r,z{sub 0}) is the inverse Hankel transform of the ratio of the Hankel transforms of BF and Φ. Finally, an uncertainty analysis according to the Guide to the Expression of Uncertainty in Measurement is carried out for 3 different values of k{sub c{sub 0}}(r,z{sub 0}). Calculated and measured OARs agree within the dose/distance-to-agreement criteria of 2%/0.12 mm; while, S{sub t} factors agree within 2%. This procedure supplies an independent method to validate the dosimetric data necessary to feed treatment planning systems for SRS with cones.

61 RADIATION PROTECTION AND DOSIMETRY↗

Kernel functions and Baecklund transformations for relativistic Calogero-Moser and Toda systems

We obtain kernel functions associated with the quantum relativistic Toda systems, both for the periodic version and for the nonperiodic version with its dual. This involves taking limits of previously known results concerning kernel functions for the elliptic and hyperbolic relativistic Calogero-Moser systems. We show that the special kernel functions at issue admit a limit that yields generating functions of Baecklund transformations for the classical relativistic Calogero-Moser and Toda systems. We also obtain the nonrelativistic counterparts of our results, which tie in with previous results in the literature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Relativistic four-component calculations of indirect nuclear spin-spin couplings with efficient evaluation of the exchange-correlation response kernel

In this work, we report on the development and implementation of a new scheme for efficient calculation of indirect nuclear spin-spin couplings in the framework of four-component matrix Dirac-Kohn-Sham approach termed matrix Dirac-Kohn-Sham restricted magnetic balance resolution of identity for J and K, which takes advantage of the previous restricted magnetic balance formalism and the density fitting approach for the rapid evaluation of density functional theory exchange-correlation response kernels. The new approach is aimed to speedup the bottleneck in the solution of the coupled perturbed equations: evaluation of the matrix elements of the kernel of the exchange-correlation potential. The performance of the new scheme has been tested on a representative set of indirect nuclear spin-spin couplings. The obtained results have been compared with the corresponding results of the reference method with traditional evaluation of the exchange-correlation kernel, i.e., without employing the fitted electron densities. Overall good agreement between both methods was observed, though the new approach tends to give values by about 4%-5% higher than the reference method. On the average, the solution of the coupled perturbed equations with the new scheme is about 8.5 times faster compared to the reference method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reconstructing the adiabatic exchange-correlation kernel of time-dependent density-functional theory

The interacting and the Kohn-Sham static density-density response functions for different one-dimensional two-electron singlet systems are reconstructed numerically. From their inverse we obtain the exact static exchange-correlation kernel. This quantity represents the adiabatically exact approximation of the frequency-dependent exchange-correlation kernel that is crucial for time-dependent linear density-response theory. We investigate its performance for nonlocal perturbations and analyze its sum rule properties. We also compute the adiabatically exact transition energies that follow from the static kernel within linear-response theory.

74 ATOMIC AND MOLECULAR PHYSICS↗

Phenomenological memory-kernel master equations and time-dependent Markovian processes

Do phenomenological master equations with a memory kernel always describe a non-Markovian quantum dynamics characterized by reverse flow of information? Is the integration over the past states of the system an unmistakable signature of non-Markovianity? We show by a counterexample that this is not always the case. We consider two commonly used phenomenological integro-differential master equations describing the dynamics of a spin 1/2 in a thermal bath. By using a recently introduced measure to quantify non-Markovianity [Breuer et al., Phys. Rev. Lett. 103, 210401 (2009)] we demonstrate that as far as the equations retain their physical sense, the key feature of non-Markovian behavior does not appear in the considered memory kernel master equations. Namely, there is no reverse flow of information from the environment to the open system. Therefore, the assumption that the integration over a memory kernel always leads to a non-Markovian dynamics turns out to be vulnerable to phenomenological approximations. Instead, the considered phenomenological equations are able to describe time-dependent and unidirectional information flow from the system to the reservoir associated with time-dependent Markovian processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A High-Throughput Solver for Marginalized Graph Kernels on GPU

Here, we present the design and optimization of a solver for efficient and high-throughput computation of the marginalized graph kernel on General Purpose GPUs. The graph kernel is computed using the conjugate gradient method to solve a generalized Laplacian of the tensor product between a pair of graphs. To cope with the large gap between the instruction throughput and the memory bandwidth of the GPUs, our solver forms the graph tensor product on-the-fly without storing it in memory. This is achieved by using threads in a warp cooperatively to stream the adjacency and edge label matrices of individual graphs by small square matrix blocks called tiles, which are then staged in registers and the shared memory for later reuse. Warps across a thread block can further share tiles via the shared memory to increase data reuse. We exploit the sparsity of the graphs hierarchically by storing only non-empty tiles using a coordinate format and nonzero elements within each tile using bitmaps. We propose a new partition-based reordering algorithm for aggregating nonzero elements of the graphs into fewer but denser tiles to further exploit sparsity. We carry out extensive theoretical analyses on the graph tensor product primitives for tiles of various density and evaluate their performance on synthetic and real-world datasets. Our solver delivers three to four orders of magnitude speedup over existing CPU-based solvers such as GraKeL and GraphKernels. The capability of the solver enables kernel-based learning tasks at unprecedented scales.

97 MATHEMATICS AND COMPUTING↗

Fault Detection via Occupation Kernel Principal Component Analysis

Reliable operation of automatic systems is heavily dependent on the ability to detect faults in the underlying dynamics. While traditional model-based methods have been widely used for fault detection, data-driven approaches have garnered increasing attention due to their ease of deployment and minimal need for expert knowledge. In this letter, we present a novel principal component analysis (PCA) method that uses occupation kernels. Occupation kernels result in feature maps that are tailored to the measured data, have inherent noise-robustness due to the use of integration, and can utilize irregularly sampled system trajectories of variable lengths for PCA. The occupation kernel PCA method is used to develop a reconstruction error approach to fault detection and its efficacy is validated using numerical simulations.

42 ENGINEERING↗

A system for intensity modulated dose plan verification based on an experimental pencil beam kernel obtained by deconvolution

The number of intensity modulated radiation therapy (IMRT) procedures is continuously growing worldwide and it is necessary to develop tools for patient specific quality assurance (QA) that avoid using machine time that could be employed in treating additional patients. One way of achieving this goal is to perform a multileaf collimator quality assurance periodically in the linear accelerator and check the treatment planning system (TPS) calculation by employing an independent calculation system. Within the work frame of the pencil beam kernel approach, a new system was developed for obtaining an experimental kernel. This new technique is based on a deconvolution procedure using the Hankel transform. The resulting kernel is obtained in a way completely independent of those employed in commercial treatment planning systems, usually calculated by Monte Carlo simulations. Also provided are comparisons between calculated and measured doses with radiographic film, linear array of diodes, and ionization chamber. Measurements taken in polystyrene and water for clinical IMRT plans demonstrate that this method can calculate IMRT dose distributions, as well as treatment times, with great accuracy. Apart from other applications, it can be used as a double-check algorithm for IMRT QA.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Ultrafast convolution/superposition using tabulated and exponential kernels on GPU

Purpose: Collapsed-cone convolution/superposition (CCCS) dose calculation is the workhorse for IMRT dose calculation. The authors present a novel algorithm for computing CCCS dose on the modern graphic processing unit (GPU). Methods: The GPU algorithm includes a novel TERMA calculation that has no write-conflicts and has linear computation complexity. The CCCS algorithm uses either tabulated or exponential cumulative-cumulative kernels (CCKs) as reported in literature. The authors have demonstrated that the use of exponential kernels can reduce the computation complexity by order of a dimension and achieve excellent accuracy. Special attentions are paid to the unique architecture of GPU, especially the memory accessing pattern, which increases performance by more than tenfold. Results: As a result, the tabulated kernel implementation in GPU is two to three times faster than other GPU implementations reported in literature. The implementation of CCCS showed significant speedup on GPU over single core CPU. On tabulated CCK, speedups as high as 70 are observed; on exponential CCK, speedups as high as 90 are observed. Conclusions: Overall, the GPU algorithm using exponential CCK is 1000-3000 times faster over a highly optimized single-threaded CPU implementation using tabulated CCK, while the dose differences are within 0.5% and 0.5 mm. This ultrafast CCCS algorithm will allow many time-sensitive applications to use accurate dose calculation.

61 RADIATION PROTECTION AND DOSIMETRY↗

Fast generation of sparse random kernel graphs

The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in time at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.

97 MATHEMATICS AND COMPUTING↗

Connectivity from a different perspective: comparing seed dispersal kernels in connected vs. unfragmented landscapes

Habitat fragmentation can create significant impediments to dispersal. A technique to increase dispersal between otherwise isolated fragments is the use of corridors. Although previous studies have compared dispersal between connected fragments to dispersal between unconnected fragments, it remains unknown how dispersal between fragments connected by a corridor compares to dispersal in unfragmented landscapes. To assess the extent to which corridors can restore dispersal in fragmented landscapes to levels observed in unfragmented landscapes, we employed a stable‐isotope marking technique to track seeds within four unfragmented landscapes and eight experimental landscapes with fragments connected by corridors. We studied two wind‐ and two bird‐dispersed plant species, because previous community‐based research showed that dispersal mode explains how connectivity effects vary among species. We constructed dispersal kernels for these species in unfragmented landscapes and connected fragments by marking seeds in the center of each landscape with 15 N and then recovering marked seeds in seed traps at distances up to 200 m. For the two wind‐dispersed plants, seed dispersal kernels were similar in unfragmented landscapes and connected fragments. In contrast, dispersal kernels of bird‐dispersed seeds were both affected by fragmentation and differed in the direction of the impact: Morella cerifera experienced more and Rhus copallina experienced less long‐distance dispersal in unfragmented than in connected landscapes. These results show that corridors can facilitate dispersal probabilities comparable to those observed in unfragmented landscapes. Although dispersal mode may provide useful broad predictions, we acknowledge that similar species may respond uniquely due to factors such as seasonality and disperser behavior. Furthermore, our results further indicate that prior work has likely underestimated dispersal distances of wind‐dispersed plants and that factors altering long‐distance dispersal may have a greater impact on the spread of species than previously thought.

60 APPLIED LIFE SCIENCES↗

Fabrication of UN microsphere kernels for Fully Ceramic Microencapsulated fuel

Fully Ceramic Microencapsulated (FCM) fuel is of interest to the U.S. Department of Energy's Fuel Cycle Research and Development program as an Accident Tolerant Fuel (ATF). The FCM design uses a TRISO (Tri-Structural Isotropic) particle with a ZrO{sub 2} surrogate kernel, embedded in a dense SiC matrix. TRISO technology, originally developed for High Temperature Gas Reactors, has an established high level of performance retaining fission products and the SiC matrix of an FCM compact shows good steam oxidation behavior. This work reports on a fabrication route for producing dense UN microspheres used as the kernel of the TRISO particles in FCM fuel. The UN microspheres are of high purity and density with enough porosity to accommodate volatile fission products. Increasing the density is nevertheless of interest potentially allowing for an additional adjustable property for optimizing the fuel kernel and TRISO particle characteristics. Current work is focused on investigating the effect of a feedstock microstructure on final product density. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Calculation of the Trubnikov and Nanbu Collision Kernels: Implications for Numerical Modeling of Coulomb Collisions

We investigate the accuracy of and assumptions underlying the numerical binary Monte-Carlo collision operator due to Nanbu [K. Nanbu, Phys. Rev. E 55 (1997)]. The numerical experiments that resulted in the parameterization of the collision kernel used in Nanbu's operator are argued to be an approximate realization of the Coulomb-Lorentz pitch-angle scattering process, for which an analytical solution for the collision kernel is available. It is demonstrated empirically that Nanbu's collision operator quite accurately recovers the effects of Coulomb-Lorentz pitch-angle collisions, or processes that approximate these (such interspecies Coulomb collisions with very small mass ratio) even for very large values of the collisional time step. An investigation of the analytical solution shows that Nanbu's parameterized kernel is highly accurate for small values of the normalized collision time step, but loses some of its accuracy for larger values of the time step. Careful numerical and analytical investigations are presented, which show that the time dependence of the relaxation of a temperature anisotropy by Coulomb-Lorentz collisions has a richer structure than previously thought, and is not accurately represented by an exponential decay with a single decay rate. Finally, a practical collision algorithm is proposed that for small-mass-ratio interspecies Coulomb collisions improves on the accuracy of Nanbu's algorithm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A neural network‐enhanced reproducing kernel particle method for modeling strain localization

Abstract Modeling the localized intensive deformation in a damaged solid requires highly refined discretization for accurate prediction, which significantly increases the computational cost. Although adaptive model refinement can be employed for enhanced effectiveness, it is cumbersome for the traditional mesh‐based methods to perform while modeling the evolving localizations. In this work, neural network‐enhanced reproducing kernel particle method (NN‐RKPM) is proposed, where the location, orientation, and shape of the solution transition near a localization is automatically captured by the NN approximation via a block‐level neural network (NN) optimization. The weights and biases in the blocked parameterization network control the location and orientation of the localization. The designed basic four‐kernel NN block is capable of capturing a triple junction or a quadruple junction topological pattern, while more complicated localization topological patters are captured by the superposition of multiple four‐kernel NN blocks. The standard RK approximation is then utilized to approximate the smooth part of the solution, which permits a much coarser discretization than the high‐resolution discretization needed to capture sharp solution transitions with the conventional methods. A regularization of the NN approximation is additionally introduced for discretization‐independent material responses. The effectiveness of the proposed NN‐RKPM is verified by a series of numerical verifications.

Baek, Jonghyuk↗

Renormalization and matching for the Collins-Soper kernel from lattice QCD

The Collins-Soper kernel, which governs the energy evolution of transverse- momentum dependent parton distribution functions (TMDPDFs), is required to accurately predict Drell-Yan like processes at small transverse momentum, and is a key ingredient for extracting TMDPDFs from experiment. Earlier we proposed a method to calculate this kernel from ratios of the so-called quasi-TMDPDFs determined with lattice QCD, which are defined as hadronic matrix elements of staple-shaped Euclidean Wilson line operators. Here we provide the one-loop renormalization of these operators in a regularization-independent momentum subtraction (RI'/MOM) scheme, as well as the conversion factor from the RI'/MOM-renormalized quasi-TMDPDF to the \( \overline{\mathrm{MS}} \) scheme. We also propose a procedure for calculating the Collins-Soper kernel directly from position space correlators, which simplifies the lattice determination.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗