Search Constraints

Start Over
Filtering by: Creator Raleigh%2C Robert J. Remove constraint Creator: Raleigh%2C 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

  • Activity recognition in desktop environments

    Creator:
    Shen, Jianqiang
    Abstract:
    Knowledge workers are struggling in the information flood. There is a growing interest in intelligent desktop environments that help knowledge workers organize their daily life. Intelligent desktop environments allow the desktop user to define a set of “activities” that characterize the user’s desktop work. These environments then attempt to identify...
    Resource Type:
    Dissertation
    Full Text:
    i s i n g s t u d e n t s h e n p r o j e c t T a s k T r a c e r c o m m e n t s o n t h e s i

  • Weakly Supervised Learning for Activity Recognition from Time Series Data

    Creator:
    Guan, Xinze
    Abstract:
    The thesis focuses on activity recognition from sensor data, which has spurred a great deal of interest due to its impact on health care and security. Previous work on activity recognition from multivariate time series data has mainly applied supervised learning techniques which require a high degree of annotation effort...
    Resource Type:
    Dissertation
    Full Text:
    . Correlation between each pair of axes:∑T i=1(si−µs)(vi−µv)√∑T i=1(si−µs) ∑T j=1(vj−µv) . O(N) Table 2.1

  • Enhancing Search-Based Techniques with Information Control Dependencies

    Creator:
    Aburas, Ali
    Abstract:
    Software testing is a very important task during software development and it can be used to improve the quality and reliability of the software system. One potential way to reduce the cost and increase the efficiency of software testing is to generate test data automatically. Search-based approaches successfully generate unit...
    Resource Type:
    Dissertation

  • Deep Convolutional Network on Point Clouds for 3D Scene Understanding

    Creator:
    Wu, Wenxuan
    Abstract:
    As one of the most popular data types, the point cloud is widely used in various appli- cations, including computer vision, computer graphics and robotics. The capability to directly measure 3D point clouds is invaluable in those applications as depth information could remove a lot of the segmentation ambiguities in...
    Resource Type:
    Dissertation
    Full Text:
    and meetings. I would like to thank my great lab mates Zhongang, Lawrence, Neale, Robert, Xingyi

  • 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