Limitations of Algebraic Approaches to Graph Isomorphism Testing

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and only if if the graphs are isomorphic, and then to (try to) decide satisfiability of the system using, for example, the Gr\"obner basis algorithm. In some cases this can be done in polynomial time, in particular, if the equations admit a bounded degree refutation in an algebraic proof systems such as Nullstellensatz or polynomial calculus. We prove linear lower bounds on the polynomial calculus degree over all fields of characteristic different from 2 and also linear lower bounds for the degree of Positivstellensatz calculus derivations. We compare this approach to recently studied linear and semidefinite programming approaches to isomorphism testing, which are known to be related to the combinatorial Weisfeiler-Lehman algorithm. We exactly characterise the power of the Weisfeiler-Lehman algorithm in terms of an algebraic proof system that lies between degree-k Nullstellensatz and degree-k polynomial calculus

Pion induced double charge exchange reactions in the Delta resonance region

We have applied the Giessen BUU (GiBUU) transport model to the description of the double charge exchange (DCX) reaction of pions with different nuclear targets at incident kinetic energies of 120-180 MeV . The DCX process is highly sensitive to details of the interactions of pions with the nuclear medium and, therefore, represents a major benchmark for any model of pion scattering off nuclei at low and intermediate energies. The impact of surface effects, such as the neutron skins of heavy nuclei, is investigated. The dependence of the total cross section on the nuclear mass number is also discussed. We achieve a good quantitative agreement with the extensive data set obtained at LAMPF. Furthermore, we compare the solutions of the transport equations obtained in the test-particle ansatz using two different schemes - the full and the parallel ensemble method.Comment: 14 pages,9 figure

Effects of cochlear implantation on binaural hearing in adults with unilateral hearing loss

A FDA clinical trial was carried out to evaluate the potential benefit of cochlear implant (CI) use for adults with unilateral moderate-to-profound sensorineural hearing loss. Subjects were 20 adults with moderate-to-profound unilateral sensorineural hearing loss and normal or near-normal hearing on the other side. A MED-EL standard electrode was implanted in the impaired ear. Outcome measures included: (a) sound localization on the horizontal plane (11 positions, −90° to 90°), (b) word recognition in quiet with the CI alone, and (c) masked sentence recognition with the target at 0° and the masker at −90°, 0°, or 90°. This battery was completed preoperatively and at 1, 3, 6, 9, and 12 months after CI activation. Normative data were also collected for 20 age-matched control subjects with normal or near-normal hearing bilaterally. The CI improved localization accuracy and reduced side bias. Word recognition with the CI alone was similar to performance of traditional CI recipients. The CI improved masked sentence recognition when the masker was presented from the front or from the side of normal or near-normal hearing. The binaural benefits observed with the CI increased between the 1- and 3-month intervals but appeared stable thereafter. In contrast to previous reports on localization and speech perception in patients with unilateral sensorineural hearing loss, CI benefits were consistently observed across individual subjects, and performance was at asymptote by the 3-month test interval. Cochlear implant settings, consistent CI use, and short duration of deafness could play a role in this result

Three-body collisions in Boltzmann-Uehling-Uhlenbeck theory

Aiming at a microscopic description of heavy ion collisions in the beam energy region of about 10 A GeV, we extend the Giessen Boltzmann-Uehling-Uhlenbeck (GiBUU) transport model by including a relativistic mean field, in-medium baryon-baryon cross sections and three-body collisions. The model is then compared with experimental data for central Au+Au collisions at 2-10 A GeV and central Pb+Pb collisions at 30 and 40 A GeV on the proton rapidity spectra, the midrapidity yields of $\pi^+$, $K^\pm$ and $(\Lambda+\Sigma^0)$, and the transverse mass spectra of $\pi^\pm$ and $K^\pm$. The three-body collisions increase the inverse slope parameters of the hadron $m_\perp$-spectra to a good agreement with the data.Comment: 26 pages, 9 figures, figures added, discussion extended, results not changed, version accepted in Phys. Rev.

Parameterized bounded-depth Frege is not optimal

A general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [9]. There the authors concentrate on tree-like Parameterized Resolution-a parameterized version of classical Resolution-and their gap complexity theorem implies lower bounds for that system. The main result of the present paper significantly improves upon this by showing optimal lower bounds for a parameterized version of bounded-depth Frege. More precisely, we prove that the pigeonhole principle requires proofs of size n in parameterized bounded-depth Frege, and, as a special case, in dag-like Parameterized Resolution. This answers an open question posed in [9]. In the opposite direction, we interpret a well-known technique for FPT algorithms as a DPLL procedure for Parameterized Resolution. Its generalization leads to a proof search algorithm for Parameterized Resolution that in particular shows that tree-like Parameterized Resolution allows short refutations of all parameterized contradictions given as bounded-width CNF's

Loss of functional MYO1C/myosin 1c, a motor protein involved in lipid raft trafficking, disrupts autophagosome-lysosome fusion.

MYO1C, a single-headed class I myosin, associates with cholesterol-enriched lipid rafts and facilitates their recycling from intracellular compartments to the cell surface. Absence of functional MYO1C disturbs the cellular distribution of lipid rafts, causes the accumulation of cholesterol-enriched membranes in the perinuclear recycling compartment, and leads to enlargement of endolysosomal membranes. Several feeder pathways, including classical endocytosis but also the autophagy pathway, maintain the health of the cell by selective degradation of cargo through fusion with the lysosome. Here we show that loss of functional MYO1C leads to an increase in total cellular cholesterol and its disrupted subcellular distribution. We observe an accumulation of autophagic structures caused by a block in fusion with the lysosome and a defect in autophagic cargo degradation. Interestingly, the loss of MYO1C has no effect on degradation of endocytic cargo such as EGFR, illustrating that although the endolysosomal compartment is enlarged in size, it is functional, contains active hydrolases, and the correct pH. Our results highlight the importance of correct lipid composition in autophagosomes and lysosomes to enable them to fuse. Ablating MYO1C function causes abnormal cholesterol distribution, which has a major selective impact on the autophagy pathway.This work was financially supported by the Wellcome Trust (F.B., D.A.T. and H.B.), the Deutsche Forschungsgemeinschaft Grant MA 1081/19–1 (D.J.M) and the Medical Research Council (F.B and C. K.-I.). The CIMR is in receipt of a strategic award from the Wellcome Trust (100140).This is the final published version. It first appeared at http://www.tandfonline.com/doi/abs/10.4161/15548627.2014.984272#.VNo0Gy6Qne4

On Tackling the Limits of Resolution in SAT Solving

The practical success of Boolean Satisfiability (SAT) solvers stems from the CDCL (Conflict-Driven Clause Learning) approach to SAT solving. However, from a propositional proof complexity perspective, CDCL is no more powerful than the resolution proof system, for which many hard examples exist. This paper proposes a new problem transformation, which enables reducing the decision problem for formulas in conjunctive normal form (CNF) to the problem of solving maximum satisfiability over Horn formulas. Given the new transformation, the paper proves a polynomial bound on the number of MaxSAT resolution steps for pigeonhole formulas. This result is in clear contrast with earlier results on the length of proofs of MaxSAT resolution for pigeonhole formulas. The paper also establishes the same polynomial bound in the case of modern core-guided MaxSAT solvers. Experimental results, obtained on CNF formulas known to be hard for CDCL SAT solvers, show that these can be efficiently solved with modern MaxSAT solvers

Inverse semigroup actions as groupoid actions

To an inverse semigroup, we associate an \'etale groupoid such that its actions on topological spaces are equivalent to actions of the inverse semigroup. Both the object and the arrow space of this groupoid are non-Hausdorff. We show that this construction provides an adjoint functor to the functor that maps a groupoid to its inverse semigroup of bisections, where we turn \'etale groupoids into a category using algebraic morphisms. We also discuss how to recover a groupoid from this inverse semigroup.Comment: Corrected a typo in Lemma 2.14 in the published versio