50 research outputs found
Optimal shapes of compact strings
Full text linkOptimal geometrical arrangements, such as the stacking of atoms, are of
relevance in diverse disciplines. A classic problem is the determination of the
optimal arrangement of spheres in three dimensions in order to achieve the
highest packing fraction; only recently has it been proved that the answer for
infinite systems is a face-centred-cubic lattice. This simply stated problem
has had a profound impact in many areas, ranging from the crystallization and
melting of atomic systems, to optimal packing of objects and subdivision of
space. Here we study an analogous problem--that of determining the optimal
shapes of closely packed compact strings. This problem is a mathematical
idealization of situations commonly encountered in biology, chemistry and
physics, involving the optimal structure of folded polymeric chains. We find
that, in cases where boundary effects are not dominant, helices with a
particular pitch-radius ratio are selected. Interestingly, the same geometry is
observed in helices in naturally-occurring proteins.Comment: 8 pages, 3 composite ps figure
Polyhedra Circuits and Their Applications
Get PDFTo better compute the volume and count the lattice points in geometric objects, we propose polyhedral circuits. Each polyhedral circuit characterizes a geometric region in Rd . They can be applied to represent a rich class of geometric objects, which include all polyhedra and the union of a finite number of polyhedron. They can be also used to approximate a large class of d-dimensional manifolds in Rd . Barvinok [3] developed polynomial time algorithms to compute the volume of a rational polyhedron, and to count the number of lattice points in a rational polyhedron in Rd with a fixed dimensional number d. Let d be a fixed dimensional number, TV(d,n) be polynomial time in n to compute the volume of a rational polyhedron, TL(d,n) be polynomial time in n to count the number of lattice points in a rational polyhedron, where n is the total number of linear inequalities from input polyhedra, and TI(d,n) be polynomial time in n to solve integer linear programming problem with n be the total number of input linear inequalities. We develop algorithms to count the number of lattice points in geometric region determined by a polyhedral circuit in O(nd⋅rd(n)⋅TV(d,n)) time and to compute the volume of geometric region determined by a polyhedral circuit in O(n⋅rd(n)⋅TI(d,n)+rd(n)TL(d,n)) time, where rd(n) is the maximum number of atomic regions that n hyperplanes partition Rd . The applications to continuous polyhedra maximum coverage problem, polyhedra maximum lattice coverage problem, polyhedra (1−β) -lattice set cover problem, and (1−β) -continuous polyhedra set cover problem are discussed. We also show the NP-hardness of the geometric version of maximum coverage problem and set cover problem when each set is represented as union of polyhedra
Convalescent plasma in patients admitted to hospital with COVID-19 (RECOVERY): a randomised controlled, open-label, platform trial
Get PDFBackground:
Many patients with COVID-19 have been treated with plasma containing anti-SARS-CoV-2 antibodies. We aimed to evaluate the safety and efficacy of convalescent plasma therapy in patients admitted to hospital with COVID-19.
Methods:
This randomised, controlled, open-label, platform trial (Randomised Evaluation of COVID-19 Therapy [RECOVERY]) is assessing several possible treatments in patients hospitalised with COVID-19 in the UK. The trial is underway at 177 NHS hospitals from across the UK. Eligible and consenting patients were randomly assigned (1:1) to receive either usual care alone (usual care group) or usual care plus high-titre convalescent plasma (convalescent plasma group). The primary outcome was 28-day mortality, analysed on an intention-to-treat basis. The trial is registered with ISRCTN, 50189673, and ClinicalTrials.gov, NCT04381936.
Findings:
Between May 28, 2020, and Jan 15, 2021, 11558 (71%) of 16287 patients enrolled in RECOVERY were eligible to receive convalescent plasma and were assigned to either the convalescent plasma group or the usual care group. There was no significant difference in 28-day mortality between the two groups: 1399 (24%) of 5795 patients in the convalescent plasma group and 1408 (24%) of 5763 patients in the usual care group died within 28 days (rate ratio 1·00, 95% CI 0·93–1·07; p=0·95). The 28-day mortality rate ratio was similar in all prespecified subgroups of patients, including in those patients without detectable SARS-CoV-2 antibodies at randomisation. Allocation to convalescent plasma had no significant effect on the proportion of patients discharged from hospital within 28 days (3832 [66%] patients in the convalescent plasma group vs 3822 [66%] patients in the usual care group; rate ratio 0·99, 95% CI 0·94–1·03; p=0·57). Among those not on invasive mechanical ventilation at randomisation, there was no significant difference in the proportion of patients meeting the composite endpoint of progression to invasive mechanical ventilation or death (1568 [29%] of 5493 patients in the convalescent plasma group vs 1568 [29%] of 5448 patients in the usual care group; rate ratio 0·99, 95% CI 0·93–1·05; p=0·79).
Interpretation:
In patients hospitalised with COVID-19, high-titre convalescent plasma did not improve survival or other prespecified clinical outcomes.
Funding:
UK Research and Innovation (Medical Research Council) and National Institute of Health Research
