Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 56431 - 56460 of 57957

Full-Text Articles in Physical Sciences and Mathematics

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

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 Jul 1989

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 Jul 1989

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 Jul 1989

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 Jul 1989

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 Jul 1989

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 Jul 1989

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 Jul 1989

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 Jul 1989

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 …


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

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

College of Engineering and Computing Course Catalogs

No abstract provided.


Software Reliability Models, Syed Afzal Hossain Jul 1989

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 Jul 1989

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 P4'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 …


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

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 Jun 1989

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 Jun 1989

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

Department of Computer Science Technical Reports

No abstract provided.


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

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.


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

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 Mathematical Intelligencer, Dmitrii Egorov: Mathematics And Theology In Russia, Charles E. Ford Jun 1989

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.


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

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 Jun 1989

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.


Agustine's Mathematical Realism, Paul J. Zwier Jun 1989

Agustine'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.


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

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 …


Strokes For Representing Univariate Vector Field Maps, David Fowler, Colin Ware Jun 1989

Strokes For Representing Univariate Vector Field Maps, David Fowler, Colin Ware

Center for Coastal and Ocean Mapping

Particle systems make an excellent tool for creating tracks (which we call strokes) in vector fields. The question addressed in this paper is how such tracks should be made to vary in size and colour in order to reveal properties such as local direction and strength of the field. We find that for strokes that vary from large to small, direction is indicated by the large end. We also find that for strokes that vary in colour, the colour of the background is the most important determinant of perceived direction.


Escim: A System For The Investigation Of Meaningful Motion, Siew Hong Yang, Colin Ware Jun 1989

Escim: A System For The Investigation Of Meaningful Motion, Siew Hong Yang, Colin Ware

Center for Coastal and Ocean Mapping

A language is described whose purpose is the investigation of meaningful motion using Stimulus Response animation techniques. The language is capable of adjusting the shape, size and velocity of an actor in real-time computer animation. Some results are presented showing how it is possible to generate such behaviours as chasing, avoidance and hitting using this animation technique. A set of primitives are presented which we find invaluable in the control of size, stretch and velocity parameters when attempting to produce fluid and meaningful interactions.


Introduction (1989), Gene B. Chase Jun 1989

Introduction (1989), Gene B. Chase

ACMS Conference Proceedings 1989

A Seventh Conference on Mathematics from a Christian Perspective

Gene B. Chase, Editor


Schedule (1989), Association Of Christians In The Mathematical Sciences Jun 1989

Schedule (1989), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 1989

A Seventh Conference on Mathematics from a Christian Perspective

Gene B. Chase, Editor


The Implementation Of A Generalized Database Directory, Claudia Helms-Vaccaro Jun 1989

The Implementation Of A Generalized Database Directory, Claudia Helms-Vaccaro

Masters Theses

This paper presents the use of an index made up of a single B+ tree connected at its leaf nodes to a lower set of B+ trees--a multitree. It may be utilized to index dense or non-dense attributes of a file. An extra benefit of this structure is the ability to store a secondary attribute value for use when searching the index, often decreasing accesses and time required to complete the search.

Improved efficiency over current indices, such as conventional B+ trees or inverted files, is evaluated.


Fault Tolerance In A Very Large Database System: A Strawman Analysis, Amit P. Sheth Jun 1989

Fault Tolerance In A Very Large Database System: A Strawman Analysis, Amit P. Sheth

Kno.e.sis Publications

A simple model is used to study the effect of fault-tolerance techniques and system design on system availability. A generic multiprocessor architecture is used that can be configured in different ways to study the effect of system architectures. Important parameters studied are different system architectures and hardware fault-tolerance techniques, mean time to failure of basic components, database size and distribution, interconnect capacity, etc. Quantitative analysis compares the relative effect of different parameter values. Results show that the effect of different parameter values on system availability can be very significant. System architecture, use of hardware fault tolerance (particularly mirroring), and data …


Back Propagation With Integer Arithmetic, Takayuki Dan Kimura Jun 1989

Back Propagation With Integer Arithmetic, Takayuki Dan Kimura

All Computer Science and Engineering Research

The present work investigates the significance of arithmetic precision in neural network simulation. Noting that a biological brain consists of a large number of cells of low precision, we try to answer the question: With a fixed size of memory and CPU cycles available for simulation, does a larger sized net with less precision perform better than smaller sized one with higher precision? We evaluate the merits and demerits of using low precision integer arithmetic in simulating backpropagation networks. Two identical backpropagation simulators, ibp and fbp, were constructed on Mac II, ibp with 16 bits integer representations of network parameters …


Displaying Correlations Using Position, Motion, Point Size Or Point Colour, Serge Limoges, Colin Ware, William Knight Jun 1989

Displaying Correlations Using Position, Motion, Point Size Or Point Colour, Serge Limoges, Colin Ware, William Knight

Center for Coastal and Ocean Mapping

An empirical study is presented which explores the use of motion, point size and grey scales for the display of statistical data; specifically, the perception of correlations between variables. The task is to measure the subject's ability to perceive differences between high correlation and low correlation for a two dimensional plot presented in different ways. One variable is always mapped to position with respect to the x axis while the other is mapped to one of six different display parameters depending on experimental condition; namely: position with respect to the y axis, frequency, phase, and amplitude of oscillation, greyscale value …