Osteomyelitis: Sensitivity of 0.064 T MRI, three-phase bone scanning and indium scanning with biopsy proof

We compared the ability of magnetic resonance imaging (MRI) using a 0.064 T permanent magnet, three-phase bone scanning, and indium-labeled white blood cell (¹¹¹In-WBC) scanning, to diagnose osteomyelitis. Twenty-three patients underwent biopsy. All patients were examined at presentation with all three modalities. Sensitivities for each modality were calculated using biopsy as a gold standard. The results were 72% for MRI, 68% for bone scan, and 45% for ¹¹¹In-WBC. Specificities were not calculated because of lack of negative biopsies. MRI was as sensitive as bone scanning in the diagnosis of osteomyelitis. All modalities had lower than previously reported sensitivities for imaging osteomyelitis.     

Mössbauer spectroscopic investigations of Fe/Mn-Fischer-Tropsch-catalysts

The phase composition of Fe/Mn oxide catalysts of different compositions after 200 h of Fischer-Tropsch synthesis have been investigated by Mößbauer spectroscopy at room temperature, 77 K and 5 K. The final composition of the bulk catalysts depends strongly on the Mn content and the temperature of reduction before the synthesis. Catalytic activity and selectivity are partly correlated to this phase composition.     

On the order of tandem queues

We consider the optimal order of servers in a tandem queueing system withm stages, an unlimited supply of customers in front of the first stage, and a service buffer of size 1 but no intermediate storage buffers between the first and second stages. Service times depend on the servers but not the customers, and the blocking mechanism at the first two stages is manufacturing blocking. Using a new characterization of reversed hazard rate order, we show that if the service times for two servers are comparable in the reversed hazard rate sense, then the departure process is stochastically earlier if the slower server is first and the faster server is second than if the reverse is true. This strengthens earlier results that considered individual departure times marginally. We show similar results for the last two stages and for other blocking mechanisms. We also show that although individual departure times for a system with servers in a given order are stochastically identical to those when the order of servers is reversed, this reversibility property does not hold for the entire departure process.     

On solving a primal geometric program by partial dual optimization

The several published methods for mapping a dual solution estimate to a primal solution estimate in posynomial geometric programming provide no criteria for deciding how much deviation from primal feasibility, or discrepancy between the primal and dual objective function values, should be permitted before the primal solution estimate is accepted by the designer. This paper presents a new and simple dual-to-primal conversion method that uses the cost coefficients to provide a sound economic criterion for determining when to accept a primal solution estimate. The primal solution estimate generated is the exact solution to a modified primal obtained from the given primal by modifying the cost coefficients, with the exponent matrix left unchanged. The method is shown to have desirable properties when coupled with a convergent dual algorithm.