Revisiting Coptotermes (Isoptera: Rhinotermitidae): a global taxonomic road map for species validity and distribution of an economically important subterranean termite genus

Coptotermes Wasmann (Isoptera: Rhinotermitidae) is one of the most economically important subterranean termite genera and some species are successful invaders. However, despite its important pest status, the taxonomic validity of many named Coptotermes species remains unclear. In this study, we reviewed all named species within the genus and investigated evidence supporting the validity of each named species. Species were systematically scrutinized according to the region of their original description: Southeast Asia, India, China, Africa, the Neotropics, and Australia. We estimate that of the currently 69 named species described by accepted nomenclatural rules, only 21 taxa have solid evidence for validity, 44 names have uncertain status, and the remaining species names should be synonymized or were made unavailable. Species with high degrees of invasiveness may be known under additional junior synonyms due to independent parochial descriptions. Molecular data for a vast majority of species are scarce and significant effort is needed to complete the taxonomic and phylogenetic revision of the genus. Because of the wide distribution of Coptotermes, we advocate for an integrative taxonomic effort to establish the distribution of each putative species, provide specimens and corresponding molecular data, check original descriptions and type specimens (if available), and provide evidence for a more robust phylogenetic position of each species. This study embodies both consensus and contention of those studying Coptotermes and thus pinpoints the current uncertainty of many species. This project is intended to be a roadmap for identifying those Coptotermes species names that need to be more thoroughly investigated, as an incentive to complete a necessary revision process.

Expected Performance of the ATLAS Experiment - Detector, Trigger and Physics

A detailed study is presented of the expected performance of the ATLAS detector. The reconstruction of tracks, leptons, photons, missing energy and jets is investigated, together with the performance of b-tagging and the trigger. The physics potential for a variety of interesting physics processes, within the Standard Model and beyond, is examined. The study comprises a series of notes based on simulations of the detector and physics processes, with particular emphasis given to the data expected from the first years of operation of the LHC at CERN.

Dolezal's theorem revisited

This paper presents an improved version of Dolezal's theorem, in the area of linear algebra with continuously parametrized elements. An extension of the theorem is also presented, and applications of these results to system theory are indicated.

Superconformal transformations of theN=4 supersymmetric Yang-Mills theory

We obtain the superconformal transformation laws of theN=4 supersymmetric Yang-Mills theory and explicitly demonstrate the closure of the algebra.

A multiplier theorem for the sublaplacian on the Heisenberg group

A multiplier theorem for the sublaplacian on the Heisenberg group is proved using Littlewood-Paley-Stein theory of g-functions.

Path-integral derivation of the superconformal anomaly for the N=1 supersymmetric Yang-Mills theory

Fujikawa's method of evaluating the supercurrent and the superconformal current anomalies, using the heat-kernel regularization scheme, is extended to theories with gauge invariance, in particular, to the off-shell N=1 supersymmetric Yang-Mills (SSYM) theory. The Jacobians of supersymmetry and superconformal transformations are finite. Although the gauge-fixing term is not supersymmetric and the regularization scheme is not manifestly supersymmetric, we find that the regularized Jacobians are gauge invariant and finite and they can be expressed in such a way that there is no one-loop supercurrent anomaly for the N=1 SSYM theory. The superconformal anomaly is nonzero and the anomaly agrees with a similar result obtained using other methods.

A Circuit-Based Proof of Toda′s Theorem

We present a simple proof of Toda′s result (Toda (1989), in "Proceedings, 30th Annual IEEE Symposium on Foundations of Computer Science," pp. 514-519), which states that circled plus P is hard for the Polynomial Hierarchy under randomized reductions. Our approach is circuit-based in the sense that we start with uniform circuit definitions of the Polynomial Hierarchy and apply the Valiant-Vazirani lemma on these circuits (Valiant and Vazirani (1986), Thoeret. Comput. Sci.47, 85-93).

Experimental Test of the Quantum No-Hiding Theorem

The no-hiding theorem says that if any physical process leads to bleaching of quantum information from the original system, then it must reside in the rest of the Universe with no information being hidden in the correlation between these two subsystems. Here, we report an experimental test of the no-hiding theorem with the technique of nuclear magnetic resonance. We use the quantum state randomization of a qubit as one example of the bleaching process and show that the missing information can be fully recovered up to local unitary transformations in the ancilla qubits.

Central Limit Theorem for truncated heavy tailed Banach valued random vectors

In this paper the question of the extent to which truncated heavy tailed random vectors, taking values in a Banach space, retain the characteristic features of heavy tailed random vectors, is answered from the point of view of the central limit theorem.

A compact proof of Fisher�s Fundamental Theorem for multiple loci

A systematic method is formulated to carry out theoretical analysis in a multilocus multiallele genetic system. As a special application, the Fundamental Theorem of Natural Selection is proved (in the continuous time model) for a multilocus multiallele system if all pairwise linkage disequilibria are zero.

The Borkar-Meyn theorem for asynchronous stochastic approximations

In this paper, we give a generalization of a result by Borkar and Meyn (2000) 1], on the stability and convergence of synchronous-update stochastic approximation algorithms, to the case of asynchronous stochastic approximations with delays. We then describe an interesting application of the result to asynchronous distributed temporal difference (TD) learning with function approximation and delays. (C) 2011 Elsevier B.V. All rights reserved.

Variants of Miyachi�s Theorem for Nilpotent lie Groups

We formulate and prove two versions of Miyachi�s theorem for connected, simply connected nilpotent Lie groups. This allows us to prove the sharpness of the constant 1/4 in the theorems of Hardy and of Cowling and Price for any nilpotent Lie group. These theorems are proved using a variant of Miyachi�s theorem for the group Fourier transform.