Search Constraints

Start Over
Filtering by: Creator Currey, Donald R. Remove constraint Creator: Currey, Donald R. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Learning to Estimate Multi-Relation Aggregation Functions

    Creator:
    Jadhav, Rashmi Suresh
    Abstract:
    Multi-relation aggregation queries process the join operator before computing the aggregation function. This join is arguably the most costly operation since traditional join algorithms spend majority of their time trying to join the parts of the relations that do not generate any output tuples. This causes slow response times with...
    Resource Type:
    Masters Thesis
    Full Text:
    outer relation R with an inner relation S as R ./ S. The outer relation R is scanned and for each tuple

  • Collaborative Online Learning For Join Processing

    Creator:
    Xie, Mian
    Abstract:
    Relational binary operators, such as join, are arguably the most costly and frequently used operations in relational data systems. In many join algorithms, the majority of the process time is spent on scanning and attempting to join the parts of the relations that do not satisfy the join condition and...
    Resource Type:
    Capstone Project
    Full Text:
    the goal of improving the total reward in the long-run. For example, consider the join of relations R

  • Action Selection for Heterologous Control of a Continuous-Output Myoelectric Prosthesis

    Creator:
    Sylwester, Sean T.
    Abstract:
    Significance: Movement intent decoding algorithms can interpret human bioelectrical signals to control prosthetic limbs with many degrees of freedom (DOFs). This work involves decoding volitional movement intent from surface electromyogram (sEMG) signals to control prosthetic arms. To train these algorithms, patients flex their muscles to “follow” a movement prompt, and...
    Resource Type:
    Masters Thesis
    Full Text:
    samples: ei,j = 1 Nr Nr∑ r=1 √ 1 |Ni| ∑ n∈Ni ( xji,r[n]− x̄ j i,r[n] )2 e [0,1] i,j = ei,j

  • 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:
    recalibrate the sensors. Hence, we need to include a variable r(t) that is 1 if a technician has visited the

  • Theory and Implementation of a Variational Database Management System

    Creator:
    Ataei, Parisa S.
    Abstract:
    In this thesis, I present the variational database management system, a formal framework and its implementation for representing variation in relational databases and managing variational information needs. A variational database is intended to support any kind of variation in a database. Specific kinds of variation in databases have already been...
    Resource Type:
    Dissertation
    Full Text:
    16 Relational database objects: a ∈ AttrName Attribute Name v ∈ AttrDom Attribute Value r ∈ RelName

  • 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:
    reward r i t+n at some time step (t+n) in the future as shown visually in Figure 3.2. After the rollout

  • 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

  • Applying hierarchical and adaptive control to coordinating simple robots

    Creator:
    Knudson, Matthew D.
    Abstract:
    Coordinating multiple robots to achieve a complex task requires solving two distinct control problems: the high-level control problem of ensuring that each robot aims to perform a useful task (e.g., coordination) and the low-level control problem of ensuring that each robot actually performs the correct actions to achieve its task...
    Resource Type:
    Masters Thesis
    Full Text:
    ) reinforcement learning algorithm. s, a, and r are the current state, action, and re- ward respectively. Next

  • Analysis of bio-based composites for image segmentation with the aid of games

    Creator:
    Inouye, Jennifer A.
    Abstract:
    A fundamental problem in computer vision is to partition an image into meaningful segments. While image segmentation is required by many applications, the thesis focuses on segmentation of computed tomography (CT) images for analysis and quality control of composite materials. The key research contribution of this thesis is a novel...
    Resource Type:
    Masters Thesis

  • Interactive player tracking for videos in American football

    Creator:
    Bawaskar, Amit
    Abstract:
    This thesis presents an interactive software tool for tracking a moving object in a video. In particular, we focus on the problem of tracking a player in American football videos. Object tracking is one of the fundamental problems in computer vision. It is one of the most important components in...
    Resource Type:
    Masters Thesis
    Full Text:
    : Crop two sets of image patches on the new object location Xpos = {x : ||l(x)−lt|| < r} and Xneg = {x