Now showing items 1-20 of 1035

    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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.
    • 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 ...
    • 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 ...
    • The Relationship Between the Multiplicative And Mixed Generators Modulo 2^b 

      Overstreet Jr., Claude (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 ...
    • Introduction to Pest Control Using the Watfiv Compiler 

      Ault, David A. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74005-R
      The purpose of this paper is to consolidate into a brief guide procedures to aid in debugging FORTRAN programs which are being executed under the control of a WATFIV compiler.
    • A Computer Implementation of the Transformations of Formulas into Prenex Normal Form 

      Provenza, Clinton E. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74010-R
      The purpose of this paper is to explain a computerized process whereby any well-formed formula (wff) of first order predicate calculus can be moved to its prenex normal form (PNF). The main features of the program demonstrate ...
    • The Automatic Digitizer in Computer Graphics 

      Williams, Charles M. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74029-R
      An operational hardware-software system is described which rapidly and economically converts hard-copy drawings into graphic data structures faithfully representing both their geometry and their topology. These facilities ...
    • First Report on Epos: Aspects of Generality And Efficiency in Programming Language Implementation 

      Martin, Johannes J. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74016-R
      No abstract available.
    • Implementation of Fortran Random Number Generators on Computers with One's Complement Arithmetic 

      Nance, Richard E.; Overstreet Jr., Claude (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74011-R
      No abstract available.
    • Working-Set-Like Memory Management Algorithms 

      Lam, Felix L.; Ferrari, Domenico (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74025-R
      This paper considers the design and evaluation of memory management algorithms to be applied to multiprogramming computer systems with virtual memory. The operation of the Denning working set algorithm is studied and ...
    • Learning as a Problem Solving Tool 

      Claybrook, Billy G. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74018-R
      This paper explores the use of learning as a practical tool in problem solving. The idea that learning should and eventually will be a vital component of most Artificial Intelligence programs is pursued. Current techniques ...
    • On the Minimal Total Path Length of a Spanning Tree 

      Kang, Andy N. C.; Ault, David A. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74032-R
      The notions of a balance node and the total path length with respect to a node u of a spanning tree are defined. We show that the total path length of a spanning tree with respect to u is minimal if and only if u is a ...
    • 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 ...