Now showing items 1-20 of 3721

    • 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 ...
    • 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 ...
    • 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 ...
    • 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.
    • 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 ...
    • 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 ...
    • X‐ray diffraction approach to grain boundary and volume diffusion 

      Unnam, Jalaiah; Carpenter, Joseph A.; Houska, Charles R. (American Institute of Physics, 1973)
      A generalized two‐dimensional diffusionmodel has been developed which consists of an array of boundaries coupled to the free surface and to the substrate lattice. The model makes use of three nonlinear partial differential ...
    • 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 ...
    • 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 ...
    • 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 ...
    • 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 ...
    • A DOS-M Primer 

      Cline, Ben E. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74006-R
      No abstract available.
    • 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.
    • GLM Versus Continuous Approximation for Convex Integer Programs 

      Greenberg, Harvey J. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74022-R
      GLM is compared to continuous approximation for convex, integer programs. After noting the stronger bound provided by GLM, Lagrangian duality and a gap closing heuristic is used to demonstrate how GLM may provide a better ...
    • 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 ...
    • 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 ...
    • 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 ...
    • Parallel_plate waveguide with sinusoidally perturbed boundaries 

      Nayfeh, Ali H.; Asfar, Omar R. (American Institute of Physics, 1974)
      The method of multiple scales is used to obtain a uniformly valid asymptotic expansion for the propagation of TM modes on a parallel_plate waveguide with perfectly conducting boundary surfaces that are sinusoidally perturbed ...
    • The Logical Foundations of Microlanguages 

      Wesselkamper, Thomas C. (Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74020-R
      After the consideration of two recent examples of instruction sets for microprogrammable computers, the article sketches known and new results about complete sets of functions which appear to be applicable to microlanguage ...