Digital Commons Network^™

An Optimal Design Of Relational Data Model, Pissamai Amatayakul

Masters Theses

The objective of this study was to propose a design methodology to support a designed in mapping a conceptual model to a logical model. The system was created as a semiinteractive software to produce an optimal relational data model for a given database. The software was developed by combining a well known normalization method from a theory of relational data model which was presented by Codd and the ideas of new normal form which were presented recently by many researchers in the field of database design. The complete description of data objects and their associations are initially defined as a …

A Uniform System For Data Base Directories, Karl Chang

Masters Theses

The objective of this study is to provide an efficient uniform system for data base directories, so that every file in the data base will have the same type of efficient directory. Data base directories will then be uniformly generated, updated and maintained.

The uniform system which is developed here can handle not only discrete attributes, but also range attributes. For the range attributes, it provides the uniform ranges (i.e., a set of ranges such that the records are distributed uniformly between ranges.)

In this thesis, the design and implementation of the hybrid B-plus tree and inverted files which is …

Minimizing Contact Points And Using Overlap On Two Layers, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

A Technique To Reduce Procedure Call Overhead In Block Structured Languages, Thomas P. Murtagh

Department of Computer Science Technical Reports

No abstract provided.

Software Parts For Elliptic Ppe Software, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Algorithm Gencol: Collocation On General Domains With Bicubic Hermite Polynomials, Elias N. Houstis, W. F. Mitchell, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Collocation Software For Second Order Elliptic Partial Differential Equations, Elias N. Houstis, W. F. Mitchell, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Optimal Routing In The Cube-Connected Cycles Interconnection Network, Daniel A. Reed

Department of Computer Science Technical Reports

No abstract provided.

Orthodontic Information Systems : A Developmental Study, Gary D. Sheldon

Loma Linda University Electronic Theses, Dissertations & Projects

The intent of this study was to design and implement a computer-based orthodontic system providing an integrated information environment throughout the entire patient treatment process.

Total system integration was achieved by restructuring the entire information gathering process. A complete, evaluation of patient diagnosis and treatment evaluation procedures established five major information categories and a critical information list for proper patient management. Information organization was outlined to provide a logical progression in the information gathering process and patient chart forms were designed to implement this. Defining the computer system's performance identified three functions as follows: 1) entry and editing of individual …

Using Mathematical Concepts To Illustrate Scriptural And Spiritual Ideas, Robert Brabenec

ACMS Conference Proceedings 1983

Christian mathematics faculty and students respond in differing ways to this idea of applying mathematics to Scripture, and vice-versa. Mathematics is man-made, while Scripture is inspired by God, so they should be disjoint entities. However, it is well known that the Scripture used analogies of familiar human objects and ideas in order to explain spiritual ideas. This paper discusses various mathematical concepts and how they illustrate Scriptural and spiritual ideas.

The Activitiy And Application Of Mathematics, R. S. D. Thomas

ACMS Conference Proceedings 1983

There are four so-called philosophies of mathematics that I regard as totally discredited, formalism, intuitionism, logicism, and Platonism. It is a common feature of the ism philosophies of mathematics that they do not take the application of mathematics very seriously. This paper examines a view of mathematics that takes applications seriously.

Arrogance And Humility In The Philosophy Of Mathematics, James Murdock

ACMS Conference Proceedings 1983

This paper explores the philosophical, sociological, and theological questions related to the field of mathematics and whether or not it is ethical to pursue when its discoveries are used for evil.

An Outline Of A Complementarist Philosophy Of The Sciences, With A Special Reference To Mathematics, Willem Kuyk

ACMS Conference Proceedings 1983

No abstract provided.

A Neuropsychodynamical Theory Of Mathematics Learning, Willem Kuyk

ACMS Conference Proceedings 1983

No abstract provided.

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