Skip to Main Content
  1. Graduate and Postdoctoral Studies (GPS), Faculty of
  2. Theses and Dissertations

Theses and Dissertations

This collection contains theses and dissertations of graduate students of the University of Alberta. The collection contains a very large number of theses electronically available that were granted from 1947 to 2009, 90% of theses granted from 2009-2014, and 100% of theses granted from April 2014 to the present (as long as the theses are not under temporary embargo by agreement with the Faculty of Graduate and Postdoctoral Studies). IMPORTANT NOTE: To conduct a comprehensive search of all UofA theses granted and in University of Alberta Libraries collections, search the library catalogue at www.library.ualberta.ca - you may search by Author, Title, Keyword, or search by Department.
To retrieve all theses and dissertations associated with a specific department from the library catalogue, choose 'Advanced' and keyword search "university of alberta dept of english" OR "university of alberta department of english" (for example). Past graduates who wish to have their thesis or dissertation added to this collection can contact us at erahelp@ualberta.ca.

Items in this Collection

Skip to Search Results
Filter
Close
Subject / Keyword
Author / Creator / Contributor
Year
to
Collections
Languages
Item type
Departments
Supervisors

Results for "Probability Distributions on a Circle"

Subject: Probability

  • Exploiting Symmetries to Construct Efficient MCMC Algorithms With an Application to SLAM

    Download

    Spring 2015

    Shariff, Roshan

    Sampling from a given probability distribution is a key problem in many different disciplines. Markov chain Monte Carlo (MCMC) algorithms approach this problem by constructing a random walk governed by a specially constructed transition probability distribution. As the random walk progresses, the

    distribution of its states converges to the required target distribution. The Metropolis-Hastings (MH) algorithm is a generally applicable MCMC method which, given a proposal distribution, modifies it by adding an accept/reject step: it proposes a new state based on the proposal distribution and the existing

    state of the random walk, then either accepts or rejects it with a certain probability; if it is rejected, the old state is retained. The MH algorithm is most effective when the proposal distribution closely matches the target distribution: otherwise most proposals will be rejected and convergence to

  • Re-Sampling the Ensemble Kalman Filter for Improved History Matching and Characterizations of Non-Gaussian and Non-Linear Reservoir Models

    Download

    Spring 2015

    nejadi, siavash

    Gaussian variables, but it often fails to honor the reference probability distribution of the model parameters where the distribution of model parameters are non-Gaussian and the system dynamics are strongly nonlinear. In this thesis, novel sampling procedures are proposed to honor geologic information in

    certain number of assimilation steps, the updated ensemble is used to generate a new ensemble that is conditional to both the geological information and the early production data. Probability field simulation and a novel probability weighted re-sampling scheme are introduce to re-sample a new ensemble

    . After the re-sampling step, iterative EnKF is again applied on the ensemble members to assimilate the remaining production history. A new automated dynamic data integration workflow is implemented for characterization and uncertainty assessment of fracture reservoir models. This new methodology includes

1 - 2 of 2