Now showing items 2164-2183 of 6022

    • The Fallout of Single Glazing under Radiant Heat Exposure 

      WONG, Daniel Liang Wei (University of Canterbury, 2011)
      Glass fallout in windows has the potential to alter the ventilation condition and the behaviour of the fire in a compartment. Therefore, it is of an interest to fire modellers to be able to simulate the behaviour of glass ...
    • 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 ...
    • A Fast 4x4 Forward Discrete Tchebichef Transform Algorithm 

      Nakagaki, K.; Mukundan, R. (University of Canterbury. Computer Science and Software Engineering., 2007)
      The discrete Tchebichef transform (DTT) is a transform method based on discrete orthogonal Tchebichef polynomials, which have applications recently found in image analysis and compression. This letter introduces a new fast ...
    • A Fast Algorithm for Painterly Rendering on Mobile Devices 

      Mukundan, R.; Han, C. (University of Canterbury. Computer Science and Software Engineering., 2008)
      With the rapid growth of mobile graphics applications, non-photorealistic rendering algorithms developed particularly for devices with limited processor capabilities have become important in the areas of games design and ...
    • Fast algorithms and preconditioning techniques for fitting radial basis functions. 

      Mouat, Cameron Thomas (University of Canterbury. Mathematics and Statistics, 2001)
      Radial basis functions are excellent interpolators for scattered data in Rd. Previously the use of RBFs had been restricted to small or medium sized data sets due to the high computational cost of solving the interpolation ...
    • 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 algorithms for shortest paths 

      Moffat, Alistair (University of Canterbury. Computer Science, 1985)
      The problem of finding all shortest paths in a non-negatively weighted directed graph is addressed, and a number of new algorithms for solving this problem on a graph of n vertices and m edges are given. The first of ...
    • A Fast and Accurate Diagnostic Test for Severe Sepsis Using Kernel Classifiers 

      Parente, J.D.; Lee, D.S.; Lin, J.; Chase, J.G.; Shaw, G.M. (University of Canterbury. Mathematics and StatisticsUniversity of Canterbury. Mechanical Engineering, 2010)
      Severe sepsis occurs frequently in the intensive care unit (ICU) and is a leading cause of admission, mortality, and cost. Treatment guidelines recommend early intervention, however gold standard blood culture test results ...
    • Fast Automated Estimation of Variance in Discrete Quantitative Stochastic Simulation 

      Shaw, Nelson (University of Canterbury, 2010)
      Quantitative stochastic simulation is an important tool in assessing the performance of complex dynamic systems such as modern communication networks. Because of the proliferation of computers and devices that use and ...
    • Fast Automated Estimation of Variance in Discrete Quantitative Stochastic Simulation 

      Shaw, Nelson (University of Canterbury, 2012)
      Quantitative stochastic simulation is an important tool in assessing the performance of complex dynamic systems such as modern communication networks. Because of the proliferation of computers and devices that use and ...
    • Fast Automated Estimation of Variance in Discrete Quantitative Stochastic Simulation 

      Shaw, Nelson (University of Canterbury, 2010)
      Quantitative stochastic simulation is an important tool in assessing the performance of complex dynamic systems such as modern communication networks. Because of the proliferation of computers and devices that use and ...
    • 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 Computation of Supertrees for Compatible Phylogenies with Nested Taxa 

      Berry, V.; Semple, C. (University of Canterbury. Mathematics and Statistics., 2006)
      Typically, supertree methods combine a collection of source trees in which just the leaves are labeled by taxa. In such methods the resulting supertree is also leaf labeled. An underlying assumption in these methods is ...
    • Fast decoupled A.C. and A.C./D.C. loadflows. 

      Bodger, P. S. (University of Canterbury. Electrical Engineering, 1977)
      The development of loadflows derived from the basic Newton-Raphson algorithm is reviewed in this thesis with the fast decoupled method emerging as the best in terms of reliability and computation speed. These, and storage ...
    • A Fast Discrete Tchebichef Transform Algorithm for Image Compression 

      Nakagaki, Kiyoyuki (University of Canterbury, 2006)
      The Discrete Tchebichef Transform (DTT) is a transform method based on the scaled orthogonal Tchebichef polynomials, which have applications recently found in image compression and pattern recognition. This report ...
    • Fast Ethernet Readout for Medipix Arrays with MARS-CT 

      Doesburg, R.M.N.; Clyne, M.N.; van Leeuwen, D.; Cook, N.J.; Butler, P.H.; Butler, A.P.H.; MARS-CT Team (University of Canterbury. Electrical and Computer EngineeringUniversity of Canterbury. Physics and Astronomy, 2009)
      The MARS readout is a gigabit ethernet camera for MARS-CT scanners using an array of Medipix photon counting detectors. Six Medipix detectors can be read out at a frame rate of up to 100 Hz. A field programmable gate array ...
    • 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𝜖⃒) ...