Computer Sciences Commons^™

Teaching Mathematics Distinctively, Paul J. Zwier

ACMS Conference Proceedings 1981

By examining previously used education models, Paul Zwier how he developed his current methods of teaching mathematically distinctively.

Probabilistic Ways Of Thinking, Garnet Hauger

ACMS Conference Proceedings 1981

Events of the tiniest probabilities occur every day, and yet we tend to think of these events as unusual and even miraculous. So what should be a Christian's response to such events? Beginning with some simple concepts of probability, this paper examines the role that chance plays in our lives.

An Integration Of Integrations Of Christianity And Mathematics—A Response To Harold Heie, Gene B. Chase

ACMS Conference Proceedings 1981

There are three general approaches taken to integrate Christianity and Mathematics: the applicational, the incarnation, and the philosophical. This paper discusses these views and responds to the approaches of Harold Heie.

Some Contributions Of Stanley Jaki To An Understanding Of Mathematics, Paul Devries

ACMS Conference Proceedings 1981

This paper comments on passages from the books by Stanley L. Jaki, Science and Creation, The Relevance of Physics, and The Road to Science and The Ways to God.

Random Variables And A Sovereign God, Lloyd Montzingo

ACMS Conference Proceedings 1981

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.

The Development Of Algebraic Structures During The Nineteenth Century, Richard Stout

ACMS Conference Proceedings 1981

I remember entering the faculty lounge one day while I was in graduate school and hearing a logician chiding some of the algebraists in the room. He said, "Don't you fellows ever get tired of just plus and times?" His remark, said in jest, had more to it than he may have realized. The fact that there is structure to algebra, represented by plus and times, was a vital discovery in the nineteenth century. It would lead algebra away from a reliance on numbers to a much more formal approach, one in which many different types of algebraic structures could …

Mathematics As Rhyme, Vern Poythress

ACMS Conference Proceedings 1981

Using the analogy between the universe and a choral poem, one may view mathematics as the “rhyme” of the universe. In that perspective new light is thrown on the unique subject matter of mathematics, the a priori character of its truths, and the relation of mathematics to other areas of knowledge. A route is thereby opened for richer use of creativity in mathematics.

Communicating Spiritual Insights In Mathematics Classes, Verbal Snook

ACMS Conference Proceedings 1981

No abstract provided.

Science As Allegory, Vern Sheridan Poythress

ACMS Conference Proceedings 1981

No abstract provided.

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.

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.