and technical concerns, inherent limits of k-space speed have almost been reached. An entirely different approach to sub-wavelength resolution in MRI is based on the fact that with a receiver placed near the object the contribution of a signal source to the induced voltage varies appreciably with its relative

We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric space. Each sender wants to transmit a signal to its receiver at a prespecified power level, e. g., all senders use

I first thank my thesis advisors Thiemo Voigt and Adam Dunkels for being my excellent advisors, and also for being the great colleagues you still are. Thiemo and Adam have complemented each other superbly, giving me feedback, perspectives, insights, and having made every single new venture truly fun. My deepest thanks also go to my professor Per Gunningberg, Uppsala University. Per has in a seemingly easy way spotted erroneous assumptions, has valued my research contributions, and has connected my own work with another broader world of research. I want to thank all colleagues in the Networked Embedded Systems group:

In many communications settings, such as wired and wireless local-area networks, when multiple users attempt to access a communication channel at the same time, a conflict results and none of the communications are successful. Contention resolution is the study of distributed transmission

In this paper we study the problem of simulating shared memory on the distributed memory machine (DMM). Our approach uses multiple copies of shared memory cells, distributed among the memory modules of the DMM via universal hashing. The main aim is to design strategies that resolve contention

We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric space. Each sender wants to transmit a signal to its receiver at a prespecified power level, e.g., all senders use

framework. Clustering is done by modified K-means (MKM)--a method that yields more optimal clusters than the conventional K-means method. Text cohesion is modeled by the transition probabilities of an HMM, and term distribution is modeled by the emission probabilities. The final decoding process tags

AWGN channel is discussed as an example. The second contribution is a simple coding scheme for a rewritable channel where the write noise and hidden state are both uniformly distributed. It is shown that this scheme is asymptotically optimal as the number of rewrites gets large.

AWGN channel is discussed as an example. The second contribution is a simple coding scheme for a rewritable channel where the write noise and hidden state are both uniformly distributed. It is shown that this scheme is asymptotically optimal as the number of rewrites gets large. I.

overcoming these difficulties must be developed. In this paper, we develop taxonomy of content distribution techniques that consists of network scaling, endpoint acceleration and protocol and content optimization. We review existing wireline content distribution techniques that will be useful in wireless