This report describes the optimization implemented in hpfc, our prototype hpf compiler, to remove useless remappings. This optimization is performed on the remapping graph. The construction of this graph from the control ow graph is rst presented. Then the optimization is formalized as a may data-ow problem on this graph. Finally the results are discussed. 1 Remapping Graph Useless remappings m...

This study compares the representativeness of voters in the proportional electoral system with the situation under plurality rule. Representativeness is commonly measured by comparing parties’ received votes with their shares of seats in the Parliament; this implies that proportional rule should always better represent voters. A coalition within the Parliament, however, rules the country withou...

Entangled states are undoubtedly an integral part of various quantum information processing tasks. On the other hand, absolutely separable which cannot be made entangled under any global unitary operations useless from resource theoretic perspective, and hence identifying non-absolutely can important issue for designing technologies. Here we report that nonlinear witness operators provide signi...

Considering the conundrum of software updates.

A useless checkpoint is a local checkpoint that cannot be part of a consistent global checkpoint. This paper addresses the following important problem. Given a set of processes that take (basic) local checkpoints in an independent and unknown way, the problem is to design a communication-induced checkpointing protocol that directs processes to take additional local (forced) checkpoints to ensur...