mirage

Browsing by Author "Cull, Paul"

DSpace/Manakin Repository

Browsing by Author "Cull, Paul"

Sort by: Order: Results:

  • Adaptation-based programming 
    Bauer, Tim (Timothy R.) (2013-01-31)
    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 pro ...
  • Advanced separation of concerns and the compatibility of aspect-orientation 
    Dechow, Doug (2005-03-18)
    The appropriate separation of concerns is a fundamental engineering principle. A concern, for software developers, is that which must be represented by code in a program; by extension, separation of concerns is the abi ...
  • Algorithms for string matching with applications in molecular biology 
    Holloway, James Lee (2009-05-07)
    As the volume of genetic sequence data increases due to improved sequencing techniques and increased interest, the computational tools available to analyze the data are becoming inadequate. This thesis seeks to improve ...
  • An alternative architecture for performing basic computer arithmetical operations 
    Djang, Kevin (2000-05-11)
    The arithmetic portions of almost all modern processor architectures are of very similar design. We use the term "traditional" to describe this design, the primary characteristics of which are native support for integer ...
  • A comparison of simulated annealing and genetic algorithms for the genome mapping problems 
    Gunnels, John A. (1993-08-10)
    The data used for the construction of genome maps is imperfect, therefore the mapping of a physically linear structure must take place in a very uneven feature space. As the number of genes to be ordered grows, it appe ...
  • Design of efficient constant weight codes 
    Tallini, Luca (1996-11-14)
    In a constant weight code, each code word contains a constant number of 1's. If this number is equal to half the length of the code word then the code is called balanced. These codes find many applications in computer ...
  • Drawing graphs nicely 
    Palmer, Paul A. (1995-04-24)
    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. F ...
  • Error control techniques for the Z-channel 
    Oprisan, Paul (2004-12-07)
    The asymmetric nature of bit errors in several practical applications provides grounds for efficient error control techniques. The Z-channel model and special classes of codes like asymmetric error detection codes and ...
  • Evaluation functions in aerial image segmentation 
    Langford, William T. (2002-01-22)
    Remote sensing is the most practical way to acquire large amounts of land cover data for monitoring and understanding environmental change, so it is important to be able to map land cover from imagery. Maps defining la ...
  • Evolving character controllers for collision preparation 
    Rose, Robert W. (2006-10-02)
    Full dynamic control of physically simulated characters is the holy grail of video games and other interactive applications. Recent advances in the field have presented controllers that can handle the balance and fall ...
  • Exact learning of tree patterns 
    Amoth, Thomas R. (2001-06-01)
    Tree patterns are natural candidates for representing rules and hypotheses in many tasks such as information extraction and symbolic mathematics. A tree pattern is a tree with labeled nodes where some of the leaves may b ...
  • Exploring the Discrete Logarithm with Random Ternary Graphs 
    Brugger, Max Francis Josef (2008-06-17)
    Encryption is essential to the security of transactions and communications, but the algorithms on which they rely might not be as secure as we all assume. In this paper, we investigate the randomness of the discrete ex ...
  • A fast algorithm for determining the primitivity of an n x n nonnegative matrix 
    Leegard, Amanda D. (2002-11-27)
    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 posi ...
  • Fault-tolerant ring embedding in De Bruijn networks 
    Rowley, Robert A. (1993-12-02)
  • Hierarchical average reward reinforcement learning 
    Seri, Sandeep (2002-03-15)
    Reinforcement Learning (RL) is the study of agents that learn optimal behavior by interacting with and receiving rewards and punishments from an unknown environment. RL agents typically do this by learning value functi ...
  • How well do professional developers test with code coverage visualizations? : an empirical study 
    Lawrance, Joseph A. (2005-04-28)
    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 rem ...
  • Investigation and mitigation of the adverse effects of PWM adjustable speed drives 
    Zhang, Haoran (1998-12-15)
    With the introduction of high speed semiconductor power devices and the increased application of adjustable speed drives (ASDs) for efficient speed control of ac motors, there has been a growing number of costly motor- ...
  • LacEDAemon : a programming environment for the multiparadigm language leda 
    Pandey, Rajeev K. (1998-08-28)
    Multiparadigm programming languages are a recent development in the realm of programming languages. A multiparadigm programming language allows the use of multiple, differing programming paradigms without departing from ...
  • Learning hierarchical decomposition rules for planning : an inductive logic programming approach 
    Reddy, Chandrasekhara K. (1998-06-30)
    Arti cial Intelligence (AI) planning techniques have been central to automating a gamut of tasks from the mundane route planning and beer production to the ethereal image processing of space-ship images. Of all the pla ...
  • A library for doing polyhedral operations 
    Wilde, Doran K. (1993-12-06)
    Polyhedra are geometric representations of linear systems of equations and inequalities. Since polyhedra are used to represent the iteration domains of nested loop programs, procedures for operating on polyhedra can be ...

Search ScholarsArchive@OSU

Browse

My Account