Now showing items 77-96 of 693

    • A Calculus Based on Absence of Actions 

      Krishnan, P. (Department of Computer Science, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1995)
      In this article we present a process algebra where the behaviour can be specified when certain actions cannot be exhibited. This is useful in specifying time outs, interrupts etc. We present a few properties which form ...
    • The CARToptimizer package version 1.0 user's guide 

      Robertson, B.L.; Price, C. J.; Reale, M. (University of Canterbury. Dept. of Mathematics and Statistics, 2012)
      The CARToptimizer package is a suite of MATLAB functions for solving numerical optimization problems. The suite has algorithms for local, global and constrained optimization problems, where the objective function can be ...
    • Cascade algorithm revisited. 

      Takaoka, Tadao; Umehara, Kiyomi (University of Canterbury. Computer Science and Software Engineering, 2014)
      We revisit the cascade algorithm for the all pairs shortest path (APSP) problem. The operation on the distace data is limited to the triple oper- ation of min{a, b + c}. The best known complexity on this model is n3 by ...
    • A Case Study in Specifying and Testing Architectural Features 

      Krishnan, P. (Department of Computer Science, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1993)
      This paper studies the specification and testing of two main architectural features. We consider restricted forms of instruction pipelining and parallel memory models present in the SPARC specification. The feasibility ...
    • Causal diagrams for I(1) structural VAR models 

      Tunnicliffe Wilson, Granville; Reale, M. (University of Canterbury, 2002)
      Structural Vector Autoregressions allow dependence among contemporaneous variables. If such models have a recursive structure, the causal relation among the variables can be represented by directed acyclic graphs. The ...
    • A central limit theorem for parsimony length of trees 

      Steel, M. A.; Goldstein, Larry J.; Waterman, Michael S. (University of Canterbury. Dept. of Mathematics, 1994)
      In phylogenetic analysis it is useful to study the distribution of parsimony length of a tree, under the null model by which the leaves are independently assigned letters according to prescribed probabilities. Except in ...
    • A chain theorem for matroids 

      Oxley, J.; Semple, C.; Whittle, G. (University of Canterbury, 2006)
      Tutte's Wheels-and-Whirls Theorem proves that if M is a 3-connected matroid other than a wheel or a whirl, then M has a 3-connected minor N such that |E(M)| - |E(N)| = 1. Geelen and Whittle extended this theorem by showing ...
    • 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 ...
    • A characterization of Newton maps. 

      Berger, Arno; Hill, Theodore P. (University of Canterbury. Department of Mathematics and Statistics, 2005)
      Conditions are given for a l map T to be a Newton map, that is, the map associated with a differentiable real-valued function via Newton's method. For finitely differentiable maps and functions, these conditions can ...
    • Circle fitting by linear and nonlinear least squares 

      Coope, Ian D. (University of Canterbury. Dept. of Mathematics, 1992)
      The problem of determining the circle of best fit to a set of points in the plane (or the obvious generalisation ton-dimensions) is easily formulated as a nonlinear total least squares problem which may be solved using ...
    • Class Construction and Student Allocation 

      Chang, Dennis P. (University of Canterbury. Computer Science, 1980)
      Each year in every secondary school, days or even weeks are spent in constructing a school timetable. At present, this is done by senior staff (whose time could be better spent on something else) , since timetable construction ...
    • A classification of Minkowski planes over half-ordered fields 

      Steinke, Günter F. (University of Canterbury. Dept. of Mathematics, 1999)
      This paper concerns a construction of Minkowski planes over half-ordered fields [5] and [20]. Solving various functional equations the Klein-Kroll types of these Minkowski planes are determined with respect to G- and ...
    • Classifying and counting linear phylogenetic invariants for the Jukes Cantor model 

      Steel, M. A.; Fu, Y. X. (University of Canterbury. Dept. of Mathematics, 1994)
      Linear invariants are useful tools for testing phylogenetic hypotheses from aligned DNA/RNA sequences, particularly when the sites evolve at different rates. Here we give a simple, graph theoretic classification, for ...
    • A cluster reduction for computing the subtree distance between phylogenies 

      Linz, Simone; Semple, Charles (University of Canterbury, 2008)
      Calculating the rooted subtree prune and regraft (rSPR) distance between two rooted binary phylogenetic trees is a frequently applied process in various areas of molecular evolution. However, computing this distance is ...
    • Coalescent experiments I: Unlabeled n-coalescent and the site frequency spectrum 

      Sainudiin, R.; Thornton, K.; Griffiths, R.; McVean, G.; Donnelly, P. (Department of Mathematics & StatisticsUniversity of Canterbury. Mathematics and Statistics, 2009)
      We derive the transition structure of a Markovian lumping of Kingman’s n-coalescent [1, 2]. Lumping a Markov chain is meant in the sense of [3, def. 6.3.1]. The lumped Markov process, referred as the unlabeled n-coalescent, ...
    • Coalescent experiments II: Markov bases of classical population genetic statistics 

      Sainudiin, R.; Thornton, K.; Booth, J.; Stillman, M.; Yoshida, R. (Department of Mathematics & StatisticsUniversity of Canterbury. Mathematics and Statistics, 2009)
      Evaluating the likelihood function of parameters in complex population genetic models from extant deoxyribonucleic acid (DNA) sequences is computationally prohibitive. In such cases, one may approximately infer the parameters ...
    • Code optimisation for the NZTAB Pascal compiler 

      Douthwaite, Ian M. (University of Canterbury, 1983)
      The aim of this project was optimisation of the code produced by the NZTAB Pascal compiler. This compiler is used for almost all the code in the TAB's nationwide betting system. The desire to improve the performance of ...
    • Collaborative Software Engineering: An Annotated Bibliography 

      Cook, C. (Department of Computer Science and Software Engineering, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 2004)
      This work is intended to be a useful starting point for those researching the field of Collaborative Software Engineering (Cse). We list research articles related to current Cse tools, models and discussions, as well as ...
    • A Comparative Study of Generators of Synthetic Self-Similar Teletraffic 

      Jeong, H-D.J.; McNickle, D.; Pawlikowski, K. (Department of Computer Science and Management, University of CanterburyUniversity of Canterbury. Computer Science and Software EngineeringUniversity of Canterbury. Management, 1998)
      It is generally accepted that self-similar (or fractal) processes may provide better models for teletraffic in modern telecommunication networks than Poisson processes. If this is not taken into account, it can lead to ...