Fixed-Parameter Tractability of Token Jumping on Planar Graphs

Suppose that we are given two independent sets $I_0$ and $I_r$ of a graph such that $|I_0| = |I_r|$, and imagine that a token is placed on each vertex in $I_0$. The token jumping problem is to determine whether there exists a sequence of independent sets which transforms $I_0$ into $I_r$ so that each independent set in the sequence results from the previous one by moving exactly one token to another vertex. This problem is known to be PSPACE-complete even for planar graphs of maximum degree three, and W[1]-hard for general graphs when parameterized by the number of tokens. In this paper, we present a fixed-parameter algorithm for the token jumping problem on planar graphs, where the parameter is only the number of tokens. Furthermore, the algorithm can be modified so that it finds a shortest sequence for a yes-instance. The same scheme of the algorithms can be applied to a wider class of graphs, $K_{3,t}$-free graphs for any fixed integer $t \ge 3$, and it yields fixed-parameter algorithms

Gerasimov-Drell-Hearn Sum Rule and the Discrepancy between the New CLAS and SAPHIR Data

Contribution of the K^+\Lambda channel to the Gerasimov-Drell-Hearn (GDH) sum rule has been calculated by using the models that fit the recent SAPHIR or CLAS differential cross section data. It is shown that the two data sets yield quite different contributions. Contribution of this channel to the forward spin polarizability of the proton has been also calculated. It is also shown that the inclusion of the recent CLAS C_x and C_z data in the fitting data base does not significantly change the result of the present calculation. Results of the fit, however, reveal the role of the S_{11}(1650), P_{11}(1710), P_{13}(1720), and P_{13}(1900) resonances for the description of the C_x and C_z data. A brief discussion on the importance of these resonances is given. Measurements of the polarized total cross section \sigma_{TT'} by the CLAS, LEPS, and MAMI collaborations are expected to verify this finding.Comment: 15 pages, 8 figure

Generalized Effective Reducibility

We introduce two notions of effective reducibility for set-theoretical statements, based on computability with Ordinal Turing Machines (OTMs), one of which resembles Turing reducibility while the other is modelled after Weihrauch reducibility. We give sample applications by showing that certain (algebraic) constructions are not effective in the OTM-sense and considerung the effective equivalence of various versions of the axiom of choice

The complexity of dominating set reconfiguration

Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given threshold $k$. Then, we are asked whether there exists a sequence of dominating sets of $G$ between $D_s$ and $D_t$ such that each dominating set in the sequence is of cardinality at most $k$ and can be obtained from the previous one by either adding or deleting exactly one vertex. This problem is known to be PSPACE-complete in general. In this paper, we study the complexity of this decision problem from the viewpoint of graph classes. We first prove that the problem remains PSPACE-complete even for planar graphs, bounded bandwidth graphs, split graphs, and bipartite graphs. We then give a general scheme to construct linear-time algorithms and show that the problem can be solved in linear time for cographs, trees, and interval graphs. Furthermore, for these tractable cases, we can obtain a desired sequence such that the number of additions and deletions is bounded by $O(n)$, where $n$ is the number of vertices in the input graph

Is silence golden? of mobiles, monitoring,and rural water supplies

Reliable and cost-effective monitoring of rural water supply infrastructure has long been hampered by the geographical curse of dispersed and low-income populations, and weak institutional performance. Recent advances in monitoring technology combined with mobile network expansion into rural areas has created an opportunity to bypass these seemingly intractable challenges. Mobile-enhanced technologies have the potential to produce data that is orders of magnitude richer, faster, and cheaper than that provided by traditional monitoring methods, which require costly field visits. However, more data does not equate to better data; information generated by crowdsourced and automated systems each has its respective limitations. We propose a framework for analysing monitoring and surveillance systems, which can help assess the strengths and weaknesses of different emerging approaches. We suggest that these advancements present an opportunity to fundamentally change the way we consider and conduct rural water supply monitoring. © Practical Action Publishing, 2012

A Transport Analysis of the BEEM Spectroscopy of Au/Si Schottky Barriers

A systematic transport study of the ballistic electron emission microscopy (BEEM) of Au/Si(100) and Au/Si(111) Schottky barriers for different thicknesses of the metal layer and different temperatures is presented. It is shown that the existing experimental data are compatible with a recently predicted bandstructure-induced non-forward electron propagation through the Au(111) layer.Comment: 5 pages, Latex-APS, 1 postscript figure, http://www.icmm.csic.es/Pandres/pedro.htm. Phys. Stat. Sol. (b) (to appear), HCIS-10 Conf, Berlin 199

Remote activation of host cell DNA synthesis in uninfected cells signalled by infected cells in advance of virus transmission.

Viruses modulate cellular processes and metabolism in diverse ways, but these are almost universally studied in the infected cell itself. Here, we study spatial organization of DNA synthesis during multiround transmission of herpes simplex virus (HSV) using pulse-labeling with ethynyl nucleotides and cycloaddition of azide fluorophores. We report a hitherto unknown and unexpected outcome of virus-host interaction. Consistent with the current understanding of the single-step growth cycle, HSV suppresses host DNA synthesis and promotes viral DNA synthesis in spatially segregated compartments within the cell. In striking contrast, during progressive rounds of infection initiated at a single cell, we observe that infection induces a clear and pronounced stimulation of cellular DNA replication in remote uninfected cells. This induced DNA synthesis was observed in hundreds of uninfected cells at the extended border, outside the perimeter of the progressing infection. Moreover, using pulse-chase analysis, we show that this activation is maintained, resulting in a propagating wave of host DNA synthesis continually in advance of infection. As the virus reaches and infects these activated cells, host DNA synthesis is then shut off and replaced with virus DNA synthesis. Using nonpropagating viruses or conditioned medium, we demonstrate a paracrine effector of uninfected cell DNA synthesis in remote cells continually in advance of infection. These findings have significant implications, likely with broad applicability, for our understanding of the ways in which virus infection manipulates cell processes not only in the infected cell itself but also now in remote uninfected cells, as well as of mechanisms governing host DNA synthesis. IMPORTANCE We show that during infection initiated by a single particle with progressive cell-cell virus transmission (i.e., the normal situation), HSV induces host DNA synthesis in uninfected cells, mediated by a virus-induced paracrine effector. The field has had no conception that this process occurs, and the work changes our interpretation of virus-host interaction during advancing infection and has implications for understanding controls of host DNA synthesis. Our findings demonstrate the utility of chemical biology techniques in analysis of infection processes, reveal distinct processes when infection is examined in multiround transmission versus single-step growth curves, and reveal a hitherto-unknown process in virus infection, likely relevant for other viruses (and other infectious agents) and for remote signaling of other processes, including transcription and protein synthesis

Independent Set Reconfiguration in Cographs

We study the following independent set reconfiguration problem, called TAR-Reachability: given two independent sets $I$ and $J$ of a graph $G$, both of size at least $k$, is it possible to transform $I$ into $J$ by adding and removing vertices one-by-one, while maintaining an independent set of size at least $k$ throughout? This problem is known to be PSPACE-hard in general. For the case that $G$ is a cograph (i.e. $P_4$-free graph) on $n$ vertices, we show that it can be solved in time $O(n^2)$, and that the length of a shortest reconfiguration sequence from $I$ to $J$ is bounded by $4n-2k$, if such a sequence exists. More generally, we show that if $X$ is a graph class for which (i) TAR-Reachability can be solved efficiently, (ii) maximum independent sets can be computed efficiently, and which satisfies a certain additional property, then the problem can be solved efficiently for any graph that can be obtained from a collection of graphs in $X$ using disjoint union and complete join operations. Chordal graphs are given as an example of such a class $X$

Order preserving pattern matching on trees and DAGs

The order preserving pattern matching (OPPM) problem is, given a pattern string $p$ and a text string $t$, find all substrings of $t$ which have the same relative orders as $p$. In this paper, we consider two variants of the OPPM problem where a set of text strings is given as a tree or a DAG. We show that the OPPM problem for a single pattern $p$ of length $m$ and a text tree $T$ of size $N$ can be solved in $O(m+N)$ time if the characters of $p$ are drawn from an integer alphabet of polynomial size. The time complexity becomes $O(m \log m + N)$ if the pattern $p$ is over a general ordered alphabet. We then show that the OPPM problem for a single pattern and a text DAG is NP-complete