Karp and Lipton [11] introduced the notion of non-uniform complexity classes where a certain amount of additional information, the advice, is given for free. The advice only depends on the length of the input. Karp and Lipton initiated the study of classes with either logarithmic or polynomial advice; however later researchers [24, 19, 2, 14] concentrated on the study of classes of the form C/p...

Error-correcting codes that admit local decoding and correcting algorithms have been the focus of much recent research due to their numerous applications. An important goal is obtain best possible tradeoffs between number symbols codeword algorithm must examine (the locality), amount redundancy in encoding information rate). In Hamming's classical adversarial channel model, current are dramatic...

Methods Isolated and cleaned squid giant axons were internally perfused by a modification of the method of Adelman and Gilbert (1964) and Adelman and Fok (1964). A chemically driven syringe (Sage Instruments) was directly connected to the axon interior through a small cut in one end by means of a 200,/ diameter glass cannula. The internal axoplasm was eroded away upon continuous internal fluid ...

Factors predicting the behavior change of drug-using detainees were investigated in detainees in two penitentiaries in The Netherlands. Subjects attended either a standard program or a Drug-Free Detention Program (DFDP) and were assessed at the beginning of detention, at release/transfer, and at 2 years after the end of detention. Predictors of postprogram contact with treatment agencies and ch...

Before addressing the question of lessons of development, we must make clear at the outset the sense in which the term is used. Economic development, as distinct from mere economic growth, combines: (1) self-sustaining growth; (2) structural change in patterns of production; (3) technological upgrading; (4) social, political and institutional modernization; and (5) widespread improvement in the...

Many problems arising in interactive and distributive computation share the general framework that a number of processors wish to collaboratively evaluate a Boolean function while each processor has only partial information. The question of interest is to determine the minimum amount of information transfer required under the assumption that each processor has unlimited computational power and ...