Phylogeny and cryptic diversity in geckos (Phyllopezus; Phyllodactylidae; Gekkota) from South America's open biomes

The gecko genus Phyllopezus occurs across South America's open biomes: Cerrado, Seasonally Dry Tropical Forests (SDTF, including Caatinga), and Chaco. We generated a multi-gene dataset and estimated phylogenetic relationships among described Phyllopezus taxa and related species. We included exemplars from both described Phyllopezus pollicaris subspecies, P. p. pollicaris and P. p. przewalskii. Phylogenies from the concatenated data as well as species trees constructed from individual gene trees were largely congruent. All phylogeny reconstruction methods showed Bogertia lutzae as the sister species of Phyllopezus maranjonensis, rendering Phyllopezus paraphyletic. We synonymized the monotypic genus Bogertia with Phyllopezus to maintain a taxonomy that is isomorphic with phylogenetic history. We recovered multiple, deeply divergent, cryptic lineages within P. pollicaris. These cryptic lineages possessed mtDNA distances equivalent to distances among other gekkotan sister taxa. Described P. pollicaris subspecies are not reciprocally monophyletic and current subspecific taxonomy does not accurately reflect evolutionary relationships among cryptic lineages. We highlight the conservation significance of these results in light of the ongoing habitat loss in South America's open biomes. (C) 2011 Elsevier Inc. All rights reserved.

On universal Banach spaces of density continuum

We consider the question whether there exists a Banach space X of density continuum such that every Banach space of density at most continuum isomorphically embeds into X (called a universal Banach space of density c). It is well known that a""(a)/c (0) is such a space if we assume the continuum hypothesis. Some additional set-theoretic assumption is indeed needed, as we prove in the main result of this paper that it is consistent with the usual axioms of set-theory that there is no universal Banach space of density c. Thus, the problem of the existence of a universal Banach space of density c is undecidable using the usual axioms of set-theory. We also prove that it is consistent that there are universal Banach spaces of density c, but a""(a)/c (0) is not among them. This relies on the proof of the consistency of the nonexistence of an isomorphic embedding of C([0, c]) into a""(a)/c (0).

GEOMETRIC RELATIONS BETWEEN SPACES OF NUCLEAR OPERATORS AND SPACES OF COMPACT OPERATORS

We extend and provide a vector-valued version of some results of C. Samuel about the geometric relations between the spaces of nuclear operators N(E, F) and spaces of compact operators K(E, F), where E and F are Banach spaces C(K) of all continuous functions defined on the countable compact metric spaces K equipped with the supremum norm. First we continue Samuel's work by proving that N(C(K-1), C(K-2)) contains no subspace isomorphic to K(C(K-3), C(K-4)) whenever K-1, K-2, K-3 and K-4 are arbitrary infinite countable compact metric spaces. Then we show that it is relatively consistent with ZFC that the above result and the main results of Samuel can be extended to C(K-1, X), C(K-2,Y), C(K-3, X) and C(K-4, Y) spaces, where K-1, K-2, K-3 and K-4 are arbitrary infinite totally ordered compact spaces; X comprises certain Banach spaces such that X* are isomorphic to subspaces of l(1); and Y comprises arbitrary subspaces of l(p), with 1 < p < infinity. Our results cover the cases of some non-classical Banach spaces X constructed by Alspach, by Alspach and Benyamini, by Benyamini and Lindenstrauss, by Bourgain and Delbaen and also by Argyros and Haydon.

Algebraic-graph method for identification of islanding in power system grids

In this paper, a new algebraic-graph method for identification of islanding in power system grids is proposed. The proposed method identifies all the possible cases of islanding, due to the loss of a equipment, by means of a factorization of the bus-branch incidence matrix. The main features of this new method include: (i) simple implementation, (ii) high speed, (iii) real-time adaptability, (iv) identification of all islanding cases and (v) identification of the buses that compose each island in case of island formation. The method was successfully tested on large-scale systems such as the reduced south Brazilian system (45 buses/72 branches) and the south-southeast Brazilian system (810 buses/1340 branches). (C) 2011 Elsevier Ltd. All rights reserved.

Drell-Yan as a probe of small x partons at the LHC

The predictions of Drell-Yan production of low-mass lepton pairs, at high rapidity at the LHC, are known to depend sensitively on the choice of factorization and renormalization scales. We show how this sensitivity can be greatly reduced by fixing the factorization scale of the LO contribution based on the known NLO matrix element, so that observations of this process at the LHC can make direct measurements of parton distribution functions in the low x domain; x less than or similar to 10(-4).

On simple Lie algebras over a field of characteristic 2

We prove that the simple Lie algebras constructed by G. Jurman (2004) in 121 are isomorphic to Hamiltonian algebras. As a corollary we answer all questions formulated in G. Jurman (2004) [2] about isomorphisms of these algebras. (C) 2012 Elsevier Inc. All rights reserved.

Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks

Semi-qualitative probabilistic networks (SQPNs) merge two important graphical model formalisms: Bayesian networks and qualitative probabilistic networks. They provade a very Complexity of inferences in polytree-shaped semi-qualitative probabilistic networks and qualitative probabilistic networks. They provide a very general modeling framework by allowing the combination of numeric and qualitative assessments over a discrete domain, and can be compactly encoded by exploiting the same factorization of joint probability distributions that are behind the bayesian networks. This paper explores the computational complexity of semi-qualitative probabilistic networks, and takes the polytree-shaped networks as its main target. We show that the inference problem is coNP-Complete for binary polytrees with multiple observed nodes. We also show that interferences can be performed in time linear in the number of nodes if there is a single observed node. Because our proof is construtive, we obtain an efficient linear time algorithm for SQPNs under such assumptions. To the best of our knowledge, this is the first exact polynominal-time algorithm for SQPn. Together these results provide a clear picture of the inferential complexity in polytree-shaped SQPNs.

Multimodality and flexibility of stochastic gene expression

We consider a general class of mathematical models for stochastic gene expression where the transcription rate is allowed to depend on a promoter state variable that can take an arbitrary (finite) number of values. We provide the solution of the master equations in the stationary limit, based on a factorization of the stochastic transition matrix that separates timescales and relative interaction strengths, and we express its entries in terms of parameters that have a natural physical and/or biological interpretation. The solution illustrates the capacity of multiple states promoters to generate multimodal distributions of gene products, without the need for feedback. Furthermore, using the example of a three states promoter operating at low, high, and intermediate expression levels, we show that using multiple states operons will typically lead to a significant reduction of noise in the system. The underlying mechanism is that a three-states promoter can change its level of expression from low to high by passing through an intermediate state with a much smaller increase of fluctuations than by means of a direct transition.