The Teaching Space Allocation Problem with splitting

A standard problem within universities is that of teaching space allocation which can be thought of as the assignment of rooms and times to various teaching activities. The focus is usually on courses that are expected to fit into one room. However, it can also happen that the course will need to be broken up, or ‘split’, into multiple sections. A lecture might be too large to fit into any one room. Another common example is that of seminars or tutorials. Although hundreds of students may be enrolled on a course, it is often subdivided into particular types and sizes of events dependent on the pedagogic requirements of that particular course. Typically, decisions as to how to split courses need to be made within the context of limited space requirements. Institutions do not have an unlimited number of teaching rooms, and need to effectively use those that they do have. The efficiency of space usage is usually measured by the overall ‘utilisation’ which is basically the fraction of the available seat-hours that are actually used. A multi-objective optimisation problem naturally arises; with a trade-off between satisfying preferences on splitting, a desire to increase utilisation, and also to satisfy other constraints such as those based on event location and timetabling conflicts. In this paper, we explore such trade-offs. The explorations themselves are based on a local search method that attempts to optimise the space utilisation by means of a ‘dynamic splitting’ strategy. The local moves are designed to improve utilisation and satisfy the other constraints, but are also allowed to split, and un-split, courses so as to simultaneously meet the splitting objectives.

Packet classification by multi-level cutting of the classification space: An algorithmic-architectural solution for IP packet classification in next generation networks

Traditionally, the Internet provides only a “best-effort” service, treating all packets going to the same destination equally. However, providing differentiated services for different users based on their quality requirements is increasingly becoming a demanding issue. For this, routers need to have the capability to distinguish and isolate traffic belonging to different flows. This ability to determine the flow each packet belongs to is called packet classification. Technology vendors are reluctant to support algorithmic solutions for classification due to their non-deterministic performance. Although CAMs are favoured by technology vendors due to their deterministic high lookup rates, they suffer from the problems of high power dissipation and high silicon cost. This paper provides a new algorithmic-architectural solution for packet classification that mixes CAMs with algorithms based on multi-level cutting the classification space into smaller spaces. The provided solution utilizes the geometrical distribution of rules in the classification space. It provides the deterministic performance of CAMs, support for dynamic updates, and added flexibility for system designers.

'Prying open the space for social work in the new millennium: four theoretical perspectives on transformative practice'

Houston S, Skehill C, Pinkerton J & Campbell J (2005) Social Work and Social Sciences Review 12 (1) 35-52.

Exploring Technology Related Design-Space Limitations of High Performance Network Processing

This paper summarizes numerous research activities in high-performance networks and network security processing, and explores technology related performance constraints such as critical performance limitations of circuit architectures, which are set by the semiconductor technologies.

Tracking biological invasions in space and time: elucidating the invasive history of the green alga Codium fragile using old DNA

With the advent of 'ancient DNA' studies on preserved material of extant and extinct species, museums and herbaria now represent an important although still underutilized resource in molecular ecology. The ability to obtain sequence data from archived specimens can reveal the recent history of cryptic species and introductions. We have analysed extant and herbarium samples of the highly invasive green alga Codium fragile, many over 100 years old, to identify cryptic accessions of the invasive strain known as C. fragile ssp. tomentosoides, which can be identified by a unique haplotype. Molecular characterization of specimens previously identified as native in various regions shows that the invasive tomentosoides strain has been colonizing new habitats across the world for longer than records indicate, in some cases nearly 100 years before it was noticed. It can now be found in the ranges of all the other native haplotypes detected, several of which correspond to recognized subspecies. Within regions in the southern hemisphere there was a greater diversity of haplotypes than in the northern hemisphere, probably as a result of dispersal by the Antarctic Circumpolar Current. The findings of this study highlight the importance of herbaria in preserving contemporaneous records of invasions as they occur, especially when invasive taxa are cryptic.