Digital Commons Network^™

One Possible Outline For A First Undergraduate Course In Philosophy Of Mathematics, Harold Heie

ACMS Conference Proceedings 1983

No abstract provided.

The Role Of Creativity In Mathematics, John M. Dubbey

ACMS Conference Proceedings 1983

No abstract provided.

Mathematics: The Loss Of Certainty, Calvin Jongsma

ACMS Conference Proceedings 1983

Morris Kline was a contentious mathematician and author, documenting (as he saw it) both the deficiencies of mid-twentieth-century reformist trends in mathematics education and formalist views of the foundations (and practice) of mathematics. This brief introduction to a discussion of Kline's 1980 book and its mixed reception by the mathematics community provides a context for assessing his ideas as part of his overall views on the nature of mathematics.

A Comparative Study Of Christian Mathematical Realism And Its Humanistic Alternatives, Paul Zwier

ACMS Conference Proceedings 1983

This paper explores what sort of stance a Christian should have on important mathematical questions such as realism.

Introduction (1983), Robert Brabenec

ACMS Conference Proceedings 1983

No abstract provided.

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

ACMS Conference Proceedings 1983

A Fourth Conference on Mathematics from a Christian Perspective

Edited by Robert L. Brabenec, Wheaton College

Software Maintenance And Comprehension: Some Empirical Results, C. D. Burch, Tze-Jie Yu, Herbert E. Dunsmore

Department of Computer Science Technical Reports

No abstract provided.

An Interval Newton Method, E R. Hansen, R I. Greenberg

Computer Science: Faculty Publications and Other Works

We introduce an interval Newton method for bounding solutions of systems of nonlinear equations. It entails three subalgorithms. The first is a Gauss-Seidel-type step. The second is a real (noninterval) Newton iteration. The third solves the linearized equations by elimination. We explain why each subalgorithm is desirable and how they fit together to provide solutions in as little as one-third or one-quarter the time required by Krawczyk's method [7] in our implementations.

A Learning Strategy For A Class Of Probabilistic Automata, Lyle Amos Reibling

Masters Theses

A learning strategy is developed for a class of probabilistic automata. Given an input sequence to the probabilistic automaton* and the output sequence arising from the probabilistic transition function of the automaton* the learning strategy will conjecture the probabilistic automata which cover the input - output sequence observed and will infer the probabilistic transition structure of the conjectured automata.

A Simulation Study Of Multimicrocomputer Networks, Daniel A. Reed

Department of Computer Science Technical Reports

No abstract provided.

Candide's Practical Principles Of Experimental Pattern Recognition, George Nagy

School of Computing: Faculty Publications

This correspondence calls attention to several frequently used assumptions and techniques culled from the pattern recognition literature.

On Bounding The Number Of Contact Points In Channel Routing, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

Stork: An Experimental Migrating File System For Computer Networks, Jehan-Francois Paris, Walter F. Tichy

Department of Computer Science Technical Reports

No abstract provided.

Reduced Set Of Phages For Typing Salmonellae, Melvin Gershman, George Markowsky

Computer Science Faculty Research & Creative Works

A set composed of 27 phages is described for differentiating Salmonella spp. representative of groups A, B, C₁, C₂, D₁, D₂, E₁, E₂, E₃, E₄, G₁, K, and N. All of the 1,245 cultures used in this effort were typable and were differentiated on the basis of the 420 phage patterns observed. All results were reproducible. Characteristic phage patterns were produced by a variety of Salmonella serovars isolated from campus incidents and a number of hospital, family, restaurant, and processing plant outbreaks …

A Comparative Study Of Christian Mathematical Realism And Its Humanistic Alternatives, Paul Zwier

ACMS Journal 2004

This paper addresses the growing popularity of views of mathematics that see it primarily as a social entity and that reject Platonism. It contrasts two Christian realist philosophies - those of Alvin Plantinga and Vernon Poythress - with the secular perspective of Philip Davis and Reuben Hersch. It affirms the insight of Davis and Hersch that mathematics is indeed a social entity. However, it argues that belief in God enables a fuller understanding of mathematics - one that accounts for the apparent transcendence of mathematics and its power to explain concepts in the physical world.

On Determinism Versus Non-Determinism And Related Problems, Wolfgang J. Paul, Nicholas Pippenger, Endre Szemeredi, William T. Trotter

All HMC Faculty Publications and Research

We show that, for multi-tape Turing machines, non-deterministic linear time is more deterministic Turing machines (that receive their input on their work tape) require time Q(n2) to powerful than deterministic linear time. We also recognize non-palindromes of length n (it is easy to discuss the prospects for extending this result to see that time O(n log n) is. sufficient for a more general Turing machines. non-deterministic machine). 1. Introduction

An Analytical Model For Evaluating Database Update Schemes, Kathryn C. Kinsley

Retrospective Theses and Dissertations

A methodology is presented for evaluating the performance of database update schemes. The methodology uses the M/Hr/1 queueing model as a basis for this analysis and makes use of the history of how data is used in the database. Parameters have been introduced which can be set based on the characteristics of a specific system. These include update to retrieval ratio, average file size, overhead, block size and the expected number of items in the database. The analysis is specifically directed toward the support of derived data within the relational model. Three support methods are analyzed. These are first examined …

Computer Information Systems Bachelor's Degree Programs To Advance Your Career 1983-1984, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Computer Engineering Bachelor's Degree Programs To Advance Your Career 1983-1984, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Engineering Or Computer Management Master's Degree Programs To Advance Your Career 1983-1984, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Computer Science Master's Degree Programs To Advance Your Career 1983-1984, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Incremental Analysis Of Programs, Vida Ghodssi

Retrospective Theses and Dissertations

Algorithms used to determine the control and data flow properties of computer programs are generally designed for one-time analysis of an entire new input. Application of such algorithms when the input is only slightly modified results in an inefficient system. In this theses a set of incremental update algorithms are presented for data flow analysis. These algorithms update the solution from a previous analysis to reflect changes in the program. Thus, extensive reanalysis to reflect changes in the program. Thus, extensive reanalysis of programs after each program modification can be avoided. The incremental update algorithms presented for global flow analysis …

Coarse Topologies In Nonstandard Extensions Via Separative Ultrafilters, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

Topological Extensions And Subspaces Of Ηα-Sets, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

The η_x-sets of Hausdorff have large compactifications (of cardinality ≽ exp(α); and of cardinality ≽ exp(exp(2^<α)) in the Stone-Čech case). If Q_α denotes the unique (when it exists) η_α -set of cardinality α, then Q_α can be decomposed (= partitioned) into homeomorphs of any prescribed nonempty subspace; moreover the subspaces of Q_α can be characterized as those which arc regular T₁, of cardinality and weight ≼ α, whose topologies are closed under < α intersections.

Operational State Sequence Analysis, Jeffrey A. Brumfield, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.

Modeling Multimicrocomputer Networks, Daniel A. Reed

Department of Computer Science Technical Reports

No abstract provided.

Interface Issues In A Software Parts Technology, John R. Rice, Herbert D. Schwetman

Department of Computer Science Technical Reports

No abstract provided.

Dynamic Computational Geometry, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

The String-To-String Correction Problem With Block Moves, Walter F. Tichy

Department of Computer Science Technical Reports

No abstract provided.

Transparent Integrated Local And Distributed Environment (Tilde) Project Overview, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.