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...

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...

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...

Writer recognition based on a small amount of handwritten text is one the most challenging deep learning problems because implicit characteristics handwriting styles. In convolutional neural network, writer supervised has shown great success. These methods typically require lot annotated data. However, collecting data expensive. Although unsupervised may address annotation issues significantly,...

Two approaches are employed to deal with false sharing in software DSMs. Although single-writer is simple, it causes the ping-pong effect of the data page thrashing. In other hand, multiple-writer approach, which is eeective in re-duing the amount of page transfer, suuers from the high cost. This paper proposes a new approach to handle multiple writers in software DSMs called limited multiple-w...

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...