Computer-assisted placement technique in hip resurfacing arthroplasty: improvement in accuracy?

Freehand positioning of the femoral drill guide is difficult during hip resurfacing and the surgeon is often unsure of the implant position achieved peroperatively. The purpose of this study was to find out whether, by using a navigation system, acetabular and femoral component positioning could be made easier and more precise. Eighteen patients operated on by the same surgeon were matched by sex, age, BMI, diagnosis and ASA score (nine patients with computer assistance, nine with the regular ancillary). Pre-operative planning was done on standard AP and axial radiographs with CT scan views for the computer-assisted operations. The final position of implants was evaluated by the same radiographs for all patients. The follow-up was at least 1 year. No difference between both groups in terms of femoral component position was observed (p > 0.05). There was also no difference in femoral notching. A trend for a better cup position was observed for the navigated hips, especially for cup anteversion. There was no additional operating time for the navigated hips. Hip navigation for resurfacing surgery may allow improved visualisation and hip implant positioning, but its advantage probably will be more obvious with mini-incisions than with regular incision surgery.

Die Inguinal-Hernienplastik nach Lichtenstein: Eine einfache und komplikationsarme Technik, besonders geeignet für die Tageschirurgie [The Lichtenstein inguinal hernia-plasty: a simple and complication-free technique, especially suited for ambulatory surgery].

A consecutive series of 353 patients who underwent Lichtenstein mesh repair for inguinal hernia from the 1st of July 1994 to the 30th of July 1995 were studied. We analysed our indication, technique, complications, follow-up and outcome. Special consideration was given to the advantages and acceptance of day-case surgery. Our results suggest that the Lichtenstein repair should be considered as a new standard procedure, especially outside of hernia centres.

A DGT Technique for Plutonium Bioavailability Measurements.

The toxicity of heavy metals in natural waters is strongly dependent on the local chemical environment. Assessing the bioavailability of radionuclides predicts the toxic effects to aquatic biota. The technique of diffusive gradients in thin films (DGT) is largely exploited for bioavailability measurements of trace metals in waters. However, it has not been applied for plutonium speciation measurements yet. This study investigates the use of DGT technique for plutonium bioavailability measurements in chemically different environments. We used a diffusion cell to determine the diffusion coefficients (D) of plutonium in polyacrylamide (PAM) gel and found D in the range of 2.06-2.29 × 10(-6) cm(2) s(-1). It ranged between 1.10 and 2.03 × 10(-6) cm(2) s(-1) in the presence of fulvic acid and in natural waters with low DOM. In the presence of 20 ppm of humic acid of an organic-rich soil, plutonium diffusion was hindered by a factor of 5, with a diffusion coefficient of 0.50 × 10(-6) cm(2) s(-1). We also tested commercially available DGT devices with Chelex resin for plutonium bioavailability measurements in laboratory conditions and the diffusion coefficients agreed with those from the diffusion cell experiments. These findings show that the DGT methodology can be used to investigate the bioaccumulation of the labile plutonium fraction in aquatic biota.

La technique au tribunal de l'éthique?

Ni technophile, ni technophobe, un éthicien s'interroge sur son rôle alors que la question de l'éthiquement correct se pose à lui de plus en plus souvent. Pourquoi cette urgence? A quel imaginaire renvoie-t-elle? Son hypothèse est la suivante: le monde technique serait désormais «la» nouvelle nature et il continue sa course quasi-automatiquement; il ferait ainsi de nous des «objets», par exemple de simples «épiphénomènes d'un programme génétique», à exploiter ou à surveiller. D'où notre besoin d'être rassurés.

Helminth Parasites of Conventionally Maintained Laboratory Mice: II- Inbred Strains with an Adaptation of the Anal Swab Technique

Worm burdens recovered from inbred mice strains, namely C57Bl/6, C57Bl/10, CBA, BALB/c, DBA/2 and C3H/He, conventionally maintained in two institutional animal houses in the State of Rio de Janeiro, RJ, Brazil, were analyzed and compared, regarding their prevalences and mean intensities.Three parasite species were observed: the nematodes Aspiculuris tetraptera, Syphacia obvelata and the cestode Vampirolepis nana. A modification of the anal swab technique is also proposed for the first time as an auxiliary tool for the detection of oxyurid eggs in mice

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.