Browsing College of Engineering (COE) by Issue Date
Now showing items 2140 of 3583

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 ... 
Some Experimental Observations on the Behavior of Composite Random Number Generators
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74014RA 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 wordsize of the machine), (2) ... 
On Making Bairstow's Method Work
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74003RNo abstract available. 
The Role of Automatic Digitizers in Demography
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74028RThe incorporation of facilities for automatically digitizing maps and drawings can considerably enhance the power of the computer in demographical research. A hardwaresoftware process is described which can rapidly, ... 
A Note on Ledgard's Minilanguage 2 And a Proposal for an Alternative
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74017RThis note reviews and discusses the concepts of assignment statements which occur within programming languages and as exemplified by Minilanguage 2 by Ledgard [3]. Observing that the description of assignment by Ledgard ... 
Analysis of an Enumeration Algorithm for Unordered Kpartitions of N
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74009RIn many combinatorial problems, the need to compute the number of unrestricted partitions of n or to enumerate over the set of unrestricted partitions of n occurs frequently. Let two positive integers k and n be given, ... 
Searching One Multiplier in Glm
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74024RA unified approach is developed for onedimensional GLM. The major result is a convergence theorem for interval reduction. Comparative analysis of bisection, linear interpolation and tangential approximation reveals the ... 
Rootheavy Directory Tree on Direct Access Storage Devices
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74004RNo abstract available. 
The Logical Foundations of Microlanguages
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74020RAfter 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 ... 
A DOSM Primer
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74006RNo abstract available. 
The Use of Computer Modulated Drawing in the Teaching of Art
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74030RA hardwaresoftware process is described which automatically creates computer modulated drawings from an artist's own works. The process allows a drawing to act as a constant source of data for a series of renditions of ... 
GLM Versus Continuous Approximation for Convex Integer Programs
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74022RGLM 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 ... 
A File Definition Facility for File Structures
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74001RThis 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 Mixed Method of Random Number Generation: A Tutorial
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74013RSeveral motivations are recognized for userdefined random number generators in preference to builtin generators. The mixed method of random number generation is discussed) and the conditions for achieving full period ...