Comparative cytogenetics of bats (Chiroptera): The prevalence of Robertsonian translocations limits the power of chromosomal characters in resolving interfamily phylogenetic relationships

Although the monophyly of Chiroptera is well supported by many independent studies, higher-level systematics, e.g. the monophyly of microbats, remains disputed by morphological and molecular studies. Chromosomal rearrangements, as one type of rare genomic changes, have become increasingly popular in phylogenetic studies as alternatives to molecular and other morphological characters. Here, the representatives of families Megadermatidae and Emballonuridae are studied by comparative chromosome painting for the first time. The results have been integrated into published comparative maps, providing an opportunity to assess genome-wide chromosomal homologies between the representatives of eight bat families. Our results further substantiate the wide occurrence of Robertsonian translocations in bats, with the possible involvement of whole-arm reciprocal translocations (WARTs). In order to search for valid cytogenetic signature(s) for each family and superfamily, evolutionary chromosomal rearrangements identified by chromosomal painting and/or banding comparison are subjected to two independent analyses: (1) a cladistic analysis using parsimony and (2) the mapping of these chromosomal changes onto the molecularly defined phylogenetic tree available fromthe literature. Both analyses clearly indicate the prevalence of homoplasic events that reduce the reliability of chromosomal characters for resolving interfamily relationships in bats.

The Power of Partnerships in Global Governance

Abrahamsen, Rita, 'The Power of Partnerships in Global Governance', Third World Quarterly (2004) 25(8) pp.1453-1467 RAE2008

A Lower-Bound Result on the Power of a Genetic Algorithm

This paper presents a lower-bound result on the computational power of a genetic algorithm in the context of combinatorial optimization. We describe a new genetic algorithm, the merged genetic algorithm, and prove that for the class of monotonic functions, the algorithm finds the optimal solution, and does so with an exponential convergence rate. The analysis pertains to the ideal behavior of the algorithm where the main task reduces to showing convergence of probability distributions over the search space of combinatorial structures to the optimal one. We take exponential convergence to be indicative of efficient solvability for the sample-bounded algorithm, although a sampling theory is needed to better relate the limit behavior to actual behavior. The paper concludes with a discussion of some immediate problems that lie ahead.

Geometric Generalizations of the Power of Two Choices

A well-known paradigm for load balancing in distributed systems is the``power of two choices,''whereby an item is stored at the less loaded of two (or more) random alternative servers. We investigate the power of two choices in natural settings for distributed computing where items and servers reside in a geometric space and each item is associated with the server that is its nearest neighbor. This is in fact the backdrop for distributed hash tables such as Chord, where the geometric space is determined by clockwise distance on a one-dimensional ring. Theoretically, we consider the following load balancing problem. Suppose that servers are initially hashed uniformly at random to points in the space. Sequentially, each item then considers d candidate insertion points also chosen uniformly at random from the space,and selects the insertion point whose associated server has the least load. For the one-dimensional ring, and for Euclidean distance on the two-dimensional torus, we demonstrate that when n data items are hashed to n servers,the maximum load at any server is log log n / log d + O(1) with high probability. While our results match the well-known bounds in the standard setting in which each server is selected equiprobably, our applications do not have this feature, since the sizes of the nearest-neighbor regions around servers are non-uniform. Therefore, the novelty in our methods lies in developing appropriate tail bounds on the distribution of nearest-neighbor region sizes and in adapting previous arguments to this more general setting. In addition, we provide simulation results demonstrating the load balance that results as the system size scales into the millions.

Bounds on the Power of Constant-Depth Quantum Circuits

We show that if a language is recognized within certain error bounds by constant-depth quantum circuits over a finite family of gates, then it is computable in (classical) polynomial time. In particular, our results imply EQNC^0 ⊆ P, where EQNC^0 is the constant-depth analog of the class EQP. On the other hand, we adapt and extend ideas of Terhal and DiVincenzo [?] to show that, for any family

Information processing without brains--the power of intercellular regulators in plants.

Plants exhibit different developmental strategies than animals; these are characterized by a tight linkage between environmental conditions and development. As plants have neither specialized sensory organs nor a nervous system, intercellular regulators are essential for their development. Recently, major advances have been made in understanding how intercellular regulation is achieved in plants on a molecular level. Plants use a variety of molecules for intercellular regulation: hormones are used as systemic signals that are interpreted at the individual-cell level; receptor peptide-ligand systems regulate local homeostasis; moving transcriptional regulators act in a switch-like manner over small and large distances. Together, these mechanisms coherently coordinate developmental decisions with resource allocation and growth.

The Power of Plankton

This animation is aimed at all age groups of the general public. The animation promotes the importance of plankton and the long term Continuous Plankton Recorder (CPR) survey.