Recent Submissions

  • A modula-2 cross-compiler for the Macintosh. 

    Gifford, Jonathan (University of Canterbury, 1986)
    There is a Modula-2 cross-compiler available on the Prime, which currently generates code for the Prime. This cross-compiler was developed at ETH (Eidgenössische ...
  • Fast evaluation of radial basis functions : methods for generalised multiquadrics in ℝⁿ 

    Cherrie, J. B.; Beatson, Richard Keith; Newsam, G.N. (University of Canterbury, 2000)
    A generalised multiquadric radial basis function is a function of the form s(x) = ∑ᴺ𝑖₌₁ 𝑑𝑖 𝜙 (𝗅x-t𝑖𝗅), where 𝜙(r) = (r² + 𝝉²)ᵏ/², x ∈ ℝⁿ, and k ∈ Z is odd. The direct evaluation of an N centre generalised ...
  • Experiments in high precision clock synchronisation. 

    Jones, Richard (University of Canterbury, 1993)
    Hardware clocks used in computers tend to drift away from the correct time. In a distributed computer system, each hardware clock drifts away from the correct time at a different rate. In or4er to synchronise the clocks ...
  • Melody recognition systems. 

    Ansley, Carl (University of Canterbury, 1994)
    The aim for this project was to research, design, and provide the basis of an implementation for a real-time melody recognition system. The system should match music hummed or sung by a human with a particular piece in ...
  • Full chess retrieval 

    McKenzie, Peter (University of Canterbury, 1994)
    Most chess programs utilise simple memory-based techniques that compliment the brute force search. These techniques utilise stored positions to increase program performance. The ability to efficiently store and retrieve ...
  • Exposing 3-separations in 3-connected matroids. 

    Oxley, James; Semple, Charles; Whittle, Geoff (2009)
    Let 𝑀 be a 3-connected matroid other than a wheel or a whirl. In the next paper in this series, we prove that there is an element whose deletion from 𝑀 or 𝑀∗ is 3-connected and whose only 3- separations are equivalent ...
  • Spanning and sampling in Lebesgue and Sobolev spaces 

    Bui, Huy-Qui; Laugesen, R. S. (University of Canterbury, 2004)
    We establish conditions under which the small-scale affine system {𝜓(𝑎j 𝑥 - 𝑘) : j ≥ J, 𝑘 ∈ℤᵈ}, with J∈ℤ fixed, spans the Lebesgue space 𝐿ᵖ(ℝᵈ) and the Sobolev space 𝑊ᵐ,ᵖ(ℝᵈ), 1 ≤ 𝑝 < ∞. The dilation matrices 𝑎j ...
  • OASIS : an object oriented animation system in Scheme. 

    Munnings, Peter (University of Canterbury, 1987)
    The main aim of this project is to develop an animation system for simple geometric objects. Of course this is not a very clear definition of what is required. While working on this project, the objectives to be reached ...
  • A review of monitoring low density animal populations 

    Brown, Jennifer A. (University of Canterbury, 2002)
    One of the most important steps in designing a monitoring programme is to have very clear objectives. The objectives should define what is the state of the environment desired by managers, over what time frame, in what ...
  • Encoding phylogenetic trees in terms of weighted quartets 

    Grünewald, S.; Huber, Katharina T.; Moulton, Vincent; Semple, C. (University of Canterbury, 2006)
    For a finite set X, an edge-weighted phylogenetic X -tree, or phylogenetic tree for short, is a tree T having leaf set X and no degree 2 vertices, together with a map from the edge set of T to ℝ≥₀. Within the field of ...
  • Design and Implementation of a TROFF postprocessor for Typesetting on a Printronix 300 

    Verdellen, A.M. (University of Canterbury, 1983)
    The aim of this project is to design and implement a program that accepts the output from the TROFF package and produces the equivalent of phototypesetter output on the Printronix. Since the Printronix when operating in ...
  • User interfaces for casual users 

    Farrow, C.D. (University of Canterbury, 1993)
    The first part of this report presents various ideas and principles in human-computer interaction (HCI) and relates them to the casual use situation. Much research and literature on the topic deals with HCI in general, ...
  • Implementation of fast file transfers between microcomputers and the Computer Centre Network Exchange 

    Cranness, M. (University of Canterbury, 1984)
    The purpose of this project is to Investigate methods for fast file transfer between microcomputers and the computer centre (CCTR) network at the University of Canterbury, to ease the process of writing file transfer ...
  • Fast kriging 

    Beatson, Richard Keith; Mouat, Cameron Thomas (University of Canterbury, 2000)
    This paper presents a fast technique for fitting a Kriging surface of the form s(·) = ∑j𝛼jΦ (·-xj)+ ∑ᵐj=1 ⋎jqj(·), where <Φ is a semi-variogram determined from the data. Finding the coefficients of s by conventional ...
  • EM for the Data Eclipse S/130 

    Joe, Robert (University of Canterbury, 1985)
    The aim or this project was to develop a back end for EM with the Data General Eclipse S/ 130 as the target machine, and consequently to bring up the Pascal-VU complier running under DG UNIX.
  • Tellabs network monitor : user manual 

    Weir, Lindsay Brian (University of Canterbury, 1991)
    The Tellabs Network Monitor is a software tool which allows the network manager to: • configure node, link and channel names for inclusion into reports, • produce statistical reports on the network performance, and ...
  • Parallel text compression : source 

    Nevill, C. (University of Canterbury, 1989)
  • Parallel text compression 

    Nevill, C. (University of Canterbury, 1989)
    Parallel texts come in two forms: either the two texts are in the same language, or in two different languages. The most common origin of a pair of parallel texts is some translation process. A text may be available in ...
  • Chaos from simplicity : an introduction to the double pendulum 

    Chen, Joe (University of Canterbury, 2008)
    The fusion of two pendulums give rise to a simple mechanical system that on contrary to its deceptively simple appearances exhibit extremely unpredictable and complex behaviour. The equations of motion for the simple ...
  • A characterization for a set of partial partitions to define an X-tree 

    Semple, Charles; Steel, M. A. (University of Canterbury, 1999)
    Trees whose vertices are partially labelled by elements of a finite set X provide a natural way to represent partitions of subsets of X. The condition under which a given collection of such partial partitions of X can ...

View more