A conditional quantum phase gate between two 3-state atoms

We propose a scheme for conditional quantum logic between two 3-state atoms that share a quantum data-bus such as a single mode optical field in cavity QED systems, or a collective vibrational state of trapped ions. Making use of quantum interference, our scheme achieves successful conditional phase evolution without any real transitions of atomic internal states or populating the quantum data-bus. In addition, it only requires common addressing of the two atoms by external laser fields.Comment: 8 fig

Cell sleeping for energy efficiency in cellular networks: Is it viable?

An approach advocated in the recent literature for reducing energy consumption in cellular networks is to put base stations to sleep when traffic loads are low. However, several practical considerations are ignored in these studies. In this paper, we aim to raise questions on the feasibility and benefits of base station sleeping. Specifically we analyze the interference and capacity of a coverage-based energy reduction system in CDMA based cellular networks using a simple analytical model and show that sleeping may not be a feasible solution to reduce energy consumption in many scenarios. © 2012 IEEE

In-Beam Background Suppression Shield

The long (3ms) proton pulse of the European Spallation Source (ESS) gives rise to unique and potentially high backgrounds for the instrument suite. In such a source an instrument capabilities will be limited by it's Signal to Noise (S/N) ratio. The instruments with a direct view of the moderator, which do not use a bender to help mitigate the fast neutron background, are the most challenging. For these beam lines we propose the innovative shielding of placing blocks of material directly into the guide system, which allow a minimum attenuation of the cold and thermal fluxes relative to the background suppression. This shielding configuration has been worked into a beam line model using Geant4. We study particularly the advantages of single crystal sapphire and silicon blocks .Comment: 12 pages, 8 figures, proceeding of NDS 2015, 4th International Workshop on Neutron Delivery Systems, 28 -30 September 2015, ILL Grenoble, Franc

The equivalence problem and rigidity for hypersurfaces embedded into hyperquadrics

We consider the class of Levi nondegenerate hypersurfaces $M$ in \bC^{n+1} that admit a local (CR transversal) embedding, near a point $p\in M$, into a standard nondegenerate hyperquadric in $\Bbb C^{N+1}$ with codimension $k:=N-n$ small compared to the CR dimension $n$ of $M$. We show that, for hypersurfaces in this class, there is a normal form (which is closely related to the embedding) such that any local equivalence between two hypersurfaces in normal form must be an automorphism of the associated tangent hyperquadric. We also show that if the signature of $M$ and that of the standard hyperquadric in \bC^{N+1} are the same, then the embedding is rigid in the sense that any other embedding must be the original embedding composed with an automorphism of the quadric

Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games

Cooperative games provide a framework for fair and stable profit allocation in multi-agent systems. \emph{Core}, \emph{least-core} and \emph{nucleolus} are such solution concepts that characterize stability of cooperation. In this paper, we study the algorithmic issues on the least-core and nucleolus of threshold cardinality matching games (TCMG). A TCMG is defined on a graph $G=(V,E)$ and a threshold $T$, in which the player set is $V$ and the profit of a coalition $S\subseteq V$ is 1 if the size of a maximum matching in $G[S]$ meets or exceeds $T$, and 0 otherwise. We first show that for a TCMG, the problems of computing least-core value, finding and verifying least-core payoff are all polynomial time solvable. We also provide a general characterization of the least core for a large class of TCMG. Next, based on Gallai-Edmonds Decomposition in matching theory, we give a concise formulation of the nucleolus for a typical case of TCMG which the threshold $T$ equals $1$. When the threshold $T$ is relevant to the input size, we prove that the nucleolus can be obtained in polynomial time in bipartite graphs and graphs with a perfect matching

Undulatory swimming in fluids with polymer networks

The motility behavior of the nematode Caenorhabditis elegans in polymeric solutions of varying concentrations is systematically investigated in experiments using tracking and velocimetry methods. As the polymer concentration is increased, the solution undergoes a transition from the semi-dilute to the concentrated regime, where these rod-like polymers entangle, align, and form networks. Remarkably, we find an enhancement in the nematode's swimming speed of approximately 65% in concentrated solutions compared to semi-dilute solutions. Using velocimetry methods, we show that the undulatory swimming motion of the nematode induces an anisotropic mechanical response in the fluid. This anisotropy, which arises from the fluid micro-structure, is responsible for the observed increase in swimming speed.Comment: Published 1 November 2013 in Europhysics Letter