1.5 m for Finglas Addiction Support Team (FAST)

Noel Ahern T.D., Minister of State at the Department of Community, Rural and Gaeltacht Affairs with responsibility for the National Drugs Strategy, has announced funding of €1.5m under the Premises Initiative Fund to Finglas Addiction Support Team (FAST). FAST is a community-based initiative funded by the Department of Community, Rural & Gaeltacht Affairs under the National Drugs Strategy through Finglas/Cabra Local Drugs Task Force.This resource was contributed by The National Documentation Centre on Drug Use.

Fast subplasma membrane Ca2+ transients control exo-endocytosis of synaptic-like microvesicles in astrocytes

Astrocytes are the most abundant glial cell type in the brain. Although not apposite for long-range rapid electrical communication, astrocytes share with neurons the capacity of chemical signaling via Ca(2+)-dependent transmitter exocytosis. Despite this recent finding, little is known about the specific properties of regulated secretion and vesicle recycling in astrocytes. Important differences may exist with the neuronal exocytosis, starting from the fact that stimulus-secretion coupling in astrocytes is voltage independent, mediated by G-protein-coupled receptors and the release of Ca(2+) from internal stores. Elucidating the spatiotemporal properties of astrocytic exo-endocytosis is, therefore, of primary importance for understanding the mode of communication of these cells and their role in brain signaling. We here take advantage of fluorescent tools recently developed for studying recycling of glutamatergic vesicles at synapses (Voglmaier et al., 2006; Balaji and Ryan, 2007); we combine epifluorescence and total internal reflection fluorescence imaging to investigate with unprecedented temporal and spatial resolution, the stimulus-secretion coupling underlying exo-endocytosis of glutamatergic synaptic-like microvesicles (SLMVs) in astrocytes. Our main findings indicate that (1) exo-endocytosis in astrocytes proceeds with a time course on the millisecond time scale (tau(exocytosis) = 0.24 +/- 0.017 s; tau(endocytosis) = 0.26 +/- 0.03 s) and (2) exocytosis is controlled by local Ca(2+) microdomains. We identified submicrometer cytosolic compartments delimited by endoplasmic reticulum tubuli reaching beneath the plasma membrane and containing SLMVs at which fast (time-to-peak, approximately 50 ms) Ca(2+) events occurred in precise spatial-temporal correlation with exocytic fusion events. Overall, the above characteristics of transmitter exocytosis from astrocytes support a role of this process in fast synaptic modulation.

Fast analysis of doping agents in urine by ultra-high-pressure liquid chromatography-quadrupole time-of-flight mass spectrometry. II: Confirmatory analysis.

For doping control, analyses of samples are generally achieved in two steps: a rapid screening and, in the case of a positive result, a confirmatory analysis. A two-step methodology based on ultra-high-pressure liquid chromatography coupled to a quadrupole time-of-flight mass spectrometry (UHPLC-QTOF-MS) was developed to screen and confirm 103 doping agents from various classes (e.g., beta-blockers, stimulants, diuretics, and narcotics). The screening method was presented in a previous article as part I (i.e., Fast analysis of doping agents in urine by ultra-high-pressure liquid chromatography-quadrupole time-of-flight mass spectrometry. Part I: screening analysis). For the confirmatory method, basic, neutral and acidic compounds were extracted by a dedicated solid-phase extraction (SPE) in a 96-well plate format and detected by MS in the tandem mode to obtain precursor and characteristic product ions. The mass accuracy and the elemental composition of precursor and product ions were used for compound identification. After validation including matrix effect determination, the method was considered reliable to confirm suspect results without ambiguity according to the positivity criteria established by the World Anti-Doping Agency (WADA). Moreover, an isocratic method was developed to separate ephedrine from its isomer pseudoephedrine and cathine from phenylpropanolamine in a single run, what allowed their direct quantification in urine.

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).

Minimum interference routing with fast protection

One of the most effective techniques offering QoS routing is minimum interference routing. However, it is complex in terms of computation time and is not oriented toward improving the network protection level. In order to include better levels of protection, new minimum interference routing algorithms are necessary. Minimizing the failure recovery time is also a complex process involving different failure recovery phases. Some of these phases depend completely on correct routing selection, such as minimizing the failure notification time. The level of protection also involves other aspects, such as the amount of resources used. In this case shared backup techniques should be considered. Therefore, minimum interference techniques should also be modified in order to include sharing resources for protection in their objectives. These aspects are reviewed and analyzed in this article, and a new proposal combining minimum interference with fast protection using shared segment backups is introduced. Results show that our proposed method improves both minimization of the request rejection ratio and the percentage of bandwidth allocated to backup paths in networks with low and medium protection requirements

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

Prospective universal application of mycobacterial interspersed repetitive-unit-variable-number tandem-repeat genotyping to characterize Mycobacterium tuberculosis isolates for fast identification of clustered and orphan cases.

The use of molecular tools for genotyping Mycobacterium tuberculosis isolates in epidemiological surveys in order to identify clustered and orphan strains requires faster response times than those offered by the reference method, IS6110 restriction fragment length polymorphism (RFLP) genotyping. A method based on PCR, the mycobacterial interspersed repetitive-unit-variable-number tandem-repeat (MIRU-VNTR) genotyping technique, is an option for fast fingerprinting of M. tuberculosis, although precise evaluations of correlation between MIRU-VNTR and RFLP findings in population-based studies in different contexts are required before the methods are switched. In this study, we evaluated MIRU-VNTR genotyping (with a set of 15 loci [MIRU-15]) in parallel to RFLP genotyping in a 39-month universal population-based study in a challenging setting with a high proportion of immigrants. For 81.9% (281/343) of the M. tuberculosis isolates, both RFLP and MIRU-VNTR types were obtained. The percentages of clustered cases were 39.9% (112/281) and 43.1% (121/281) for RFLP and MIRU-15 analyses, and the numbers of clusters identified were 42 and 45, respectively. For 85.4% of the cases, the RFLP and MIRU-15 results were concordant, identifying the same cases as clustered and orphan (kappa, 0.7). However, for the remaining 14.6% of the cases, discrepancies were observed: 16 of the cases clustered by RFLP analysis were identified as orphan by MIRU-15 analysis, and 25 cases identified as orphan by RFLP analysis were clustered by MIRU-15 analysis. When discrepant cases showing subtle genotypic differences were tolerated, the discrepancies fell from 14.6% to 8.6%. Epidemiological links were found for 83.8% of the cases clustered by both RFLP and MIRU-15 analyses, whereas for the cases clustered by RFLP or MIRU-VNTR analysis alone, links were identified for only 30.8% or 38.9% of the cases, respectively. The latter group of cases mainly comprised isolates that could also have been clustered, if subtle genotypic differences had been tolerated. MIRU-15 genotyping seems to be a good alternative to RFLP genotyping for real-time interventional schemes. The correlation between MIRU-15 and IS6110 RFLP findings was reasonable, although some uncertainties as to the assignation of clusters by MIRU-15 analysis were identified.

A Monte Carlo-Based Fiber Tracking Algorithm using Diffusion Tensor MRI

Diffusion tensor magnetic resonance imaging, which measures directional information of water diffusion in the brain, has emerged as a powerful tool for human brain studies. In this paper, we introduce a new Monte Carlo-based fiber tracking approach to estimate brain connectivity. One of the main characteristics of this approach is that all parameters of the algorithm are automatically determined at each point using the entropy of the eigenvalues of the diffusion tensor. Experimental results show the good performance of the proposed approach

Ultra-fast recovery from right neglect after 'awake surgery' for slow-growing tumor invading the left parietal area

It is now possible to perform resections of slow-growing tumors in awake patients. Using direct electrical stimulation, real-time functional mapping of the brain can be used to prevent the resection of essential areas near the tumor. Simple clinical observations of patients with a resection of slow-growing tumors have demonstrated substantial recovery within a few days of such 'awake surgery'. The aim of this study was to investigate the kinetics of recovery following the resection of slow-growing tumors invading the left parietal area and to focus mainly on its rapidity. Two patients were assessed by standard line bisection tests and compared with eight healthy individuals. Independently of the pure nature of the symptoms, we report that the patients rapidly and substantially recovered from pronounced right neglect. They were tested 48 hours after the surgery and the recovery was significant for both patients after less than 4 hours. Strikingly, for one patient, recovery was ultra fast and substantial in the first practice session within less than 7 minutes: it occurred without verbal feedback and was substantially retained during the following testing session. Its rapidity suggests a process of unmasking redundant networks. With the slow growth of the lesion, the contralesional hemisphere is probably progressively prepared for rapid unmasking of homologue networks. These results have major clinical implications. For patients with an invading left-side tumor, it is now clear that line bisections are required before, during, and after awake surgery to: plan the surgery, control the quality of the resection, and also optimize the rehabilitation of the patient

Three-dimensional high-resolution fast spin-echo coronary magnetic resonance angiography.

Due to SNR constraints, current "bright-blood" 3D coronary MRA approaches still suffer from limited spatial resolution when compared to conventional x-ray coronary angiography. Recent 2D fast spin-echo black-blood techniques maximize signal for coronary MRA at no loss in image spatial resolution. This suggests that the extension of black-blood coronary MRA with a 3D imaging technique would allow for a further signal increase, which may be traded for an improved spatial resolution. Therefore, a dual-inversion 3D fast spin-echo imaging sequence and real-time navigator technology were combined for high-resolution free-breathing black-blood coronary MRA. In-plane image resolution below 400 microm was obtained. Magn Reson Med 45:206-211, 2001.

Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories

The k-symplectic formulation of field theories is especially simple, since only tangent and cotangent bundles are needed in its description. Its defining elements show a close relationship with those in the symplectic formulation of mechanics. It will be shown that this relationship also stands in the presymplectic case. In a natural way,one can mimick the presymplectic constraint algorithm to obtain a constraint algorithmthat can be applied to k-presymplectic field theory, and more particularly to the Lagrangian and Hamiltonian formulations offield theories defined by a singular Lagrangian, as well as to the unified Lagrangian-Hamiltonian formalism (Skinner--Rusk formalism) for k-presymplectic field theory. Two examples of application of the algorithm are also analyzed.