Browse

ftp://www.cs.monash.edu.au (222)

	ftp://www.cs.monash.edu.au/www/publications/1992/TR165.ps.gz, 19940602 Fast String Alignment with Linear Indel Costs. C. N. Yee and L. Allison, Department of Computer Science, Monash Unive rsity, Australia 3168. email: xxx@cs.monash.edu.au xxx= TECHNICAL REPORTNO: 92/165 July 1992
	ftp://www.cs.monash.edu.au/www/publications/1991/TR155.ps.gz, 19940602 Minimum Message Length Encoding, Evolutionary Trees and Multiple-Alignment. L. Allison, C. S. Wallace and C. N. Yee, Department of Computer Science, Monash University, Australia 3168. xxx@cs.monash.edu.au where xxx = lloyd, csw,cyee Tel: (03) 565 5205 Fax: +61 3 565 5146 Technical Report 91/155
	ftp://www.cs.monash.edu.au/www/publications/1990/TR148.ps.gz, 19940603 Inductive Inference overMacro-Molecules. L.Allison, C.S.Wallace and C.N.Yee. Department of Computer Science, Monash Unive rsity, Australia 3168. November 14, 1990 uucp: xxx@bruce.cs.monash.edu.au xxx= Supported by Australian Research Council grant A48830856 Apreliminary version of this
	ftp://www.cs.monash.edu.au/www/publications/1990/90.03.AIMB.ps.gz, 19940603 Inductive Inference overMacro-Molecules. L. Allison, C. S. Wallace and C. N. Yee. Department of Computer Science, Monash University, Australia 3168. uucp: xxx@bruce.cs.monash.oz.au xxx= Supported by Australian Research Council grant A48830856 1. Introduction. Minimum message length
	ftp://www.cs.monash.edu.au/www/publications/1990/90.04.3str.ps.gz, 19940603 Relating Three Strings by Minimum Message Length Encoding. L. Allison and Du Xiaofeng. Department of Computer Science, Monash University, Australia 3168. uucp: xxx@bruce.cs.monash.oz.au xxx= Supported by Australian Research Council grant A48830856 2c 0.3i 1. Introduction. We apply techniques
	ftp://www.cs.monash.edu.au/www/publications/1993/TR174.ps.gz, 19940610 Stephen Jay Gould on Intelligence Kevin B. Korb Department of Computer Science Monash University Clayton, Victoria 3168 AUSTRALIA korb@bruce.cs.monash.edu.au December 20, 1993
	ftp://www.cs.monash.edu.au/www/publications/1993/tarkpaper.ps.gz, 19940610 Infinitely Many Resolutions of Hempel's Paradox Kevin B. Korb Dept. of Computer Science Monash University Clayton, Victoria 3168 Australia korb@bruce.cs.monash.edu.au November 29, 1993 What man is so mad as wil say the swan is black: or that the raven is in couloure white, when the matter is otherwise
	ftp://www.cs.monash.edu.au/www/publications/1993/TR188.ps.gz, 19940630 The Posterior Probability Distribution of Alignments and its Application to Parameter Estimation of Evolutionary Trees and to Optimisation of Multiple Alignments. L. Allison* &C.S.Wallace TECHNICAL REPORTNO: 93/188 July 1993 email: lloyd@cs.monash.edu.au Partly supported by Australian Research Council
	ftp://www.cs.monash.edu.au/www/publications/1991/TR151.ps.gz, 19940912 -1- SNOB: A PROGRAM FOR DISCRIMINATING BETWEEN CLASSES 1. OVERVIEW The problem addressed by Snob is known variously as "classi cation", "intrinsic classi cation" (to distinguish it from the case when the number and nature of the classes are known a priori), "clustering", "unsupervised pattern
	ftp://www.cs.monash.edu.au/www/publications/1991/TR151.abstract.ps.gz, 19940912 -1- SNOB: A PROGRAM FOR DISCRIMINATING BETWEEN CLASSES J.D. Patrick
	ftp://www.cs.monash.edu.au/www/publications/1994/TR197.ps.gz, 19940915 -1- FAST PSEUDO-RANDOM GENERATORS FOR NORMAL AND EXPONENTIAL VARIATES C.S. Wallace Department of Computer Science, Monash Univeristy,Clayton, Vic.
	ftp://www.cs.monash.edu.au/www/publications/1993/TR193.ps.gz, 19940915 -1- MML Estimation of the von Mises Concentration Parameter C.S. Wallace and D.L. Dowe Department of Computer Science, Monash University, Wellington Road, Clayton, Victoria, 3168, Australia.
	ftp://www.cs.monash.edu.au/www/publications/1992/TR170.ps.gz, 19940915 -1- INFERRING DECISION GRAPHS J. Oliverand C.S. Wallace, Department of Computer Science, Monash University,Clayton, Vic. 3168
	ftp://www.cs.monash.edu.au/www/publications/1991/TR153.ps.gz, 19940915 -1- CODING DECISION TREES C.S. Wallace Department of Computer Science, Monash Univeristy,Clayton, Vic. and J.D. Patrick, Department of Computing and Mathematics, Deakin University,Geelong, Vic.
	ftp://www.cs.monash.edu.au/www/publications/1993/TR190.ps.gz, 19940915 -1- ADECISION TREE MODEL OF BUSHFIRE ACTIVITY David L. Dowe (dld@bruce.cs.monash.edu.au) Department of Computer Science and Noreen Krusel (nkrusel@arts.cc.monash.edu.au) Department of Geographyand Environmental Science Monash University,Clayton, Vic. 3168, Australia
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR92.ps.gz, 19940919 -1- IMPLEMENTING AN ODE SOLVER: A CONSTRAINT LOGIC PROGRAMMING APPROACH J. Harland and S. Michaylov
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR88.ps.gz, 19940919 -1- GENERATING CODE USING A MACHINE DESCRIPTION WITH CONSTRAINTS P. Lim
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR127.ps.gz, 19940919 -1- SINGLE FACTORANALYSIS BY MML ESTIMATION C.S. Wallace and P.R. Freeman
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR95.ps.gz, 19940919 -1- TOWARDS A COMPUTATIONAL MODEL FOR THE GENERATION OF CONTRASTIVE UTTERANCES IN A TUTORING ENVIRONMENT YeeHan Cheong and Ingrid Zukerman
	ftp://www.cs.monash.edu.au/www/publications/1990/TR139.ps.gz, 19940919 -1- DE-BRUIJN INTERCONNECTION NETWORKS C.E. Chewand C.S. Wallace, Department of Computer Science, Monash University,Clayton, Vic. 3168
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR89.ps.gz, 19940919 -1- CAPABILITY ORIENTED ALIASING LANGUAGERATIONALE J. Olszewski ABSTRACT This report describes and motivates Coala, a system programming language which combines facilities to manipulate persistent objects, with a set of parallel programming features. Coala is a machine oriented high levellanguage
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR97.ps.gz, 19940919 -1- APRESCRIPTION FOR PROLOG CONTROL FEATURES BASED UPON DENOTATIONAL SEMANTICS AND ITS IMPLEMENTATION IN STANDARD A. Finlay and L. Allison
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR94.ps.gz, 19940919 -1- QUADRATIC B-SPLINES FOR AUTOMATIC CURVE & SURFACEFITTING Binh Pham ABSTRACT Asimple method for constructing a quadratic B-spline which passes through a givenset of points is described. This technique can be extended to obtain control vertices of a quadratic B-spline surface from a givengrid of
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR90.ps.gz, 19940919 -1- EXCEPTIONS, A MATHEMATICAL SEMANTICS FOR HANDLING FULL JUMPS L. Allison
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR98.ps.gz, 19940919 -1- CONIC BETA-SPLINES WITH LOCAL TENSION CONTROL FOR INTERACTIVE CURVE FITTING Binh Pham
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR91.ps.gz, 19940919 -1- TWOFUNCTIONAL PROGRAMMING TECHNIQUES: CONTINUATIONS, CIRCULAR PROGRAMS L. Allison ABSTRACT Continuations are used in denotational semantics to describe control commands such as jumps. Here it is shown howtheycan be used as a proramming technique to simulate backtracking and coroutines.
	ftp://www.cs.monash.edu.au/www/publications/1990/TR140.ps.gz, 19940919 -1- AN INTER-BUS CONNECTION FOR A CAPABILITY BASED MULTIPROCESSOR C.E. Chewand C.S. Wallace, Department of Computer Science, Monash University,Clayton, Vic. 3168
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR123.ps.gz, 19940919 -1- ALONG-PERIOD PSEUDO-RANDOM GENERATOR C.S. Wallace
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR86.ps.gz, 19940919 -1- PROT OTYPE DIRECTORYSYSTEM USER AGENT - USER'S GUIDE Mark J. Goodwin
	ftp://www.cs.monash.edu.au/www/publications/1990/TR144.ps.gz, 19940919 -1- SINGLE FACTORANALYSIS BY MML ESTIMATION C.S. Wallace and P.R. Freeman
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR47.ps.gz, 19940920 -1- AN IMPROVED PROGRAM FOR CLASSIFICATION C.S. Wallace, Department of Computer Science, Monash University,Clayton, Vic. 3168
	ftp://www.cs.monash.edu.au/www/publications/1993/TR195.ps.gz, 19940920 -1- THREE CONFIGURATIONS OF NETWORK DETECTION FOR BINARY IMAGES OF THE HEXAGONAL GRID Z. J. Zheng
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR48.ps.gz, 19940920 -1- ANAME VALIDATION ALGORITHM FOR PUBLIC DAT A NETWORKS K.J. McDonell ABSTRACT Within Public Data Networks, it will be necessary to provide name servers that inter alia are capable of validating user supplied names for network entities. An algorithm has been proposed (IFIP,1983b) for name validation in
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR44.ps.gz, 19940920 -1- AGENERAL SELECTION CRITERION FOR INDUCTIVE INFERENCE M.P.Georgeff AI Center,SRI International, Menlo Park, CA, USA and C.S. Wallace, Department of Computer Science, Monash University,Clayton, Vic. 3168
	ftp://www.cs.monash.edu.au/www/publications/1993/TR192.ps.gz, 19940920 -1- CRITERIA AND CONSIDERATIONS IN THE SELECTION OF A FIRST PROGRAMMING LANGUAGE DConway
	ftp://www.cs.monash.edu.au/www/publications/1994/TR199.ps.gz, 19940920 -1- SEMANTIC TYPING FOR PARAMETRIC ALGEBRAIC SPECIFICATIONS M. V.Cengarle, M. Wirsing
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR62.ps.gz, 19940920 -1- RESEARCH REPORT, DEPT.OFCOMPUTER SCIENCE MONASH UNIVERSITY Dept. of Computer Science ABSTRACT 1985 Research Report.
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR53.ps.gz, 19940920 -1- THE MONADS ARCHITECTURE: MOTIVATION AND IMPLEMENTATION J. Rosenbergand D. Abramson
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR59.ps.gz, 19940920 -1- TAXONOMY OF SEMANTIC INTEGRITY CONSTRAINTS IN RATIONAL DAT ABASE SYSTEMS Peter W.Goddard
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR45.ps.gz, 19940920 -1- ALOGICAL FOUNDATION FOR PROLOG II J. Jaffar, J-L Lassez and M.J. Maher
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR43.ps.gz, 19940920 -1- ATHEORYOFCOMPLETE LOGIC PROGRAMS WITH EQUALITY J. Jaffar, J-L. Lassez and M.J. Maher
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR46.ps.gz, 19940920 -1- INFERENCE AND ESTIMATION BY COMPACTCODING C.S. Wallace, Department of Computer Science, Monash University,Clayton, Vic. 3168
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR55.ps.gz, 19940920 -1- CANONICAL GREATEST FIXPOINTS OF LOGIC PROGRAMS J. Jaffarand P.Stuckey ABSTRACT This paper is concerned primarily with the greatest xpoints in the functional semantics of logic programs. Wesay that the greatest xpoint of a program P is canonical if its complement is equal to the nite failure set of
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR63.ps.gz, 19940920 -1- EXPERTSYSTEMS VIEWED AS META-LEVEL LOGIC PROGRAMS U. Bonollo
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR60.ps.gz, 19940920 -1- OFFSET B-SPLINES Binh Pham ABSTRACT Asimple and ef cient method is developed for generating offset curves interactively using a set of control knots for a uniform cubic B-spline.
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR52.ps.gz, 19940920 -1- APASSWORD-CAPABILITY SYSTEM M. Anderson, R.D. Pose and C.S. Wallace, Department of Computer Science, Monash University,Clayton, Vic. 3168
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR58.ps.gz, 19940920 -1- ASOFTWARE ENGINEERING APPROACH FOR ODE SOLVERS A.J. Maeder,G.K. Gupta and P.E. Tischer
	ftp://www.cs.monash.edu.au/www/publications/1993/TR191.ps.gz, 19940920 -1- c PROGRAMMING LANGUAGEREFERENCE MANUAL A. J. Hurst, A. S. M. Sajeev
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR54.ps.gz, 19940920 -1- SEMANTICS OF INFINITE TREE LOGIC PROGRAMMING J. Jaffarand P.J. Stuckey
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR56.ps.gz, 19940920 -1- SECURITY MANAGEMENT IN A PASSWORD-CAPABILITY SYSTEM M. Anderson and C.S. Wallace, Department of Computer Science, Monash University,Clayton, Vic. 3168
	ftp://www.cs.monash.edu.au/www/publications/1994/TR198.ps.gz, 19940920 -1- ACALCULUS OF PARAMETERIZATION FOR ALGEBRAIC SPECIFICATIONS M. V.Cengarle, M. Wirsing
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR50.ps.gz, 19940920 -1- ADECISION PROCEDURE FOR THEOREMS ABOUT MULTISETS J. Jaffar
	ftp://www.cs.monash.edu.au/www/publications/1994/TR201.ps.gz, 19940920 -1- THE STYLE: A GUIDE TOWRITING BETTER C PROGRAMS DConway,ADavison, K Lentin (eds)
	ftp://www.cs.monash.edu.au/www/publications/1994/TR196.ps.gz, 19940920 -1- FIRST-ORDER CONSTRAINTS, LAMBDACALCULUS AND THE CHURCH-ROSSER PROPERTY J.N. Crossley, L.Mandel, M. Wirsing
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR77.ps.gz, 19940923 -1- TRANSLATING UPDATEREQUESTS ON USER VIEWS StevenB.Leggand Ken J. McDonell
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR79.ps.gz, 19940923 -1- AN IMPLEMENTATION MODEL FOR INTEGRITY ENFORCEMENT Ka Keung Chan and B. Srinivasan
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR68.ps.gz, 19940923 -1- MONET PERFORMANCE MONITOR - USER'S GUIDE SiewChin Kok and M.S. Madan ABSTRACT This guide describes the operating procedure of the MONET Performance Monitor in suf cient detail to enable the intended user to effectively use the system.
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR82.ps.gz, 19940923 -1- UNIFYING LOGIC PROGRAMMING Jacek Gibert
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR96.ps.gz, 19940923 -1- CONIC B-SPLINES FOR CURVE FITTING: A UNIFYING APPROACH Binh Pham ABSTRACT Ageneral form of conic B-splines which can represent circular,parabolic hyperbolic and elliptical arcs, is discussed. The guided conic splines presented by Pavlidis and Forrest are shown to be special cases of the conic
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR85.ps.gz, 19940923 -1- PARTIALLYINFORMED DISTRIBUTED DAT ABASES: DATA LOCATION ALGORITHM Mark Blakey
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR81.ps.gz, 19940923 -1- AN OVERVIEW OF THE RELATIONAL TEST BED (RTB) KenJ.McDonell
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR36.ps.gz, 19940923 -1- APLANNING SYSTEM USING PROPOSITIONAL DYNAMIC LOGIC C. Stuart
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR83.ps.gz, 19940923 -1- PERFORMANCE AMELIORATION OF INTEGRITY ENFORCEMENT THROUGH PREPROCESSING Ka Keung Chan, Ken J. McDonell and B. Srinivasan
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR65.ps.gz, 19940923 -1- MONET PERFORMANCE MONITOR, DESIGN AND DEVELOPMENT M.S. Madan ABSTRACT The design and the implementation of a performance monitor for Monash University Local Area Network (MONET-PM) is described in this report. The software has monitoring and data analysis systems. The performance monitor uses the
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR33.ps.gz, 19940923 -1- THE IMPLEMENTATION OF HIGHER ORDER FUNCTIONS IN PASCAL G.J. Eddy and M.P.Georgeff
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR35.ps.gz, 19940923 -1- TRANSLATION TEMPLATES FOR UPDATES ISSUED ON RELATIONAL VIEWS Margaret H.C. Chan
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR74.ps.gz, 19940923 -1- CONSTRAINT LOGIC PROGRAMMING J. Jaffa rand J.L. Lassez
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR66.ps.gz, 19940923 -1- SELF-ORGANISING DAT A STRUCTURE FOR NON-UNIFORM ACCESS PATTERNS B. Srinivasan
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR78.ps.gz, 19940923 -1- TRANSLATING UPDATEREQUESTS ON USER VIEWS INVOLVING PROJECTION StevenB.Legg
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR34.ps.gz, 19940923 -1- INTERNATIONAL DEVELOPMENTS IN INFORMATION PRIVACY G.K. Gupta
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR37.ps.gz, 19940923 -1- AN ELEMENTARYMODEL FOR FUNCTIONAL PROGRAMMING AND INFINITE OBJECTS J. Gibert
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR38.ps.gz, 19940923 -1- ACYCLIC METHOD STIFF ODE SOLVER P. Tischer and G.K. Gupta ABSTRACT In this report we describe the design and implementation of a stiffordinary differential equation (ODE) solver which uses two-stage, cyclic linear multistep formulas. The performance of this stiffODE solver was monitored using the
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR75.ps.gz, 19940923 -1- METHODOLOGY AND IMPLEMENTATION OF A CONSTRAINT LOGIC PROGRAMMING SYSTEM J. Jaffarand S. Michaylov
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR112.ps.gz, 19940926 -1- CONTINUATIONS IMPLEMENT GENERATORS AND STREAMS Lloyd Allison
	ftp://www.cs.monash.edu.au/www/publications/1993/TR186.ps.gz, 19940926 -1- COMPOSITIONAL ANALYSIS FOR CONCURRENT CONSTRAINT PROGRAMMING M. Falaschi, M. Gabbrielli, K. Marriott, C. Palamidessi
	ftp://www.cs.monash.edu.au/www/publications/1993/TR185.ps.gz, 19940926 -1- EFFICIENT ANALYSIS OF CONCURRENT CONSTRAINT LOGIC PROGRAMS M. Codish, M. Falaschi, K. Marriott, W.Winsborough
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR29.ps.gz, 19940926 -1- METHODS OF JOINING RELATIONS A.Y.Montgomery and D.J. D'Souza ABSTRACT This report introduces various methods of performing the equi-join and presents, for each method, an outline join cost formula. In deriving the cost formula for each method, a rigorous analysis is not presented; instead, each cost
	ftp://www.cs.monash.edu.au/www/publications/1993/TR183.ps.gz, 19940926 -1- THE LOANS STANDARD MODEL OF CREDIT MONEY L. M. Goldschlager,R.Baxter
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR111.ps.gz, 19940926 -1- AMETHOD OF REPRESENTING CSG-TYPE SOLIDS USING ISOLUMINANCE CONTOURS D.M. Conway and M.S. Cottingham
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR30.ps.gz, 19940926 -1- COMPLETENESS OF THE NEGATION AS FAILURE RULE J. Jaffar, J.L. Lassez and J.W.LLoyd
	ftp://www.cs.monash.edu.au/www/publications/1993/TR189.ps.gz, 19940926 -1- OPTIMAL PREDICTORS FOR IMAGE COMPRESSION P. Tischer
	ftp://www.cs.monash.edu.au/www/publications/1993/TR194.ps.gz, 19940926 -1- AN EFFICIENT SCHEME OF SIMPLE NETWORK DETECTION FOR BINARYIMAGES OF THE HEXAGONAL GRID Z. J. Zheng
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR27.ps.gz, 19940926 -1- FUNCTIONAL PASCAL: AN EXTENSION OF PASCAL TO HIGHER ORDER FUNCTIONS M.P.Georgeffand G. Eddy
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR28.ps.gz, 19940926 -1- APROPOSAL FOR THE DEVELOPMENT OF THE DEPARTMENT OF COMPUTER SCIENCE ATMONASH UNIVERSITY M.P.Georgeffand G.K. Gupta
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR113.ps.gz, 19940926 -1- IMPAIRMENT INVALIDAT ION: A COMPUTAT IONAL MODEL FOR THE GENERATION OF A CLASS OF RHETORICAL DEVICES I. Zukerman and Y.H. Cheong
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR32.ps.gz, 19940926 -1- AGENERAL OBJECTIVE FOR INDUCTIVE INFERENCE C.S. Wallace and M.P.Georgeff, Department of Computer Science, Monash University,Clayton, Vic. 3168
	ftp://www.cs.monash.edu.au/www/publications/1993/TR187.ps.gz, 19940926 -1- SEMANTICS FOR CLP PROGRAMS WITH OPTIMIZATION K. Marriott, P.J.Stuckey
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR31.ps.gz, 19940926 -1- HARDWA RE SUPPORTFOR PROGRAM DEBUGGERS IN A PAGED VIRTUAL MEMORY D. Abramson and J. Rosenberg
	ftp://www.cs.monash.edu.au/www/publications/1993/TR184.ps.gz, 19940926 -1- PRECISE AND EFFICIENT GROUNDNESS ANALYSIS FOR LOGIC PROGRAMS K. Marriott, H. Sondergaard
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR61.ps.gz, 19940928 -1- LOGIC PROGRAM SEMANTICS FOR PROGRAMMING WITH EQUATIONS J. Jaffarand P.J. Stuckey
	ftp://www.cs.monash.edu.au/www/publications/1994/TR209.ps.gz, 19950118 Four arbitration circuits: Analysis and comparison Vincent Fazio
	ftp://www.cs.monash.edu.au/www/publications/1991/TR156.ps.gz, 19950118 -1- ANEW CONVEXITY INDEX FOR TOPOLOGICAL ANALYSIS OF GRAPHS Z.H. Zheng
	ftp://www.cs.monash.edu.au/www/publications/1994/TR210.ps.gz, 19950118 Stochastic Assembly of Genomic Restriction Maps Darren M. Platt and Tre vor I. Dix Department of Computer Science, Monash University Clayton 3168 Melbourne Victoria Australia. darrenp@cs.monash.edu.au and trevor@cs.monash.edu.au Ke ywords: restriction mapping, model, statistics, stochastic search,
	ftp://www.cs.monash.edu.au/www/publications/1991/TR157.ps.gz, 19950118 -1- GENERATIONS AND SELECTION OF PROBABLE INTERPRETATIONS DURING PLAN RECOGNITION IN TASK-ORIENTED CONSULTATION SYSTEMS B. Raskutti and I. Zukerman
	ftp://www.cs.monash.edu.au/www/publications/1994/TR200.ps.gz, 19950118 PARSING VISUAL LANGUAGES S. S. Chok and K. Marriott
	ftp://www.cs.monash.edu.au/www/publications/1992/TR160.ps.gz, 19950118 -1- SEMANTIC JUSTIFICATION FOR 4NF IN RELATIONAL DATABASE DESIGN M. Vincent and B. Srinivasan
	ftp://www.cs.monash.edu.au/www/publications/1994/TR215.ps.gz, 19950118 Conceptual Difficulties with the Efficient Market Hypothesis: Towards a Naturalized Economics David L. Dowe and Kevin B. Korb Dept. of Computer Science Monash University Clayton, Victoria 3168 Australia dld@bruce.cs.monash.edu.au korb@bruce.cs.monash.edu.au
	ftp://www.cs.monash.edu.au/www/publications/1992/TR167.ps.gz, 19950118 -1- ADISTRIBUTED IMPLEMENTATION OF C-WITH-EASE T. MacKenzie and T.I. Dix
	ftp://www.cs.monash.edu.au/www/publications/1992/TR164.ps.gz, 19950118 -1- ON A NEW APPROACH TOSNR ESTIMATION FOR IMAGE RESTORATION S. Suthaharan and S. Ray
	ftp://www.cs.monash.edu.au/www/publications/1992/TR168.ps.gz, 19950118 -1- AFAST ALGORITHM FOR ALIGNMENT OF THREE STRINGS L. Allison ABSTRACT Ukkonen's(pair-wise) string alignment technique is extended to the problem of nding an optimal alignment for three strings. The resulting algorithm has worst-case time-complexity O(nd2)and space-complexity O(d3), where the string
	ftp://www.cs.monash.edu.au/www/publications/1992/TR165.abstract.ps.gz, 19950118 -1- FAST STRING ALIGNMENT WITH LINEAR INDEL COSTS C.N. Yee and L. Allison
	ftp://www.cs.monash.edu.au/www/publications/1993/chok.abstract.ps.gz, 19950118 ATOOL TOSUPPORTSTEPWISE ENHANCEMENT IN PROLOG LSterling and S S Chok
	ftp://www.cs.monash.edu.au/www/publications/1992/TR162.ps.gz, 19950118 -1- RECONSTRUCTION OF STRINGS PAST C.N. Yee and L. Allison
	ftp://www.cs.monash.edu.au/www/publications/1994/TR212.ps.gz, 19950118 COMPUTER BASED LIFE POSSIBILITIES AND IMPOSSIBILITIES Alan Dorin
	ftp://www.cs.monash.edu.au/www/publications/1992/TR169.ps.gz, 19950118 -1- GENERATING CONCISE DISCOURSE THATADDRESSES AUSER'S INFERENCES I. Zukerman and R. McConachy
	ftp://www.cs.monash.edu.au/www/publications/1994/TR211.ps.gz, 19950118 TWO CLASSES OF BOOLEAN FUNCTIONS FOR DEPENDENCY ANALYSIS Tania Armstrong, Kim Marriott, Peter Schachte and Harald Sondergaard
	ftp://www.cs.monash.edu.au/www/publications/1992/TR163.ps.gz, 19950118 -1- ADECISION GRAPH EXAMPLATION OF PROTEIN SECONDARYSTRUCTURE PREDICTION D.L. Dowe, J. Oliver, L.Allison, C.S. Wallace & T.I. Dix
	ftp://www.cs.monash.edu.au/www/publications/1992/TR158.ps.gz, 19950118 -1- SOLVING LINEAR SYSTEMS WITH PERTURBED COEFFICIENT MATRICES P. Tischer
	ftp://www.cs.monash.edu.au/www/publications/1992/TR161.ps.gz, 19950118 -1- REDUNANCY AND FOURTH NORMAL FORM IN RELATIONAL DAT ABASES M. Vincent and B. Srinivasan
	ftp://www.cs.monash.edu.au/www/publications/1992/TR159.ps.gz, 19950118 -1- PROPOSAL FOR THE FUTURE IMPLEMENTATION OF THE MONASH IMAGE LIBRARY D. Chatterton, D. Conway and M. Goodwin
	ftp://www.cs.monash.edu.au/www/publications/1995/TR216.ps.gz, 19950327 NetRep An object-oriented tool for representing networks TamT.Lien
	ftp://www.cs.monash.edu.au/www/publications/1994/TR207.ps.gz, 19950327 MDL and MML: Similarities and Differences (Introduction to Minimum Encoding Inference - Part III) Rohan A. Baxter and Jonathan J. Oliver
	ftp://www.cs.monash.edu.au/www/publications/1995/TR218.ps.gz, 19950327 -1- MULTIPLE FACTORANALYSIS BY MML ESTIMATION C.S. WALLACE
	ftp://www.cs.monash.edu.au/www/publications/1995/korb1.ps.gz, 19950504 Symbolic Rules and Neural Networks: AI Back at a Join Point Kevin B. Korb Dept. of Computer Science Monash University Clayton, Victoria 3168 Australia korb@bruce.cs.monash.edu.au May 2, 1995
	ftp://www.cs.monash.edu.au/www/publications/1995/TR217.ps.gz, 19950504 -1- Classes of functions with Integer Derivativesatx= 1 David L. Dowe
	ftp://www.cs.monash.edu.au/www/publications/1995/korb2.ps.gz, 19950504 psycoloquy.95.6.15.robot-consciousness.10.korb Sunday 30 April 1995 ISSN 1055-0143 (19 paragraphs, 10 references, 559 lines) PSYCOLOQUY is sponsored by the American Psychological Association (APA) PERSONS AND THINGS: Book Review of Bringsjord on Robot Consciousness Kevin B. Korb Dept. of Computer
	ftp://www.cs.monash.edu.au/www/publications/1995/TR222/TR222.ps.Z, 19950508 The Walnut Kernel: User Level Programmer's Guide Maurice Castro1 TECHNICAL REPORT NO. 95/222 May 1995 1Computer Science, Monash University, Clayton, Victoria 3186, AUSTRALIA maurice@cs.monash.edu.au
	ftp://www.cs.monash.edu.au/www/publications/1994/TR203.ps.gz, 19950809 -1- NEGATIVE BOOLEAN CONSTRAINTS Kim Marriott and Martin Odersky
	ftp://www.cs.monash.edu.au/www/publications/1995/TR219.ps.gz, 19950809 -1- ON PRUNING AND AVERAGING DECISION TREES Jonathan J. Oliver&David J. Hand
	ftp://www.cs.monash.edu.au/www/publications/1995/TR220.ps.gz, 19950809 A Functional Specification System for Information Systems L.L. Dawson Department of Computer Science, Monash University lindad@cs.monash.edu.au S.K. Milton School of Management Information Systems, Deakin University milton@deakin.edu.au C.D. Keen Department of Computer Science, University of Tasmania
	ftp://www.cs.monash.edu.au/www/publications/1993/TR178.ps.gz, 19950816 -1- AN OPTIMIZING METHOD FOR STRUCTURING INFERENTIALLYLINKED DISCOURSE I. Zukerman, R. McConachy
	ftp://www.cs.monash.edu.au/www/publications/1991/TR155a.ps.gz, 19950816 -1- MINIMUM MESSAGE LENGTH ENCODING, EVOLUTIONARY TREES AND MULTIPLE-ALIGNMENT L. Allison, C.S. Wallace and C.N. Yee
	ftp://www.cs.monash.edu.au/www/publications/1993/TR181.ps.gz, 19950816 -1- UPDATEANOMALIES AND 4NF IN RELATIONAL DATABASES - THE MVD CASE M. W.Vincent, B. Srinivasan
	ftp://www.cs.monash.edu.au/www/publications/1993/TR176.ps.gz, 19950816 -1- ANECESSARYCONDITION OF BLOCK EDGE DETECTIONS AND HIERARCHICAL REPRESENTATIONS OF THE KERNEL FORM OF THE HEXAGONAL GRID Z. J. Zheng
	ftp://www.cs.monash.edu.au/www/publications/1993/TR182.ps.gz, 19950816 -1- SPATIAL QUERYOPTIMIZATION: FROM BOOLEAN CONSTRAINTS TORANGE QUERIES R. Helm, K. Marriott, M. Odersky
	ftp://www.cs.monash.edu.au/www/publications/1993/TR179.ps.gz, 19950816 -1- DENOTATIONAL ABSTRACT INTERPRETATION OF LOGIC PROGRAMS K. Marriott, H. Sondergaard, N. D. Jones
	ftp://www.cs.monash.edu.au/www/publications/1993/TR175.ps.gz, 19950816 -1- THE CONJUGATE TRANSFORMATION AND THE REVERSION FOR THE HEXAGONAL GRID Z.J. Zheng
	ftp://www.cs.monash.edu.au/www/publications/1992/TR171.ps.gz, 19950816 -1- ASELF-CONTAINED DYNAMICALLYRECONFIGURABLE PROCESSOR ARCHITECTURE Michael Saleeba
	ftp://www.cs.monash.edu.au/www/publications/1994/TR202a.ps.gz, 19950816 DEPARTMENT OF COMPUTER SCIENCE TR94/202 Curry-Howard terms for Linear Logic David Albrecht, Frank A. Bauerle, John N. Crossleyand John S. Jeavons
	ftp://www.cs.monash.edu.au/www/publications/1994/TR205.ps.gz, 19950816 -1- INTRODUCTION TOMINIMUM ENCODING INFERENCE Jonathan J. Oliverand David Hand ABSTRACT This paper examines the minimum encoding approaches to inference, Minimum Message Length (MML) and Minimum Description Length (MDL). This paper was written with the objective o f providing an introduction to this
	ftp://www.cs.monash.edu.au/www/publications/1994/TR202b.ps.gz, 19950816 Curry{Howard terms for Linear Logic David Albrecht1;2;4 Frank A. B auerle3;4 John N. Crossley1;2 and John S. Jeavons1
	ftp://www.cs.monash.edu.au/www/publications/1993/TR174a.ps.gz, 19950816 -1- STEPHEN JAY GOULD ON INTELLIGENCE Kevin B. Korb
	ftp://www.cs.monash.edu.au/www/publications/1991/TR154.ps.gz, 19950816 -1- TOWARDS A SYSTEM FOR THE GENERATION OF COOPERATIVE RESPONSES IN INFORMATION SEEKING ENVIRONMENTS Ingrid Zukerman
	ftp://www.cs.monash.edu.au/www/publications/1992/TR173.ps.gz, 19950816 -1- DECISION GRAPHS - AN EXTENSION OF DECISION TREES J. Oliver
	ftp://www.cs.monash.edu.au/www/publications/1992/TR172.ps.gz, 19950816 -1- GENERATING QUERIES DURING COOPERATIVE CONSULTATIONS B. Raskutti and I. Zukerman
	ftp://www.cs.monash.edu.au/www/publications/1993/TR177.ps.gz, 19950816 -1- ACONSTRAINT LOGIC PROGRAMMING FRAMEWORK FOR CONSTRUCTINTG DNARESTRICTION MAPS R. Yap, H. Chuan
	ftp://www.cs.monash.edu.au/www/publications/1993/TR180.ps.gz, 19950816 -1- AN X WINDOW-BASED CHINESE-ENGLISH DICTIONARYSYSTEM Y. Zeng, J. N. Crossley
	ftp://www.cs.monash.edu.au/www/publications/1994/TR206.ps.gz, 19950816 MML and Bayesianism: Similarities and Differences (Introduction to Minimum Encoding Inference \| Part II) Jonathan J. Oliver and Rohan A. Baxter
	ftp://www.cs.monash.edu.au/www/publications/1991/TR149.ps.gz, 19950816 -1- AN OVERFLOWTECHNIQUE TODEFER SPLITTING IN B-TREES B. Srinivasan
	ftp://www.cs.monash.edu.au/www/publications/1991/TR150.ps.gz, 19950816 -1- AN ALTERNATIVE SHADING MODEL FOR BEZIER AND B-SPLINE SURFACEPATCHES USING SUBDIVISION Binh Pham
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR129.ps.gz, 19950919 -1- CONSTRAINT CHECKING METHOD FOR MULTIPLE ENZYMES IN RESTRICTION SITE MAPPING ShirleyT.Ho, C.N. Yee, L. Allison & T.I. Dix
	ftp://www.cs.monash.edu.au/www/publications/1990/TR137.ps.gz, 19950919 -1- MODELLING HUMAN LIMB MUSCLES IN MOVEMENT Isadora W.Y.Lee and B. Pham
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR132.ps.gz, 19950919 -1- ACONSTRAINT LOGIC PROGRAMMING SHELL P. Lim and P.J. Stuckey
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR126.ps.gz, 19950919 -1- MINIMUM MESSAGE LENGTH ENCODING AND THE COMPARISON OF MACROMOLECULES L. Allison and C.N. Yee
	ftp://www.cs.monash.edu.au/www/publications/1990/TR135.ps.gz, 19950919 -1- DOMAINS FOR META-PROGRAMMING P. L im and D. Morley ABSTRACT Lloyd and Hill (2) have examined the vanilla meta-interpreter and found that there is some dif culty in describing the semantics of the program because the meta-program and the object program operate overdifferent domains. This paper
	ftp://www.cs.monash.edu.au/www/publications/1990/TR148a.ps.gz, 19950919 -1- INDUCTIVE INFERENCE OVER MACRO-MOLECULES L. Allison, C.S. Wallace and C.N. Yee
	ftp://www.cs.monash.edu.au/www/publications/1990/TR146.ps.gz, 19950919 -1- PERFORMANCE SIMULATION OF SOME POSSIBLE MULTIPROCESSOR INTER-BUS CONNECTION NETWORKS C.E. Chew
	ftp://www.cs.monash.edu.au/www/publications/1990/TR143.ps.gz, 19950919 -1- MULTILISTS AS IMAGE HISTOGRAM REPRESENTATIONS AnthonyJ.Maeder
	ftp://www.cs.monash.edu.au/www/publications/1990/TR136.ps.gz, 19950919 -1- SPECIAL INTEREST GROUP DAY O NIMAGE PROCESSING AND ANALYSIS A.J. Maeder ABSTRACT Abstract of talks at the Special Interest Group Day at the 13th Australian Computer Science Conference.
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR133.ps.gz, 19950919 -1- SHORTEST PATHAND CLOSURE ALGORITHMS FOR BANDED MATRICES L. Allison, T.I. Dix and C.N. Yee ABSTRACT Afast algorithm is givenfor the all-pairs shortest paths problem for banded matrices having band-width b.Itsolves the negative-cycle problem and calculates all path lengths within the band in O (
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR124.ps.gz, 19950919 -1- COMPUTERS IN SOCIETY M.S. Cottingham, L.M. Goldschlager,A.J. Maeder & R.T.Worley
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR121.ps.gz, 19950919 -1- IMAGE SEGMENTATION FOR COMPLEX NATURAL SCENES A.P.Choo, A.J. Maeder & B. Pham
	ftp://www.cs.monash.edu.au/www/publications/1990/TR145.ps.gz, 19950919 -1- ATEXTUAL HYPERTEXT TOOLKIT IN X K.S. O'Yang, L.M. Goldschlager and B. Srinivasan
	ftp://www.cs.monash.edu.au/www/publications/1995/TR230.ps.gz, 19950919 TR95/230 The Walnut Kernel: program implementation under the Walnut Kernel by MCastro, G Pringle and C S Wallace
	ftp://www.cs.monash.edu.au/www/publications/1990/TR147.ps.gz, 19950919 -1- FINITE QUANTIFIERS IN PROLOG Paula Ross
	ftp://www.cs.monash.edu.au/www/publications/1990/TR138.ps.gz, 19950919 -1- ANIMATION TECHNIQUES FOR CHAIN-CODED OBJECTS A.J. Maeder
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR130.ps.gz, 19950919 -1- THREE-DIMENSIONAL QUEENS PROBLEMS L. Allison, C.N. Yee and M. McGaughey
	ftp://www.cs.monash.edu.au/www/publications/1990/TR142.ps.gz, 19950919 -1- METAPROGRAMMING AS CONSTRAINT PROGRAMMING P. Lim and P.J. Stuckey
	ftp://www.cs.monash.edu.au/www/publications/1990/TR141.ps.gz, 19950919 -1- MANAGEMENT SUPPORTSYSTEMS AND EXPERTSYSTEMS: CONTRASTS AND COMPARISONS Paul N. Finlay
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR120.ps.gz, 19950919 -1- ASIMPLE MIMD SYSTEM FOR PARALLEL COMPUTING P. Sember & A.J. Maeder ABSTRACT Asimple multiple processor MIMD computer system which can use from 2 to 8 processor elements based on the Intel 8086 microprocessor is described. This report provides an outline of the system architecture and a programming
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR131.ps.gz, 19950919 -1- ON META-PROGRAMMING IN CLPS P. L im and D. Morley
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR122.ps.gz, 19950919 -1- ATYPE-INTENSIVE MULTISTEP CODE FOR ORDINARY DIFFERENTIAL EQUATIONS P. Tischer
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR125.ps.gz, 19950919 -1- AUTOMATIC NEPHANALYSIS FROM INFRARED GMS DAT A Y.HChong, B. Pham, M. Manton & A. Maeder
	ftp://www.cs.monash.edu.au/www/publications/1995/TR232r.ps.gz, 19951116 Program Extraction for Full Linear Logic1 David Albrecht Department of Computer Science Monash University Australia dwa@bruce.cs.monash.edu.au John N. Crossley Department of Computer Science Monash University Australia jnc@bruce.cs.monash.edu.au John S. Jeavons Department of Mathematics Monash
	ftp://www.cs.monash.edu.au/www/publications/1994/carlo1.ps.gz, 19951211
	ftp://www.cs.monash.edu.au/www/publications/1994/carlo2.ps.gz, 19951211
	ftp://www.cs.monash.edu.au/www/publications/1995/Carlo1.ps.gz, 19951211
	ftp://www.cs.monash.edu.au/www/publications/1995/Carlo2.ps.gz, 19951211
	ftp://www.cs.monash.edu.au/www/publications/1996/TR252.ps.gz, 19960122 The MML Evolution of Classification Graphs Julian Neil and Kevin B. Korb Department of Computer Science Monash University Clayton, Victoria 3168 Australia fjrn,korbg@cs.monash.edu.au January 15, 1996
	ftp://www.cs.monash.edu.au/www/publications/1996/TR264.ps.gz, 19960507 On the Simulation of Postmodernism and Mental Debility using Recursive Transition Networks Andrew C. Bulhak Department of Computer Science, Monash University April 1, 1996
	ftp://www.cs.monash.edu.au/www/publications/1994/TR202.ps.gz, 19960507 Curry{Howard terms for Linear Logic David Albrecht1;2;4 Frank A. B auerle3;4 John N. Crossley1;2 and John S. Jeavons1
	ftp://www.cs.monash.edu.au/www/publications/1995/tr237.ps.gz, 19960508 CIRCULAR CLUSTERING BY MINIMUM MESSAGE LENGTH OF PROTEIN DIHEDRAL ANGLES David L. Dowe, Lloyd Allison, Trev orI.Dix, * Lawrence Hunter, Chris S. Wallace, TimothyEdgoose Department of Computer Science,Monash University, Clayton, Victoria 3168, Australia * National Library of Medicine,Bldg.38A, 9th floor,
	ftp://www.cs.monash.edu.au/www/publications/1995/kelly1.ps.gz, 19960513 An Optimizing Compiler for CLP(R) Andrew D. Kelly1, Andrew Macdonald2, Kim Marriott1, Harald Sondergaard2, Peter J. Stuckey2, Roland H.C. Yap1;2 1 Dept. of Computer Science, Monash University, Clayton 3168, Australia. 2 Dept. of Computer Science, The University of Melbourne, Parkville 3052, Australia.
	ftp://www.cs.monash.edu.au/www/publications/1996/271.ps.gz, 19960807 Program extraction, simplified proof-terms and realizability David Albrecht1 and John N. Crossley2 fdwa,jncg@cs.monash.edu.au 1 Introduction This paper forms part of a programme for extracting programs from proofs. Many people have done such work. What distinguishes our work is that our aim is to start
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR119.ps.gz, 19960813 -1- APPLICATIONS OF RECURSIVELYDEFINED DAT A STRUCTURES L. Allison ABSTRACT Acircular program contains a data structure whose de nition is self-referential or recursive.Use of such a de nition allows ef cient functional programs to be written that would not otherwise be possible. A novelprimes program
	ftp://www.cs.monash.edu.au/www/publications/1996/tr258.ps.gz, 19960813 Optimizing Compilation of Constraint Logic Programming Languages Andrew D. Kelly Andrew Macdonaldy Kim Marriott Peter J. Stuckeyy Roland H.C. Yapz
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR117.ps.gz, 19960813 -1- RESTRICTION SITE MAPPING FOR THREE OR MORE ENZYMES S.T.S. Ho, C.N. Yee & L. Allison
	ftp://www.cs.monash.edu.au/www/publications/1996/tr267.ps.gz, 19960813 A Comparison of the Effectiveness of Optimizations in a CLP(R) Compiler Andrew D. Kelly Andrew Macdonaldy Kim Marriott Peter J. Stuckeyy Roland H.C. Yapz
	ftp://www.cs.monash.edu.au/www/publications/1996/TR268.ps.gz, 19960814 A Comparison of Three Occur-Check Analysers Lobel Crnogorac Andrew D. Kellyy Harald Sondergaard
	ftp://www.cs.monash.edu.au/www/publications/1996/274.ps.gz, 19960820 A Generic Object-Oriented Incremental Analyser for Constraint Logic Programs Andrew D. Kelly Kim Marriott Harald Sondergaardy Peter J. Stuckeyy
	ftp://www.cs.monash.edu.au/www/publications/1996/tr96_260.ps.gz, 19970122 An Algorithm for Finding a Maximum Clique in a Graph David R. Wood 1 Department of Computer Science, Monash University Wellington Road, Clayton VIC 3168, Australia
	ftp://www.cs.monash.edu.au/www/publications/1996/tr96_286.ps.gz, 19970122 On Higher-Dimensional Orthogonal Graph Drawing David R. Wood Department of Computer Science, Monash University Wellington Road, Clayton VIC 3168, Australia. davidw@cs.monash.edu.au
	ftp://www.cs.monash.edu.au/www/publications/1997/TR318/policy.ps.gz, 19970513 A Statement on Higher Education Policy in Australia Kevin B. Korb, Carlo Kopp and Lloyd Allison Dept. of Computer Science Monash University Clayton, Victoria 3168 Australia fkorb,carlo,lloydg@cs.monash.edu.au Summary Policy on higher education in Australia has become highly political since the massive
	ftp://www.cs.monash.edu.au/www/publications/1996/TR288.ps.gz, 19970514 -1- MINIMIZING STATIC ROUTE HOT-SPOTS FOR THE MONASH SECURE RISC MULTIPROCESSOR VJFazio
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR110.ps.gz, 19970514 -1- EXPRESSIVE BRUSH STROKES Binh Pham
	ftp://www.cs.monash.edu.au/www/publications/1996/TR283.ps.gz, 19970514 -1- AFACIAL MOTION SYNTHESISTER FOR TEXT-TO-SPEECH SYSTEMS D. Conway,S.Welsh
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR106.ps.gz, 19970514 -1- ASIMPLE PROBLEM SOLVING LANGUAGE(SPSL) - LANGUAGEDEFINITION KenJ.McDonell ABSTRACT SPSL is a simple problem solving language designed for a rst programming course. The language borrows from other procedural languages (e.g. Fortran, Pascal and C) although SPSL is characterized by its syntactic and
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR108.ps.gz, 19970514 -1- DISSOLVE: A SYSTEM FOR THE GENERATION OF HUMAN ORIENTED SOLUTIONS TOALGEBRAIC EQUATIONS Jonathan Oliverand Ingrid Zukerman
	ftp://www.cs.monash.edu.au/www/publications/1996/TR282.ps.gz, 19970514 -1- ENERGY CONSERVA T IVE RE-ENVELOPING OF SAMPLED SOUND D. Conway
	ftp://www.cs.monash.edu.au/www/publications/1996/TR281.ps.gz, 19970514 -1- COMPARISON OF THE QUADTREE AND TERNARYTREE REPRESENTATIONS OF BINARY HYPERIMAGES C.Wilson, B.Srinivasan, S.Ray
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR100.ps.gz, 19970514 -1- PARTIALLYINFORMED DISTRIBUTED DAT ABASES: UPDATEDISTRIBUTION ALGORITHM Mark Blakey
	ftp://www.cs.monash.edu.au/www/publications/1996/TR280.ps.gz, 19970514 -1- TOPOLOGICAL OPERATIONS ON HYPERIMAGES REPRESENTED BY HIERARCHICAL DAT A STRUCTURES C. Wilson, B. Srinivasan, S. Ray
	ftp://www.cs.monash.edu.au/www/publications/1996/TR276.ps.gz, 19970514 -1- MODEL SELECTION IN LINEAR REGRESSION USING THE MML CRITERION RABaxter,DLDowe
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR104.ps.gz, 19970514 -1- INSTRUCTIONAL SQL (ISQL) USER'S GUIDE KenJ.McDonell ABSTRACT ISQL is an interpreter for a subset of the SQL language (with basic similarity to the common SQL dialects, namely SEQUEL - 21,Unify SQL2 and the ISO Draft Standard SQL3 ). The Instructional SQL (ISQL) language and its interpreter provide
	ftp://www.cs.monash.edu.au/www/publications/1996/TR253.ps.gz, 19970514 The Survivalofthe Computer as a Creative Tool Alan Dorin Department of Computer Science Monash University Clayton 3168 Victoria, Australia aland@cs.monash.edu.au
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR103.ps.gz, 19970514 -1- CAPABILITY ORIENTED ALIASING LANGUAGEINFORMAL DEFINITION Jacek Olszewski ABSTRACT This report de nes Coala, a higher levelmachine-oriented language for manipulation of persistent objects, with a set of parallel programming features. The language syntax is giveninExtended Backus-Naur Form and its
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR102.ps.gz, 19970514 -1- ANEW ORDER SELECTION STRATEGY FOR ORDINARY DIFFERENTIAL EQUATION SOLVERS Peter Tischer
	ftp://www.cs.monash.edu.au/www/publications/1996/TR289.ps.gz, 19970514 -1- CONSTRAINED GRAPH LAYOUT W.He, K. Marriott
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR109.ps.gz, 19970514 -1- SELECTION AND MANIPULATION OF COLOR SUBSETS USING B-SPLINES Binh Pham
	ftp://www.cs.monash.edu.au/www/publications/1996/TR284.ps.gz, 19970514 -1- CONFLUENCE IN CONCURRENT CONSTRAINT PROGRAMMING M.Falaschi, M. Gabbrielli, K. Marriott, C. Palamidessi
	ftp://www.cs.monash.edu.au/www/publications/1996/TR277.ps.gz, 19970514 -1- MULTIPLE DISPATCH IN C++ AND JAV A D.F.Chatterton, D.M.Conway
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR115.ps.gz, 19970514 -1- ASTRUCTURED CODE FOR SOLVING ODE PROBLEMS AnthonyJ.Maeder
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR101.ps.gz, 19970514 -1- PC/IP MONET INTERFACEREPORT T. PKwok, M.S. Madan and R. Sawyer
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR116.ps.gz, 19970514 -1- AGENERAL PURPOSE ODE SOLVER IMPLEMENTATION AnthonyJ.Maeder
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/39.ps.gz, 19970515 -1- PERITUS ASYSTEM THATAIDS THE CONSTRUCTION OF PROCEDURAL EXPERTSYSTEMS Umberto Bonollo and Michael P.Georgeff
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR57.ps.gz, 19970515 -1- IMPLEMENTATION OF A NAME VALIDATION FUNCTION FOR HIERARCHICALLYDISTRIBUTED DIRECTORYSERVICES Kiat Nyook Chong
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/26.ps.gz, 19970515 -1- TRANSFORMATIONS AND REDUCTION STRATEGIES FOR TYPED LAMBDAEXPRESSIONS M.P.Georgeff
	ftp://www.cs.monash.edu.au/www/publications/1990/144.ps.gz, 19970515 SINGLE FACTORANALYSIS BY MML ESTIMATION C.S. Wallace and P.R. Freeman
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR69.ps.gz, 19970515 -1- E-ASMALL CSP LIKE LANGUAGEIMPLEMENTED UNDER UNIX Pierre Lim
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/19.ps.gz, 19970515 -1- DOCUMENTATION FOR A BIBLIOGRAPHIC MAINTENACESYSTEM KenJ.McDonell
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/18.ps.gz, 19970515 -1- THE USE OF STRATEGIES IN CONSTRAINING SEARCH M.P.Georgeff
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR80.ps.gz, 19970515 -1- PARTIALLYINFORMED DISTRIBUTED DAT ABASES: CONCEPTUAL FRAMEWORK AND KNOWLEDGE MODEL Mark Blakey
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/16.ps.gz, 19970515 -1- THE NATURE OF COMMUNITY DAT A MODEL EVOLUTION R.W.Topor
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/40.ps.gz, 19970515 -1- SOME NEW CYCLIC LINEAR MULTISTEP FORMULAS FOR STIFF SYSTEMS P. E. Tischer and G.K. Gupta
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR76.ps.gz, 19970515 -1- MANIPULATION OF DAT A STRUCTURES WITHOUT POINTERS A.S.M. Sajeevand J. Olszewski
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/41.ps.gz, 19970515 -1- PROPAGATED ERROR BEHAVIOUR OF MULTISTEP FORMULAS Peter E. Tischer
	ftp://www.cs.monash.edu.au/www/publications/1996/278.ps.gz, 19970515 -1- ANEW APPROACH TOCLUSTERING-BASED COLOUR IMAGE SEGMENTATION R.H.Turi, S.Ray
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/23.ps.gz, 19970515 -1- DESCRIPTION AND EVALUATION OF A STIFF ODE CODE DSTIFF G.K. Gupta
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/TR134.ps.gz, 19970515 -1- AUTOMATIC BINARYTREE CLOUD CLASSIFICATION Y.H. Chong, M.J. Manton, B. Pham and A.J. Maeder
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/17.ps.gz, 19970515 -1- FUNCTIONAL PROGRAMS FOR GENERATING PERMUTATIONS R.W.Topor
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/99.ps.gz, 19970515 -1- POLYNOMIAL-TIME PROPOSITIONAL LOGIC John N. Crossleyand Philip J. Scott ABSTRACT We propose an extension to conventional propositional logic which has applications to the interaction of PROLOG and other logic programming languages with databases. Ke ywords: Logic programming.
	ftp://www.cs.monash.edu.au/www/publications/1971-1989/42.ps.gz, 19970515 -1- EFFICIENT UNIFICATION OVER INFINITE TERMS Joxan Jaffar