65 research outputs found

    Extent of non-publication in cohorts of studies approved by research ethics committees or included in trial registries

    Get PDF
    Background: The synthesis of published research in systematic reviews is essential when providing evidence to inform clinical and health policy decisionmaking. However, the validity of systematic reviews is threatened if journal publications represent a biased selection of all studies that have been conducted (dissemination bias). To investigate the extent of dissemination bias we conducted a systematic review that determined the proportion of studies published as peerreviewed journal articles and investigated factors associated with full publication in cohorts of studies (i) approved by research ethics committees (RECs) or (ii) included in trial registries. Copyright:Methods and Findings: Four bibliographic databases were searched for methodological research projects (MRPs) without limitations for publication year, language or study location. The searches were supplemented by handsearching the references of included MRPs. We estimated the proportion of studies published using prediction intervals (PI) and a random effects meta-analysis. Pooled odds ratios (OR) were used to express associations between study characteristics and journal publication. Seventeen MRPs (23 publications) evaluated cohorts of studies approved by RECs; the proportion of published studies had a PI between 22% and 72% and the weighted pooled proportion when combining estimates would be 46.2% (95% CI 40.2%-52.4%, I2594.4%). Twenty-two MRPs (22 publications) evaluated cohorts of studies included in trial registries; the PI of the proportion published ranged from 13% to 90% and the weighted pooled proportion would be 54.2% (95% CI 42.0%-65.9%, I2598.9%). REC-approved studies with statistically significant results (compared with those without statistically significant results) were more likely to be published (pooled OR 2.8; 95% CI 2.2-3.5). Phase-III trials were also more likely to be published than phase II trials (pooled OR 2.0; 95% CI 1.6- 2.5). The probability of publication within two years after study completion ranged from 7% to 30%.Conclusions: A substantial part of the studies approved by RECs or included in trial registries remains unpublished. Due to the large heterogeneity a prediction of the publication probability for a future study is very uncertain. Non-publication of research is not a random process, e.g., it is associated with the direction of study findings. Our findings suggest that the dissemination of research findings is biased

    Combined loss of the BH3-only proteins Bim and Bmf restores B-cell development and function in TACI-Ig transgenic mice.

    Get PDF
    Terminal differentiation of B cells depends on two interconnected survival pathways, elicited by the B-cell receptor (BCR) and the BAFF receptor (BAFF-R), respectively. Loss of either signaling pathway arrests B-cell development. Although BCR-dependent survival depends mainly on the activation of the v-AKT murine thymoma viral oncogene homolog 1 (AKT)/PI3-kinase network, BAFF/BAFF-R-mediated survival engages non-canonical NF-κB signaling as well as MAPK/extracellular-signal regulated kinase and AKT/PI3-kinase modules to allow proper B-cell development. Plasma cell survival, however, is independent of BAFF-R and regulated by APRIL that signals NF-κB activation via alternative receptors, that is, transmembrane activator and CAML interactor (TACI) or B-cell maturation (BCMA). All these complex signaling events are believed to secure survival by increased expression of anti-apoptotic B-cell lymphoma 2 (Bcl2) family proteins in developing and mature B cells. Curiously, how lack of BAFF- or APRIL-mediated signaling triggers B-cell apoptosis remains largely unexplored. Here, we show that two pro-apoptotic members of the 'Bcl2 homology domain 3-only' subgroup of the Bcl2 family, Bcl2 interacting mediator of cell death (Bim) and Bcl2 modifying factor (Bmf), mediate apoptosis in the context of TACI-Ig overexpression that effectively neutralizes BAFF as well as APRIL. Surprisingly, although Bcl2 overexpression triggers B-cell hyperplasia exceeding the one observed in Bim(-/-)Bmf(-/-) mice, Bcl2 transgenic B cells remain susceptible to the effects of TACI-Ig expression in vivo, leading to ameliorated pathology in Vav-Bcl2 transgenic mice. Together, our findings shed new light on the molecular machinery restricting B-cell survival during development, normal homeostasis and under pathological conditions. Our data further suggest that Bcl2 antagonists might improve the potency of BAFF/APRIL-depletion strategies in B-cell-driven pathologies

    a Turkish calendar watch from the middle of the 17th century.

    No full text
    Donated by Klaus KreiserReprinted from : Antiquarian Horology, Dec. 6, 1968

    Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)

    No full text
    Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function decomposition structure. This yields AND/OR multivalued decision diagram (AOMDD) which compiles a constraint network into a canonical form that supports polynomial time queries such as solution counting, solution enumeration or equivalence of constraint networks. We provide a compilation algorithm based on Variable Elimination for assembling an AOMDD for a constraint network starting from the AOMDDs for its constraints. The algorithm uses the APPLY operator which combines two AOMDDs by a given operation. This guarantees the complexity upper bound for the compilation time and the size of the AOMDD to be exponential in the treewidth of the constraint graph, rather than pathwidth as is known for ordered binary decision diagrams (OBDDs)

    Constructing tree decompositions of graphs with bounded gonality

    No full text
    In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most k, when an effective divisor of degree k that reaches all vertices is given. We also give a similar result for two related notions: stable divisorial gonality and stable gonality.Accepted author manuscriptOptimizatio
    corecore