Browse

ftp://ftp.essex.ac.uk (57)

	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-164.ps.Z, 19930924 - 1 - The External Procedural Interface (EPI) for the IFS/2 Parts 1 and 2 Simon H. Lavington & Jiwei Wang Dept. of Computer Science University of Essex Colchester CO4 3SQ 1. Introduction The IFS/2 is the successor to the first version of the Intelligent File Store (ref. 1). The IFS/2 differs from its
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-169.ps.Z, 19930924 1 DDB Graph Operations for the IFS/2 N.E.J. Dewhurst, S.H.Lavington and J. Robinson Department of Computer Science University of Essex Colchester CO4 3SQ
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-168.ps.Z, 19930924 1 RELATIONAL ALGEBRAIC OPERATIONS FOR THE IFS/2 N.E.J. Dewhurst and S.H. Lavington
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-188.ps.Z, 19930924 Face Recognition through Learnt Boundary Characteristics L.Spacek , M.Kubaty, D.Flotzingery March 31, 1993
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-197.ps.Z, 19931202 A computer simulation of the revised logogen model (Morton 1979, 1980) of word recognition is presented. Evaluation of initial performance found reading accuracy was 50%. Assumptions made during the development of the simulation adversely affected performance, and these have been addressed in the work
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-147.ps.Z, 19940303 Page 24 Martin-Lof, P. , Constructive Mathematics and Computer Programming, Logic, Methodology and Philosophy of Science VI, pp. 153 - 179, North-Holland, 1982. Mohring, C., Algorithm Development in the Calculus of Constructions, Proc. IEEE Symp. on Logic in Computer Science, 1985.
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-209.ps.Z, 19940915 e-mail : fordj@essex.ac.uk Present address: Natural Science Division, Beirut University College, P.O. Box 13{5053, Beirut, Lebanon Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, United Kingdom
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-210.ps.Z, 19940930 CSM-210 page - 1 An Attempt to Map the Performance of a Range of Algorithm and Heuristic Combinations* Edward P. K. Tsang, James E. Borrett, & Alvin C. M. Kwan {edward, jborrett, alvin}@essex.ac.uk Department of Computer Science University of Essex Wivenhoe Park Colchester CO4 3SQ United Kingdom tel:
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-212.ps.Z, 19941003 Round-Pound Arithmetic October 3, 1994 1 CSM-212 Round-Pound Arithmetic Iain MacCallum, macci@essex.ac.uk Department of Computer Science University of Essex. Colchester CO4 3SQ United Kingdom Tel: +44 1206 872791 October 1994
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-217.ps.Z, 19941212 Submitted for Publication in the IEE Colloquium on High Performance Applications of Parallel Architectures held 1.29.4 in London 1 A Programmable-Logic Based Multiprocessor Engine for Real-Time Vision Preprocessing Simon Freeman, Libor Spacek, Victor Callaghan, Paul Chernett University of Essex,
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-222.ps.Z, 19941221 Evacuation: A software strategy to support fault-tolerant transputer systems M J Colley, O A Aghanya and J Standeven Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, CO4 3SQ, UK
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-223.ps.Z, 19941221 An architecture for constructing fault- tolerant transputer systems M J Colley and J Standeven Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, CO4 3SQ, UK
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-219.ps.Z, 19941221 HARDWARE VOTING OF TRANSPUTERS IN REAL-TIME nMR FAULT-TOLERANT SYSTEMS J Standeven, M J Colley. Department of Computer Science, University of Essex, Colchester CO4 3SQ, UK JANet: stanj@uk.ac.essex martin@uk.ac.essex Telephone (International): +44 206 872686/872673
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-220.ps.Z, 19941221 The RaFT Simulation Environment M J Colley, J Standeven and N Chandhakant Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, CO4 3SQ, UK
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-221.ps.Z, 19941221 A Fault-tolerant Pipeline Application for the RaFT System M J Colley, J Standeven and O A Aghanya Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, CO4 3SQ, UK
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-229.ps.Z, 19950104 Quantification in classical planning Sam Steel Dept Computer Science, University of Essex Colchester CO4 3SQ, United Kingdom sam@essex.ac.uk
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-230.ps.Z, 19950105 MODELLING EARLY HUMAN SOCIETY December 19, 1994 1 To appear AISB Quarterly, Winter 94/95 MODELLING EARLY HUMAN SOCIETY Jim Doran Department of Computer Science University of Essex email: doraj@essex.ac.uk 1.0 INTRODUCTION Using computers to simulate naturally occurring societies is a rapidly growing
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-216.ps.Z, 19950106 Fuzzy Hierarchical Control for Autonomous Vehicles Christos Voudouris, Paul Chernett, Chang J. Wang, Vic L. Callaghan Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, UK.
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-207.ps.Z, 19950106 1 To appear in SEDA 94: Innovations in Teaching of Computing Revised:6/28/94 THE BROOKER1 LABORATORY FOR INTELLIGENT EMBEDDED SYSTEMS Victor Callaghan Paul Chernett David Lyons Department of Computer Science University of Essex Wivenhoe Park COLCHESTER CO4 3SQ email robots@essex.ac.uk 1.0 Introduction
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-195.ps.Z, 19950120 To be presented at the 8th Symposium on Computer and Information Sciences 1993 Transformations as Proofs Martin C. Henson, Department of Computer Science, University of Essex, Colchester, Essex, ENGLAND. hensm@uk.ac.sx
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-179.ps.Z, 19950120 Presented at the 7th International Symposium on Computer and Information Science 1992 Transformational Derivation in the Programming Logic TK Martin C. Henson, Department of Computer Science, University of Essex, Colchester, Essex, ENGLAND. Department of Computer Science, University of Otago, Dunedin,
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-196a.ps.Z, 19950120 1 On the Proof Theory of Program Transformations Martin C. Henson Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, England email: hensm@uk.ac.sx, fax: +44 206 872788
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-192.ps.Z, 19950120 1 An Intensional Semantics for Elementary Program Transformations Martin C. Henson Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, England hensm@uk.ac.sx
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-148.ps.Z, 19950120 Safe Positive Induction in the Programming Logic TK Martin C. Henson, Department of Computer Science, University of Essex, Colchester, Essex, ENGLAND. Department of Computer Science, University of Otago, Dunedin, NEW ZEALAND. hensm@uk.ac.sx
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-137.ps.Z, 19950120 Information Loss in the Programming Logic TK by Martin C. Henson, Department of Computer Science, University of Essex, Colchester, England. hensm@uk.ac.sx 1 Introduction In this paper we investigate the topic of information loss in the constructive and intensional theory for programming development TK.
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-214.ps.Z, 19950120 A Case Study Using Timed Transition Diagrams and the HOL Theorem Prover for the Formal Development of a Production Cell Rachel Cardell-Oliver November 29, 1994
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-208.ps.Z, 19950120 Presented at the 9th International Symposium on Computer and Information Sciences 1994 An Experiment in Vernacular Program Derivation Martin C. Henson, Department of Computer Science, University of Essex, Colchester Essex, ENGLAND hensm@essex.ac.uk
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-196b.ps.Z, 19950120 27 z0 N Leaf z0 B Leaf z0fl Leaf z0 = Leaf z0 z0 N Leaf z0 B $x B.x = Leaf z0 z0 N $x B.x = Rotate(Leaf z0) $x B.x = Rotate z1 z0 N Leaf z0 B w B Node(Leaf z0) w B Node(Leaf z0) wfl Node(Leaf z0) w = Node(Leaf z0) w z0 N Leaf z0 B w B Node(Leaf z0) w B $x B.x = Node(Leaf z0) w w = Rotate z1 $x B.x =
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-236.ps.Z, 19950223 Observations on the Usefulness of Arc Consistency Preprocessing James E. Borrett & Edward P. K. Tsang Department of Computer Science University of Essex Wivenhoe Park Colchester CO4 3SQ United Kingdom email: {jborrett, edward}@essex.ac.uk February 1995
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-237.ps.Z, 19950407 PACE: A PROTOTYPE DESIGN T.J.Reynolds, M.E.Waite and F.Z.Ieromnimon Department of Computer Science, University of Essex, Colchester CO4 3SQ, UK telephone +44 206 872680 email @essex.ac.uk
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-232.ps.Z, 19950407 GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement Andrew Davenport, Edward Tsang, Chang J. Wang and Kangmin Zhu Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex CO4 3SQ, United Kingdom.
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-240.ps.Z, 19950428 Implementing Z in Morgan's Refinement Calculus Seyed-Hassan Mirian-Hosseinabadi Department of Computer Science - University of Essex Colchester, CO4 3SQ, UK , Email: seymh@essex.ac.uk April 13, 1995
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-243.ps.Z, 19950601 1 Hardware support for parallel closure operations. S H Lavington, R A Gamble, N E J Dewhurst, D R Thoen and A J Marsh. Department of Computer Science, University of Essex, Colchester CO4 3SQ, UK. E-mail: lavington@essex.ac.uk. ICDE Conference categories: (a) Parallel and distributed database systems
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-231.ps.Z, 19950601 T T T 2-D An important task in computer vision and image processing is to determine the transformation which maps a curve into another. Such transformations are of crucial importance to recognition, motion and tracking. Many methods have been proposed to evaluate the parameters of the transformation of
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-233.ps.Z, 19950602 12 1 1 1 2 By definition, boundaries and regions are dual, one description/representation leads to the other. However, this duality may not be total in places where boundaries connectivity is broken. i.e., 3-D 2-D 2 -D Occlusion constitutes a fundamental part of motion analysis since every realistic
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-225.ps.Z, 19950630 1 Answering N-chain Recursive Queries with Arithmetic Jerome Robinson and Shutian Lin
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-226.ps.Z, 19950630 1 Parallel Computation of Linear Recursive Queries in Knowledge-Based Systems Shutian Lin and Jerome Robinson Department of Computer Science, University of Essex, Colchester CO4 3SQ, U.K. linshu@uk.ac.sx
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-244.ps.Z, 19950719 Simulating Societies using Distributed AI July 19, 1995 1 Paper Presented at Dagstuhl Seminar on Social Science Microsimulation: A Challenge to Computer Science Schloss Dagstuhl, May 1-5, 1995 Simulating Societies using Distributed AI Jim Doran University of Essex Colchester, CO4 3SQ, UK
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-247.ps.Z, 19950905 Guided Local Search Chris Voudouris and Edward Tsang {voudcx,edward}@essex.ac.uk Technical Report CSM-247 August 1995 Department of Computer Science, University of Essex, Colchester, C04 3SQ, UK
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-246.ps.Z, 19950905 Fast Local Search and Guided Local Search and Their Application to British Telecom s Workforce Scheduling Problem Edward Tsang & Chris Voudouris Technical Report CSM-246 Department of Computer Science University of Essex Colchester CO4 3SQ email: {voudcx, edward}@uk.ac.essex August 1995
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-249.ps.Z, 19950906 Function Optimization using Guided Local Search Chris Voudouris and Edward Tsang {voudcx,edward}@essex.ac.uk Technical Report CSM-249 September 1995 Department of Computer Science University of Essex Colchester, CO4 3SQ, UK
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-245.ps.Z, 19950907 Linking Notations and Theories in a Proof Tool Rachel Cardell-Oliver1 and Roger Hale2 1 University of Essex, Department of Computer Science, Wivenhoe Park, Colchester CO4 3SQ, Essex, England 2 SRI International, Cambridge Research Centre, 23 Millers Yard, Mill Lane, Cambridge CB2 1RQ, England
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-250.ps.Z, 19950912 1 Partial Constraint Satisfaction Problems and Guided Local Search Chris Voudouris and Edward Tsang {voudcx,edward}@essex.ac.uk Technical Report CSM-250 September 1995 Department of Computer Science, University of Essex, Colchester, C04 3SQ, UK
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-251.ps.Z, 19951003 Multi-step Quasi-Newton Optimization Algorithms Which Utilize Curvature Information J.A. FORD and I.A. MOGHRABIy Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, United Kingdom yNatural Science Division, American Lebanese University, P.O. Box 13-5053, Beirut,
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-253.ps.Z, 19951013 A Theorem Proving Abstraction of Model Checking Rachel Cardell-Oliver and Chris Southon Department of Computer Science University of Essex October 1995
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-252.ps.Z, 19951019 Using SQL primitives and parallel DB servers to speed up knowledge discovery in large relational databases. A A Freitas and S H Lavington Internal Report CSM-252, October 1995. Paper submitted to EMCSR-96 (Vienna) Department of Computer Science University of Essex Colchester CO4 3SQ UK Tel: 01206 872677
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-257.ps.Z, 19951101 IMPROVED ALGORITHMS OF ILLINOIS-TYPE FOR THE NUMERICAL SOLUTION OF NONLINEAR EQUATIONS J.A. FORD Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, United Kingdom
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/ABSTRACTS.ps.Z, 19951102 University of Essex Department of Computer Science Internal Reports __________________________________________________________________________________ CSM-130 DAVIES, N., Towards a First Order Theory of Reasoning Agents , June 1989. In this paper, we lay the theoretical foundations for a first order
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/INDEX.ps.Z, 19951103 1 University of Essex Department of Computer Science Internal Reports CSM-130 DAVIES, N., Towards a First Order Theory of Reasoning Agents , June 1989. CSM-131 BELL, J., Why the Frame Problem is not a Problem , June 1989. CSM-132 WAITE, M.E., A Procedural Interface for the IFS/1: Version 2", June 1989.
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-256.ps.Z, 19951122 CSM-256 page - 1 Adaptive Constraint Satisfaction: The Quickest First Principle James E. Borrett, Edward P. K. Tsang and Natasha R. Walsh Dept. of Computer Science University of Essex Wivenhoe Park Colchester CO4 3SQ United Kingdom email:{jborrett, edward, walsnq}@essex.ac.uk Technical Report CSM-256
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-263.ps.Z, 19960206 A New Multi-Step Quasi-Newton Method for Unconstrained Optimization J.A. Ford and S.J. Yull Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, United Kingdom
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-264.ps.Z, 19960311 Towards a Formal Framework for Comparing Constraint Satisfaction Problem Formulations James E. Borrett & Edward P. K. Tsang Dept. of Computer Science University of Essex Wivenhoe Park Colchester CO4 3SQ email: {jborrett, edward}@essex.ac.uk Technical Report CSM-264, 6th March 1996
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-268.ps.Z, 19960425 A Behavioural Vision System for Search and Motion Tracking Daniel Livingstone, Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, UK. Libor Spacek, Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, UK.
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-224.ps.Z, 19961023 Constructing Coherent Boundaries T. Rachidi and L. Spacek Department of Computer Science, University of Essex, Colchester C04 3SQ U.K.
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-202.ps.Z, 19961028 Boundary-based Correspondence Computation Using the Topology Constraint T. Rachidi and L. Spacek Department of Computer Science, University of Essex, Colchester C04 3SQ U.K.
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-270.ps.Z, 19961106 AN ALTERNATING MULTI-STEP QUASI-NEWTON METHOD FOR UNCONSTRAINED OPTIMIZATION J.A. Ford y and I.A. Moghrabiz yDepartment of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, CO4 3SQ, United Kingdom zNatural Science Division, Lebanese American University, P.O. Box 13-5053, Beirut,
	ftp://ftp.essex.ac.uk/pub/csc/technical-reports/CSM-271.ps.Z, 19961106 FURTHER DEVELOPMENT OF MINIMUM CURVATURE MULTI-STEP QUASI-NEWTON METHODS FOR UNCONSTRAINED OPTIMIZATION J.A. FORD y and I.A. MOGHRABIz yDepartment of Computer Science, University of Essex, Wivenhoe Park, Colchester, Essex, United Kingdom zNatural Science Division, Lebanese American University, P.O. Box