for the ALICE TPC Collaboration. Received (received date) Revised (revised date) Using a test TPC, consisting of the ALICE TPC field cage prototype in combination with the final ALICE TPC readout and electronics, the energy loss distribution and resolution were measured for identified protons. The measurements were compared to theoretical calculations and good quantitative agreement was found w...

Bob died suddenly leaving his treasure to sister Alice. Eve will do anything to get it, so Alice hides the treasure together with Nipper, and promptly departs. Nipper is a low-cost RFID device that responds only to Alice’s calls— making it possible for Alice to locate the hidden treasure later (she is quite forgetful) when Eve is not around. We study the design of Nipper, the cryptographic mech...

Consider the following communication problem. Alice gets a word x 2 f0; 1gn and Bob gets a word y 2 f0; 1gn. Alice and Bob are told that x 6= y. Their goal is to find an index 1 i n such that xi 6= yi (the index i should be known to both of them). This problem is one of the most basic communication problems. It arises naturally from the correspondence between circuit depth and communication com...

The implementation of security protocols is challenging and error-prone. A model-driven development approach allows the automatic generation of an application, from a simpler and abstract model that can be formally verified. Our AnBx compiler is a tool for automatic generation of Java code of security protocols specified in the Alice&Bob notation. In contrast with existing tools, it uses a simp...

Alice wants to communicate securely to Bob in the presence of an eavesdropper Eve. There are two resources available to facilitate this. First, Alice, Bob (and Eve) have access to dependent source observations. Secondly, there is a noisy broadcast channel from Alice to Bob and Eve. Under this general source and channel setup, we are interested in three classes of problems. First, what is the se...

We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer systems, we show, using permutation symmetry and a de Finetti reduction, how the random coding capacity (classical and quantum) of the QAVC is reduced to the ca...

Grids allow users flexible on-demand usage of computing resources through remote communication networks. A remarkable example of a Grid in High Energy Physics (HEP) research is used in the ALICE experiment at European Organization for Nuclear Research CERN. Physicists can submit jobs used to process the huge amount of particle collision data produced by the Large Hadron Collider (LHC). Grids fa...

Take the case of horse racing as an example, we can think of each expert predicting the probability that each horse will win. Another way to motivate this model is to consider coding theory. Suppose Alice wants to send Bob a file consisting of messages x1, . . . , xt, . . . xT , where xt ∈ X, the set of all possible messages. Alice can wait until she sees all messages, which is an offline appro...

A bit-commitment protocol involves two party: a sender (say Alice) and a receiver (say Bob). Alice has a classical string in mind, which she wants to communicate to Bob at a later time. In order to guarantee that she will not change her mind in the interim, Alice agrees to lock her commitment in a safe which she sends to Bob, but keeps the key of the safe. At the moment of truth, Alice unveils ...