Multi-gene phylogenetic analyses were conducted to address the evolution of Clavicipitaceae (Ascomycota). Data are presented here for approximately 5900 base pairs from portions of seven loci: the nuclear ribosomal small and large subunit DNA (nrSSU and nrLSU), beta-tubulin, elongation factor 1alpha (EF-1alpha), the largest and second largest subunits of RNA polymerase II (RPB1 and RPB2), and m...

Cannabinoids, the bioactive constituents of cannabis, exert a wide array effects on brain by engaging Type 1 cannabinoid receptor (CB1R). Accruing evidence supports that action relies context-dependent factors, such as biological characteristics target cell, suggesting cell population-intrinsic molecular cues modulate CB1R-dependent signaling. Here, using yeast two-hybrid-...

Cytochalasin B (CB) prevents cytokinesis in animal cells. In normal cells nuclear division and DNA synthesis are also blocked and the cells, held in the G1 phase of the cell cycle, remain either mononucleate or binucleate. In transformed cell lines DNA synthesis and nuclear division continue and the cells become multinucleate. We have examined the response to CB in two sets of somatic cell hybr...

3 Groups 12 3.1 Basic Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2 Subgroups, Cosets and Lagrange’s Theorem . . . . . . . . . . . . . . . . . . 14 3.3 Finitely Generated Groups . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.4 Permutation Groups and Group Actions . . . . . . . . . . . . . . . . . . . . 19 3.5 The Oribit-Stabiliser Theorem . ....

We give several algorithms for finitely generated subgroups of the modular group PSL2(Z), given by sets of generators. First, we present an algorithm to check whether a finitely generated subgroup H has finite index in the full modular group. Then we discuss how to parametrise the right cosets of H in PSL2(Z), whether the index is finite or not. Further, we explain how an element in H can be wr...

Underspecification, which is essential for specification formalisms, is usually expressed by equivalences, simulations, or logic approaches. We introduce underspecified transition systems (UTSs) as general model general model for underspecification, where, e.g., transitions point to sets of states. We argue for the generality of the UTSs by showing that the class of all UTSs is strictly more ex...

Bimetallic nitrides are now being considered as one of the emerging advanced functional materials due to their characteristic features and remarkable physicochemical properties. Herein, we report a new crystalline bimetallic nitride (Co3ZnN) that belongs to the cubic crystal phase, which was successfully synthesized through direct nitridation of metallic salts as precursors. Co3ZnN nanoparticle...

This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in R defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares (SOS) relaxations. This generalizes results in the recent paper [15], which considers minimizing polynomials on algebraic sets, i.e., sets in R defined by finitel...

For a set S of n lines labeled from 1 to n, we say that S supports an n-vertex planar graph G if for every labeling from 1 to n of its vertices, G has a straight-line crossing-free drawing with each vertex drawn as a point on its associated line. It is known from previous work [4] that no set of n parallel lines supports all n-vertex planar graphs. We show that intersecting lines, even if they ...

We are aiming at a semantics of prioritized logic programs which always selects a preferred answer set, if there is a nonempty set of (standard) answer sets of the given program. It is shown in a seminal paper by Brewka and Eiter that the goal mentioned above is incompatible with their second principle and it is not satisfied in their semantics of prioritized logic programs. Similarly, also acc...