Physical Sciences and Mathematics Commons^™

Dynamic Computational Geometry, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

A Graph Orientation Problem, 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.

Conversation-Based Mail, Douglas E. Comer, Larry J. Peterson

Department of Computer Science Technical Reports

No abstract provided.

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

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 …

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 …

A Simplified Method To Calculate Failure Times In Fault-Tolerant Systems, Sharad C. Seth, Lester Lipsky

School of Computing: Faculty Publications

A simplified method is presented to calculate moments of failure time and residual lifetime of a fault-tolerant system. The method is based on recent results in queueing theory. Its effectiveness is illustrated by considering a dual repairable system from the literature.

Computer Science Master'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.

Computing As A Part Of A P.H.D Students Education: A Position Paper, Andrew D. Bailey, Rayman D. Meservy

Faculty Publications

The skills and abilities associated with computer literacy are becoming required tools for accounting Ph.D. students. Not only are new doctoral students entering Ph.D. programs with better skills, they are also applying these skills more on a day to day basis. This paper presents a brief discussion of a number of issues associated with computer use and computer literacy in general. The paper also presents several aspects of the Ph.D. program at the University of Minnesota and how computers are affecting the program.

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.

Coarse Topologies In Nonstandard Extensions Via Separative Ultrafilters, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

A Comparison Of Processor Technologies, Eddie R. Wachter

Theses and Dissertations

The purpose of this paper is to present a discussion of the technology implementation and design of four very high performance mainframe computer systems. The systems evaluated are:

Amdahl 580 Series

CDC 170 Series 800

IBM 308x Series

Univac 1100/90 Series

Included in this evaluation is a survey of the technology used, its characteristics, packaging and performance. Each system component is evaluated on the basis of design philosophy, technology, and the total system design with regards to reliability, availability, and performance.

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

College of Engineering and Computing Course Catalogs

No abstract provided.

Some Design Considerations For Picture Archiving And Communication Systems, J. R. Cox, G. J. Blaine, R. L. Hill, R. G. Jost, C. D. Shum

All Computer Science and Engineering Research

Design considerations for picture archiving and communication systems are reviewed with special emphasis on those issues that differ from conventional network architectures. Design equations for three layers of a picture network are developed and discussed in the context of preliminary estimates of the flow of digital images between a multiplicity of picture sources, picture archives and picture viewing stations. Discussions of differences from conventional networks focuses on the local nature of the net, the availability of a wide-band transmission media with low error rates, the relative costliness of network equipment capable of taking advantage of the wide-band transmission media and …

Cylindrical Algebraic Decomposition I: The Basic Algorithm , Dennis S. Arnon, George E. Collins, Scot Mccallum

Department of Computer Science Technical Reports

No abstract provided.

Cylindrical Algebraic Decomposition I: The Basic Algorithm, Dennis S. Arnon, George E. Collins, Scot Mccallum

Department of Computer Science Technical Reports

No abstract provided.

Poker (1.0) Programmers Guide, Lawrence Snyder

Department of Computer Science Technical Reports

No abstract provided.

On Linear-Time Algorithms For 5-Coloring Planar Graphs, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

Should Distributed Systems Be Hidden?, Peter J. Denning, Robert L. Brown

Department of Computer Science Technical Reports

No abstract provided.

Highly Parallel Processing Of Relational Databases (Thesis), Ching-Chih Hsiao

Department of Computer Science Technical Reports

No abstract provided.

A Study Of Flow Languages, Vector Machines, Petri Nets And Convex Languages, Shyam Kishore Bajpai

Masters Theses

In this work, relations have been established among vector machines and augmented vector machines, vector machines and Petri nets, and augmented vector machines and generalized Petri nets. At each stage, number of examples are given to illustrate the theory of Petri nets, vector machines and augmented vector machines.

A Computer Assisted Instruction Package For Computer Graphics, Robert Normand Dutilly

Masters Theses

The purpose of this thesis is to:

(1) Present the concepts and significance of Computer Assisted Instruction (CAI).

(2) Demonstrate the usefulness of CAI by the implementation of a system to instruct in the fundamentals of Computer Graphics.

(3) Describe methods used for implementing a large CAI package on a microcomputer.

(4) Development of software tools to assist in the creation of CAI programs.

The paper will also cover the historical perspectives on the growth of CAI, its impact on the educational field and the proper construction of CAI materials. The system is written in the UCSD Pascal computer programming …

Estimating The Performance Of Multi- Microcomputer Networks, Daniel A. Reed

Department of Computer Science Technical Reports

No abstract provided.

Signature Protocols For Rsa And Other Public- Key Cryptosystems, Dorothy E. Denning

Department of Computer Science Technical Reports

No abstract provided.

Numerical Computation With General Two Dimensional Domains, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Algorithm: A Two Dimensional Domain Processor, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

A Model For Analyzing Generalized Interprocessor Communication Systems, Janice D. Cuny, Lawrence Synder

Department of Computer Science Technical Reports

No abstract provided.

Course Syllabus: Perspectives On Computers And Society, Judith V. Grabiner

Pitzer Faculty Publications and Research

Weizenbaum's statement is a compelling exhortation to his fellow professionals; nevertheless, I cannot wholly agree. It should be possible for nonprofessionals to understand, as a result of their own reading and experience, how computers interact with the rest of human life. The problems are not just technical, and their nature is not entirely unprecedented.