71 research outputs found
Recommended from our members
A Distributed and Parallel Component Architecture for Stream-Oriented Applications ; CU-CS-989-04
Recommended from our members
Preliminary Investigations on Stochastic Information Control Nets ; CU-CS-1055-09
Recommended from our members
The Approximation of Probabilistic Turing Automata by Probabilistic Pushdown Automata ; CU-CS-020-73
The concepts of Probabilistic Pushdown Automata and Probabilistic Turing Automata are defined. Then an algorithm is proposed which allows one to approximate the Turing Automation by the Pushdown Automation. The goodness of fit of this approximation is investigated, and an error bound is derived
Recommended from our members
A Practicum -- Seminar in Structured Programming ; CU-CS-061-75
This paper describes a practicum-seminar course which the author taught at the University of Colorado during the spring and summer of 1974. This course contained a number of salient features which made it an interesting experiment and a unique learning experience for all involved. The broad goals of the seminar were: a) To introduce participants o system design and software engineering techniques and to provide practical experience in the use of these techniques; b) To design and implement a flexible, human-oriented student registration and scheduling system. This paper presents background and discussion of the project and the seminar. A class syllabus is given showing topics which were covered, and advantages and disadvantages of this type of educational experience are dicussed
Recommended from our members
A Model and Algorithm for Concurrent Access within Groupware ; CU-CS-616-92
Recommended from our members
A Model and Algorithm for Concurrent Access within Groupware ; CU-CS-593-92
Recommended from our members
On the Probability of Deadlock in Computer Sciences ; CU-CS-026-73
As the number of processes and resources increases within a computer system, does the probability of that system\u27s being in deadlock increase or decrease? This paper introduces Probabilistic Automata as a model of computer systems. This allows investigation of the above question for various scheduling algorithms. a theorem is proved which indicates that, within the types of systems considered, the probability of deadlock increases
Recommended from our members
Computer Science Education in Taiwan -- An Afips Internship Report ; CU-CS-019-73
Recommended from our members
Probabilistic Models of Computer Deadlock ; CU-CS-041-74
As the number of processes and resources increase within a computer system, does the probability of that system’s encountering deadlock increase or decrease? The problem of deadlock in computer system and a model applicable to the investigation of this problem are presented. The model treats sequences of resource activity as potential members of the set of strings accepted by a probabilistic automation. This paper, after explaining the model as its application, describes a transformation on the automation which makes it amenable to calculations of the probability of deadlock. These calculations consist of: 1. Derivation of necessary and sufficient conditions for an automation to be well-behaved – formally described as accepting a normalized language, and 2. Usage of these conditions to yield closed-form equations of deadlock probability under several definitions thereof. Although the automation model used in these calculations is a probabilistic pushdown automation, it is indicated that the procedures described can also be applied to other types of probabilistic automata modeling other deadlock situations. Results of calculations on actual computer system models are also described, indicating that within the types of systems considered, the probability of deadlock increases
Recommended from our members
Analysis of Some Abstract Measures of Protection in Computer Systems ; CU-CS-043-74
The area of computer systems protection has been acclaimed as a very important one, and there is a vast amount of literature on the subject (including several books). However, implementations of protection mechanisms tend to be ad-hoc and there is a lack of quantitative theoretical results upon which one can base decisions and abstract the essence of protection. This paper is the first to present a mathematically rigorous definition (with proofs) of the degree of protection of a system. It is hoped that this alternatives to and generalizations of current implementations and to some of the trade-offs involved in these alternatives. Ultimately, it is hoped that this presentation will contribute to a general Theory of Protection. This investigation is directed toward an analysis and comparison of access mechanisms defined by a family of Boolean functions. Some definitions are stated, and some theorems are proved which are valid for all access mechanisms within the family considered. Algorithms are presented for the optimal and for several types of structured systems. It is proven that for a very general class of systems, the optimal assignment will still allow n/2(ɤ-1) unauthorized accesses to objects where n is the number of subjects and ɤ is the largest integer not greater than the quantity n divided by the number of access classes
- …