2,395 research outputs found

    Managing urban socio-technical change? Comparing energy technology controversies in three European contexts

    Get PDF
    A {\em local graph partitioning algorithm} finds a set of vertices with small conductance (i.e. a sparse cut) by adaptively exploring part of a large graph GG, starting from a specified vertex. For the algorithm to be local, its complexity must be bounded in terms of the size of the set that it outputs, with at most a weak dependence on the number nn of vertices in GG. Previous local partitioning algorithms find sparse cuts using random walks and personalized PageRank. In this paper, we introduce a randomized local partitioning algorithm that finds a sparse cut by simulating the {\em volume-biased evolving set process}, which is a Markov chain on sets of vertices. We prove that for any set of vertices AA that has conductance at most ϕ\phi, for at least half of the starting vertices in AA our algorithm will output (with probability at least half), a set of conductance O(ϕ1/2log1/2n)O(\phi^{1/2} \log^{1/2} n). We prove that for a given run of the algorithm, the expected ratio between its computational complexity and the volume of the set that it outputs is O(ϕ1/2polylog(n))O(\phi^{-1/2} polylog(n)). In comparison, the best previous local partitioning algorithm, due to Andersen, Chung, and Lang, has the same approximation guarantee, but a larger ratio of O(ϕ1polylog(n))O(\phi^{-1} polylog(n)) between the complexity and output volume. Using our local partitioning algorithm as a subroutine, we construct a fast algorithm for finding balanced cuts. Given a fixed value of ϕ\phi, the resulting algorithm has complexity O((m+nϕ1/2)polylog(n))O((m+n\phi^{-1/2}) polylog(n)) and returns a cut with conductance O(ϕ1/2log1/2n)O(\phi^{1/2} \log^{1/2} n) and volume at least vϕ/2v_{\phi}/2, where vϕv_{\phi} is the largest volume of any set with conductance at most ϕ\phi.Comment: 20 pages, no figure

    Temocillin in the treatment of Burkholderia cepacia infection in cystic fibrosis

    Get PDF
    AbstractBackgroundInfections due to Burkholderia cepacia complex (Bcc) strains increase morbidity and mortality in cystic fibrosis (CF). Some transplant centres reject Bcc infected patients. We reviewed the results in patients treated with i.v temocillin.MethodsTwenty-three patients who received 38 courses of temocillin (1988–1998) were identified from the CF database at Royal Brompton Hospital. In three patients' data were inadequate; therefore analysis was done in 20. Outcome was measured as improvement, deterioration or no change (compared to admission) in the following categories: clinical (temperature, dyspnoea, sputum volume, chest pain), physiological (FEV1, FVC, oxygen saturation) and inflammatory markers (WBC, ESR, CRP). Patients who improved in two categories were classified as having improved. Antibiotic sensitivities and outcome were recorded.ResultsIn 18 of 32 courses (56.25%) improvement occurred. The organism (Bcc) in eight patients' sputum became resistant (three died). The antibiotics was changed in five patients with Bcc strains sensitive to temocillin because of no improvement and one patient due to allergy (rash). The average time to the next i.v antibiotic was 41 days. Eight patients died (in three the Bcc strain was resistant to temocillin). Fourteen patients with Bcc were transplanted and eight patients survived. Another patient who developed Bcc infection post-operatively, failing to respond to temocillin.ConclusionsThese results suggest the potential benefit of i.v temocillin in CF patients with Bcc for exacerbations and at the time of transplantation
    corecore