Browsing Computer Science Technical Reports by Issue Date
Now showing items 120 of 1035

Lpl: A Generalized List Processing Language
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73009RThe 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73004RA 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73008RThe 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73007RPOLY 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73002RThis 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73003RIn 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 SwapTime Variability in TimeSharing Operating Systems
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73001RNo abstract available. 
Microprogrammable Cellular Automata
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73006RThis 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73005RThis 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74012RMacLaren 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74005RThe 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74010RThe purpose of this paper is to explain a computerized process whereby any wellformed 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74029RAn operational hardwaresoftware system is described which rapidly and economically converts hardcopy 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74016RNo abstract available. 
Implementation of Fortran Random Number Generators on Computers with One's Complement Arithmetic
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74011RNo abstract available. 
WorkingSetLike Memory Management Algorithms
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74025RThis 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74018RThis 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74032RThe 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 Aideddesign
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74026RThe incorporation of facilities for automatically digitizing documents can considerably enhance the power of computer graphics in computeraideddesign. A hardwaresoftware process is described which rapidly and economically ... 
Definability of Boolean Function Over Manyvalue Boolean Algebra
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74007RIn 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 ...