Gene expression profiling reveals consistent differences between clinical samples of human leukaemias and their model cell lines

Microarray gene expression profiles of fresh clinical samples of chronic myeloid leukaemia in chronic phase, acute promyelocytic leukaemia and acute monocytic leukaemia were compared with profiles from cell lines representing the corresponding types of leukaemia (K562, NB4, HL60). In a hierarchical clustering analysis, all clinical samples clustered separately from the cell lines, regardless of leukaemic subtype. Gene ontology analysis showed that cell lines chiefly overexpressed genes related to macromolecular metabolism, whereas in clinical samples genes related to the immune response were abundantly expressed. These findings must be taken into consideration when conclusions from cell line-based studies are extrapolated to patients.

Consistent Layout for Thematic Software Maps

Software visualizations can provide a concise overview of a complex software system. Unfortunately, since software has no physical shape, there is no “natural“ mapping of software to a two-dimensional space. As a consequence most visualizations tend to use a layout in which position and distance have no meaning, and consequently layout typical diverges from one visualization to another. We propose a consistent layout for software maps in which the position of a software artifact reflects its \emph{vocabulary}, and distance corresponds to similarity of vocabulary. We use Latent Semantic Indexing (LSI) to map software artifacts to a vector space, and then use Multidimensional Scaling (MDS) to map this vector space down to two dimensions. The resulting consistent layout allows us to develop a variety of thematic software maps that express very different aspects of software while making it easy to compare them. The approach is especially suitable for comparing views of evolving software, since the vocabulary of software artifacts tends to be stable over time.

Table-mounted ring retractor for consistent visualization in endoscopy-assisted anterior reconstruction of burst fractures of the thoracolumbar junction

The authors tested an autoclavable external ring retractor, fixed to the operation table, for the endoscopic reconstruction of anterior column injuries of the thoracolumbar junction. It served as a retractor for the diaphragm, and offered a stable support for the scope and other instruments, making an assistant superfluous. Moreover, it allowed bimanual manipulation. Of course, the two-dimensional image, provided by the scope, necessitated proper eye-hand coordination. Twenty-eight consecutive patients underwent either a monosegmental (n = 10) or a bisegmental (n = 18) anterior stabilization in the area Th11L1. Three portals were necessary, but an assistant was not needed. The overall (mean +/- SD) operating time was 196 +/- 56 min, the blood loss was 804 +/- 719 mL. Intraoperatively, one epidural bleeding and a single screw cut-out occurred. All complications were managed endoscopically. Postoperatively, evacuation of a haemothorax (n = 1) was necessary. In all patients, wounds and fractures healed uneventfully. The combination of the endoscopic technique and the retractor system was feasible, successful, safe, and time efficient. Moreover, it allowed for anterior instrumentation of thoracolumbar fractures by a single surgeon. It became the standard approach in the authors' department.

Francisella tularensis infection in a stone marten (Martes foina) without classic pathological lesions consistent with tularemia.

The current report describes the isolation and typing of a strain of Francisella tularensis, the causative agent of tularemia, from the spleen of a stone marten (Martes foina) showing no classic lesions consistent with the disease. The identification of this bacterium, belonging to the World Health Organization risk 3 category and considered to have a low infectious dose, could be performed only because of an ongoing project screening F. tularensis in the environment sensu lato. The findings described herein should alert diagnostic laboratories of the possible presence of F. tularensis in clinical samples in countries where tularemia is endemic even in cases with no consistent anamnesis and from unsuspected animal species.

A Closed-Form, Consistent and Robust Solution to Uncalibrated Photometric Stereo Via Local Diffuse Reflectance Maxima

Images of an object under different illumination are known to provide strong cues about the object surface. A mathematical formalization of how to recover the normal map of such a surface leads to the so-called uncalibrated photometric stereo problem. In the simplest instance, this problem can be reduced to the task of identifying only three parameters: the so-called generalized bas-relief (GBR) ambiguity. The challenge is to find additional general assumptions about the object, that identify these parameters uniquely. Current approaches are not consistent, i.e., they provide different solutions when run multiple times on the same data. To address this limitation, we propose exploiting local diffuse reflectance (LDR) maxima, i.e., points in the scene where the normal vector is parallel to the illumination direction (see Fig. 1). We demonstrate several noteworthy properties of these maxima: a closed-form solution, computational efficiency and GBR consistency. An LDR maximum yields a simple closed-form solution corresponding to a semi-circle in the GBR parameters space (see Fig. 2); because as few as two diffuse maxima in different images identify a unique solution, the identification of the GBR parameters can be achieved very efficiently; finally, the algorithm is consistent as it always returns the same solution given the same data. Our algorithm is also remarkably robust: It can obtain an accurate estimate of the GBR parameters even with extremely high levels of outliers in the detected maxima (up to 80 % of the observations). The method is validated on real data and achieves state-of-the-art results.

Symmetric inverse consistent nonlinear registration driven by mutual information.

A nonlinear viscoelastic image registration algorithm based on the demons paradigm and incorporating inverse consistent constraint (ICC) is implemented. An inverse consistent and symmetric cost function using mutual information (MI) as a similarity measure is employed. The cost function also includes regularization of transformation and inverse consistent error (ICE). The uncertainties in balancing various terms in the cost function are avoided by alternatively minimizing the similarity measure, the regularization of the transformation, and the ICE terms. The diffeomorphism of registration for preventing folding and/or tearing in the deformation is achieved by the composition scheme. The quality of image registration is first demonstrated by constructing brain atlas from 20 adult brains (age range 30-60). It is shown that with this registration technique: (1) the Jacobian determinant is positive for all voxels and (2) the average ICE is around 0.004 voxels with a maximum value below 0.1 voxels. Further, the deformation-based segmentation on Internet Brain Segmentation Repository, a publicly available dataset, has yielded high Dice similarity index (DSI) of 94.7% for the cerebellum and 74.7% for the hippocampus, attesting to the quality of our registration method.

Asynchronous ECG time sampling: Saving bits with Golomb-Rice encoding

We present a technique for online compression of ECG signals using the Golomb-Rice encoding algorithm. This is facilitated by a novel time encoding asynchronous analog-to-digital converter targeted for low-power, implantable, long-term bio-medical sensing applications. In contrast to capturing the actual signal (voltage) values the asynchronous time encoder captures and encodes the time information at which predefined changes occur in the signal thereby minimizing the sensor's energy use and the number of bits we store to represent the information by not capturing unnecessary samples. The time encoder transforms the ECG signal data to pure time information that has a geometric distribution such that the Golomb-Rice encoding algorithm can be used to further compress the data. An overall online compression rate of about 6 times is achievable without the usual computations associated with most compression methods.