We present a protocol for performing state merging when multiple parties share a single copy of a mixed state, and analyze the entanglement cost in terms of minand maxentropies. Our protocol allows for interpolation between corner points of the rate region without the need for time-sharing, a primitive which is not available in the one-shot setting. We also compare our protocol to the more naiv...

BACKGROUND Chest CT is a commonly used examination for the diagnosis of lung diseases, but a breast within the scanned field is nearly never the organ of interest. OBJECTIVE The purpose of this study is to compare the female breast and lung doses using split and standard protocols in chest CT scanning. MATERIALS AND METHODS The sliced chest and breast female phantoms were used. CT exams wer...

In this paper we compare two methods for generating finite families of random subsets according to some sequence of independent random variables ζ1, . . . , ζn distributed uniformly over the interval [0, 1]. The first method called uniform split uses ζi values straightforwardly to determine points of division of [0, 1] into subintervals. The second method called binary split uses ζi only to per...

Split-C is a single program, multiple data (SPMD) programming language. Split-C provides the ability to use a shared address space abstraction on a distributed shared memory (DSM) system, such as a network of workstations (NOW). The existing Split-C compiler translates all references to shared variables owned by another processor into network transactions. We implement SWCC-Split-C, a modified ...

Distributed lightpath establishment in WDM optical networks involves, apart from routing, two important steps, namely wavelength selection and wavelength reservation. In uni-wavelength reservation protocols, often multiple connection requests unknowingly compete for the same wavelength, even when other free wavelengths are available, resulting in a collision. Attempting multiple wavelengths for...

W e introduce and discuss a methodology f o r heterogeneous simulations of computer networks using the dynamic simulation backplane. This methodology allows for exchanging of protocol information between simulators across layers of the protocol stack. For example, the simulationist m a y wish to construct a simulation using the rich set of T C P models found in the ns network simulator, and at ...

This paper studies non-cooperative bargaining with random proposers in apex games. Two di¤erent protocols are considered: the egalitarian propocol, which selects each player to be the proposer with the same probability, and the proportional protocol, which selects each player with a probability proportional to his number of votes. Expected equilibrium payo¤s coincide with the kernel for the gra...