Author Roger Bivand , with contributions by Micah Altman, Luc Anselin, Renato Assunção, Olaf Berke, Andrew Bernat, Eric Blankmeyer, Marilia Carvalho, Yongwan Chun, Bjarke Christensen, Carsten Dormann, Stéphane Dray, Rein Halbersma, Elias Krainski, Nicholas Lewin-Koh, Hongfei Li, Jielai Ma, Giovanni Millo, Werner Mueller, Hisaji Ono, Pedro Peres-Neto, Gianfranco Piras, Marku...

We present a Monte Carlo algorithm for efficiently finding near optimal moves and bids in the game of Bidding Hex. The algorithm is based on the recent solution of Random-Turn Hex by Peres, Schramm, Sheffield, and Wilson together with Richman’s work connecting random-turn games to bidding games.

Generalized quantum measurements with N distinct outcomes are used for determining the density matrix, of order d, of an ensemble of quantum systems. The resulting probabilities are represented by a point in an N-dimensional space. It is shown that this point lies in a convex domain having at most d − 1 dimensions. ∗Electronic address: [email protected] †Electronic address: terno@phys...

A theorem of Glasner from 1979 shows that if \(A \subset \mathbb{T}= \mathbb{R}/\mathbb{Z}\) is infinite, then for each ϵ > 0 there exists an integer n such nA ϵ-dense and Berend—Peres later showed in fact one can take to be the form f(m) any non-constant f(x) ∈ ℤ[x]. Alon Peres provided a general framework this problem has been used by Kelly—Lê Dong show same property holds various linear acti...

I will argue that the Peres-Mermin square does not necessarily rule out a value-definite (deterministic) noncontextual hidden variable model if operators are given physical interpretation satisfying following two requirements: (i) each operator is uniquely realized by single measurement; (ii) commuting simultaneous measurements. To underpin this claim, construct three models for different reali...

We study the cover time τcov by (continuous-time) random walk on the 2D box of side length n with wired boundary or on the 2D torus, and show that in both cases with probability approaching 1 as n increases, √ τcov = √ 2n2[ √ 2/π logn + O(log log n)]. This improves a result of Dembo, Peres, Rosen, and Zeitouni (2004) and makes progress towards a conjecture of Bramson and Zeitouni (2009).

Maximum a posteriori adaptation method combines the prior knowledge with adaptation data from a new speaker, which has a nice asymptotical property, but has a slow adaptation rate for not modifying unseen models. In a strictly Bayesian approach, prior parameters are assumed known, based on common or subjective knowledge. But a practical solution is to adopt an empirical Bayesian approach, where...

CPoint („Content for PowerPoint“) ist ein semantischer Editor für ELearning Content in Form von MS PowerPoint-Objekten. Er ist als zusätzliches Menü innerhalb des Präsentationseditors MS PowerPoint (PPT) realisiert. Diese invasive Implementierung einer Open Source Software innerhalb einer proprietären Applikation basiert zum einen auf einer user-zentrierten Herangehensweise, die die Bekanntscha...