Sökning: "simple random sampling"
Visar resultat 1 - 5 av 21 avhandlingar innehållade orden simple random sampling.
1. On unequal probability sampling designs
Sammanfattning : The main objective in sampling is to select a sample from a population in order to estimate some unknown population parameter, usually a total or a mean of some interesting variable. When the units in the population do not have the same probability of being included in a sample, it is called unequal probability sampling. LÄS MER
2. Uncertainty and Sensitivity Analysis Applied to the Validation of BWR Bundle Thermal-Hydraulic Calculations
Sammanfattning : In recent years, more realistic safety analyses of nuclear reactors have been based on best estimate (BE) computercodes. The need to validate and refine BE codes that are used in the predictions of relevant reactor safetyparameters, led to the organization of international benchmarks based on high quality experimental data. LÄS MER
3. Models and Methods for Random Fields in Spatial Statistics with Computational Efficiency from Markov Properties
Sammanfattning : The focus of this work is on the development of new random field models and methods suitable for the analysis of large environmental data sets. A large part is devoted to a number of extensions to the newly proposed Stochastic Partial Differential Equation (SPDE) approach for representing Gaussian fields using Gaussian Markov Random Fields (GMRFs). LÄS MER
4. Sampling-based Path Planning for an Autonomous Helicopter
Sammanfattning : Many of the applications that have been proposed for future small unmanned aerial vehicles (UAVs) are at low altitude in areas with many obstacles. A vital component for successful navigation in such environments is a path planner that can find collision free paths for the UAV. LÄS MER
5. On Importance Sampling and Dependence Modeling
Sammanfattning : This thesis consists of four papers. In the first paper, Monte Carlo simulation for tail probabilities of heavy-tailed random walks is considered. Importance sampling algorithms are constructed by using mixtures of the original distribution with some other state-dependent distributions. LÄS MER