Now showing items 21-40 of 117

  • Modelling continuous sequential behaviour to enhance training and generalization in neural networks 

    Chen, Lihui (University of St Andrews, 1993) - Thesis
    This thesis is a conceptual and empirical approach to embody modelling of continuous sequential behaviour in neural learning. The aim is to enhance the feasibility of training and capacity for generalisation. By examining ...
  • Delivering the benefits of persistence to system construction and execution 

    Cutts, Q. I. (University of St Andrews, 1993) - Thesis
    In an orthogonally persistent programming system the longevity of data is independent of its other attributes. The advantages of persistence may be seen primarily in the areas of data modelling and protection resulting ...
  • Parallel functional programming for message-passing multiprocessors 

    Ostheimer, Gerald (University of St Andrews, 1993) - Thesis
    We propose a framework for the evaluation of implicitly parallel functional programs on message passing multiprocessors with special emphasis on the issue of load bounding. The model is based on a new encoding of the ...
  • A testbed for embedded systems 

    Burgess, Peter (University of St Andrews, 1994) - Thesis
    Testing and Debugging are often the most difficult phase of software development. This is especially true of embedded systems which are usually concurrent, have real-time performance and correctness constraints and which ...
  • On the integration of concurrency, distribution and persistence 

    Munro, D. S. (University of St Andrews, 1994) - Thesis
    The principal tenet of the persistence model is that it abstracts over all the physical properties of data such as how long it is stored, where it is stored, how it is stored, what form it is kept in and who is using it. ...
  • Guaranteeing generalisation in neural networks 

    Polhill, John Gareth (University of St Andrews, 1995) - Thesis
    Neural networks need to be able to guarantee their intrinsic generalisation abilities if they are to be used reliably. Mitchell's concept and version spaces technique is able to guarantee generalisation in the symbolic ...
  • Using constraints to improve generalisation and training of feedforward neural networks : constraint based decomposition and complex backpropagation 

    Draghici, Sorin (University of St Andrews, 1996) - Thesis
    Neural networks can be analysed from two points of view: training and generalisation. The training is characterised by a trade-off between the 'goodness' of the training algorithm itself (speed, reliability, guaranteed ...
  • Robustness and generalisation : tangent hyperplanes and classification trees 

    Fernandes, Antonio Ramires (University of St Andrews, 1997) - Thesis
    The issue of robust training is tackled for fixed multilayer feedforward architectures. Several researchers have proved the theoretical capabilities of Multilayer Feedforward networks but in practice the robust convergence ...
  • Effective termination techniques 

    Cropper, Nick I. (University of St Andrews, 1997) - Thesis
    An important property of term rewriting systems is termination: the guarantee that every rewrite sequence is finite. This thesis is concerned with orderings used for proving termination, in particular the Knuth-Bendix and ...
  • 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 ...
  • FORUM and its implementation 

    Urban, Christian (University of St Andrews, 1997) - Thesis
    Miller presented Forum as a specification logic: Forum extends several existing logic programming languages, for example Prolog, LO and Lolli. The crucial change in Forum is the extension from single succedent sequents, ...
  • Proof-theoretic investigations into integrated logical and functional programming 

    Pinto, Luis Filipe Ribeiro (University of St Andrews, 1997) - Thesis
    This thesis is a proof-theoretic investigation of logic programming based on hereditary Harrop logic (as in lambdaProlog). After studying various proof systems for the first-order hereditary Harrop logic, we define the ...
  • Modelling recovery in database systems 

    Scheuerl, S. (University of St Andrews, 1998) - Thesis
    The execution of modern database applications requires the co-ordination of a number of components such as: the application itself, the DBMS, the operating system, the network and the platform. The interaction of these ...
  • A parallel functional language compiler for message-passing multicomputers 

    Junaidu, Sahalu B. (University of St Andrews, 1998) - Thesis
    The research presented in this thesis is about the design and implementation of Naira, a parallel, parallelising compiler for a rich, purely functional programming language. The source language of the compiler is a subset ...
  • Extension polymorphism 

    Balasubramaniam, Dharini (University of St Andrews, 1998) - Thesis
    Any system that models a real world application has to evolve to be consistent with its changing domain. Dealing with evolution in an effective manner is particularly important for those systems that may store large amounts ...
  • Using subgoal chaining to address the local minimum problem 

    Lewis, Jonathan Peter (University of St Andrews, 2002) - Thesis
    A common problem in the area of non-linear function optimisation is that of not being able to guarantee finding the global optimum of the function in a feasible time especially when local optima exist. This problem applies ...
  • Systems support for distributed learning environments 

    Allison, Colin (University of St Andrews, 2003) - Thesis
    This thesis contends that the growing phenomena of multi-user networked "learning environments" should be treated as distributed interactive systems and that their developers should be aware of the systems and networks ...
  • Genetic programming with context-sensitive grammars 

    Paterson, Norman R. (University of St Andrews, 2003) - Thesis
    This thesis presents Genetic Algorithm for Deriving Software (Gads), a new technique for genetic programming. Gads combines a conventional genetic algorithm with a context-sensitive grammar. The key to Gads is the onto ...
  • Symmetry in constraint programming 

    McDonald, Iain (University of St Andrews, 2004) - Thesis
    Constraint programming is an invaluable tool for solving many of the complex NP-complete problems that we need solutions to. These problems can be easily described as Constraint Satisfaction Problems (CSPs) and then passed ...
  • Deriving distributed garbage collectors from distributed termination algorithms 

    Norcross, Stuart John (University of St Andrews, 2004) - Thesis
    This thesis concentrates on the derivation of a modularised version of the DMOS distributed garbage collection algorithm and the implementation of this algorithm in a distributed computational environment. DMOS appears to ...