Now showing items 1-20 of 745

  • Learning in adaptive networks: analytical and computational approaches 

    Yang, Guoli (The University of Edinburgh, 216-11-29)
    The dynamics on networks and the dynamics of networks are usually entangled with each other in many highly connected systems, where the former means the evolution of state and the latter means the adaptation of structure. ...
  • Computer for solving field problems in electron beam devices 

    Dinnis, Alan Russel (The University of Edinburgh, 1962)
    The need is explained for a new type of computer for solving partial differential equations, the Digital Field Computer. The operation of such a machine for solving Laplace's and Poisson's equations is explained and ...
  • Analysis and design of linearised single-input extremum control systems 

    Shering, George Craig (The University of Edinburgh, 1966)
    Certain single input, linearised extremum controllers of the empirical type described in the literature have been designed and their performances have been compared to that of an approximately optimal controller. The ...
  • Digital correlation techniques for identifying dynamic systems 

    Finnie, Brian William (The University of Edinburgh, 1966)
    A frequent problem in physics and engineering is that of determining a mathematical model for the dynamic performance of a system. It is particularly useful to be able to make measurements which enable such a model to ...
  • Numerical solution of differential equations 

    Verner, James Hamilton (The University of Edinburgh, 1969)
    Recent investigations by Butcher have co-ordinated several aspects of the theory of, and techniques for the derivation of, numerical methods for ordinary differential equations, and further have yielded several significant ...
  • Computer Aided Design of Printed Wiring Boards 

    Rose, Nigel A. (The University of Edinburgh, 1970)
    A method is described for the computer-aided layout of printed wiring boards. The type of board considered is a single sided board containing discrete components. The required input for the layout algorithm is coded ...
  • Studies in the completeness and efficiency of theorem-proving by resolution 

    Kowalski, Robert Anthony (The University of Edinburgh, 1970)
    Inference systems Τ and search strategies E for T are distinguished from proof procedures β = (T,E) The completeness of procedures is studied by studying separately the completeness of inference systems and of search ...
  • Walsh functions : shape analysis and other applications 

    Searle, Nigel Hilton (The University of Edinburgh, 1970)
    Due to their binary nature, the Walsh functions have considerable advantages over the traditional sinusoidal functions used in Fourier analysis when the computations are carried out by a general purpose binary digital ...
  • Studies in the design and implementation of programming languages for symbol manipulation 

    Rees, D.J. (The University of Edinburgh, 1970)
    Compared with the development of computing hardware, the development of programming languages has followed a different course. Hardware innovations such as the use of transistors and integrated circuitry have resulted ...
  • Models of Distributed Associative Memory 

    Willshaw, David (The University of Edinburgh, 1971)
    This work is concerned with the problem of constructing associative memory models which store and retrieve information in a distributed fashion - that is each store location can be involved in the storage of more than ...
  • Strategies for improving the efficiency of automatic theorem-proving 

    Kuehner, Donald Grant (The University of Edinburgh, 1971)
    In an attempt to overcome the great inefficiency of theorem proving methods, several existing methods are studied, and several now ones are proposed. A concentrated attempt is made to devise a unified proof procedure ...
  • Computing with finite groups 

    McKay, John K.S. (The University of Edinburgh, 1971)
    The character table of a finite group G is constructed by computing the eigenvectors of matrix equations determined by the centre of the group algebra. The numerical character values are expressed in algebraic form. A ...
  • Models of distributed associative memory 

    Willshaw, David (The University of Edinburgh, 1971)
  • The Formal Description of Musical Perception 

    Steedman, Mark (The University of Edinburgh, 1972)
    This work concerns a problem in modelling people's understanding of music. The problem is cast in the terms of discovering formal rules for transcribing melodies into musical notation, as this might be done by a student ...
  • Automatic Methods of Inductive Inference 

    Plotkin, Gordon (The University of Edinburgh, 1972)
    This thesis is concerned with algorithms for generating generalisations-from experience. These algorithms are viewed as examples of the general concept of a hypothesis discovery system which, in its turn, is placed in ...
  • A Semantic Approach to Automatic Program Improvement 

    Darlington, John (The University of Edinburgh, 1972)
    The programs that are easiest to write and understand are often not the most efficient. This thesis gives methods of converting programs of the former type to those of the latter type; this involves converting definitions ...
  • Design and implementation of a language for manipulating algebraic formulae 

    Officer, J.M. (The University of Edinburgh, 1972)
    This thesis explores the possibilities of doing mathematical problems involving algebra on a computer. A language is designed which allows names to occur as unknown quantities. This language has all the facilities of ...
  • Semantic trees: New foundations for automatic theorem-proving 

    Hayes, Patrick J. (The University of Edinburgh, 1973)
    This dissertation is concerned with theorem-proving by computer. It does not contain a great number of new results, in the sense of new computational devices for improving the efficiency of theorem-proving programs. ...
  • Adaptive Aspects of Heuristic Search 

    Ross, Robert (The University of Edinburgh, 1973)
    In this thesis we investigate methods by which GT4, a revised and extended version of the Doran-Michie Graph Traverser, might in the course of its problem-solving activity learn about the domain in which it is searching ...
  • Computational Logic: Structure sharing and proof of program properties 

    Moore, J Strother (1973)
    This thesis describes the results of two studies in computational logic. The first concerns a very efficient method of implementing resolution theorem provers. The second concerns a non-resolution program which automatically ...