Equilibrium bandwidth and buffer allocations for elastic traffics

Consider a set of users sharing a network node under an allocation scheme that provides each user with a fixed minimum and a random extra amount of bandwidth and buffer. Allocations and prices are adjusted to adapt to resource availability and user demands. Equilibrium is achieved when all users optimize their utility and demand equals supply for nonfree resources. We analyze two models of user behavior. We show that at equilibrium expected return on purchasing variable resources can be higher than that on fixed resources. Thus users must balance the marginal increase in utility due to higher return on variable resources and the marginal decrease in utility due to their variability. For the first user model we further show that at equilibrium where such tradeoff is optimized all users hold strictly positive amounts of variable bandwidth and buffer. For the second model we show that if both variable bandwidth and buffer are scarce then at equilibrium every user either holds both variable resources or none

Electronic marking and identification techniques to discourage document copying

Modern computer networks make it possible to distribute documents quickly and economically by electronic means rather than by conventional paper means. However, the widespread adoption of electronic distribution of copyrighted material is currently impeded by the ease of illicit copying and dissemination. In this paper we propose techniques that discourage illicit distribution by embedding each document with a unique codeword. Our encoding techniques are indiscernible by readers, yet enable us to identify the sanctioned recipient of a document by examination of a recovered document. We propose three coding methods, describe one in detail, and present experimental results showing that our identification techniques are highly reliable, even after documents have been photocopied

Quantum Inference on Bayesian Networks

Performing exact inference on Bayesian networks is known to be #P-hard. Typically approximate inference techniques are used instead to sample from the distribution on query variables given the values $e$ of evidence variables. Classically, a single unbiased sample is obtained from a Bayesian network on $n$ variables with at most $m$ parents per node in time $\mathcal{O}(nmP(e)^{-1})$, depending critically on $P(e)$, the probability the evidence might occur in the first place. By implementing a quantum version of rejection sampling, we obtain a square-root speedup, taking $\mathcal{O}(n2^mP(e)^{-\frac12})$ time per sample. We exploit the Bayesian network's graph structure to efficiently construct a quantum state, a q-sample, representing the intended classical distribution, and also to efficiently apply amplitude amplification, the source of our speedup. Thus, our speedup is notable as it is unrelativized -- we count primitive operations and require no blackbox oracle queries.Comment: 8 pages, 3 figures. Submitted to PR

Hamiltonian Simulation by Qubitization

We present the problem of approximating the time-evolution operator $e^{-i\hat{H}t}$ to error $\epsilon$, where the Hamiltonian $\hat{H}=(\langle G|\otimes\hat{\mathcal{I}})\hat{U}(|G\rangle\otimes\hat{\mathcal{I}})$ is the projection of a unitary oracle $\hat{U}$ onto the state $|G\rangle$ created by another unitary oracle. Our algorithm solves this with a query complexity $\mathcal{O}\big(t+\log({1/\epsilon})\big)$ to both oracles that is optimal with respect to all parameters in both the asymptotic and non-asymptotic regime, and also with low overhead, using at most two additional ancilla qubits. This approach to Hamiltonian simulation subsumes important prior art considering Hamiltonians which are $d$-sparse or a linear combination of unitaries, leading to significant improvements in space and gate complexity, such as a quadratic speed-up for precision simulations. It also motivates useful new instances, such as where $\hat{H}$ is a density matrix. A key technical result is `qubitization', which uses the controlled version of these oracles to embed any $\hat{H}$ in an invariant $\text{SU}(2)$ subspace. A large class of operator functions of $\hat{H}$ can then be computed with optimal query complexity, of which $e^{-i\hat{H}t}$ is a special case.Comment: 23 pages, 1 figure; v2: updated notation; v3: accepted versio

Finite geometry models of electric field noise from patch potentials in ion traps

We model electric field noise from fluctuating patch potentials on conducting surfaces by taking into account the finite geometry of the ion trap electrodes to gain insight into the origin of anomalous heating in ion traps. The scaling of anomalous heating rates with surface distance, $d$, is obtained for several generic geometries of relevance to current ion trap designs, ranging from planar to spheroidal electrodes. The influence of patch size is studied both by solving Laplace's equation in terms of the appropriate Green's function as well as through an eigenfunction expansion. Scaling with surface distance is found to be highly dependent on the choice of geometry and the relative scale between the spatial extent of the electrode, the ion-electrode distance, and the patch size. Our model generally supports the $d^{-4}$ dependence currently found by most experiments and models, but also predicts geometry-driven deviations from this trend

Can cash transfer programs work in resource-poor countries?

Cash transfer programs are rare in Sub-Saharan Africa. This paper describes the evolution of a cash transfer program in major urban centers of Mozambique, from its inception in 1990 through two major reorganizations until October 1998. Appropriate design, strong multisectoral political support and adequate administrative capacity are critical factors determining the success of such programs. Key lessons applicable to other resource-poor countries designing social assistance programs are drawn, recommending adequate targeted support to truly destitute persons incapable of physical labor in urban areas where administrative costs are more manageable than in more isolated rural sites.Poverty. ,Rural population. ,Social service Mozambique. ,Subsidies. ,

Effective Temperature Of Uranus

NASA NGR 09-015-047, NGR 22-007-270, NGR 44-012-152Astronom