Search Constraints

Start Over
Filtering by: Creator Leichti, Robert J. Remove constraint Creator: Leichti, Robert J. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Computing entropy for Z²-actions

    Creator:
    Pierce, Larry A.
    Abstract:
    For a certain class of Z²-actions, we provide a proof of a conjecture that the ratio of the Perron eigenvalues of the transfer matrices of the free boundary restrictions converge to the entropy of that action. Also, a novel method for computing the entropy of Z²-actions is conjectured.
    Resource Type:
    Dissertation
    Full Text:
    : Computing Entropy for Z2-actions Abstract Approved: Robert M. Burton Abstract: For a certain class of Z2

  • Usable and Scalable Querying of Scientific Datasets

    Creator:
    McCamish, Benjamin J.
    Abstract:
    Scientists and engineers have to analyze and query multiple large databases. Analysis over databases created by phasor measurement units can provide insight into the health of the grid, thereby improving control over operations. Realizing this data-driven control, however, requires validating, processing and storing massive amounts of PMU data efficiently, which...
    Resource Type:
    Dissertation
    Full Text:
    system measurements Ben McCamish, Rich Meier, Jordan Landford, Robert B Bass, David Chiu, Eduardo

  • Probabilities of voting paradoxes with three candidates

    Creator:
    McDonald, Leslie M.
    Abstract:
    Pardoxes in voting has been an interest of voting theorists since the 1800's when Condorcet demonstrated the key example of a voting paradox: voters with individually transitive rankings produce an election outcome which is not transitive. With Arrow's Impossibility Theorem, the hope of finding a fair voting method which accurately...
    Resource Type:
    Masters Thesis
    Full Text:
    discontinued at the behest of new member Napolean Bonaparte [3]. Other mathematicians such as E. J. Nanson

  • Mixing time for a 3-cycle interacting particle system : a coupling approach

    Creator:
    Eves, Matthew Jasper
    Abstract:
    This thesis examines the mixing times for one-dimensional interacting particle systems. We use the coupling method to study the mixing rates for particle systems on the circle which move according to specific permutations e.g., transpositions and 3-cycles.
    Resource Type:
    Masters Thesis
    Full Text:
    /ubc.pdf 8. D. Aldous and J. Fill, Reversible Markov Chains and Random Walks on Graphs http

  • Decentralized Multi-Robot Exploration with Sparse Communication through Deep Imitation Learning

    Creator:
    Senewiratne, Yomal K.
    Abstract:
    We present a method for decentralized, multi-robot exploration in adverse environments where communication is minimal. A key conceptual feature of our method is enabling implicit coordination between robots by training a Convolutional Neural Network (CNN) as a heuristic for planning using Monte Carlo Tree Search (MCTS). Our method consists of...
    Resource Type:
    Masters Thesis
    Full Text:
    location vt and and ground truth map Gj in trial j as input to produce training data for the CNN. The CNN

  • Network Coding, Random Matrices, and Their Applications to Communication Systems

    Creator:
    Nguyen-Huu, Duong
    Abstract:
    In this work, we study network coding technique, its relation to random matrices, and their applications to communication systems. The dissertation consists of three main contributions. First, we propose efficient algorithms for data synchronization via a broadcast channel using random network coding. Second, we study the resiliency of network coding...
    Resource Type:
    Dissertation
    Full Text:
    ) = ( D k ) αki (1− αi)D−k P(Ki ≤ k) = F (k,D, αi) = k∑ j=0 ( D k ) αji (1− αi)D−j (3.3) Now since K

  • Incorporating labeled features into image classification using generalized expectation

    Creator:
    Moore, Travis
    Abstract:
    Image classification is a difficult problem, often requiring large training sets to get satisfactory results. However this is a task that humans perform very well, and incorporating user feedback into these learning algorithms could help reduce the dependency on large amounts of labeled training data. This process has already been...
    Resource Type:
    Masters Thesis
    Full Text:
    , if a segment has a SIFT vector s, and it is clustered into group j, then we say that the feature

  • Anomaly Detection and Probabilistic Diagnosis for Automated Data Quality Control

    Creator:
    Zemicheal, Tadesse H.
    Abstract:
    Advances in sensor technology are greatly expanding the range of quantities that can be measured while simultaneously reducing the cost. However, deployed sensors drift out of calibration and fail, so every sensor network requires quality control procedures to promptly detect these failures. To address these problems, we propose a two-level...
    Resource Type:
    Dissertation
    Full Text:
    distribution. Thin vertical and horizontal lines correspond to thresholds θj at various internal nodes in an

  • Behavior graphs for data-driven animation of 3d characters

    Creator:
    Srinivasan, Madhusudhanan
    Abstract:
    In this dissertation, we present a user-in-the-loop method for the design of an interactive motion data structure that benefits from the advantages of both motion graphs and blend-based techniques. Our novel approach automatically analyzes a traditional motion graph built from labeled motion clips. The result is a more condensed, coarser...
    Resource Type:
    Dissertation

  • Deep Learning for Human and Biological Languages

    Creator:
    Hong, Junki
    Abstract:
    We explore the application of deep learning to the disparate fields of natural language processing and computational biology. Both the sentences uttered by humans as well as the RNA and protein sequences found within the cells of their bodies can be considered formal languages in computer science, as sets of...
    Resource Type:
    Dissertation
    Full Text:
    ) label scores of the resulting span: ξ = maxX s(j, j+1, X) and σ = maxX s(k, j,X) where X is a