One of the most challenging but largely unaddressed problems in pervasive computing is that of efficiently creating interactive information summaries that are individually tailored to a wide variety of pervasive devices and contexts. We are developing a new software entity to address this problem that will dynamically generate appropriate interactive information summaries that can be communicat...

One aspect of the utility of gambling may evidence itself in failures of idempotence, i.e., when all chance outcomes give rise to the same consequence the ‘gamble’ may not be indifferent to its common consequence. Under the assumption of segregation, such gambles can be expressed as the joint receipt of the common consequence and what we call ‘an element of chance’, namely, the same gamble with...

Conjecture, and the big and small Cohen Macaulay Conjectures. Many of these are shown to imply others. This document contains notes for a course taught by Tom Marley during the 2009 spring semester at the University of Nebraska-Lincoln. The notes loosely follow the treatment given in Chapters 8 and 9 of Cohen-Macaulay Rings, by W. Bruns and J. Herzog, although many other sources, including arti...

This study used a signal detection paradigm to explore the Marley hypothesis--that group differences in perception of racism reflect dominant-group denial of and ignorance about the extent of past racism. White American students from a midwestern university and Black American students from two historically Black universities completed surveys about their historical knowledge and perception of r...

Communication and Third Parties: Costs, Cues, and Confidentiality by Krishnan Eswaran Doctor of Philosophy in Engineering—Electrical Engineering and Computer Sciences and the Designated Emphasis in Communication, Computation, and Statistics University of California, Berkeley Professor Michael Gastpar, Chair This thesis tells the story of Alice and Bob, who wish to share information. However, Al...

In this paper we consider a new and efficient optimistic nonrepudiation protocol. In a non-repudiation protocol, during which Alice wants to transmit a message to Bob, Alice has to send a non-repudiation of origin evidence to Bob (attesting that Alice is at the origin of the transmitted message), and Bob has to send a non-repudiation of receipt evidence to Alice (attesting Bob’s receipt of the ...

We consider a simple streaming game between two players Alice and Bob, which we call the mirror game. In this game, Alice and Bob take turns saying numbers belonging to the set {1, 2, . . . , 2N}. A player loses if they repeat a number that has already been said. Bob, who goes second, has a very simple (and memoryless) strategy to avoid losing: whenever Alice says x, respond with 2N+1−x. The qu...