Search Constraints

Start Over
Filtering by: Creator Onyango, Paul O. Remove constraint Creator: Onyango, Paul O. Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • A fast algorithm for determining the primitivity of an n x n nonnegative matrix

    Creator:
    Leegard, Amanda D.
    Abstract:
    Nonnegative matrices have a myriad of applications in the biological, social, and physical genres. Of particular importance are the primitive matrices. A nonnegative matrix, M, is primitive exactly when there is a positive integer, k, such that M[superscript k] has only positive entries; that is, all the entries in M[superscript...
    Resource Type:
    Masters Thesis
    Full Text:
    Determining the Primitivity of an n x n Nonnegative Matrix Abstract approved Paul Cull Nonnegative matrices

  • 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

  • An algebraic view of the symmetry of fast transforms

    Creator:
    Ruby, Glenn Russell
    Abstract:
    Why are the fast Fourier transform and the fast Hadamard transform fast? A transform can be computed by multiplying a matrix times a vector, which normally requires 0(n²) operations. The matrices corresponding to these transforms can be rearranged to eliminate redundant computations resulting in O(nlogn) operations. We investigate algebraic reasons...
    Resource Type:
    Masters Thesis
    Full Text:
    : Redacted for Privacy Dr!' Paul Cull Why are the fast Fourier transform and the fast Hadamard transform

  • Description and comments on a matrix algebraic method for the determination of isomorphism in pairs of undirected graphs

    Creator:
    Fogg, Ka-Hung
    Abstract:
    This paper describes an investigation of a matrix algebraic method to determine isomorphism in pairs of undirected graphs. The method is described in some detail. The theoretical as well as the practical difficulties are given. It is shown that the method works for some cases. When the adjacency matrix of...
    Resource Type:
    Capstone Project
    Full Text:
    May, 1978 Revised, June 8,1978 ) APPROVED: CL( Paul Cull, Associate Professor Department

  • Drawing graphs nicely

    Creator:
    Palmer, Paul A.
    Abstract:
    A graph may he drawn in many different ways. We investigate how to draw a graph nicely, in the sense of being visually pleasing. We discuss the history of this field, and look at several algorithms for drawing graphs. For planar graphs this problem has been algorithmically solved: that is,...
    Resource Type:
    Masters Thesis
    Full Text:
    Drawing graphs nicely \N ABSTRACT OF THE THESIS OF Paul A

  • A laboratory station timetable problem

    Creator:
    Mickelsen, Thomas E.
    Abstract:
    The general problem of classroom scheduling is well known to be NP-complete. A typical classroom scheduling problem is that of assigning students to a limited number of pieces of laboratory equipment. Frequently several identical pieces of equipment are available only at fixed hours and have limited access due to physical...
    Resource Type:
    Capstone Project
    Full Text:
    : Paul Cull, Associate Professor Department of Computer Science in charge of major ~ R., ~ Curtis R

  • 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

  • The FLEX/REFLEX paradigm and its application to computer program systems

    Creator:
    Colby, Jonathan Axford
    Abstract:
    The FLEX/REFLEX paradigm is applied to the description of a computer program system. The paradigm is shown to be relevant and appropriate to computer program systems and to advantageously display and structure the general hierarchical characteristics of computer program systems. Program systems characterized in the paradigm are described both holistically...
    Resource Type:
    Masters Thesis
    Full Text:
    and Its Application to Computer Program Systems Abstract approved: Redacted for Privacy Paul Cull

  • The "Mobius Cube" : an interconnection network for parallel computation

    Creator:
    Larson, Shawn M.
    Resource Type:
    Masters Thesis
    Full Text:
    processor has a fault tolerance O. For n" 1, we note that a 0- ot tension of dimension n is simply a 0

  • Probabilistic computation in stochastic pulse neuromime networks

    Creator:
    Hangartner, Ricky Dale
    Resource Type:
    Dissertation
    Full Text:
    Neuromime Networks Abstract approved- Paul Cull. Biological neural networks embody a unique combination