All Outputs (2039)

Non-Symbolic Fragmentation (2002)
Presentation / Conference Contribution
Ashman, H., Coupe, H., Smith, P., Neville-Smith, M., & Gilbert, M. (2002). Non-Symbolic Fragmentation.

This paper reports on the use of non-symbolic fragmentation of data for securing communications. Non-symbolic fragmentation, or NSF, relies on breaking up data into non-symbolic fragments, which are (usually irregularly-sized) chunks whose boundaries... Read More about Non-Symbolic Fragmentation.

'On the Effects of Idiotypic Interactions for Recommendation Communities in Artificial Immune Systems' (2002)
Presentation / Conference Contribution
Cayzer, S., & Aickelin, U. (2002). 'On the Effects of Idiotypic Interactions for Recommendation Communities in Artificial Immune Systems'.

It has previously been shown that a recommender based on immune system idiotypic principles can outperform one based on correlation alone. This paper reports the results of work in progress, where we undertake some investigations into the nature of t... Read More about 'On the Effects of Idiotypic Interactions for Recommendation Communities in Artificial Immune Systems'.

A Recommender System based on the Immune Network (2002)
Presentation / Conference Contribution
Cayzer, S., & Aickelin, U. (2002). A Recommender System based on the Immune Network.

Abstract-The immune system is a complex biological system with a highly distributed, adaptive and self-organising nature. This paper presents an artificial immune system (AIS) that exploits some of these characteristics and is applied to the task of... Read More about A Recommender System based on the Immune Network.

'An Artificial Immune System as a Recommender System for Web Sites' (2002)
Presentation / Conference Contribution
Morrison, T., & Aickelin, U. (2002). 'An Artificial Immune System as a Recommender System for Web Sites'.

Artificial Immune Systems have been used successfully to build recommender systems for film databases. In this research, an attempt is made to extend this idea to web site recommendation. A collection of more than 1000 individuals' web profiles (alte... Read More about 'An Artificial Immune System as a Recommender System for Web Sites'.

Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling (2002)
Presentation / Conference Contribution
Burke, E., MacCarthy, B. L., Petrovic, S., & Qu, R. (2002). Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling.

This paper presents a new hyper-heuristic method using Case-Based Reasoning (CBR) for solving course timetabling problems. The term Hyper-heuristics has recently been employed to refer to 'heuristics that choose heuristics' rather than heuristics tha... Read More about Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling.

The NumbersWithNames Program (2002)
Presentation / Conference Contribution
Colton, S., & Dennis, L. A. (2002). The NumbersWithNames Program.

We present the NumbersWithNames program which performs data-mining on the Encyclopedia of Integer Sequences to find interesting conjectures in number theory. The program forms conjectures by finding empirical relationships between a sequence chosen... Read More about The NumbersWithNames Program.

A Comparison of two Proof Critics: Power vs. Robustness (2002)
Presentation / Conference Contribution
Dennis, L. A., & Bundy, A. (2002). A Comparison of two Proof Critics: Power vs. Robustness. In V. A. Carreno, C. A. Munoz, & S. Tahar (Eds.),

Proof critics are a technology from the proof planning paradigm. They examine failed proof attempts in order to extract information which can be used to generate a patch which will allow the proof to go through.
We consider the proof of the $quot;wh... Read More about A Comparison of two Proof Critics: Power vs. Robustness.

Mapping and Displaying Structural Transformations between XML and PDF (2002)
Presentation / Conference Contribution
Hardy, M. R. B., & Brailsford, D. F. (2002). Mapping and Displaying Structural Transformations between XML and PDF. In R. Furuta, J. Maletic, & E. Munson (Eds.),

Documents are often marked up in XML-based tagsets to delineate major structural components such as headings, paragraphs, figure captions and so on, without much regard to their eventual displayed appearance. And yet these same abstract documents, af... Read More about Mapping and Displaying Structural Transformations between XML and PDF.

Hash-Tree Anti-Tampering Schemes (2002)
Presentation / Conference Contribution
Moss, B., & Ashman, H. (2002). Hash-Tree Anti-Tampering Schemes.

Procedures that provide detection, location and correction of tampering in documents are known as anti-tampering schemes. In this paper we describe how to construct an anti-tampering scheme using a pre-computed tree of hashes. The main problems of co... Read More about Hash-Tree Anti-Tampering Schemes.

Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems (2002)
Book Chapter
Petrovic, S., & Qu, R. (2002). Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems. In Knowledge-Based Intelligent Information Engineering Systems and Allied Technologies. IOS Press

This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given... Read More about Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems.

Inductive Theorem Proving and Computer Algebra in the Mathweb Software Bus (2002)
Presentation / Conference Contribution
Zimmer, J., & Dennis, L. A. (2002). Inductive Theorem Proving and Computer Algebra in the Mathweb Software Bus. In J. Calmet, B. Belaid, O. Capriotti, L. Hencoque, & V. Sorge (Eds.),

Reasoning systems have reached a high degree of maturity in the last decade. However, even the most successful systems are usually not general purpose problem solvers but are typically specialised on problems in a certain domain. The MathWeb SOftwa... Read More about Inductive Theorem Proving and Computer Algebra in the Mathweb Software Bus.

The Generic Approximation Lemma (2001)
Journal Article
Hutton, G., & Gibbons, J. (2001). The Generic Approximation Lemma. Information Processing Letters, 79(4),

The approximation lemma is a simplification of the well-known take lemma, and is used to prove properties of programs that produce lists of values. We show how the approximation lemma, unlike the take lemma, can naturally be generalised from lists t... Read More about The Generic Approximation Lemma.

Hybrid population-based metaheuristic approaches for the space allocation problem (2001)
Presentation / Conference Contribution
Burke, E. K., Cowling, P., & Landa Silva, J. D. (2001). Hybrid population-based metaheuristic approaches for the space allocation problem. In Proceedings of the 2001 Congress on Evolutionary Computation (232-239). https://doi.org/10.1109/CEC.2001.934394

A hybrid population-based metaheuristic for the space allocation problem in academic institutions is presented that is based upon previous experiments using a range of techniques including hill-climbing, simulated annealing, tabu search and genetic a... Read More about Hybrid population-based metaheuristic approaches for the space allocation problem.

When is a function a fold or an unfold? (2001)
Presentation / Conference Contribution
Gibbons, J., Hutton, G., & Altenkirch, T. (2001). When is a function a fold or an unfold?.

We give a necessary and sufficient condition for when a set-theoretic function can be written using the recursion operator fold, and a dual condition for the recursion operator unfold. The conditions are simple, practically useful, and generic in the... Read More about When is a function a fold or an unfold?.

Camping in the digital wilderness: Tents and flashlights as interfaces to virtual worlds (2001)
Presentation / Conference Contribution
Green, J., Schnädelbach, H., Koleva, B., Benford, S., Pridmore, T., Medina, K., …Smith, H. (2001, April). Camping in the digital wilderness: Tents and flashlights as interfaces to virtual worlds. Paper presented at Conference on Human Factors in Computing Systems - Proceedings

A projection screen in the shape of a tent provides children with a shared immersive experience of a virtual world based on the metaphor of camping. RFID aerials at its entrances sense tagged children and objects as they enter and leave. Video tracki... Read More about Camping in the digital wilderness: Tents and flashlights as interfaces to virtual worlds.

A Pyramidal Genetic Algorithm for Multiple-Choice Problems (2001)
Presentation / Conference Contribution
Aickelin, U. (2001). A Pyramidal Genetic Algorithm for Multiple-Choice Problems.

This paper combines the idea of a hierarchical distributed genetic algorithm with different inter-agent partnering strategies. Cascading clusters of sub-populations are built from bottom up, with higher-level sub-populations optimising larger parts o... Read More about A Pyramidal Genetic Algorithm for Multiple-Choice Problems.

Representations of first order function types as terminal coalgebras (2001)
Presentation / Conference Contribution
Altenkirch, T. (2001). Representations of first order function types as terminal coalgebras.

New Directions in Commercial Secrecy and Encryption Protocols (2001)
Presentation / Conference Contribution
Ashman, H. (2001). New Directions in Commercial Secrecy and Encryption Protocols.

Secure transmission of bulk data is of interest to many content providers. A commercially-viable distribution of content requires technology to prevent unauthorised access. Encryption tools are powerful, but have a performance cost. Without encryptio... Read More about New Directions in Commercial Secrecy and Encryption Protocols.

Case-based reasoning in course timetabling: an attribute graph approach (2001)
Presentation / Conference Contribution
Burke, E., MacCarthy, B. L., Petrovic, S., & Qu, R. (2001). Case-based reasoning in course timetabling: an attribute graph approach.

An earlier Case-based Reasoning (CBR) approach developed by the authors for educational course timetabling problems employed structured cases to represent the complex relationships between courses. Previous solved cases represented by attribute g... Read More about Case-based reasoning in course timetabling: an attribute graph approach.

Navigating a corpus of journal papers using Handles (2001)
Presentation / Conference Contribution
Chapman, C., & Brailsford, D. F. (2001). Navigating a corpus of journal papers using Handles. In A. Hubler, P. Linde, & J. Smith (Eds.),

For some years now the Internet and World Wide Web communities have envisaged moving to a next generation of Web technologies by promoting a globally unique, and persistent, identifier for identifying and locating many forms of published objects .... Read More about Navigating a corpus of journal papers using Handles.