Symmetric and Synchronous Communication in Peer-to-Peer Networks

Motivated by distributed implementations of game-theoretical algorithms, we study symmetric process systems and the problem of attaining common knowledge between processes. We formalize our setting by defining a notion of peer-to-peer networks(*) and appropriate symmetry concepts in the context of Communicating Sequential Processes (CSP), due to the common knowledge creating effects of its synchronous communication primitives. We then prove that CSP with input and output guards makes common knowledge in symmetric peer-to-peer networks possible, but not the restricted version which disallows output statements in guards and is commonly implemented. (*) Please note that we are not dealing with fashionable incarnations such as file-sharing networks, but merely use this name for a mathematical notion of a network consisting of directly connected peers "treated on an equal footing", i.e. not having a client-server structure or otherwise pre-determined roles.)Comment: polished, modernized references; incorporated referee feedback from MPC'0

B-meson decay constants with domain-wall light quarks and nonperturbatively tuned relativistic b-quarks

We report on our progress to obtain the decay constants f_B and f_Bs from lattice-QCD simulations on the RBC-UKQCD Collaborations 2+1 flavor domain-wall Iwasaki lattices. Using domain-wall light quarks and relativistic b-quarks we analyze data with several partially quenched light-quark masses at two lattice spacings of a approx 0.11 fm and a approx 0.08 fm.Comment: Updated data analysis. 7 pages, 7 figures, presented at the 31st International Symposium on Lattice Field Theory (Lattice 2013), 29 July - 3 August 2013, Mainz, German

Finiteness Properties of Chevalley Groups over the Laurent Polynomial Ring over a Finite Field

We show that if G is a Chevalley group of rank n and F_q[t,t^{-1}] is the ring of Laurent polynomials over a finite field, then G(F_q[t,t^{-1}]) is of type F_{2n-1}. This bound is optimal because it is known -- and we show again -- that the group is not of type F_{2n}.Comment: 36 pages, 4 figure

Characterizing perfect recall using next-step temporal operators in S5 and sub-S5 Epistemic Temporal Logic

We review the notion of perfect recall in the literature on interpreted systems, game theory, and epistemic logic. In the context of Epistemic Temporal Logic (ETL), we give a (to our knowledge) novel frame condition for perfect recall, which is local and can straightforwardly be translated to a defining formula in a language that only has next-step temporal operators. This frame condition also gives rise to a complete axiomatization for S5 ETL frames with perfect recall. We then consider how to extend and consolidate the notion of perfect recall in sub-S5 settings, where the various notions discussed are no longer equivalent

Organic food prices and the consumer - review of the evidence

There is a lack of research on actual organic price knowledge and on how consumers deal with prices during information search and purchase decision at the point of sale. Further research into this can help market actors to strike the balance between price as a barrier and as a cue to quality perception. Research on consumers and organic food prices should increasingly differentiate between organic consumer segments, product categories, distribution channel and brands. Such research will guide market actors towards more targeted pricing strategies that can support further market growth

Non-Hermitian Polynomial Hybrid Monte Carlo

We report on a new variant of the hybrid Monte Carlo algorithm employing a polynomial approximation of the inverse of the non-Hermitian Dirac-Wilson operator. Our approximation relies on simple and stable recurrence relations of complex Chebyshev polynomials. First performance figures are presented.Comment: 7 pages, 4 figures, talk presented at the XXVI International Symposium on Lattice Field Theory, July 14-19, 2008, Williamsburg, Virginia, US