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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Insights into the spurious long-range nature of local rs-dependent non-local exchange-correlation kernels

A systematic route to go beyond the exact exchange plus random phase approximation (RPA) is to include a physical exchange-correlation kernel in the adiabatic-connection fluctuation-dissipation theorem. Previously, [D. Lu, J. Chem. Phys. 140, 18A520 (2014)], we found that non-local kernels with a screening length depending on the local Wigner-Seitz radius, r s (r), suffer an error associated with a spurious long-range repulsion in van der Waals bounded systems, which deteriorates the binding energy curve as compared to RPA. Here, we analyze the source of the error and propose to replace r s (r) by a global, average r s in the kernel. Exemplary studies with the Corradini, del Sole, Onida, and Palummo kernel show that while this change does not affect the already outstanding performance in crystalline solids, using an average r s significantly reduces the spurious long-range tail in the exchange-correlation kernel in van der Waals bounded systems. Finally, when this method is combined with further corrections using local dielectric response theory, the binding energy of the Kr dimer is improved three times as compared to RPA.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Risk Reduction of CO 2 Storage with Stochastic Simulations

The purpose of this project was to create an efficient and flexible tool based on principal component analysis (PCA) for a generation of differentiable realizations of porosity and permeability fields. Of particular interest were data which had significant connectivity between patches of the same rock type, which is called “binary”. The efficiency requirement needed a so called kernel PCA, and the binary images were found with the method called optimization based PCA (OPCA) for which interpretation is provided. The ability to honor given data at particular locations is also incorporated. The tool worked very well and efficiently for two dimensional (2-D) simulations. Furthermore, the tool was applied to a three-dimensional (3-D) dataset and determined that conditioning can be used to maintain the connectivity between vertical layers.

47 OTHER INSTRUMENTATION↗
DOE OSTI2015

TU-F-CAMPUS-I-05: Parameterization of the Noise Power Spectrum in X-Ray Computed Tomography

Purpose: The purpose of this work was to develop a method so that the noise power spectrum (NPS) can be approximated for arbitrary levels of mAs, from a single determination in CT. Methods: The NPS is factorized into 2 components, 1) a parameterized function representing the 1D normalized spatial frequency distribution and 2) a function to scale the magnitude of 1) for arbitrary values of mAs. The 1D NPS, normalized by image variance (NNPS), was determined for 2 FBP reconstruction kernels (smoothing and edge enhancing) for 400 mAs. The NNPS were fit to the parameterized function and a scaling function was established to approximate the image variance at arbitrary values of mAs. Using the root mean square error normalized by the maximum value (NRMSE), the NPS approximated with the factorization method was compared to the NPS determined at 5 different mAs levels. Results: The factorization resulted in a set of 7 coefficients that can be used to approximate the 1D NPS, for arbitrary levels of mAs, for the convolution kernels studied in this work. The approximated NPS (factorization) agreed well with the determined NPS for all mAs levels. The greatest NRMSE was 0.02 and was observed for the edge enhancing kernel. Conclusion: The proposed factorization method has been demonstrated as applicable for FBP reconstruction. It can be used to approximate the 1D NPS for arbitrary levels of mAs, from a single NPS determination. Furthermore, approximations of the 1D NPS can conveniently be distributed since the factorization method only used 7 coefficients in the approximation.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2012

Determining the effects of microsphere and surrounding material composition on {sup 90}Y dose kernels using egsnrc and mcnp5

Purpose: Recent advances in the imaging of {sup 90}Y using positron emission tomography (PET) and improved uncertainty in the branching ratio for the internal pair production component of {sup 90}Y decay allow for a more accurate determination of the activity distribution of {sup 90}Y microspheres within a patient. This improved activity distribution can be convolved with the dose kernel of {sup 90}Y to calculate the dose distribution within a patient. This work investigates the effects of microsphere and surrounding material composition on {sup 90}Y dose kernels using egsnrc and mcnp5 and compares the results of these two transport codes. Methods: Monte Carlo simulations were performed with egsnrc and mcnp5 to calculate the dose rate at multiple radial distances around various {sup 90}Y sources. Point source simulations were completed with mcnp5 to determine the optimal electron transport settings for this work. After determining the optimal settings, point source simulations were completed using egsnrc (user code edknrc) and mcnp5 in water and liver [as defined by the International Commission on Radiation Units and Measurements (ICRU) Report 44]. The results were compared to ICRU Report 72 reference data. Point source simulations were also completed in water with a density of 1.06 g{center_dot}cm{sup -3} to evaluate the effect of the density of the surrounding material. Glass and resin microsphere simulations were performed with average and maximum diameter and density values (based on values given in the literature) in water and in liver. The results were compared to point source simulation results using the same transport code and in the same surrounding material. All simulations had statistical uncertainties less than 1%. Results: The optimal transport settings in mcnp5 for this work included using the energy-and step-specific algorithm (DBCN 17J 2) and ESTEP set to 10. These settings were used for all subsequent simulations with mcnp5. The point source simulations in water for both egsnrc and mcnp5 were found to agree within 2% of the ICRU 72 reference data over the investigated range. Point source simulations in liver had large differences relative to ICRU 72, approaching -60% near the maximum range of {sup 90}Y. These differences are mostly attributed to the difference in density between water (1.0 g{center_dot}cm{sup -3}) and liver (1.06 g{center_dot}cm{sup -3}). Glass and resin microsphere simulations showed a slight decrease in the dose rate near the maximum range of {sup 90}Y relative to the point source simulations. The largest relative differences were approximately -4.2% and -2.8% for the glass and resin microspheres, respectively. Agreement between the egsnrc and mcnp5 simulations results was generally good. Conclusions: The presence of the microsphere material causes slight differences in the {sup 90}Y dose kernel compared to those calculated with point sources. Large differences were seen between simulations in water and those in liver. For the most accurate calculation of the dose distribution, the density of the patient's liver should be accounted for in the calculation of the dose kernel. Lastly, due to the need to determine the optimal transport settings with mcnp5, electron transport with this code should be used with caution.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2019

Effective Cloud Detection and Segmentation Using a Gradient-Based Algorithm for Satellite Imagery: Application to Improve PERSIANN-CCS

The effective identification of clouds and monitoring of their evolution are important toward more accurate quantitative precipitation estimation and forecast. In this study, a new gradient-based cloud-image segmentation algorithm is developed using image processing techniques. This method integrates morphological image gradient magnitudes to separate cloud systems and patches boundaries. A varying scale kernel is implemented to reduce the sensitivity of image segmentation to noise and to capture objects with various finenesses of the edges in remote sensing images. The proposed method is flexible and extendable from single to multispectral imagery. Case studies were carried out to validate the algorithm by applying the proposed segmentation algorithm to synthetic radiances for channels of the Geostationary Operational Environmental Satellite ( GOES-16) simulated by a high-resolution weather prediction model. The proposed method compares favorably with the existing cloud-patch-based segmentation technique implemented in the Precipitation Estimation from Remotely Sensed Information Using Artificial Neural Networks–Cloud Classification System (PERSIANN-CCS) rainfall retrieval algorithm. Evaluation of event-based images indicates that the proposed algorithm has potentials comparing to the conventional segmentation technique used in PERSIANN-CCS to improve rain detection and estimation skills with an accuracy rate of up to 98% in identifying cloud regions.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2015

Development of a Radial Deconsolidation Method

A series of experiments have been initiated to determine the retention or mobility of fission products* in AGR fuel compacts [Petti, et al. 2010]. This information is needed to refine fission product transport models. The AGR-3/4 irradiation test involved half-inch-long compacts that each contained twenty designed-to-fail (DTF) particles, with 20-μm thick carbon-coated kernels whose coatings were deliberately fabricated such that they would crack under irradiation, providing a known source of post-irradiation isotopes. The DTF particles in these compacts were axially distributed along the compact centerline so that the diffusion of fission products released from the DTF kernels would be radially symmetric [Hunn, et al. 2012; Hunn et al. 2011; Kercher, et al. 2011; Hunn, et al. 2007]. Compacts containing DTF particles were irradiated at Idaho National Laboratory (INL) at the Advanced Test Reactor (ATR) [Collin, 2015]. Analysis of the diffusion of these various post-irradiation isotopes through the compact requires a method to radially deconsolidate the compacts so that nested-annular volumes may be analyzed for post-irradiation isotope inventory in the compact matrix, TRISO outer pyrolytic carbon (OPyC), and DTF kernels. An effective radial deconsolidation method and apparatus appropriate to this application has been developed and parametrically characterized.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2018

Phase quantification in low carbon Nb-Mo bearing steel by electron backscatter diffraction technique coupled with kernel average misorientation

Highlights: • The microstructures in a low carbon Nb-Mo bearing steel have been investigated. • EBSD combined with a (KAM) map has been used for quantification. • The effects of step size and kernel size on quantification are systemically discussed. • The result indicates that the kernel size should be close to the sub-structure of the granular bainite. - Abstract: An efficient and accurate method is developed for microstructural quantification of complex phases in a low carbon Nb-Mo bearing steel, of which optical micrographs show that it consists of granular bainite and a small amount of ferrite. Our previous work, proposing a method to measure the misorientation angles via electron backscatter diffraction (EBSD) to differentiate granular bainite and ferrite, has been reported. That method is accurate for phase quantification but laborious for the characterization process. To resolve this difficulty, in this study, EBSD combined with a kernel average misorientation (KAM) map is used for phase characterization. Comparisons are made among KAM maps with different kernel sizes (300 to 600 nm) and various step sizes (100 to 600 nm). It is found that a kernel size close to the sub-structure size of granular bainite (500 nm) is optimal for phase identification, while varied step sizes produce relatively invariant results. Therefore, KAM maps can be used for fast and reliable phase quantification, provided that an appropriate kernel size and a large step size are used.

36 MATERIALS SCIENCE↗
DOE OSTI2015

Parametrizing linear generalized Langevin dynamics from explicit molecular dynamics simulations

Fundamental understanding of complex dynamics in many-particle systems on the atomistic level is of utmost importance. Often the systems of interest are of macroscopic size but can be partitioned into a few important degrees of freedom which are treated most accurately and others which constitute a thermal bath. Particular attention in this respect attracts the linear generalized Langevin equation, which can be rigorously derived by means of a linear projection technique. Within this framework, a complicated interaction with the bath can be reduced to a single memory kernel. This memory kernel in turn is parametrized for a particular system studied, usually by means of time-domain methods based on explicit molecular dynamics data. Here, we discuss that this task is more naturally achieved in frequency domain and develop a Fourier-based parametrization method that outperforms its time-domain analogues. Very surprisingly, the widely used rigid bond method turns out to be inappropriate in general. Importantly, we show that the rigid bond approach leads to a systematic overestimation of relaxation times, unless the system under study consists of a harmonic bath bi-linearly coupled to the relevant degrees of freedom.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2010

Listing triangles in expected linear time on a class of power law graphs.

Enumerating triangles (3-cycles) in graphs is a kernel operation for social network analysis. For example, many community detection methods depend upon finding common neighbors of two related entities. We consider Cohen's simple and elegant solution for listing triangles: give each node a 'bucket.' Place each edge into the bucket of its endpoint of lowest degree, breaking ties consistently. Each node then checks each pair of edges in its bucket, testing for the adjacency that would complete that triangle. Cohen presents an informal argument that his algorithm should run well on real graphs. We formalize this argument by providing an analysis for the expected running time on a class of random graphs, including power law graphs. We consider a rigorously defined method for generating a random simple graph, the erased configuration model (ECM). In the ECM each node draws a degree independently from a marginal degree distribution, endpoints pair randomly, and we erase self loops and multiedges. If the marginal degree distribution has a finite second moment, it follows immediately that Cohen's algorithm runs in expected linear time. Furthermore, it can still run in expected linear time even when the degree distribution has such a heavy tail that the second moment is not finite. We prove that Cohen's algorithm runs in expected linear time when the marginal degree distribution has finite 4/3 moment and no vertex has degree larger than {radical}n. In fact we give the precise asymptotic value of the expected number of edge pairs per bucket. A finite 4/3 moment is required; if it is unbounded, then so is the number of pairs. The marginal degree distribution of a power law graph has bounded 4/3 moment when its exponent {alpha} is more than 7/3. Thus for this class of power law graphs, with degree at most {radical}n, Cohen's algorithm runs in expected linear time. This is precisely the value of {alpha} for which the clustering coefficient tends to zero asymptotically, and it is in the range that is relevant for the degree distribution of the World-Wide Web.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2020

A Fast, Two-dimensional Gaussian Process Method Based on Celerite: Applications to Transiting Exoplanet Discovery and Characterization

Gaussian processes (GPs) are commonly used as a model of stochastic variability in astrophysical time series. In particular, GPs are frequently employed to account for correlated stellar variability in planetary transit light curves. The efficient application of GPs to light curves containing thousands to tens of thousands of data points has been made possible by recent advances in GP methods, including the celerite method. Here we present an extension of the celerite method to two input dimensions where, typically, the second dimension is small. This method scales linearly with the total number of data points when the noise in each large dimension is proportional to the same celerite kernel and only the amplitude of the correlated noise varies in the second dimension. We demonstrate the application of this method to the problem of measuring precise transit parameters from multiwavelength light curves and show that it has the potential to improve transit parameters measurements by orders of magnitude. Applications of this method include transit spectroscopy and exomoon detection, as well a broader set of astronomical problems.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Operator-level quantum acceleration of non-logconcave sampling

Sampling from probability distributions of the form 𝝈 ∝ e −𝜷V , where V is a continuous potential, is a fundamental task across physics, chemistry, biology, computer science, and statistics. However, when V is nonconvex, the resulting distribution becomes non-logconcave, and classical methods such as Langevin dynamics often exhibit poor performance. We introduce a quantum algorithm that provably accelerates a broad class of continuous-time sampling dynamics. For Langevin dynamics, our method encodes the target Gibbs measure into the amplitudes of aquantum state, identified as the kernel of a block matrix derived from a factorization of the Witten Laplacian operator. This connection enables Gibbs sampling via singular value thresholding and yields up to a quartic quantum speedup over best-knownclassical Langevin-based methods in the non-logconcave setting. Building on this framework, we further develop the first quantum algorithm that accelerates replica exchange Langevin diffusion, a widely used method for sampling from complex, rugged energy landscapes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

New Machine Learning Techniques for Simulation-Based Inference: InferoStatic Nets, Kernel Score Estimation, and Kernel Likelihood Ratio Estimation

We propose an intuitive, machine-learning approach to multiparameter inference, dubbed the InferoStatic Networks (ISN) method, to model the score and likelihood ratio estimators in cases when the probability density can be sampled but not computed directly. The ISN uses a backend neural network that models a scalar function called the inferostatic potential $\varphi$. In addition, we introduce new strategies, respectively called Kernel Score Estimation (KSE) and Kernel Likelihood Ratio Estimation (KLRE), to learn the score and the likelihood ratio functions from simulated data. We illustrate the new techniques with some toy examples and compare to existing approaches in the literature. We mention en passant some new loss functions that optimally incorporate latent information from simulations into the training procedure.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Performance Analysis of Traditional and Data-Parallel Primitive Implementations of Visualization and Analysis Kernels

Measurements of absolute runtime are useful as a summary of performance when studying parallel visualization and analysis methods on computational platforms of increasing concurrency and complexity. We can obtain even more insights by measuring and examining more detailed measures from hardware performance counters, such as the number of instructions executed by an algorithm implemented in a particular way, the amount of data moved to/from memory, memory hierarchy utilization levels via cache hit/miss ratios, and so forth. This work focuses on performance analysis on modern multi-core platforms of three different visualization and analysis kernels that are implemented in different ways: one is "traditional", using combinations of C++ and VTK, and the other uses a data-parallel approach using VTK-m. Our performance study consists of measurement and reporting of several different hardware performance counters on two different multi-core CPU platforms. The results reveal interesting performance differences between these two different approaches for implementing these kernels, results that would not be apparent using runtime as the only metric.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

New machine learning techniques for simulation-based inference: InferoStatic nets, kernel score estimation, and kernel likelihood ratio estimation

We propose an intuitive, machine-learning approach to multiparameter inference, dubbed the InferoStatic Networks (ISN) method, to model the score and likelihood ratio estimators in cases when the probability density can be sampled but not computed directly. The ISN uses a backend neural network that models a scalar function called the inferostatic potential \varphi φ . In addition, we introduce new strategies, respectively called Kernel Score Estimation (KSE) and Kernel Likelihood Ratio Estimation (KLRE), to learn the score and the likelihood ratio functions from simulated data. We illustrate the new techniques with some toy examples and compare to existing approaches in the literature. We mention en passant some new loss functions that optimally incorporate latent information from simulations into the training procedure.

Kong, Kyoungchul↗
DOE OSTI2024

MFANS 2024 - Formally Proving Characteristics of Cyber-Physical Systems

Cyber-physical systems (CPS) are engineered systems that rely on the smooth integration of computational algorithms and physical elements. This integration presents new challenges for verifying that systems will behave as expected. The goal of this presentation is to present current challenges and potential solutions for the formal verification of cyber-physical systems. For cyber systems, formal methods refer to systematically rigorous mathematical techniques employed in the specification, development, analysis, and verification of both software and hardware systems. Recent advancements in computer science have yielded sophisticated tools specifically designed to address challenges associated with formal methods in complex systems. These tools leverage various foundational concepts such as logic, formal languages, program semantics, type systems, type theory, and automata theory. A notable achievement in the application of formal methods is the seL4 microkernel, claimed to be the first general-purpose operating-system kernel to be verified. Its proof implies the absence of bugs and guarantees that the kernel meets specifications. For physical systems, dynamic and control theory has a history of using rigorous analytic techniques to prove functional correctness. Lyapunov, optimal, classical, modern, and robust control theories all provide rigorous mathematical methods both to analyze system performance and to design controller that can be guaranteed to meet certain objectives. Recent computational techniques like level set theory and reachability analysis provide assertions that a system's state will avoid unsafe regions. Even though success has been independently achieved for cyber systems and physical systems, the integration of such systems creates new challenges. In particular, there is an obvious discrepancy between finite-state machines and infinite-state systems, resulting in different approaches for modeling and analyzing these system. While it is possible to simulate hybrid systems, this provides only a demonstration of a performance and not proof. For hybrid systems, current formal methods and system analysis approaches typically require a workarounds to work on hybrid systems like CPS. This paper will outline the state of the art and limits of current practice for formally verifying CPS and will identify possible research directions that require attention.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Trigonometric polynomial approximation, K-functionals and generalized moduli of smoothness

Best approximation and approximation by families of linear polynomial operators (FLPO) in the spaces L{sub p}, 0<p⩽+∞, are investigated for periodic functions of an arbitrary number of variables in terms of the generalized modulus of smoothness generated by a periodic generator which, near the origin, is assumed to be close in a certain sense to some homogeneous function of positive order. Direct and inverse theorems (Jackson- and Bernstein-type estimates) are proved; conditions on the generators are obtained under which the approximation error by an FLPO is equivalent to an appropriate modulus of smoothness. These problems are solved by going over from the modulus to an equivalent K-functional. The general results obtained are applied to classical objects in the theory of approximation and smoothness. In particular, they are applied to the methods of approximation generated by Fejér, Riesz and Bochner-Riesz kernels, and also to the moduli of smoothness and K-functionals corresponding to the conventional, Weyl and Riesz derivatives and to the Laplace operator. Bibliography: 24 titles. (paper)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

MLMOD: Machine Learning Methods for Data-Driven Modeling in LAMMPS

MLMOD is a software package for incorporating machine learning approaches and models into simulations of microscale mechanics and molecular dynamics in LAMMPS. Recent machine learning approaches provide promising data-driven approaches for learning representations for system behaviors from experimental data and high fidelity simulations. The package facilitates learning and using data-driven models for (i) dynamics of the system at larger spatial-temporal scales (ii) interactions between system components, (iii) features yielding coarser degrees of freedom, and (iv) features for new quantities of interest characterizing system behaviors. MLMOD provides hooks in LAMMPS for (i) modeling dynamics and time-step integration, (ii) modeling interactions, and (iii) computing quantities of interest characterizing system states. The package allows for use of machine learning methods with general model classes including Neural Networks, Gaussian Process Regression, Kernel Models, and other approaches. Here we discuss our prototype C++/Python package, aims, and example usage. For related papers, examples, updates, and additional information see https://github.com/atzberg/mlmod and http://atzberger.org/.

97 MATHEMATICS AND COMPUTING↗