Whose land was it anyway? The Crichel Down Rules and the sale of public land

The guiding principle of compulsory purchase of interests in land in England and Wales is that of fairness, best stated in the words of Lord Justice Scott in Horn v Sunderland Corporation when he said that the owner has “the right to be put, so far as money can do it, in the same position as if his land had not been taken from him”. In many instances, land acquired by compulsion subsequently becomes surplus to the requirements of the acquiring authority. This may be because the intended development scheme was scrapped, or substantially modified, or that after the passage of time the use of the land for which the purchase took place is no longer required. More controversially it may be that for ‘operational reasons’ the acquiring authority knowingly purchased more land than was required for the scheme. Under these circumstances, the Crichel Down Rules (‘the Rules’) require government departments and other statutory bodies to offer back to the former owners or their successors, any land previously so acquired by, or under the threat of, compulsory purchase.

Extending the golden thread? Criminalisation and the presumption of innocence

It seems to be widely accepted that the presumption of innocence, and the attendant standard of 'beyond reasonable doubt' properly apply in the courtroom as a procedural principle directly grounded in the moral imperative to avoid punishing those who should not be punished. In this article I argue that if this is correct, then we ought be as careful about what we criminalise, as we are about who we punish, since people can be wrongfully punished by criminalisation errors as well as by conviction errors.

The Spanish Ambassador and Samuel Daniel's Vision of the Twelve Goddesses: A New Document [with text]

The performance of Samuel Daniel's masque The Vision of the Twelve Goddesses at court on January 8, 1604 took place in the midst of the preliminary negotiations that would lead to the signing of the Anglo-Spanish peace at Somerset House the following August. Philip III sent a special ambassador to England to congratulate James on his accession, and a series of tussles between Juan de Tassis and his French counterpart ensued. As a recently-discovered document in the Archivo General de Simancas reveals, Anna of Denmark intervened personally to insure that de Tassis, and not the Frenchman, attended the masque. This was a clear signal of James and Anna's peace aims, which de Tassis conveyed to the King of Spain; moreover, he enclosed in his dispatch a text of Daniel's masque which he clearly considered both political intelligence and of interest to the theater-loving Hapsburg monarch. The Simancas text of the Daniel masque is a new version, hitherto unknown, which adds to our knowledge of the circumstances in which the first Stuart masque was performed. Here we present a transcription and annotated translation of both de Tassis' letter and the text of the masque he had compiled for Philip III. (B. C.-E. and M. H.)

Real options and game theoretical approaches to real estate development projects: multiple equilibria and the implications of different tie-breaking rules

This paper contributes to a fast growing literature which introduces game theory in the analysis of real option investments in a competitive setting. Specifically, in this paper we focus on the issue of multiple equilibria and on the implications that different equilibrium selections may have for the pricing of real options and for subsequent strategic decisions. We present some theoretical results of the necessary conditions to have multiple equilibria and we show under which conditions different tie-breaking rules result in different economic decisions. We then present a numerical exercise using the in formation set obtained on a real estate development in South London. We find that risk aversion reduces option value and this reduction decreases marginally as negative externalities decrease.

New rôles and development rules for housing associations: rhe rise of design and build?

This paper summarises an initial report carried out by the Housing Business Research Group, of the University of Reading into Design and Build procurement and a number of research projects undertaken by the national federation of Housing Associations (NFHA), into their members' development programmes. The paper collates existing statistics from these sources and examines the way in which Design and Build procurement can be adapted for the provision of social housing. The paper comments on these changes and questions how risk averting the adopted strategies are in relation to long term housing business management issues arising from the quality of the product produced by the new system.

Parallel induction of modular classification rules

The Distributed Rule Induction (DRI) project at the University of Portsmouth is concerned with distributed data mining algorithms for automatically generating rules of all kinds. In this paper we present a system architecture and its implementation for inducing modular classification rules in parallel in a local area network using a distributed blackboard system. We present initial results of a prototype implementation based on the Prism algorithm.

J-PMCRI: a methodology for inducing pre-pruned modular classification rules

Inducing rules from very large datasets is one of the most challenging areas in data mining. Several approaches exist to scaling up classification rule induction to large datasets, namely data reduction and the parallelisation of classification rule induction algorithms. In the area of parallelisation of classification rule induction algorithms most of the work has been concentrated on the Top Down Induction of Decision Trees (TDIDT), also known as the ‘divide and conquer’ approach. However powerful alternative algorithms exist that induce modular rules. Most of these alternative algorithms follow the ‘separate and conquer’ approach of inducing rules, but very little work has been done to make the ‘separate and conquer’ approach scale better on large training data. This paper examines the potential of the recently developed blackboard based J-PMCRI methodology for parallelising modular classification rule induction algorithms that follow the ‘separate and conquer’ approach. A concrete implementation of the methodology is evaluated empirically on very large datasets.

Induction of modular classification rules: using Jmax-pruning

The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree structure. Classifiers induced by Prism algorithms achieve a comparable accuracy compared with decision trees and in some cases even outperform decision trees. Both kinds of algorithms tend to overfit on large and noisy datasets and this has led to the development of pruning methods. Pruning methods use various metrics to truncate decision trees or to eliminate whole rules or single rule terms from a Prism rule set. For decision trees many pre-pruning and postpruning methods exist, however for Prism algorithms only one pre-pruning method has been developed, J-pruning. Recent work with Prism algorithms examined J-pruning in the context of very large datasets and found that the current method does not use its full potential. This paper revisits the J-pruning method for the Prism family of algorithms and develops a new pruning method Jmax-pruning, discusses it in theoretical terms and evaluates it empirically.

Jmax-pruning: a facility for the information theoretic pruning of modular classification rules

The Prism family of algorithms induces modular classification rules in contrast to the Top Down Induction of Decision Trees (TDIDT) approach which induces classification rules in the intermediate form of a tree structure. Both approaches achieve a comparable classification accuracy. However in some cases Prism outperforms TDIDT. For both approaches pre-pruning facilities have been developed in order to prevent the induced classifiers from overfitting on noisy datasets, by cutting rule terms or whole rules or by truncating decision trees according to certain metrics. There have been many pre-pruning mechanisms developed for the TDIDT approach, but for the Prism family the only existing pre-pruning facility is J-pruning. J-pruning not only works on Prism algorithms but also on TDIDT. Although it has been shown that J-pruning produces good results, this work points out that J-pruning does not use its full potential. The original J-pruning facility is examined and the use of a new pre-pruning facility, called Jmax-pruning, is proposed and evaluated empirically. A possible pre-pruning facility for TDIDT based on Jmax-pruning is also discussed.

Computationally efficient induction of classification rules with the PMCRI and J-PMCRI frameworks

In order to gain knowledge from large databases, scalable data mining technologies are needed. Data are captured on a large scale and thus databases are increasing at a fast pace. This leads to the utilisation of parallel computing technologies in order to cope with large amounts of data. In the area of classification rule induction, parallelisation of classification rules has focused on the divide and conquer approach, also known as the Top Down Induction of Decision Trees (TDIDT). An alternative approach to classification rule induction is separate and conquer which has only recently been in the focus of parallelisation. This work introduces and evaluates empirically a framework for the parallel induction of classification rules, generated by members of the Prism family of algorithms. All members of the Prism family of algorithms follow the separate and conquer approach.

ATD: a multiplatform for semiautomatic 3-D detection of kidneys and their pathology in real time

This research presents a novel multi-functional system for medical Imaging-enabled Assistive Diagnosis (IAD). Although the IAD demonstrator has focused on abdominal images and supports the clinical diagnosis of kidneys using CT/MRI imaging, it can be adapted to work on image delineation, annotation and 3D real-size volumetric modelling of other organ structures such as the brain, spine, etc. The IAD provides advanced real-time 3D visualisation and measurements with fully automated functionalities as developed in two stages. In the first stage, via the clinically driven user interface, specialist clinicians use CT/MRI imaging datasets to accurately delineate and annotate the kidneys and their possible abnormalities, thus creating “3D Golden Standard Models”. Based on these models, in the second stage, clinical support staff i.e. medical technicians interactively define model-based rules and parameters for the integrated “Automatic Recognition Framework” to achieve results which are closest to that of the clinicians. These specific rules and parameters are stored in “Templates” and can later be used by any clinician to automatically identify organ structures i.e. kidneys and their possible abnormalities. The system also supports the transmission of these “Templates” to another expert for a second opinion. A 3D model of the body, the organs and their possible pathology with real metrics is also integrated. The automatic functionality was tested on eleven MRI datasets (comprising of 286 images) and the 3D models were validated by comparing them with the metrics from the corresponding “3D Golden Standard Models”. The system provides metrics for the evaluation of the results, in terms of Accuracy, Precision, Sensitivity, Specificity and Dice Similarity Coefficient (DSC) so as to enable benchmarking of its performance. The first IAD prototype has produced promising results as its performance accuracy based on the most widely deployed evaluation metric, DSC, yields 97% for the recognition of kidneys and 96% for their abnormalities; whilst across all the above evaluation metrics its performance ranges between 96% and 100%. Further development of the IAD system is in progress to extend and evaluate its clinical diagnostic support capability through development and integration of additional algorithms to offer fully computer-aided identification of other organs and their abnormalities based on CT/MRI/Ultra-sound Imaging.

Contrasting probabilistic scoring rules

There are several scoring rules that one can choose from in order to score probabilistic forecasting models or estimate model parameters. Whilst it is generally agreed that proper scoring rules are preferable, there is no clear criterion for preferring one proper scoring rule above another. This manuscript compares and contrasts some commonly used proper scoring rules and provides guidance on scoring rule selection. In particular, it is shown that the logarithmic scoring rule prefers erring with more uncertainty, the spherical scoring rule prefers erring with lower uncertainty, whereas the other scoring rules are indifferent to either option.