Recent Submissions

  • Signal restoration after transmission through an advective and diffusive medium 

    Shorten, P. R.; Wall, D. J. N. (University of Canterbury. Dept. of Mathematics and Statistics, 2002)
    Inverse problem, regularisation, singular perturbation, wave splitting, wave propagators, square root operator, inverse mass transport This paper considers an inverse problem associated with mass transport in a pipe. It ...
  • Quantifying the extent of lateral gene transfer required to avert a 'genome of eden' 

    Van Iersel, L.; Semple, C.; Steel, M. (University of Canterbury. Dept. of Mathematics and Statistics, 2009)
    The complex pattern of presence and absence of many genes across different species provides tantalising clues as to how genes evolved through the processes of gene genesis, gene loss and lateral gene transfer (LGT). The ...
  • Semantic fisheye views 

    Le Comte, D. (University of Canterbury, 1997)
    Visualisation of large quantities of information requires distortion for retention of context and detail. Fisheye views are based on fisheye lenses, which retain detail while introducing greater context. Typically this ...
  • GQL : a graphical query interface for relational databases 

    Naguleswaran, M.; Churcher, N. (University of Canterbury. Dept. of Computer Science, 1989)
    The linear data manipulation languages (DMLs) used to query typical relational databases have a number of practical disadvantages for users of all levels. The aim of graphical query languages is to provide efficiency for ...
  • New Zealand national weeds distribution database : a feasibility study 

    Basse, B.; Bourdôt, G.; Brown, J.; Lamoureaux, S. (University of Canterbury. Dept. of Mathematics and Statistics, 2008)
    Environment Southland (ES) aims to predict the environmental and economic risks posed by particular species of weeds that are already established in the region or that are currently absent but already naturalised elsewhere ...
  • Improving the soundex algorithm in conjunction with Paxus Health Ltd. 

    Thomas, G. (University of Canterbury, 1991)
    Searching a database of people's names is prone to problems from many sources. Some problems are caused by operator errors on the part of the person querying the database, such as using an incorrect spelling for a name ...
  • A derivative-free frame-based conjugate gradients method 

    Coope, I. D.; Price, C. J. (University of Canterbury. Dept. of Mathematics and Statistics, 2002)
    A derivative-free frame-based conjugate gradients algorithm is presented. Convergence is shown for C1 functions, and this is verified in numerical trials. The algorithm is tested on a variety of low dimensional problems, ...
  • Four principles for groupware design : a foundation for participative development 

    Cockburn, A.; Jones, S. (University of Canterbury. Dept. of Computer Science, 1993)
    Participatory design amalgamates the expertise of interdisciplinary specialists with the taskspecific expertise of end-users. Groupware design is widely recognised as benefiting from participative approaches. Recognition ...
  • Photi : a fisheye view of bubbles 

    Churcher, N. I. (University of Canterbury, 1993)
    Fisheye views have recently been employed in a number of application domains to enhance user benefits from graphically presented information. These techniques employ transformations which emphasize regions of interest ...
  • Detecting changes in mean levels with atheoretical regression trees. 

    Cappelli, C.; Reale, M. (University of Canterbury. Dept. of Mathematics and Statistics, 2005)
    In this paper the study of long term changes in lake mean water levels is faced as a problem of detecting multiple structural breaks in the mean occurring at unknown dates. We propose a non parametric approach that ...
  • The lipid bilayer at the mesoscale : a physical continuum model 

    Wilson, P. L.; Huang, H.; Takagi, S. (University of Canterbury. Dept. of Mathematics and Statistics, 2008)
    We study a continuum model of the lipid bilayer based on minimizing the free energy of a mixture of water and lipid molecules. This paper extends previous work by Blom and Peletier (2004) in the following ways. (a) It ...
  • Nature reserve selection problem : a tight approximation algorithm 

    Bordewich, M.; Semple, C. (University of Canterbury. Dept. of Mathematics and Statistics, 2007)
    The Nature Reserve Selection Problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set of regions to conserve so that ...
  • Negative correlation in graphs and matroids 

    Semple, C.; Welsh, D. (University of Canterbury. Dept. of Mathematics and Statistics, 2005)
    The following two conjectures arose in the work of Grimmett and Winkler, and Pemantle: the uniformly random forest F and the uniformly random connected subgraph C of a finite graph G have the edge-negative-association ...
  • Computing the rooted subtree prune and distance is NP-hard 

    Bordewich, M.; Semple, C. (University of Canterbury. Dept. of Mathematics and Statistics, 2004)
    The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the ...
  • A mathematical model for analysis of the cell cycle in human tumour 

    Basse, B.; Baguley, B. C.; Marshall, E. S.; Joseph, W. R.; van Brunt, B.; Wake, G.; Wall, D. J. N. (University of Canterbury. Dept. of Mathematics and Statistics, 2002)
    The growth of human cancers is characterised by long and variable cell cycle times that are controlled by stochastic events prior to DNA replication and cell division. Treatment with radiotherapy or chemotherapy induces ...
  • A convergent variant of the Nelder-Mead algorithm 

    Price, Christopher John; Byatt, David; Coope, Ian D. (University of Canterbury, 2001)
    The Nelder-Mead algorithm (1965) for unconstrained optimization has been used extensively to solve parameter estimation (and other) problems. Despite its age it is still the method of choice for many practitioners in ...
  • A platform for supertree algorithms 

    Daniel, P. J.; Semple, C. (University of Canterbury. Dept. of Mathematics and Statistics, 2004)
    Amalgamating smaller evolutionary trees into a single parent tree is an important task in evolutionary biology. Traditionally, the (supertree) methods used for this amalgamation take a collection of leaf-labelled trees ...
  • A supertree method for rooted trees 

    Semple, Charles; Steel, M. A. (University of Canterbury. Dept. of Mathematics, 1999)
    The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree is a central problem in several areas of classification, particularly evolutionary biology. In this paper, we describe ...
  • Group divisible designs with two associate classes 

    Rodger, C. A.; Fu, H. L.; Sarvate, Dinesh Gopalrao (University of Canterbury. Dept. of Mathematics, 1995)
    The work in this research report was done while visiting The University of Canterbury, and was completed jointly in cooperation with H.L. Fu and D. Sarvate. These results follow upon previous efforts where we were ...
  • Takenings, rames and mills : structures for the modelling of branching 

    Robinson, David Francis (University of Canterbury. Dept. of Mathematics, 1987)
    A takening is a combinatorial structure composed of points and rays. A ray is a finite sequence of at least two points, and two rays have at most one point in common, which must be the foot (initial point) of at least ...

View more