Recent Submissions

  • 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 ...
  • Social presence on the internet 

    Bosley, Ian (University of Canterbury, 1994)
    The purpose of this project is research methods of providing a low level awareness of the presence and activity of colleagues. This functionality should be independent of geographic proximity, without requiring specialist ...
  • N-S chart honours project report : a Nassi-Scneiderman cartographer 

    Couch, A. B. (University of Canterbury, 1988)
    This project involved the development of N-S Chart; a NassiShneiderman Cartographer for the Apple Macintosh. N-S Chart is a tool for drawing and maintaining Nassi-Shneiderman diagrams, and incorporates the beneficial ...
  • Distortion Oriented Workspace Awareness In Collaborative Writing 

    Weir, P. (University of Canterbury, 1996)
    In order to use groupware applications effectively a sense of workspace awareness is required. Distortion oriented visualisation techniques, such as fisheye lenses, have been proposed as a means of achieving this awareness. ...
  • A guide to schema design methods : a supplementary technical report to "a survey of a database technique" 

    Neil, S. (University of Canterbury, 1988)
    In this document some of the major different schools of schema design methods will be outlined. This is important because the different schools, and different specific examples of these schools, will be referred to in ...
  • DB drafter : a bubble diagrammer for database design 

    Wilson, R. P. (University of Canterbury, 1989)
    Many of the methods and models so far developed for database schema design have proved to be complex, highly theoretical in nature, and often have NP complete aspects. The method investigated in this project [Smith 1985] ...
  • IN-browser : a graphical browser for interaction networks 

    Thoo, L. C. (University of Canterbury, 1991)
    The Interaction Network (IN) is a way of representing the execution of an interaction in a loosely-coupled distributed system. Much work has been put into the development and refinement of command-line programs to record ...
  • A natural language database interface for SQL-tutor 

    Knowles, S. (University of Canterbury, 1999)
    An investigation into integrating a database Natural Language Processing (NLP) component into the SQL-Tutor Intelligent Tutoring System (ITS) is presented. Tailor-made NLP systems created by a programmer, and NLP ...
  • A study of line reduction methods for interactive computer mapping 

    Peter, Smith (University of Canterbury, 1987)
    With the increasing availability of powerful graphics workstations, interactive computer mapping systems are becoming more and more popular. The art of map making is thousands of years old and much is still relevant, However, ...
  • Scientist's workbook 

    JasonSmith, Michael (University of Canterbury, 1999)
    This project discusses the scientist's workbook, a system designed to assist scientists' in their work. An overview of similar systems, such as the Memex and Xanadu, is presented. The results of a series of interviews ...
  • 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 ...
  • Graphical tool for SC automata 

    Haslett, L. (University of Canterbury, 2000)
    SC automata are a variation of timed automata which are closed under complementation. The major difference is SC automata have both history clocks which represent the time since some event occurred in the past and ...
  • An assembly language trainer on the Macintosh 

    Chong, K. F. (University of Canterbury, 1987)
    The COSC-1 Assembly Language Simulator running on the Micro Network was developed as a tool for teaching the basics of computer structure and assembly language programming. COSC-1 fs a simple computer of complexity about ...
  • GPSS/750 simulation system 

    Ting, C. K. (University of Canterbury, 1982)
    In the field of software engineering, it is now recognized that proper language design can greatly improve the reliability, clarity, ease of implementation and maintenance of software written in that language. Two ...
  • Selecting taxa to save or sequence : desirable criteria and a greedy solution 

    Bordewich, M.; Rodrigo, A. G.; Semple, C. (University of Canterbury, 2007)
    Three desirable properties for any method of selecting a subset of evolutionary units (EUs) for conservation or for genomic sequencing are discussed. These properties are: spread, stability, and applicability. We are ...
  • Supertree algorithms for ancestral divergence dates and nested taxa 

    Semple, C.; Daniel, P.; Page, R. D. M.; Hordijk, W.; Steel, M. (University of Canterbury, 2003)
    Most supertree methods use just leaf-labelled phylogenetic trees to infer the resulting supertree. In this paper, we describe several new supertree algorithms that extend the allowable information that can be used for ...
  • Recovering a phylogenetic tree using pairwise closure operations 

    Huber, K. T.; Moulton, V.; Semple, C.; Steel, M. (University of Canterbury, 2003)
    A fundamental task in evolutionary biology is the amalgamation of a collection P of leaf-labelled trees into a single parent tree. A desirable feature of any such amalgamation is that the resulting tree preserves all of ...
  • 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 ...
  • Bounding the number of hybridisation events for a consistent evolutionary history 

    Baroni, M.; Grunewald, S.; Moulton, V.; Semple, C. (University of Canterbury, 2004)
    Evolutionary processes such as hybridisation, lateral gene transfer, and recombination are all key factors in shaping the structure of genes and genomes. However, since such processes are not always best represented by ...
  • Identifying phylogenetic trees 

    Bordewich, M.; Huber, K. T.; Semple, C. (University of Canterbury, 2004)
    A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree ...

View more