<p> The <a href="http://www.inf.ed.ac.uk/">School of Informatics</a> brings together research in Computer Science, Cognitive Science, Computational Linguistics and Artificial Intelligence. It provides a fertile environment for a wide range of interdisciplinary studies, leading to this new science of Informatics. </p> <p> The Informatics Report Series showcases some of the best research carried out at the School since its formation from the old Department of Computer Science in 2000. Presented here is a growing collection which we will be added to during the coming months. The full <a href="http://www.inf.ed.ac.uk/publications">Informatics Report Series</a> can be found at the School's website.

Recent Submissions

  • The Polyadic pi-Calculus: A Tutorial 

    Milner, Robin (The University of Edinburgh, 1991)
    The pi-calculus is a model of concurrent computation based upon the notion of naming. It is first presented in its simplest and original form, with the help of several illustrative applications. Then it is generalized from ...
  • Value Function Approximation on Non-Linear Manifolds for Robot Motor Control 

    Sugiyama, Masashi; Hachiya, Hirotaka; Towell, Christopher; Vijayakumar, Sethu (IEEE, 2007-04)
    The least squares approach works efficiently in value function approximation, given appropriate basis functions. Because of its smoothness, the Gaussian kernel is a popular and useful choice as a basis function. However, ...
  • Reinforcement Learning for Humanoid Robots - Policy Gradients and Beyond 

    Vijayakumar, Sethu; Peters, Jan; Schaal, Stefan (2004-07)
    Reinforcement learning offers one of the most general frameworks to take traditional robotics towards true autonomy and versatility. However, applying reinforcement learning to high dimensional movement systems like ...
  • Reconstructing Null-space Policies Subject to Dynamic Task Constraints in Redundant Manipulators 

    Howard, Matthew; Vijayakumar, Sethu (2007)
    We consider the problem of direct policy learning in situations where the policies are only observable through their projections into the null-space of a set of dynamic, non-linear task constraints. We tackle the issue ...
  • LWPR: A Scalable Method for Incremental Online Learning in High Dimensions 

    Vijayakumar, Sethu; D'Souza, Aaron; Schaal, Stefan (2005-06)
    Locally weighted projection regression (LWPR) is a new algorithm for incremental nonlinear func- tion approximation in high dimensional spaces with redundant and irrelevant input dimensions. At its core, it employs ...
  • Context Estimation and Learning Control through Latent Variable Extraction: From discrete to continuous contexts 

    Georgios Petkos; Sethu Vijayakumar (IEEE, 2007-04)
    Recent advances in machine learning and adaptive motor control have enabled efficient techniques for online learning of stationary plant dynamics and it's use for robust predictive control. However, in realistic domains, ...
  • Implications of different classes of sensorimotor disturbance for cerebellar-based motor learning models 

    Haith, Adrian; Vijayakumar, Sethu (Springer, 2009)
    The exact role of the cerebellum in motor control and learning is not yet fully understood. The structure, connectivity and plasticity within cerebellar cortex has been extensively studied, but the patterns of connectivity ...
  • Synthesising Novel Movements through Latent Space Modulation of Scalable Control Policies 

    Bitzer, Sebastian; Havoutis, Ioannis; Vijayakumar, Sethu (Springer-Verlag, 2008)
    We propose a novel methodology for learning and synthesising whole classes of high dimensional movements from a limited set of demonstrated examples that satisfy some underlying ’latent’ low dimensional task constraints. ...
  • Animal learning models as robot controllers 

    Hallam, Bridget (The University of Edinburgh, 2000)
    Robots can do a range of wonderful things, but they can also appear really stupid. I would like my autonomous, sensor-rich, robot to be able to: complete its task whenever possible, despite distractions and disabilities; ...
  • Design and Implementation of an Online Auction 

    Theodoropoulos, Theodoros (The University of Edinburgh, 2000)
    This dissertation reports on the design and implementation of a distributed application that hosts online auctions. The system is implemented using Java and CORBA. Special care has been taken to make it secure, flexible, ...
  • Resolving References to Graphical Objects in Multimodal Queries by Constraint Satisfaction 

    He, Daqing; Ritchie, Graeme; Lee, John (The University of Edinburgh, 2000)
    In natural language queries to an intelligent multimodal system, ambiguities related to referring expressions -- source ambiguities -- can occur between items in the visual display and objects in the domain being represented. ...
  • Frame: An Imperative Coordination Language for Parallel Programming 

    Cole, Murray (The University of Edinburgh, 2000)
    We present Frame, a simple language which facilitates structured expression of imperative parallelism. Programs are described at two levels. The top level captures the main parallel algorithmic structure (which may be ...
  • A Web Based Replayer For Proof General 

    Freear, Jonathan (The University of Edinburgh, 2000)
    Proof General is a generic interface for proof assistants, based on Emacs. It has been developed at the LFCS in the University of Edinburgh. One of the nice features of Proof General is that it is very easy to replay ...
  • Stratified coherent spaces: a denotational semantics for Light Linear Logic 

    Baillot, Patrick (The University of Edinburgh, 2000-08)
    Light linear logic (LLL) was introduced by Girard as a logical system capturing the class of polytime function within the proofs-as-programs approach. This paper deals with the denotational semantics of LLL: we introduce ...
  • Representing Trees with Constraints 

    Curry, Benjamin; Wiggins, Geraint; Hayes, Gillian (The University of Edinburgh, 2000-07)
    This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and how we can represent the set of trees belonging ...
  • A Case-Based Reasoning Framework for Enterprise Model Building, Sharing and Reusing 

    Chen-Burger, Jessica; Robertson, Dave; Stader, Justine (The University of Edinburgh, 2000)
    Enterprise model development is essentially a labour-intensive exercise. Human experts depend heavily on prior experience when they are building new models making it a natural domain to apply Case Based Reasoning techniques. ...
  • Formal Support for an Informal Business Modelling Method 

    Chen-Burger, Jessica; Robertson, Dave; Stader, Justine (The University of Edinburgh, 2000)
    Business modelling methods are popular but, since they operate primarily in the early stages of software lifecycles, most are informal. This paper describes how we have used a conventional formal notation (first order ...
  • Completeness Conditions for Mixed Strategy Bidirectional Parsing 

    Ritchie, Graeme (The University of Edinburgh, 2000)
    It has been suggested that, in certain circumstances, it might be useful for a grammar-writer to annotate which rules are to be used bottom-up and which are to be used top-down within a parser, using a bidirectional variant ...
  • Isamode: Theorem Proving with Isabelle inside Emacs 

    Aspinall, David (The University of Edinburgh, 2000)
    This paper documents Isamode, a user-interface and suite of editing functions for using the theorem prover Isabelle inside Emacs.
  • Cross Domain Mathematical Concept Formation 

    Steel, Graham; Colton, Simon; Bundy, Alan; Walsh, Toby (The University of Edinburgh, 2000)
    Many interesting concepts in mathematics are essentially "cross-domain" in nature, relating objects from more than one area of mathematics, e.g. prime order groups. These concepts are often vital to the formation of a ...

View more