We propose a protocol to transfer a one-time-pad (in a probabilistic manner) from Alice to Bob, over a public channel. The proposed protocol is unique because Bob merely acts as the receiver of the pad (secret key), i.e. Bob does not need to send any message back to Alice unless he detects eavesdropping. Such a secure transfer of one-time-pad, over public channel, is not possible in classical c...

As a senior faculty member of the Courant Institute at NYU since 1965 and a charter member of its Computer Science Department, founded in 1969, I knew Bob Paige as a graduate student and later as a colleague. My own area of expertise is mathematical logic, and so was only very peripherally connected with Bob’s work. But being directly involved with decisions about Bob’s faculty appointment and ...

In this thesis, I introduce a new melody representation scheme and a machine learning framework that enables customized interaction between a live, improvising musician and the computer. The ultimate intent of these technologies is to provide the infrastructure needed to intimately couple the computer with a musician's all-too-transient improvisations; potential applications range from improvis...

a. To check that the graph is represented correctly, Bob asks Alice to remove all the paper cups covering the endpoints of every edge. This reveals an isomorphism to the original graph, which Bob cannot check efficiently; thus, Bob also removes the paper cups corresponding to the green numbers, revealing the original labelling of the vertices. This reveals nothing about the vertex cover, but al...

We describe a simple scheme that allows an agent to learn about its environment in an unsupervised manner. Our scheme pits two versions of the same agent, Alice and Bob, against one another. Alice proposes a task for Bob to complete; and then Bob attempts to complete the task. In this work we will focus on two kinds of environments: (nearly) reversible environments and environments that can be ...

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

BOB.1/OBF.1 is a lymphocyte-restricted transcriptional coactivator. It binds together with the Oct1 and Oct2 transcription factors to DNA and enhances their transactivation potential. Mice deficient for the transcriptional coactivator BOB.1/OBF.1 show several defects in differentiation, function and signaling of B cells. In search of BOB.1/OBF.1 regulated genes we identified Btk--a cytoplasmic ...

Let R be a local ring of positive characteristic and X complex with nonzero finitely generated homology finite injective dimension. We prove that if the derived base change via Frobenius (or more generally, contracting) endomorphism has dimension then is Gorenstein. In particular, we give an affirmative answer to question by Falahola Marley [7, Question 3.9].

One way to use Diffie-Hellman’s 1976 secret key exchange protocol is to create a key to be used in later rounds for symmetric encryption. This requires multiple rounds of communication. Rivest, Shamir, and Adleman in 1978 developed the one round communication scheme discussed earlier. Namely, in order for Bob to receive messages Bob produces an integer N = pq where p and q are primes of equal l...

In this special issue of Visual Neuroscience , we present a series of papers to honor the life and career of Robert William Rodieck, who passed away at his home in Seattle on September 30, 2003. Rodieck held the E.K. Bishop Professorship in Ophthalmology at the University of Washington Medical Center from 1978-1997. Known to everyone as "Bob," he leaves behind an intellectual legacy often admir...