18,696 research outputs found

    The UN in the lab

    Get PDF
    We consider two alternatives to inaction for governments combating terrorism, which we term Defense and Prevention. Defense consists of investing in resources that reduce the impact of an attack, and generates a negative externality to other governments, making their countries a more attractive objective for terrorists. In contrast, Prevention, which consists of investing in resources that reduce the ability of the terrorist organization to mount an attack, creates a positive externality by reducing the overall threat of terrorism for all. This interaction is captured using a simple 3×3 “Nested Prisoner’s Dilemma” game, with a single Nash equilibrium where both countries choose Defense. Due to the structure of this interaction, countries can benefit from coordination of policy choices, and international institutions (such as the UN) can be utilized to facilitate coordination by implementing agreements to share the burden of Prevention. We introduce an institution that implements a burden-sharing policy for Prevention, and investigate experimentally whether subjects coordinate on a cooperative strategy more frequently under different levels of cost sharing. In all treatments, burden sharing leaves the Prisoner’s Dilemma structure and Nash equilibrium of the game unchanged. We compare three levels of burden sharing to a baseline in a between-subjects design, and find that burden sharing generates a non-linear effect on the choice of the efficient Prevention strategy and overall performance. Only an institution supporting a high level of mandatory burden sharing generates a significant improvement in the use of the Prevention strategy

    Partial Homology Relations - Satisfiability in terms of Di-Cographs

    Get PDF
    Directed cographs (di-cographs) play a crucial role in the reconstruction of evolutionary histories of genes based on homology relations which are binary relations between genes. A variety of methods based on pairwise sequence comparisons can be used to infer such homology relations (e.g.\ orthology, paralogy, xenology). They are \emph{satisfiable} if the relations can be explained by an event-labeled gene tree, i.e., they can simultaneously co-exist in an evolutionary history of the underlying genes. Every gene tree is equivalently interpreted as a so-called cotree that entirely encodes the structure of a di-cograph. Thus, satisfiable homology relations must necessarily form a di-cograph. The inferred homology relations might not cover each pair of genes and thus, provide only partial knowledge on the full set of homology relations. Moreover, for particular pairs of genes, it might be known with a high degree of certainty that they are not orthologs (resp.\ paralogs, xenologs) which yields forbidden pairs of genes. Motivated by this observation, we characterize (partial) satisfiable homology relations with or without forbidden gene pairs, provide a quadratic-time algorithm for their recognition and for the computation of a cotree that explains the given relations

    Survival of Mycobacterium abscessus isolated from people with CF in artificially generated aerosols

    Get PDF
    M. abscessus survives aerosolisation suggesting airborne transmission between people with CF may occu

    Finding Connected Dense kk-Subgraphs

    Full text link
    Given a connected graph GG on nn vertices and a positive integer knk\le n, a subgraph of GG on kk vertices is called a kk-subgraph in GG. We design combinatorial approximation algorithms for finding a connected kk-subgraph in GG such that its density is at least a factor Ω(max{n2/5,k2/n2})\Omega(\max\{n^{-2/5},k^2/n^2\}) of the density of the densest kk-subgraph in GG (which is not necessarily connected). These particularly provide the first non-trivial approximations for the densest connected kk-subgraph problem on general graphs

    Social Determinants of Community Health Services Utilization among the Users in China: A 4-Year Cross-Sectional Study

    Get PDF
    Background To identify social factors determining the frequency of community health service (CHS) utilization among CHS users in China. Methods Nationwide cross-sectional surveys were conducted in 2008, 2009, 2010, and 2011. A total of 86,116 CHS visitors selected from 35 cities were interviewed. Descriptive analysis and multinomial logistic regression analysis were employed to analyze characteristics of CHS users, frequency of CHS utilization, and the socio-demographic and socio-economic factors influencing frequency of CHS utilization. Results Female and senior CHS clients were more likely to make 3–5 and ≥6 CHS visits (as opposed to 1–2 visits) than male and young clients, respectively. CHS clients with higher education were less frequent users than individuals with primary education or less in 2008 and 2009; in later surveys, CHS clients with higher education were the more frequent users. The association between frequent CHS visits and family income has changed significantly between 2008 and 2011. In 2011, income status did not have a discernible effect on the likelihood of making ≥6 CHS visits, and it only had a slight effect on making 3–5 CHS visits. Conclusion CHS may play an important role in providing primary health care to meet the demands of vulnerable populations in China. Over time, individuals with higher education are increasingly likely to make frequent CHS visits than individuals with primary school education or below. The gap in frequency of CHS utilization among different economic income groups decreased from 2008 to 2011

    Parameterized Edge Hamiltonicity

    Full text link
    We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT parameterized by vertex cover, and that it also admits a cubic kernel. We then show fixed-parameter tractability even for a generalization of the problem to arbitrary hypergraphs, parameterized by the size of a (supplied) hitting set. We also consider the problem parameterized by treewidth or clique-width. Surprisingly, we show that the problem is FPT for both of these standard parameters, in contrast to its vertex version, which is W-hard for clique-width. Our technique, which may be of independent interest, relies on a structural characterization of clique-width in terms of treewidth and complete bipartite subgraphs due to Gurski and Wanke
    corecore