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

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.

An Explicit Framework for Interaction Nets

Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on elementary properties of graph theory. We give here a more explicit presentation based on notions borrowed from Girard's Geometry of Interaction: interaction nets are presented as partial permutations and a composition of nets, the gluing, is derived from the execution formula. We then define contexts and reduction as the context closure of rules. We prove strong confluence of the reduction within our framework and show how interaction nets can be viewed as the quotient of some generalized proof-nets

Modal Logics of Topological Relations

Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI. In analogy with Halpern and Shoham's modal logic of time intervals based on the Allen relations, we introduce a family of modal logics equipped with eight modal operators that are interpreted by the Egenhofer-Franzosa (or RCC8) relations between regions in topological spaces such as the real plane. We investigate the expressive power and computational complexity of logics obtained in this way. It turns out that our modal logics have the same expressive power as the two-variable fragment of first-order logic, but are exponentially less succinct. The complexity ranges from (undecidable and) recursively enumerable to highly undecidable, where the recursively enumerable logics are obtained by considering substructures of structures induced by topological spaces. As our undecidability results also capture logics based on the real line, they improve upon undecidability results for interval temporal logics by Halpern and Shoham. We also analyze modal logics based on the five RCC5 relations, with similar results regarding the expressive power, but weaker results regarding the complexity

On the Parameterized Intractability of Monadic Second-Order Logic

One of Courcelle's celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO_2) is fixed-parameter tractable (fpt) on C by linear time parameterized algorithms, where the parameter is the tree-width plus the size of the formula. An immediate question is whether this is best possible or whether the result can be extended to classes of unbounded tree-width. In this paper we show that in terms of tree-width, the theorem cannot be extended much further. More specifically, we show that if C is a class of graphs which is closed under colourings and satisfies certain constructibility conditions and is such that the tree-width of C is not bounded by \log^{84} n then MSO_2-model checking is not fpt unless SAT can be solved in sub-exponential time. If the tree-width of C is not poly-logarithmically bounded, then MSO_2-model checking is not fpt unless all problems in the polynomial-time hierarchy can be solved in sub-exponential time

Strong spin relaxation length dependence on electric field gradients

We discuss the influence of electrical effects on spin transport, and in particular the propagation and relaxation of spin polarized electrons in the presence of inhomogeneous electric fields. We show that the spin relaxation length strongly depends on electric field gradients, and that significant suppression of electron spin polarization can occur as a result thereof. A discussion in terms of a drift-diffusion picture, and self-consistent numerical calculations based on a Boltzmann-Poisson approach shows that the spin relaxation length in fact can be of the order of the charge screening length.Comment: 4 pages, 3 figures, to be presented at PASPSI

A dependent nominal type theory

Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple, dependent and ML-like polymorphic languages have been studied, but decidability and normalization results have only been established for simple nominal type theories. We present a LF-style dependent type theory extended with name-abstraction types, prove soundness and decidability of beta-eta-equivalence checking, discuss adequacy and canonical forms via an example, and discuss extensions such as dependently-typed recursion and induction principles

Ethynyl terminated ester oligomers and polymers therefrom

A new class of ethynyl-terminated oligomers and the process for preparing same are disclosed. Upon the application of heat, with or without a catalyst, the ethynyl groups react to provide crosslinking and chain extension to increase the polymer use temperature and improve the polymer solvent resistance. These improved polyesters are potentially useful in packaging, magnetic tapes, capacitors, industrial belting, protective coatings, structural adhesives and composite matrices

Composition with Target Constraints

It is known that the composition of schema mappings, each specified by source-to-target tgds (st-tgds), can be specified by a second-order tgd (SO tgd). We consider the question of what happens when target constraints are allowed. Specifically, we consider the question of specifying the composition of standard schema mappings (those specified by st-tgds, target egds, and a weakly acyclic set of target tgds). We show that SO tgds, even with the assistance of arbitrary source constraints and target constraints, cannot specify in general the composition of two standard schema mappings. Therefore, we introduce source-to-target second-order dependencies (st-SO dependencies), which are similar to SO tgds, but allow equations in the conclusion. We show that st-SO dependencies (along with target egds and target tgds) are sufficient to express the composition of every finite sequence of standard schema mappings, and further, every st-SO dependency specifies such a composition. In addition to this expressive power, we show that st-SO dependencies enjoy other desirable properties. In particular, they have a polynomial-time chase that generates a universal solution. This universal solution can be used to find the certain answers to unions of conjunctive queries in polynomial time. It is easy to show that the composition of an arbitrary number of standard schema mappings is equivalent to the composition of only two standard schema mappings. We show that surprisingly, the analogous result holds also for schema mappings specified by just st-tgds (no target constraints). This is proven by showing that every SO tgd is equivalent to an unnested SO tgd (one where there is no nesting of function symbols). Similarly, we prove unnesting results for st-SO dependencies, with the same types of consequences.Comment: This paper is an extended version of: M. Arenas, R. Fagin, and A. Nash. Composition with Target Constraints. In 13th International Conference on Database Theory (ICDT), pages 129-142, 201