Now showing items 1-20 of 690

    • A 3-approximation algorithm for the subtree between phylogenies 

      Bordewich, M.; McCartin, C.; Semple, C. (University of Canterbury, 2007)
      In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune and regraft distance between two phylogenetic trees. This problem is known to be NP-complete and the best previously known ...
    • Accelerations for a variety of global optimization methods 

      Baritompa, William P. (University of Canterbury. Dept. of Mathematics, 1993)
      Optimization methods for a given class are easily modified to utilize additional information and work faster on a more restricted class. In particular algorithms that use only the Lipschitz constant (e.g. Mladineo, ...
    • Accelerations for global optimization methods that use second derivative information 

      Baritompa, William P.; Cutler, Adele (University of Canterbury. Mathematics, 1993)
      Two new improvements for the algorithm of Breiman & Cutler are presented. Better envelopes can be built up using positive definite quadratic forms. Better utilization of first and second derivative information is attained ...
    • Accumulation phylogenies. 

      Baroni, Mihaela; Steel, M. (University of Canterbury. Dept. of Mathematics and Statistics, 2004)
      Directed acyclic graphs provide a convenient representation of reticulate evolution in systematic biology. In this paper we formalize and analyse a simple model in which evolved characteristics are passed on to all ...
    • Acetylene by electric arc : a report on the feasibility of producing acetylene gas by a high intensity arc process 

      Davies, Clive E. (University of Canterbury. Chemical Engineering, 1978)
      In examining the feasibility of acetylene production from coal by a high intensity arc process, many different aspects of the problem have been investigated. This report briefly notes the work done in different areas, and ...
    • Active network security 

      Verwoerd, T. (University of Canterbury, 1999)
      Most discussions of network security focus on the tools and techniques used to fortify networks: firewalls, biometrics, access controls, encryption. This paper presents an outline of tools that assist an administrator in ...
    • An adaptive scheme for the derivation of harmonic impedance contours 

      Dominguez, M.; Coope, I.D.; Arrillaga, J.; Watson, N.R. (University of Canterbury. Dept. of Mathematics, 1993)
      The aim of this paper is to make the calculation of harmonic impedances accurate and efficient. An adaptive scheme is proposed which minimises the number of frequency samples to be used in the derivation of the ...
    • An adaptive scheme for the efficient calculation of impedance loci 

      Coope, I. D.; Watson, N. R.; Arrillaga, J. (University of Canterbury. Dept. of Mathematics, 1991)
      Impedance loci information is well used by electrical engineers. In power system engineering it is useful too: (i) to see if the addition of static VAR compensation will cause resonance problems; (ii) to enable harmonic ...
    • Addressing uncertainty in braided river bird counts 

      Brown, J.A.; Robinson, T.J. (University of Canterbury. Mathematics and Statistics, 2009)
      When estimating a true population parameter from survey data, there is always some level of uncertainty as a result of imperfect detection, imperfect observation, spatial and temporal variation, and sampling error. In ...
    • Advanced Soil Sampling of Silty Sands in Christchurch 

      Stringer, M.E.; Taylor, M.L.; Cubrinovski, M. (University of CanterburyUniversity of Canterbury. Civil and Natural Resources Engineering, 2015)
    • Advanced Soil Sampling of Silty Sands in Christchurch 

      Stringer, M.E.; Taylor, M.L.; Cubrinovski, M. (University of Canterbury: Civil & Natural Resources EngineeringUniversity of Canterbury. Civil and Natural Resources Engineering, 2015)
      Current research in geotechnical engineering at the University of Canterbury includes a number of laboratory testing programmes focussed on understanding the behaviour of natural soil deposits in Christchurch during the ...
    • Advantages of multivariate analysis of the perception of crowding on the Tongariro Crossing compared with univariate analysis 

      Baldwin, Kathryn (University of Canterbury. Mathematics and Statistics, 2007)
      Multivariate statistical analysis, in particular generalized additive models, is a very powerful approach used to investigate the significant variables that have an impact on crowding. As shown here in the 2005 visitor ...
    • Akaroa 2.5 User's Manual 

      Ewing, G.; Pawlikowski, K.; McNickle, D. (Department of Computer Science, University of CanterburyUniversity of Canterbury. Computer Science and Software EngineeringUniversity of Canterbury. Management, 1998)
      This document describes how to use Akaroa 2, a package for executing quantitative stochastic simulations on multiple processors using the method of Multiple Replications In Parallel (MRIP).
    • Akaroa II Version 1.2.1 User's Manual 

      Ewing, G. (Department of Computer Science, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1996)
      Quantitative stochastic simulation is a useful tool for studying performance of stochastic dynamic systems, but it can consume much time and computing resources. Even with today's high speed processors, it is common for ...
    • Akaroa II Version 2.4.2 User's Manual 

      Ewing, G.; Pawlikowski, K. (Department of Computer Science, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1997)
      Akaroa takes a different approach to parallel simulation, that of multiple replications in parallel or MRIP [1-5]. Instead of dividing up the simulation program, multiple instances of an ordinary serial simulation program ...
    • Algebras for matrix limitation 

      Petersen, Gordon Marshall (University of Canterbury. Dept. of Mathematics, 1977)
      Let A= (a m,n) be a regular matrix; by A is denoted the set of sequences limited by A and by A₀ those sequences limited to zero by A. If 𝜉 = { 𝜉n } is a bounded sequence and { 𝜉n sn } ∈ A₀ whenever {sn} ∈ A₀ ...
    • An algorithm for the quadratic approximation 

      McInnes, A. W.; Loi, S.L. (University of Canterbury. Dept. of Mathematics, 1984)
      The quadratic approximation is a three dimensional analogue of the two dimensional Pade approximation. A determinantal expression for the polynomial coefficients of the quadratic approximation is given. A recursive ...
    • Algorithms For Off-line Clock Synchronization 

      Ashton, P. (Department of Computer Science, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1995)
      Off-line clock synchronisation algorithms, in which synchronisation is performed by adjusting a collection of recorded timestamps, is suitable for use with many monitors for distributed systems. Off-line synchronisation ...
    • Algorithms for sorting nearly sorted lists 

      Wright, J. (University of Canterbury, 1986)
      The following five algorithms for sorting in situ are examined: linear insertion sort, cksort, natural mergesort, ysort and smoothsort. Quicksort and heapsort are also considered although they are not discussed in detail. ...
    • Algorithms for the computation of approximations by algebraic functions 

      McInnes, Allan William (University of Canterbury. Dept. of Mathematics, 1991)
      The application of Pade approximation to problems in mathematical physics was introduced by Balrnr and Gammel (Baker and Gammel (1961)). Pade approximations, the rational analogue of the Taylor polynomial approximation, ...