Single-writer k-quorum protocols achieve high availability without incurring the risk of read operations returning arbitrarily stale values: in particular, they guarantee that, even in the presence of an adversarial scheduler, any read operation will return the value written by one of the last k writes. In this paper, we expand our understanding of k-quorums in two directions: first, we present...

Security for costs and security for claim are interim protective measures available during an arbitration. They are sought when one side is concerned that the other side may not have enough money to pay an adverse costs order or satisfy an award made against it. They require the party against whom they are ordered to set aside a sum of money to satisfy any eventual award or costs order. In theo...

The reader-writer problem [1] seeks to provide a lock that protects some critical section of code for two classes of processes: readers and writers. Multiple readers can have access to the critical section simultaneously, but only one writer can have access to the critical section to the exclusion of all other processes. The difficulties in solving the reader-writer problem lie not only in deve...

Prosocial lies, or lies intended to benefit others, are ubiquitous behaviors that have important social and economic consequences. Though emotions play a central role in many forms of prosocial behavior, no work has investigated how emotions influence behavior when one has the opportunity to tell a prosocial lie-a situation that presents a conflict between two prosocial ethics: lying to prevent...

Ever since the groundbreaking work by Fauconnier (1975) and Ladusaw (1980), research on negative polarity items (npis) has been dominated by two fundamental assumptions about the licensing contexts of npis and their inherent semantic-pragmatic properties. The contexts in which npis may occur felicitously are said to have the semantic property of being downward entailing (which we will briefly e...

In this communication we propose an approach for the writer verification task. The difficulty of this task lies first, in the decision making between the two assumptions which model the problem: "Do the two writings come from the same writer ?" or "Do the two writings come from different writers?" and second, in the evaluation of the error risk associated to this decision. We have called upon a...