VTechWorks staff will be away for the Thanksgiving holiday starting at noon on Wednesday, November 23, through Friday, November 25, and will not be replying to requests during this time. Thank you for your patience.
Browsing College of Engineering (COE) by Issue Date
Now showing items 120 of 4957

Memetic algorithms for Spatial Partitioning problems
(ACM, )Spatial optimization problems (SOPs) are characterized by spatial relationships governing the decision variables, objectives, and/or constraint functions. In this article, we focus on a specific type of SOP called spatial ... 
Survey of Approaches and Techniques for Security Verification of Computer Systems
(ACM, 2022)This paper surveys the landscape of security verification approaches and techniques for computer systems at different levels: from a softwareapplication level all the way to the physical hardware level. Different existing ... 
A History of Fort Caswell, North Carolina
(Baptist Student Union, North Carolina State University, 1965)A brief history of Fort Caswell, near Southport, North Carolina, at the mouth of the Cape Fear River. 
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 ... 
Dynamic Quantum Allocation and SwapTime Variability in TimeSharing Operating Systems
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1973), CS73001RNo abstract available. 
X‐ray diffraction approach to grain boundary and volume diffusion
(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 ... 
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 ... 
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 ... 
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 ... 
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 ... 
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 ... 
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 ... 
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 ... 
On Making Bairstow's Method Work
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74003RNo abstract available. 
An Artificial Intelligence Approach to the Symbolic Factorization of Multivariable Polynomials
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74019RA 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
(Department of Computer Science, Virginia Polytechnic Institute & State University, 1974), CS74023RProgram 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, ... 
Parallel_plate waveguide with sinusoidally perturbed boundaries
(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 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 ... 
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 ...