Digital Commons Network^™

Embedding Meshes On The Star Graph, Sanjay Ranka, Jhy-Chun Wang, Nangkang Yeh

Electrical Engineering and Computer Science - Technical Reports

We develop algorithms for mapping n-dimensional meshes on a star graph of degree n with expansion 1 and dilation 3. We show that an n degree star graph can efficiently simulate an n-dimensional mesh.

An Efficient Implementation Of Logical Design For Relational Databases, Shakeel Ishaque

Masters Theses

This work presents efficient methodology for the design of relational databases and an implementation of a design tool. A set of algorithms and supporting theory are discussed. Improvements are made on existing decomposition approaches.

The Dependency Preserving Normal Fom (DPNF), which is stronger than 3NF, is presented. It guarantees a decomposition with lossless join property and at the same time preserves all of the functional dependencies.

An algorithm to obtain DPNF decomposition is presented. The algorithm computes DPNF decomposition in polynomial time. It converts supplied functional dependencies to annular cover and uses reduced annular cover to compute closures and decomposition. …

A Generalized Data Distribution Model For Distributed Relational Databases, Patrick D. Yurk

Masters Theses

This thesis presents a generalized model for the allocation of data in a distributed relational database. The model is applicable to a network of computers where there are different retrieval and update costs at the various sites, and different communication costs between sites.

The method used in this model is based upon clustering of similar computers within the network. Clusters are derived from grouping together sites with similar update, retrieval and communication costs. Data is then allocated to a cluster based on actual communication and processing costs.

The data distribution method between clusters uses a technique where the benefit of …

Expert System For Interpreting An Organizational Climate Survey Supporting Guided Development, Thabet Birro

Theses and Dissertations

This project has lead to the development of a prototype, diagnostic, rule-based expert system to analyze data gathered with an organizational climate survey conducted in high technology firms. The development process followed an investigative look at the field of expert systems. The project was implemented using Level5 shell (by Level 5 research Inc.) in PC/MS-DOS environment.

Multiple Network Embeddings Into Hypercubes, Ajay K. Gupta, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

An O(H^6) Quintic Spline Collocation Method For Second Order Two-Point Boundary Value Problems, M. Irodotou-Ellina, Elias N. Houstis, S. B. Kim

Department of Computer Science Technical Reports

No abstract provided.

Algebraic And Numerical Techniques For Offsets And Blends, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

A Comparison Of Consistency Control Protocols, Michael Goldweber, Donald B. Johnson, Larry Raab

Computer Science Technical Reports

In this paper we analyze three protocols for maintaining the mutual consistency of replicated objects in a distributed computing environment and compare their performance with that of an oracle protocol whose performance is optimal. We examine these protocols, two dynamic protocols and the majority consensus protocol, via simulations using two measures of availability. The analysis shows that the dynamic protocols, under realistic assumptions, do not perform significantly better than the static voting scheme. Finally we demonstrate that none of these approaches perform as well as our oracle protocol which is shown to be an upper bound on availability.

A Paradigm For Concurrency Control In Heterogeneous Distributed Database Systems, Weimin Du, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Efficient Implementation Of Modularity In Raid, Charles Koelbel, Fady Lamaa, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.

Communication In The Raid Distributed Database System, Bharat Bhargava, Enrique Mafla, John Riedl

Department of Computer Science Technical Reports

No abstract provided.

Communication-Based Recovery In Replicated Databases, Bharat Bhargava, Shirley Browne

Department of Computer Science Technical Reports

No abstract provided.

Parallel Rectilinear Shortest Paths With Rectangular Obstacles, Mikhail J. Atallah, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.

Parallel Asynchronous Connected Components In A Mesh, Susanne E. Hambrusch, Michael Luby

Department of Computer Science Technical Reports

No abstract provided.

Analysis Of A Parallel Mergesort, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

The paper describes a performance model of a fine-grained, parallel mergesort which sorts N elements in 0(N) time using 0(logN) processors. The model predicts both the communication time involved in merging the elements and the decomposition time required to activate and terminate the binary tree of processes. The parallel algorithm is written in Joyce and runs on an Encore Multimax.

Term Rewriting With Conditionals And Priority Orderings, Chilukuri K. Mohan

Electrical Engineering and Computer Science - Technical Reports

Conditional rewriting and priority rewriting are two recent generalizations of term rewriting systems. In the former, each rewrite rule is accompanied by an antecedent which must be shown to hold before rewriting can occur. In the latter, rewrite rules can be used only in a particular order. We compare these formalisms: neither formalism encompasses the other in a practical sense, but we give restrictions under which priority and conditional rewriting can be equivalent. We combine the two operational mechanisms, obtaining a natural and expressive formalism called Priority Conditional Rewriting Systems (PCRS). PCRS can be used to “fully-define” data type specifications …

A 15-Valued Algorithm For Test Pattern Generation, Akhtar Uz Zaman, M. Ali, Carlos R.P. Hartmann

Electrical Engineering and Computer Science - Technical Reports

In this report we present a new algorithm for detecting single stuck-at faults in combinational circuits. This algorithm is based on a 15-valued system and introduces several new concepts to make test generation more efficient. This 15-valued system allows us to impose all the constraints that must be satisfied in order to sensitize a single path. Consequently all deterministic implications are fully considered prior to the enumeration process. The resulting ability to identify inconsistencies prior to enumeration improves the possibility of quicker identification of redundant faults. Instead of sensitizing a single gate at a time, we sensitize subpaths by sensitizing …

Software Reliability Models, Syed Afzal Hossain

Mathematics & Statistics Theses & Dissertations

The problem considered here is the building of Non-homogeneous Poisson Process (NHPP) model. Currently existing popular NHPP process models like Goel-Okumoto (G-O) and Yamada et al models suffer from the drawback that the probability density function of the inter-failure times is an improper density function. This is because the event no failure in (0, oo] is allowed in these models. In real life situations we cannot draw sample(s) from such a population and also none of the moments of inter-failure times exist. Therefore, these models are unsuitable for modelling real software error data. On the other hand if the density …

On The Unique Tree Representation Of Graphs, Beverly Jamison

Computer Science Theses & Dissertations

This dissertation investigates classes of graphs which admit tree representations unique up to isomorphism. The definitions of these classes are based on local properties of P₄'s, A template structure theorem is given which illustrates the nature of the local properties. The template theorem is instantiated for three different classes of graphs. Properties specific to each of the classes are used to produce a tree representation which can be used for graph computations, such as efficient resolution of graph isomorphism. Linear time algorithms for the recognition of three classes of graphs and for the construction of their tree representations …

Center For Computer And Information Sciences Interim Application Package 1989, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.

Parity Retransmission Hybrid Arq Using Rate 1/2 Convolutional Codes On A Nonstationary Channel, L. R. Lugand, D. J. Costello, Jr., Robert H. Deng

Research Collection School Of Computing and Information Systems

A parity retransmission hybrid automatic repeat request (ARQ) scheme is proposed which uses rate 1/2 convolutional codes and Viterbi decoding. A protocol is described which is capable of achieving higher throughputs than previously proposed parity retransmission schemes. The performance analysis is based on a two-state Markov model of a nonstationary channel. This model constitutes a first approximation to a nonstationary channel. The two-state channel model is used to analyze the throughput and undetected error probability of the protocol presented when the receiver has both an infinite and a finite buffer size. It is shown that the throughput improves as the …

Performability Evaluation Of Gracefully Degradable Systems, Christoph W. Lindemann

Department of Computer Science Technical Reports

No abstract provided.

Adaptable Recovery Using Dynamic Quorum Assignments, Bharat Bhargava, Shirley Browne

Department of Computer Science Technical Reports

No abstract provided.

Simulated Annealing On Np-Complete Problems, Russell W. Howell

ACMS Conference Proceedings 1989

The Random House Dictionary defines anneal as " ... to free (glass, metals, etc.) from internal stress by heating and gradually cooling." In the physical world, impurities are annealed out of a substance by heating it to a high temperature. As it is cooled, its molecular structure gradually settles into a stable "low-energy" configuration. It is important to cool the substance slowly, especially at lower temperatures, so that impurities do not get "frozen" into place. With careful cooling, a low-energy state can eventually be reached. This state may not be the one with the lowest potential energy, where the spins …

The Mathematical Intelligencer, Dmitrii Egorov: Mathematics And Theology In Russia, Charles E. Ford

ACMS Conference Proceedings 1989

This paper tells the story of Russian mathematician Dmitri Egorov, recounting his faith and contributions to the field of mathematics.

A Course On Mathematics And The Christian Faith, W. David Laverell, Carl J. Sinke

ACMS Conference Proceedings 1989

The January interim term at Calvin College provides an opportunity for developing and teaching courses outside a normal major program. As a result faculty members are frequently given the interim off to provide time for research and development of new courses. In 1987 we were given such a leave in order to pursue the questions of the relationship between mathematics and the Christian Faith. One result was our presentation at the 1987 Association of Christians in the Mathematical Sciences conference. Immediately thereafter we began to develop a specific interim course based on our studies. We offered the course during the …

The Bisexual Galton-Watson Branching Process, David M. Hull

ACMS Conference Proceedings 1989

I would like to present the bisexual Galton-Watson branching process. The word "bisexual" indicates that we will be considering a population of two sexes--which will be designated as the usual male and female. Here is a brief overview of what I would like to cover.

1. The bisexual process motivated: why is it needed?
2. The standard Galton-Watson branching process.
3. The state of affairs regarding two-sex models.
4. The nuts and bolts of the bisexual Galton-Watson branching process (parameters defined and how it works).
5. A review of published bisexual results to date.
6. What is to come?

Newton And Saccheri: Case Studies In The Interplay Of Mathematics And Religion, Tommy Leavelle

ACMS Conference Proceedings 1989

In the course of this paper I will try to present to you the basic facts and some of the subsequent assessments of the life and work of two mathematicians for whom the interplay of mathematics and religion was influential: Issac Newton and Girolamo Saccheri.

Augustine's Mathematical Realism, Paul J. Zwier

ACMS Conference Proceedings 1989

After a review of Philip Kitcher's argument against Mathematical Realism, this paper presents the case for Mathematical Realism by looking at the life and writings of Saint Augustine.

Beauty In Mathematics: Some Theological Implications, David L. Neuhouser

ACMS Conference Proceedings 1989

It may come as a surprise to some that science or mathematics could be considered beautiful, but many prominent sciences and mathematicians from around the world have made such claims. Furthermore, the beauty of mathematics and order of the universe inspired some of the greatest developments in science and mathematics. This paper examines the beauty of mathematics and what scientists and other individuals have said about the subject.