Now showing items 1-20 of 1036

    • Lpl: A Generalized List Processing Language 

      Claybrook, Billy G. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73009-R
      The paper describes LFL, a generalized list processing language. LFL allows the user to define multiple cell structures and cell sizes at runtime, thereby allowing nonhomogeneous list structures. The paper examines the ...
    • Dynamic Quantum Allocation and Swap-Time Variability in Time-Sharing Operating Systems 

      Bhat, U. Narayan; Nance, Richard E. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73001-R
      No abstract available.
    • Functionally Complete Machines 

      Wesselkamper, Thomas C. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73005-R
      This paper defines a functionally complete machine as a machine which is capable of evaluating every two place function over its data space. Necessary conditions on memory size for completeness are developed. These conditions ...
    • Fol: A Language for Implementing File Organizations for Information Storage And Retrieval Systems 

      Claybrook, Billy G. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73008-R
      The language FOL is described. FOL facilitates the implementation of file organizations for IS & R systems. FOL is implemented in a list processing language LPL. Files in FOL are interepreted as a list of records, where ...
    • A Complete Horizontal Microlanguage 

      Wesselkamper, Thomas C.; Nixon, Eric (Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73002-R
      This paper defines a data space whose points are trees with leaves which are [name,value] pairs. Over this space a substitution operator S (meaning informally "in x for y put z") is formally defined. Taken together with ...
    • A Topological Model of the Data Space for a Block Structured Language 

      Wesselkamper, Thomas C. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73004-R
      A space X is defined, the points of which are trees which possess a unique name property. A topology is defined for X based upon partial order. The topology is shown to be reasonably natural relative to the rationals. The ...
    • Microprogrammable Cellular Automata 

      Muzio, Jon C.; Wesselkamper, Thomas C. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73006-R
      This paper reports research into cellular automata with two binary inputs, two binary outputs, and an octal control variable. A set of control variables is chosen and it is shown that any function of three variables can ...
    • Generalized Structured Programming 

      Martin, Johannes J. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73003-R
      In an effort to eliminate some inconveniences connected with Dijkstra's method of Structured Programming, a generalized set of basic flow graphs for structuring programs is suggested. These structures generate the set of ...
    • The Dynamic Creation And Modification of Heuristics in a Learning Program 

      Claybrook, Billy G.; Nance, Richard E. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73007-R
      POLY FACT is a learning program that attempts to factor multivariable polynomials. The program has been successful in factoring polynomials (in simplified form) with a maximum of 84 terms, each term consisting of as many ...
    • On Making Bairstow's Method Work 

      Ault, David A. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74003-R
      No abstract available.
    • An Artificial Intelligence Approach to the Symbolic Factorization of Multivariable Polynomials 

      Claybrook, Billy G. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74019-R
      A new heuristic factorization scheme that uses learning to improve the efficiency of determining the symbolic factorization of multivariable polynomials with integer coefficients and an arbitrary number of variables and ...
    • Principle of Optimal Page Replacement and the LRU Stack Model 

      Lam, Felix L. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74023-R
      Program reference strings generated by the LRU stack model are considered, and expressions for the expected times to next reference for all pages occupying different LRU stack positions are derived. Using these expressions, ...
    • The Role of Automatic Digitizers in Computer Aided-design 

      Williams, Charles M. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74026-R
      The incorporation of facilities for automatically digitizing documents can considerably enhance the power of computer graphics in computer-aided-design. A hardware-software process is described which rapidly and economically ...
    • Definability of Boolean Function Over Many-value Boolean Algebra 

      Kang, Andy N. C.; Shen, Stewart N.T. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74007-R
      In this paper, the definability of functions over B_s is first briefly discussed. We then give necessary and sufficient conditions on the definable functions over B_2, boolean algebra of four values. An efficient algorithm ...
    • A File Definition Facility for File Structures 

      Claybrook, Billy G. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74001-R
      This paper describes a file definition facility (FDF) for defining files as graph structures. The structure of the file is explicitly declared in the file definition. Primitive functions(from graph theory), operators, and ...
    • The Relationship Between the Multiplicative And Mixed Generators Modulo 2^b 

      Overstreet, Claude Jr. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74012-R
      MacLaren and Marsaglia [4] comment that their test results suggest that the multiplicative generator performs better than the mixed generator. We attempt to answer the above question by showing that for any sequence of ...
    • Three Papers on the Completeness Properties of Abelian Semi groups and Groups 

      Wesselkamper, Thomas C. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74008-R
      The three papers presented here all arise from recent research into sets of operators which are sufficient to define a horizontal microlanguage for a computer and which are (in some undefined sense) natural for human ...
    • A Process for Producing Tactually Perceptible Images of Line Drawings for Use by the Blind 

      Williams, Charles M. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74031-R
      A working prototype computer controlled process is described for automatically converting line drawings into raised line images perceptible to the touch. The process uses an automatic digitizer for input and a milling ...
    • A Total Algorithm for Polynomial Roots Based Upon Bairstow's Method 

      Ault, David A. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74002-R
      This program uses Bairstow's method to find the real and complex roots of a polynomial with real coefficients. There are several reasons for developing a routine based upon Bairstow's method. It is sometimes the case ...
    • Some Experimental Observations on the Behavior of Composite Random Number Generators 

      Nance, Richard E.; Overstreet, Claude Jr. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74014-R
      A series of experiments with composite random number generators utilizing shuffling tables is described. The factors investigated are: (1) the magnitude of the modulus (equivalently, the word-size of the machine), (2) ...