Search Constraints

Start Over
Filtering by: Creator Ogg, Alex G. Remove constraint Creator: Ogg, Alex G. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • A Benchmarking Study of Unsupervised Anomaly Detection Algorithms

    Creator:
    Emmott, Andrew F.
    Abstract:
    It is common practice in the unsupervised anomaly detection literature to create experimental benchmarks by sampling from existing supervised learning datasets. We seek to improve this practice by identifying four dimensions important to real-world anomaly detection applications --- point difficulty, clusteredness of anomalies, relevance of features, and relative frequency of...
    Resource Type:
    Masters Thesis
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . 111 G Supplemental Tables for Chapter 7 . . . . . . . . . . . . . . . . . . . 116 LIST OF TABLES

  • A Distributed Scheme for Accelerating and Scaling PSPNet

    Creator:
    Krishna, Ajay
    Abstract:
    Advances in deep learning based image processing have led to their adoption for a wide range of applications, and in tow with these developments is a dramatic increase in the availability of high quality datasets. With this comes the need to accelerate and scale deep learning applications in order to...
    Resource Type:
    Masters Thesis
    Full Text:
    Press, January 2007. [6] Alex Krizhevsky, Ilya Sutskever, and Geoffrey E. Hinton. Imagenet classifi

  • A General Purpose Agent-Based Blackboard Optimization Method Applied to Sodium Fast Reactor Design and Analysis

    Creator:
    Stewart, Ryan H.
    Abstract:
    We present a novel multi-objective optimization methodology built upon a multi-agent blackboard framework. This multi-agent blackboard system (MABS) synthesizes blackboard architectures, multi-agent environments, and optimization theory. The blackboard architecture creates the framework for initializing, storing, and solving a multi-objective optimization problem. Multiple agents allow for an optimization problem to be...
    Resource Type:
    Dissertation

  • Action Segmentation in Videos: Deep Models, Prediction Diffusion, and Deep-Temporal Augmentations

    Creator:
    Aziere, Nicolas
    Abstract:
    This paper addresses the high model complexity and overconfident frame labeling of state-of-the-art (SOTA) action segmenters. Their complexity is typically justified by the need to sequentially refine action segmentation through multiple stages of a deep architecture. However, this multistage refinement does not take into account uncertainty of frame labeling predicted...
    Resource Type:
    Dissertation

  • Advances in Simultaneous Translation

    Creator:
    Zheng, Renjie
    Abstract:
    Simultaneous translation, which translates concurrently with the source language speech, is widely used in many scenarios including multilateral organizations. However, it is well known to be one of the most challenging tasks for humans due to the simultaneous perception and production in two languages. On the other hand, simultaneous translation...
    Resource Type:
    Dissertation
    Full Text:
    summits (APEC/G-20). However, it is widely considered one of the most challenging tasks in NLP, and one

  • An Information Modeling Framework for Support of Sustainable Manufacturing System Design Decision Making

    Creator:
    Shankar Raman, Arvind
    Abstract:
    Manufacturing technology has continuously evolved and advanced over the past century; this has led to an increase in the production of consumer and industrial goods driven by simultaneous growth in population and wealth. Despite the resulting economic and labor growth, environmental impacts of manufacturing have increased dramatically due to the...
    Resource Type:
    Dissertation

  • Computational Approaches for RNA Structure Prediction with Dynamic Programming and Deep Neural Networks

    Creator:
    Deng, Dezhong
    Abstract:
    Our goal is to build a system to model the RNA sequences that reveals their structural information by using efficient dynamic programming algorithms and deep learning approaches. We aim to 1) achieve linear-time for RNA secondary structure prediction based on existing minimum free energy models; 2) utilize deep neural networks...
    Resource Type:
    Dissertation
    Full Text:
    ) time with Idea 2. G: further improving to O(n) time (but with approximate search) with Idea 3. In B, F

  • 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:
    Adenine (A) prefers to bind with Uracil (U) and Cytosine (C) prefers to bind with Guanine (G). The

  • Efficient Incremental Panorama Reconstruction from Multiple Videos

    Creator:
    Feng, Zhongyuan
    Abstract:
    Constructing a panorama from a set of videos is a long-standing problem in computer vision. A panorama represents an enhanced still-image representation of an entire scene captured in a set of videos, where each video shows only a part of the scene. Importantly, a panorama shows only the scene background,...
    Resource Type:
    Capstone Project

  • Explanations and Processes to Enable Humans to Assess AI with Respect to Manipulable Properties

    Creator:
    Dodge, Jonathan E.
    Abstract:
    Assessing AI systems is difficult. Humans rely on AI systems in increasing ways, both visible and invisible, meaning a variety of stakeholders need a variety of assessment tools (e.g., a professional auditor, a developer, and an end user all have different needs). We posit that it is possible to provide...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . 159 F Log Appendix - Computing a target tensor with CNN Agent . . . . . . . . 162 G How to