Recently, we have seen interesting progress in the exploration of CP violation in B0 d → π+π−: the measurements of mixing-induced CP violation by the BaBar and Belle collaborations are now in good agreement with each other, whereas the picture of direct CP violation is still unclear. Using the branching ratio and direct CP asymmetry of B0 d → π−K+, this situation can be clarified. We predict Ad...

Client puzzles have been proposed to add DOS resistance to authentication protocols. Due to the parallel design of puzzles, the technology is vulnerable to the socalled strong attacks. This paper advocates the need for time management of solved puzzle instances and introduces the “threshold puzzle” and “strong attack” concepts.

Discrete Tomography (DT) is concerned with the reconstruction of binary images from their horizontal and vertical projections. In this paper we consider an evolutionary algorithm for computing such reconstructions. We show that the famous Japanese puzzles are a special case of a more general DT problem and successfully apply our algorithm to such puzzles.