BACKGROUND Although the Netherlands currently has its own procedure for evaluating chemical compounds and setting occupational exposure limits (OELs), most of these limits were originally adopted in the 1970s from threshold limit values (TLVs) set by the American Conference of Governmental Industrial Hygienists (ACGIH). However, beginning in the late 1980s, criticism about non-scientific consid...

We propose a tightening sequence of optimistic approximations to the Gittins index in “Optimistic Indices.” show that use these concert with an increasing discount factor appears offer compelling alternative state-of-the-art schemes proposed for Bayesian multiarmed bandit problem. prove indices constitutes regret optimal algorithm. Perhaps more interestingly, even loosest substantial performanc...

Program inversion has been successfully applied to several areas such as optimistic parallel discrete event simulation (OPDES) and reverse debugging. This paper introduces a new program inversion algorithm for imperative languages, and focuses on handling arbitrary control flows and basic operations. By building a value search graph that represents recoverability relationships between variable ...

Optimistic concurrency relies on speculative execution, read-write conflict detection, and checkpointrollback techniques to provide a programming model that replaces locks with the abstraction of atomic, isolated execution of critical sections. Previous research has shown that on chip multi-processors, a class of workloads featuring irregular parallelism and rare read-write conflicts can reap s...

We consider two-player zero-sum games with countably infinite action spaces and bounded payoff functions. The players’ strategies are finitely additive probability measures, called charges. Since a strategy profile does not always induce a unique expected payoff, we distinguish two extreme attitudes of players. A player is viewed as pessimistic if he always evaluates the range of possible expec...

Many architectures require that a program use pairs of adjacent registers to hold double-precision oating-point values. Register allocators based on Chaitin's graph-coloring technique have trouble with programs that contain both single-register values and values that require adjacent pairs of registers. In particular, Chaitin's algorithm often produces excessive spilling on such programs. This ...