In previous studies, we have used quantitative methods to examine the effectiveness of the Alice programming language in terms of student enjoyment, confidence, and learning outcomes. However, in terms of the overall quality of a learning experience, quantitative measures provide only part of the story. This paper reports on the use of Alice from a student perspective using qualitative data gat...

Consider three players Alice, Bob and Cath who hold a, b and c cards, respectively, from a deck of d = a+ b+ c cards. The cards are all different and players only know their own cards. Suppose Alice and Bob wish to communicate their cards to each other without Cath learning whether Alice or Bob holds a specific card. Considering the cards as consecutive natural numbers 0, 1, ..., we investigate...

This thesis discusses the issues and challenges associated with the design and operation of a data analysis facility for a high-energy physics experiment at a multi-purpose computing centre. At the spotlight is a Tier-2 centre of the distributed computing model of the ALICE experiment at the Large Hadron Collider at CERN in Geneva, Switzerland. The design steps, examined in the thesis, include ...

Quantum communication is the art of transferring a quantum state from one place to another. Traditionally, the sender is named Alice and the receiver Bob. Th e basic motivation is that quantum states code quantum information — called qubits in the case of two-dimensional Hilbert spaces — and that quantum information allows tasks to be performed that could only be achieved far less effi ciently,...

Information flow policies (labels and lattices) are not stated in terms that administrators and developers articulate security goals (natural language). This raises an important question central to the proposed investigation, “how do you translate higher level policies into information flow implementation?” Our approach is to develop models and algorithms that enable this translation. Consider ...

In classical public key cryptography the security of the cryptosystems are based on the difficulty of calculating certain functions. A famous example is the ASP cryptosystem which was based on the assumption that factoring large integers could not be done in polynomial time (on classical computers). The typical situation in these systems is that two parties (Bob and Alice) whish to communicate ...

Alice and Bob are connected via a two-way binary channel. This paper describes an algorithm to enable Alice to send a message to Bob when 1) an oblivious adversary flips an unknown number of bits, T , on the channel; and 2) the message length L, and a desired error probability, ǫ are public knowledge. With probability at least 1− ǫ, our algorithm ensures that Bob receives the correct message, a...

This paper describes how NOMLEX, a dictionary of nominalizations, can be used in Information Extraction (IE). This paper details a procedure which maps syntactic and semantic information designed for writing an IE pattern for an active clause (IBM appointed Alice Smith as vice president) into a set of patterns for nominaliza-tions (e.g., IBM's appointment of Alice Smith as vice president and Al...

In this work we study the problem of confidential communication when different resources of randomness are available. We start with the relay channel where source observations are available at each terminal. We study the scenario where the transmitter (Alice) sends a private message to the destination (Bob), which is confidential to the relay (Eve). Alice and Bob also want to agree on a secret ...