Search Constraints

Start Over
Filtering by: Creator Beardsley, Paul M. Remove constraint Creator: Beardsley, Paul M. Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • Inspiring End-user Programming Through Exposure to Multi-platform Computing and Improved Integrated Development Environments

    Creator:
    Beardsley, Dedrie
    Abstract:
    The art of software engineering inherently requires high-level problem solving and perseverance, as programmers and designers wrestle with complex design and implementation challenges in the process of turning loose concepts and ideas into working code. In the current developer ecosystem, engineers are commonly incentivized extrinsically by monetary rewards, approval or...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Dedrie Beardsley for the degree of Master of Arts in

  • A linear equation model for a family of interconnection networks

    Creator:
    Larson, Shawn M.
    Abstract:
    The most important part of parallel computation is communication. Except in the most embarassingly parallel examples, processors cannot work cooperatively to solve a problem unless they can communicate. One way to solve the problem of communication is to use an interconnection network. Processors are located at nodes of the network,...
    Resource Type:
    Dissertation
    Full Text:
    networks AN ABSTRACT OF THE THESIS OF Shawn M. Larson for the degree of Doctor of Philosophy in

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

    Creator:
    Larson, Shawn M.
    Resource Type:
    Masters Thesis
    Full Text:
    Computation AN ABSTRACT OF THE THESIS FOR Shawn M. Larson for the degree of Master of Science in Computer

  • 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

  • Algorithm animation in a declarative visual programming language

    Creator:
    Carlson, Paul M.
    Abstract:
    How might capabilities for algorithm animation be seamlessly integrated into a programming language that is both visual and declarative? Until now, visual programming language researchers have not attempted to answer that question, making the fruits of algorithm animation available only to users of textual programming languages. Users of visual programming...
    Resource Type:
    Masters Thesis
    Full Text:
    language AN ABSTRACT OF THE THESIS OF Paul M. Carlson for the degree of Master of Science in Computer

  • 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

  • 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

  • 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