Constraint Satisfaction with Counting Quantifiers

We initiate the study of constraint satisfaction problems (CSPs) in the presence of counting quantifiers, which may be seen as variants of CSPs in the mould of quantified CSPs (QCSPs). We show that a single counting quantifier strictly between exists^1:=exists and exists^n:=forall (the domain being of size n) already affords the maximal possible complexity of QCSPs (which have both exists and forall), being Pspace-complete for a suitably chosen template. Next, we focus on the complexity of subsets of counting quantifiers on clique and cycle templates. For cycles we give a full trichotomy -- all such problems are in L, NP-complete or Pspace-complete. For cliques we come close to a similar trichotomy, but one case remains outstanding. Afterwards, we consider the generalisation of CSPs in which we augment the extant quantifier exists^1:=exists with the quantifier exists^j (j not 1). Such a CSP is already NP-hard on non-bipartite graph templates. We explore the situation of this generalised CSP on bipartite templates, giving various conditions for both tractability and hardness -- culminating in a classification theorem for general graphs. Finally, we use counting quantifiers to solve the complexity of a concrete QCSP whose complexity was previously open

Identifying Signatures of Selection in Genetic Time Series

Both genetic drift and natural selection cause the frequencies of alleles in a population to vary over time. Discriminating between these two evolutionary forces, based on a time series of samples from a population, remains an outstanding problem with increasing relevance to modern data sets. Even in the idealized situation when the sampled locus is independent of all other loci this problem is difficult to solve, especially when the size of the population from which the samples are drawn is unknown. A standard $\chi^2$-based likelihood ratio test was previously proposed to address this problem. Here we show that the $\chi^2$ test of selection substantially underestimates the probability of Type I error, leading to more false positives than indicated by its $P$-value, especially at stringent $P$-values. We introduce two methods to correct this bias. The empirical likelihood ratio test (ELRT) rejects neutrality when the likelihood ratio statistic falls in the tail of the empirical distribution obtained under the most likely neutral population size. The frequency increment test (FIT) rejects neutrality if the distribution of normalized allele frequency increments exhibits a mean that deviates significantly from zero. We characterize the statistical power of these two tests for selection, and we apply them to three experimental data sets. We demonstrate that both ELRT and FIT have power to detect selection in practical parameter regimes, such as those encountered in microbial evolution experiments. Our analysis applies to a single diallelic locus, assumed independent of all other loci, which is most relevant to full-genome selection scans in sexual organisms, and also to evolution experiments in asexual organisms as long as clonal interference is weak. Different techniques will be required to detect selection in time series of co-segregating linked loci.Comment: 24 pages, 6 figures, 4 tables, 7 supplementary figures and table

Optical guiding in meter-scale plasma waveguides

We demonstrate a new highly tunable technique for generating meter-scale low density plasma waveguides. Such guides can enable electron acceleration to tens of GeV in a single stage. Plasma waveguides are imprinted in hydrogen gas by optical field ionization induced by two time-separated Bessel beam pulses: The first pulse, a J_0 beam, generates the core of the waveguide, while the delayed second pulse, here a J_8 or J_16 beam, generates the waveguide cladding. We demonstrate guiding of intense laser pulses over hundreds of Rayleigh lengths with on axis plasma densities as low as N_e0=5x10^16 cm^-3

Bundling Payment for Episodes of Hospital Care: Issues and Recommendations for the New Pilot Program in Medicare

Outlines the 2010 healthcare reform's provision to launch a pilot project for bundling Medicare payments around hospitalization episodes of care, the rationale for hospital episode bundling, and guidance on designing an effective pilot program

Molecular dynamics study of solvation effects on acid dissociation in aprotic media

Acid ionization in aprotic media is studied using Molecular Dynamics techniques. In particular, models for HCl ionization in acetonitrile and dimethylsulfoxide are investigated. The proton is treated quantum mechanically using Feynman path integral methods and the remaining molecules are treated classically. Quantum effects are shown to be essential for the proper treatment of the ionization. The potential of mean force is computed as a function of the ion pair separation and the local solvent structure is examined. The computed dissociation constants in both solvents differ by several orders of magnitude which are in reasonable agreement with experimental results. Solvent separated ion pairs are found to exist in dimethylsulfoxide but not in acetonitrile. Dissociation mechanisms in small clusters are also investigated. Solvent separated ion pairs persist even in aggregates composed of rather few molecules, for instance, as few as thirty molecules. For smaller clusters or for large ion pair separations cluster finite-size effects come into play in a significant fashion.Comment: Plain LaTeX. To appear in JCP(March 15). Mpeg simulations available at http://www.chem.utoronto.ca/staff/REK/Videos/clusters/clusters.htm

Assessment of the effectiveness of head only and back-of-the-head electrical stunning of chickens

The study assesses the effectiveness of reversible head-only and back-of-the-head electrical stunning of chickens using 130–950 mA per bird at 50 Hz AC

Topological properties and fractal analysis of recurrence network constructed from fractional Brownian motions

Many studies have shown that we can gain additional information on time series by investigating their accompanying complex networks. In this work, we investigate the fundamental topological and fractal properties of recurrence networks constructed from fractional Brownian motions (FBMs). First, our results indicate that the constructed recurrence networks have exponential degree distributions; the relationship between $H$ and $$can be represented by a cubic polynomial function. We next focus on the motif rank distribution of recurrence networks, so that we can better understand networks at the local structure level. We find the interesting superfamily phenomenon, i.e. the recurrence networks with the same motif rank pattern being grouped into two superfamilies. Last, we numerically analyze the fractal and multifractal properties of recurrence networks. We find that the average fractal dimension$$ of recurrence networks decreases with the Hurst index $H$ of the associated FBMs, and their dependence approximately satisfies the linear formula $\approx 2 - H$. Moreover, our numerical results of multifractal analysis show that the multifractality exists in these recurrence networks, and the multifractality of these networks becomes stronger at first and then weaker when the Hurst index of the associated time series becomes larger from 0.4 to 0.95. In particular, the recurrence network with the Hurst index $H=0.5$ possess the strongest multifractality. In addition, the dependence relationships of the average information dimension $$and the average correlation dimension$$ on the Hurst index $H$ can also be fitted well with linear functions. Our results strongly suggest that the recurrence network inherits the basic characteristic and the fractal nature of the associated FBM series.Comment: 25 pages, 1 table, 15 figures. accepted by Phys. Rev.

A Dichotomy Theorem for Homomorphism Polynomials

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by arithmetic circuits in constant depth if H has a loop or no edge and that it is hard otherwise (i.e., complete for VNP, the arithmetic class related to #P). We also demonstrate the hardness over the rational field of cut eliminator, a polynomial defined by B\"urgisser which is known to be neither VP nor VNP-complete in the field of two elements, if VP is not equal to VNP (VP is the class of polynomials computable by arithmetic circuit of polynomial size)