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.

Did farming arise from a misapplication of social intelligence?

The origins of farming is the defining event of human history-the one turning point that has resulted in modern humans having a quite different type of lifestyle and cognition to all other animals and past types of humans. With the economic basis provided by farming, human individuals and societies have developed types of material culture that greatly augment powers of memory and computation, extending the human mental capacity far beyond that which the brain alone can provide. Archaeologists have long debated and discussed why people began living in settled communities and became dependent on cultivated plants and animals, which soon evolved into domesticated forms. One of the most intriguing explanations was proposed more than 20 years ago not by an archaeologist but by a psychologist: Nicholas Humphrey suggested that farming arose from the 'misapplication of social intelligence'. I explore this idea in relation to recent discoveries and archaeological interpretations in the Near East, arguing that social intelligence has indeed played a key role in the origin of farming and hence the emergence of the modern world.

Vibration–rotation variational calculations: precise results on HCN up to 25 000 cm−1

Variation calculations of the vibration–rotation energy levels of many isotopomers of HCN are reported, for J=0, 1, and 2, extending up to approximately 8 quanta of each of the stretching vibrations and 14 quanta of the bending mode. The force field, which is represented as a polynomial expansion in Morse coordinates for the bond stretches and even powers of the angle bend, has been refined by least squares to fit simultaneously all observed data on the Σ and Π state vibrational energies, and the Σ state rotational constants, for both HCN and DCN. The observed vibrational energies are fitted to roughly ±0.5 cm−1, and the rotational constants to roughly ±0.0001 cm−1. The force field has been used to predict the vibration rotation spectra of many isotopomers of HCN up to 25 000 cm−1. The results are consistent with the axis‐switching assignments of some weak overtone bands reported recently by Jonas, Yang, and Wodtke, and they also fit and provide the assignment for recent observations by Romanini and Lehmann of very weak absorption bands above 20 000 cm−1.

The microwave spectrum of thietan-2,2,4,4-d4

The microwave spectrum for thietan-2,2,4,4-d4 is analysed in six of its lowest puckering states and up to J = 25. The close lying pairs of states of vp = 0/1, 2/3 and 4/5 are treated with a vibration-rotation hamiltonian which includes an off-diagonal coupling term in vp. Additional corrections to this coupling term in higher powers of the angular momentum operator are derived and their importance for improving the fit of calculated to observed data is tested. The variation of the centrifugal distortion constants with vp follows the model of Creswell and Mills (1974, J. molec. Spectrosc., 52, 392). A value is determined for the derivative with respect to the puckering coordinate of the ac-component of the inverse moment of inertia tensor.

Neurofuzzy network model construction using Bézier-Bernstein polynomial functions

Neurofuzzy modelling systems combine fuzzy logic with quantitative artificial neural networks via a concept of fuzzification by using a fuzzy membership function usually based on B-splines and algebraic operators for inference, etc. The paper introduces a neurofuzzy model construction algorithm using Bezier-Bernstein polynomial functions as basis functions. The new network maintains most of the properties of the B-spline expansion based neurofuzzy system, such as the non-negativity of the basis functions, and unity of support but with the additional advantages of structural parsimony and Delaunay input space partitioning, avoiding the inherent computational problems of lattice networks. This new modelling network is based on the idea that an input vector can be mapped into barycentric co-ordinates with respect to a set of predetermined knots as vertices of a polygon (a set of tiled Delaunay triangles) over the input space. The network is expressed as the Bezier-Bernstein polynomial function of barycentric co-ordinates of the input vector. An inverse de Casteljau procedure using backpropagation is developed to obtain the input vector's barycentric co-ordinates that form the basis functions. Extension of the Bezier-Bernstein neurofuzzy algorithm to n-dimensional inputs is discussed followed by numerical examples to demonstrate the effectiveness of this new data based modelling approach.

Strong armies, slow adaptation: civil-military relations and diffusion of military power

Why are some states more willing to adopt military innovations than others? Why, for example, were the great powers of Europe able to successfully reform their military practices to better adapt to and participate in the so-called military revolution of the sixteenth and seventeenth centuries while their most important extra-European competitor, the Ottoman Empire, failed to do so? This puzzle is best explained by two factors: civil-military relations and historical timing. In the Ottoman Empire, the emergence of an institutionally strong and internally cohesive army during the early stages of state formation—in the late fourteenth century—equipped the military with substantial bargaining powers. In contrast, the great powers of Europe drew heavily on private providers of military power during the military revolution and developed similar armies only by the second half of the seventeenth century, limiting the bargaining leverage of European militaries over their rulers. In essence, the Ottoman standing army was able to block reform efforts that it believed challenged its parochial interests. Absent a similar institutional challenge, European rulers initiated military reforms and motivated officers and military entrepreneurs to participate in the ongoing military revolution.

Perspex machine IX: transreal analysis

We introduce transreal analysis as a generalisation of real analysis. We find that the generalisation of the real exponential and logarithmic functions is well defined for all transreal numbers. Hence, we derive well defined values of all transreal powers of all non-negative transreal numbers. In particular, we find a well defined value for zero to the power of zero. We also note that the computation of products via the transreal logarithm is identical to the transreal product, as expected. We then generalise all of the common, real, trigonometric functions to transreal functions and show that transreal (sin x)/x is well defined everywhere. This raises the possibility that transreal analysis is total, in other words, that every function and every limit is everywhere well defined. If so, transreal analysis should be an adequate mathematical basis for analysing the perspex machine - a theoretical, super-Turing machine that operates on a total geometry. We go on to dispel all of the standard counter "proofs" that purport to show that division by zero is impossible. This is done simply by carrying the proof through in transreal arithmetic or transreal analysis. We find that either the supposed counter proof has no content or else that it supports the contention that division by zero is possible. The supposed counter proofs rely on extending the standard systems in arbitrary and inconsistent ways and then showing, tautologously, that the chosen extensions are not consistent. This shows only that the chosen extensions are inconsistent and does not bear on the question of whether division by zero is logically possible. By contrast, transreal arithmetic is total and consistent so it defeats any possible "straw man" argument. Finally, we show how to arrange that a function has finite or else unmeasurable (nullity) values, but no infinite values. This arithmetical arrangement might prove useful in mathematical physics because it outlaws naked singularities in all equations.

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.

Neural networks for identification of nonlinear systems under random piecewise polynomial disturbances

The problem of identification of a nonlinear dynamic system is considered. A two-layer neural network is used for the solution of the problem. Systems disturbed with unmeasurable noise are considered, although it is known that the disturbance is a random piecewise polynomial process. Absorption polynomials and nonquadratic loss functions are used to reduce the effect of this disturbance on the estimates of the optimal memory of the neural-network model.

Identification of linear systems in the presence of piecewise polynomial disturbances

The paper proposes a method of performing system identification of a linear system in the presence of bounded disturbances. The disturbances may be piecewise parabolic or periodic functions. The method is demonstrated effectively on two example systems with a range of disturbances.

Optimal convergence estimates for the trace of the polynomial L2-projection operator on a simplex

In this paper we study convergence of the L2-projection onto the space of polynomials up to degree p on a simplex in Rd, d >= 2. Optimal error estimates are established in the case of Sobolev regularity and illustrated on several numerical examples. The proof is based on the collapsed coordinate transform and the expansion into various polynomial bases involving Jacobi polynomials and their antiderivatives. The results of the present paper generalize corresponding estimates for cubes in Rd from [P. Houston, C. Schwab, E. Süli, Discontinuous hp-finite element methods for advection-diffusion-reaction problems. SIAM J. Numer. Anal. 39 (2002), no. 6, 2133-2163].

A high-order arbitrarily unstructured finite-volume model of the global atmosphere: tests solving the shallow-water equations

Simulations of the global atmosphere for weather and climate forecasting require fast and accurate solutions and so operational models use high-order finite differences on regular structured grids. This precludes the use of local refinement; techniques allowing local refinement are either expensive (eg. high-order finite element techniques) or have reduced accuracy at changes in resolution (eg. unstructured finite-volume with linear differencing). We present solutions of the shallow-water equations for westerly flow over a mid-latitude mountain from a finite-volume model written using OpenFOAM. A second/third-order accurate differencing scheme is applied on arbitrarily unstructured meshes made up of various shapes and refinement patterns. The results are as accurate as equivalent resolution spectral methods. Using lower order differencing reduces accuracy at a refinement pattern which allows errors from refinement of the mountain to accumulate and reduces the global accuracy over a 15 day simulation. We have therefore introduced a scheme which fits a 2D cubic polynomial approximately on a stencil around each cell. Using this scheme means that refinement of the mountain improves the accuracy after a 15 day simulation. This is a more severe test of local mesh refinement for global simulations than has been presented but a realistic test if these techniques are to be used operationally. These efficient, high-order schemes may make it possible for local mesh refinement to be used by weather and climate forecast models.

Variational calculations of rovibrational states: a precise high-energy potential surface for HCN [and discussion]

We report the results of variational calculations of the rovibrational energy levels of HCN for J = 0, 1 and 2, where we reproduce all the ca. 100 observed vibrational states for all observed isotopic species, with energies up to 18000 cm$^{-1}$, to about $\pm $1 cm$^{-1}$, and the corresponding rotational constants to about $\pm $0.001 cm$^{-1}$. We use a hamiltonian expressed in internal coordinates r$_{1}$, r$_{2}$ and $\theta $, using the exact expression for the kinetic energy operator T obtained by direct transformation from the cartesian representation. The potential energy V is expressed as a polynomial expansion in the Morse coordinates y$_{i}$ for the bond stretches and the interbond angle $\theta $. The basis functions are built as products of appropriately scaled Morse functions in the bond-stretches and Legendre or associated Legendre polynomials of cos $\theta $ in the angle bend, and we evaluate matrix elements by Gauss quadrature. The hamiltonian matripx is factorized using the full rovibrational symmetry, and the basis is contracted to an optimized form; the dimensions of the final hamiltonian matrix vary from 240 $\times $ 240 to 1000 $\times $ 1000.We believe that our calculation is converged to better than 1 cm$^{-1}$ at 18 000 cm$^{-1}$. Our potential surface is expressed in terms of 31 parameters, about half of which have been refined by least squares to optimize the fit to the experimental data. The advantages and disadvantages and the future potential of calculations of this type are discussed.