High-resolution 3D whole-heart coronary MRA: a study on the combination of data acquisition in multiple breath-holds and 1D residual respiratory motion compensation.

OBJECT: To study a scan protocol for coronary magnetic resonance angiography based on multiple breath-holds featuring 1D motion compensation and to compare the resulting image quality to a navigator-gated free-breathing acquisition. Image reconstruction was performed using L1 regularized iterative SENSE. MATERIALS AND METHODS: The effects of respiratory motion on the Cartesian sampling scheme were minimized by performing data acquisition in multiple breath-holds. During the scan, repetitive readouts through a k-space center were used to detect and correct the respiratory displacement of the heart by exploiting the self-navigation principle in image reconstruction. In vivo experiments were performed in nine healthy volunteers and the resulting image quality was compared to a navigator-gated reference in terms of vessel length and sharpness. RESULTS: Acquisition in breath-hold is an effective method to reduce the scan time by more than 30 % compared to the navigator-gated reference. Although an equivalent mean image quality with respect to the reference was achieved with the proposed method, the 1D motion compensation did not work equally well in all cases. CONCLUSION: In general, the image quality scaled with the robustness of the motion compensation. Nevertheless, the featured setup provides a positive basis for future extension with more advanced motion compensation methods.

Inherently self-calibrating non-Cartesian parallel imaging.

The use of self-calibrating techniques in parallel magnetic resonance imaging eliminates the need for coil sensitivity calibration scans and avoids potential mismatches between calibration scans and subsequent accelerated acquisitions (e.g., as a result of patient motion). Most examples of self-calibrating Cartesian parallel imaging techniques have required the use of modified k-space trajectories that are densely sampled at the center and more sparsely sampled in the periphery. However, spiral and radial trajectories offer inherent self-calibrating characteristics because of their densely sampled center. At no additional cost in acquisition time and with no modification in scanning protocols, in vivo coil sensitivity maps may be extracted from the densely sampled central region of k-space. This work demonstrates the feasibility of self-calibrated spiral and radial parallel imaging using a previously described iterative non-Cartesian sensitivity encoding algorithm.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

A new approach to accurate measurement of uniaxial joint angles based on a combination of accelerometers and gyroscopes.

A new method of measuring joint angle using a combination of accelerometers and gyroscopes is presented. The method proposes a minimal sensor configuration with one sensor module mounted on each segment. The model is based on estimating the acceleration of the joint center of rotation by placing a pair of virtual sensors on the adjacent segments at the center of rotation. In the proposed technique, joint angles are found without the need for integration, so absolute angles can be obtained which are free from any source of drift. The model considers anatomical aspects and is personalized for each subject prior to each measurement. The method was validated by measuring knee flexion-extension angles of eight subjects, walking at three different speeds, and comparing the results with a reference motion measurement system. The results are very close to those of the reference system presenting very small errors (rms = 1.3, mean = 0.2, SD = 1.1 deg) and excellent correlation coefficients (0.997). The algorithm is able to provide joint angles in real-time, and ready for use in gait analysis. Technically, the system is portable, easily mountable, and can be used for long term monitoring without hindrance to natural activities.

On the efficiency and sensitivity of a pyramidal classification algorithm

In this paper we propose a Pyramidal Classification Algorithm,which together with an appropriate aggregation index producesan indexed pseudo-hierarchy (in the strict sense) withoutinversions nor crossings. The computer implementation of thealgorithm makes it possible to carry out some simulation testsby Monte Carlo methods in order to study the efficiency andsensitivity of the pyramidal methods of the Maximum, Minimumand UPGMA. The results shown in this paper may help to choosebetween the three classification methods proposed, in order toobtain the classification that best fits the original structureof the population, provided we have an a priori informationconcerning this structure.

A simple randomized algorithm for consistent sequential prediction of ergodic time series

We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if thesequence is a realization of a stationary and ergodic random process then the average number of mistakes converges, almost surely, to that of the optimum, given by the Bayes predictor.

Experiments on substratum roughness, grainsize and volume influence on the motion and spreading of rock avalanches

The main objective of the research is to link granular physics with the modelling of rock avalanches. Laboratory experiments consist to find a convenient granular material, i.e. grainsize and physical behaviour, and testing it on simple slope geometry. When the appropriate sliding material is selected, we attempted to model the debris avalanche and the spreading on a slope with different substratum to understand the relationship between the volume and the reach angle, i.e. angle of the line joining the top of the scar and the end of the deposit. For a better understanding of the mass spreading, the deposits are scanned with a laser scanner. Datasets are compared to see how the grain size and volume influence a debris avalanche. The relationship between the roughness and grainsize of the substratum shows that the spreading of the sliding mass is increased when the roughness of the substratum starts to be equivalent or greater than the grainsize of the flowing mass. The runout distance displays a more complex relationship, because a long runout distance implies that grains are less spread. This means that if the substratum is too rough the distance diminishes, as well if it is too smooth because the effect on the apparent friction decreases. Up to now our findings do not permit to validate any previous model (Melosh, 1987; Bagnold 1956).

Setting in motion the immune mechanisms underlying genetically determined resistance and susceptibility to infection with Leishmania major.

The murine model of infection with Leishmania major has allowed the demonstration of a causal relationship between, on the one hand, genetically determined resistance to infection and the development of a Th1 CD4+ cell response, and on the other hand, genetically determined susceptibility and Th2 cell maturation. Using this murine model of infection, the role of cytokines in directing the functional differentiation pathway of CD4+ T cell precursors, has been demonstrated in vivo. Thus, IL-12 and IFN-gamma have been shown to favour Th1 cell development and IL-4 is crucial for the differentiation of Th2 responses. Maturation of a Th2 response in susceptible BALB/c mice following infection with L. major is triggered by the IL-4 produced during the first two days after parasite inoculation. This IL-4 rapidly renders parasite specific CD4+ T cells precursors unresponsive to IL-12. A restricted population of CD4+ T cells expressing the V beta 4V alpha 8 TCR heterodimer and recognizing a single epitope on the LACK (Leishmania Activated C-Kinase) antigen of L. major is responsible for this rapid production of IL-4, instructing subsequent differentiation towards the Th2 phenotype of CD4+ T cells specific for several parasite antigens.

Altered vision during motion: an unusual symptom of cerebellar dysfunction, quantifiable by a simple clinical test.

PURPOSE: To report a series of patients with cerebellar dysfunction and altered vision during motion, and to quantify their visual impairment in motion with a simple clinical test. METHODS: Twenty consecutive patients suffering from cerebellar dysfunction and altered vision during motion were examined between 1994 and 2007. A control group consisted of 20 age- and sex-matched healthy people. All patients had a full neuro-ophthalmic examination. Near visual acuity (NVA) was measured at rest (static NVA) and during chair rotation (dynamic NVA). Distance visual acuity (DVA) was measured at rest (static DVA) and during rotation of the patient's head (dynamic DVA). RESULTS: Only four of the 20 patients reported altered vision during motion spontaneously. The remaining 16 patients admitted this unusual visual disturbance only when asked specifically. All patients exhibited abnormal eye movements, including saccadic smooth pursuit (20/20), dysmetric saccades (15/20), nystagmus (19/20) and impaired suppression of vestibulo-ocular reflex (VOR) (20/20). During rotation of the examination chair (dynamic NVA), the drop in NVA averaged 5.6 lines (range 1-10 lines). During rotation of the patient's head (dynamic DVA), the drop in DVA averaged only 2.5 lines (range 0-10 lines). For the control group, there was no significant drop in NVA under dynamic conditions. CONCLUSION: Patients with cerebellar dysfunction rarely complain spontaneously of altered vision during motion. However, specific questioning may bring up this unusual symptom. The use of a simple clinical test, consisting of NVA measurement during rotation of the examination chair (dynamic NVA), allows practitioners to quantify the level of visual impairment in patients presenting altered VOR modulation.

An Efficient Nominal Unification Algorithm

Nominal Unification is an extension of first-order unification where terms can contain binders and unification is performed modulo α equivalence. Here we prove that the existence of nominal unifiers can be decided in quadratic time. First, we linearly-reduce nominal unification problems to a sequence of freshness and equalities between atoms, modulo a permutation, using ideas as Paterson and Wegman for first-order unification. Second, we prove that solvability of these reduced problems may be checked in quadràtic time. Finally, we point out how using ideas of Brown and Tarjan for unbalanced merging, we could solve these reduced problems more efficiently

Validation of a clinical algorithm to identify low-risk patients with pulmonary embolism.

Summary Background: We previously derived a clinical prognostic algorithm to identify patients with pulmonary embolism (PE) who are at low-risk of short-term mortality who could be safely discharged early or treated entirely in an outpatient setting. Objectives: To externally validate the clinical prognostic algorithm in an independent patient sample. Methods: We validated the algorithm in 983 consecutive patients prospectively diagnosed with PE at an emergency department of a university hospital. Patients with none of the algorithm's 10 prognostic variables (age >/= 70 years, cancer, heart failure, chronic lung disease, chronic renal disease, cerebrovascular disease, pulse >/= 110/min., systolic blood pressure < 100 mm Hg, oxygen saturation < 90%, and altered mental status) at baseline were defined as low-risk. We compared 30-day overall mortality among low-risk patients based on the algorithm between the validation and the original derivation sample. We also assessed the rate of PE-related and bleeding-related mortality among low-risk patients. Results: Overall, the algorithm classified 16.3% of patients with PE as low-risk. Mortality at 30 days was 1.9% among low-risk patients and did not differ between the validation and the original derivation sample. Among low-risk patients, only 0.6% died from definite or possible PE, and 0% died from bleeding. Conclusions: This study validates an easy-to-use, clinical prognostic algorithm for PE that accurately identifies patients with PE who are at low-risk of short-term mortality. Low-risk patients based on our algorithm are potential candidates for less costly outpatient treatment.