Rethinking the powers of truth commissions in light of the ICC statute

The Rome Statute of the International Criminal Court (ICC) is silent on the issue of national truth commissions. How the ICC might treat these bodies and the information they may hold is uncertain. The overlapping nature of the investigations likely to be carried out by the ICC and future truth-seeking bodies may, however, give rise to areas of tension, particularly where truth commissions hold confidential or self-incriminating information. This article questions whether the traditional truth-seeking powers to grant confidentiality and compel the provision of self-incriminating statements are compatible with the prosecutorial framework of the ICC. It considers how such information is likely to be dealt with by the ICC and analyses whether effective truth seeking can be carried out in the absence of such powers.

Error analysis of a Monte Carlo algorithm for computing bilinear forms of matrix powers

In this paper we present error analysis for a Monte Carlo algorithm for evaluating bilinear forms of matrix powers. An almost Optimal Monte Carlo (MAO) algorithm for solving this problem is formulated. Results for the structure of the probability error are presented and the construction of robust and interpolation Monte Carlo algorithms are discussed. Results are presented comparing the performance of the Monte Carlo algorithm with that of a corresponding deterministic algorithm. The two algorithms are tested on a well balanced matrix and then the effects of perturbing this matrix, by small and large amounts, is studied.

Comparison of the computational cost of a Monte Carlo and deterministic algorithm for computing bilinear forms of matrix powers

In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can be used to construct solutions for the problems of solving systems of linear algebraic equations, matrix inversion and finding extremal eigenvalues. An almost Optimal Monte Carlo (MAO) algorithm for computing bilinear forms of matrix polynomials is presented. Results for the computational costs of a balanced algorithm for computing the bilinear form of a matrix power is presented, i.e., an algorithm for which probability and systematic errors are of the same order, and this is compared with the computational cost for a corresponding deterministic method.

The serialization and publication of 'The return of the native': a new Thomas Hardy letter

This article presents and contextualises a newly-discovered letter by Thomas Hardy, housed in the Chatto & Windus archive at the University of Reading. The letter sheds new light on the publishing history of Hardy's novel 'The return of the native'