Search Constraints

Start Over
Filtering by: Creator Stern, Robert K. Remove constraint Creator: Stern, Robert K. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • 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

  • 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

  • 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:
    simulation when pk = 1 6 for all k . . . . . . . . . . . . 23 2.2 Probability of A being the pairwise winner

  • 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:
    interest k < n. Previous work has shown by various methods that the bound on the mixing time should be O

  • Statistical Properties and Guarantees for Certain Anomaly Detection Relevant Problems

    Creator:
    Liu, Si
    Abstract:
    Anomaly detection aims at detecting the points that appear different than the majority of the data, such that they are suspected to be generated from a different distribution. Anomaly detectors have been applied in many different fields, such as detecting fraudulent behaviors in bank transaction, finding broken sensors in a...
    Resource Type:
    Dissertation
    Full Text:
    detector iForest, for the purpose of outputting the top k most anomalous points as early as possible. The

  • 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

  • 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:
    TaskPredictor for FA as a function of the number of selected features K. Error bars denote 95% confidence

  • 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:
    Coding example . . . . . . . . . . . 12 3.1 Empirical P[K > k] vs. N

  • 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:
    exponent of a weighted sum of features over a subset of ~X and ~Y . P (~Y | ~X) = 1 Z( ~X) ∏ A∈Ψ exp( K

  • Open Set Learning with Counterfactual Images

    Creator:
    Neal, Lawrence W.
    Abstract:
    In open set recognition, a classifier must label instances of known classes while detecting instances of unknown classes not encountered during training. To detect unknown classes while still generalizing to new instances of existing classes, this thesis introduces a dataset augmentation technique called counterfactual image generation. This approach, based on...
    Resource Type:
    Masters Thesis
    Full Text:
    dataset with varying K. . . . . . . . . . . . . . . . . 25 4.2 Receiver Operating Curve plots for open