Data protection at the cost of economic growth? ECRI Commentary No. 11, 16 November 2012

The Data Protection Regulation proposed by the European Commission contains important elements to facilitate and secure personal data flows within the Single Market. A harmonised level of protection of individual data is an important objective and all stakeholders have generally welcomed this basic principle. However, when putting the regulation proposal in the complex context in which it is to be implemented, some important issues are revealed. The proposal dictates how data is to be used, regardless of the operational context. It is generally thought to have been influenced by concerns over social networking. This approach implies protection of data rather than protection of privacy and can hardly lead to more flexible instruments for global data flows.

The impact of contract duration on the cost of cash retention

Cash retention is a common means of protecting an employer from a contractor's insolvency as well as ensuring that contractors finish the work that they start. Similarly, contractors withhold part of payments due to their sub-contractors. Larger contracts tend to be subjected to smaller rates of retention. By calculating the cost of retention as an amount per year of a contract, it is shown that retention is far more expensive for firms whose work consists of short contracts. The extra cost is multiplied when the final payment is delayed, as it often is for those whose work takes place at the beginning of a project. This may explain why it is that main contractors are a lot less interested than sub-contractors in alternatives to cash retention, such as retention bonds

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.