844 research outputs found

    Extending SATPLAN to Multiple Agents

    Full text link

    Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems

    Get PDF
    The model checking problem for propositional dynamic logic (PDL) over message sequence charts (MSCs) and communicating finite state machines (CFMs) asks, given a channel bound BB, a PDL formula φ\varphi and a CFM C\mathcal{C}, whether every existentially BB-bounded MSC MM accepted by C\mathcal{C} satisfies φ\varphi. Recently, it was shown that this problem is PSPACE-complete. In the present work, we consider CRPDL over MSCs which is PDL equipped with the operators converse and repeat. The former enables one to walk back and forth within an MSC using a single path expression whereas the latter allows to express that a path expression can be repeated infinitely often. To solve the model checking problem for this logic, we define message sequence chart automata (MSCAs) which are multi-way alternating parity automata walking on MSCs. By exploiting a new concept called concatenation states, we are able to inductively construct, for every CRPDL formula φ\varphi, an MSCA precisely accepting the set of models of φ\varphi. As a result, we obtain that the model checking problem for CRPDL and CFMs is still in PSPACE

    The Littlest Higgs

    Full text link
    We present an economical theory of natural electroweak symmetry breaking, generalizing an approach based on deconstruction. This theory is the smallest extension of the Standard Model to date that stabilizes the electroweak scale with a naturally light Higgs and weakly coupled new physics at TeV energies. The Higgs is one of a set of pseudo Goldstone bosons in an SU(5)/SO(5)SU(5)/SO(5) nonlinear sigma model. The symmetry breaking scale ff is around a TeV, with the cutoff \Lambda \lsim 4\pi f \sim 10 TeV. A single electroweak doublet, the ``little Higgs'', is automatically much lighter than the other pseudo Goldstone bosons. The quartic self-coupling for the little Higgs is generated by the gauge and Yukawa interactions with a natural size O(g2,λt2)O(g^2,\lambda_t^2), while the top Yukawa coupling generates a negative mass squared triggering electroweak symmetry breaking. Beneath the TeV scale the effective theory is simply the minimal Standard Model. The new particle content at TeV energies consists of one set of spin one bosons with the same quantum numbers as the electroweak gauge bosons, an electroweak singlet quark with charge 2/3, and an electroweak triplet scalar. One loop quadratically divergent corrections to the Higgs mass are cancelled by interactions with these additional particles.Comment: 15 pages. References added. Corrected typos in the discussion of the top Yukawa couplin

    Detection of 1p19q Deletion by Real-Time Comparative Quantitative PCR

    Get PDF
    1p/19q (1p and/or 19q) deletions are prognostic factors in oligodendroglial tumors (OT) and predict better survival after both chemotherapy and radiotherapy. While studying 1p/19q status as a potential variable within multivariate prognosis models for OT, we have frequently encountered unknown 1p/19q status within our glioma sample database due to lack of paired blood samples for loss of heterozygosity (LOH) assay and/or failure to perform fluorescence in situ hybridization (FISH). We realized that a 1p and 19q deletion assay that could be reliably performed solely on tumor DNA samples would allow us to fill in these molecular biology data “holes”. We built recombinant DNA with fragments of the selected “marker” genes in 1p (E2F2, NOTCH2), and 19q (PLAUR) and “reference” genes (ERC2, SPOCK1, and SPAG16 ) and used it as quantification standard in real-time PCR to gain absolute ratios of marker/reference gene copy numbers in tumor DNA samples, thus called comparative quantitative PCR (CQ-PCR). Using CQ-PCR, we identified 1p and/ or 19q deletions in majority of pure low-grade oligodenroglioma (OG) tumors (17/21, 81%), a large portion of anaplastic oligodendroglioma (AO) tumors (6/15, 47%), but rarely found in mixed oligoastrcytomas (OA) tumors (1/8, 13%). These data are consistent with results of LOH and FISH assays generally reported for these tumor types. In addition, 15 out 18 samples showed concordant results between FISH and CQ-PCR. We conclude that CQ-PCR is a potential means to gain 1p/19q deletion information, which prognostic and predictive values of CQ-PCR-derived 1p/19q status will be determined in a future study

    Comments on Condensates in Non-Supersymmetric Orbifold Field Theories

    Get PDF
    Non-supersymmetric orbifolds of N=1 super Yang-Mills theories are conjectured to inherit properties from their supersymmetric parent. We examine this conjecture by compactifying the Z_2 orbifold theories on a spatial circle of radius R. We point out that when the orbifold theory lies in the weakly coupled vacuum of its parent, fractional instantons do give rise to the conjectured condensate of bi-fundamental fermions. Unfortunately, we show that quantum effects render this vacuum unstable through the generation of twisted operators. In the true vacuum state, no fermion condensate forms. Thus, in contrast to super Yang-Mills, the compactified orbifold theory undergoes a chiral phase transition as R is varied.Comment: 10 Pages. Added clarifying comments, computational steps and a nice pretty pictur

    Duality cascades and duality walls

    Full text link
    We recast the phenomenon of duality cascades in terms of the Cartan matrix associated to the quiver gauge theories appearing in the cascade. In this language, Seiberg dualities for the different gauge factors correspond to Weyl reflections. We argue that the UV behavior of different duality cascades depends markedly on whether the Cartan matrix is affine ADE or not. In particular, we find examples of duality cascades that can't be continued after a finite energy scale, reaching a "duality wall", in terminology due to M. Strassler. For these duality cascades, we suggest the existence of a UV completion in terms of a little string theory.Comment: harvmac, 24 pages, 4 figures. v2: references added. v3: reference adde

    A Composite Little Higgs Model

    Full text link
    We describe a natural UV complete theory with a composite little Higgs. Below a TeV we have the minimal Standard Model with a light Higgs, and an extra neutral scalar. At the TeV scale there are additional scalars, gauge bosons, and vector-like charge 2/3 quarks, whose couplings to the Higgs greatly reduce the UV sensitivity of the Higgs potential. Stabilization of the Higgs mass squared parameter, without finetuning, occurs due to a softly broken shift symmetry--the Higgs is a pseudo Nambu-Goldstone boson. Above the 10 TeV scale the theory has new strongly coupled interactions. A perturbatively renormalizable UV completion, with softly broken supersymmetry at 10 TeV is explicitly worked out. Our theory contains new particles which are odd under an exact "dark matter parity", (-1)^{(2S+3B+L)}. We argue that such a parity is likely to be a feature of many theories of new TeV scale physics. The lightest parity odd particle, or "LPOP", is most likely a neutral fermion, and may make a good dark matter candidate, with similar experimental signatures to the neutralino of the MSSM. We give a general effective field theory analysis of the calculation of corrections to precision electroweak observables.Comment: 28 page

    Matrices commuting with a given normal tropical matrix

    Get PDF
    Consider the space MnnorM_n^{nor} of square normal matrices X=(xij)X=(x_{ij}) over R{}\mathbb{R}\cup\{-\infty\}, i.e., xij0-\infty\le x_{ij}\le0 and xii=0x_{ii}=0. Endow MnnorM_n^{nor} with the tropical sum \oplus and multiplication \odot. Fix a real matrix AMnnorA\in M_n^{nor} and consider the set Ω(A)\Omega(A) of matrices in MnnorM_n^{nor} which commute with AA. We prove that Ω(A)\Omega(A) is a finite union of alcoved polytopes; in particular, Ω(A)\Omega(A) is a finite union of convex sets. The set ΩA(A)\Omega^A(A) of XX such that AX=XA=AA\odot X=X\odot A=A is also a finite union of alcoved polytopes. The same is true for the set Ω(A)\Omega'(A) of XX such that AX=XA=XA\odot X=X\odot A=X. A topology is given to MnnorM_n^{nor}. Then, the set ΩA(A)\Omega^{A}(A) is a neighborhood of the identity matrix II. If AA is strictly normal, then Ω(A)\Omega'(A) is a neighborhood of the zero matrix. In one case, Ω(A)\Omega(A) is a neighborhood of AA. We give an upper bound for the dimension of Ω(A)\Omega'(A). We explore the relationship between the polyhedral complexes spanAspan A, spanXspan X and span(AX)span (AX), when AA and XX commute. Two matrices, denoted A\underline{A} and Aˉ\bar{A}, arise from AA, in connection with Ω(A)\Omega(A). The geometric meaning of them is given in detail, for one example. We produce examples of matrices which commute, in any dimension.Comment: Journal versio

    On the Communication Complexity of Secure Computation

    Full text link
    Information theoretically secure multi-party computation (MPC) is a central primitive of modern cryptography. However, relatively little is known about the communication complexity of this primitive. In this work, we develop powerful information theoretic tools to prove lower bounds on the communication complexity of MPC. We restrict ourselves to a 3-party setting in order to bring out the power of these tools without introducing too many complications. Our techniques include the use of a data processing inequality for residual information - i.e., the gap between mutual information and G\'acs-K\"orner common information, a new information inequality for 3-party protocols, and the idea of distribution switching by which lower bounds computed under certain worst-case scenarios can be shown to apply for the general case. Using these techniques we obtain tight bounds on communication complexity by MPC protocols for various interesting functions. In particular, we show concrete functions that have "communication-ideal" protocols, which achieve the minimum communication simultaneously on all links in the network. Also, we obtain the first explicit example of a function that incurs a higher communication cost than the input length in the secure computation model of Feige, Kilian and Naor (1994), who had shown that such functions exist. We also show that our communication bounds imply tight lower bounds on the amount of randomness required by MPC protocols for many interesting functions.Comment: 37 page
    corecore