Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sampling algorithm”

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 73 records · Page 4

Impact-Driven Sampling Strategies for Hybrid Attack Graphs

Cyber-Physical Systems (CPSs) have a large input space, with discrete and continuous elements across multiple layers. Hybrid Attack Graph (HAG) provide a flexible and efficient approach to generate attack sequences for a CPS. Analysis and testing of large-scale HAGs are prohibitively costly. We propose a dimension reduction via property-preserving multi-layer graph sampling algorithms. Existing property-preserving graph sampling approaches generate a representative subgraph of an original large-sized graph while preserving the key properties, such as node and edge distribution, clustering coefficients, and betweenness. On the other hand, we propose impact-driven sampling strategies to transform the input data to a lower-dimensional representation while retaining key properties of the data.

Subasi, Omer↗

The NUHM2 after LHC Run 1

We make a frequentist analysis of the parameter space of the NUHM2, in which the soft supersymmetry (SUSY)-breaking contributions to the masses of the two Higgs multiplets, m 2 H u,d , vary independently from the universal soft SUSY-breaking contributions m 2 0 to the masses of squarks and sleptons. Our analysis uses the MultiNest sampling algorithm with over 4 × 10⁸ points to sample the NUHM2 parameter space. It includes the ATLAS and CMS Higgs mass measurements as well as the ATLAS search for supersymmetric jets + /E T signals using the full LHC Run 1 data, the measurements of BR(B s →μ⁺μ⁻) by LHCb and CMS together with other B-physics observables, electroweak precision observables and the XENON100 and LUX searches for spin-independent dark-matter scattering. We find that the preferred regions of the NUHM2 parameter space have negative SUSY-breaking scalar masses squared at the GUT scale for squarks and sleptons, m 2 0 < 0, as well as m 2 H u < m 2 H d < 0. The tension present in the CMSSM and NUHM1 between the supersymmetric interpretation of (g – 2)μ and the absence to date of SUSY at the LHC is not significantly alleviated in the NUHM2. We find that the minimum χ 2 = 32.5 with 21 degrees of freedom (dof) in the NUHM2, to be compared with χ 2 /dof = 35.0/23 in the CMSSM, and χ 2 /dof = 32.7/22 in the NUHM1. We find that the one-dimensional likelihood functions for sparticle masses and other observables are similar to those found previously in the CMSSM and NUHM1.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The pMSSM10 after LHC run 1

We present a frequentist analysis of the parameter space of the pMSSM10, in which the following ten soft SUSY-breaking parameters are specified independently at the mean scalar top mass scale M SUSY ≡ √m $\tilde{t}$ 1 m $\tilde{t}$ 2 : the gaugino masses M 1,2,3 , the first-and second-generation squark masses m $\tilde{q}$ 1 = m $\tilde{q}$ 2 , the third-generation squark mass m $\tilde{q}$ 3 , a common slepton mass m $\tilde{ℓ}$ and a common trilinear mixing parameter A , as well as the Higgs mixing parameter μ , the pseudoscalar Higgs mass M A and tanβ , the ratio of the two Higgs vacuum expectation values. We use the MultiNest sampling algorithm with ~ 1.2 ×10 9 points to sample the pMSSM10 parameter space. A dedicated study shows that the sensitivities to strongly interacting sparticle masses of ATLAS and CMS searches for jets, leptons + E-slash T signals depend only weakly on many of the other pMSSM10 parameters. With the aid of the Atom and Scorpion codes, we also implement the LHC searches for electroweakly interacting sparticles and light stops, so as to confront the pMSSM10 parameter space with all relevant SUSY searches. In addition, our analysis includes Higgs mass and rate measurements using the HiggsSignals code, SUSY Higgs exclusion bounds, the measurements of BR(B s →μ + μ - ) by LHCb and CMS, other B -physics observables, electroweak precision observables, the cold dark matter density and the XENON100 and LUX searches for spin-independent dark matter scattering, assuming that the cold dark matter is mainly provided by the lightest neutralino χ-tilde 1 0 . We show that the pMSSM10 is able to provide a supersymmetric interpretation of (g-2) μ , unlike the CMSSM, NUHM1 and NUHM2. As a result, we find (omitting Higgs rates) that the minimum χ2=20.5 with 18 degrees of freedom (d.o.f.) in the pMSSM10, corresponding to a χ2 probability of 30.8 %, to be compared with χ2/d.o.f.=32.8/24(31.1/23)(30.3/22) in the CMSSM (NUHM1) (NUHM2). We display the one-dimensional likelihood functions for sparticle masses, and we show that they may be significantly lighter in the pMSSM10 than in the other models, e.g., the gluino may be as light as ~ 1250 GeV at the 68 % CL, and squarks, stops, electroweak gauginos and sleptons may be much lighter than in the CMSSM, NUHM1 and NUHM2. We discuss the discovery potential of future LHC runs, e + e - colliders and direct detection experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Delayed-Gamma Energy Biasing with Exact Energy Sampling in MCNP 6.2.0

Characterization of delayed-particle signatures is of the utmost importance for detecting, identifying, and quantifying special nuclear material (SNM). Various non-destructive assay (NDA) techniques used in nuclear material safeguards rely on characteristic gamma-ray or neutron emissions to infer properties of a material. The all-particle, all-energy Monte-Carlo radiation transport code MCNP6 is capable of simulating delayed-particle signatures from SNM in addition to modeling the transport of emitted particles to a detector or other instrument. In some cases, NDA techniques require the measurement of low probability emissions from a given material. In physical scenarios, this problem can be bypassed by longer count-times or may be simply irrelevant due to the mass, and therefore the total activity, of the material being measured. However, when applying the Monte-Carlo method to such scenarios, sampling of low probability emissions requires a large number of histories to converge to a statistically acceptable solution. To address this issue, the delayed-neutron and gamma energy biasing feature was introduced in MCNP6 by H. Armstrong et al. in 2013 which allows the user to set up energy windows in which delayed-particle emission sampling can be adjusted. For delayed-gamma sampling, this biasing method was based on the bin-wise structure of gamma emission data for both the multi-bin gamma and line-emission sampling modes. Recent improvements have been made to the line-emission sampling algorithm which upgrade the previous mini-bin sampling treatment to an exact energy-line treatment. This upgrade was not compatible with the biasing method implemented by H. Armstrong et al. due to the sampled data no longer having a bin-wise structure in line-emission mode. For this reason the delayed-gamma energy biasing feature has been rewritten to support the exact line-sampling treatment. This paper provides a description of the delayed-gamma energy biasing (DGEB) feature in MCNP6 as well as results and discussion for a gamma-ray spectroscopy example used to demonstrate the biasing utility. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Validating sequential Monte Carlo for gravitational-wave inference

Nested sampling (NS) is the preferred stochastic sampling algorithm for gravitational-wave inference for compact binary coalescences. It can handle the complex nature of the gravitational-wave likelihood surface and provides an estimate of the Bayesian model evidence. However, there is another class of algorithms that meets the same requirements, but has not been used for gravitational-wave analyses: sequential Monte Carlo (SMC), an extension of importance sampling that maps samples from an initial density to a target density via a series of intermediate densities. In this work, we validate a type of SMC algorithm, called persistent sampling (PS), for gravitational-wave inference. We consider a range of different scenarios including binary black holes and binary neutron stars and real and simulated data and show that PS produces results that are consistent with NS whilst being, on average, 2 times more efficient and 2.74 times faster. This demonstrates that PS is a viable alternative to NS that should be considered for future gravitational-wave analyses.

black hole mergers↗

Darwinian Model Building

We present a way to generate heuristic mathematical models based on the Darwinian principles of variation and selection in a pool of individuals over many generations. Each individual has a genotype (the hereditary properties) and a phenotype (the expression of these properties in the environment). Variation is achieved by cross-over and mutation operations on the genotype which consists in the present case of a single chromosome. The genotypes 'live' in the environment of the data. Nested Sampling is used to optimize the free parameters of the models given the data, thus giving rise to the phenotypes. Selection is based on the phenotypes.The evidences which naturally follow from the Nested Sampling Algorithm are used in a second level of Nested Sampling to find increasingly better models.The data in this paper originate from the Leiden Cytology and Pathology Laboratory (LCPL), which screens pap smears for cervical cancer. We have data for 1750 women who on average underwent 5 tests each. The data on individual women are treated as a small time series. We will try to estimate the next value of the prime cancer indicator from previous tests of the same woman.

97 MATHEMATICS AND COMPUTING↗

Some Issues in Uncertainty Quantification and Parameter Tuning: A Case Study of Convective Parameterization Scheme in the WRF Regional Climate Model

The current tuning process of parameters in global climate models is often performed subjectively, or treated as an optimization procedure to minimize the difference between model fields and observations. The later approach may be generating a set of tunable parameters that approximate the observed climate but via an unrealistic balance of physical processes and/or compensating errors over different regions in the globe. In this study, we run the Weather Research and Forecasting (WRF) regional model constrained by the reanalysis data over the Southern Great Plains (SGP) where abundant observational data from various resources are available for calibration of the input parameters and validation of the model results. Our goal is to quantify the uncertainty ranges and identify the optimal values of five key input parameters in a new Kain-Frisch (KF) convective parameterization scheme incorporated in the WRF model. A stochastic sampling algorithm, Multiple Very Fast Simulated Annealing (MVFSA), is employed to efficiently sample the input parameters in KF scheme based on the skill score so that the algorithm progressively moves toward regions of the parameter space that minimize model errors. The results based on the WRF simulations with 25-km grid spacing over the SGP show that the model bias for precipitation can be significantly reduced by using five optimal parameters identified by the MVFSA algorithm. The model performance is very sensitive to downdraft and entrainment related parameters and consumption time of Convective Available Potential Energy (CAPE). Simulated convective precipitation decreases as the ratio of downdraft to updraft flux increases. Larger CAPE consumption time results in less convective but more stratiform precipitation. The simulation using optimal parameters obtained by only constraining precipitation generates positive impact on the other output variables, such as temperature and wind. By using the optimal parameters obtained at 25 km simulation, both the magnitude and spatial pattern of simulated precipitation are improved at 12-km spatial resolution. The optimal parameters identified from the SGP region have also improved the simulation of precipitation when moving model domain to another region with a different climate regime (i.e. North America monsoon region). These results suggest the improvement of precipitation simulation by using the optimal parameters remains when the model domain or spatial resolution is changed.

54 ENVIRONMENTAL SCIENCES↗

Efficient and robust gradient enhanced Kriging emulators.

%E2%80%9CNaive%E2%80%9D or straight-forward Kriging implementations can often perform poorly in practice. The relevant features of the robustly accurate and efficient Kriging and Gradient Enhanced Kriging (GEK) implementations in the DAKOTA software package are detailed herein. The principal contribution is a novel, effective, and efficient approach to handle ill-conditioning of GEK's %E2%80%9Ccorrelation%E2%80%9D matrix, RN%CC%83, based on a pivoted Cholesky factorization of Kriging's (not GEK's) correlation matrix, R, which is a small sub-matrix within GEK's RN%CC%83 matrix. The approach discards sample points/equations that contribute the least %E2%80%9Cnew%E2%80%9D information to RN%CC%83. Since these points contain the least new information, they are the ones which when discarded are both the easiest to predict and provide maximum improvement of RN%CC%83's conditioning. Prior to this work, handling ill-conditioned correlation matrices was a major, perhaps the principal, unsolved challenge necessary for robust and efficient GEK emulators. Numerical results demonstrate that GEK predictions can be significantly more accurate when GEK is allowed to discard points by the presented method. Numerical results also indicate that GEK can be used to break the curse of dimensionality by exploiting inexpensive derivatives (such as those provided by automatic differentiation or adjoint techniques), smoothness in the response being modeled, and adaptive sampling. Development of a suitable adaptive sampling algorithm was beyond the scope of this work; instead adaptive sampling was approximated by omitting the cost of samples discarded by the presented pivoted Cholesky approach.

Dalbey, Keith R.↗

Sampling, feasibility, and priors in data assimilation

Importance sampling algorithms are discussed in detail, with an emphasis on implicit sampling, and applied to data assimilation via particle filters. Implicit sampling makes it possible to use the data to find high-probability samples at relatively low cost, making the assimilation more efficient. A new analysis of the feasibility of data assimilation is presented, showing in detail why feasibility depends on the Frobenius norm of the covariance matrix of the noise and not on the number of variables. A discussion of the convergence of particular particle filters follows. A major open problem in numerical data assimilation is the determination of appropriate priors, a progress report on recent work on this problem is given. The analysis highlights the need for a careful attention both to the data and to the physics in data assimilation problems.

97 MATHEMATICS AND COMPUTING↗

TARGET SELECTION FOR THE APACHE POINT OBSERVATORY GALACTIC EVOLUTION EXPERIMENT (APOGEE)

The Apache Point Observatory Galactic Evolution Experiment (APOGEE) is a high-resolution infrared spectroscopic survey spanning all Galactic environments (i.e., bulge, disk, and halo), with the principal goal of constraining dynamical and chemical evolution models of the Milky Way. APOGEE takes advantage of the reduced effects of extinction at infrared wavelengths to observe the inner Galaxy and bulge at an unprecedented level of detail. The survey's broad spatial and wavelength coverage enables users of APOGEE data to address numerous Galactic structure and stellar populations issues. In this paper we describe the APOGEE targeting scheme and document its various target classes to provide the necessary background and reference information to analyze samples of APOGEE data with awareness of the imposed selection criteria and resulting sample properties. APOGEE's primary sample consists of {approx}10{sup 5} red giant stars, selected to minimize observational biases in age and metallicity. We present the methodology and considerations that drive the selection of this sample and evaluate the accuracy, efficiency, and caveats of the selection and sampling algorithms. We also describe additional target classes that contribute to the APOGEE sample, including numerous ancillary science programs, and we outline the targeting data that will be included in the public data releases.

79 ASTRONOMY AND ASTROPHYSICS↗

Reconstruction of elongated bubbles fusing the information from multiple optical probes through a Bayesian inference technique

In this communication, a novel optical technique has been proposed for the reconstruction of the shape of a Taylor bubble using measurements from multiple arrays of optical sensors. The deviation of an optical beam passing through the bubble depends on the contour of bubble surface. A theoretical model of the deviation of a beam during the traverse of a Taylor bubble through it has been developed. Using this model and the time history of the deviation captured by the sensor array, the bubble shape has been reconstructed. The reconstruction has been performed using an inverse algorithm based on Bayesian inference technique and Markov chain Monte Carlo sampling algorithm. The reconstructed nose shape has been compared with the true shape, extracted through image processing of high speed images. Finally, an error analysis has been performed to pinpoint the sources of the errors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

CHRR: coordinate hit-and-run with rounding for uniform sampling of constraint-based models

In constraint-based metabolic modelling, physical and biochemical constraints define a polyhedral convex set of feasible flux vectors. Uniform sampling of this set provides an unbiased characterization of the metabolic capabilities of a biochemical network. However, reliable uniform sampling of genome-scale biochemical networks is challenging due to their high dimensionality and inherent anisotropy. Here, we present an implementation of a new sampling algorithm, coordinate hit-and-run with rounding (CHRR). This algorithm is based on the provably efficient hit-and-run random walk and crucially uses a preprocessing step to round the anisotropic flux set. CHRR provably converges to a uniform stationary sampling distribution. We apply it to metabolic networks of increasing dimensionality. We show that it converges several times faster than a popular artificial centering hit-and-run algorithm, enabling reliable and tractable sampling of genome-scale biochemical networks.

59 BASIC BIOLOGICAL SCIENCES↗

Path Sampling for Rare Events Boosted by Machine Learning

The study by Jung et al. introduced Artificial Intelligence for Molecular Mechanism Discovery (AIMMD), a novel sampling algorithm that integrates machine learning to enhance the efficiency of transition path sampling (TPS). By enabling on-the-fly estimation of the committor probability and simultaneously deriving a human-interpretable reaction coordinate, AIMMD offers a robust framework for elucidating the mechanistic pathways of complex molecular processes. Here, this commentary provides a discussion and critical analysis of the core AIMMD framework, explores its recent extensions, and offers an assessment of the method’s potential impact and limitations.

Minh, Porhouy [Univ. of Minnesota, Minneapolis, MN↗

Reduced electron exposure for energy-dispersive spectroscopy using dynamic sampling

Analytical electron microscopy and spectroscopy of biological specimens, polymers, and other beam sensitive materials has been a challenging area due to irradiation damage. There is a pressing need to develop novel imaging and spectroscopic imaging methods that will minimize such sample damage as well as reduce the data acquisition time. The latter is useful for high-throughput analysis of materials structure and chemistry. Here, in this work, we present a novel machine learning based method for dynamic sparse sampling of EDS data using a scanning electron microscope. Our method, based on the supervised learning approach for dynamic sampling algorithm and neural networks based classification of EDS data, allows a dramatic reduction in the total sampling of up to 90%, while maintaining the fidelity of the reconstructed elemental maps and spectroscopic data. In conclusion, we believe this approach will enable imaging and elemental mapping of materials that would otherwise be inaccessible to these analysis techniques.

36 MATERIALS SCIENCE↗

BAYESIAN NOISE ESTIMATION FOR NON-IDEAL COSMIC MICROWAVE BACKGROUND EXPERIMENTS

We describe a Bayesian framework for estimating the time-domain noise covariance of cosmic microwave background (CMB) observations, typically parameterized in terms of a 1/f frequency profile. This framework is based on the Gibbs sampling algorithm, which allows for exact marginalization over nuisance parameters through conditional probability distributions. In this paper, we implement support for gaps in the data streams and marginalization over fixed time-domain templates, and also outline how to marginalize over confusion from CMB fluctuations, which may be important for high signal-to-noise experiments. As a by-product of the method, we obtain proper constrained realizations, which themselves can be useful for map making. To validate the algorithm, we demonstrate that the reconstructed noise parameters and corresponding uncertainties are unbiased using simulated data. The CPU time required to process a single data stream of 100,000 samples with 1000 samples removed by gaps is 3 s if only the maximum posterior parameters are required, and 21 s if one also wants to obtain the corresponding uncertainties by Gibbs sampling.

79 ASTRONOMY AND ASTROPHYSICS↗

A Surrogate-based Adaptive Sampling Approach for History Matching and Uncertainty Quantification

A critical procedure in reservoir simulations is history matching (or data assimilation in a broader sense), which calibrates model parameters such that the simulation results are consistent with field measurements, and hence improves the credibility of the predictions given by the simulations. Often there exist non-unique combinations of parameter values that all yield the simulation results matching the measurements. For such ill-posed history matching problems, Bayesian theorem provides a theoretical foundation to represent different solutions and to quantify the uncertainty with the posterior PDF. Lacking an analytical solution in most situations, the posterior PDF may be characterized with a sample of realizations, each representing a possible scenario. A novel sampling algorithm is presented here for the Bayesian solutions to history matching problems. We aim to deal with two commonly encountered issues: 1) as a result of the nonlinear input-output relationship in a reservoir model, the posterior distribution could be in a complex form, such as multimodal, which violates the Gaussian assumption required by most of the commonly used data assimilation approaches; 2) a typical sampling method requires intensive model evaluations and hence may cause unaffordable computational cost. In the developed algorithm, we use a Gaussian mixture model as the proposal distribution in the sampling process, which is simple but also flexible to approximate non-Gaussian distributions and is particularly efficient when the posterior is multimodal. Also, a Gaussian process is utilized as a surrogate model to speed up the sampling process. Furthermore, an iterative scheme of adaptive surrogate refinement and re-sampling ensures sampling accuracy while keeping the computational cost at a minimum level. The developed approach is demonstrated with an illustrative example and shows its capability in handling the above-mentioned issues. Multimodal posterior of the history matching problem is captured and are used to give a reliable production prediction with uncertainty quantification. The new algorithm reveals a great improvement in terms of computational efficiency comparing previously studied approaches for the sample problem.

Li, Weixuan↗

Compressing unstructured mesh data from simulations using machine learning

The amount of data output from a computer simulation has grown to terabytes and petabytes as increasingly complex simulations are being run on massively parallel systems. As we approach exaflop computing in the next decade, it is expected that the I/O subsystem will not be able to write out these large volumes of data. In this paper, we explore the use of machine learning to compress the data before it is written out. Despite the computational constraints that limit us to using very simple learning algorithms, our results show that machine learning is a viable option for compressing unstructured data. Furthermore, we demonstrate that by simply using a better sampling algorithm to generate the training set, we can obtain more accurate results compared to random sampling, but at no extra cost. Further, by carefully selecting and incorporating points with high prediction error, we can improve reconstruction accuracy without sacrificing the compression rate.

97 MATHEMATICS AND COMPUTING↗

Assessing the pollution risk of a groundwater source field at western Laizhou Bay under seawater intrusion

Coastal areas have great significance for human living, economy and society development in the world. With the rapid increase of pressures from human activities and climate change, the safety of groundwater resource is under the threat of seawater intrusion in coastal areas. The area of Laizhou Bay is one of the most serious seawater intruded areas in China, since seawater intrusion phenomenon was firstly recognized in the middle of 1970s. This study assessed the pollution risk of a groundwater source filed of western Laizhou Bay area by inferring the probability distribution of groundwater Cl{sup −} concentration. The numerical model of seawater intrusion process is built by using SEAWAT4. The parameter uncertainty of this model is evaluated by Markov Chain Monte Carlo (MCMC) simulation, and DREAM{sub (ZS)} is used as sampling algorithm. Then, the predictive distribution of Cl{sup -} concentration at groundwater source field is inferred by using the samples of model parameters obtained from MCMC. After that, the pollution risk of groundwater source filed is assessed by the predictive quantiles of Cl{sup -} concentration. The results of model calibration and verification demonstrate that the DREAM{sub (ZS)} based MCMC is efficient and reliable to estimate model parameters under current observation. Under the condition of 95% confidence level, the groundwater source point will not be polluted by seawater intrusion in future five years (2015–2019). In addition, the 2.5% and 97.5% predictive quantiles show that the Cl{sup −} concentration of groundwater source field always vary between 175 mg/l and 200 mg/l. - Highlights: • The parameter uncertainty of seawater intrusion model is evaluated by MCMC. • Groundwater source field won’t be polluted by seawater intrusion in future 5 years. • The pollution risk is assessed by the predictive quantiles of Cl{sup −} concentration.

54 ENVIRONMENTAL SCIENCES↗