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

Digital Commons Network™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 63211 - 63240 of 63870

Full-Text Articles in Entire DC Network

An Analytical Model For Evaluating Database Update Schemes, Kathryn C. Kinsley Jan 1983

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 …


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

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 …


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

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

College of Engineering and Computing Course Catalogs

No abstract provided.


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

Computer Engineering Bachelor'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 Jan 1983

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.


Computer Science Master's Degree Programs To Advance Your Career 1983-1984, Nova University Jan 1983

Computer Science Master's Degree Programs To Advance Your Career 1983-1984, Nova University

College of Engineering and Computing Course Catalogs

No abstract provided.


Coarse Topologies In Nonstandard Extensions Via Separative Ultrafilters, Paul Bankston Jan 1983

Coarse Topologies In Nonstandard Extensions Via Separative Ultrafilters, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.


Incremental Analysis Of Programs, Vida Ghodssi Jan 1983

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 …


Topological Extensions And Subspaces Of Ηα-Sets, Paul Bankston Jan 1983

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 T1, of cardinality and weight ≼ α, whose topologies are closed under < α intersections.


Operational State Sequence Analysis, Jeffrey A. Brumfield, Peter J. Denning Jan 1983

Operational State Sequence Analysis, Jeffrey A. Brumfield, Peter J. Denning

Department of Computer Science Technical Reports

No abstract provided.


Modeling Multimicrocomputer Networks, Daniel A. Reed Jan 1983

Modeling Multimicrocomputer Networks, Daniel A. Reed

Department of Computer Science Technical Reports

No abstract provided.


Interface Issues In A Software Parts Technology, John R. Rice, Herbert D. Schwetman Jan 1983

Interface Issues In A Software Parts Technology, John R. Rice, Herbert D. Schwetman

Department of Computer Science Technical Reports

No abstract provided.


Dynamic Computational Geometry, Mikhail J. Atallah Jan 1983

Dynamic Computational Geometry, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


The String-To-String Correction Problem With Block Moves, Walter F. Tichy Jan 1983

The String-To-String Correction Problem With Block Moves, Walter F. Tichy

Department of Computer Science Technical Reports

No abstract provided.


Transparent Integrated Local And Distributed Environment (Tilde) Project Overview, Douglas E. Comer Jan 1983

Transparent Integrated Local And Distributed Environment (Tilde) Project Overview, Douglas E. Comer

Department of Computer Science Technical Reports

No abstract provided.


Small Systems, Dirk Siefkes Jan 1983

Small Systems, Dirk Siefkes

Department of Computer Science Technical Reports

No abstract provided.


A Matching Problem In The Plane, Mikhail J. Atallah Jan 1983

A Matching Problem In The Plane, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


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

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

Department of Computer Science Technical Reports

No abstract provided.


A Linear Time Algorithm For The Hausdorff Distance Between Convex Polygons, Mikhail J. Atallah Jan 1983

A Linear Time Algorithm For The Hausdorff Distance Between Convex Polygons, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


Parallel Strong Orientation Of An Undirected Graph, Mikhail J. Atallah Jan 1983

Parallel Strong Orientation Of An Undirected Graph, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


A Graph Orientation Problem, Mikhail J. Atallah Jan 1983

A Graph Orientation Problem, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.


A Model For Coherent Distributed Systems, Robert L. Brown, Peter J. Denning, Walter F. Tichy Jan 1983

A Model For Coherent Distributed Systems, Robert L. Brown, Peter J. Denning, Walter F. Tichy

Department of Computer Science Technical Reports

No abstract provided.


A Comparison Of Processor Technologies, Eddie R. Wachter Jan 1983

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.


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

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.


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

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.


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

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 Dec 1982

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 Dec 1982

Poker (1.0) Programmers Guide, Lawrence Snyder

Department of Computer Science Technical Reports

No abstract provided.


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

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.


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

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

Department of Computer Science Technical Reports

No abstract provided.