Digital Commons Network^™

Microcomputers In Mathematics And Science Courses, Carlos Pereira

ACMS Conference Proceedings 1981

No abstract provided.

Introduction To Computer Science, Millard B. Niver

ACMS Conference Proceedings 1981

No abstract provided.

Mathematics: Freedom Within Bounds, Harold Heie

ACMS Conference Proceedings 1981

No abstract provided.

A Reaction To The Poythress Paper, Paul J. Zwier

ACMS Conference Proceedings 1981

This paper reacts to the metaphor of Vern Sheridan Poythress’s papers, Science as Allegory, exploring what makes a good metaphor and the quality of argument it produces.

Science As Allegory, Vern Poythress

ACMS Conference Proceedings 1981

The universe is God’s choral poem, and science is a system of allegories within it. That is the thesis that I propose to expound and defend. Yet it is not a “thesis” at all, if the word “thesis” commits me to a certain kind of strict logical defense. I am not putting forward my thesis that science is allegory as the endpoint of a deductive or inductive argument. Rather, it is a springboard for a program of exploration and reflection that turns upside-down some conventional ways of thinking about science.

Introduction (1981), Robert Brabenec

ACMS Conference Proceedings 1981

A Third Conference on Mathematics from a Christian Perspective

Table Of Contents (1981), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1981

No abstract provided.

On App Decoding, Carlos R.P. Hartmann, Luther D. Rudolph, Kishan Mehrotra, Guy J. Snedeker

Electrical Engineering and Computer Science - Technical Reports

In this paper we show that APP decoding for a linear code C is optimum not for C, but for a minimum-distance-2 code which contains C as a subcode when the codewords of are transmitted with equal probability. However, APP decoding is shown to be a symptotically optimum for C for high SNR when C is a binary one-step orthogonolizable code with equiprobable codewords transmitted over the AWGN channel.

Progress Report Operational Analysis Of Queueing Phenomena, Peter J. Denning, Jeffrey P. Buzen

Department of Computer Science Technical Reports

No abstract provided.

Performance Evaluation: Experimental Computer Science At Its Best, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.

Performance Analysis Of 13 Methods To Solve The Galerkin Method Equations, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

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.

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.

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.

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 …

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.

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 …

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.