Computer Sciences Commons^™

Design, Implementation And Evaluation Of A Revision Control System, Walter F. Tichy

Department of Computer Science Technical Reports

No abstract provided.

The Subjective Nature Of Programming Complexity, Daniel G. Mcnicholl, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

One of the more difficult problems confronting software engineers today is the construction of accurate predictive models of the software development process, [21,[8] and [93. It has long been recognized that one of the most essential elements of any successful model of this process is a quantification of the complexity of software systems. During the past several years a great deal of work has been performed by researchers such as Halstead [3], McCab [5], and others in an attempt to develop metrics which adequately capture the complexity of software systems. Yet one very important aspect of software development complexity seems …

Pg - A Preprocessor Generator, John Brophy

Department of Computer Science Technical Reports

No abstract provided.

Data Flow Program Graphs, Alan L. Davis, Robert M. Keller

All HMC Faculty Publications and Research

Data flow languages form a subclass of the languages which are based primarily upon function application (i.e., applicative languages). By data flow language we mean any applicative language based entirely upon the notion of data flowing from one function entity to another or any language that directly supports such flowing. This flow concept gives data flow languages the advantage of allowing program definitions to be represented exclusively by graphs. Graphical representations and their applications are the subject of this article.

A Hidden-Line Algorithm For Hyperspace, Robert P. Burton, David R. Smith

Faculty Publications

An object-space hidden-line algorithm for higher-dimensional scenes has been designed and implemented. Scenes consist of convex hulls of any dimension, each of which is compared against the edges of all convex hulls not eliminated by a hyperdimensional clipper, a depth test after sorting and a minimax text. Hidden and visible elements are determined in accordance with the dimensionality of the selected viewing hyperspace. When shape alone is the attribute of interest, hidden-line elimination need be performed only in that hyperspace. The algorithm is of value in the production of shadows of hyperdimensional models, including but not limited to four-dimensional space-time …

A Theory Of Small Program Complexity, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

Small programs are those which are written and understood by one. person. Large software systems usually consist of many small programs. The complexity of a small program is a prediction of how difficult it would be for someone to understand the program. This complexity depends of three factors: (1) the size and interelationships of the program itself; (2) the size and interelationships of the internal model of the program's purpose held by the person trying to understand the program; and (3) the complexity of the mapping between the model and the program. A theory of small program complexity based on …

Stochastic Modeling Of Individual Resource Consumption During The Programming Phase Of Software Development, Daniel G. Mcnicholl, Kenneth Magel

Computer Science Technical Reports

In the past several years there has been a considerable amount of research effort devoted to developing models of individual resource consumption during the software development process. Since many conditions affect individual resource consumption during the software development process, including several which are difficult if not impossible to quantify, it is our contention that a stochastic model is more appropriate than a deterministic model.

In order to test our hypothesis we conducted an experiment based upon several student programming assignments. Data from this experiment is used to demonstrate that the two parameter Log-Normal distribution is appropriate for describing the probabilistic …

A Finitary Retract Model For The Polymorphic Lambda-Calculus, Nancy Mccracken

Electrical Engineering and Computer Science - Technical Reports

There has been great interest in recent years in designing programming languages which permit functions which may accept types as parameters (polymorphic functions) and types with type parameters (type generators). Unfortunately the semantics of such functions and types has not been as well understood as their practical use in software design. In [McCracken 1979], a denotational semantics was given for a simple programming language with these features. The semantics used closures, which are a special case of the more familiar retractions, over the Scott universal domain, Pw to represent types. It was then possible to interpret polymorphic functions as continuous …

Ua35/11 Student Honors Research Bulletin, Wku Honors Program

WKU Administration Documents

The WKU Student Honors Research Bulletin is dedicated to scholarly involvement and student research. These papers are representative of work done by students from throughout the university.

• Garvin, Catherine. The Recognition of Anticipatory Grieving and Associated Needs of the Family of a Critically Ill Patient
• Parks, Barbara. Energy Properties of Textiles
• Martin, Lanna. A Historical Approach to the Understanding of Civil Disobedience
• Atwood, Tammy. The Computer Manufacturing Industry and the Burroughs Corporation
• Allen, Christopher. The Battle of Marathon: Athens' Magnificent Triumph
• Martin, Lanna. Melville's Creation of Captain Vere as Pontius Pilate in Billy Budd
• Boles, Barbara. Emerson's Uriel and the …

An Approximation Theory For Conjugate Surfaces And Solutions Of Elliptic Multiple Integral Problems: Application To Numerical Solutions Of Generalized Laplace's Equation, John Gregory, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

An Approximation Theory is Given for a Class of Elliptic Quadratic Forms Which Include the Study of Conjugate Surfaces for Elliptic Multiple Integral Problems. These Ideas Follow from the Quadratic Form Theory of Hestenes, Applied to Multiple Integral Problems by Dennemeyer, and Extended with Applications for Approximation Problems by Gregory. the Application of This Theory to a Variety of Approximation Problem Areas in This Setting is Given. These Include Conjugate Surfaces and Conjugate Solutions in the Calculus of Variations, Oscillation Problems for Elliptic Partial Differential Equations, Eigenvalue Problems for Compact Operators, Numerical Approximation Problems, And, Finally, the Intersection of These …

Probabilistic Simulations, Nicholas J. Pippenger

All HMC Faculty Publications and Research

The results of this paper concern the question of how fast machines with one type of storage media can simulate machines with a different type of storage media. Most work on this question has focused on the question of how fast one deterministic machine can simulate another. In this paper we shall look at the question of how fast a probabilistic machine can simulate another. This approach should be of interest in its own right, in view of the great attention that probabilistic algorithms have recently attracted.

Bachelor's Degree Programs In Electrical Engineering, Computer Science, Computer Systems 1982-83, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Center For Science And Engineering, Master Of Science, Computer Science 1982, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Graduate Bulletin, 1982-1984 (1982), Moorhead State University

Graduate Bulletins (Catalogs)

No abstract provided.

Simulation Of Burley Tobacco Harvesting-Housing Systems, Ronald L. Bingner, Larry G. Wells, Thomas C. Bridges, George A. Duncan

Biosystems and Agricultural Engineering Faculty Publications

A computer model has been developed using systems analysis techniques to simulate the labor and equipment aspects of harvesting burley tobacco. By varying the parameters of the model the user can determine a harvesting and housing strategy based on labor and equipment availability.

Fault Coverage Requirement In Production Testing Of Lsi Circuits, Vishwani D. Agrawal, Sharad C. Seth, Prathima Agrawal

School of Computing: Faculty Publications

A technique is described for evaluating the effectiveness of production tests for large scale integrated (LSI) circuit chips. It is based on a model for the distribution of faults on a chip. The model requires two parameters, the average number (n₀) of faults on a faulty chip and the yield (y) of good chips. It is assumed that the yield either is known or can be calculated from the available formulas. The other parameter, n₀, is determined from an experimental procedure. Once the model is fully characterized, it allows calculation of the field …

Octal-Tree Spatial Sorting And Its Applications, Jeffrey L. Posdamer

All Computer Science and Engineering Research

An octal tree subdivision recursively divides a bounded three-dimensional volume into octanta about an internal division point. This scheme has been used to represent cellular or enumerated voxel models of solid objects. Given one or more sets of points sampled from the surface of a solid, an octal tree may be generated in which each leaf node contains m or less points. By specifying the tree traversal rule, the points are accessed in a sorted order. By defining m=3, a divide-and-conquer surface triangulation algorithm may be developed which does not require special sampling conditions (such as co-planarity) on subsets of …

Robotics And The Conservation Of Human Resources, Robert U. Ayres, Steven M. Miller

Research Collection School Of Computing and Information Systems

Due to rapid expansion in the field of robotics, policy issues have arisen in regard to developing human skills to deal with the new technology and to deal with the obsolescent human skills which are the inevitable result of this growth pattern. Industrialists, educators, union leaders, and government officials must work cooperatively to insure that the coming changes are made with minimum disruption. Improved training methods and courses have to be developed for the skills needed to control, manage and supervise the new machines. Some of the ways in which this can be accomplished are through offering financial incentives for …

Some Results On Optimum Premium Payment Plans, Jeyaraj Vadiveloo, Kishan Mehrotra, Kenneth Kaminsky

Electrical Engineering and Computer Science - Technical Reports

Any insurance plan consists of a sequence of payments every year (or some other fixed time interval) in return for certain death benefits. The benefits may take the form of a wide variety of insurances or annuities. For simplicity, we will assume that premiums and benefits are paid annually. In this paper, we investigate the appropriateness of this type of plan. Naturally, appropriateness of any plan cannot be measured without an optimality criteria. Three such criteria, which are statistical in nature, are introduced in this paper. For the principal "safety" criterion which we use, the optimal premium are those which …

Cost-Performance Bounds For Multi-Microcomputer Networks, Daniel A. Reed, Herbert D. Schwetman

Department of Computer Science Technical Reports

No abstract provided.

Array Facilities In Programming Languages, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Programming Processor Interconnection Structures, Lawrence Snyder

Department of Computer Science Technical Reports

No abstract provided.

A Direct Formulation And Computer-Implementation Of A Symbolic Network Analysis Algorithm, Timothy James Knerr

Electrical & Computer Engineering Theses & Dissertations

An algorithm for the symbolic analysis of linear, time-invariant, active or passive networks is presented. The algorithm incorporates the best features of earlier numerical and topological methods of symbolic analysis. A hybrid set of equations is formulated for a closed linear graph and arranged in matrix form. A numerical evalu­ation procedure for the determinant of this hybrid matrix results in an efficient method of symbolic analysis. A proof of the algorithm based on determinant evaluation by a permutation product expansion provides insight into relationships with other methods of symbolic analysis. A computer program implementation of the algorithm is described and …

Some Observations On The Development Of Use Of Computer Informational Systems In Hospital Settings And Recommendations For Proposed Implementation At St. Joseph's Hospital, Andrew Z. Richardson

Theses

An intent is stated to discuss the developmental history and social impact of computer information retrieval systems on the hospital setting with primary area of focus being the Pharmacy Department. The interrelationship among various areas in the hospital setting are considered for need and cost/benefit associated with the use of a computerized information retrieval system.

A Case Study of St. Joseph Hospital is presented in example of evaluative consideration for implementation of a computerized information retrieval system.

Different forms of the "state-of-the-art" in informational systems are considered for their effective impact on cost/ benefit ratios to patient care and hospital …

Computer Science: Brave New Field, Gerald Hoekema

Pro Rege

No abstract provided.

The Purdue Multimachine Pipeline: A High Bandwidth Machine Network And Programming Environment For Research In Large Scale Computation, Douglas E. Comer, Peter J. Denning, John R. Rice, Lawrence Snyder

Department of Computer Science Technical Reports

No abstract provided.

The Software Science Language Level Metric, S. D. Conte

Department of Computer Science Technical Reports

No abstract provided.

The Flat File Database Generator Ffg, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.

Testing The Coordination Predicate, Janice D. Cuny, Lawrence Synder

Department of Computer Science Technical Reports

No abstract provided.

A Computer-Assisted Instructional System And Its Application To A Course On Computer Structures And Hardware, Tahir Mufti

Masters Theses

Computer-Assisted Instruction is a powerful tool which is fast becoming an integral part of the instructional system in schools.

The objective of this study is to review the techniques used to provide Computer-Assisted Instruction and to present such an instructional system called LEARN which is general enough to be applied towards the teaching of any subject. Also included are notes on the application of the LEARN system to a subject entitled "Computer Structures and Hardware".