0

We analyze the effects of a domestic standard that reduces an externality associated with the consumption of the good targeted by the standard, using a model in which foreign and domestic producers compete in the domestic good market. Producers can reduce expected damage associated with the externality by incurring a cost that varies by source of origin. Despite potential protectionism, the sta...

As a result of personal experience on the staffs of Holloway Prison and of the Aylesbury Borstal Institution, the writer of this book can speak with some authority on the methods of treating women prisoners and delinquent girls as she found them to exist; from the knowledge gained by training as a Psychiatric Social Worker she has formed very definite convictions as to the much better methods w...

In this paper we give an outline of recent algebraic results concerning theories and models of the untyped lambda calculus.

It is argued that, contrary to common wisdom, unbiasedness is not always a well grounded requirement. It is shown that in many cases, for a given unbiased estimator there is a simply derived biased estimator which yields results closer to the true value.

Floating-point numbers are an essential part of modern software, recently gaining particular prominence on the web as the exclusive numeric format of Javascript. To use floating-point numbers, we require a way to convert binary machine representations into human readable decimal outputs. Existing conversion algorithms make trade-offs between completeness and performance. The classic Dragon4 alg...

Embedded exponentiation techniques have become a key concern for security and efficiency in hardware devices using public key cryptography. An exponentiation is basically a sequence of multiplications and squarings, but this sequence may reveal exponent bits to an attacker on an unprotected implementation. Although this subject has been covered for years, we present in this paper new exponentia...

It is shown that every unit-cost random-access machine (RAM) that runs in time T can be simulated by a concurrent-read exclusive-write parallel random-access machine (CREW PRAM) in time O(T 1/2 log T ). The proof is constructive; thus it gives a mechanical way to translate any sequential algorithm designed to run on a unit-cost RAM into a parallel algorithm that runs on a CREW PRAM and obtain a...