Now showing items 623-642 of 693

    • Tabulation of thin plate splines on a very fine two-dimensional grid 

      Powell, Michael James David (University of Canterbury. Dept. of Mathematics, 1992)
      A thin plate spline approximation has the form [FORMULA] where {⋋j ∈ R, : j = 1,2, ... , n} and {xj ∈ R² : j = 1, 2, ... , n} are parameters and where p is a linear polynomial. There exist several applications that ...
    • Tag clouds in software visualisation. 

      Deaker, Chris; Churcher, Neville; Warwick, Irwin (University of Canterbury. Computer Science and Software Engineering, 2011)
      Software visualisation employs techniques from the more general information visualisation field to help software engineers comprehend and manage the size and complexity of software systems. In this paper, we explore the ...
    • Tailoring Feedback in ITSs 

      Rajendra, Danny (University of Canterbury. Computer Science, 2000)
      The most effective way for students to learn is face-to-face with a qualified tutor. Intelligent Tutoring Systems (ITS) aim to provide a learning experience that approaches the standard of learning with a human tutor. This ...
    • 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 ...
    • A Taxonomy of Network and Computer Attack Methodologies 

      Hansman, Simon Luke (University of Canterbury. Computer Science and Software Engineering, 2003)
      Since the invention of computers and networks, people have found various ways to attack them. Attacks over the years have ranged from using a sledge hammer on a computer, to advanced distributed denial of service attacks. ...
    • Teaching computers to see 

      Bycroft, Brendan (University of Canterbury. Mathematics and Statistics, 2009)
      A program was created which enabled 3D reconstruction of a scene given two images from a simple camera. This was achieved using a combination of linear algebra and homogeneous coordinates. The reconstruction was separated ...
    • Tellabs network monitor : project report 

      Weir, Lindsay Brian (University of Canterbury, 1991)
      The Mount Cook Group Ltd operate a nation-wide commercial and tour group computer network. The network consists of two central computers, the NCR 9400 and 9500 series mini computers together supporting about 150 terminals. ...
    • Tellabs network monitor : source code listing 

      Weir, Lindsay Brian (University of Canterbury, 1991)
      To install the Tellabs Network Monitor simply run the INST ALL.BAT batch file. This reads (by default) from the original source disk in drive B: and writes to the destination hard drive on drive C:. If any changes ...
    • Tellabs network monitor : user manual 

      Weir, Lindsay Brian (University of Canterbury, 1991)
      The Tellabs Network Monitor is a software tool which allows the network manager to: • configure node, link and channel names for inclusion into reports, • produce statistical reports on the network performance, and ...
    • Text Compression Evaluation 

      Arnold, Ross (University of Canterbury. Mathematics and Statistics, 1996)
      Data Compression is a set of techniques aiming to represent information with less data. It is used in the areas of information storage and transmission. Text Compression is a subset of data compression dealing with lossless ...
    • Theme-Based Literate Programming 

      Kacofegitis, A.; Churcher, N. (Department of Computer Science & Software Engineering, University of CanterburyUniversity of Canterbury. Computer Science and Software Engineering, 2002)
      The source code for computer programs is destined to be read by compilers and consequently its internal structure is heavily constrained. The compiler neither knows nor cares about such things as a program’s internal ...
    • A time domain algorithm for reflection of waves on a viscoelastically supported Timoshenko beam 

      Billger, D. V. J.; Wall, D. J. N. (University of Canterbury. Dept. of Mathematics, 1997)
      This paper presents a time domain algorithm for solving the direct wave scattering problem for a Timoshenko beam. The beam is assumed to be made of a homogeneous material and to be restrained by a viscoelastic suspension ...
    • A tool for measuring the effectiveness of university computing services 

      Chen, M (University of Canterbury, 1978)
      The primary aim of this project is to develop a general tool for use in such a comparative investigation. In this process, a pilot study carried out at the University of Canterbury tested hypotheses about user characteristics, ...
    • Topological geometry 

      Lightfoot, Ash (University of Canterbury. Mathematics and Statistics, 2009)
      One may topologise an incidence structure by imposing that the operations of joining points and intersecting lines are continuous. This project investigates two different approaches to this. We first show that with respect ...
    • Torsion points on y²=x⁶+1 

      Voloch JF (1997)
      Let C be the curve y²=x⁶+1 of genus 2 over a field of characteristic zero. Consider C embedded in its Jacobian J by sending one of the points at infinity on C to the origin of J. In this brief note we show that the ...
    • Towards a formal framework for JavaBeans and Enterprise JavaBeans 

      Lee, Kwang Wu (University of Canterbury. Department of Computer Science, 2001)
      This project aims to provide a framework for the formal specification of JavaBeans and Enterprise JavaBeans (EJB), Sun Microsystems' component technology. We develop a list of properties that distinguishes beans from a ...
    • Towards a theory of holistic clustering 

      Dress, Andreas (University of Canterbury. Dept. of Mathematics, 1997)
      In this note, cluster theory is presented from a rather abstract point of view, basic known results are reviewed from this view point, and some new results which motivated the proposed approach, as well as some new ...
    • Towards better estimation: Improving and supporting the estimation process in agile team environments 

      Picard, Cade (University of Canterbury, 2015)
      Estimation occurs when a team of developers approximate how much of each resource (e.g. time, effort) an item (e.g. projects, stories and tasks) will take to complete to a specific standard. The success of a project depends ...
    • Towards modern literature programming 

      Smith, Matthew (University of Canterbury. Department of Computer Science, 2001)
      Literate programming was invented by Donald Knuth as a technique for improved documentation of program understanding. It involves writing code and documentation in a single source document, ordered for comprehension by ...
    • Towards pure adaptive search 

      Baritompa, William P.; Mladineo, R.H.; Wood, G.R.; Zabinsky, Z.B.; Baoping, Zhang (University of Canterbury. Dept. of Mathematics, 1993)
      The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity. In this paper we temper it to a framework we term Somewhat Adaptive Search. This retains the desirable complexity, but ...