Search Constraints

Start Over
Filtering by: Creator Blakemore, Paul R. Remove constraint Creator: Blakemore, Paul R. Academic Affiliation Electrical Engineering and Computer Science Remove constraint Academic Affiliation: Electrical Engineering and Computer Science Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • Walking tree methods for biological string matching

    Creator:
    Hsu, Tai C.
    Abstract:
    Approximate string matching is commonly used to align genetic sequences (DNA or RNA) to determine their shared characteristics. In contrast with the standard dynamic programming methods which use local edit distance models, the Walking Tree heuristic method was created to handle non-local changes, e.g., translocations, inversions, and duplications, altogether and...
    Resource Type:
    Dissertation
    Full Text:
    Biological String Matching Abstract approved Paul Cull Approximate string matching is commonly used to

  • A tool for visualizing sequence alignments and associating annotations

    Creator:
    Zhang, Wenpeng
    Abstract:
    Alignment of genomic sequences from different species is becoming an increasingly powerful method in biology, and is being used for many purposes. The result of sequence alignments is a list of pairs of matched locations between the pattern string and the text string. However, without any proper visualization tools to...
    Resource Type:
    Capstone Project
    Full Text:
    ?¾~---=----~--------------- Paul Cull Alignment of genomic sequences from different species is becoming an increasingly

  • Executable semantics for PLEXIL : simulating a task-scheduling language in Haskell

    Creator:
    Strauss, Paul J.
    Abstract:
    An interdisciplinary study into the theory of design decisions has yielded a model for tracking design changes in hardware/software systems, but it still needs to be applied to a larger system to test its efficiency at tracking important data. This thesis creates an implementation of PLEXIL, a language in development...
    Resource Type:
    Masters Thesis
    Full Text:
    Paul Strauss for the degree of Master of Science in Computer Science presented on June 8, 2009. Title

  • Ensemble Monte-Carlo planning : an empirical study

    Creator:
    Lewis, Paul
    Abstract:
    Monte-Carlo planning algorithms such as UCT make decisions at each step by intelligently expanding a single search tree given the available time and then selecting the best root action. Recent work has provided evidence that it can be advantageous to instead construct an ensemble of search trees and make a...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Paul Lewis for the degree

  • Motivating programmers through karma systems

    Creator:
    Cedeno, Jose
    Abstract:
    Keeping FOSS developers motivated is a challenging problem, and their motivation levels can affect the team's productivity and satisfaction, leading to higher or lower productivity. Using reputation systems as a motivator has become the de-facto standard for many online communities, rewarding user's activity through badges of honor or achievement levels....
    Resource Type:
    Masters Thesis
    Full Text:
     am  thankful  to  the  rest  of  my   committee:  Paul  Paulson,  Timothy

  • How well do professional developers test with code coverage visualizations? : an empirical study

    Creator:
    Lawrance, Joseph A.
    Abstract:
    Professional software developers do not test code adequately, even though testing tools are widely available. Until developers realize the deficiencies in their tests, inadequate testing of software seems likely to remain a major problem. To support developers writing tests, industry and researchers have proposed systems that visualize “testedness” for end-user...
    Resource Type:
    Masters Thesis
    Full Text:
    ) Committee Member (Paul Cull) Graduate School Representative (Margaret Niess) Date thesis presented April

  • Some contributions to asymmetric error control codes

    Creator:
    Elmougy, Samir
    Abstract:
    In some practical systems, most of the errors are of 1 → 0 type and 0 → 1 errors occur very rarely. In this thesis, first, the capacity of the asymmetric channel is derived. The capacity of the binary symmetric channel (BSC) and the Z-channel can be derived from this...
    Resource Type:
    Dissertation
    Full Text:
    errors using r = 2 check bits and up to m2 + r 2 errors using r > 2 check bits. Some upper bound on the

  • Adaptation-based programming

    Creator:
    Bauer, Tim
    Abstract:
    Partial programming is a field of study where users specify an outline or skeleton of a program, but leave various parts undefined. The undefined parts are then completed by an external mechanism to form a complete program. Adaptation-Based Programming (ABP) is a method of partial programming that utilizes techniques from...
    Resource Type:
    Dissertation
    Full Text:
    Decision Processes (MDPs). An MDP M consists of the following elements (S,A,T,R). • S represents a set of

  • Learning cost-sensitive diagnostic policies from data

    Creator:
    Zubek, Valentina Bayer
    Abstract:
    In its simplest form, the process of diagnosis is a decision-making process in which the diagnostician performs a sequence of tests culminating in a diagnostic decision. For example, a physician might perform a series of simple measurements (body tem- perature, weight, etc.) and laboratory measurements (white blood count, CT scan,...
    Resource Type:
    Dissertation
    Full Text:
    D'Ambrosio and Paul Adams, for their comments on my thesis and for fruitful discussions. Professor Bose

  • A recurrent neural network implementation using the graphics processing unit

    Creator:
    Moore, Christopher
    Abstract:
    We took the back-propagation algorithms of Werbos for recurrent and feed-forward neural networks and implemented them on machines with graphics processing units (GPU). The parallelism of these units gave our implementations a 10 to 100 fold increase in speed. For nets with less than 20 neurons the machine performed faster...
    Resource Type:
    Masters Thesis
    Full Text:
    ) { // f o r the weights f e ed ing in from the cur rent timeframe // forward−propogate the dX/dW ca l c u