Search NASA⌕ Search

SEARCH · Search NASA

Results for “Gaussian Process Models”

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 775 records · Page 43

Informative Path Planning for Mapping Radiation

This project involves making measurements of contaminated areas using portable radiation detectors and small robots. Tasks involve operating detectors and small robots, combining data acquisition for the two systems, and automating the systems. The end result is a radiation map of contamination areas. Localization of radioactive sources and mapping of contamination distribution is essential when responding to emergencies, or when dealing with cleanup efforts. Radiation maps are used for situational awareness and for establishing a safe perimeter. However, it may be hazardous or impossible for humans to safely enter the site and survey the area. Informative Path Planning (IPP) is used to design a path for a robotic sensor platform to gather the most information about the radiation distribution while operating under the set of constraints given by the dynamics of the robot and other requirements such as minimizing the overall mission time. The key challenge for IPP is the tight coupling in multiple layers of decisions: Selection of locations to visit; Allocation of sensors to those locations; Processing of information gathered. Given a robot equipped with a basic gamma detector and Lidar sensor, how can we efficiently explore an unknown environment in such a way that we can satisfy the robot's constraints while simultaneously maximizing the accuracy of the map and minimizing the total runtime? This work presents a systematic procedure for IPP and environmental mapping that: Selects the best locations at which to sample; Finds the best path for robots; Estimates the measurement value at unknown locations using a Gaussian Process regression framework. Given a set of points where radiation measurements were taken, we are utilizing a Gaussian Process Regression with a Matern kernel to reconstruct the shape of the underlying ground truth. Mapping is done via the Robot Operating System's OpenSlam Gmapping package, which creates a 2D occupancy grid map. Simulated trials were run with a radiation source placed at random locations, and allowing the robot to select and move towards 20 samples at separate locations, as well as sampling along the path while moving. The simulated sensor model assumed an efficiency of 0.3, collection time of 1 second. Various weighting schemes were tested and compared. Quantitative evaluations often favored exploitation-heavy weighting schemes where μ was emphasized, with the Root Mean Squared Error (RMSE) quickly tending towards 2, whereas qualitative comparisons would favor exploration-biased schemes with greater weight on σ. The difference comes from operators often favoring knowing the general location of a source, rather than the exact properties of a source. Weighting of the path-length π often reduced the quality of the regression as less exploration occurred, however this may be deemed a worthwhile trade-off under certain circumstances, such as with sensitive robots. Successfully developed a methodology for informative path-planning for a robot to efficiently gather information and create a map of radiation. In the future, we would like to focus on: Hardware trials with integration of the robot platform and the IPP software; More refined sensor and environmental modeling; Multiple robot platforms.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Test of the cosmic evolution using Gaussian processes

Much focus was on the possible slowing down of cosmic acceleration under the dark energy parametrization. In the present paper, we investigate this subject using the Gaussian processes (GP), without resorting to a particular template of dark energy. The reconstruction is carried out by abundant data including luminosity distance from Union2, Union2.1 compilation and gamma-ray burst, and dynamical Hubble parameter. It suggests that slowing down of cosmic acceleration cannot be presented within 95% C.L., in considering the influence of spatial curvature and Hubble constant. In order to reveal the reason of tension between our reconstruction and previous parametrization constraint for Union2 data, we compare them and find that slowing down of acceleration in some parametrization is only a ''mirage'. Although these parameterizations fits well with the observational data, their tension can be revealed by high order derivative of distance D. Instead, GP method is able to faithfully model the cosmic expansion history.

79 ASTRONOMY AND ASTROPHYSICS↗

A Comparison of Three Random Number Generators for Aircraft Dynamic Modeling Applications

Three random number generators, which produce Gaussian white noise sequences, were compared to assess their suitability in aircraft dynamic modeling applications. The first generator considered was the MATLAB (registered) implementation of the Mersenne-Twister algorithm. The second generator was a website called Random.org, which processes atmospheric noise measured using radios to create the random numbers. The third generator was based on synthesis of the Fourier series, where the random number sequences are constructed from prescribed amplitude and phase spectra. A total of 200 sequences, each having 601 random numbers, for each generator were collected and analyzed in terms of the mean, variance, normality, autocorrelation, and power spectral density. These sequences were then applied to two problems in aircraft dynamic modeling, namely estimating stability and control derivatives from simulated onboard sensor data, and simulating flight in atmospheric turbulence. In general, each random number generator had good performance and is well-suited for aircraft dynamic modeling applications. Specific strengths and weaknesses of each generator are discussed. For Monte Carlo simulation, the Fourier synthesis method is recommended because it most accurately and consistently approximated Gaussian white noise and can be implemented with reasonable computational effort.

Grauer, Jared A.↗

[Using Molecular Simulations to Understand Complex Nanoscale Dynamic Phenomena in Polymer Solutions]

The first half of the project concentrated on molecular simulation studies of the translocation of model molecules for single-stranded DNA through a nanosized pore. This has resulted in the publication, Translocation of a polymer chain across a nanopore: A Brownian dynamics simulation study, by Pu Tian and Grant D. Smith, JOURNAL OF CHEMICAL PHYSICS VOLUME 119, NUMBER 21 1 DECEMBER 2003, which is attached to this report. In this work we carried out Brownian dynamics simulation studies of the translocation of single polymer chains across a nanosized pore under the driving of an applied field (chemical potential gradient) designed to mimic an electrostatic field. The translocation process can be either dominated by the entropic barrier resulted from restricted motion of flexible polymer chains or by applied forces (or chemical gradient). We focused on the latter case in our studies. Calculation of radius of gyration of the translocating chain at the two opposite sides of the wall shows that the polymer chains are not in equilibrium during the translocation process. Despite this fact, our results show that the one-dimensional diffusion and the nucleation model provide an excellent description of the dependence of average translocation time on the chemical potential gradients, the polymer chain length and the solvent viscosity. In good agreement with experimental results and theoretical predictions, the translocation time distribution of our simple model shows strong non-Gaussian characteristics. It is observed that even for this simple tube-like pore geometry, more than one peak of translocation time distribution can be generated for proper pore diameter and applied field strengths. Both repulsive Weeks-Chandler-Anderson and attractive Lennard-Jones polymer-nanopore interaction were studied. Attraction facilitates the translocation process by shortening the total translocation time and dramatically improve the capturing of polymer chain. The width of the translocation time distribution was found to decrease with increasing temperature, increasing field strength, and decreasing pore diameter.

Smith, Grant↗

A generalized muon trajectory estimation algorithm with energy loss for application to muon tomography

Here, this work presents a generalized muon trajectory estimation (GMTE) algorithm to estimate the path of a muon in either uniform or nonuniform media. The use of cosmic ray muons in nuclear nonproliferation and safeguards verification applications has recently gained attention due to the non-intrusive and passive nature of the inspection, penetrating capabilities, as well as recent advances in detectors that measure position and direction of the individual muons before and after traversing the imaged object. However, muon image reconstruction techniques are limited in resolution due to low muon flux and the effects of multiple Coulomb scattering (MCS). Current reconstruction algorithms, e.g., point of closest approach (PoCA) or straight-line path (SLP), rely on overly simple assumptions for muon path estimation through the imaged object. For robust muon tomography, efficient and flexible physics-based algorithms are needed to model the MCS process and accurately estimate the most probable trajectory of a muon as it traverses an object. In the present work, the use of a Bayesian framework and a Gaussian approximation of MCS are explored for estimation of the most likely path of a cosmic ray muon traversing uniform or nonuniform media and undergoing MCS. The algorithm’s precision is compared to Monte Carlo simulated muon trajectories. It was found that the algorithm is expected to be able to predict muon tracks to less than 1.5 mm RMS for 0.5 GeV muons and 0.25 mm RMS for 3 GeV muons, a 50% improvement compared to SLP and 15% improvement when compared to PoCA. Further, a 30% increase in useful muon flux was observed relative to PoCA. Muon track prediction improved for higher muon energies or smaller penetration depth where energy loss is not significant. Finally, the effect of energy loss due to ionization is investigated, and a linear energy loss relation that is easy to use is proposed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Measuring the thermal and ionization state of the low- z IGM using likelihood free inference

ABSTRACT We present a new approach to measure the power-law temperature density relationship $T=T_0 (\rho/ \bar{\rho })^{\gamma -1}$ and the UV background photoionization rate $\Gamma _{{{{\rm H\, {\small I}}}}{}}$ of the intergalactic medium (IGM) based on the Voigt profile decomposition of the Ly α forest into a set of discrete absorption lines with Doppler parameter b and the neutral hydrogen column density $N_{\rm H\, {\small I}}$. Previous work demonstrated that the shape of the $b-N_{{{{\rm H\, {\small I}}}}{}}$ distribution is sensitive to the IGM thermal parameters T0 and γ, whereas our new inference algorithm also takes into account the normalization of the distribution, i.e. the line-density dN/dz, and we demonstrate that precise constraints can also be obtained on $\Gamma _{{{{\rm H\, {\small I}}}}{}}$. We use density-estimation likelihood-free inference (DELFI) to emulate the dependence of the $b-N_{{{{\rm H\, {\small I}}}}{}}$ distribution on IGM parameters trained on an ensemble of 624 nyx hydrodynamical simulations at z = 0.1, which we combine with a Gaussian process emulator of the normalization. To demonstrate the efficacy of this approach, we generate hundreds of realizations of realistic mock HST/COS data sets, each comprising 34 quasar sightlines, and forward model the noise and resolution to match the real data. We use this large ensemble of mocks to extensively test our inference and empirically demonstrate that our posterior distributions are robust. Our analysis shows that by applying our new approach to existing Ly α forest spectra at z ≃ 0.1, one can measure the thermal and ionization state of the IGM with very high precision ($\sigma _{\log T_0} \sim 0.08$ dex, σγ ∼ 0.06, and $\sigma _{\log \Gamma _{{{{\rm H\, {\small I}}}}{}}} \sim 0.07$ dex).

79 ASTRONOMY AND ASTROPHYSICS↗

Correlation-aware binning for small-angle neutron scattering via Gaussian-process inference

Binning in small-angle neutron scattering (SANS) is typically performed empirically, with fixed parameters chosen for convenience rather than statistical optimality. Such practices often fail to balance statistical precision and spatial resolution, leading to inconsistencies across instruments and datasets. Here we establish a correlation-aware framework that determines the optimal bin width from first principles by extending the classical Freedman–Diaconis (FD) rule to account for inter-bin correlations with a Gaussian process. In this formulation, the scattering intensity is treated as a smooth stochastic field whose statistical coherence is described by a covariance matrix. Analytical expressions of errors derived from this model yield closed-form criteria that separate the total deviation into contributions from counting noise, aliasing distortion and curvature-dependent correlation effects. Expressed in reduced variables, the resulting dimensionless error surface reveals a continuous transition from the uncorrelated FD regime to the correlation-dominated limit, providing a unified description of noise suppression and resolution control. Because the formulation depends only on the profile characteristics of scattering intensity I(Q), specifically its average intensity and first- and second-order derivatives, it applies generally to any SANS measurement regardless of sample, instrument or geometry. Experimental validation using small- and ultra-small-angle neutron scattering data confirms the predicted scaling behavior, demonstrating that correlation-aware inference systematically reduces mean-squared error and enables information-efficient reproducible data reduction across materials and instruments.

Tung, Chi-Huan [ORNL] (ORCID:0000000221972074)↗

Full-scale composting of sewage sludge and market waste: Stability monitoring and odor dispersion modeling

Highlights: • Composting process of different organic waste was monitored at full-scale. • Relationships among odor emissions and analytical and biological variables were found. • Removal of nitrogen and volatile solids was the main responsible for odor generation. • Biomethanization pretreatment reduced odor impact at the beginning of composting. • The highest odor immission occurred in summer season for a wind speed of 2.6 m/s. The aim of this study was to assess the odor immission derived from full-scale composting of different abundant and highly pollutant organic waste: sewage sludge with bulking agent (SL), sewage sludge pretreated through anaerobic digestion and supplemented with bulking agent (SL-AD), and market waste with olive leaves (MW-OL). The combination of dynamic olfactometry and Gaussian dispersion modeling allowed both the quantification of odor emissions from each waste and the evaluation of their global odorous impact in nearby urban areas. Wind speed, summer and winter seasons, and atmospheric conditions were considered in the dispersion model. The results revealed that high wind speed (2.6 m/s) increases the global odor immission in summer season, independently of atmospheric stability. However, the maximum odor immission concentration recommended for composting process was not exceeded in any case, which depends on each country/region. The experimental results also enable to evaluate the influence of several physico-chemical variables on odor emissions derived from composting. The removal of nitrogen and volatile solids was the main cause for odor generation. Moreover, the microbiological activity of each substrate was monitored throughout the process and different percentages of biodegradability were quantified depending on the type of substrate and pretreatment applied.

54 ENVIRONMENTAL SCIENCES↗

Evaluating Gaussian process metamodels and sequential designs for noisy level set estimation

Abstract We consider the problem of learning the level set for which a noisy black-box function exceeds a given threshold. To efficiently reconstruct the level set, we investigate Gaussian process (GP) metamodels. Our focus is on strongly stochastic simulators, in particular with heavy-tailed simulation noise and low signal-to-noise ratio. To guard against noise misspecification, we assess the performance of three variants: (i) GPs with Student- t observations; (ii) Student- t processes (TPs); and (iii) classification GPs modeling the sign of the response. In conjunction with these metamodels, we analyze several acquisition functions for guiding the sequential experimental designs, extending existing stepwise uncertainty reduction criteria to the stochastic contour-finding context. This also motivates our development of (approximate) updating formulas to efficiently compute such acquisition functions. Our schemes are benchmarked by using a variety of synthetic experiments in 1–6 dimensions. We also consider an application of level set estimation for determining the optimal exercise policy of Bermudan options in finance.

97 MATHEMATICS AND COMPUTING↗

Gaussian approximation potential for amorphous Si : H

Hydrogenation of amorphous silicon (a–Si : H) is critical for reducing defect densities, passivating midgap states and surfaces, and improving photoconductivity in silicon-based electro-optical devices. Modeling the atomic-scale structure of this material is critical to understanding these processes, which in turn is needed to describe c–Si/a–Si : H heterojunctions that are at the heart of modern solar cells with world-record efficiency. Density functional theory (DFT) studies achieve the required high accuracy but are limited to moderate system sizes of 100 atoms or so by their high computational cost. Simulations of amorphous materials have been hindered by this high cost because large structural models are required to capture the medium-range order that is characteristic of such materials. Empirical potential models are much faster, but their accuracy is not sufficient to correctly describe the frustrated local structure. Data-driven, machine-learned interatomic potentials have broken this impasse and have been highly successful in describing a variety of amorphous materials in their elemental phase. Here, we extend the Gaussian approximation potential (GAP) for silicon by incorporating the interaction with hydrogen, thereby significantly improving the degree of realism with which amorphous silicon can be modeled. We show that our Si : H GAP enables the simulation of hydrogenated silicon with an accuracy very close to DFT but with computational expense and run times reduced by several orders of magnitude for large structures. Here, we demonstrate the capabilities of the Si : H GAP by creating models of hydrogenated liquid and amorphous silicon and showing that their energies, forces, and stresses are in excellent agreement with DFT results, and their structure as captured by bond and angle distributions are in agreement with both DFT and experiments.

36 MATERIALS SCIENCE↗

Algorithmic Patterns for $$\mathcal {H}$$-Matrices on Many-Core Processors

In this work, we consider the reformulation of hierarchical ( \(\mathcal {H}\) ) matrix algorithms for many-core processors with a model implementation on graphics processing units (GPUs). \(\mathcal {H}\) matrices approximate specific dense matrices, e.g., from discretized integral equations or kernel ridge regression, leading to log-linear time complexity in dense matrix–vector products. The parallelization of \(\mathcal {H}\) matrix operations on many-core processors is difficult due to the complex nature of the underlying algorithms. While previous algorithmic advances for many-core hardware focused on accelerating existing \(\mathcal {H}\) matrix CPU implementations by many-core processors, we here aim at totally relying on that processor type. As main contribution, we introduce the necessary parallel algorithmic patterns allowing to map the full \(\mathcal {H}\) matrix construction and the fast matrix–vector product to many-core hardware. In this work, crucial ingredients are space filling curves, parallel tree traversal and batching of linear algebra operations. The resulting model GPU implementation hmglib is the, to the best of the authors knowledge, first entirely GPU-based Open Source \(\mathcal {H}\) matrix library of this kind. We investigate application examples as present in kernel ridge regression, Gaussian Process Regression and kernel-based interpolation. In this context, an in-depth performance analysis and a comparative performance study against a standard multi-core CPU \(\mathcal {H}\) matrix library highlights profound speedups of our many-core parallel approach.

97 MATHEMATICS AND COMPUTING↗

Investigation of post-breakup Coulomb acceleration using a trajectory model

Intermediate mass fragments ejected during the deexcitation of excited projectilelike fragments may promptly decay following ejection; the daughter particles that are subsequently produced are subject to interactions with the residual nucleus that affect final-state observables, a process herein referred to as post-breakup Coulomb acceleration. A simple classical Coulomb interaction model was used to study modification of 8 Be (2 + ), 5 Li (3/2 – ), 7 Li (7/2 – ), 7 Be (7/2 – ), and states in 12 B emitted following heavy-ion collisions of 28 Si + 12 C at 35 MeV/nucleon. Here, in contrast to previous work studying 8 Be (2 + ), excellent agreement between simulation and experiment was obtained using only Coulomb forces when either a Lorentzian or R-matrix line shape was used to describe the initial relative energy rather than a Gaussian. In consideration of the obtained results, improvements to the model and evaluation of experimental data are discussed as future directions, but it was concluded that the effects observed in the present data can be accurately described using only elements of classical mechanics and that the process is largely understood for a wide range of state lifetimes and mass and charge (a)symmetries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

LIKELIHOOD-FREE COSMOLOGICAL INFERENCE WITH TYPE Ia SUPERNOVAE: APPROXIMATE BAYESIAN COMPUTATION FOR A COMPLETE TREATMENT OF UNCERTAINTY

Cosmological inference becomes increasingly difficult when complex data-generating processes cannot be modeled by simple probability distributions. With the ever-increasing size of data sets in cosmology, there is an increasing burden placed on adequate modeling; systematic errors in the model will dominate where previously these were swamped by statistical errors. For example, Gaussian distributions are an insufficient representation for errors in quantities like photometric redshifts. Likewise, it can be difficult to quantify analytically the distribution of errors that are introduced in complex fitting codes. Without a simple form for these distributions, it becomes difficult to accurately construct a likelihood function for the data as a function of parameters of interest. Approximate Bayesian computation (ABC) provides a means of probing the posterior distribution when direct calculation of a sufficiently accurate likelihood is intractable. ABC allows one to bypass direct calculation of the likelihood but instead relies upon the ability to simulate the forward process that generated the data. These simulations can naturally incorporate priors placed on nuisance parameters, and hence these can be marginalized in a natural way. We present and discuss ABC methods in the context of supernova cosmology using data from the SDSS-II Supernova Survey. Assuming a flat cosmology and constant dark energy equation of state, we demonstrate that ABC can recover an accurate posterior distribution. Finally, we show that ABC can still produce an accurate posterior distribution when we contaminate the sample with Type IIP supernovae.

79 ASTRONOMY AND ASTROPHYSICS↗

Microscopic constraints for the equation of state and structure of neutron stars: A Bayesian model mixing framework

Bayesian model mixing (BMM) is a statistical technique that can combine constraints from different regions of an input space in a principled way. Here we extend our BMM framework for the equation of state (EOS) of strongly interacting matter from symmetric nuclear matter to asymmetric matter, specifically focusing on zero-temperature, charge-neutral, 𝛽-equilibrated matter. We use Gaussian processes (GPs) to infer constraints on the neutron-star matter EOS at intermediate densities from two different microscopic theories: chiral effective-field theory (𝜒⁢EFT) at baryon densities around nuclear saturation, 𝑛 𝐵 ∼ 𝑛 0 , and perturbative QCD at asymptotically high baryon densities, 𝑛 𝐵 ⩾ 20⁢𝑛 0 . The uncertainties of the 𝜒⁢EFT and pQCD EOSs are obtained using the BUQEYE truncation error model. We demonstrate the flexibility of our framework through the use of two categories of GP kernels: conventional stationary kernels and a nonstationary changepoint kernel. We use the latter to explore potential constraints on the dense matter EOS by including exogenous data representing theory predictions and heavy-ion collision measurements at densities ⩾ 2⁢𝑛 0 . We also use our EOSs to obtain neutron-star mass-radius relations and their uncertainties. Finally, our framework, whose implementation will be available through a GitHub repository, provides a prior distribution for the EOS that can be used in large-scale neutron-star inference frameworks.

Bayesian methods↗

Uncertainty guided online ensemble for non-stationary data streams in fusion science

Machine Learning (ML) is poised to play a pivotal role in the development and operation of next-generation fusion devices. Fusion data shows non-stationary behavior with distribution drifts, resulted by both experimental evolution and machine wear-and-tear. ML models assume stationary distribution and fail to maintain performance when encountered with such non-stationary data streams. Online learning techniques have been leveraged in other domains, however it has been largely unexplored for fusion applications. In this paper, we investigate online learning for continuous adaptation to drifting data streams in the prediction of Toroidal Field (TF) coils deflection at the DIII-D fusion facility. We further address the short-term performance degradation inherent to standard online learning, which arises because ground truth is unavailable at prediction time. To mitigate this issue, we propose an uncertainty-guided online ensemble framework. The method leverages the Deep Gaussian Process Approximation (DGPA) for calibrated uncertainty estimation and uses these uncertainty measures to guide a meta-algorithm that aggregates predictions from learners trained over different historical horizons. Our results show that online learning reduces prediction error by 80% compared to a static model. The online ensemble and the proposed uncertainty-guided ensemble further reduce error by approximately 6%, and 10% respectively, relative to standard single-model online learning, while also providing calibrated uncertainty estimates to support operational decision-making.

AI↗

Parallel Environment for the Creation of Stochastics 1.0

PECOS is a computational library for creating and manipulating realizations of stochastic quantities, including scalar uncertain variables, random fields, and stochastic processes. It offers a unified interface to univariate and multivariate polynomial approximations using either orthogonal or interpolation polynomials; numerical integration drivers for Latin hypercube sampling, quadrature, cubature, and sparse grids; and fast Fourier transforms using third party libraries. The PECOS core also offers statistical utilities and transformations between various representations of stochastic uncertainty. PECOS provides a C++ API through which users can generate and transform realizations of stochastic quantities. It is currently used by Sandia's DAKOTA, Stokhos, and Encore software packages for uncertainty quantification and verification. PECOS generates random sample sets and multi-dimensional integration grids, typically used in forward propagation of scalar uncertainty in computational models (uncertainty quantification (UQ)). PECOS also generates samples of random fields (RFs) and stochastic processes (SPs) from a set of user-defined power spectral densities (PSDs). The RF/SP may be either Gaussian or non-Gaussian and either stationary or nonstationary, and the resulting sample is intended for run-time query by parallel finite element simulation codes. Finally, PECOS supports nonlinear transformations of random variables via the Nataf transformation and extensions.

Field Jr, Richard↗

fvGP v2.2.0

fvGP is a flexible Gaussian process API that enables gpCAM, a software recently submitted, to do uncertainty quantification and steer data acquisition autonomously. In short, given a bunch of data, fvGP can find the most likely model creating the data and the model's uncertainty.

Noack, Marcus↗