Now showing items 222-241 of 693

    • A family of 2-dimensional Minkowski planes with small automorphism groups 

      Steinke, Günter F. (University of Canterbury. Dept. of Mathematics, 1994)
      This paper concerns 2-dimensional (topological locally compact connected) Minkowski planes. It uses a construction of J. Jakóbowski [4] of Minkowski planes over half-ordered fields and applies it to the field of reals. ...
    • A family of Minkowski planes over half-ordered fields 

      Steinke, G.F. (University of Canterbury. Dept. of Mathematics, 1996)
      This paper concerns a construction of J. Jakóbowski [7] of Minkowski planes over half-ordered fields. A more group theoretic definition of such planes is given. Isomorphisms between and automorphisms of these Minkowski ...
    • Fast algorithms for model based therapeutics 

      Lawrence, Piers (University of Canterbury. Mathematics and Statistics, 2007)
      In critical care tight control of glucose has been shown to lead to better clinical outcomes and reductions in length of stay. The need arises to develop new protocols for maintaining tight control of patients' glucose. ...
    • Fast computation of compatibility for phylogenies with nested taxa 

      Berry, Vincent; Semple, Charles (University of Canterbury, 2005)
      Typically, supertree methods combine a collection of source trees in which just the leaves are labelled by taxa. In such methods the resulting supertree is also leaf-labelled. An underlying assumption in these methods is ...
    • Fast evaluation of radial basis functions : methods for four-dimensional polyharmonic splines 

      Cherrie, J. B.; Beatson, R. K.; Ragozin, D. L. (University of Canterbury. Department of Mathematics & Statistics, 2000)
      As is now well known for some basic functions ϕ, hierarchical and fast multipole like methods can greatly reduce the storage and operation counts for fitting and evaluating radial basis functions. In particular for spline ...
    • 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 ...
    • Fast evaluation of radial basis functions : moment based methods 

      Beatson, Richard Keith; Newsam, G.N. (University of Canterbury. Dept. of Mathematics, 1995)
      In this paper we introduce a new algorithm for fast evaluation of univariate radial basis functions of the form s(x) = Σᶰn₌₁ dn𝜙(⃒x - xn⃒) to within accuracy 𝜖. The algorithm has a setup cost of 𝜙(N⃒log𝜖⃒log⃒log𝜖⃒) ...
    • 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 ...
    • Fast peephole optimization techniques 

      McKenzie, B. (University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 1988)
      Techniques for increasing the throughput of a peephole optimizer for intermediate code are presented. An analysis of the optimations to be performed enables an efficient matching and replacement algorithm to be found ...
    • Fast Self-Similar Teletraffic Generation Based on FGN and Inverse DWT 

      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, 1999)
      It is generally accepted that self-similar (or fractal) processes may provide better models of teletra c in modern computer networks than Poisson processes. Thus, an important requirement for conducting simulation studies ...
    • Fast Ziv-Lempel decoding using RISC architecture 

      Jaggar, David Vivian (University of Canterbury, 1989)
      Compression is becoming more important as more information is stored on, and transferred between computers. Some applications of compression require high throughput, such as the access to a hard disk drive or a Local ...
    • A few logs suffice to build (almost) all trees (I) 

      Erdős, Péter L.; Steel, M.A.; Székely, L.A. (University of Canterbury. Dept. of Mathematics, 1997)
      A phylogenetic tree (also called an "evolutionary tree") is a leaf-labelled tree which represents the evolutionary history for a set of species, and the construction of such trees is a fundamental problem in biology. ...
    • Fibonacci numbers and some applications to digital image scrambling 

      Williams, Benjamin (University of Canterbury. Mathematics and Statistics, 2007)
      An analysis of some recently proposed methods of digital image scrambling that use Fibonacci numbers. This report describes the mathematics required to understand why these methods work.
    • Fibres and fires : the role of textiles in fires 

      Hammond, Lyndon; Statham, Darrell (University of Canterbury. Civil Engineering, 1992)
      Textiles are an intimate and prevalent part of our daily activities and life. This explains the frequency of textile-related fires and the many deaths and injuries that result. Natural fibre textiles may be broken into ...
    • Finding a maximum compatible tree is NP-hard for sequences and trees 

      Hamel, A. M.; Steel, M. A. (University of Canterbury. Dept. of Mathematics, 1994)
      We show that the· following two related problems arising in phylogenetic analysis are NP-hard: (i) given a collection of aligned 2-state sequences, find a largest subset of sequences compatible with some tree, (ii) ...
    • Finite Möbius near-planes 

      Steinke, Günter F. (University of Canterbury. Dept. of Mathematics, 1998)
      We introduce finite Möbius near-planes of order n and show that these planes uniquely extend to Möbius planes of the same order if n ≥ 5. Furthermore, Mobius near-planes of order n ≤ 4 are discussed and the situation for ...
    • Fire after earthquake. 

      Rahmanian, Faran; Ismail, Iqbal (University of Canterbury. Civil, 1992)
      Fire following earthquakes have caused the largest single loss due to earthquakes and in most cases have caused more damage than the quake itself. This problem is regarded very seriously in Japan and in some parts of ...
    • Fire Design of Single Storey Industrial Buildings 

      Cosgrove, B W (University of Canterbury. Civil Engineering, 1996)
      This report aims to establish a design methodology for meeting basic fire safety objectives within single storey industrial buildings using a 'common-sense' approach. A wide range of fire safety issues are addressed, ranging ...
    • Fire Rated Seismic Joints 

      James, M N (University of Canterbury. Civil Engineering, 2000)
      This report reviews the design, selection testing, installation and performance of fire rated seismic joints from first principles then compares this with current standards and codes of practice around the world. It ...
    • Fire Resistance of Prestressed Concrete 

      Griffin, Mike; Beavis, Brian (University of Canterbury. Civil Engineering, 1992)
      In summary some general comments can be made about prestressed concrete in fire. The main problem is the amount of cover required to protect the steel from reaching excessive temperatures. This is also the main problem ...