Search Constraints

Start Over
Filtering by: Creator Ryan, J. P. Remove constraint Creator: Ryan, J. P. Committee Member Fern, Alan Remove constraint Committee Member: Fern, Alan

Search Results

  • Agile Bipedal Maneuvers Optimized then Learned from Single Rigid-Body Model Dynamics

    Creator:
    Batke, Ryan
    Abstract:
    As bipedal robots move ever closer to being integrated into all manner of real world envi-ronments there is a necessity to push their dynamic capabilities to meet or exceed those of humans and animals. Advancements must be made to address ordinary challenges that arise everyday in the same environments that...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Ryan Batke for

  • Agile Bipedal Locomotion via Hierarchical Control by Incorporating Physical Principles, Learning, and Optimization

    Creator:
    Green, Kevin
    Abstract:
    Robotic Bipedal locomotion holds the potential for efficient, robust traversal of difficult terrain. The difficulty lies in the dynamics of locomotion which complicate control and motion planning. Bipedal locomotion dynamics are dimensionally large problems, extremely nonlinear, and operate on the limits of actuator capabilities, which limit the performance of generic...
    Resource Type:
    Dissertation
    Full Text:
    , John Warila, Yesh Godse, Ryan Batke, Fangzhou Yu, Andrew Sanders and Grace Stridick for working with

  • Listing as a Potential Connection between Sets of Outcomes and Counting Processes

    Creator:
    Erickson, Sarah A.
    Abstract:
    Counting problems are rich in opportunities for students to make meaningful mathematical connections and develop non-algorithmic thinking; their accessible nature and applications to computer science make counting problems a valuable part of mathematics curricula. However, students struggle in various ways with counting, and while previous studies have indicated that listing...
    Resource Type:
    Masters Thesis
    Full Text:
    author also thanks the members of her thesis committee, Dr. Thomas P. Dick, Dr. Mary Beisiegel, and Dr

  • 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:
    ,j = 1, if the ith record falls into the specified value and range of the jth bin, and bi,j = 0

  • Methods for Detection and Recovery of Out-of-Distribution Examples

    Creator:
    Ratzlaff, Neale J.
    Abstract:
    Deep neural networks currently comprise the backbone of many applications where safety is a critical concern, for example: autonomous driving and medical diagnostics. Unfortunately these systems currently fail to detect out-of-distribution (OOD) inputs and can be prone to making dangerous errors when exposed to them. In addition, these same systems...
    Resource Type:
    Masters Thesis
    Full Text:
    discriminator forces Q(q|s) to be well-distributed and close to P . . . . . 14 2.2 Results of HyperGAN on the

  • 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:
    MedianRef map- ping (p = 0.0017, p = 0.0497, respectively). The Action Screening algorithm also

  • Object detection in biological images using a search-based framework

    Creator:
    Lam, Michael
    Abstract:
    This thesis addresses a basic problem in computer vision, that of semantic labeling of images. Our work is aimed at object detection in biological images for evolutionary biology research. In particular, our goal is to detect nematocysts in Scanning Electron Microscope (SEM) images. This biological domain presents challenges for existing...
    Resource Type:
    Masters Thesis
    Full Text:
    a pruning function (P) to remove bad candidate labelings generated by the successor function. This

  • 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:
    ) are defined as follows αt(j) = P (x 1, x2, . . . , xt, zt = j|λ), βt(j) = P (x t+1, xt+2, . . . , xT

  • 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:
    points transformed from global into local coordinates, p is the coordi- nates of points, and f is the

  • Structured learning with latent variables : theory and algorithms

    Creator:
    Zhao, Kai
    Abstract:
    Most tasks in natural language processing (NLP) try to map structured input (e.g., sentence or word sequence) to some form of structured output (tag sequence, parse tree, semantic graph, translated/paraphrased/compressed sentence), a problem known as “structured prediction”. While various learning algorithms such as the perceptron, maximum entropy, and expectation-maximization have...
    Resource Type:
    Dissertation
    Full Text:
    +2 . . . yi) = max y1,...,yi−k i∑ j=1 fw(yj ;x, yj−k+1 . . . yj−1) = max yi−k+1 Gw(x, yi−k+1

  • Toward Disentangling the Activations of the Deep Networks via Low-dimensional Embedding and Non-negative Factorization

    Creator:
    Khorram, Saeed
    Abstract:
    In this thesis, we introduce a novel Explanation Neural Network (XNN) to explain the predictions made by a deep network. The XNN works by embedding a high-dimensional activation vector of a deep network layer non-linearly into a low-dimensional explanation space while retaining faithfulness i.e., the original deep learning predictions can...
    Resource Type:
    Masters Thesis
    Full Text:
    ) Pixel-level probability Sn,mip,jp ; (b) Voronoi-based probability S n,m p for the example image in

  • 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:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1515 2.6 Modelling the P (A(v)|s1, . . . , si) . . . . . . . . . . . . . . . . . . . . . . . 1717 2.7

  • Uncertainty in Deep Learning with Implicit Neural Networks

    Creator:
    Ratzlaff, Neale
    Abstract:
    The ability to extract uncertainties from predictions is crucial for the adoption of deep learning systems to safety-critical applications. Uncertainty estimates can be used as a failure signal, which is necessary for automating complex tasks where safety is a concern. Furthermore, current deep learning systems do not provide uncertainty estimates,...
    Resource Type:
    Dissertation
    Full Text:
    ) to be well-distributed and according to the distribution P

  • Characterizing and Addressing Dataset Shift with Deep Learning

    Creator:
    Olson, Matthew L.
    Abstract:
    This dissertation delves into understanding, characterizing, and addressing dataset shift in deep learning, a pervasive issue for deployed machine learning systems. Integral aspects of the problem are examined: We start with the use of counterfactual explanations in order to characterize the behavior of deep reinforcement learning agents in visual input...
    Resource Type:
    Dissertation
    Full Text:
    highlighted in bold. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 3.3 A table of p-values for a

  • Navigation and coordination of autonomous mobile robots with limited resources

    Creator:
    Knudson, Matthew D.
    Abstract:
    The use of autonomous robots in complex exploration tasks is rapidly increasing. Indeed, robots can provide speed and cost effectiveness in many tasks, as well as allow operation in environments that are hostile to humans. In this dissertation we: 1) provide two adaptive navigation algorithms; 2) develop a coordination mechanism;...
    Resource Type:
    Dissertation
    Full Text:
    peek over my shoulder from time to time and offer a suggestion or two. Second, to Ryan Williams, a

  • Active Learning from Examples, Queries and Explanations

    Creator:
    Hamidi-Haines, Mandana
    Abstract:
    Humans are remarkably efficient in learning by interacting with other people and observing their behavior. Children learn by watching their parents’ actions and mimic their behavior. When they are not sure about their parents demonstration, they communicate with them, ask questions, and learn from their feedback. On the other hand,...
    Resource Type:
    Dissertation
    Full Text:
    ∑ i≤k≤j P (A→ B,C)αi,k(B)αk+1,j(C) (2.1) 14 Algorithm 1 Learning Hierarchical Policies 1: Input

  • Fine-Grained Object Recognition Under Limited Training Data

    Creator:
    Lam, Michael Q.
    Abstract:
    This dissertation addresses object recognition in challenging settings, where distinct object classes are visually very similar (e.g., species of birds and insects) and/or access to training examples of object classes is limited (e.g., due to the associated high costs of data annotation). In this dissertation, we present a variety of...
    Resource Type:
    Dissertation
    Full Text:
    subsequent iterations j, we perform search using a mixture of the learned heuristic from the previous

  • Planning in multi-agent partially observable domains using sparse sampling

    Creator:
    Donneau-Golencer, Thierry D.
    Abstract:
    A large number of sequential decision-making problems in uncertain environments can be modeled as Markov Decision Processes (MDPs). In such settings, an agent can observe at each time step the state of the environment and then executes an action, causing a stochastic transition to a new state of the environment...
    Resource Type:
    Masters Thesis
    Full Text:
    \<>�9I_<"��� D\<p&r<>� -2:s<"��� �!/K')�+ \-0/�HJ�!/K<j&2/�*t<>���9/_�quG�q3 8!1�<>�!D &E/v&289<"�+-0/sQ

  • Adaptive Movement Intent Decoding for Intuitive Control of Neuroprostheses

    Creator:
    George, Damon A.
    Abstract:
    Movement intent decoders, which interpret volitional movement intent from human bioelectric signals, can be incorporated into modern neuroprostheses to offer people living with limb loss or paralysis the potential to regain their lost motor control. Machine learning methods have become the research standard for continuous decoders with high degrees of...
    Resource Type:
    Masters Thesis
    Full Text:
    tests (p < 0.05). . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 5.4 Coe�cients of

  • 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:
    be computed using Equation. (2.2) µ ± tp σ√ |A| (2.2) where tp is the t statistic such that for p

  • Hierarchical structure discovery and transfer in sequential decision problems

    Creator:
    Mehta, Neville
    Abstract:
    Acting intelligently to efficiently solve sequential decision problems requires the ability to extract hierarchical structure from the underlying domain dynamics, exploit it for optimal or near-optimal decision-making, and transfer it to related problems instead of solving every problem in isolation. This dissertation makes three contributions toward this goal. The first...
    Resource Type:
    Dissertation
    Full Text:
    actions taken by an agent (at discrete time intervals) (Bellman, 1957). It is defined as M = (S,A,P,R

  • 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:
    ), and factor label (~yL). ∂ ∂λ(Ct,j,~yL) (−4(P T , P̂θ)) = ∂ ∂λ(Ct,j,~yL) [− ∑ f∈F ∑ ~yc P T

  • Efficient Algorithms for Robust Spatiotemporal Data Analysis

    Creator:
    Moore, Travis W.
    Abstract:
    Many large-scale data analysis applications involve data that can vary over both time and space. Often the primary goal of analyzing spatiotemporal data is identifying trends, movements, and sudden changes with respect to time, location, or both. This can include a variety of applications in economics (housing prices, unemployment, job...
    Resource Type:
    Dissertation
    Full Text:
    rotations J ′p+1 . . .J ′ n−1 will set wp+1 = √ w2p+1 + . . .+ w 2 n = √∑n j=p+1(Q ′ jv) 2) = ||Q[·,(p

  • Robust and Efficient Classification of Videos in the Wild

    Creator:
    Mahasseni, Behrooz
    Abstract:
    Recognizing human actions in videos is a long-standing problem in computer vision with a wide range of applications including video surveillance, content retrieval, and sports analysis. This thesis focuses on addressing efficiency and robustness of video classification in unconstrained real-world settings. The thesis work can be broadly divided into four...
    Resource Type:
    Dissertation

  • 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:
    (three MDs) dataset while increasing the number of positive and negative (#P, #N) training examples.125

  • 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
    Full Text:
      (3.7) The cost function is defined such that C = ∑ ij ∑ k(r k ij) 2, where rkij = p k ij − f n j

  • Fast queuing policies via convex relaxation

    Creator:
    Nguyen-Huu, Duong
    Abstract:
    Traditionally, networking protocol designs have placed much emphasis on point-to-point reliability and efficiency. With the recent rise of mobile and multimedia applications, other considerations such as power consumption and/or Quality of Service (QoS) are becoming increasingly important factors in designing network protocols. As such, we present a new flexible framework...
    Resource Type:
    Masters Thesis
    Full Text:
    has i packets with i, j ∈ {0, 1, 2}. For each aperiodic and irreducible P , there exists a unique

  • Revenue-based spectrum management via Markov decision process

    Creator:
    Zhu, Pingan
    Abstract:
    We consider the problem of wireless spectrum management in cognitive wireless networks that maximizes the revenue for a spectrum operator. Specifically, we study the problem on how a wireless spectrum operator can optimally allocate its limited spectrum to various classes users/devices who pay differently for their spectrum per unit time....
    Resource Type:
    Masters Thesis
    Full Text:
    each sn ∈ S by n ⎫⎬ ⎧⎨ U ∗ n(sn) = max a∈A rn(sn, a) + p(j|sn, a)U ∗ n+1(j)⎭ . ⎩ j∈S Set d

  • 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

  • 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:
    ),1G(v j) ] where Cov [ 1F (v i),1G(v j) ] = { P [F ∩G]− P [F ]P [G] if i = j 0 if i 6= j so that

  • Machine learning for improving the quality of citizen science data

    Creator:
    Yu, Jun
    Abstract:
    Citizen Science is a paradigm in which volunteers from the general public participate in scientific studies, often by performing data collection. This paradigm is especially useful if the scope of the study is too broad to be performed by a limited number of trained scientists. Although citizen scientists can contribute...
    Resource Type:
    Dissertation
    Full Text:
    follows: vj = σ(Uj · γ) P (Ej |Uj ;γ) = v Ej j (1− vj) 1−Ej (3.3) In order to incorporate birder

  • Recognizing human group activities in video through mining optimal features

    Creator:
    Amer, Mohamed R.
    Abstract:
    Given a video, we would like to recognize group activities, localize video parts where these activities occur, and detect actors involved in them. To this and, we propose a novel, mid-level feature, called control point, for representing group activities. The control points are aimed at summarizing visual cues, lifting from...
    Resource Type:
    Masters Thesis
    Full Text:
    ), ∝ ∑ M,O P (M)P (LS, LE|M,O,F) ∏ i,j P (Fj|Fi). (6.1) Similar to Markov chain model we compute (6.1) by

  • Network coding for multi-user wireless networks

    Creator:
    Nguyen, Dong Van
    Abstract:
    Until a few years ago, wireless-capable laptops were considered novelties by many. It is now hard to find a laptop or a hand-held computing device that is not wireless-ready. As wireless devices are becoming commodities, they have also become an indispensable part of the modern society. Not surprisingly, research in...
    Resource Type:
    Dissertation

  • Protein secondary structure prediction using conditional random fields and profiles

    Creator:
    Shen, Rongkun
    Abstract:
    Protein secondary structure prediction plays a pivotal role in predicting protein folding in three-dimensions. Its task is to assign each residue one of the three secondary structure classes helix, strand, or random coil. This is an instance of the problem of sequential supervised learning in machine learning. This thesis describes...
    Resource Type:
    Masters Thesis
    Full Text:
    j i j i j j j i a a j i j b b j i j i j j j i a b J P Y X y X y y X Z X y X y y X Z X g y X f y

  • From shape-based object recognition and discovery to 3D scene interpretation

    Creator:
    Payet, Nadia
    Abstract:
    This dissertation addresses a number of inter-related and fundamental problems in computer vision. Specifically, we address object discovery, recognition, segmentation, and 3D pose estimation in images, as well as 3D scene reconstruction and scene interpretation. The key ideas behind our approaches include using shape as a basic object feature, and...
    Resource Type:
    Dissertation
    Full Text:
    subtended by lines (Pi−j, Pi) and (Pi, Pi+j), as illustrated in Figure 2.2. Pi−j and Pi+j are two

  • Efficient training and feature induction in sequential supervised learning

    Creator:
    Hao, Guohua
    Abstract:
    Sequential supervised learning problems arise in many real applications. This dissertation focuses on two important research directions in sequential supervised learning: efficient training and feature induction. In the direction of efficient training, we study the training of conditional random fields (CRFs), which provide a flexible and powerful model for sequential...
    Resource Type:
    Dissertation
    Full Text:
    as P (xt|yt) = ∏ j P (xt,j|yt) . This assumption of independence of each input feature xt,j

  • From multitarget tracking to event recognition in videos

    Creator:
    Brendel, William
    Abstract:
    This dissertation addresses two fundamental problems in computer vision—namely, multitarget tracking and event recognition in videos. These problems are challenging because uncertainty may arise from a host of sources, including motion blur, occlusions, and dynamic cluttered backgrounds. We show that these challenges can be successfully addressed by using a multiscale,...
    Resource Type:
    Dissertation
    Full Text:
    cardinality |V |=n. E is the set of undirected edges connecting only those tracklets i(t)∈V and j(t)∈V that

  • 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:
    for computing a p-safe uniform schedule with maximum number of stages given the scheduling

  • 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:
    projection of α onto the ith coordinate. For i < j, by αji we mean the word of length j − i+ 1 which is the

  • Protocol design and optimization for wireless networks

    Creator:
    Lertsutthiwong, Monchai
    Abstract:
    We investigate a number of techniques for increasing throughput and quality of media applications over wireless networks. A typical media communication application such as video streaming imposes strict requirements on the delay and throughout of its packets, which unfortunately, cannot be guaranteed by the underlying wireless network due inherently to...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . 69 3.1 A simple subnetwork ad hoc model when host i intends to send the packets to its neighbor j

  • Data-Driven Approaches For Decoding Volitional Movement Intent From Bioelectrical Signals

    Creator:
    Cunha Dantas, Henrique
    Abstract:
    There are nearly two million limb amputees living in the United States of America. Loss of limbs results in profound changes in one's life. However, the underlying neural circuitry and much of the ability to sense and control movements of their missing limb is retained even after limb loss. This...
    Resource Type:
    Dissertation
    Full Text:
    minimize the following cost function: J (z,θ1,θ2) = N∑ t=1 ||z(t )− f2( f1(z(t ),θ1),θ2)||2 +λ1||θ1||2

  • Probabilistic models for quality control in environmental sensor networks

    Creator:
    Dereszynski, Ethan W.
    Abstract:
    Networks of distributed, remote sensors are providing ecological scientists with a view of our environment that is unprecedented in detail. However, these networks are subject to harsh conditions, which lead to malfunctions in individual sensors and failures in network communications. This behavior manifests as corrupt or missing measurements in the...
    Resource Type:
    Dissertation
    Full Text:
    conditional distribution on P (X|S,O = o). Right: After marginalizing our uncertainty about the sensor state

  • Hierarchical graphical models for activity recognition in videos

    Creator:
    Amer, Mohamed R.
    Abstract:
    This dissertation addresses the problem of recognizing human activities in videos. Our focus is on activities with stochastic structure, where the activities are characterized by variable space-time arrangements of actions, and conducted by a variable number of actors. These activities occur frequently in sports and surveillance videos. They may appear...
    Resource Type:
    Dissertation
    Full Text:
    i, l; indices of the product nodes are j, k; and i+ denotes the set of children of i. An edge (i, j

  • 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:
    from trial j to create a belief map bit, the next action to take vit+1, paths traversed p i t and the

  • The density signature

    Creator:
    Migler-VonDollen, Theresa
    Abstract:
    In real networks, identifying dense regions is of great importance. For example, in a network that represents academic collaboration, authors within the densest component of the graph tend to be the most prolific. Dense subgraphs often identify communities in social networks. And dense subgraphs can be used to discover regulatory...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 5.1.1 Gn,p . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 TABLE

  • Action Segmentation with Limited Supervision

    Creator:
    Li, Jun
    Abstract:
    In this dissertation, we address action segmentation in videos under limited supervision. The goal of action segmentation is to predict an action class for each frame of a video. The limited supervision means ground truth labels of video frames are not available in training. We focus on three types of...
    Resource Type:
    Dissertation
    Full Text:
    . . . . . . . . . . . . . . . . . . . . . . . . . . 24 2 Computing the logadd score of all paths in P , for the discriminative forward loss LDF

  • 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:
    probability P (yi|x) for each known class yi. The highest-probability output class label y ∗ is selected as

  • 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

  • Learning MDP action models via discrete mixture trees

    Creator:
    Wynkoop, Michael S.
    Abstract:
    This thesis addresses the problem of learning dynamic Bayesian network (DBN) models to support reinforcement learning. It focuses on learning regression tree models of the conditional probability distributions of the DBNs. Existing algorithms presume that the stochasticity in the domain can be modeled as a deterministic function with additive noise....
    Resource Type:
    Masters Thesis
    Full Text:
    tree representation for P (x1(t + 1)|x1(t), x2(t), x3(t)) with relational internal nodes and a

  • Customizable Visual Traces for Program Explanations

    Creator:
    Bajaj, Divya
    Abstract:
    Correctness and efficiency are important properties of programs. However, to support maintenance and debugging, the programs should also be understandable. Program explanations also play a vital role in educational settings, enhancing the understanding of programs among students. Proof trees provide a sound basis for generating dynamic explanations of programs. But...
    Resource Type:
    Masters Thesis
    Full Text:
    = \x ->x*x in sqr 5⇓ 25. 20 j ∈ Jν ::= ρ : e⇓ ν (Evaluation) | ν|p ρ (Pattern Matching) | v op v