From correlation to causation: the cruciality of a collectivity in the context of collective action

This paper discusses a longitudinal field study on collective action which aims to move beyond student samples and enhance mundane realism. First we provide a historical overview of the literature on the what (i.e., antecedents of collective action) and the how (i.e., the methods employed) of the social psychology of protest. This historical overview is substantiated with meta-analytical evidence on how these antecedents and methods changed over time. After the historical overview, we provide an empirical illustration of a longitudinal field study in a natural setting―a newly-built Dutch neighbourhood. We assessed changes in informal embeddedness, efficacy, identification, emotions, and grievances over time. Between t0 and t1 the residents protested against the plan to allow a mosque to carrying out their services in a community building in the neighbourhood. We examined the antecedents of protest before [t0] and after [t1] the protests, and whether residents participated or not. We show how a larger social network functions as a catalyst in steering protest participation. Our longitudinal field study replicates basic findings from experimental and survey research. However, it also shows that one antecedent in particular, which is hard to manipulate in the lab (i.e., the size of someone’s social network), proved to be of great importance. We suggest that in overcoming our most pertinent challenge―causality―we should not only remain in our laboratories but also go out and examine real-life situations with people situated in real-life social networks

Connecting Terminals and 2-Disjoint Connected Subgraphs

Given a graph $G=(V,E)$ and a set of terminal vertices $T$ we say that a superset $S$ of $T$ is $T$-connecting if $S$ induces a connected graph, and $S$ is minimal if no strict subset of $S$ is $T$-connecting. In this paper we prove that there are at most ${|V \setminus T| \choose |T|-2} \cdot 3^{\frac{|V \setminus T|}{3}}$ minimal $T$-connecting sets when $|T| \leq n/3$ and that these can be enumerated within a polynomial factor of this bound. This generalizes the algorithm for enumerating all induced paths between a pair of vertices, corresponding to the case $|T|=2$. We apply our enumeration algorithm to solve the {\sc 2-Disjoint Connected Subgraphs} problem in time $O^*(1.7804^n)$, improving on the recent $O^*(1.933^n)$ algorithm of Cygan et al. 2012 LATIN paper.Comment: 13 pages, 1 figur

Spotting Trees with Few Leaves

We show two results related to the Hamiltonicity and $k$-Path algorithms in undirected graphs by Bj\"orklund [FOCS'10], and Bj\"orklund et al., [arXiv'10]. First, we demonstrate that the technique used can be generalized to finding some $k$-vertex tree with $l$ leaves in an $n$-vertex undirected graph in $O^*(1.657^k2^{l/2})$ time. It can be applied as a subroutine to solve the $k$-Internal Spanning Tree ($k$-IST) problem in $O^*(\min(3.455^k, 1.946^n))$ time using polynomial space, improving upon previous algorithms for this problem. In particular, for the first time we break the natural barrier of $O^*(2^n)$. Second, we show that the iterated random bipartition employed by the algorithm can be improved whenever the host graph admits a vertex coloring with few colors; it can be an ordinary proper vertex coloring, a fractional vertex coloring, or a vector coloring. In effect, we show improved bounds for $k$-Path and Hamiltonicity in any graph of maximum degree $\Delta=4,\ldots,12$ or with vector chromatic number at most 8

A 2k2k-Vertex Kernel for Maximum Internal Spanning Tree

We consider the parameterized version of the maximum internal spanning tree problem, which, given an $n$-vertex graph and a parameter $k$, asks for a spanning tree with at least $k$ internal vertices. Fomin et al. [J. Comput. System Sci., 79:1-6] crafted a very ingenious reduction rule, and showed that a simple application of this rule is sufficient to yield a $3k$-vertex kernel. Here we propose a novel way to use the same reduction rule, resulting in an improved $2k$-vertex kernel. Our algorithm applies first a greedy procedure consisting of a sequence of local exchange operations, which ends with a local-optimal spanning tree, and then uses this special tree to find a reducible structure. As a corollary of our kernel, we obtain a deterministic algorithm for the problem running in time $4^k \cdot n^{O(1)}$

Finding and counting vertex-colored subtrees

The problems studied in this article originate from the Graph Motif problem introduced by Lacroix et al. in the context of biological networks. The problem is to decide if a vertex-colored graph has a connected subgraph whose colors equal a given multiset of colors $M$. It is a graph pattern-matching problem variant, where the structure of the occurrence of the pattern is not of interest but the only requirement is the connectedness. Using an algebraic framework recently introduced by Koutis et al., we obtain new FPT algorithms for Graph Motif and variants, with improved running times. We also obtain results on the counting versions of this problem, proving that the counting problem is FPT if M is a set, but becomes W[1]-hard if M is a multiset with two colors. Finally, we present an experimental evaluation of this approach on real datasets, showing that its performance compares favorably with existing software.Comment: Conference version in International Symposium on Mathematical Foundations of Computer Science (MFCS), Brno : Czech Republic (2010) Journal Version in Algorithmic

Does Routine Endoscopy or Contrast Swallow Study After Esophagectomy and Gastric Tube Reconstruction Change Patient Management?

Background: Anastomotic leakage is a severe complication after esophagectomy. The objective was to investigate the diagnostic and predictive value of routine contrast swallow study and endoscopy for the detection of anastomotic dehiscence in patients after esophagectomy. Methods: All patients who underwent contrast swallow and/or endoscopy within 7 days after oesophagectomy for cancer between January 2005 and December 2009 were selected from an institutional database. Results: Some 173 patients underwent endoscopy, and 184 patients underwent a contrast swallow study. The sensitivity of endoscopy for anastomotic leakage requiring intervention is 56 %, specificity 41 %, positive predictive value (PPV) 8 %, and negative predictive value (NPV) 95 %. The sensitivity of contrast swallow study for detecting leakage requiring intervention in patients without signs of leakage was 20 %, specificity 20 %, PPV 3 %, and NPV 97 %. Conclusions: In patients without clinical suspicion of leakage, there is no benefit to perform routine examinations

Complications in Esophageal Surgery

This thesis describes randomized controlled trials regarding surgical techniques after esophagectomy and the use of the Comprehensive Complication Index

Faster space-efficient algorithms for Subset Sum, k -Sum, and related problems

We present randomized algorithms that solve subset sum and knapsack instances with n items in O∗ (20.86n) time, where the O∗ (∙ ) notation suppresses factors polynomial in the input size, and polynomial space, assuming random read-only access to exponentially many random bits. These results can be extended to solve binary integer programming on n variables with few constraints in a similar running time. We also show that for any constant k ≥ 2, random instances of k-Sum can be solved using O(nk -0.5polylog(n)) time and O(log n) space, without the assumption of random access to random bits.Underlying these results is an algorithm that determines whether two given lists of length n with integers bounded by a polynomial in n share a common value. Assuming random read-only access to random bits, we show that this problem can be solved using O(log n) space significantly faster than the trivial O(n2) time algorithm if no value occurs too often in the same list.</p

Azimuthally anisotropic emission of low-momentum direct photons in Au++Au collisions at sNN=200\sqrt{s_{_{NN}}}=200 GeV

The PHENIX experiment at the Relativistic Heavy Ion Collider has measured 2nd and 3rd order Fourier coefficients of the azimuthal distributions of direct photons emitted at midrapidity in Au$+$Au collisions at $\sqrt{s_{_{NN}}}=200$ GeV for various collision centralities. Combining two different analysis techniques, results were obtained in the transverse momentum range of $0.4<p_{T}<4.0$ GeV/$c$. At low $p_T$ the second-order coefficients, $v_2$, are similar to the ones observed in hadrons. Third order coefficients, $v_3$, are nonzero and almost independent of centrality. These new results on $v_2$ and $v_3$, combined with previously published results on yields, are compared to model calculations that provide yields and asymmetries in the same framework. Those models are challenged to explain simultaneously the observed large yield and large azimuthal anisotropies.Comment: 552 authors, 15 pages, 9 figures, 3 tables, 2007 and 2010 data. v2 is version accepted for publication by Phys. Rev. C. Plain text data tables for the points plotted in figures for this and previous PHENIX publications are (or will be) publicly available at http://www.phenix.bnl.gov/papers.htm