Computationally efficient rule-based classification for continuous streaming data

Advances in hardware and software technologies allow to capture streaming data. The area of Data Stream Mining (DSM) is concerned with the analysis of these vast amounts of data as it is generated in real-time. Data stream classification is one of the most important DSM techniques allowing to classify previously unseen data instances. Different to traditional classifiers for static data, data stream classifiers need to adapt to concept changes (concept drift) in the stream in real-time in order to reflect the most recent concept in the data as accurately as possible. A recent addition to the data stream classifier toolbox is eRules which induces and updates a set of expressive rules that can easily be interpreted by humans. However, like most rule-based data stream classifiers, eRules exhibits a poor computational performance when confronted with continuous attributes. In this work, we propose an approach to deal with continuous data effectively and accurately in rule-based classifiers by using the Gaussian distribution as heuristic for building rule terms on continuous attributes. We show on the example of eRules that incorporating our method for continuous attributes indeed speeds up the real-time rule induction process while maintaining a similar level of accuracy compared with the original eRules classifier. We termed this new version of eRules with our approach G-eRules.

Depth to mate and the 50-move rule

The most popular endgame tables (EGTs) documenting ‘DTM’ Depth to Mate in chess endgames are those of Eugene Nalimov but these do not recognise the FIDE 50-move rule ‘50mr’. This paper marks the creation by the first author of EGTs for sub-6-man (s6m) chess and beyond which give DTM as affected by the ply count pc. The results are put into the context of previous work recognising the 50mr and are compared with the original unmoderated DTM results. The work is also notable for being the first EGT generation work to use the functional programming language HASKELL.

Quantitative single-molecule localization microscopy combined with rule-based modeling reveals ligand-induced TNF-R1 reorganization toward higher-order oligomers

We report on the assembly of tumor necrosis factor receptor 1 (TNF-R1) prior to ligand activation and its ligand-induced reorganization at the cell membrane. We apply single-molecule localization microscopy to obtain quantitative information on receptor cluster sizes and copy numbers. Our data suggest a dimeric pre-assembly of TNF-R1, as well as receptor reorganization toward higher oligomeric states with stable populations comprising three to six TNF-R1. Our experimental results directly serve as input parameters for computational modeling of the ligand-receptor interaction. Simulations corroborate the experimental finding of higher-order oligomeric states. This work is a first demonstration how quantitative, super-resolution and advanced microscopy can be used for systems biology approaches at the single-molecule and single-cell level.

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.

Stopping rules for phase II studies

This paper, the second in a series of three papers concerned with the statistical aspects of interim analyses in clinical trials, is concerned with stopping rules in phase II clinical trials. Phase II trials are generally small-scale studies, and may include one or more experimental treatments with or without a control. A common feature is that the results primarily determine the course of further clinical evaluation of a treatment rather than providing definitive evidence of treatment efficacy. This means that there is more flexibility available in the design and analysis of such studies than in phase III trials. This has led to a range of different approaches being taken to the statistical design of stopping rules for such trials. This paper briefly describes and compares the different approaches. In most cases the stopping rules can be described and implemented easily without knowledge of the detailed statistical and computational methods used to obtain the rules.

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.

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.