Now showing items 1-20 of 115

  • Abstract machine design for increasingly more powerful ALGOL-languages 

    Gunn, Hamish Iain Elston (University of St Andrews, 1985) - Thesis
    This thesis presents the work and results of an investigation into language implementation. Some work on language design has also been undertaken. Three languages have been implemented which may be described as members of ...
  • Adaptive dissemination of network state knowledge in structured peer-to-peer networks 

    Hajiarabderkani, Masih (University of St Andrews, 2015-06-24) - Thesis
    One of the fundamental challenges in building Peer-to-Peer (P2P) applications is to locate resources across a dynamic set of nodes without centralised servers. Structured overlay networks solve this challenge by proving a ...
  • Adaptive network traffic management for multi user virtual environments 

    Oliver, Iain Angus (University of St Andrews, 2011-11-30) - Thesis
    Multi User Virtual Environments (MUVE) are a new class of Internet application with a significant user base. This thesis adds to our understanding of how MUVE network traffic fits into the mix of Internet traffic, and how ...
  • Adaptive pattern recognition in a real-world environment 

    Bairaktaris, Dmitrios (University of St Andrews, 1991) - Thesis
    This thesis introduces and explores the notion of a real-world environment with respect to adaptive pattern recognition and neural network systems. It then examines the individual properties of a real-world environment ...
  • The application of message passing to concurrent programming 

    Harland, David M. (University of St Andrews, 1981) - Thesis
    The development of concurrency in computer systems will be critically reviewed and an alternative strategy proposed. This is a programming language designed along semantic principles, and it is based upon the treatment of ...
  • Applications of Lie methods to computations with polycyclic groups 

    Assmann, Björn (University of St Andrews, 2007-11-30) - Thesis
    In this thesis we demonstrate the algorithmic usefulness of the so-called Mal'cev correspondence for computations with infinite polycyclic groups. This correspondence between Q-powered nilpotent groups and rational ...
  • Applying contextual integrity to the study of social network sites 

    Hutton, Luke (University of St Andrews, 2015-11-30) - Thesis
    Social network sites (SNSs) have become very popular, with more than 1.39 billion people using Facebook alone. The ability to share large amounts of personal information with these services, such as location traces, ...
  • An approach to situation recognition based on learned semantic models 

    Stevenson, Graeme (University of St Andrews, 2015-06-24) - Thesis
    A key enabler of pervasive computing is the ability to drive service delivery through the analysis of situations: Semantically meaningful classifications of system state, identified through analysing the readings from ...
  • The architecture of an autonomic, resource-aware, workstation-based distributed database system 

    Macdonald, Angus (University of St Andrews, 2012-11-30) - Thesis
    Distributed software systems that are designed to run over workstation machines within organisations are termed workstation-based. Workstation-based systems are characterised by dynamically changing sets of machines that ...
  • Augmenting visual perception with gaze-contingent displays 

    Mauderer, Michael (University of St Andrews, 2017-06-21) - Thesis
    Cheap and easy to use eye tracking can be used to turn a common display into a gaze-contingent display: a system that can react to the user’s gaze and adjust its content based on where an observer is looking. This can ...
  • Automated static symmetry breaking in constraint satisfaction problems 

    Grayland, Andrews (University of St Andrews, 2011) - Thesis
    Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic ordering constraints. Existing general methods of generating such sets of ordering constraints can produce a huge number of ...
  • Automatic generation of proof terms in dependently typed programming languages 

    Slama, Franck (University of St Andrews, 2018-09-17) - Thesis
    Dependent type theories are a kind of mathematical foundations investigated both for the formalisation of mathematics and for reasoning about programs. They are implemented as the kernel of many proof assistants and ...
  • Autonomic management in a distributed storage system 

    Tauber, Markus (University of St Andrews, 2010-06-23) - Thesis
    This thesis investigates the application of autonomic management to a distributed storage system. Effects on performance and resource consumption were measured in experiments, which were carried out in a local area ...
  • Bicontexts and structural induction 

    Livesey, Mike (University of St Andrews, 1987) - Thesis
    This thesis introduces and explores the notion of bicontext, an order-enriched category equipped with a unary endofunctor of order two called reverse. The purpose is threefold. First, the important categories that arise ...
  • Child-centred technologies as learning tools within the primary classroom : exploring the role of tablets and the potential of digital pens in schools 

    Mann, Anne-Marie (University of St Andrews, 2017-06-21) - Thesis
    This thesis provides insights into how technology can be and is used as child-centric learning tools within primary school classrooms. The conducted studies look closely at how tablet technology is integrated into the ...
  • Collaborative and evolutionary ontology development & its application in IM system for enhanced presence 

    Zhai, Ying (University of St Andrews, 2012-08-28) - Thesis
    This research contributes to the field of ontology-based semantic matching techniques and also to the field of Instant Messaging (IM) based enhanced presence. It aims to achieve a mutually beneficial development of two ...
  • The combinatorics of abstract container data types 

    Tulley, Dominic H. (University of St Andrews, 1997) - Thesis
    The study of abstract machines such as Turing machines, push down automata and finite state machines has played an important role in the advancement of computer science. It has led to developments in the theory of general ...
  • Computational techniques applied to group presentations 

    Rutherford, Kevin (University of St Andrews, 1989) - Thesis
    Designs for a collection of re-usable software modules are developed. The modules are implemented in C and expressed in a tool-kit for the Unix operating system. Each tool is an expert in some aspect of the manipulation ...
  • Consistency and the quantified constraint satisfaction problem 

    Nightingale, Peter (University of St Andrews, 2007-11-30) - Thesis
    Constraint satisfaction is a very well studied and fundamental artificial intelligence technique. Various forms of knowledge can be represented with constraints, and reasoning techniques from disparate fields can be ...
  • Correct model-to-model transformation for formal verification 

    Meedeniya, Dulani Apeksha (University of St Andrews, 2013-06-26) - Thesis
    Modern software systems have increasingly higher expectations on their reliability, in particular if the systems are critical and real-time. The development of these complex software systems requires strong modelling and ...