Search For:

Displaying 1-27 out of 27 total
Performance Evaluation of Scheduling Policies in a Smart Hospital Environment
Found in: Cyber-Enabled Distributed Computing and Knowledge Discovery, International Conference on
By Xiao Chen,Nigel Thomas,Michael Harrison
Issue Date:October 2011
pp. 585-592
In this paper we consider the performance of different scheduling policies in a smart environment. Models are generated under a hospital scenario, and are used to simulate patient flow under three scheduling policies. SimJava 2.0 is adopted as the main sim...
 
Towards Usable and Relevant Model Checking Techniques for the Analysis of Dependable Interactive Systems
Found in: Automated Software Engineering, International Conference on
By Karsten Loer, Michael Harrison
Issue Date:September 2002
pp. 223
Model checking is a formal technique for the automated analysis of system models against formal requirements. Once a suitable model and property have been specified, no further interaction by the analyst is required. However, this does not make the method ...
 
Presentation by Tree Transformation
Found in: Computer Conference, IEEE International
By Michael A. Harrison, Vance Maverick
Issue Date:February 1997
pp. 68
Structured documents are represented as trees. The layout or presentation of a document is also often modeled as a computation over a tree. But these trees are not generally the same: for instance, LaTeX converts a structured document to the TeX formatting...
 
Multiple Representation Document Development
Found in: Computer
By Pehong Chen, Michael A. Harrison
Issue Date:January 1988
pp. 15-31
<p>The authors review a large number of document development systems for both text and graphics from the perspectives of source-language and direct-manipulation models. They describe the task domain and discuss the pros and cons of direct-manipulatio...
 
Characterizations of LR(O) languages
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Matthew M. Geller, Michael A. Harrison
Issue Date:October 1973
pp. 103-108
No summary available.
 
Single pass precedence analysis
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By James N. Gray, Michael A. Harrison
Issue Date:October 1969
pp. 106-117
No summary available.
 
On Equivalence of State Assignments
Found in: IEEE Transactions on Computers
By Michael A. Harrison
Issue Date:January 1968
pp. 55-57
Using a new definition for the equivalent of state assignments, the number of nonequivalent state assignments is derived. The exact number of nondegenerate state assignments is also compted.
 
One-way stack automata — Extended abstract
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison
Issue Date:October 1966
pp. 47-52
No summary available.
 
A census finite automata
Found in: Foundations of Computer Science, Annual IEEE Symposium on
By Michael A. Harrison
Issue Date:November 1964
pp. 44-46
Closed form expressions are obtained for enumerating the non-equivalent finite automata under serveral definitions of equivalence. Algorithms are presented for determining the number of connected automata and automata with a distinguished initial state. Us...
 
Programming and operating systems overview
Found in: Managing Requirements Knowledge, International Workshop on
By Michael A. Harrison
Issue Date:June 1978
pp. 1077
No summary available.
   
Formal analysis of ubiquitous computing environments through the APEX framework
Found in: Proceedings of the 4th ACM SIGCHI symposium on Engineering interactive computing systems (EICS '12)
By José Campos, José Luís Silva, Michael Harrison
Issue Date:June 2012
pp. 131-140
Ubiquitous computing (ubicomp) systems involve complex interactions between multiple devices and users. This complexity makes it difficult to establish whether: (1) observations made about use are truly representative of all possible interactions; (2) desi...
     
Real-time anaesthesia diagnosis display system with multi-modal alarms
Found in: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (OZCHI '08)
By Beryl Plimmer, Ken Lee, Kyung Jean (Tyler) Yang, Michael Harrison
Issue Date:December 2008
pp. 1-36
Fatal errors during anaesthesia administration are usually preventable human mistakes. It is difficult for anaesthetists to keep monitoring every physiological change and to detect clinically critical events during anaesthesia. Intelligent patient monitori...
     
Rational parametrisation for degree 6 Del Pezzo surfaces using lie algebras
Found in: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (ISSAC '06)
By Josef Schicho, Michael Harrison
Issue Date:July 2006
pp. 132-137
We give an algorithm for deciding whether a given Del Pezzo surface of degree 6 is rational over the ground field, and for computing a proper parametrisation in the affirmative case. This problem is reduced to the simultanuous solution of two norm equation...
     
Accurate static estimators for program optimization
Found in: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation (PLDI '94)
By Michael A. Harrison, Susan L. Graham, Tim A. Wagner, Vance Maverick
Issue Date:June 1994
pp. 329-338
Determining the relative execution frequency of program regions is essential for many important optimization techniques, including register allocation, function inlining, and instruction scheduling. Estimates derived from profiling with sample inputs are g...
     
The Proteus presentation system
Found in: Proceedings of the fifth ACM SIGSOFT symposium on Software development environments (SDE 5)
By Ethan V. Munson, Michael A. Harrison, Susan L. Graham
Issue Date:December 1992
pp. 60-60
Software development environments can increase user productivity by presenting information in more useful ways. This paper describes Proteus, the presentation system of Ensemble, a software development environment that supports a wide variety of language a...
     
Modelling user, system design: results of a scenarios matrix exercise
Found in: Proceedings of the SIGCHI conference on Human factors in computing systems: Reaching through technology (CHI '91)
By Allan MacLean, Joelle Coutaz, Michael Harrison, Nick Hammond, Phil Barnard, Richard M. Young
Issue Date:April 1991
pp. 377-380
An interactive electronic information kiosk was created for the CHI '89 conference. Based on Macintosh® technology, the “InfoBooth” included a custom HyperCard® interface built by a team at Apple Computer.The design was initiated by e...
     
An Improved Context-Free Recognizer
Found in: ACM Transactions on Programming Languages and Systems (TOPLAS)
By Michael Harrison and Walter L. Ruzzo, Susan L. Graham
Issue Date:July 1980
pp. 415-462
A new algorithm for recognizing and parsing arbitrary context-free languages is presented, and several new results are given on the computational complexity of these problems. The new algorithm is of both practical and theoretical interest. It is conceptua...
     
Theoretical results in compiler design and implementation (Tutorial Session)
Found in: Proceedings of the annual conference (ACM 76)
By Kenneth Kennedy, Meera Blattner, Michael Harrison, Susan Graham
Issue Date:October 1976
pp. 23
The aim of this session is to survey some advances in theoretical computer science and their impact on the design of programming language compilers. There has been considerable research activity in three major areas: the analysis of program syntax (parsing...
     
SIGACT (Tutorial Session)
Found in: Proceedings of the annual conference (ACM 76)
By Kenneth Kennedy, Meera Blattner, Michael Harrison, Susan Graham
Issue Date:October 1976
pp. 22
This session surveys some advances in theoretical computer science and their impact on the design of programming language compilers. The emphasis is on three major areas: the analysis of program syntax, the detection of errors at compile time, and the opti...
     
On line context free language recognition in less than cubic time(Extended Abstract)
Found in: Proceedings of the eighth annual ACM symposium on Theory of computing (STOC '76)
By Michael A. Harrison, Susan L. Graham, Walter L. Ruzzo
Issue Date:May 1976
pp. 112-120
A new on-line context free language recognition algorithm is presented which is derived from Earley's algorithm and has several advantages over the original. First, the new algorithm not only is conceptually simpler than Earley's, but also allows significa...
     
On protection in operating systems
Found in: Proceedings of the fifth symposium on Operating systems principles (SOSP '75)
By Jeffrey D. Ullman, Michael A. Harrison, Walter L. Ruzzo
Issue Date:November 1975
pp. 14-24
A model of protection mechanisms in computing systems is presented and its appropriateness is demonstrated. The “safety” problem for protection systems under our model is to determine in a given situation whether a subject can acquire a particu...
     
On the Parsing of Deterministic Languages
Found in: Journal of the ACM (JACM)
By Ivan M. Havel, Michael A. Harrison
Issue Date:October 1974
pp. 525-548
A parsing method for strict deterministic grammars is presented and a technique for using it to parse any deterministic language is indicated. An important characterization of the trees of strict deterministic grammars is established. This is used to prove...
     
Strict deterministic versus LR(0) parsing
Found in: Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages (POPL '73)
By Matthew M. Geller, Michael A. Harrison
Issue Date:October 1973
pp. 22-32
Recently strict deterministic grammars and languages have been introduced [9,10,11]. This family of languages is quite fundamental in the study of the mathematical properties of deterministic languages and in dealing with some classical families of grammar...
     
On the Covering and Reduction Problems for Context-Free Grammars
Found in: Journal of the ACM (JACM)
By James N. Gray, Michael A. Harrison
Issue Date:October 1972
pp. 675-698
Many problems, some of them quite meaningful, have been proved to be recursively unsolvable for programs in general. The paper is directed toward a class of programs where many decision problems are solvable. The equivalence problem has been proved to be u...
     
A Grammatical Characterization of One-Way Nondeterministic Stack Languages
Found in: Journal of the ACM (JACM)
By Mario Schkolnick, Michael A. Harrison
Issue Date:April 1971
pp. 148-172
Many problems, some of them quite meaningful, have been proved to be recursively unsolvable for programs in general. The paper is directed toward a class of programs where many decision problems are solvable. The equivalence problem has been proved to be u...
     
One-way stack automata
Found in: Journal of the ACM (JACM)
By Michael A. Harrison, Seymour Ginsburg, Sheila A. Greibach
Issue Date:April 1967
pp. 389-418
A number of operations which either preserve sets accepted by one-way stack automata or preserve sets accepted by deterministic one-way stack automata are presented. For example, sequential transduction preserves the former; set complementation, the latter...
     
On Asymptotic Estimates in Switching and Automata Theory
Found in: Journal of the ACM (JACM)
By Michael A. Harrison
Issue Date:January 1966
pp. 151-157
Formulas and algorithms have recently been given for calculating the number of symmetry types of functions, networks and automata under various transformation groups. In almost all cases, the computations involved are quite difficult and require the use of...
     
 1