Physical Sciences and Mathematics Commons^™

Development, Evaluation & Selection Of Methods For Elliptic Partial Differential Equations, E. N. Hnoustis, Robert E. Lynch, T. S. Papatheodorou, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

One Address Computers Are Faster And Use Less Memory Space To Execute Arithmetic Assignment Statements, Victor Schneider, Bradford Wade

Department of Computer Science Technical Reports

No abstract provided.

An Algorithm For Finding All Isomorphisms Of Two Graphs, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

No abstract provided.

A Model Of Data Structures Commonly Used In Programming Languages And Data Base Management Systems, William L. Honig

Computer Science: Faculty Publications and Other Works

This thesis claims that contemporary data structures can be understood and studied with an intelligible model which captures their essential differences and similarities and, further, that such a model is an appropriate basis for a top-down description method for data structures. To define the scope of the model, the data structures included in 21 programming languages and data base management systems have been tabulated. Each individual data structure is illustrated with an example drawn from a published paper or a working computer program. This mélange of data structures is divided into three classes (aggregates, associations , and files) and each …

On The Benefactive Feature In Transitivity, Dale Ellen Gaucas

Electrical Engineering and Computer Science - Technical Reports

An elaboration on the transitivity system network introduced by M. A. K. Halliday is developed. This extension consists of a separate feature system network for the participant role of “beneficiary”. The formulation of the proposed grammar rules to conjoin this network and Halliday's is facilitated by building up the transitivity network to describe "systemically” and uniquely each type of benefactive and range clause presented by Halliday. Systemic descriptions of these clauses are given as examples throughout the discussion.

The Algorithm Selection Problem Iii - Approximation Theory Machinery, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Tree Structures Construction Using Hit Ratios, S. B. Yao

Department of Computer Science Technical Reports

No abstract provided.

Terminal Talk - The Wofford Connection - September 1974, Wofford College Computer Center

Terminal Talk

No abstract provided.

Statistical Modelling Of Computer Systems: A Review, Amrit L. Goel, Anand M. Joglekar

Electrical Engineering and Computer Science - Technical Reports

This paper briefly reviews the data dependent statistical methods useful for computer systems modelling. The techniques are classified according to their applicability toward comparison, tuning and design of computer systems. A review of publications dealing with statistical modeling of computer systems is presented and a comprehensive bibliography is included to provide a useful source of reference toward the present and potential applications of statistical methods for computer system modelling.

A Measure Of Structural Complexity For Context-Free Grammars, D. A. Workman

Department of Computer Science Technical Reports

No abstract provided.

A Non-Procedural High-Level Language For Automated Design Of Application Systems, J. F. Nunamaker

Department of Computer Science Technical Reports

No abstract provided.

Analysis Of Unsteady Flow Toward Artesian Wells By Three-Dimensional Finite Elements, Yang H. Huang, Shen-Jyh Wu

KWRRI Research Reports

A three-dimensional finite element computer program was developed for analyzing unsteady flow toward artesian wells. The program is designed especially for determining the drawdown around an artesian well penetrating fully or partially a nonhomogeneous and anisotropic aquifer of irregular shape and cross section. It can also be used as a general program for aquifer simulation and evaluation. A major advantage of the program lies in the minimum amount of input data required. By assuming the top and bottom boundaries of the aquifer as two arbitrary planes, the aquifer will be divided into six- or eight-node elements, and their nodal coordinates …

Selectively Defined Subsystems, Dorothy E. Denning, Peter J. Denning, G. Scott Graham

Department of Computer Science Technical Reports

No abstract provided.

Requirements Statement Language Principles For Automatic Programming, Thomas I. M. Ho, J. F. Nunamaker

Department of Computer Science Technical Reports

No abstract provided.

Comments On A Linear Paging Model, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.

Adaptive Approximation, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Multiprogrammed Memory Management, Peter J. Denning, G. Scott Graham

Department of Computer Science Technical Reports

No abstract provided.

Algorithms For Elliptic Partial Differential Equations: Metalgorithms And Selection, Elias N. Houstis, Robert E. Lynch, T. S. Papatheodorou, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

The Algorithm Selection Problem—Abstract Models, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

The Algorithm Selection Problem Ii—Two Concrete Problems: Numerical Analysis Quadrature—Algorithms, Operating Systems—Scheduling Design, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Experimental Validation Of A Structural Property Of Fortran Algorithms, Necdet Bulnut, Maurice H. Halstead, Rudolf Bayer

Department of Computer Science Technical Reports

No abstract provided.

Weight Distributions Of Some Classes Of Binary Cyclic Codes, Carlos R.P. Hartmann, J. R. Riek Jr., Ralph J. Longobardi

Electrical Engineering and Computer Science - Technical Reports

Let h1(x)h2(x) be the parity check polynomial of a binary cyclic code. This article presents a formula for decomposing words in the code as sums of multiples of words in the codes whose parity check polynomials are h1(x) and h2(x). This decomposition provides information about the weight distribution of the code.

Parallel Algorithms For Adaptive Quadrature Iii - Program Correctness, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Impurities Found In Algorithm Implementations, Necdet Bulnut, Maurice H. Halstead

Department of Computer Science Technical Reports

No abstract provided.

Abstract Families Of Context-Free Grammars, David Workman

Department of Computer Science Technical Reports

No abstract provided.

Terminal Talk - The Wofford Connection - February 1974, Wofford College Computer Center

Terminal Talk

No abstract provided.

Linear Bounded Tree Automata, Carol Chrisman

Department of Computer Science Technical Reports

No abstract provided.

Bayesian Confidence Limits For The Reliability Of Mixed Cascade And Parallel Independent Exponential Subsystems, James K. Byers, Ronald W. Skeith, Melvin D. Springer

Computer Science Faculty Research & Creative Works

This paper deals with the theoretical problem of deriving Bayesian confidence intervals for the reliability of a system consisting of both cascade and parallel subsystems where each subsystem is independent and has an exponential failure probability density function (pdf). This approach is applicable when test data are available for each individual subsystem and not for the entire system. The Mellin integral transform is used to analyze the system in a step-by-step procedure until the posterior pdf of the system reliability is obtained. The posterior cumulative distribution function is then obtained in the usual manner by integrating the pdf, which serves …

Towards A Theory Of Universal Speed-Independent Modules, Robert M. Keller

All HMC Faculty Publications and Research

Of concern here are asynchronous modules, i.e., those whose activity is regulated by initiation and completion signals with no clocks being present. First a number of operating conditions are described that are deemed essential or useful in a system of asynchronous modules, while retaining an air of independence of particular hardware implementations as much as possible. Second, some results are presented concerning sets of modules that are universal with respect to these conditions. That is, from these sets any arbitrarily complex module may be constructed as a network. It is stipulated that such constructions be speed independent, i.e., independent of …

Ua35/11 Student Honors Research Bulletin, Vol. Ii, Wku Honors Program

WKU Administration Documents

Articles written by honors program students. They were originally research projects, class papers or essays written for academic credit, but in each case the student has done further work editing and improving his or her manuscript for this publication. The articles represent a broad range of interests and disciplines, and they indicate a healthy attempt on the part of at least some students to dig for deeper knowledge and understanding than is usually associated with undergraduate study.

• Greene, Bruce. The Traditional Fiddle Music of South-Central Kentucky
• Moody, Marlin. Some Effects of the Herbicide Glyphosate on Johnson Grass Rhizomes
• Jones, Larry. …