Northern Ireland Point Prevalence Survey of Hospital-acquired Infections and Antimicrobial Use 2012

The PHA�coordinated Northern Ireland's participation in ECDC's National Prevalence Survey on�Hospital-Acquired Infections & on Antimicrobial Use. Hospitals in Northern Ireland participated in data collection between May and June 2012.This report provides a snapshot of the levels of hospital-acquired infections (HAI) and levels of antimicrobial use (AMU) in hospitals in Northern Ireland during 2012.There have been three previous HAI PPS surveys and the last survey was carried out in 2006. It is difficult to compare each survey as the data was collected in a different way. However, after making allowances, there was an overall drop in HAI prevalence of 18% from 2006 to 2012.The PPS data collection was undertaken by hospital teams between May and June 2012 (one hospital deferred data collection until September 2012 because of a move to a new hospital); 16 hospitals surveyed 3,992 eligible patients. The median age of all patients was 66 years. A total of 383 (10 per cent) children under 16 years of age were surveyed.�Key results from this year's survey:The prevalence of HAI was 4.2%. A total of 166 patients were diagnosed with an active HAI with 3 patients having more than one infection.When comparing ward specialties, HAI prevalence was highest for patients in adult intensive care units (ICUs) at 9.1 per cent, followed by care of the elderly wards at 5.7%.The most common types of HCAI were respiratory infections (including pneumonia and infections of the lower respiratory tract) (27.9 per cent of all infections), surgical site infections (18.9 per cent) and urinary tract infections (UTI) (11.8 per cent).Since the last PPS in 2006 there has been a reduction in MRSA infections - from 0.9 per cent �of the hospital population to less than 0.1 per cent in patients; and a five-fold reduction in C. difficile infections (from 1.1 per cent to 0.2 per cent).The prevalence of antimicrobial use was 29.5%.Most antibiotic use (60 per cent) in hospitals was in patients receiving treatment for infections which commenced in the community. Eleven percent of surgical prophylaxis was prescribed for greater than one day.��

BCN­Routing : càlcul web de rutes amb pgRouting, OpenStreetMap i OpenLayers

En aquest projecte s'ha desenvolupat una interfície web per calcular rutes a la ciutat de Barcelona. Les rutes calculades són a peu, entre un punt d'origen qualsevol i un punt d'interès turístic de la ciutat com a destí. Per això s'han extret les dades dels carrers de Barcelona d'OpenStreetMap i s'han insertat a una base de dades postgreSQL/postGIS, juntament amb una capa vectorial de punts d'interès turístic que s'ha creat amb el SIG d'escriptori qGIS. El càlcul de les rutes amb les dades de la base de dades s'ha realitzat amb l'extensió pgRouting, i la interfície web per seleccionar els punts d'origen i destí, mostrar els mapes, i mostrar les rutes resultat, s'ha desenvolupat utilitzant la llibreria OpenLayers.

Nouveautés thérapeutiques 2008 en médecine interne hospitalière: perspective des chefs de clinique [Highlights 2008 in a university hospital-based internal medicine: the point of view from the chief residents]

Doctors must regularly adjust their patients' care according to recent relevant publications. The chief residents from the Department of Internal Medicine of a university hospital present some major themes of internal medicine treated during the year 2008, such as heart failure, diabetes, COPD, and thromboembolic disease. Emphasis will be placed primarily on changes in the daily hospital practice induced by these recent studies. This variety of topics illustrates both the broad spectrum of the current internal medicine, and the many uncertainties associated with modem medical practice based on evidence.

An iterative Multiscale Finite-Volume algorithm converging to the exact solution

The multiscale finite volume (MsFV) method has been developed to efficiently solve large heterogeneous problems (elliptic or parabolic); it is usually employed for pressure equations and delivers conservative flux fields to be used in transport problems. The method essentially relies on the hypothesis that the (fine-scale) problem can be reasonably described by a set of local solutions coupled by a conservative global (coarse-scale) problem. In most cases, the boundary conditions assigned for the local problems are satisfactory and the approximate conservative fluxes provided by the method are accurate. In numerically challenging cases, however, a more accurate localization is required to obtain a good approximation of the fine-scale solution. In this paper we develop a procedure to iteratively improve the boundary conditions of the local problems. The algorithm relies on the data structure of the MsFV method and employs a Krylov-subspace projection method to obtain an unconditionally stable scheme and accelerate convergence. Two variants are considered: in the first, only the MsFV operator is used; in the second, the MsFV operator is combined in a two-step method with an operator derived from the problem solved to construct the conservative flux field. The resulting iterative MsFV algorithms allow arbitrary reduction of the solution error without compromising the construction of a conservative flux field, which is guaranteed at any iteration. Since it converges to the exact solution, the method can be regarded as a linear solver. In this context, the schemes proposed here can be viewed as preconditioned versions of the Generalized Minimal Residual method (GMRES), with a very peculiar characteristic that the residual on the coarse grid is zero at any iteration (thus conservative fluxes can be obtained).

Remodeling of DNA replication structures by the branch point translocase FANCM

Fanconi anemia (FA) is a genetically heterogeneous chromosome instability syndrome associated with congenital abnormalities, bone marrow failure, and cancer predisposition. Eight FA proteins form a nuclear core complex, which promotes tolerance of DNA lesions in S phase, but the underlying mechanisms are still elusive. We reported recently that the FA core complex protein FANCM can translocate Holliday junctions. Here we show that FANCM promotes reversal of model replication forks via concerted displacement and annealing of the nascent and parental DNA strands. Fork reversal by FANCM also occurs when the lagging strand template is partially single-stranded and bound by RPA. The combined fork reversal and branch migration activities of FANCM lead to extensive regression of model replication forks. These observations provide evidence that FANCM can remodel replication fork structures and suggest a mechanism by which FANCM could promote DNA damage tolerance in S phase

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

Speculative parallelization of multipath radiosity algorithm

In computer graphics, global illumination algorithms take into account not only the light that comes directly from the sources, but also the light interreflections. This kind of algorithms produce very realistic images, but at a high computational cost, especially when dealing with complex environments. Parallel computation has been successfully applied to such algorithms in order to make it possible to compute highly-realistic images in a reasonable time. We introduce here a speculation-based parallel solution for a global illumination algorithm in the context of radiosity, in which we have taken advantage of the hierarchical nature of such an algorithm