On the equivalence of game and denotational semantics for the probabilistic mu-calculus

The probabilistic (or quantitative) modal mu-calculus is a fixed-point logic de- signed for expressing properties of probabilistic labeled transition systems (PLTS). Two semantics have been studied for this logic, both assigning to every process state a value in the interval [0,1] representing the probability that the property expressed by the formula holds at the state. One semantics is denotational and the other is a game semantics, specified in terms of two-player stochastic games. The two semantics have been proved to coincide on all finite PLTS's, but the equivalence of the two semantics on arbitrary models has been open in literature. In this paper we prove that the equivalence indeed holds for arbitrary infinite models, and thus our result strengthens the fruitful connection between denotational and game semantics. Our proof adapts the unraveling or unfolding method, a general proof technique for proving result of parity games by induction on their complexity

Measurement of the fraction of t-tbar production via gluon-gluon fusion in p-pbar collisions at sqrt(s)=1.96 TeV

We present a measurement of the ratio of t-tbar production cross section via gluon-gluon fusion to the total t-tbar production cross section in p-pbar collisions at sqrt{s}=1.96 TeV at the Tevatron. Using a data sample with an integrated luminosity of 955/pb recorded by the CDF II detector at Fermilab, we select events based on the t-tbar decay to lepton+jets. Using an artificial neural network technique we discriminate between t-tbar events produced via q-qbar annihilation and gluon-gluon fusion, and find Cf=(gg->ttbar)/(pp->ttbar)<0.33 at the 68% confidence level. This result is combined with a previous measurement to obtain the most precise measurement of this quantity, Cf=0.07+0.15-0.07.Comment: submitted to Phys. Rev.

Measurement of Resonance Parameters of Orbitally Excited Narrow B^0 Mesons

We report a measurement of resonance parameters of the orbitally excited (L=1) narrow B^0 mesons in decays to B^{(*)+}\pi^- using 1.7/fb of data collected by the CDF II detector at the Fermilab Tevatron. The mass and width of the B^{*0}_2 state are measured to be m(B^{*0}_2) = 5740.2^{+1.7}_{-1.8}(stat.) ^{+0.9}_{-0.8}(syst.) MeV/c^2 and \Gamma(B^{*0}_2) = 22.7^{+3.8}_{-3.2}(stat.) ^{+3.2}_{-10.2}(syst.) MeV/c^2. The mass difference between the B^{*0}_2 and B^0_1 states is measured to be 14.9^{+2.2}_{-2.5}(stat.) ^{+1.2}_{-1.4}(syst.) MeV/c^2, resulting in a B^0_1 mass of 5725.3^{+1.6}_{-2.2}(stat.) ^{+1.4}_{-1.5}(syst.) MeV/c^2. This is currently the most precise measurement of the masses of these states and the first measurement of the B^{*0}_2 width.Comment: 7 pages, 1 figure, 1 table. Submitted to Phys.Rev.Let

Search for lepton flavor violating decays of a heavy neutral particle in p-pbar collisions at root(s)=1.8 TeV

We report on a search for a high mass, narrow width particle that decays directly to e+mu, e+tau, or mu+tau. We use approximately 110 pb^-1 of data collected with the Collider Detector at Fermilab from 1992 to 1995. No evidence of lepton flavor violating decays is found. Limits are set on the production and decay of sneutrinos with R-parity violating interactions.Comment: Figure 2 fixed. Reference 4 fixed. Minor changes to tex

Optimizing infrared to near infrared upconversion quantum yield of β-NaYF₄:Er³⁺ in fluoropolymer matrix for photovoltaic devices

The present study reports for the first time the optimization of the infrared (1523 nm) to near-infrared (980 nm) upconversion quantum yield (UC-QY) of hexagonal trivalent erbium doped sodium yttrium fluoride (β-NaYF4:Er3+) in a perfluorocyclobutane (PFCB) host matrix under monochromatic excitation. Maximum internal and external UC-QYs of 8.4% ± 0.8% and 6.5% ± 0.7%, respectively, have been achieved for 1523 nm excitation of 970 ± 43 Wm−2 for an optimum Er3+ concentration of 25 mol% and a phosphor concentration of 84.9 w/w% in the matrix. These results correspond to normalized internal and external efficiencies of 0.86 ± 0.12 cm2 W−1 and 0.67 ± 0.10 cm2 W−1, respectively. These are the highest values ever reported for β-NaYF4:Er3+ under monochromatic excitation. The special characteristics of both the UC phosphor β-NaYF4:Er3+ and the PFCB matrix give rise to this outstanding property. Detailed power and time dependent luminescence measurements reveal energy transfer upconversion as the dominant UC mechanism

Model Checking CTL is Almost Always Inherently Sequential

The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations---restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator, we systematically prove model checking to be either inherently sequential (P-complete) or very efficiently parallelizable (LOGCFL-complete). For most fragments, however, model checking for CTL is already P-complete. Hence our results indicate that, in cases where the combined complexity is of relevance, approaching CTL model checking by parallelism cannot be expected to result in any significant speedup. We also completely determine the complexity of the model checking problem for all fragments of the extensions ECTL, CTL+, and ECTL+

Algorithms and Bounds for Very Strong Rainbow Coloring

A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors. The minimum number of colors necessary in such a coloring is the strong rainbow connection number (\src(G)) of the graph. When proving upper bounds on \src(G), it is natural to prove that a coloring exists where, for \emph{every} shortest path between every pair of vertices in the graph, all edges of the path receive different colors. Therefore, we introduce and formally define this more restricted edge coloring number, which we call \emph{very strong rainbow connection number} (\vsrc(G)). In this paper, we give upper bounds on \vsrc(G) for several graph classes, some of which are tight. These immediately imply new upper bounds on \src(G) for these classes, showing that the study of \vsrc(G) enables meaningful progress on bounding \src(G). Then we study the complexity of the problem to compute \vsrc(G), particularly for graphs of bounded treewidth, and show this is an interesting problem in its own right. We prove that \vsrc(G) can be computed in polynomial time on cactus graphs; in contrast, this question is still open for \src(G). We also observe that deciding whether \vsrc(G) = k is fixed-parameter tractable in $k$ and the treewidth of $G$. Finally, on general graphs, we prove that there is no polynomial-time algorithm to decide whether \vsrc(G) \leq 3 nor to approximate \vsrc(G) within a factor $n^{1-\varepsilon}$, unless P$=$NP

Target company cross-border effects in acquisitions into the UK

We analyse the abnormal returns to target shareholders in crossborder and domestic acquisitions of UK companies. The crossborder effect during the bid month is small (0.84%), although crossborder targets gain significantly more than domestic targets during the months surrounding the bid. We find no evidence for the level of abnormal returns in crossborder acquisitions to be associated with market access or exchange rate effects, and only limited support for an international diversification effect. However, the crossborder effect appears to be associated with significant payment effects, and there is no significant residual crossborder effect once various bid characteristics are controlled for

Generic Modal Cut Elimination Applied to Conditional Logics

We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a wide variety of logics outside the realm of normal modal logic. We give extensive example instantiations of our framework to various conditional logics. For these, we obtain fully internalised calculi which are substantially simpler than those known in the literature, along with leaner proofs of cut elimination and complexity. In one case, conditional logic with modus ponens and conditional excluded middle, cut elimination and complexity were explicitly stated as open in the literature

Automated Synthesis of Tableau Calculi

This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau inference rules that can then be used to reason within the logic. The method guarantees that the generated rules form a calculus which is sound and constructively complete. If the logic can be shown to admit finite filtration with respect to a well-defined first-order semantics then adding a general blocking mechanism provides a terminating tableau calculus. The process of generating tableau rules can be completely automated and produces, together with the blocking mechanism, an automated procedure for generating tableau decision procedures. For illustration we show the workability of the approach for a description logic with transitive roles and propositional intuitionistic logic.Comment: 32 page