Browsing Informatics, School of by Title
Now showing items 895914 of 1415

Object representation and recognition in machine vision
(The University of Edinburgh, 1979) 
Observational models of requirements evolution
(The University of Edinburgh, 2004) 
On a Question of H. Friedman
(ACADEMIC PRESS INC, 1996)In this paper we answer a question of Friedman, providing an ωseparable model M of the λβηcalculus. There therefore exists an αseparable model for any α≥0. The model M permits no nontrivial enrichment as a partial ... 
On a thermodynamic approach to biomolecular interaction networks
(The University of Edinburgh, 20171130)We explore the direct and inverse problem of thermodynamics in the context of rulebased modelling. The direct problem can be concisely stated as obtaining a set of rewriting rules and their rates from the description ... 
On approximating the stochastic behaviour of Markovian process algebra models
(The University of Edinburgh, 20140627)Markov chains offer a rigorous mathematical framework to describe systems that exhibit stochastic behaviour, as they are supported by a plethora of methodologies to analyse their properties. Stochastic process algebras ... 
On bisimulation and modelchecking for concurrent systems with partial order semantics
(The University of Edinburgh, 20110630)In concurrency theory—the branch of (theoretical) computer science that studies the logical and mathematical foundations of parallel computation—there are two main formal ways of modelling the behaviour of systems where ... 
On combining collaborative and automated curation for enzyme function prediction
(The University of Edinburgh, 20121129)Data generation has vastly exceeded manual annotation in several areas of astronomy, biology, economy, geology, medicine and physics. At the same time, a public community of experts and hobbyists has developed around ... 
On Functors Expressible in the Polymorphic Typed Lambda Calculus
(Information and Computation, 1991)Given a model of the polymorphic typed lambda calculus based upon a Cartesian closed category K, there will be functors from K to K whose action on objects can be expressed by type expressions and whose action on morphisms ... 
On hereditary Harrop formulae as a basis for logic programming
(The University of Edinburgh, 1991) 
On probabilistic inference approaches to stochastic optimal control
(The University of Edinburgh, 20131128)While stochastic optimal control, together with associate formulations like Reinforcement Learning, provides a formal approach to, amongst other, motor control, it remains computationally challenging for most practical ... 
On Process Equivalence = Equation Solving in CCS
(Springer, 200906)Unique Fixpoint Induction (UFI) is the chief inference rule to prove the equivalence of recursive processes in the Calculus of Communicating Systems (CCS) (Milner 1989). It plays a major role in the equational approach to ... 
On the complexity of evaluating multivariate polynomials
(The University of Edinburgh, 1981) 
On the Distribution of Control in Asynchronous Processor Architectures
(University of Edinburgh. College of Science and Engineering. School of Informatics., 199707)The effective performance of computer systems is to a large measure determined by the synergy between the processor architecture, the instruction set and the compiler. In the past, the sequencing of information within ... 
On the efficiency of metalevel inference
(The University of Edinburgh, 1989)In this thesis we will be concerned with a particular type of architecture for reasoning systems, known as metalevel architectures. After presenting the arguments for such architectures (chapter 1), we discuss a number ... 
On the Mutability of Protocols
(University of Edinburgh. College of Science and Engineering. School of Informatics., 200606)The task of developing a framework for which agents can communicate reliably and flexibly in open systems is not trivial. This thesis addresses the dichotomy between reliable communication and facilitation of the autonomy ... 
On the quantitative analysis of Deep Belief Networks
(2008)Deep Belief Networks (DBN’s) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allowed these models to be applied successfully in ... 
On the role of the hippocampus in the acquisition, longterm retention and semanticisation of memory
(2005)A consensus on how to characterise the anterograde and retrograde memory processes that are lost or spared after hippocampal damage has not been reached. In this thesis, I critically reexamine the empirical literature ... 
On the simulation and design of manycore CMPs
(The University of Edinburgh, 20151126)The progression of Moore’s Law has resulted in both embedded and performance computing systems which use an ever increasing number of processing cores integrated in a single chip. Commercial systems are now available ... 
One Tone, Two Ears, Three Dimensions: An investigation of qualitative echolocation strategies in synthetic bats and real robots
(University of Edinburgh. College of Science and Engineering. School of Informatics., 199707)The aim of the work reported in this thesis is to investigate a methodology for studying perception by building and testing robotic models of animal sensory mechanisms. Much of Artificial Intelligence studies agent perception ... 
Ontology and reuse in model synthesis
(The University of Edinburgh, 2003)