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 649 records · Page 36

Estimation of Smoothing Error in SBUV Profile and Total Ozone Retrieval

Data from the Nimbus-4, Nimbus-7 Solar Backscatter Ultra Violet (SBUV) and seven of the NOAA series of SBUV/2 instruments spanning 41 years are being reprocessed using V8.6 algorithm. The data are scheduled to be released by the end of August 2011. An important focus of the new algorithm is to estimate various sources of errors in the SBUV profiles and total ozone retrievals. We discuss here the smoothing errors that describe the components of the profile variability that the SBUV observing system can not measure. The SBUV(/2) instruments have a vertical resolution of 5 km in the middle stratosphere, decreasing to 8 to 10 km below the ozone peak and above 0.5 hPa. To estimate the smoothing effect of the SBUV algorithm, the actual statistics of the fine vertical structure of ozone profiles must be known. The covariance matrix of the ensemble of measured ozone profiles with the high vertical resolution would be a formal representation of the actual ozone variability. We merged the MLS (version 3) and sonde ozone profiles to calculate the covariance matrix, which in general case, for single profile retrieval, might be a function of the latitude and month. Using the averaging kernels of the SBUV(/2) measurements and calculated total covariance matrix one can estimate the smoothing errors for the SBUV ozone profiles. A method to estimate the smoothing effect of the SBUV algorithm is described and the covariance matrixes and averaging kernels are provided along with the SBUV(/2) ozone profiles. The magnitude of the smoothing error varies with altitude, latitude, season and solar zenith angle. The analysis of the smoothing errors, based on the SBUV(/2) monthly zonal mean time series, shows that the largest smoothing errors were detected in the troposphere and might be as large as 15-20% and rapidly decrease with the altitude. In the stratosphere above 40 hPa the smoothing errors are less than 5% and between 10 and 1 hPa the smoothing errors are on the order of 1%. We validate our estimated smoothing errors by comparing the SBUV ozone profiles with other ozone profiling sensors.

Kramarova, N. A.↗

Investigating Methods of Supporting Dynamically Linked Executables on High Performance Computing Platforms

Shared libraries have become ubiquitous and are used to achieve great resource efficiencies on many platforms. The same properties that enable efficiencies on time-shared computers and convenience on small clusters prove to be great obstacles to scalability on large clusters and High Performance Computing platforms. In addition, Light Weight operating systems such as Catamount have historically not supported the use of shared libraries specifically because they hinder scalability. In this report we will outline the methods of supporting shared libraries on High Performance Computing platforms using Light Weight kernels that we investigated. The considerations necessary to evaluate utility in this area are many and sometimes conflicting. While our initial path forward has been determined based on this evaluation we consider this effort ongoing and remain prepared to re-evaluate any technology that might provide a scalable solution. This report is an evaluation of a range of possible methods of supporting dynamically linked executables on capability class1 High Performance Computing platforms. Efforts are ongoing and extensive testing at scale is necessary to evaluate performance. While performance is a critical driving factor, supporting whatever method is used in a production environment is an equally important and challenging task.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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↗

Exact-exchange kernel of time-dependent density functional theory: Frequency dependence and photoabsorption spectra of atoms

In this work we have calculated excitation energies and photoionization cross sections of Be and Ne in the exact-exchange (EXX) approximation of time-dependent density functional theory (TDDFT). The main focus has been on the frequency dependence of the EXX kernel and on how it affects the spectrum as compared to the corresponding adiabatic approximation. We show that for some discrete excitation energies the frequency dependence is essential to reproduce the results of time-dependent Hartree-Fock theory. Unfortunately, we have found that the EXX approximation breaks down completely at higher energies, producing a response function with the wrong analytic structure and making inner-shell excitations disappear from the calculated spectra. We have traced this failure to the existence of vanishing eigenvalues of the Kohn-Sham non-interacting response function. Based on the adiabatic TDDFT formalism we propose a new way of deriving the Fano parameters of autoionizing resonances.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Explore Information Content Efficiently from Current and Future Hyperspectral Satellite Missions using a Spectral Fingerprinting Method

Hyperspectral remote sensors from current and future missions provide measurements of the Top of Atmosphere (TOA) radiance or reflectance spectra with high information content. For example, the Atmospheric Infrared Sounder (AIRS), together with the Cross-track Infrared Sounder (CrIS), and the Infrared Atmospheric Sounding Interferometer (IASI) have provided more than 20 years radiance measurements with thousands of spectral channels. These measurements will be continued for the next two decades with the same or more advanced hyperspectral sensors. The upcoming missions such as NASA’s CLARREO Pathfinder (CPF) and ESA’s TRUTHS will provide unprecedented accurate TOA hyperspectral radiance measurements in solar spectral region. Traditional ways to derive Climate Data Records (CDRs) from these measurements are performing spatial and temporal averages of the retrieved Level-2 products. However, it is a time-consuming process to generate decades of Level-2 data from Level-1 data. Furthermore, the differences in Level-2 algorithms used for different satellite sensors will introduce errors in derived CDRs. In this presentation, we will describe a spectral fingerprinting method to generate high-quality CDRs directly from spatiotemporally averaged Level-1 data. By using consistent radiative kernels which contain the spectral information of various atmospheric and surface CDRs, we can reduce the errors due to algorithm inconsistency. Additionally, the spectral fingerprinting method reduces the time needed to generate CDRs by more than three orders of magnitude. This makes it easy to reprocess CDRs once the Level-1 data from different satellites have been improved via either re-calibrations or inter-satellite calibrations. We will present results of applying spectral fingerprinting method to 20-years of AIRS and CrIS data. The resulting CDRs include: 1) vertical profiles of atmospheric temperature and water vapor, 2) cloud properties such as optical depth, effective size, and height, 3) vertical profiles or column amounts for atmospheric trace gases such as O3 and CO, and 4) surface emissivity spectra and skin temperatures. These CDRs will be publicly available at NASA GES DISC in late 2024. The same fingerprinting method is planned to be applied to future CPF and TRUTHS data for solar spectral region.

hyperspectral remote sensing↗

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↗

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↗

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↗

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↗

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↗

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↗

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↗

Test particle propagation in magnetostatic turbulence. 2: The local approximation method

An approximation method for statistical mechanics is presented and applied to a class of problems which contains a test particle propagation problem. All of the available basic equations used in statistical mechanics are cast in the form of a single equation which is integrodifferential in time and which is then used as the starting point for the construction of the local approximation method. Simplification of the integrodifferential equation is achieved through approximation to the Laplace transform of its kernel. The approximation is valid near the origin in the Laplace space and is based on the assumption of small Laplace variable. No other small parameter is necessary for the construction of this approximation method. The n'th level of approximation is constructed formally, and the first five levels of approximation are calculated explicitly. It is shown that each level of approximation is governed by an inhomogeneous partial differential equation in time with time independent operator coefficients. The order in time of these partial differential equations is found to increase as n does. At n = 0 the most local first order partial differential equation which governs the Markovian limit is regained.

Klimas, A. J.↗

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↗