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 55501 - 55530 of 56656

Full-Text Articles in Physical Sciences and Mathematics

Independent Checkpointing And Concurrent Rollback For Recovery In Distributed System—An Optimistic Approach, Bharat Bhargava, Shy-Renn Lian Aug 1987

Independent Checkpointing And Concurrent Rollback For Recovery In Distributed System—An Optimistic Approach, Bharat Bhargava, Shy-Renn Lian

Department of Computer Science Technical Reports

No abstract provided.


Medial Axis Transform Using Ridge Following, Richard Mark Volkmann, Daniel C. St. Clair Aug 1987

Medial Axis Transform Using Ridge Following, Richard Mark Volkmann, Daniel C. St. Clair

Computer Science Technical Reports

The intent of this investigation has been to find a robust algorithm for generation of the medial axis transform (MAT). The MAT is an invertible, object centered, shape representation defined as the collection of the centers of disks contained in the shape but not in any other such disk. Its uses include feature extraction, shape smoothing, and data compression. MAT generating algorithms include brushfire, Voronoi diagrams, and ridge following. An improved implementation of the ridge following algorithm is given. Orders of the MAT generating algorithms are compared. The effects of the number of edges in the polygonal approximation, shape area, …


Intensional Reasoning About Knowledge, Oliver B. Popov, Arlan R. Dekock Aug 1987

Intensional Reasoning About Knowledge, Oliver B. Popov, Arlan R. Dekock

Computer Science Technical Reports

As demands and ambitions increase in Artificial Intelligence, the need for formal systems that facilitate a study and a simulation of a machine cognition has become an inevitability. This paper explores and developes the foundations of a formal system for propositional reasoning about knowledge. The semantics of every meaningful expression in the system is fully determined by its intension, the set of complexes in which the expression is confirmed. The knowledge system is based on three zeroth-order theories of epistemic reasoning for consciousness, knowledge and entailed knowledge. The results presented in the paper determine the soundness and the completeness of …


Power Series Solution To A Simple Pendulum With Oscillating Support, Mohammad Dadfar, James Geer Aug 1987

Power Series Solution To A Simple Pendulum With Oscillating Support, Mohammad Dadfar, James Geer

Computer Science Faculty Publications

The problem of determining some of the effects of a small forcing term on a regular perturbation solution to a nonlinear oscillation problem is studied via a simple example. In particular, we investigate the periodic solution of a simple pendulum with an oscillating support. A power series solution is constructed in terms of c-=( )2 L,where w0 and w are the natural and driving frequencies respectively, a is the amplitude of the support oscillation, and L is the length of the pendulum. These solutions are analyzed for three cases: above resonance (w > wo), below resonance (w < wo), and at resonance (w = wo). In each case, the approximate location of the nearest singularities which limit the convergence of the power series are obtained by using Pad6 approximants. Using this information, a new expansion parameter 6 is introduced, where the radius of convergence of the transformed series is greater than the original series. The effects of primary and higher order resonances on the convergence of the series solution is noted and discussed.


A Study Of Automated Reasoning In A Brain Tumor Diagnosis Expert System, Aung Zaw Maung Aug 1987

A Study Of Automated Reasoning In A Brain Tumor Diagnosis Expert System, Aung Zaw Maung

Masters Theses

The objective of this study is to survey various theorem-proving methods and to evaluate how these methods can be applied as inference engines in a brain tumor diagnosis expert system.

Various applications of automated reasoning based on the resolution principle are discussed. Knowledge representations and inference mechanisms used in expert systems are also surveyed.

An actual application of this method for a medical diagnosis problem is implemented and explained, and the limitations of this approach and possible future enhancements are discussed.


A Characterization Of Digital Search Trees From The Average Complexity Viewpoint, Wojciech Szpankowski Jul 1987

A Characterization Of Digital Search Trees From The Average Complexity Viewpoint, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.


Protran Ii: Preliminary Report, H. S. Mcfaddin, John R. Rice Jul 1987

Protran Ii: Preliminary Report, H. S. Mcfaddin, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Convex Hull Of Objects Bounded By Algebraic Curves, Chanderjit Bajaj, Myung-Soo Kim Jul 1987

Convex Hull Of Objects Bounded By Algebraic Curves, Chanderjit Bajaj, Myung-Soo Kim

Department of Computer Science Technical Reports

No abstract provided.


Computing About Physical Objects, Chanderjit Bajaj, Christoph M. Hoffmann, Elias N. Houstis, John T. Korb, John R. Rice Jul 1987

Computing About Physical Objects, Chanderjit Bajaj, Christoph M. Hoffmann, Elias N. Houstis, John T. Korb, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.


Sorting With Efficient Use Of Special-Purpose Sorters, Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju Jul 1987

Sorting With Efficient Use Of Special-Purpose Sorters, Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju

Department of Computer Science Technical Reports

No abstract provided.


Algorithms And Data Structures For An Expanded Family Of Matroid Intersection Problems, Greg N. Frederickson, Mandayam A. Srinivas Jul 1987

Algorithms And Data Structures For An Expanded Family Of Matroid Intersection Problems, Greg N. Frederickson, Mandayam A. Srinivas

Department of Computer Science Technical Reports

No abstract provided.


Theory Of Modules, J. D. Gannon, Richard G. Hamlet, Harlan D. Mills Jul 1987

Theory Of Modules, J. D. Gannon, Richard G. Hamlet, Harlan D. Mills

The Harlan D. Mills Collection

No abstract provided.


Reliability And Throughput Analysis Of A Concatenated Coding System, Robert H. Deng, Daniel J. Costello Jul 1987

Reliability And Throughput Analysis Of A Concatenated Coding System, Robert H. Deng, Daniel J. Costello

Research Collection School Of Computing and Information Systems

The performance of a concatenated coding scheme for error control in ARQ systems is analyzed for both random error and burst-error channels. In particular, the probability of undetected error and the system throughput are calculated. In this scheme, the inner code is used for both error correction and error detection, and the outer code is used for error detection only. Interleaving/deinterleaving of the outer code is assumed. A retransmission is requested if either the inner code or the outer code detects the Presence of errors. Various coding examples are considered. The results show that concatenated coding can provide extremely high …


Can Programmers Reuse Software?, Scott N. Woodfield, David W. Embley, Del T. Scott Jul 1987

Can Programmers Reuse Software?, Scott N. Woodfield, David W. Embley, Del T. Scott

Faculty Publications

An experiment asked programmers untrained in reuse to evaluate component reusability. They did poorly. Are reusability's promises hollow? Or are there some answers?


Matching Multiple Patterns From Right To Left, Samuel W. Bent, M A. Sridhar Jun 1987

Matching Multiple Patterns From Right To Left, Samuel W. Bent, M A. Sridhar

Computer Science Technical Reports

We address the problem of matching multiple pattern strings against a text string. Just as the Aho-Corasick algorithm generalizes the Knuth-Morris-Pratt single-pattern algorithm to handle multiple patterns, we exhibit two generalizations of the Boyer-Moore algorithm to handle multiple patterns. In order to obtain worst-case time bounds better than quadratic, our algorithms remember some of the previous history of the matching.


An Experimental Analysis Of Replicated Copy Control During Site Failure And Recovery, Bharat Bhargava, Paul Noll, Donna Sabo Jun 1987

An Experimental Analysis Of Replicated Copy Control During Site Failure And Recovery, Bharat Bhargava, Paul Noll, Donna Sabo

Department of Computer Science Technical Reports

No abstract provided.


An Expert System Controlling An Adaptable Distributed Data Base System, Bharat Bhargava, John Riedl, Detlef M. Weber Jun 1987

An Expert System Controlling An Adaptable Distributed Data Base System, Bharat Bhargava, John Riedl, Detlef M. Weber

Department of Computer Science Technical Reports

No abstract provided.


Piplined Iterative Methods For Shared Memory Machines, John P. Bonomo, Wayne R. Syksen Jun 1987

Piplined Iterative Methods For Shared Memory Machines, John P. Bonomo, Wayne R. Syksen

Department of Computer Science Technical Reports

No abstract provided.


Concurrent Checkpointing And Recovery In Distributed Systems, Pei-Jyun Leu, Bharat Bhargava Jun 1987

Concurrent Checkpointing And Recovery In Distributed Systems, Pei-Jyun Leu, Bharat Bhargava

Department of Computer Science Technical Reports

No abstract provided.


Domains For Logic Programming, I. Filippenko, F. L. Morris Jun 1987

Domains For Logic Programming, I. Filippenko, F. L. Morris

Electrical Engineering and Computer Science - Technical Reports

We construct Scott domains well suited to use in an abstract implementation of logic programming, and perhaps to the modelling of other first-order data structures. The domain elements, which we call ‘grafts’, are in effect a sort of directed graphs. The approximation order in the domains corresponds to the relation between tuples of terms, “has a substitution instance”; the price to be paid is that one equivalence class of (tuples of) terms under renaming of variables is represented by many grafts. Graft domains come in two flavors—plain and ‘acyclic’—for modelling on an equal footing logic programming without and with the …


Reduced Coproducts Of Compact Hausdorff Spaces, Paul Bankston Jun 1987

Reduced Coproducts Of Compact Hausdorff Spaces, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

By analyzing how one obtains the Stone space of the reduced product of an indexed collection of Boolean algebras from the Stone spaces of those algebras, we derive a topological construction, the "reduced coproduct", which makes sense for indexed collections of arbitrary Tichonov spaces. When the filter in question is an ultrafilter, we show how the "ultracoproduct" can be obtained from the usual topological ultraproduct via a compactification process in the style of Wallman and Frink. We prove theorems dealing with the topological structure of reduced coproducts (especially ultracoproducts) and show in addition how one may use this construction to …


The Evolution Of Text Formatting Languages, Dirk Herr-Hoyman Jun 1987

The Evolution Of Text Formatting Languages, Dirk Herr-Hoyman

Masters Theses

Text, as seen in books and magazines, can take on three forms: string, graphic (two-dimensional), and image (digitized pictures). Text formatting processes text into a representation suitable for printing. Since a printer is really a computer, this representation is machine code for the printer. ASCII is one such code.

Six historically significant text formatting languages are surveyed: Runoff, Troff, TeX, Bravo, Scribe, and Postscript. The emphasis is on the text types available and the code generated. The main evolutionary forces are the changes in printers. Comparisons are made with programming languages.

Each of the six languages has ASCII as its …


Prodb: An Experimental Generalized Database System User's Manual, Guillermo R. Simari Jun 1987

Prodb: An Experimental Generalized Database System User's Manual, Guillermo R. Simari

All Computer Science and Engineering Research

The following notes document in a succinct manner the use of the system PRODB. The system is still evolving and several new features are in the process of being added. PRODB is a prototype system that is being used as an exploration vehicle of the possible extensions to the relational model through logic programming. The system consists of a relational database system having a relational algebra type language as a query language. It is written in Prolog and it extends the capabilities of Prolog predicates with the relational algebra operators for handling the database structure. The database system currently provides …


Riesz Spaces And Their Applications In Economics, Calvin E. Piston May 1987

Riesz Spaces And Their Applications In Economics, Calvin E. Piston

ACMS Conference Proceedings 1987

We will examine an economic model of pure exchange and some results concerning different notions of equilibrium. In particular, we will focus on the role played by the theory of Riesz space.


Logic And Proof For Mathematics: A Twentieth Century Perspective, Calvin Jongsma May 1987

Logic And Proof For Mathematics: A Twentieth Century Perspective, Calvin Jongsma

ACMS Conference Proceedings 1987

This talk reports on the author's experience in teaching college mathematics students the basics of logic and proof in preparation for their transitioning to upper-level proof-based mathematics courses, following that up with a philosophical and historical analysis of mathematicians' attitudes toward such a project going back to nineteenth- and twentieth-century developments in logic and foundations (De Morgan, Boole, Frege, Russell, and Hilbert). The natural deduction approach to logic and inference developed in the mid-twentieth century by Jaskowski and Fitch is recommended as a much better focused approach for learning how to do proofs in mathematics. This idea is systematically developed …


Mathematical Reflections: Standing On The Shoulders Of Giants, Karl J. Smith May 1987

Mathematical Reflections: Standing On The Shoulders Of Giants, Karl J. Smith

ACMS Conference Proceedings 1987

The layperson's response to mathematics is often that of desperation. When we tell people our occupation, do we more often than not hear about their unpleasant experiences with mathematics. They often tell us, "I studied algebra in high school and haven't used it since!" Indeed, that may be true. However, we can reply, "How many times has algebra been used on you?" We are all restricted, and protected, by the formulas of mathematics. In the mysterious metaphors we have agreed to cal mathematics, all creation is involved, from the symbol-happy logician down to the cunning geometers, the bees. When I …


Observations On Mathematics And The Christian Faith, W. David Laverell, Carl J. Sinke May 1987

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

ACMS Conference Proceedings 1987

There is little doubt that mathematicians are becoming more concerned with the foundations on which their discipline rests, the meaning of their work, and the philosophical stance implicit in what they do. This concern is prompted by serious questions which have been raised in recent years, questions dealing with the nature of mathematical truth, the nature of proof, certainty (or lack thereof) in mathematics, and the relationship of mathematics to the physical world. This has been particularly true for those of us involved in teaching since it is apparent that good mathematics education cannot ignore these issures.


Variations On A Theme, Robert Creighton Buck May 1987

Variations On A Theme, Robert Creighton Buck

ACMS Conference Proceedings 1987

An autobiographical narration by Robert Creighton Buck, detailing his experiences in the field of mathematics, and the various questions and themes reoccurring in the mathematical sciences.


Proof And Intution, Michael Detlefsen May 1987

Proof And Intution, Michael Detlefsen

ACMS Conference Proceedings 1987

This paper discusses various perspectives on proof and intuition by examing two epistemic systems, Intuition Intensive and Logic Intensive, and Jules Henri Poincaré's objections to the latter.


Another Look At Pick's Theorem, Dale Varberg May 1987

Another Look At Pick's Theorem, Dale Varberg

ACMS Conference Proceedings 1987

In this paper, the author discusses his experience building a proof for Pick's Theorem and theorem's history.