Digital Commons Network^™

An Investigation Of The Relationship Between Initial And Final Programming Effort Estimates, Andrew S. Wang

Department of Computer Science Technical Reports

No abstract provided.

A Hybrid Metric To Measure Software Complexity, Warren Harrison, Kenneth I. Magel

Computer Science Technical Reports

Software complexity is an important facet of the software development process, especially in regard to maintenance. A number of complexity metrics have been developed to measure the complexity contributed by: program size, flow of control, data structures, or a combination of two or more of these. Several representative measures from each of these groups are described.

A new hybrid complexity metric, the Extended Scope Metric, is presented and compared with other popular complexity metrics. While the new metric appears to be an improvement over existing metrics due to its enhanced context sensitivity and comprehensiveness, conclusive results cannot be determined until …

A New Ordering Scheme For The Hermite Bicubic Collocation Equations, Wayne R. Dyksen

Department of Computer Science Technical Reports

No abstract provided.

Ellpack User's Guide Supplement, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Topological Analysis Of The Complexity Of Computer Programs With Less Than Three Binary Branches, Warren Harrison, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

No abstract provided.

The Menu Formation In A Computerized Nutrition System, Kathleen Ann Kostrzewa

Masters Theses

The creation of a diet is a complex process which involves analysis of a number of critical variables. Due to present technology, computers can be used effectively in menu planning and recipe analysis.

The objective of this study is the utilization of the computer to test the major criteria which must be met in order to produce a diet which meets nutritional, cost, and acceptability requirements. In this thesis, the design and implementation of a computerized menu planning system known as the Nutritional Data Base System is presented.

Pmva - Purdue Mean Value Analysis Program User's Guide, Jeff Brumfield

Department of Computer Science Technical Reports

No abstract provided.

Multi-Scan Correlation To Separate Radar Tracks From False Alarms, R. I. Greenberg, R. E. Thurber, R. J. Prengaman

Computer Science: Faculty Publications and Other Works

An algorithm and computer software have been developed to filter out clutter in radar displays in order to clarify real tracks. Detections are generally declared valid when found to be part of a reasonable pattern of three or four detections in an eight scan history. The filtering process reduces the number of spurious reports by several orders of magnitude, providing significant improvement in distinguishing ships from waves and other sources of undesired radar reflections. The algorithm is being incorporated into radar system hardware in order to improve tracking of ships as signals are received. The method also shows promise for …

Recommendations For Master's Level Programs In Computer Science: A Report Of The Acm Curriculum Committee On Computer Science, Kenneth I. Magel, Richard H. Austing, Alfs Berztiss, Gerald L. Engel, John Wesley Hamblen, A. A.J. Hoffmann, Robert Mathis

Computer Science Faculty Research & Creative Works

The ACM Committee on Curriculum in Computer Science has spent two years investigating master's degree programs in Computer Science. This report contains the conclusions of that effort. Recommendations are made concerning the form, entrance requirements, possible courses, staffing levels, intent, library resources, and computing resources required for an academic, professional, or specialized master's degree. These recommendations specify minimum requirements which should be met by any master's programs. The Committee believes that the details of a particular master's program should be determined and continually updated by the faculty involved. A single or a small number of model programs are not as …

Application Of Information Theory To The Construction Of Efficient Decision Trees, Carlos R.P. Hartmann, Pramod Varshney, Kishan Mehrotra, Carl L. Gerberich

Electrical Engineering and Computer Science - Technical Reports

This paper treats the problem of conversion of decision tables to decision trees. In most cases, the construction of optimal decision trees is an NP-complete problem and, therefore, a heuristic approach to this problem is necessary. In our heuristic approach, we apply information theoretic concepts to construct efficient decision trees for decision tables which may include “don’t-care” entries. In contrast to most of the existing heuristic algorithms, our algorithm is systematic and has a sound theoretical justification. The algorithm has low design complexity and yet provides us with near-optimal decision trees.

Specifying And Proving Properties Of Sentinels, Krithivasan Ramamritham, Robert M. Keller

All HMC Faculty Publications and Research

This paper presents a technique for specifying and verifying properties of "sentinels," a high-level language construct for synchronizing access to shared resources. Statements in the specification language possess formal temporal semantics. As a prelude to proving the correctness of sentinels, the semantics of constructs used in sentinels is given. The proof technique involves showing that the temporal behavior of a sentinel conforms to that defined by the specification. The methodology is illustrated by applying it to a typical synchronization problem.

Algorithms For Pipe Network Analysis And Their Reliability, Don J. Wood

KWRRI Research Reports

Algorithms for analyzing steady state flow conditions in pipe networks are developed for general applications. The algorithms are based on both loop equations expressed in terms of unknown flowrates and node equations expressed in terms of unknown grades. Five methods, which represent those in significant use today, are presented. An example pipe network is analyzed to illustrate the application of the various algorithms. The various assumptions required for the different methods are presented and the methods are compared within a common framework.

The reliabilities of these commonly employed algorithms for pipe network analysis are investigated by analyzing a large number …

A General Theory Of Automatic Program Synthesis, Carl H. Smith

Department of Computer Science Technical Reports

No abstract provided.

A Model For Representing Families Of Programmed System, Walter F. Richy

Department of Computer Science Technical Reports

No abstract provided.

Regular Expressions In A Program Complexity Metric, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

No abstract provided.

A Complexity Measure Based On Nesting Level, Warren A. Harrison, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

No abstract provided.

A Suggested Course In Introductory Computer Programming, Warren A. Harrison, Kenneth I. Magel

Computer Science Faculty Research & Creative Works

Introductory programming courses have long been a popular topic of discussion. Often it is either the only computer course a student takes, or it is the foundation upon which all further training in computer science is built. The usual goal of such a course is to introduce the student to the use of a computer to solve simple problems in his or her particular discipline. Generally, the method of presenting the material may be separated into two distinct schools of thought, which we have termed the "Black Box School of Thought" and the "White Box School of Thought". In this …

Computers, Corporate Division Programs, Your Future, 1981-1982, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Algebraic Complexity Theory, Nicholas Pippenger

All HMC Faculty Publications and Research

Algebraic complexity theory, the study of the minimum number of operations sufficient to perform algebraic computations, is surveyed with emphasis on the general theory of bilinear forms and two of its applications: polynomial multiplication and matrix multiplication. Though by no means exhausting algebraic complexity theory, these topics illustrate well its development and its methods, and provide examples of its most striking successes.

The Double Eigenvalue Problem; Including Numerical Solutions, John Gregory, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

No abstract provided.

Random Variables And A Sovereign God, Lloyd Montzingo

ACMS Journal 2004

This paper takes a brief look at the history of conflict between the concepts of chance and divine activity. After reviewing some evidence for randomness in the universe, present philosophical and theological views from four different scientists on this subject are presented. The discussion concludes with some questions and observations concerning those questions.

Forecasting Reject Rate Of Tested Lsi Chips, Sharad C. Seth, Vishwani D. Agrawal

School of Computing: Faculty Publications

The reject rate of LSI chips due to incomplete fault coverage of the tests is the fraction of faulty chips, among the chips that pass the tests. This reject rate, which is a measure of the tested chip quality, contributes to the field returns. It is, however, difficult to determine the tested chip quality from the field return data which may also include rejects due to handling damages, infant mortality, etc. Also, a large number of chips must be in use in the field before an adequate amount of field return data can be obtained. This paper gives a method …

A Graph Model For Pattern-Sensitive Faults In Random Access Memories, Sharad C. Seth, K. Narayanaswamy

School of Computing: Faculty Publications

This correspondence generalizes Hayes' recent ideas for generating an optimal transition write sequence which forms the "backbone" of his algorithm for testing semiconductor RAM'S for pattern-sensitive faults. The generalization, presented in graph theoretic terms, involves two sequential steps. The first step results in assigning of a "color" to each memory cell. In the second step, each color is defined as a distinct sequence of bits representing the sequence of states assumed by the correspondingly colored cell. The constraints imposed at each step lead to interesting and general problems in graph theory: the standard graph coloring problem in the first step, …

Lsi Product Quality And Fault Coverage, Vishwani D. Agrawal, Sharad C. Seth, Prathima Agrawal

School of Computing: Conference and Workshop Papers

At present, the relationship between fault coverage of LSl circuit tests and the tested product quality is not satisfactorily understood. Reported work on integrated circuits predicts, for an acceptable field reject rate, a fault coverage that is too high (99 percent or higher). This fault coverage is difficult to achieve for LSl circuits. This paper proposes a model of fault distribution for a chip. The number of faults on a defective chip is assumed to have a Poisson density for which the average value is determined through experiment on actual chips. The procedure, which relates the model to the chip …

A Simulation Model For Assessing Alternate Strategies For Beef Production With Land, Energy And Economic Constraints, Otto J. Loewer, E. M. Smith, G. Benock, Thomas C. Bridges, Larry G. Wells, Nelson Gay, S. Burgess, L. Springate, David L. Debertin

Biosystems and Agricultural Engineering Faculty Publications

A computer model has been developed to analyze alternate management strategies and energy and economic constraints. Daily production of beef animals and growing crops is simulated in response to prevailing conditions and system interactions using the GASP IV simulation language. Complete inventories of plant dry matter, animal status, production resources and economic net worth are maintained over the simulation period.

On Some Dependencies Between Functional Forms In Functional Programming Systems, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

In the present paper, some dependencies between functional forms in functional programming systems are demonstrated. It is shown that any functional form can be expressed by using only the forms composition, condition and construction.

Dialectical Thermodynamics, Martin Zwick

Complex Systems Faculty Publications and Presentations

A lugubrious, though highly abstract, proposition about sociocultural systems is suggested by a union of dialectical and thermodynamic concepts: systems are invariably flawed, not only because of poor --or absence of -design, or ill will, but because the "closedness" of a system necessarily wars on its "openness," and because the actualization of the organizing principle upon which a system is based brings with it the development of its "shadow," its negation. Reconciliation of these contradictions is not assured.

Overview Of The Blue Chip Computer, Lawrence Snyder

Department of Computer Science Technical Reports

No abstract provided.

Vlsi Algorithms For Relational Database Operations, Ching C. Hsiao, Lawrence Snyder

Department of Computer Science Technical Reports

No abstract provided.

Processor Displacement: An Area-Time Trade-Off Method For Vlsi Design, David M. Deruyck, Lawrence Snyder, John D. Unruh

Department of Computer Science Technical Reports

No abstract provided.