Franz Neumann, the rule of law and the unfulfilled promise of classical liberal thought

This thesis draws on the work of Franz Neumann, a critical theorist associated with the early Frankfurt School, to evaluate liberal arguments about political legitimacy and to develop an original account of the justification for the liberal state.

Calibration and evaluation of individual-based models using Approximate Bayesian Computation

This paper investigates the feasibility of using approximate Bayesian computation (ABC) to calibrate and evaluate complex individual-based models (IBMs). As ABC evolves, various versions are emerging, but here we only explore the most accessible version, rejection-ABC. Rejection-ABC involves running models a large number of times, with parameters drawn randomly from their prior distributions, and then retaining the simulations closest to the observations. Although well-established in some fields, whether ABC will work with ecological IBMs is still uncertain. Rejection-ABC was applied to an existing 14-parameter earthworm energy budget IBM for which the available data consist of body mass growth and cocoon production in four experiments. ABC was able to narrow the posterior distributions of seven parameters, estimating credible intervals for each. ABC’s accepted values produced slightly better fits than literature values do. The accuracy of the analysis was assessed using cross-validation and coverage, currently the best available tests. Of the seven unnarrowed parameters, ABC revealed that three were correlated with other parameters, while the remaining four were found to be not estimable given the data available. It is often desirable to compare models to see whether all component modules are necessary. Here we used ABC model selection to compare the full model with a simplified version which removed the earthworm’s movement and much of the energy budget. We are able to show that inclusion of the energy budget is necessary for a good fit to the data. We show how our methodology can inform future modelling cycles, and briefly discuss how more advanced versions of ABC may be applicable to IBMs. We conclude that ABC has the potential to represent uncertainty in model structure, parameters and predictions, and to embed the often complex process of optimizing an IBM’s structure and parameters within an established statistical framework, thereby making the process more transparent and objective.

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters

Bloom filters are a data structure for storing data in a compressed form. They offer excellent space and time efficiency at the cost of some loss of accuracy (so-called lossy compression). This work presents a yes-no Bloom filter, which as a data structure consisting of two parts: the yes-filter which is a standard Bloom filter and the no-filter which is another Bloom filter whose purpose is to represent those objects that were recognised incorrectly by the yes-filter (that is, to recognise the false positives of the yes-filter). By querying the no-filter after an object has been recognised by the yes-filter, we get a chance of rejecting it, which improves the accuracy of data recognition in comparison with the standard Bloom filter of the same total length. A further increase in accuracy is possible if one chooses objects to include in the no-filter so that the no-filter recognises as many as possible false positives but no true positives, thus producing the most accurate yes-no Bloom filter among all yes-no Bloom filters. This paper studies how optimization techniques can be used to maximize the number of false positives recognised by the no-filter, with the constraint being that it should recognise no true positives. To achieve this aim, an Integer Linear Program (ILP) is proposed for the optimal selection of false positives. In practice the problem size is normally large leading to intractable optimal solution. Considering the similarity of the ILP with the Multidimensional Knapsack Problem, an Approximate Dynamic Programming (ADP) model is developed making use of a reduced ILP for the value function approximation. Numerical results show the ADP model works best comparing with a number of heuristics as well as the CPLEX built-in solver (B&B), and this is what can be recommended for use in yes-no Bloom filters. In a wider context of the study of lossy compression algorithms, our researchis an example showing how the arsenal of optimization methods can be applied to improving the accuracy of compressed data.

The foundations of the rule of law

Formal conceptions of the rule of law are popular among contemporary legal philosophers. Nonetheless, the coherence of accounts of the rule of law committed to these conceptions is sometimes fractured by elements harkening back to substantive conceptions of the rule of law. I suggest that this may be because at its origins the ideal of the rule of law was substantive through and through. I also argue that those origins are older than is generally supposed. Most authors tend to trace the ideas of the rule of law and natural law back to classical Greece, but I show that they are already recognisable and intertwined as far back as Homer. Because the founding moment of the tradition of western intellectual reflection on the rule of law placed concerns about substantive justice at the centre of the rule of law ideal, it may be hard for this ideal to entirely shrug off its substantive content. It may be undesirable, too, given the rhetorical power of appeals to the rule of law. The rule of law means something quite radical in Homer; this meaning may provide a source of normative inspiration for contemporary reflections about the rule of law.

abctools: an R package for tuning approximate Bayesian computation analyses

Approximate Bayesian computation (ABC) is a popular family of algorithms which perform approximate parameter inference when numerical evaluation of the likelihood function is not possible but data can be simulated from the model. They return a sample of parameter values which produce simulations close to the observed dataset. A standard approach is to reduce the simulated and observed datasets to vectors of summary statistics and accept when the difference between these is below a specified threshold. ABC can also be adapted to perform model choice. In this article, we present a new software package for R, abctools which provides methods for tuning ABC algorithms. This includes recent dimension reduction algorithms to tune the choice of summary statistics, and coverage methods to tune the choice of threshold. We provide several illustrations of these routines on applications taken from the ABC literature.

Towards expressive rule induction on IP network event streams

In order to gain insights into events and issues that may cause errors and outages in parts of IP networks, intelligent methods that capture and express causal relationships online (in real-time) are needed. Whereas generalised rule induction has been explored for non-streaming data applications, its application and adaptation on streaming data is mostly undeveloped or based on periodic and ad-hoc training with batch algorithms. Some association rule mining approaches for streaming data do exist, however, they can only express binary causal relationships. This paper presents the ongoing work on Online Generalised Rule Induction (OGRI) in order to create expressive and adaptive rule sets real-time that can be applied to a broad range of applications, including network telemetry data streams.

Pension scheme redesign and wealth redistribution between the members and sponsor: the USS rule change in October 2011

The redesign of defined benefit pension schemes usually results in a substantial redistribution of wealth between age cohorts of members, pensioners, and the sponsor. This is the first study to quantify the redistributive effects of a rule change by a real world scheme (the Universities Superannuation Scheme, USS) where the sponsor underwrites the pension promise. In October 2011 USS closed its final salary scheme to new members, opened a career average revalued earnings (CARE) section, and moved to ‘cap and share’ contribution rates. We find that the pre-October 2011 scheme was not viable in the long run, while the post-October 2011 scheme is probably viable in the long run, but faces medium term problems. In October 2011 future members of USS lost 65% of their pension wealth (or roughly £100,000 per head), equivalent to a reduction of roughly 11% in their total compensation, while those aged over 57 years lost almost nothing. The riskiness of the pension wealth of future members increased by a third, while the riskiness of the present value of the sponsor’s future contributions reduced by 10%. Finally, the sponsor’s wealth increased by about £32.5 billion, equivalent to a reduction of 26% in their pension costs.