Search NASA⌕ Search

SEARCH · Search NASA

Results for “random 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 397 records · Page 22

Characterization of electron microscopes with binary pseudo-random multilayer test samples

We discuss the results of SEM and TEM measurements with the BPRML test samples fabricated from a BPRML (WSi2/Si with fundamental layer thickness of 3 nm) with a Dual Beam FIB (focused ion beam)/SEM technique. In particular, we demonstrate that significant information about the metrological reliability of the TEM measurements can be extracted even when the fundamental frequency of the BPRML sample is smaller than the Nyquist frequency of the measurements. The measurements demonstrate a number of problems related to the interpretation of the SEM and TEM data. Note that similar BPRML test samples can be used to characterize x-ray microscopes. Corresponding work with x-ray microscopes is in progress.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A new efficient grain growth model using a random Gaussian-sampled mode filter

This paper presents the use of a Gaussian neighborhood mode filter for predicting grain growth in a manner similar to the solutions obtained by a Monte Carlo Potts model. This flexible grain growth model can quickly utilize modern, computationally optimized data science strategies on graphics processing units to simulate grain growth up to 100 times faster than the state-of-the-art, publicly available Monte Carlo Potts model. We show that, given the correct neighborhood, the mode filter can replicate normal grain growth in two or three dimensions. In addition, the paper briefly demonstrates the ability to model limited anisotropic in grain boundary energy and mobility. Anisotropic grain boundary energy is modeled by defining a weighted mode filter operation. Anisotropic grain boundary mobility is modeled by scaling and orienting the Gaussian neighborhood in a particular direction.

Anisotropy↗

Visual Sample Plan (VSP) Statistical Software as Related to the CTBTO’s On-Site Inspection Procedure

In the event of a potential nuclear weapons test the Comprehensive Nuclear-Test-Ban Treaty Organization (CTBTO) is commissioned to conduct an on-site investigation (OSI) of the suspected test site in an effort to find confirmatory evidence of the nuclear test. The OSI activities include collecting air, surface soil, and underground samples to search for indications of a nuclear weapons test - these indicators include radionuclides and radioactive isotopes Ar and Xe. This report investigates the capability of the Visual Sample Plan (VSP) software to contribute to the sampling activities of the CTBTO during an OSI. VSP is a statistical sampling design software, constructed under data quality objectives, which has been adapted for environmental remediation and contamination detection problems for the EPA, US Army, DoD and DHS among others. This report provides discussion of a number of VSP sample designs, which may be pertinent to the work undertaken during an OSI. Examples and descriptions of such designs include hot spot sampling, combined random and judgment sampling, multiple increment sampling, radiological transect surveying, and a brief description of other potentially applicable sampling methods. Further, this work highlights a potential need for the use of statistically based sample designs in OSI activities. The use of such designs may enable canvassing a sample area without full sampling, provide a measure of confidence that radionuclides are not present, and allow investigators to refocus resources in other areas of concern.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Eco-Friendly High-Performance Carbon Building Material Development from Coal

The development of eco-friendly high-performance building materials based on coal-derived materials is greatly beneficial for promoting environmental sustainability and the coal industry. This project focused on advancing technology to create innovative and scalable construction materials from two domestic sources: (1) coal-derived pyrolyzed char (PC), and (2) solvent-extracted coal deposit, extracts, and residue (CDER). It aimed to simultaneously develop and produce two types of coal-derived building products: (1) char-based concrete bricks (CCB) for wall construction in buildings, and (2) carbon-based structural units (CSU) intended as alternatives to traditional wood, concrete, or steel framing structures. The project team has successfully developed methods for manufacturing CCB samples. Extensive experiments were conducted to assess various manufacturing techniques for these samples. This included measuring their physical properties such as thermal conductivity (ranging from 0.26 to 0.38 W/mK) and bulk density (ranging from 0.85 to 1.15 g/cm 3 ), along with their mechanical properties (e.g., compressive strength ranging from 14 to 16 MPa at 28 days) for samples with a PC composition of 70%. Quality assurance and quality control tests, focusing on density and compressive strength, were also performed on samples selected randomly from pilot-scale production, and cured for a long term (over three months). The average long-term compressive strength of two randomly selected CCB samples was measured as 15.1 MPa, which was higher than the required target strength of 14 MPa. This indicates that the manufactured CCB samples from the preliminary pilot scale production run have good quality control and long-term strength performance.

01 COAL, LIGNITE, AND PEAT↗

Monte Carlo Techniques for Nuclear Systems - Theory Lectures

These are lecture notes for a Monte Carlo class given at the University of New Mexico. The following topics are covered: course information; nuclear eng. review & MC; random numbers and sampling; computational geometry; collision physics; tallies and statistics; eigenvalue calculations I; eigenvalue calculations II; eigenvalue calculations III; variance reduction; parallel Monte Carlo; parameter studies; fission matrix and higher eigenmodes; doppler broadening; Monte Carlo depletion; HTGR modeling; coupled MC and T/H calculations; fission energy deposition. Solving particle transport problems with the Monte Carlo method is simple - just simulate the particle behavior. The devil is in the details, however. These lectures provide a balanced approach to the theory and practice of Monte Carlo simulation codes. The first lectures provide an overview of Monte Carlo simulation methods, covering the transport equation, random sampling, computational geometry, collision physics, and statistics. The next lectures focus on the state-of-the-art in Monte Carlo criticality simulations, covering the theory of eigenvalue calculations, convergence analysis, dominance ratio calculations, bias in Keff and tallies, bias in uncertainties, a case study of a realistic calculation, and Wielandt acceleration techniques. The remaining lectures cover advanced topics, including HTGR modeling and stochastic geometry, temperature dependence, fission energy deposition, depletion calculations, parallel calculations, and parameter studies. This portion of the class focuses on using MCNP to perform criticality calculations for reactor physics and criticality safety applications. It is an intermediate level class, intended for those with at least some familiarity with MCNP. Class examples provide hands-on experience at running the code, plotting both geometry and results, and understanding the code output. The class includes lectures & hands-on computer use for a variety of Monte Carlo calculations. Beginning MCNP users are encouraged to review LA-UR-09-00380, "Criticality Calculations with MCNP: A Primer (3nd Edition)" (available at http:// mcnp.lanl.gov under "Reference Collection") prior to the class. No Monte Carlo class can be complete without having students write their own simple Monte Carlo routines for basic random sampling, use of the random number generator, and simplified particle transport simulation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Spoofing Cross-Entropy Measure in Boson Sampling

Cross-entropy (XE) measure is a widely used benchmark to demonstrate quantum computational advantage from sampling problems, such as random circuit sampling using superconducting qubits and boson sampling (BS). We present a heuristic classical algorithm that attains a better XE than the current BS experiments in a verifiable regime and is likely to attain a better XE score than the near-future BS experiments in a reasonable running time. The key idea behind the algorithm is that there exist distributions that correlate with the ideal BS probability distribution and that can be efficiently computed. The correlation and the computability of the distribution enable us to postselect heavy outcomes of the ideal probability distribution without computing the ideal probability, which essentially leads to a large XE. Our method scores a better XE than the recent Gaussian BS experiments when implemented at intermediate, verifiable system sizes. Much like current state-of-the-art experiments, we cannot verify that our spoofer works for quantum-advantage-size systems. However, we demonstrate that our approach works for much larger system sizes in fermion sampling, where we can efficiently compute output probabilities. Finally, we provide analytic evidence that the classical algorithm is likely to spoof noisy BS efficiently.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

PDE-constrained Optimization under Uncertainty

Uncertainty is pervasive in all science and engineering applications. Incorporating uncertainty in physical models is therefore both natural and vital. In doing so, we often arrive at parametric systems of partial differential equations (PDEs). When passing from simulation to optimization, we obtain (typically nonconvex) infinite-dimensional optimization problems that, upon discretization, result in extremely large-scale nonlinear programs. For example, consider a linear elliptic PDE on a two- dimensional domain with a single random coeffcient. If we sampled the random input with 10,000 realizations of the coeffcient, the resulting optimization problem would have 10,000 PDE constraints. Furthermore, discretizing each PDE with piecewise linear finite elements on a 100X100 uni- form quadrilateral mesh results in 100,000,000 degrees of freedom. As a result, the critical components for ensuring mesh-independent performance of numerical optimization methods in the deterministic setting, for example, solution regularity and generalized differentiability, are even more critical in the stochastic setting.

42 ENGINEERING↗

AGES: THE AGN AND GALAXY EVOLUTION SURVEY

The AGN and Galaxy Evolution Survey (AGES) is a redshift survey covering, in its standard fields, 7.7 deg{sup 2} of the Booetes field of the NOAO Deep Wide-Field Survey. The final sample consists of 23,745 redshifts. There are well-defined galaxy samples in 10 bands (the B{sub W} , R, I, J, K, IRAC 3.6, 4.5, 5.8, and 8.0 {mu}m, and MIPS 24 {mu}m bands) to a limiting magnitude of I < 20 mag for spectroscopy. For these galaxies, we obtained 18,163 redshifts from a sample of 35,200 galaxies, where random sparse sampling was used to define statistically complete sub-samples in all 10 photometric bands. The median galaxy redshift is 0.31, and 90% of the redshifts are in the range 0.085 < z < 0.66. Active galactic nuclei (AGNs) were selected as radio, X-ray, IRAC mid-IR, and MIPS 24 {mu}m sources to fainter limiting magnitudes (I < 22.5 mag for point sources). Redshifts were obtained for 4764 quasars and galaxies with AGN signatures, with 2926, 1718, 605, 119, and 13 above redshifts of 0.5, 1, 2, 3, and 4, respectively. We detail all the AGES selection procedures and present the complete spectroscopic redshift catalogs and spectral energy distribution decompositions. Photometric redshift estimates are provided for all sources in the AGES samples.

79 ASTRONOMY AND ASTROPHYSICS↗

A Multilevel, Hierarchical Sampling Technique for Spatially Correlated Random Fields

In this paper, we propose an alternative method to generate samples of a spatially correlated random field with applications to large-scale problems for forward propagation of uncertainty. A classical approach for generating these samples is the Karhunen--Loève (KL) decomposition. However, the KL expansion requires solving a dense eigenvalue problem and is therefore computationally infeasible for large-scale problems. Sampling methods based on stochastic partial differential equations provide a highly scalable way to sample Gaussian fields, but the resulting parametrization is mesh dependent. We propose a multilevel decomposition of the stochastic field to allow for scalable, hierarchical sampling based on solving a mixed finite element formulation of a stochastic reaction-diffusion equation with a random, white noise source function. Lastly, numerical experiments are presented to demonstrate the scalability of the sampling method as well as numerical results of multilevel Monte Carlo simulations for a subsurface porous media flow application using the proposed sampling method.

97 MATHEMATICS AND COMPUTING↗

Efficient Sampling of Complex Interdependent and Multiplex Networks

Efficient sampling of interdependent and multiplex infrastructure networks is critical for effectively applying failure and recovery algorithms in real-world settings, as well as to generate property-preserving reduced-order graph-based ensembles that address topological uncertainties. In this paper, we first explore the performance, i.e. the success in preserving graph properties, of graph sampling algorithms for interdependent and multiplex networks with synthetic and real-world graphs. We simulate sampling algorithms under different parameter settings. These settings include probabilistic graph generators, coupling patterns, and various performance metrics. Our results show that while Random Node and Random Walk sampling algorithms perform best for interdependent networks, Random Edge and Forest Fire sampling algorithms perform best for multiplex networks. Second, we propose and implement a novel similarity-based sampling algorithm for multiplex networks that samples only log(N) number of layers of an N-layer multiplex network while yielding computational savings with performance guarantees. Experimental results show that similarity sampling outperforms complete sampling of all layers while decreasing performance costs from a linear scale to a logarithmic one. Our results also indicate that similarity-based sampling outperforms complete sampling and random selection in nearly all scenarios when tested with real-world data.

Subasi, Omer↗