Search Constraints

Start Over
Filtering by: Creator Mellinger, David K. Remove constraint Creator: Mellinger, David 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

  • 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:
    Human and Biological Languages Abstract approved: David Hendrix and Liang Huang We explore the

  • Evaluating social media attention interventions

    Creator:
    Gasper, David M.
    Abstract:
    Social media platforms use many techniques to engage users' attention with their platforms, including notifications, popups, and gamification elements. The impact of social media on physical and mental health has been studied, but limited publicly available research exists on how social media users can be helped to disengage from these...
    Resource Type:
    Honors College Thesis
    Full Text:
    by David Motz Gasper A THESIS submitted to Oregon State University Honors College in

  • 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:
    committee: Alan Fern, David Maier, and Kyle Niemeyer. I would also like to thank my peers for their

  • Representationally Robust and Scalable Learning over Relational Databases

    Creator:
    Picado Leiva, Jose Manuel
    Abstract:
    Learning novel concepts from relational databases is an important problem with applications in several disciplines, such as data management, natural language processing, and bioinformatics. For a learning algorithm to be effective, the input data should be clean and in some desired representation. However, real-world data is usually heterogeneous – the...
    Resource Type:
    Dissertation
    Full Text:
    : Alan Fern, David Maier, Prasad Tadepalli, and Hector Vergara. Their insightful comments helped this

  • 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

  • Multiagent learning for locomotion and coordination in tensegrity robotics

    Creator:
    Iscen, Atil
    Abstract:
    Tensegrity structures are composed of pure compressional elements that are connected via a network of pure tensional elements. The concept of tensegrity promises numerous advantages to the field of robotics. Tensegrity robots are, however, notoriously difficult to control due to their oscillatory nature and nonlinear interaction between the components. Multiagent...
    Resource Type:
    Dissertation

  • Bayesian optimization with empirical constraints

    Creator:
    Azimi, Javad
    Abstract:
    Bayesian Optimization (BO) methods are often used to optimize an unknown function f(•) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are...
    Resource Type:
    Dissertation
    Full Text:
    select k ≥ 1 points to be evaluated. The results of those points are then added to the set of

  • 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

  • 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