Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling algorithms”

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 289 records · Page 16

Compressive Phase Contrast Tomography

When x-rays penetrate soft matter, their phase changes more rapidly than their amplitude. Interference effects visible with high brightness sources creates higher contrast, edge enhanced images. When the object is piecewise smooth (made of big blocks of a few components), such higher contrast datasets have a sparse solution. We apply basis pursuit solvers to improve SNR, remove ring artifacts, reduce the number of views and radiation dose from phase contrast datasets collected at the Hard X-Ray Micro Tomography Beamline at the Advanced Light Source. We report a GPU code for the most computationally intensive task, the gridding and inverse gridding algorithm (non uniform sampled Fourier transform).

47 OTHER INSTRUMENTATION↗

Nonlinear dimension reduction for surrogate modeling using gradient information

We introduce a method for the nonlinear dimension reduction of a high-dimensional function $u:{\mathbb{R}}^d\rightarrow{\mathbb{R}}$, $d\gg 1$. Our objective is to identify a nonlinear feature map $g:{\mathbb{R}}^d\rightarrow{\mathbb{R}}^m$, with a prescribed intermediate dimension $m\ll d$, so that $u$ can be well approximated by $f\circ g$ for some profile function $f:{\mathbb{R}}^m\rightarrow{\mathbb{R}}$. We propose to build the feature map by aligning the Jacobian $\nabla g$ with the gradient $\nabla u$, and we theoretically analyze the properties of the resulting $g$. Once $g$ is built, we construct $f$ by solving a gradient-enhanced least squares problem. Our practical algorithm uses a sample $\{{\textbf{x}}^{(i)},u({\textbf{x}}^{(i)}),\nabla u({\textbf{x}}^{(i)})\}_{i=1}^N$ and builds both $g$ and $f$ on adaptive downward-closed polynomial spaces, using cross validation to avoid overfitting. We numerically evaluate the performance of our algorithm across different benchmarks, and explore the impact of the intermediate dimension $m$. We show that building a nonlinear feature map $g$ can permit more accurate approximation of $u$ than a linear $g$, for the same input data set.

97 MATHEMATICS AND COMPUTING↗

Exercises in high-dimensional sampling: maximal poisson-disk sampling and k -d darts

In this paper, we review our recent progress on efficient algorithms for generating well-spaced samples of high dimensional data, and for exploring and characterizing these data, the underlying domain, and functions over the domain. To our knowledge, these techniques have not yet been applied to computational topology, but the possible connections are worth considering. In particular, computational topology problems often have difficulty in scaling efficiently, and these sampling techniques have the potential to drastically reduce the size of the data over which these computational topology algorithms must operate. Lastly, we summarize the definition of these sample distributions; algorithms for generating them in low, moderate, and high dimensions; and applications in mesh generation, rendering, motion planning and simulation.

97 MATHEMATICS AND COMPUTING↗

SPT-SZ MCMF: an extension of the SPT-SZ catalogue over the DES region

We present an extension to a Sunyaev–Zel’dovich Effect (SZE) selected cluster catalogue based on observations from the South Pole Telescope (SPT); this catalogue extends to lower signal to noise than the previous SPT–SZ catalogue and therefore includes lower mass clusters. Optically derived redshifts, centres, richnesses, and morphological parameters together with catalogue contamination and completeness statistics are extracted using the multicomponent matched filter (MCMF) algorithm applied to the S/N > 4 SPT–SZ candidate list and the Dark Energy Survey (DES) photometric galaxy catalogue. The main catalogue contains 811 sources above S/N = 4, has 91 per cent purity, and is 95 per cent complete with respect to the original SZE selection. It contains in total 50 per cent more clusters and twice as many clusters above z = 0.8 in comparison to the original SPT-SZ sample. The MCMF algorithm allows us to define subsamples of the desired purity with traceable impact on catalogue completeness. As an example, we provide two subsamples with S/N > 4.25 and S/N > 4.5 for which the sample contamination and cleaning-induced incompleteness are both as low as the expected Poisson noise for samples of their size. The subsample with S/N > 4.5 has 98 per cent purity and 96 per cent completeness and is part of our new combined SPT cluster and DES weak-lensing cosmological analysis. We measure the number of false detections in the SPT-SZ candidate list as function of S/N, finding that it follows that expected from assuming Gaussian noise, but with a lower amplitude compared to previous estimates from simulations.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Risk Analysis Virtual ENvironment

RAVEN has 3 major functionalities: 1. Provides a Graphical User Interface for the pre- and post-processing of the RELAP-7 input and output. 2. Provides the capability to model nuclear power plants control logic for the RELAP-7 code and dynamic control of the accident scenario evolution. This capability is based on a software structure that realizes a direct connection between the RELAP-7 solver engine (MOOSE) and a python environment where the variables describing the plant status are accessible in a scripting environment. RAVEN support the generation of the probabilistic scenario control by supplying a wide range of probability and cumulative distribution functions and their inverse functions. 3. Provides a general environment to perform probability risk analysis for RELAP-7, RELAP-5 and any generic MOOSE based applications. The probabilistic analysis is performed by sampling the input space of the coupled code parameters and it is enhanced by using modern artificial intelligence algorithms that accelerate the identification of the areas of major risk (in the input parameter space). This environment also provides a graphical visualization capability to analyze the outcomes. Among other approaches, the classical Monte Carlo and Latin Hypercube sampling algorithms are available. For the acceleration of the convergence of the sampling methodologies, Support Vector Machines, Bayesian regression, and collocation stochastic polynomials chaos are implemented. The same methodologies here described could be used to solve optimization and uncertainties propagation problems using the RAVEN framework.

Rabiti, Cristian↗

Conditional Point Sampling: A Monte Carlo Method for Radiation Transport in Stochastic Media.

Current methods for stochastic media transport are either computationally expensive or, by nature, approximate. Moreover, none of the well-developed, benchmarked approximate methods can compute the variance caused by the stochastic mixing, a quantity especially important to safety calculations. Therefore, we derive and apply a new conditional probability function (CPF) for use in the recently developed stochastic media transport algorithm Conditional Point Sampling (CoPS), which 1) leverages the full intra-particle memory of CoPS to yield errorless computation of stochastic media outputs in 1D, binary, Markovian-mixed media, and 2) leverages the full inter-particle memory of CoPS and the recently developed Embedded Variance Deconvolution method to yield computation of the variance in transport outputs caused by stochastic material mixing. Numerical results demonstrate errorless stochastic media transport as compared to reference benchmark solutions with the new CPF for this class of stochastic mixing as well as the ability to compute the variance caused by the stochastic mixing via CoPS. Using previously derived, non-errorless CPFs, CoPS is further found to be more accurate than the atomic mix approximation, Chord Length Sampling (CLS), and most of memory-enhanced versions of CLS surveyed. In addition, we study the compounding behavior of CPF error as a function of cohort size (where a cohort is a group of histories that share intra-particle memory) and recommend that small cohorts be used when computing the variance in transport outputs caused by stochastic mixing.

61 RADIATION PROTECTION AND DOSIMETRY↗

Dark Energy Survey Deep Field photometric redshift performance and training incompleteness assessment

Context. The determination of accurate photometric redshifts (photo-zs) in large imaging galaxy surveys is key for cosmological studies. One of the most common approaches are machine learning techniques. These methods require a spectroscopic or reference sample to train the algorithms. Attention has to be paid to the quality and properties of these samples since they are key factors in the estimation of reliable photo-zs. Aims. The goal of this work is to calculate the photo-zs for the Y3 DES Deep Fields catalogue using the DNF machine learning algorithm. Moreover, we want to develop techniques to assess the incompleteness of the training sample and metrics to study how incompleteness affects the quality of photometric redshifts. Finally, we are interested in comparing the performance obtained with respect to the EAzY template fitting approach on Y3 DES Deep Fields catalogue. Methods. We have emulated -- at brighter magnitude -- the training incompleteness with a spectroscopic sample whose redshifts are known to have a measurable view of the problem. We have used a principal component analysis to graphically assess incompleteness and to relate it with the performance parameters provided by DNF. Finally, we have applied the results about the incompleteness to the photo-z computation on Y3 DES Deep Fields with DNF and estimated its performance. Results. The photo-zs for the galaxies on DES Deep Fields have been computed with the DNF algorithm and added to the Y3 DES Deep Fields catalogue. They are available at https://des.ncsa.illinois.edu/releases/y3a2/Y3deepfields. Some techniques have been developed to evaluate the performance in the absence of "true" redshift and to assess completeness. We have studied... (Partial abstract)

79 ASTRONOMY AND ASTROPHYSICS↗

ARM West Antarctic Radiation Experiment (AWARE) Fourier Transform Infrared Filter Sampling Systems Field Campaign Report

West Antarctica is one of the most rapidly warming regions in the world (Bromwich et al. 2013; Steig et al. 2009) and the warming can directly cause sea level rise (King et al. 2012). In situ measurements are needed to examine and quantify the meteorological conditions in order to precisely understand the effect of warm air and clouds on the West Antarctic Ice Shelf (WAIS). The U.S. Department of Energy (DOE) Atmospheric Radiation Measurement (ARM) West Antarctic Radiation Experiment (AWARE) is designed to collect measurements with advanced cloud and aerosol instrumentation at West Antarctica. The Fourier Transform Infrared (FTIR) filter sampling systems were deployed as part of the ARM West Antarctic Radiation Experiment (AWARE) campaign to measure organic aerosol characteristics at McMurdo Station. As a coastal station at the southern end of Ross Island, McMurdo Station has a meteorological relationship with the WAIS via circulation patterns in the Ross and Amundsen Seas. Thirteen months of continuous observations of aerosol particle composition extended from December 2016 to January 2017. Filter samples were collected at McMurdo on pre-scanned Teflon filters (Teflon, Pall Inc., 37mm diameter) behind PM1 sharp-cut cyclones (SCC2.229 PM1, BGI Inc). Samples were collected each week with approximately 50-90 m3 air filtered per sample. Samples were frozen and transported below 0°C to the Scripps laboratory for FTIR spectroscopy analysis. A Bruker Tensor 27 FTIR spectrometer with a deuterated triglycine sulfate (DTGS) detector (Bruker, Waltham, MA) was used to scan the filters both before and after sampling. An automated algorithm (Takahama et al. 2013) was applied to quantify the mass of the organic functional groups. Four groups (alkane, amine, alcohol, and carboxylic acid) had absorption peaks above the limits of quantification, and the sum of the mass of the four functional groups is the quantified organic mass (OM). Absorption peaks for other groups (organosulfate, organonitrate, aromatic, and alkene group) were identified and fit but they were below the limit of quantification for more than 90% of the samples and are excluded. Similar FTIR measurements has been conducted in dozens of field campaigns around the world, including arctic regions (Russell et al. 2011). Local particle emissions from airports, diesel generators, and local transportation affected all aerosol measurements at various times during this project. The ARM Aerosol Measurement Science Group is aware of the issue and is working to develop algorithms to flag the data. This influence is evident in the FTIR measurements as it is associated with specific chemical signatures. DOE and the National Science Foundation, which manages the U.S. Antarctic Program, supported this collaboration for AWARE.

ARM West Antarctic Radiation Experiment, Fourier T↗

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↗

Visual Sample Plan Version 7.0 User's Guide

User's guide for VSP 7.0 This user's guide describes Visual Sample Plan (VSP) Version 7.0 and provides instructions for using the software. VSP selects the appropriate number and location of environmental samples to ensure that the results of statistical tests performed to provide input to risk decisions have the required confidence and performance. VSP Version 7.0 provides sample-size equations or algorithms needed by specific statistical tests appropriate for specific environmental sampling objectives. It also provides data quality assessment and statistical analysis functions to support evaluation of the data and determine whether the data support decisions regarding sites suspected of contamination. The easy-to-use program is highly visual and graphic. VSP runs on personal computers with Microsoft Windows operating systems (XP, Vista, Windows 7, and Windows 8). Designed primarily for project managers and users without expertise in statistics, VSP is applicable to two- and three-dimensional populations to be sampled (e.g., rooms and buildings, surface soil, a defined layer of subsurface soil, water bodies, and other similar applications) for studies of environmental quality. VSP is also applicable for designing sampling plans for assessing chem/rad/bio threat and hazard identification within rooms and buildings, and for designing geophysical surveys for unexploded ordnance (UXO) identification.

97 MATHEMATICS AND COMPUTING↗

hIPPYlib-MUQ: A Bayesian Inference Software Framework for Integration of Data with Complex Predictive Models under Uncertainty

Bayesian inference provides a systematic framework for integration of data with mathematical models to quantify the uncertainty in the solution of the inverse problem. However, the solution of Bayesian inverse problems governed by complex forward models described by partial differential equations (PDEs) remains prohibitive with black-box Markov chain Monte Carlo (MCMC) methods. We present hIPPYlib-MUQ, an extensible and scalable software framework that contains implementations of state-of-the art algorithms aimed to overcome the challenges of high-dimensional, PDE-constrained Bayesian inverse problems. These algorithms accelerate MCMC sampling by exploiting the geometry and intrinsic low-dimensionality of parameter space via derivative information and low rank approximation. The software integrates two complementary open-source software packages, hIPPYlib and MUQ. hIPPYlib solves PDE-constrained inverse problems using automatically-generated adjoint-based derivatives, but it lacks full Bayesian capabilities. MUQ provides a spectrum of powerful Bayesian inversion models and algorithms, but expects forward models to come equipped with gradients and Hessians to permit large-scale solution. By combining these two complementary libraries, we created a robust, scalable, and efficient software framework that realizes the benefits of each and allows us to tackle complex large-scale Bayesian inverse problems across a broad spectrum of scientific and engineering disciplines. To illustrate the capabilities of hIPPYlib-MUQ, we present a comparison of a number of MCMC methods available in the integrated software on several high-dimensional Bayesian inverse problems. These include problems characterized by both linear and nonlinear PDEs, various noise models, and different parameter dimensions. The results demonstrate that large (~ 50×) speedups over conventional black box and gradient-based MCMC algorithms can be obtained by exploiting Hessian information (from the log-posterior), underscoring the power of the integrated hIPPYlib-MUQ framework.

97 MATHEMATICS AND COMPUTING↗

SPIDERS: the spectroscopic follow-up of X-ray-selected clusters of galaxies in SDSS-IV

SPIDERS (The SPectroscopic IDentification of ERosita Sources) is a programme dedicated to the homogeneous and complete spectroscopic follow-up of X-ray active galactic nuclei and galaxy clusters over a large area (~7500 deg 2 ) of the extragalactic sky. SPIDERS is part of the Sloan Digital Sky Survey (SDSS)-IV project, together with the Extended Baryon Oscillation Spectroscopic Survey and the Time-Domain Spectroscopic Survey. This study describes the largest project within SPIDERS before the launch of eROSITA: an optical spectroscopic survey of X-ray-selected, massive (~10 14 –10 15 M⊙) galaxy clusters discovered in ROSAT and XMM–Newton imaging. The immediate aim is to determine precise (Δz ~ 0.001) redshifts for 4000–5000 of these systems out to z ~ 0.6. The scientific goal of the program is precision cosmology, using clusters as probes of large-scale structure in the expanding Universe. We present the cluster samples, target selection algorithms and observation strategies. We demonstrate the efficiency of selecting targets using a combination of SDSS imaging data, a robust red-sequence finder and a dedicated prioritization scheme. We describe a set of algorithms and work-flow developed to collate spectra and assign cluster membership, and to deliver catalogues of spectroscopically confirmed clusters. We discuss the relevance of line-of-sight velocity dispersion estimators for the richer systems. We illustrate our techniques by constructing a catalogue of 230 spectroscopically validated clusters (0.031 < z < 0.658), found in pilot observations. Finally, we discuss two potential science applications of the SPIDERS sample: the study of the X-ray luminosity-velocity dispersion (LX–σ) relation and the building of stacked phase-space diagrams.

79 ASTRONOMY AND ASTROPHYSICS↗

A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits

We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational basis). Our approach is based upon the intuition that noise exponentially damps nonlocal correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by keeping track of only the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in quasipolynomial time, so long as the distribution anticoncentrates. A number of implications are discussed, including a fundamental limit on the efficacy of noise mitigation strategies: For constant noise rates, any quantum circuit for which error mitigation succeeds in polynomial-time on most input states can also be classically simulated in polynomial-time on most input states. Our algorithms scale exponentially in the inverse noise rate, which is fundamental and makes them impractical for current quantum devices.

decoherence↗

Variable resolution Poisson-disk sampling for meshing discrete fracture networks

Here, we present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions for variable resolution Delaunay triangular and tetrahedral meshes in two and three-dimensions, respectively. nMAPS consists of two principal stages. In the first stage, an initial point distribution is produced using a cell-based rejection algorithm. In the second stage, holes in the sample are detected using an efficient background grid and filled in to obtain a near-maximal covering. Extensive testing shows that nMAPS generates a variable resolution mesh in linear run time with the number of accepted points. We demonstrate nMAPS capabilities by meshing three-dimensional discrete fracture networks (DFN) and the surrounding volume. The discretized boundaries of the fractures, which are represented as planar polygons, are used as the seed of 2D-nMAPS to produce a conforming Delaunay triangulation. The combined mesh of the DFN is used as the seed for 3D-nMAPS, which produces conforming Delaunay tetrahedra surrounding the network. Under a set of conditions that naturally arise in maximal Poisson-disk samples and are satisfied by nMAPS, the two-dimensional Delaunay triangulations are guaranteed to only have well-behaved triangular faces. While nMAPS does not provide triangulation quality bounds in more than two dimensions, we found that low-quality tetrahedra in 3D are infrequent, can be readily detected and removed, and a high-quality balanced mesh is produced.

97 MATHEMATICS AND COMPUTING↗

Less is more: Sampling chemical space with active learning

We present the development of accurate and transferable machine learning (ML) potentials for predicting molecular energetics is a challenging task. The process of data generation to train such ML potentials is a task neither well understood nor researched in detail. In this work, we present a fully automated approach for the generation of datasets with the intent of training universal ML potentials. It is based on the concept of active learning (AL) via Query by Committee (QBC), which uses the disagreement between an ensemble of ML potentials to infer the reliability of the ensemble’s prediction. QBC allows the presented AL algorithm to automatically sample regions of chemical space where the ML potential fails to accurately predict the potential energy. AL improves the overall fitness of ANAKIN-ME (ANI) deep learning potentials in rigorous test cases by mitigating human biases in deciding what new training data to use. AL also reduces the training set size to a fraction of the data required when using naive random sampling techniques. To provide validation of our AL approach, we develop the COmprehensive Machine-learning Potential (COMP6) benchmark (publicly available on GitHub) which contains a diverse set of organic molecules. Active learning-based ANI potentials outperform the original random sampled ANI-1 potential with only 10% of the data, while the final active learning-based model vastly outperforms ANI-1 on the COMP6 benchmark after training to only 25% of the data. Finally, we show that our proposed AL technique develops a universal ANI potential (ANI-1x) that provides accurate energy and force predictions on the entire COMP6 benchmark. Finally, this universal ML potential achieves a level of accuracy on par with the best ML potentials for single molecules or materials, while remaining applicable to the general class of organic molecules composed of the elements CHNO.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

QSO photometric redshifts from SDSS, WISE, and GALEX colours

ABSTRACT Machine learning techniques, specifically the k-nearest neighbour algorithm applied to optical band colours, have had some success in predicting photometric redshifts of quasi-stellar objects (QSOs): Although the mean of differences between the spectroscopic and photometric redshifts, Δ$z$, is close to zero, the distribution of these differences remains wide and distinctly non-Gaussian. As per our previous empirical estimate of photometric redshifts, we find that the predictions can be significantly improved by adding colours from other wavebands, namely the near-infrared and ultraviolet. Self-testing this, by using half of the 33 643 strong QSO sample to train the algorithm, results in a significantly narrower spread in Δ$z$ for the remaining half of the sample. Using the whole QSO sample to train the algorithm, the same set of magnitudes return a similar spread in Δ$z$ for a sample of radio sources (quasars). Although the matching coincidence is relatively low (739 of the 3663 sources having photometry in the relevant bands), this is still significantly larger than from the empirical method (2 per cent) and thus may provide a method with which to obtain redshifts for the vast number of continuum radio sources expected to be detected with the next generation of large radio telescopes.

Curran, S. J.↗

Design of Experiments, Model Calibration and Data Assimilation

This presentation provides an overview of emulation, calibration and experiment design for computer experiments. Emulation refers to building a statistical surrogate from a carefully selected and limited set of model runs to predict unsampled outputs. The standard kriging approach to emulation of complex computer models is presented. Calibration refers to the process of probabilistically constraining uncertain physics/engineering model inputs to be consistent with observed experimental data. An initial probability distribution for these parameters is updated using the experimental information. Markov chain Monte Carlo (MCMC) algorithms are often used to sample the calibrated parameter distribution. Several MCMC algorithms commonly employed in practice are presented, along with a popular diagnostic for evaluating chain behavior. Space-filling approaches to experiment design for selecting model runs to build effective emulators are discussed, including Latin Hypercube Design and extensions based on orthogonal array skeleton designs and imposed symmetry requirements. Optimization criteria that further enforce space-filling, possibly in projections of the input space, are mentioned. Designs to screen for important input variations are summarized and used for variable selection in a nuclear fuels performance application. This is followed by illustration of sequential experiment design strategies for optimization, global prediction, and rare event inference.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗