Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “kernel density estimation”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

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

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

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

A VOI Web Application for Distinct Geothermal Domains: Statistical Evaluation of Different Data Types within the Great Basin

The Great Basin region contains different domains that have different structural and hydrothermal flow patterns. Depending on the characteristics of these patterns, certain data types may be more successful at detecting hidden geothermal resources. In this paper, we quantitatively evaluate if certain data types are more successful in certain domains. Given different aquifer, strain and structural conditions, we explore which data types statistically reveal positively labeled geothermal sites. We utilize value of information (VOI) metrics to help quantify the reliability of data types to discriminate against "positive" and "negative" labeled geothermal sites. We also evaluate how kernel density estimation can help generalize the statistics that inform VOI, which is necessary given the limited data in geothermal exploration. Except for the Carbonate Aquifer, the highest ranking of the Vimperfect is the Local Structural Setting. Next, the slip and dilation tendency is first for Carbonate Aquifer and second for Central Nevada Seismic Belt and Western Great Basin. For the Carbonate Aquifer, heat flow is has the lowest Vimperfect value compared to the other three domains, which is consistent with the understanding of how heat flow measurements are masked by regional groundwater flow.

Bayesian analysis↗
DOE OSTI2024

Minimum entropy filtering for a single output non-Gaussian stochastic system using state transformation

This paper presents a novel filter design for the single-output stochastic non-linear systems subjected to non-Gaussian noises and the proposed assumptions. Based on a state transformation, the unmeasurable states of the systems can be estimated where non-linear terms in the systems have been eliminated. It has been shown that the estimation error is linearly dynamical regarding to the presented vector-valued filter gain which can be optimised by minimising the entropy-based performance criterion. In addition, the convergence of the presented algorithm is analysed in mean-square sense and a numerical example is given to verify the effectiveness of the presented filtering algorithm. Meanwhile, the extended Kalman filter, unscented particle filter and minimum entropy filter are given for the comparisons of the filtering performance. Following the presented framework, some extensions of the presented filtering algorithm are discussed to indicate the flexibility of the filter design. The contribution of this paper can be summarised as establishing a novel minimum entropy filtering framework which consists of model transformation, entropy optimisation and convergence analysis.

42 ENGINEERING↗
DOE OSTI2024

On the measurement of shape: With applications to lunar regolith

With the renewed commitment from NASA and other commercial entities for a presence on the Moon, the importance of understanding the characteristics of lunar regolith and how to utilize it have become the target of increasing scrutiny. Much of what is known about lunar regolith was collected during and immediately after the Apollo program, however, analytical techniques and instrumentation have advanced in leaps and bounds in the subsequent decades. Specifically, dynamic image analysis systems have advanced to the point that millions of particles can have morphological characteristics automatically determined in relatively short time frames. Particle morphological data was collected on several lunar samples and a pair of widely used regolith simulants to ascertain the accuracy of these simulants and to explore statistical analysis methods of these large datasets. It is found that these morphology datasets can vary widely depending on the particle size of the particles, and simple averaging of the data skews the results heavily towards the numerically abundant size ranges, the fines. Different reporting methods are suggested to ameliorate these problems. When applied to the lunar regolith, the particles are noted to be less morphologically complex than initially suspected. Compared to the lunar material, the simulants are found to contain some more morphological variability and angular grains. Such difference is likely due to the wildly different comminution processes that these different powder systems are subjected to.

2D shape↗
DOE OSTI2022

Data-driven Minimum Entropy Control for Stochastic Nonlinear Systems using the Cumulant-Generating Function

Here, we present a novel minimum entropy control algorithm for a class of stochastic nonlinear systems subjected to non-Gaussian noises. The entropy control can be considered as an optimization problem for the system randomness attenuation, but the mean value has to be considered separately. To overcome this disadvantage, a new representation of the system stochastic properties was given using the cumulant-generating function based on the moment-generating function, in which the mean value and the entropy was reflected by the shape of the cumulant-generating function. Based on the samples of the system output and control input, a time-variant linear model was identified, and the minimum entropy optimization was transformed to system stabilization. Then, an optimal control strategy was developed to achieve the randomness attenuation, and the boundedness of the controlled system output was analyzed. The effectiveness of the presented control algorithm was demonstrated by a numerical example. In this paper, a data-driven minimum entropy design is presented without pre-knowledge of the system model; entropy optimization is achieved by the system stabilization approach in which the stochastic distribution control and minimum entropy are unified using the same identified structure; and a potential framework is obtained since all the existing system stabilization methods can be adopted to achieve the minimum entropy objective.

42 ENGINEERING↗
NASA NTRS1996

Software For Multivariate Bayesian Classification

PHD general-purpose classifier computer program. Uses Bayesian methods to classify vectors of real numbers, based on combination of statistical techniques that include multivariate density estimation, Parzen density kernels, and EM (Expectation Maximization) algorithm. By means of simple graphical interface, user trains classifier to recognize two or more classes of data and then use it to identify new data. Written in ANSI C for Unix systems and optimized for online classification applications. Embedded in another program, or runs by itself using simple graphical-user-interface. Online help files makes program easy to use.

Saul, Ronald↗
DOE OSTI2023

Spatial and temporal overlap between hatchery- and natural-origin steelhead and Chinook Salmon during spawning in the Klickitat River, Washington, USA

Abstract Objective A goal of many segregated salmonid hatchery programs is to minimize potential interbreeding between hatchery- and natural-origin fish. Our objective was to assess this on the Klickitat River, Washington, USA. Methods We used radiotelemetry to evaluate spatiotemporal spawning overlap between hatchery- and natural-origin steelhead Oncorhynchus mykiss and spring Chinook Salmon O. tshawytscha. We estimated percentages of tagged fish that spawned naturally in the Klickitat River subbasin, emigrated from the Klickitat River, or died before spawning. A kernel density analysis was used to estimate probability of spatiotemporal overlap between hatchery- and natural-origin spawners. Result For steelhead, 12% of hatchery-origin and 50% of natural-origin fish spawned naturally. For spring Chinook Salmon, 18% of hatchery-origin and 44% of natural-origin fish spawned naturally. Tag loss may result in underestimates in these percentages. Most hatchery-origin steelhead (90%) spawned downstream of river kilometer (rkm) 32, and 75% spawned from November to mid-March. The majority of natural-origin steelhead (64%) spawned upstream of rkm 32, and 75% spawned from mid-March to late May. Spawn timing of hatchery-origin Chinook Salmon (early August to mid-September) overlapped with that of natural-origin Chinook Salmon (late July to late September), and fish of both origins spawned in the same 30-km reach of the river. We estimated the percentage of hatchery-origin spawners (pHOS) on the natural spawning grounds to be 12% for steelhead and 40% for spring Chinook Salmon across all study years. For steelhead, we estimated the overlap probability to be 25% (95% CI = 22.5–28%). For spring Chinook Salmon, tight spatial clustering of hatchery-origin fish resulted in a lower overlap estimate of 21% (13–31%). Conclusion We suggest adjusting pHOS estimates using these overlap estimates or similar spatiotemporal data on actual spawner proximity and possible interactions, and that these types of analyses be used in conjunction with gene flow analysis to accurately evaluate effects of individual hatchery programs.

Zendt, Joseph S.↗
NASA NTRS1976

Nonparametric probability density estimation by optimization theoretic techniques

Two nonparametric probability density estimators are considered. The first is the kernel estimator. The problem of choosing the kernel scaling factor based solely on a random sample is addressed. An interactive mode is discussed and an algorithm proposed to choose the scaling factor automatically. The second nonparametric probability estimate uses penalty function techniques with the maximum likelihood criterion. A discrete maximum penalized likelihood estimator is proposed and is shown to be consistent in the mean square error. A numerical implementation technique for the discrete solution is discussed and examples displayed. An extensive simulation study compares the integrated mean square error of the discrete and kernel estimators. The robustness of the discrete estimator is demonstrated graphically.

Scott, D. W.↗
DOE OSTI2024

Computing the QRPA level density with the finite amplitude method

Here, we describe a new algorithm to calculate the vibrational nuclear level density of an atomic nucleus. Fictitious perturbation operators that probe the response of the system are generated by drawing their matrix elements from some probability distribution function. We use the Finite Amplitude Method to explicitly compute the response for each such sample. With the help of the Kernel Polynomial Method, we build an estimator of the vibrational level density and provide the upper bound of the relative error in the limit of infinitely many random samples. The new algorithm can give accurate estimates of the vibrational level density. Since it is based on drawing multiple samples of perturbation operators, its computational implementation is naturally parallel and scales like the number of available processing units.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2004

Virtual Sensors: Using Data Mining Techniques to Efficiently Estimate Remote Sensing Spectra

Various instruments are used to create images of the Earth and other objects in the universe in a diverse set of wavelength bands with the aim of understanding natural phenomena. These instruments are sometimes built in a phased approach, with some measurement capabilities being added in later phases. In other cases, there may not be a planned increase in measurement capability, but technology may mature to the point that it offers new measurement capabilities that were not available before. In still other cases, detailed spectral measurements may be too costly to perform on a large sample. Thus, lower resolution instruments with lower associated cost may be used to take the majority of measurements. Higher resolution instruments, with a higher associated cost may be used to take only a small fraction of the measurements in a given area. Many applied science questions that are relevant to the remote sensing community need to be addressed by analyzing enormous amounts of data that were generated from instruments with disparate measurement capability. This paper addresses this problem by demonstrating methods to produce high accuracy estimates of spectra with an associated measure of uncertainty from data that is perhaps nonlinearly correlated with the spectra. In particular, we demonstrate multi-layer perceptrons (MLPs), Support Vector Machines (SVMs) with Radial Basis Function (RBF) kernels, and SVMs with Mixture Density Mercer Kernels (MDMK). We call this type of an estimator a Virtual Sensor because it predicts, with a measure of uncertainty, unmeasured spectral phenomena.

Srivastava, Ashok N.↗
NASA NTRS1976

A.t.m. observations on the X u.v. emission from solar flares

The paper summarizes observations of selected solar flares made with a far-UV spectroheliograph (190-465 A) and a UV spectrograph (900-1900 A) aboard Skylab. The emission lines used in the present analysis are identified, and three events are described in detail: the flare of June 15, 1973, a small subflare observed on August 9, 1973, and the flare of January 21, 1974. Ultraviolet images of two other events are also presented in an attempt to sketch a general picture of a flare as seen in this spectral region. It is found that a small kernel seems to be the source of the primary energy release of a flare. The size, electron density, and ion temperature of a typical kernel are estimated, and it is noted that hot clouds of coronal gas at 20 million K surrounded the observed kernels. It is speculated that flare kernels might be very thin channels through which high-energy particles, originating in deep layers, are ejected into the corona.

Brueckner, G. E.↗
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 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

Training quantum neural networks using the quantum information bottleneck method

Abstract We provide in this paper a concrete method for training a quantum neural network to maximize the relevant information about a property that is transmitted through the network. This is significant because it gives an operationally well founded quantity to optimize when training autoencoders for problems where the inputs and outputs are fully quantum. We provide a rigorous algorithm for computing the value of the quantum information bottleneck quantity within error ε that requires O ( log 2 ⁡ ( 1 / ϵ ) + 1 / δ 2 ) queries to a purification of the input density operator if its spectrum is supported on { 0 } ⋃ [ δ , 1 − δ ] for δ > 0 and the kernels of the relevant density matrices are disjoint. We further provide algorithms for estimating the derivatives of the QIB function, showing that quantum neural networks can be trained efficiently using the QIB quantity given that the number of gradient steps required is polynomial.

Çatlı, Ahmet Burak (ORCID:0000000152294141)↗
NASA NTRS1988

Magnetic reversal spurts: Rain gauges for comet showers

Abrupt increases in the rate of magnetic reversals (magnetic reversal spurts) were first studied by many others. They hypothesized that spurts result from increased turbulence in the earth's core dynamo during episodes of intense bolide bombardment of the earth. Mechanisms for creating episodes of intense bombardment of the earth involve gravitational perturbation of the Oort cloud of comets, either by a hidden planet, a solar companion, or massive matter in the galactic plane. Herein, the time variation in reversal rate is analyzed using methods of statistical density estimation. A smooth, continuous estimate of reversal rate is obtained using an adaptive kernel method, in which the kernel width is adjusted as a function of reversal rate. The estimates near the ends of the data series (at 165 my ago and the present) are obtained by extending the data by reflection. The results show that the reversal spurts are not associated demonstrably with extinctions or well-dated impacts. If the spurts do record episodes of intense bombardment of the earth, then the mass extinctions do not, in general, occur at times of impacts. Furthermore, the large impact craters seen are not obviously related to the spurts, suggesting that the craters may have been caused by bolides of a different nature and with a different temporal pattern. However, the most simple explanation seems to be that the spurts do not record comet showers, either because the recording mechanism suggested by Muller and Morris is not effective or because comet showers are not triggered in the ways considered by Hut et al.

Lutz, T. M.↗
DOE OSTI2022

Coarse-Grained Density Functional Theory Predictions via Deep Kernel Learning

Scalable electronic predictions are critical for soft materials design. Recently, the Electronic Coarse-Graining (ECG) method was introduced to renormalize all-atom quantum chemical (QC) predictions to coarse-grained (CG) resolutions using deep neural networks (DNNs). While DNNs can learn complex representations that prove challenging for kernel-based methods, they are susceptible to overfitting and the overconfidence of uncertainty estimations. Here, we develop ECG within a GPU-accelerated Deep Kernel Learning (DKL) framework to enable CG QC predictions using range-separated hybrid density functional theory (DFT), obtaining a 107 speedup relative to naive all-atom QC. By treating the predicted electronic properties as random Gaussian Processes, DKL incorporates CG mapping degeneracy by learning the distribution of electronic energies as a function of CG configuration. DKL-ECG accurately reproduces molecular orbital energies from range-separated DFT while facilitating efficient training via active learning using the uncertainties provided by DKL. Further, we show that while active learning algorithms enable efficient sampling of a more diverse configurational space relative to random sampling, all explored query methods exhibit comparable performance for the examined system. We attribute this result to the significant overlap of the feature space and output property distributions across multiple temperatures.

97 MATHEMATICS AND COMPUTING↗