Search NASA⌕ Search

SEARCH · Search NASA

Results for “Stochastic Sampling”

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 667 records · Page 37

Modified Closures in Monte Carlo Algorithms for Diffusive Binary Stochastic Media Transport Problems

In a stochastic medium, the material properties at a given spatial location are known only statistically. The most common approach to solving particle transport problems involving binary stochastic media (BSM) is to use the atomic mix approximation in which the transport problem is solved using homogenized (volume-averaged) material properties. A common deterministic model developed for solving BSM particle transport problems is the Levermore-Pomraning (LP) model. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the LP equations and another Monte Carlo algorithm (Algorithm B) that locally preserves the sampled material realization; we refer to these Monte Carlo algorithms as the LP and LPLRP (LP local realization preserving) algorithms, respectively. One-dimensional (1D) planar geometry benchmark studies have shown that the LPLRP algorithm is often significantly more accurate than the LP algorithm for problems with an incident angular flux as well as for problems with an interior source. The LPLRP algorithm implementation in these benchmark comparisons made explicit use of the one-dimensional nature of the problem. The LP model is derived by assuming an 'upwind' closure in the coupling term relating the two materials in a binary stochastic medium. Su and Pomraning developed a modified form of this closure by considering the small correlation length limit and requiring the modified closure to produce the correct exponential decay for a source-free half-line albedo problem in rod geometry. They concluded that the modified closure is generally not inferior to the LP closure and in some cases is significantly better. Brantley investigated the use of the Su-Pomraning (SP) closure in the Monte Carlo LP algorithm (LP-SP) for the suite of benchmark problems and concluded that 1) the LP-SP algorithm was somewhat more accurate overall than the LP algorithm and somewhat less accurate overall than the LPLRP algorithm for an incident angular flux benchmark suite, and 2) the LP-SP algorithm was generally the least accurate of the algorithms for an interior source benchmark suite. Larsen et al. performed an asymptotic analysis of the transport equation in 1D planar geometry for the situation in which the physical system is 1) a random binary stochastic medium with material macroscopic total cross sections and mean slab width values of O(1) or smaller and 2) optically thick with weak absorption and sources at each spatial point and therefore globally diffusive. The asymptotic analysis demonstrates that, under these assumptions, the transport equation limits to the conventional diffusion equation with atomically-mixed (volume-averaged) material properties. Larsen et al. also demonstrate that, under these same assumptions, the LP equations asymptotically limit to an atomically-mixed diffusion equation with a diffusion coefficient that is too large, leading to an unphysical flattening of the ensemble-averaged scalar flux distribution. Vasques and Yadav recently performed an asymptotic analysis of an adjusted Levermore-Pomraning closure in which the Markovian transition functions are rescaled such that the equations asymptotically limit to the correct atomically-mixed diffusion equation; we refer to this model as LP-VY. In this paper, we demonstrate that the adjusted LP closure proposed by Vasques and Yadav is a special case of the SP closure obtained by assuming that the absorption cross sections in the two materials are equal. We further demonstrate that the Su-Pomraning closure has the correct asymptotic limit for the diffusive physical system and is therefore an appropriate closure for these problems. We also describe how to incorporate these various closures into the Monte Carlo LP and LPLRP particle transport algorithms, and we present numerical results comparing the accuracy of the Monte Carlo LP, LP-VY, LP-SP, LPLRP, and LPLRP-SP algorithms for the set of diffusive benchmark problems. We demonstrated that the SP closure has the correct asymptotic limit for the diffusive physical system under investigation in this paper and that the VY closure is a special case of the SP closure obtained by assuming equal absorption in the two materials. Both of these closures are readily implemented in the Monte Carlo LP and LPLRP algorithms for particle transport in BSM. Through numerical comparisons to a diffusive benchmark suite, we confirmed that 1) the LP and LPLRP algorithms do not limit to the appropriate diffusion solution and 2) the LP-VY, LP-SP, and LPLRP-SP algorithms limit to the appropriate diffusion solution and are of comparable accuracy. The LPLRP algorithm has been shown to be generally more accurate than the LP algorithm for non-diffusive problems. However, the numerical results in this paper indicate that the LPLRP algorithm does not limit to the correct diffusion equation for the asymptotic limit under consideration. The work in this paper demonstrates that the SP algorithm does limit to the correct diffusion equation for the asymptotic limit considered. Future work will investigate the possibility of whether the LPLRP-SP algorithm is accurate for both diffusive and non-diffusive problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimization using pathwise algorithmic derivatives of electromagnetic shower simulations

Among the well-known methods to approximate derivatives of expectancies computed by Monte-Carlo simulations, averages of pathwise derivatives are often the easiest one to apply. Computing them via algorithmic differentiation typically does not require major manual analysis and rewriting of the code, even for very complex programs like simulations of particle-detector interactions in high-energy physics. However, the pathwise derivative estimator can be biased if there are discontinuities in the program, which may diminish its value for applications. This work integrates algorithmic differentiation into the electromagnetic shower simulation code HepEmShow based on G4HepEm, allowing us to study how well pathwise derivatives approximate derivatives of energy depositions in a sampling calorimeter with respect to parameters of the beam and geometry. We found that when multiple scattering is disabled in the simulation, means of pathwise derivatives converge quickly to their expected values, and these are close to the actual derivatives of the energy deposition. Additionally, we demonstrate the applicability of this novel gradient estimator for stochastic gradient-based optimization in a model example.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Further Development and Application of GEOFRAC-FLOW to a Geothermal Reservoir

GEOFRAC is a three-dimensional, geology-based, geometric-mechanical, hierarchical, stochastic model of natural rock fracture systems. The main characteristics of GEOFRAC are its use of statistical input representing fracture patterns in the field in form of the fracture intensity P32 (fracture area per volume) and the best estimate fracture size E(A). This information can be obtained from boreholes or scanlines on the surface, on the one hand, and from window sampling of fracture traces on the other hand. In the context of this project, “Recovery Act - Decision Aids for Geothermal Systems”, GEOFRAC was further developed into GEOFRAC-FLOW as has been reported in the reports, “Decision Aids for Geothermal Systems - Fracture Pattern Modelling” and “Decision Aids for Geothermal Systems - Fracture Flow Modeling”. GEOFRAC-FLOW allows one to determine preferred, interconnected fracture paths and the flow through them.

15 GEOTHERMAL ENERGY↗

Semiparametric modeling: Correcting low-dimensional model error in parametric models

In this paper, a semiparametric modeling approach is introduced as a paradigm for addressing model error arising from unresolved physical phenomena. Our approach compensates for model error by learning an auxiliary dynamical model for the unknown parameters. Practically, the proposed approach consists of the following steps. Given a physics-based model and a noisy data set of historical observations, a Bayesian filtering algorithm is used to extract a time-series of the parameter values. Subsequently, the diffusion forecast algorithm is applied to the retrieved time-series in order to construct the auxiliary model for the time evolving parameters. The semiparametric forecasting algorithm consists of integrating the existing physics-based model with an ensemble of parameters sampled from the probability density function of the diffusion forecast. To specify initial conditions for the diffusion forecast, a Bayesian semiparametric filtering method that extends the Kalman-based filtering framework is introduced. In difficult test examples, which introduce chaotically and stochastically evolving hidden parameters into the Lorenz-96 model, we show that our approach can effectively compensate for model error, with forecasting skill comparable to that of the perfect model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Environmental stress mediates groundwater microbial community assembly

Community assembly describes how different ecological processes shape microbial community composition and structure. How environmental factors impact community assembly remains elusive. Here we sampled microbial communities and >200 biogeochemical variables in groundwater at the Oak Ridge Field Research Center, a former nuclear waste disposal site, and developed a theoretical framework to conceptualize the relationships between community assembly processes and environmental stresses. We found that stochastic assembly processes were critical (>60% on average) in shaping community structure, but their relative importance decreased as stress increased. Dispersal limitation and ‘drift’ related to random birth and death had negative correlations with stresses, whereas the selection processes leading to dissimilar communities increased with stresses, primarily related to pH, cobalt and molybdenum. Assembly mechanisms also varied greatly among different phylogenetic groups. As a result, our findings highlight the importance of microbial dispersal limitation and environmental heterogeneity in ecosystem restoration and management.

54 ENVIRONMENTAL SCIENCES↗

Counting generations in birth and death processes with competing Erlang and exponential waiting times

Lymphocyte populations, stimulated in vitro or in vivo, grow as cells divide. Stochastic models are appropriate because some cells undergo multiple rounds of division, some die, and others of the same type in the same conditions do not divide at all. If individual cells behave independently, then each cell can be imagined as sampling from a probability density of times to division and death. The exponential density is the most mathematically and computationally convenient choice. It has the advantage of satisfying the memoryless property, consistent with a Markov process, but it overestimates the probability of short division times. With the aim of preserving the advantages of a Markovian framework while improving the representation of experimentally-observed division times, we consider a multi-stage model of cellular division and death. We use Erlang-distributed (or, more generally, phase-type distributed) times to division, and exponentially distributed times to death. We classify cells into generations, using the rule that the daughters of cells in generation n are in generation n + 1. In some circumstances, our representation is equivalent to established models of lymphocyte dynamics. We find the growth rate of the cell population by calculating the proportions of cells by stage and generation. The exponent describing the late-time cell population growth, and the criterion for extinction of the population, differs from what would be expected if N steps with rate λ were equivalent to a single step of rate λ/N. We link with a published experimental dataset, where cell counts were reported after T cells were transferred to lymphopenic mice, using Approximate Bayesian Computation. In the comparison, the death rate is assumed to be proportional to the generation and the Erlang time to division for generation 0 is allowed to differ from that of subsequent generations. The multi-stage representation is preferred to a simple exponential in posterior distributions, and the mean time to first division is estimated to be longer than the mean time to subsequent divisions.

59 BASIC BIOLOGICAL SCIENCES↗

On the evolution of film roughness during magnetron sputtering deposition

The effect of long-range screening on the surface morphology of thin films grown with pulsed-dc (p-dc) magnetron sputtering is studied. The surface evolution is described by a stochastic diffusion equation that includes the nonlocal shadowing effects in three spatial dimensions. The diffusional relaxation and the angular distribution of the incident particle flux strongly influence the transition to the shadowing growth regime. In the magnetron sputtering deposition the shadowing effect is essential because of the configuration of the magnetron system (finite size of sputtered targets, rotating sample holder, etc.). A realistic angular distribution of depositing particles is constructed by taking into account the cylindrical magnetron geometry. Simulation results are compared with the experimental data of surface roughness evolution during 100 and 350 kHz p-dc deposition, respectively.

36 MATERIALS SCIENCE↗

Higher-order time integration of Coulomb collisions in a plasma using Langevin equations

The extension of Langevin-equation Monte-Carlo algorithms for Coulomb collisions from the conventional Euler–Maruyama time integration to the next higher order of accuracy, the Milstein scheme, has been developed, implemented, and tested. This extension proceeds via a formulation of the angular scattering directly as stochastic differential equations in the fixed-frame spherical-coordinate velocity variables. Results from the numerical implementation show the expected improvement [O(Δt) vs. O(Δt{sup 1/2})] in the strong convergence rate both for the speed |v| and angular components of the scattering. An important result is that this improved convergence is achieved for the angular component of the scattering if and only if the “area-integral” terms in the Milstein scheme are included. The resulting Milstein scheme is of value as a step towards algorithms with both improved accuracy and efficiency. These include both algorithms with improved convergence in the averages (weak convergence) and multi-time-level schemes. The latter have been shown to give a greatly reduced cost for a given overall error level when compared with conventional Monte-Carlo schemes, and their performance is improved considerably when the Milstein algorithm is used for the underlying time advance versus the Euler–Maruyama algorithm. A new method for sampling the area integrals is given which is a simplification of an earlier direct method and which retains high accuracy. This method, while being useful in its own right because of its relative simplicity, is also expected to considerably reduce the computational requirements for the direct conditional sampling of the area integrals that is needed for adaptive strong integration.

97 MATHEMATICS AND COMPUTING↗

TH-CD-207B-06: Swank Factor of Segmented Scintillators in Multi-Slice CT Detectors: Pulse Height Spectra and Light Escape

Purpose: Pulse height spectra (PHS) have been used to determine the Swank factor of a scintillator by measuring fluctuations in its light output per x-ray interaction. The Swank factor and x-ray quantum efficiency of a scintillator define the upper limit to its imaging performance, i.e. DQE(0). The Swank factor below the K-edge is dominated by optical properties, i.e. variations in light escape efficiency from different depths of interaction, denoted e(z). These variations can be optimized to improve tradeoffs in x-ray absorption, light yield, and spatial resolution. This work develops a quantitative model for interpreting measured PHS, and estimating e(z) on an absolute scale. The method is used to investigate segmented ceramic GOS scintillators used in multi-slice CT detectors. Methods: PHS of a ceramic GOS plate (1 mm thickness) and segmented GOS array (1.4 mm thick) were measured at 46 keV. Signal and noise propagation through x-ray conversion gain, light escape, detection by a photomultiplier tube and dynode amplification were modeled using a cascade of stochastic gain stages. PHS were calculated with these expressions and compared to measurements. Light escape parameters were varied until modeled PHS agreed with measurements. The resulting estimates of e(z) were used to calculate PHS without measurement noise to determine the inherent Swank factor. Results: The variation in e(z) was 67.2–89.7% in the plate and 40.2–70.8% in the segmented sample, corresponding to conversion gains of 28.6–38.1 keV{sup −1} and 17.1–30.1 keV{sup −1}, respectively. The inherent Swank factors of the plate and segmented sample were 0.99 and 0.95, respectively. Conclusion: The high light escape efficiency in the ceramic GOS samples yields high Swank factors and DQE(0) in CT applications. The PHS model allows the intrinsic optical properties of scintillators to be deduced from PHS measurements, thus it provides new insights for evaluating the imaging performance of segmented ceramic GOS scintillators.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Accounting for Parameter Uncertainty in Reservoir Uncertainty Assessment: The Conditional Finite-Domain Approach

An important aim of modern geostatistical modeling is to quantify uncertainty in geological systems. Geostatistical modeling requires many input parameters. The input univariate distribution or histogram is perhaps the most important. A new method for assessing uncertainty in the histogram, particularly uncertainty in the mean, is presented. This method, referred to as the conditional finite-domain (CFD) approach, accounts for the size of the domain and the local conditioning data. It is a stochastic approach based on a multivariate Gaussian distribution. The CFD approach is shown to be convergent, design independent, and parameterization invariant. The performance of the CFD approach is illustrated in a case study focusing on the impact of the number of data and the range of correlation on the limiting uncertainty in the parameters. The spatial bootstrap method and CFD approach are compared. As the number of data increases, uncertainty in the sample mean decreases in both the spatial bootstrap and the CFD. Contrary to spatial bootstrap, uncertainty in the sample mean in the CFD approach decreases as the range of correlation increases. This is a direct result of the conditioning data being more correlated to unsampled locations in the finite domain. The sensitivity of the limiting uncertainty relative to the variogram and the variable limits are also discussed.

97 MATHEMATICS AND COMPUTING↗

Optimization models for integrated biorefinery operations

Variations of physical and chemical characteristics of biomass lead to an uneven flow of biomass in a biorefinery, which reduces equipment utilization and increases operational costs. Uncertainty of biomass supply and high processing costs increase the risk of investing in the US’s cellulosic biofuel industry. We propose a stochastic programming model to streamline processes within a biorefinery. A chance constraint models system’s reliability requirement that the reactor is operating at a high utilization rate given uncertain biomass moisture content, particle size distribution, and equipment failure. The model identifies operating conditions of equipment and inventory level to maintain a continuous flow of biomass to the reactor. Furthermore, the sample average approximation method approximates the chance constraint and a bisection search-based heuristic solves this approximation. A case study is developed using real-life data collected at Idaho National Laboratory’s biomass processing facility. An extensive computational analysis indicates that sequencing of biomass bales based on moisture level, increasing storage capacity, and managing particle size distribution, increases utilization of the reactor and reduces operational costs.

09 BIOMASS FUELS↗

Stochastic nonlinear analysis of unidirectional fiber composites using image-based microstructural uncertainty quantification

Here, we present a data-driven nonlinear uncertainty quantification and propagation framework to study the microstructure-induced stochastic performance of unidirectional (UD) carbon fiber reinforced polymer (CFRP) composites. The proposed approach integrates (1) microscopic image characterization, (2) stochastic microstructure reconstruction, and (3) efficient multiscale finite element simulations enabled by self-consistent clustering (SCA) analysis. To model the complex microstructural variability, the proposed UQ methods take the non-Gaussian uncertainty sources into account through a distribution-free sampling approach leveraging nonparametric and asymptotic statistical tools. A hierarchical conditional sampling strategy enables the simultaneous sampling of multiple sources of uncertainties. Our approach provides insights into the impact of microstructural variabilities, which are shown to have an increasing impact on the nonlinear responses of UD CFRP parts under progressive compression loading and ultimately on the failure rate over time. We discover that before CFRP parts start to fail, a characteristic time period emerges with distinctive uncertainty distributions specific to the microstructure variability and the probability of failure. Identifying the failure time period is crucial to the reliability prediction, which is an essential component of CFRP design.

36 MATERIALS SCIENCE↗

Nonuniform cosmological birefringence and active galactic nuclei

The CMB constrains the cosmological-birefringence rotation angle to be |{alpha}| < or approx. 1 deg. (1{sigma}) out to redshifts z{approx_equal}1100 for a rotation that is uniform across the sky. However, the rotation angle {alpha}({theta},{phi}) may vary with position ({theta},{phi}) on the sky, and if so, then it can be sought in current and future active galactic nuclei data. An upper limit <{alpha}{sup 2}>{sup 1/2} < or approx. 3.7 deg. to the scatter in the position-angle-polarization offsets in a sample of only N=9 active galactic nuclei already constrains the rotation spherical-harmonic coefficients to (4{pi}){sup -1/2{alpha}}{sub lm} < or approx. 3.7 deg. and constrains the power spectrum for {alpha} in models where it is a stochastic field. Future constraints can be improved with more sources and by analyzing well-mapped sources with a tensor-harmonic decomposition of the polarization.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Scalable Gradient Free Method for Bayesian Experimental Design with Implicit Models

Bayesian experimental design (BED) is to answer the question that how to choose designs that maximize the information gathering. For implicit models, where the likelihood is intractable but sampling is possible, conventional BED methods have difficulties in efficiently estimating the posterior distribution and maximizing the mutual information (MI) between data and parameters. Recent work proposed the use of gradient ascent to maximize a lower bound on MI to deal with these issues. However, the approach requires a sampling path to compute the pathwise gradient of the MI lower bound with respect to the design variables, and such a pathwise gradient is usually inaccessible for implicit models. In this paper, we propose a novel approach that leverages recent advances in stochastic approximate gradient ascent incorporated with a smoothed variational MI estimator for efficient and robust BED. Without the necessity of pathwise gradients, our approach allows the design process to be achieved through a unified procedure with an approximate gradient for implicit models. Several experiments show that our approach outperforms baseline methods, and significantly improves the scalability of BED in high-dimensional problems.

Zhang, Jiaxin↗

Contextual Active Online Model Selection with Expert Advice

How can we collect the most useful labels to learn a model selection policy, when presented with arbitrary heterogeneous data streams? In this paper, we formulate this task as a contextual active model selection problem, where at each round the learner receives an unlabeled data point along with a context. The goal is to output the best model for any given context without obtaining an excessive amount of labels. In particular, we focus on the task of selecting pre-trained classifiers, and propose a contextual active model selection algorithm (CAMS), which relies on a novel uncertainty sampling query criterion defined on a given policy class for adaptive model selection. In comparison to prior art, our algorithm does not assume a globally optimal model. We provide rigorous theoretical analysis for the regret and query complexity under both adversarial and stochastic settings. Our experiments on several benchmark classification datasets demonstrate the algorithm’s effectiveness in terms of both regret and query complexity. Notably, to achieve the same accuracy, CAMS incurs less than 10% of the label cost when compared to the best online model selection baselines on CIFAR10.

Liu, Xuefeng↗

Grain growth competition during thin-sample directional solidification of dendritic microstructures: A phase-field study

Here we present the results of a comprehensive phase-field study of columnar grain growth competition in bi-crystalline samples in two dimensions (2D) and in three dimensions (3D) for small sample thicknesses allowing a single row of dendrites to form. We focus on the selection of grain boundary (GB) orientation during directional solidification in the steady-state dendritic regime, and study its dependence upon the orientation of two competing grains. In 2D, we map the entire orientation range for both grains, performing several simulations for each configuration to account for the stochasticity of GB orientation selection and to assess the average GB behavior. We find that GB orientation selection depends strongly on whether the primary dendrite growth directions have lateral components (i.e. components perpendicular to the axis of the temperature gradient) that point in the same or opposite directions in the two grains. Here, we identify a range of grain orientations in which grain selection follows the classical description of Walton and Chalmers. We also identify conditions that favor unusual overgrowth of favorably-oriented dendrites at a converging GB. We propose a simple analytical description that reproduces the average GB orientation selection from 2D simulations within statistical fluctuations of a few degrees. In 3D, we find a similar GB orientation selection as in 2D when secondary branches grow in planes parallel and perpendicular to the sample walls. Remarkably, quasi-2D behavior is also observed even when those perpendicular sidebranching planes are rotated by a finite azimuthal angle about the primary dendrite growth axis as long as the absolute values of those azimuthal angles are equal in both grains. In contrast, when the absolute values of those azimuthal angles differ markedly, we find that unusual overgrowth events at a converging GB are promoted by a high azimuthal angle in the least-favorably-oriented grain. We also find that diverging GBs can be strongly affected by those azimuthal angles, while converging GBs exhibit a weak dependence on those angles. Finally, for diverging GBs, GB orientation is also strongly affected by the relative signs of the lateral components of the primary dendrite growth directions in both grains.

36 MATERIALS SCIENCE↗

Particle filtering with path sampling and an application to a bimodal ocean current model

This paper introduces a recursive particle filtering algorithm designed to filter high dimensional systems with complicated non-linear and non-Gaussian effects. The method incorporates a parallel marginalization (PMMC) step in conjunction with the hybrid Monte Carlo (HMC) scheme to improve samples generated by standard particle filters. Parallel marginalization is an efficient Markov chain Monte Carlo (MCMC) strategy that uses lower dimensional approximate marginal distributions of the target distribution to accelerate equilibration. As a validation the algorithm is tested on a 2516 dimensional, bimodal, stochastic model motivated by the Kuroshio current that runs along the Japanese coast. The results of this test indicate that the method is an attractive alternative for problems that require the generality of a particle filter but have been inaccessible due to the limitations of standard particle filtering strategies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗