In 1998 and the years following, the Google search engine took the world wide web by storm, providing high-quality search results that were clearly superior to other commercial search engines at the time (Brin and Page, 1998). The algorithm that provided these high-quality search results relied on one simple assumption: “A hyperlink from page A to page B is a recommendation of page B by the aut...

Homology search is an important step in discovering evolutionary relationships in modern molecular biology. In particular, it is key to analysing data from large-scale sequencing initiatives: by establishing homology between a newly-discovered sequence and well-understood sequences in curated repositories, it is possible to infer structure and function without the need for costly, time-consumin...

The most popular theories of associative learning require some kind of external teaching signal, whether it be feedback on category membership or the presence of a US to determine whether a trial has been successful. However, under some circumstances (Bersted, Brown & Evans, 1969; Evans & Arnoult, 1967; Estes, 1994), it appears that such a signal is not required to produce accurate categorical ...

This paper reports three experiments that investigate the influence of pragmatic, communicative factors on categorization. Little attention has been given to the role played by pragmatic factors such as the intended audience and purpose of communication. Experiment 1 establishes baseline measures of categorization and similarity for a range of exemplars of biological categories. Experiment 2 re...

The categorisation of information is a very common practice. Often, the user may need to use multiple hierarchies or require multiple characterisations to be active at the same time, or they may wish to define cross-cutting groups for special purposes. The work developed in this paper is aimed at providing a flexible, seamless management of various ways of organising the required information. T...

....................................................................................................................................................... 5 DEDICATION .................................................................................................................................................... 7 LIST OF CONTENTS ...................................................................

We present an alternative approach to that of Chandra and Harel [CHAN80] and Abiteboul and Vianu [ABIT90] in considering computable database queries, which are mappings from sets of records to sets of records. In particular, we view a computable database query as being realised via a Turing-computable mapping from strings to strings and an encoding, which encodes the input set of records into a...