26,042 research outputs found
Does bariatric surgery prior to total hip or knee arthroplasty reduce post-operative complications and improve clinical outcomes for obese patients? Systematic review and meta-analysis.
AIMS: Our aim was to determine whether, based on the current literature, bariatric surgery prior to total hip (THA) or total knee arthroplasty (TKA) reduces the complication rates and improves the outcome following arthroplasty in obese patients. METHODS: A systematic literature search was undertaken of published and unpublished databases on the 5 November 2015. All papers reporting studies comparing obese patients who had undergone bariatric surgery prior to arthroplasty, or not, were included. Each study was assessed using the Downs and Black appraisal tool. A meta-analysis of risk ratios (RR) and 95% confidence intervals (CI) was performed to determine the incidence of complications including wound infection, deep vein thrombosis (DVT), pulmonary embolism (PE), revision surgery and mortality. RESULTS: From 156 potential studies, five were considered to be eligible for inclusion in the study. A total of 23 348 patients (657 who had undergone bariatric surgery, 22 691 who had not) were analysed. The evidence-base was moderate in quality. There was no statistically significant difference in outcomes such as superficial wound infection (relative risk (RR) 1.88; 95% confidence interval (CI) 0.95 to 0.37), deep wound infection (RR 1.04; 95% CI 0.65 to 1.66), DVT (RR 0.57; 95% CI 0.13 to 2.44), PE (RR 0.51; 95% CI 0.03 to 8.26), revision surgery (RR 1.24; 95% CI 0.75 to 2.05) or mortality (RR 1.25; 95% CI 0.16 to 9.89) between the two groups. CONCLUSION: For most peri-operative outcomes, bariatric surgery prior to THA or TKA does not significantly reduce the complication rates or improve the clinical outcome. This study questions the previous belief that bariatric surgery prior to arthroplasty may improve the clinical outcomes for patients who are obese or morbidly obese. This finding is based on moderate quality evidence. Cite this article: Bone Joint J 2016;98-B:1160-6
Action minimizing solutions of the Newtonian n-body problem: from homology to symmetry
An action minimizing path between two given configurations, spatial or
planar, of the -body problem is always a true -- collision-free -- solution.
Based on a remarkable idea of Christian Marchal, this theorem implies the
existence of new "simple" symmetric periodic solutions, among which the Eight
for 3 bodies, the Hip-Hop for 4 bodies and their generalizations
NGC1052 - A study of the pc-scale twin jet
We present results of a VLBA multi-frequency study of the pc-scale twin jet
in NGC1052. We observed this object at epoch 1998.99 with the VLBA at 5, 8.4,
22 and 43 GHz both in total and linearly polarized intensity. The spectral
analysis confirms the necessity of a free-free absorbing medium, obscuring the
innermost part of both jets. At 5 GHz we found a compact linearly polarized
emission region at the base of the eastern jet with a degree of polarization of
1.5%. At higher frequencies there is no evidence for polarization in our data.
A core shift analysis constrains the position of the central engine to ~0.03
pc. The shift rates of the apparent core position with frequency confirm the
strong influence of free-free absorption in conjunction with steep pressure
gradients at the bases of both jets.Comment: Proceedings of the conference "SRT: the impact of large antennas on
Radio Astronomy and Space Science", Cagliari, Italy, 7-10 November 2001, in
press; 6 pages, 5 figures, needs srt_style.st
Accelerating Incremental Gradient Optimization with Curvature Information
This paper studies an acceleration technique for incremental aggregated
gradient ({\sf IAG}) method through the use of \emph{curvature} information for
solving strongly convex finite sum optimization problems. These optimization
problems of interest arise in large-scale learning applications. Our technique
utilizes a curvature-aided gradient tracking step to produce accurate gradient
estimates incrementally using Hessian information. We propose and analyze two
methods utilizing the new technique, the curvature-aided IAG ({\sf CIAG})
method and the accelerated CIAG ({\sf A-CIAG}) method, which are analogous to
gradient method and Nesterov's accelerated gradient method, respectively.
Setting to be the condition number of the objective function, we prove
the linear convergence rates of for
the {\sf CIAG} method, and for the {\sf
A-CIAG} method, where are constants inversely proportional to
the distance between the initial point and the optimal solution. When the
initial iterate is close to the optimal solution, the linear convergence
rates match with the gradient and accelerated gradient method, albeit {\sf
CIAG} and {\sf A-CIAG} operate in an incremental setting with strictly lower
computation complexity. Numerical experiments confirm our findings. The source
codes used for this paper can be found on
\url{http://github.com/hoitowai/ciag/}.Comment: 22 pages, 3 figures, 3 tables. Accepted by Computational Optimization
and Applications, to appea
Ind--varieties of generalized flags as homogeneous spaces for classical ind--groups
The purpose of the present paper is twofold: to introduce the notion of a
generalized flag in an infinite dimensional vector space (extending the
notion of a flag of subspaces in a vector space), and to give a geometric
realization of homogeneous spaces of the ind--groups ,
and in terms of generalized flags. Generalized flags in are
chains of subspaces which in general cannot be enumerated by integers. Given a
basis of , we define a notion of --commensurability for generalized
flags, and prove that the set \cFl (\cF, E) of generalized flags
E\cFVVG = SL(\infty)G/PPG\cFl (\cF, E)SO(\infty)Sp(\infty)\cFl (\cF, E)\cFl
(\cF, E)\cFV$
Scaling by 5 on a 1/4-Cantor Measure
Each Cantor measure (\mu) with scaling factor 1/(2n) has at least one
associated orthonormal basis of exponential functions (ONB) for L^2(\mu). In
the particular case where the scaling constant for the Cantor measure is 1/4
and two specific ONBs are selected for L^2(\mu), there is a unitary operator U
defined by mapping one ONB to the other. This paper focuses on the case in
which one ONB (\Gamma) is the original Jorgensen-Pedersen ONB for the Cantor
measure (\mu) and the other ONB is is 5\Gamma. The main theorem of the paper
states that the corresponding operator U is ergodic in the sense that only the
constant functions are fixed by U.Comment: 34 page
Grothendieck ring of pretriangulated categories
We consider the abelian group generated by quasi-equivalence classes of
pretriangulated DG categories with relations coming from semi-orthogonal
decompositions of corresponding triangulated categories. We introduce an
operation of "multiplication" on the collection of DG categories
which makes this abelian group into a commutative ring. A few applications are
considered: representability of "standard" functors between derived categories
of coherent sheaves on smooth projective varieties and a construction of an
interesting motivic measure.Comment: 33 page
The management of segmental tibial shaft fractures: A systematic review.
INTRODUCTION: Segmental tibial fractures are complex injuries associated with significant soft tissue damage that are difficult to treat. This study aimed to identify the most effective method of treating segmental tibial fractures. METHOD: A PRISMA compliant systematic review was conducted. Studies investigating the management of segmental tibial fractures with intramedullary nail fixation (IMN), open reduction and internal fixation (ORIF) or circular external fixation (CEF) were included for review. The primary outcome measure was time to fracture union. Secondary outcomes were complications and functional outcome. A narrative analysis was undertaken as meta-analysis was inappropriate due to heterogeneity of the data. RESULTS: Thirteen studies were eligible and included. No randomised controlled trials were identified. Fixation with an intramedullary nail provided the fastest time to union, followed by open reduction and internal fixation and then CEF. The rate of deep infection was highest after IMN (5/162 [3%]), followed by open reduction and internal fixation (2/78 [2.5%]) and CEF (1/54 [2%]). However, some studies reported particularly high rates of infection following IMN for open segmental tibial fractures. There was limited reporting of postoperative deformities. From the studies that did include such data, there was a higher rate of deformity following ORIF (8/53 [15%]), compared to IMN (13/138 [9%]), and CEF (4/44 [9%]). Three studies, not including IMN, described patient reported outcome measures with results ranging from 'excellent' to 'fair'. DISCUSSION: The available evidence was of poor quality, dominated by retrospective case series. This prevented statistical analysis, and precludes firm conclusions being drawn from the results available. CONCLUSION: IMN has the fastest time to fracture union, however there are concerns regarding an increased deep infection rate in open segmental tibial fractures. In this subgroup, the data suggests CEF provides the most satisfactory results. However, the available literature does not provide sufficient detail to make this statement with certainty. We recommend a randomised controlled study to further investigate this challenging problem
Location Privacy in Spatial Crowdsourcing
Spatial crowdsourcing (SC) is a new platform that engages individuals in
collecting and analyzing environmental, social and other spatiotemporal
information. With SC, requesters outsource their spatiotemporal tasks to a set
of workers, who will perform the tasks by physically traveling to the tasks'
locations. This chapter identifies privacy threats toward both workers and
requesters during the two main phases of spatial crowdsourcing, tasking and
reporting. Tasking is the process of identifying which tasks should be assigned
to which workers. This process is handled by a spatial crowdsourcing server
(SC-server). The latter phase is reporting, in which workers travel to the
tasks' locations, complete the tasks and upload their reports to the SC-server.
The challenge is to enable effective and efficient tasking as well as reporting
in SC without disclosing the actual locations of workers (at least until they
agree to perform a task) and the tasks themselves (at least to workers who are
not assigned to those tasks). This chapter aims to provide an overview of the
state-of-the-art in protecting users' location privacy in spatial
crowdsourcing. We provide a comparative study of a diverse set of solutions in
terms of task publishing modes (push vs. pull), problem focuses (tasking and
reporting), threats (server, requester and worker), and underlying technical
approaches (from pseudonymity, cloaking, and perturbation to exchange-based and
encryption-based techniques). The strengths and drawbacks of the techniques are
highlighted, leading to a discussion of open problems and future work
- …
