close this section of the libraryftp://ftp.dcs.warwick.ac.uk (124)
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/246/ch3.ps.Z, 19950221
Chapter 3 Expansion Systems In this chapter I introduce a simple way of avoiding talking about specific proof systems. I follow D'Agostino's (1990) definition of ``expansion systems'', which captures the idea of a tree based proof system in which we search for contradictions. Tableau, resolution, and
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/gen93/ch6.ps.Z, 19950221
Chapter 6 Proving Alphabetical Monotonicity and Non-vacuity I have shown in Chapter 5 how alphabetical monotonicity and non-vacuity justify the soundness of SS(1345) and SS(145) respectively. In this chapter I discuss how these conditions can be proved for a given theory S. I discuss non-vacuity in
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/246/ch7.ps.Z, 19950221
Chapter 7 Matrix Characterisations of Validity Given the work on expansion systems for S-logics in this thesis, we now know how to determine the validity of formulas. Picking one of the systems I have discussed, perhaps SS(145), we search for a closed tree. There is another way of expressing what we are
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/gen93/ch4.ps.Z, 19950221
Chapter 4 Expansion Systems for Restricted Quantification In the earlier chapters I have introduced syntax and semantics for restricted quantification and a general way of expressing tree based proof systems. In this chapter I show how a simple extension of propositional expansion systems can be made
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/gen93/ch9.ps.Z, 19950221
Chapter 9 A More General System for Restricted Quantification In Chapter 4 I proved that two expansion rules, (g) and (d), for dealing with restricted quantification were sound. I also showed that adding them to a propositional countermodel expansion system leads to a complete system, provided that the
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/gen93/aafront.ps.Z, 19950221
Analytic Proof Systems for Classical and Modal Logics of Restricted Quantification Ian P. Gent1 Department of Computer Science University of Warwick Coventry CV4 7AL United Kingdom March 1993 1Current address: Department of Artificial Intelligence University of Edinburgh 80 South Bridge Edinburgh EH1
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/gen93/ch8.ps.Z, 19950221
Chapter 8 Instantiation in Restricted Quantification The two expansion rules (g) and (d) allow us to form instances of restricted quantifications, given certain conditions. However, they only allow us to form instances in a formula if the formula itself is a quantification. This is why completeness only
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/gen93/zend.ps.Z, 19950221
Index of Symbols and Notation Below I give page references for non-standard symbols and notation used in this thesis. Sometimes two definitions are listed for a symbol, for example if its syntax and semantics are defined separately. The symbols e and fi take different meanings in different context, and
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/gen93/chx.ps.Z, 19950221
Chapter 10 Related Work, Further Work, and Conclusions In this chapter I put the work in this thesis in context, first by considering related work from the literature, and then by making suggestions for future research based on this thesis. Finally, I give some conclusions to the whole thesis. Section
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/gen93/refs.ps.Z, 19950221
References To write a reference, you must have the work you're referring to in front of you. Do not rely on your memory. Do not rely on your memory. Just in case the idea ever occurred to you, do not rely on your memory. -- Mary-Claire van Leunen, ``A Handbook for Scholars'' Abadi, Martin and Manna,
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/246/ch1.ps.Z, 19950221
Chapter 1 Introduction If your thesis is utterly vacuous Use first order predicate calculus. With sufficient formality The sheerest banality Will be hailed by the critics: "Miraculous!" -- Henry A Kautz An important way of improving the efficiency of automated reasoning is to pick out subproblems for
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/246/bcontents.ps.Z, 19950221
Section 9.3 Soundness of 86S branchS(16) SbranchS(1346) 6 C Section 9.4 Completeness of 8 hapter 10 Related Work, Further Work, and Conclusions 88 8 S Section 10.1 Related Work 8 ection 10.1.1 Work with Related Aims 88 9 S Section 10.1.2 Work using Related Methods 8 ection 10.1.3 Work producing Related
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/gen93/abstract.ps.Z, 19950221
Analytic Proof Systems for Classical and Modal Logics of Restricted Quantification Ian Gent
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/246/ch5.ps.Z, 19950221
Chapter 5 Alphabetical Monotonicity and Non-Vacuity In Chapter 4 I proved that for any restriction theory satisfying the least Herbrand model property, and any propositional countermodel expansion system S, the proof system SS(12) is sound and complete; and indeed it remains so if any combination of the
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/gen93/ch2.ps.Z, 19950221
Chapter 2 Restricted Quantification In this chapter I introduce the syntax and semantics of logics of restricted quantification, logics which are the subject of study of this thesis. The basic semantic notion of restricted quantification is simple. Instead of usual, unrestricted, quantifiers read as
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/gen93/ynameindex.ps.Z, 19950222
Name Index This index contains all references to the literature and to personal communications a contained in the main text and in Appendix 1. Omitted are references to people in my cknowledgements as well the quotations by Henry Kautz, Peter Schickele, and Mary- s Claire van Leunen. Also omitted are
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/215/all.ps.Z, 19950502
A Practical Minimum Distance Method for Syntax Error Handling J. A. Dain Department of Computer Science University of Warwick Coventry, CV4 7AL Summary This paper presents a method for recovering from syntax errors encountered during parsing. The method provides a form of minimum distance repair, has
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/265/all.ps.Z, 19950502
1 Highly non-linear encoders for Current Mode Multiple-Valued Logic C.T. Clarke and G.R. Nudd Department of Computer Science University of Warwick Coventry CV4 7AL United Kingdom
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/261/all.ps.Z, 19950502
Th e Fo r m a l Sp e c i c a t i o n o f ELEK TRA Ia i n D . C ra i g D ep a r tm en t of C o m pu te r Sc i e n ce Un i ve rs i ty of W a rw i ck C oventry CV 4 7A L UK EC Janu a ry 31 , 19 9 5 P re fa ce This document was written in September and October, 1990. Since then, I have intended to edit it
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/191/all.ps.Z, 19950502
method for performing such dirty tricks). The CommonLISP implementation does not use packages to any great extent. This gives the user freedom to choose and access any interpreter function or macro. The result of these changes means that users have to do a little more work when constructing their own
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/207/all.ps.Z, 19950502
1 The Interpretation of States: a New Foundation for Computation W M Beynon, S B Russ Dept of Computer Science, University of Warwick, Coventry CV4 7AL
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/204/part7.ps.Z, 19950502
Figure 13: Segmentation of Fig. 10 into `single feature' blocks Figure 14: Curve segments identified from Fig. 13 39
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/204/part3.ps.Z, 19950502
Figure 6: MFT of Bach woodwind trio at level 9. There are seven beats in this segment, which is of 5 sec duration. Figure 7: MFT of same signal as Fig. 6, with 4 times more frequency resolution. 35
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/274/all.ps.Z, 19950502
Seeing Things R Wilson, H Knutssony, University of Warwick, Computer Science Department, Coventry CV4 7AL, U.K. yUniversity of Linkoping, Computer Vision Laboratory, 581 83 Linkoping, Sweden. e-mail:rgw@dcs.warwick.ac.uk;yknutte@isy.liu.se November 10, 1994 Index Terms Active Vision, Invariance,
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/204/part2.ps.Z, 19950502
Figure 4: MFT of two piano notes with relatively high time resolution (187.5 time samples/sec). Figure 5: MFT of same signal as Fig. 4, but with 8 times more frequency resolution. 34
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/227/all.ps.Z, 19950502
Where Do You Want To Go On Holiday Iain D. Craig Department of Computer Science University of Warwick Coventry CV4 7AL UK EC July 1992
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/266/all.ps.Z, 19950502
Agents That Model Themselves Iain D. Craig Department of Computer Science University of Warwick Coventry CV4 7AL UK EU c 1994, I.D. Alexander-Craig, all rights reserved. March 1994
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/216/all.ps.Z, 19950502
The Asymptotic Complexity of Merging Networks (Extended Abstract) Peter Bro Miltersen y Mike Paterson z Jun Tarui z January 16, 1995
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/187/all.ps.Z, 19950502
Meanings and Messages Iain D. Craig Department of Computer Science University of Warwick Coventry CV4 7AL UK EC January 24, 1995
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/146/all.ps.Z, 19950502
Page 10 18. Laird-Johnson Mental Models CUP 1983 19. McDermot A critique of pure reason Comput Intell 3, 151-160, 1987 20. Sartout W, Balzer R On the inevitable intertwining of specification and implementation CACM, 25 (7) (July), 438-440 21. Turski W M, Maibaum T S E The Specification of Computer
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/138/all.ps.Z, 19950502
Relating Computation and Time Mathai Joseph, Asis Goswami University of Warwick
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/102/all.ps.Z, 19950502
Minimum Distance Error Correction Julia Dain Dept of Computer Science University of Warwick Coventry CV4 7AL UK
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/243/all.ps.Z, 19950502
PIk Mass Production and an Optimal Circuit for the Nechiporuk Slice Alain P. Hiltgen and Mike S. Paterson
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/204/part1.ps.Z, 19950502
An Introduction to the Multiresolution Fourier Transform and its Applications R. Wilson, A.D. Calway, E.R.S. Pearson and A.R. Davies.
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/095/all.ps.Z, 19950502
AStandard for a Graph Representation for Functional Programs MikeJoy Department of Computer Science, University of Warwick, Coventry, CV4 7AL. Email: M.S.Joy@dcs.warwick.ac.uk TomAxford Department of Computer Science, University of Birmingham, Birmingham, B15 2TT. Email: T.H.Axford@cs.bham.ac.uk June
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/210/all.ps.Z, 19950502
Parallel Combinator Reduction: Some Performance Bounds MikeJoy Department of Computer Science, University of Warwick, COVENTRY, CV4 7AL, UK e-mail: msj@dcs.warwick.ac.uk TomAxford School of Computer Science, University of Birmingham, PO Box 363, BIRMINGHAM, B15 2TT, UK e-mail tha@cs.bham.ac.uk Copyright
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/260/all.ps.Z, 19950502
1 Agent-oriented Modelling for a Billiards Simulation Monica Farkas Meurig Beynon Yun Pui Yung Department of Computer Science University of Warwick CV4 7AL Tel (+44) 203-523089 FAX (+44) 203-525714
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/284/all.ps.Z, 19950502
Dense Edge-Disjoint Embedding of Complete Binary Trees in Interconnection Networks S. Ravindran, A. M. Gibbons and M. S. Paterson Department of Computer Science, University of Warwick, Coventry CV4 7AL, England
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/145/all.ps.Z, 19950502
Modelling Checkpointing and Recovery Within UNITY Zhiming Liu University of Warwick
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/199/all.ps.Z, 19950502
Formal Techniques in the Development of Blackboard Systems Iain D. Craig Department of Computer Science University of Warwick Coventry CV4 7AL UK EC janet: idc@uk.ac.warwick.dcs internet: idc@dcs.warwick.ac.uk tel: +44 203 523682 fax: +44 203 525714 January 24, 1995
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/257/all.ps.Z, 19950502
Hardware Characterisation of Multi-Processor Systems M. J. Zemerly Department of Computer Science University of Warwick Coventry CV4 7AL email: jamal@dcs.warwick.ac.uk April 29, 1993
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/127/all.ps.Z, 19950502
1 Parallel computation in definitive models Meurig Beynon, Mike Slade, Yun Wai Yung Department of Computer Science, University of Warwick, Coventry CV4 7AL
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/205/all.ps.Z, 19950502
1 Programming Principles for the Semantics of the Semantics of Programs Meurig Beynon Dept of Computer Science University of Warwick Coventry CV4 7AL, UK
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/142/all.ps.Z, 19950502
The Translation of High-LevelFunctional Languages to FLIC MikeJoy Department of Computer Science University of Warwick Coventry CV4 7AL U.K. Email: M.S.Joy@dcs.warwick.ac.uk May 1989 Copyright 1989 M.S. Joy.All Rights Reserved.
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/248/all.ps.Z, 19950502
Multiresolution Image Analysis Based On Local Symmetries Andrew King, Roland Wilson Department of Computer Science, University of Warwick, Coventry September 28, 1993
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/204/part5.ps.Z, 19950502
Figure 10: Original `Lena' image, 512 512 pixels 37
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/256/all.ps.Z, 19950502
Characterising Computational Kernels: A Case Study M. J. Zemerly, E. Papaefstathiou, T. J. Atherton, D. J. Kerbyson and G. R. Nudd Department of Computer Science University of Warwick Coventry CV4 7AL email: jamal@dcs.warwick.ac.uk
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/169/all.ps.Z, 19950502
Shallow Multiplication Circuits Michael S. Paterson Uri Zwick Department of Computer Science Mathematics Institute University of Warwick University of Warwick Coventry, CV4 7AL, England Coventry, CV4 7AL, England
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/238/all.ps.Z, 19950502
The Viterbi Algorithm 1 1 The Viterbi Algorithm. M. S. Ryan* and G. R. Nudd. Department of Computer Science, University of Warwick, Coventry, CV4 7AL, England. *e-mail address - (msr@dcs.warwick.ac.uk) 12th February 1993.
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/262/all.ps.Z, 19950502
A Layered Approach to Parallel Software Performance Prediction : A Case Study E. Papaefstathiou, D.J. Kerbyson, G.R. Nudd Department of Computer Science, University of Warwick, Coventry CV4 7AL, U.K. Email: stathis@dcs.warwick.ac.uk
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/181/all.ps.Z, 19950502
Nii, H.P. and Aiello, N., AGE: A Knowledge-based Program for Building Knowledgebased Programs, Proc. IJCAI 6,pp. 645-655, 1979. Nii, H.P., The Blackboard Model of Problem Solving, AI Magazine, 7, No. 2, pp. 38- 53, 1986a. Nii, H.P., Blackboard Systems Part Two: Blackboard Application Systems, AI
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/235/all.ps.Z, 19950502
Ginger - A Simple Functional Language MikeJoy Department of Computer Science, University of Warwick, COVENTRY, CV4 7AL, UK. Phone: +44 1203 523368 Fax: +44 1203 525714 Email: M.S.Joy@dcs.warwick.ac.uk Last revision: 12 December 1992
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/270/all.ps.Z, 19950502
Fault-Tolerant Bisimulation and Process Transformations Tomasz Janowski Department of Computer Science University of Warwick, Coventry CV4 7AL, UK
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/111/all.ps.Z, 19950502
1 Implementing a definitive notation for interactive graphics Meurig Beynon and Edward Yung, Dept of Computer Science, University of Warwick, Coventry CV4 7AL
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/182/all.ps.Z, 19950502
Craig, I.D., The Formal Specification of RPS, Department of Computer Science, University of Warwick, in prep., 1991g. Davis, R., Meta-rules: Reasoning about Control, AI Journal, Vol. 15, pp. 179-222, 1980. Engelmore, R. and Morgan, T. (eds.), Blackboard Systems, Addison-Wesley, Wokingham, England, 1988.
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/255/all.ps.Z, 19950502
Characterisation Survey M. J. Zemerly and E. Papaefstathiou Department of Computer Science University of Warwick Coventry CV4 7AL email: jamal/stathis@dcs.warwick.ac.uk April 29, 1993
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/275/all.ps.Z, 19950502
1 Stepwise Transformations for Fault-Tolerant Design of CCS Processes Tomasz Janowski y Department of Computer Science, University of Warwick, Coventry CV4 7AL, United Kingdom This paper provides an approach to the formal design of distributed, fault-tolerant processes, using the language of CCS and the
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/209/all.ps.Z, 19950502
Shallow Multiplication Circuits and Wise Financial Investments Michael S. Paterson Dept. of Computer Science University of Warwick Coventry CV4 7AL, England Uri Zwick Dept. of Computer Science Tel Aviv University Tel Aviv 69978, Israel
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/148/all.ps.Z, 19950502
FLIC - a Functional Language Intermediate Code Simon L. Peyton Jones Department of Computing Science, University of Glasgow, Glasgow, G12 8QQ. Email: simonpj@dcs.glasgow.ac.uk MikeJoy Department of Computer Science, University of Warwick, Coventry, CV4 7AL. Email: M.S.Joy@dcs.warwick.ac.uk Revised
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/278/all.ps.Z, 19950502
1 Databases from an Agent-oriented Perspective Meurig Beynon*, Alan Cartwright , Yun Pui Yung* Department of Computer Science* Department of Engineering University of Warwick, Coventry CV4 7AL
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/226/part1.ps.Z, 19950502
Analysis of Structured Texture Using the Multiresolution Fourier Transform Tao-I Hsu, A. D. Calway and R. Wilson Department of Computer Science, University of Warwick, Coventry, CV4 7AL, England. June 1992
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/268/all.ps.Z, 19950502
Longest Common Subsequences Mike Paterson Vlado Dan<=c ky Department of Computer Science University of Warwick Coventry, CV4 7AL, England fmsp,vladog@dcs.warwick.ac.uk
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/184/all.ps.Z, 19950502
sterdam, 1988. Maes, P., Issues in Computational Reflection, in Maes, 1988. Nii, H.P. and Aiello, N., AGE: A Knowledge-based Program for Building Knowledge-based Programs, Proc. IJCAI-6, 1979. Smith, B.C., Reflection and Semantics in a Procedural Language, LCS Technical Report TR-272, MIT, Cambridge,
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/277/all.ps.Z, 19950502
Empirical Modelling of Requirements Meurig Beynon Steve Russ fwmb,sbrg@dcs.warwick.ac.uk Department of Computer Science University of Warwick Coventry CV4 7AL, UK September 1994
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/093/all.ps.Z, 19950502
1 Definitive Principles for Interactive Graphics Meurig Beynon Dept of Computer Science University of Warwick
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/249/all.ps.Z, 19950502
Computer Science Seminars 1992/93 compiled by M.S. Paterson Department of Computer Science University of Warwick Introduction This report contains the abstracts of the programme of weekly seminars in the Department of Computer Science for the 1992/93 academic year. There were 28 seminars in all: 17 by
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/264/all.ps.Z, 19950502
1 Three Dimensional CORDIC with reduced iterations C.T. Clarke and G.R. Nudd Department of Computer Science University of Warwick Coventry CV4 7AL United Kingdom Abstract This paper describes a modification to the three dimensional CORDIC algorithm using an approximation of the Taylor series. The
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/283/all.ps.Z, 19950502
Two Topologies Are Better Than One Simon O'Neill April 1995
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/204/part8.ps.Z, 19950502
Figure 15: Segmentation of `Shapes' image into `multiple feature' blocks Figure 16: Curve and line segments overlaid on original `Shapes' image 40 Figure 17: Curve and line segments overlaid on original `Breakfast Table' image 41
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/132/all.ps.Z, 19950502
1 Definitive programming for parallelism (draft paper) Meurig Beynon Department of Computer Science University of Warwick Coventry CV4 7AL Area of interest Concepts and paradigms for concurrent systems / Models for parallelism
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/242/all.ps.Z, 19950502
Process calculus and parallel object-oriented programming languages David Walker Department of Computer Science University of Warwick, Coventry CV4 7AL, U.K.
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/286/all.ps.Z, 19950502
On the Complexity of String Folding Mike Paterson y Teresa Przytycka z
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/285/all.ps.Z, 19950502
Contention Resolution with Bounded Delay Mike Paterson y Aravind Srinivasanz
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/267/all.ps.Z, 19950502
On the cell probe complexity of polynomial evaluation (note) Peter Bro Miltersen y Aarhus University and University of Warwick
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/272/all.ps.Z, 19950502
Confluence of Processes and Systems of Objects Xinxin Liu and David Walker Department of Computer Science University of Warwick Coventry CV4 7AL, U.K.
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/273/all.ps.Z, 19950502
A Perspective on Multi-Agent Systems Iain D. Craig Department of Computer Science University of Warwick Coventry CV4 7AL UK EU February 3, 1995
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/144/all.ps.Z, 19950502
A Semantic Model For UNITY Zhiming Liu University of Warwick
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/252/all.ps.Z, 19950502
Acknowledgements Funding for this work was provided by teh SERC and CRL Limited. I would liketo acknowledge the helpful advice of my supervisor,Dr. Roland Wilson and Dr.Martin Todd at CRL. i 1Musical Signals and Music Transcription Musical sounds may be produced in an in nite variety of ways, both by
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/279/all.ps.Z, 19950502
An Analysis of Processor Resource Models for Use in Performance Prediction E. Papaefstathiou, D.J. Kerbyson, G.R. Nudd, T.J. Atherton Parallel Systems Group, Department of Computer Science, University of Warwick, Coventry, UK
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/254/all.ps.Z, 19950502
1986. (Schwartz, 1993) Schwartz, D.G. and Stirling, L.S., BackLog: From Blackboard System to Process-Oriented Prolog, in De Boschere, 1993. (Velthuijsen, 1992) Velthuijsen, H., The Nature and Applicability of the Blackboard Architecture, Ph.D. thesis, Dept. of Computer Science, University of Limburg,
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/086/all.ps.Z, 19950502
1 DoNaLD: a line-drawing system based on definitive principles Meurig Beynon David Angier Tim Bissell Steve Hunt Department of Computer Science University of Warwick COVENTRY CV4 7AL 2
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/258/all.ps.Z, 19950502
Lower bounds for Union-Split-Find related problems on random access machines Peter Bro Miltersen Aarhus University and University of Warwick
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/263/all.ps.Z, 19950502
Relative to a Random Oracle, NP is not Small (Extended Abstract) Steven M. Kautz Department of Mathematics Randolph-Macon Woman's College 2500 Rivermont Avenue Lynchburg, VA 24503 Peter Bro Miltersen y University of Warwick Computer Science Department Coventry CV4 7AL U.K. March 2, 1994
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/159/all.ps.Z, 19950502
GCODE: A Revised Standard for a Graph Representation for Func- tional Programs MikeJoy Department of Computer Science, University of Warwick, Coventry, CV4 7AL. Email: M.S.Joy@dcs.warwick.ac.uk TomAxford School of Computer Science, The University of Birmingham, PO Box 363, Birmingham, B15 2TT. Email:
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/281/all.ps.Z, 19950502
1 Characterisation Based Bottleneck Analysis of Parallel Systems M.J. Zemerly, J. Papay, G.R. Nudd Parallel Systems Group, Department of Computer Science, University of Warwick, Coventry, UK Email: {jamal, yuri, grn}@dcs.warwick.ac.uk
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/232/all.ps.Z, 19950502
Replacing CASSANDRA Iain D. Craig Department of Computer Science University of Warwick Coventry CV4 7AL UK EC October 1992
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/195/all.ps.Z, 19950502
Logicism and Meaning: The Case Against (Draft) Iain D. Craig Department of Computer Science University of Warwick Coventry CV4 7AL UK EC January 24, 1995
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/269/all.ps.Z, 19950502
Object Representation Using Circular Harmonics Nicola Cross, Roland Wilson Department of Computer Science, University of Warwick, Coventry August 2, 1994 1
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/204/part6.ps.Z, 19950502
Figure 11: MFT of Fig. 10, 8 8 frequency resolution Figure 12: MFT of Fig. 10, 32 32 frequency resolution 38
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/244/all.ps.Z, 19950502
Dynamic Character Recognition Using Hidden Markov Models. 1 Dynamic Character Recognition Using Hidden Markov Models.1 M. S. Ryan* and G. R. Nudd. Department of Computer Science, University of Warwick, Coventry, CV4 7AL, England. *e-mail address - (msr@dcs.warwick.ac.uk) 19th May 1993.
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/271/all.ps.Z, 19950502
Self-Similar Neural Networks Based On A Kohonen Learning Rule Simon Clippingdale, Roland Wilson Department of Computer Science University of Warwick Coventry CV4 7AL, U.K. e-mail: simon@dcs.warwick.ac.uk, rgw@dcs.warwick.ac.uk Acknowledgements This work was supported by the UK SERC/EPSRC. The authors
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/166/all.ps.Z, 19950502
Optimal Carry Save Networks Michael S. Paterson Nicholas Pippenger y Uri Zwick z
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/204/part4.ps.Z, 19950502
Figure 8: Notes detected from piano sample of Fig. 4 Figure 9: Notes detected from woodwind sample of Fig. 6 36
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/287/all.ps.Z, 19950608
A Scalable Real-Time Synchronization Protocol for Distributed Systems Injong Rhee Graham R. Martin Department of Computer Science University of Warwick Coventry, CV4 7AL, U.K April 1995
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/288/all.ps.Z, 19951005
Feature Extraction for Very Low Bit Rate Video Coding P.R. Meulemans, Dr. R. Wilson Department of Computer Science, University of Warwick, Coventry August 31, 1995
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/290/all.ps.Z, 19951005
Image Segmentation Using Multiresolution Fourier Transform Chang-Tsun Li, Roland Wilson Department of Computer Science, University of Warwick, Coventry September 18, 1995
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/292/all.ps.Z, 19951026
Variable Size Block Matching Motion Estimation with Minimal Error RR292 GRMartin, R A Packwood and I Rhee Department of Computer Science, University of Warwick, Coventry,CV4 7AL, United Kingdom October 1995 -2-
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ch1.ps.Z, 19951119
CHAPTER 1 INTRODUCTION 1.1 Background An increasing number of research, industry, and defence applications are being developed to run on parallel systems. Porting existing sequential software and developing new software on such systems is a complicated and expensive process . However, the
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/apndxa.ps.Z, 19951119
APPENDIX A CHIP3S LANGUAGE SYNTAX This appendix includes the syntax and the semantics of the CHIP3S language. The description includes: The definition of the object types, the role of each object and a road-map to the structure of the object (Section A.1). The object header is described in detail
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ch3c.ps.Z, 19951119
3. CHARACTERISATION FRAMEWORK 85 3.7.2 Sorting Kernel The characterisation of the sorting kernel is presented in this section. The kernel uses a parallel merge algorithm. It includes two phases: 1. local memory sequential sort performed by all processors; and 2. a merge stage where all the local sorted
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/intro.ps.Z, 19951119
A FRAMEWORK FOR CHARACTERISING PARALLEL SYSTEMS FOR PERFORMANCE EVALUATION Efstathios Papaefstathiou A Thesis Submitted to the University of Warwick for the Degree of Doctor of Philosophy Department of Computer Science University of Warwick September 1995 To my parents with love I Summary Performance
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ch5b.ps.Z, 19951119
CHIP3S: A CHARACTERISATION TOOL 179 5.6 Run-Time System The run-time system is a shell to the Mathematica language, implemented as a set of Mathematica functions. It aims to simplify and automate various procedures performed to evaluate the model and to enable the experimentation with the various
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ch3b.ps.Z, 19951119
3. CHARACTERISATION FRAMEWORK 62 3.4 Parallel Template Layer The parallel template layer includes the models that are related to the parallel aspects of an application. The template is organised into separate models that represent the computation / communication pattern and the parallel overheads. In
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ch3a.ps.Z, 19951119
CHAPTER 3 CHARACTERISATION FRAMEWORK 3.1 Introduction This Chapter details the features and the structure of a layered characterisation framework . The framework addresses many of the issues that has limited the wide acceptance of performance methodologies by
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ch6.ps.Z, 19951119
CHAPTER 6 CONCLUSIONS This thesis describes a novel layered framework for characterising parallel systems for performance evaluation. The framework consists of three independent layers with well defined interfaces: the application layer, the parallel template layer, and the hardware layer. The framework
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ref.ps.Z, 19951119
BIBLIOGRAPHY Addison93 C.A. Addison, V.S. Getov, A.J.G. Hey, R.W. Hockney, I.C. Wolton, The GENESIS distributed-memory benchmarks, in: J. Dongarra and W. Gentzsch, eds., Computer Benchmarks (North-Holland, 1993) 257-271. Addison95 C.A. Addison, E. Appiani, R. Cook, M. Corvi, J. Harms, G. Howard, and B.
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ch4b.ps.Z, 19951119
4. RESOURCE MODELS 122 4.5 Communication Resource Models The definition and creation of Communication Resource Usage Vectors (CRUV) was introduced in Chapter 3. This section deals with the underlying hardware models that evaluate CRUVs in order to produce communication time predictions. A wide range of
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/apndxb.ps.Z, 19951119
APPENDIX B CHIP3S CODE FOR FINANCIAL APPLICATION CHARACTERISATION This appendix includes the CHIP3S source code of a spread option financial applica- tion characterisation. The HLFD of application is shown in Figure B.1 and it com- prise of the following object: Application Object: The application
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ch2.ps.Z, 19951119
CHAPTER 2 PERFORMANCE EVALUATION TECHNIQUES FOR PARALLEL SYSTEMS 2.1 Introduction Numerous methodologies have been developed to evaluate the performance of computer systems. These can be organised into four broad groups: benchmarking, analytical modelling, simulation, and monitoring. In benchmarking
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ch4c.ps.Z, 19951119
4. RESOURCE MODELS 139 4.6 Results In this section the prediction results and measurements for the numerical integration, sorting, and matrix multiplication kernels will be presented. In the previous chapter the application and parallel template layers of these kernels have been developed. In this
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ch5a.ps.Z, 19951119
CHAPTER 5 CHIP3S A CHARACTERISATION TOOL 5.1 Introduction The notion of performance tools for the rest of us is the central driving work behind the layered characterisation framework methodology. In order to achieve this goal, the user of the performance methodology must focus his/her effort on the
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/papa95/ch4a.ps.Z, 19951119
CHAPTER 4 RESOURCE MODELS 4.1 Introduction The layered framework is a characterisation methodology for parallel systems that organises the system model into three separate, independent layers: the application, the parallel template, and the hardware. The first two provide a description of the software
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/297/all.ps.Z, 19960123
Constructing Computer Virus Phylogenies Leslie Ann Goldbergy Paul W. Goldbergz Cynthia A. Phillipsx Gregory B. Sorkin{ January 23, 1996
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/298/all.ps.Z, 19960126
Error-resistant Implementation of DNA Computations Martyn Amos y Alan Gibbons Department of Computer Science, University of Warwick, Coventry CV4 7AL, England David Hodgson Department of Biological Sciences, University of Warwick, Coventry CV4 7AL, England
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/301/all.ps.Z, 19960305
Dynamic Scheduling in the Presence of Faults: Specification and Verification Tomasz Janowski1 and Mathai Joseph2 1 The United Nations University International Institute for Software Technology P.O. Box 3058, Macau 2 Department of Computer Science University of Warwick, Coventry CV4 7AL, UK
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/302/all.ps.Z, 19960326
Verification of Fault-Tolerance and Real-Time Zhiming Liu Department of Mathematics and Computer Science University of Leicester Mathai Joseph Department of Computer Science University of Warwick
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/307/all.ps.Z, 19960618
Directed Simulations Natasha Kurtonina1 and Maarten de Rijke2 1 Center for Logic, Ghent University Rozier 44, 9000 Ghent, Belgium Natasha.Kurtonina@rug.ac.be 2 Dept. of Computer Science, University of Warwick Coventry CV4 7AL, England mdr@dcs.warwick.ac.uk
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/308/all.ps.Z, 19960624
Expected Length of Longest Common Subsequences Vladim r Dan<=c k A thesis submitted for the Degree of Doctor of Philosophy Department of Computer Science University of Warwick September 1994 Contents 1 Introduction 1 2 Notation and preliminaries 4 2.1 Notation and basic definitions : : : : : : : : : : :
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/309/all.ps.Z, 19960726
Multiresolution Motion Analysis James Beacom, Roland Wilson Department of Computer Science, University of Warwick, Coventry July 25, 1996
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/311/figures.ps.Z, 19960916
20 Figure 1 Figure 2 Figure 3
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/313/all.ps.Z, 19960917
A Review of Android Epistemology by Kenneth M. Ford, Clark Glymour, and Patrick J. Hayes (eds) MIT Press, 1995 (To appear in Robotika) Iain D. Craig Department of Computer Science University of Warwick Coventry CV4 7AL UK EU September 17, 1996 A slightly edited version of this review is to appear in
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/311/text.ps.Z, 19960923
1 Worlds Before and Beyond Words Meurig Beynon Paul Ness Steve Russ Department of Computer Science, University of Warwick, Coventry CV4 7AL, UK
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/rr/317/all.ps.Z, 19961012
A Note on Graded Modal Logic Maarten de Rijke Dept. of Computer Science, University of Warwick Coventry CV4 7AL, England mdr@dcs.warwick.ac.uk
open this document and view contentsftp://ftp.dcs.warwick.ac.uk/pub/reports/theses/hol94/all.ps.Z, 19970102
Parallel Algorithms in Graph Theory and Algebra Submitted by Nick Holloway for the degree of Doctor of Philosophy. University of Warwick Department of Computer Science October 1994 to Pam. Contents Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ii Acknowledgements . . . . . .