Objective To develop methods guidance to support the conduct of rapid reviews (RRs) produced within Cochrane and beyond, in response to requests for timely evidence syntheses for decision-making purposes including urgent health issues of high priority. Study Design Interim recommendations were informed by a scoping review of the underlying evidence, primary methods studies conducted, and a survey sent to 119 representatives from 20 Cochrane entities, who were asked to rate and rank RR methods across stages of review conduct. Discussions among those with expertise in RR methods further informed the list of recommendations with accompanying rationales provided. Results Based on survey results from 63 respondents (53% response rate), 26 RR methods recommendations are presented for which there was a high or moderate level of agreement or scored highest in the absence of such agreement. Where possible, how recommendations align with Cochrane methods guidance for SRs is highlighted. Conclusion The Cochrane Rapid Reviews Methods Group offers new, interim guidance to support the conduct of RRs. Because best practice is limited by the lack of currently available evidence for some RR methods shortcuts taken, this guidance will need to be updated as additional abbreviated methods are evaluated.

No abstract

Abstract. This paper solves a longstanding open problem in fully dynamic algorithms: We present the first fully dynamic algorithms that maintain connectivity, bipartiteness, and approximate minimum spanning trees in polylogarithmic time per edge insertion or deletion. The algorithms are designed using a new dynamic technique that combines a novel graph decomposition with randomization. They are Las-Vegas type randomized algorithms which use simple data structures and have a small constant factor.Let n denote the number of nodes in the graph. For a sequence of ⍀(m 0 ) operations, where m 0 is the number of edges in the initial graph, the expected time for p updates is O( p log 3 n) (Throughout the paper the logarithms are base 2.) for connectivity and bipartiteness. The worst-case time for one query is O(log n/log log n). For the k-edge witness problem ("Does the removal of k given edges disconnect the graph?") the expected time for p updates is O( p log 3 n) and the expected time for q queries is O(qk log 3 n). Given a graph with k different weights, the minimum spanning tree can be maintained during a sequence of p updates in expected time O( pk log 3 n). This implies an algorithm to maintain a 1 ϩ ⑀-approximation of the minimum spanning tree in expected time O(( p log 3 n log U)/⑀) for p updates, where the weights of the edges are between 1 and U.

Background: The role of angiotensin-converting enzyme inhibitors (ACEIs) and angiotensin-receptor blockers (ARBs) in COVID-19 disease susceptibility, severity, and treatment is unclear.Purpose: To evaluate, on an ongoing basis, whether use of ACEIs or ARBs either increases risk for severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) infection or is associated with worse COVID-19 disease outcomes, and to assess the efficacy of these medications for COVID-19 treatment.

BackgroundRates of labour induction are increasing. We conducted this systematic review to assess the evidence supporting use of each method of labour induction.MethodsWe listed methods of labour induction then reviewed the evidence supporting each. We searched MEDLINE and the Cochrane Library between 1980 and November 2010 using multiple terms and combinations, including labor, induced/or induction of labor, prostaglandin or prostaglandins, misoprostol, Cytotec, 16,16,-dimethylprostaglandin E2 or E2, dinoprostone; Prepidil, Cervidil, Dinoprost, Carboprost or hemabate; prostin, oxytocin, misoprostol, membrane sweeping or membrane stripping, amniotomy, balloon catheter or Foley catheter, hygroscopic dilators, laminaria, dilapan, saline injection, nipple stimulation, intercourse, acupuncture, castor oil, herbs. We performed a best evidence review of the literature supporting each method. We identified 2048 abstracts and reviewed 283 full text articles. We preferentially included high quality systematic reviews or large randomised trials. Where no such studies existed, we included the best evidence available from smaller randomised or quasi-randomised trials.ResultsWe included 46 full text articles. We assigned a quality rating to each included article and a strength of evidence rating to each body of literature. Prostaglandin E2 (PGE2) and vaginal misoprostol were more effective than oxytocin in bringing about vaginal delivery within 24 hours but were associated with more uterine hyperstimulation. Mechanical methods reduced uterine hyperstimulation compared with PGE2 and misoprostol, but increased maternal and neonatal infectious morbidity compared with other methods. Membrane sweeping reduced post-term gestations. Most included studies were too small to evaluate risk for rare adverse outcomes.ConclusionsResearch is needed to determine benefits and harms of many induction methods.

No abstract

No abstract

Abstract. We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the refinement and verification of reactive systems. For finite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m 2 n). For effectively presented infinite graphs, we present a symbolic similarity-checking procedure that terminates if a finite similarity relation exists. We show that 2D rectangular automata, which model discrete reactive systems with continuous environments, define effectively presented infinite graphs with finite similarity relations. It follows that the refinement problem and the VCTL' model-checking problem are decidable for 2D rectangular automata.