Recurrent acute low back pain secondary to lumbar epidural calcification

Introduction: Epidural calcification is a rare cause of back pain, and spontaneous epidural calcification has not been reported previously. Case report: We describe a patient with acute low back pain and signs of lumbar nerve root compression due to epidural calcification, as demonstrated by CT-scan and MRI. Radiological signs of spondylodiscitis led to a search for an infectious cause, which was negative, and her symptoms responded rapidly to NSAID treatment alone. Her symptoms recurred 18 months later, and further imaging studies again revealed epidural calcification, but with a changed distribution. Her symptoms were relieved once more by NSAID treatment alone. Discussion: We propose that epidural calcification secondary to aseptic spondylodiscitis is the main cause of acute back pain in this patient. A possible mechanism may be the pro-inflammatory effects of calcium pyrophosphate or hydroxyapatite crystal deposition within the epidural spac

LIPIcs

Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. Nonetheless there is surprisingly little language and verification support to build distributed systems based on fault-tolerant algorithms. In this paper, we present some of the challenges that a designer has to overcome to implement a fault-tolerant distributed system. Then we review different models that have been proposed to reason about distributed algorithms and sketch how such a model can form the basis for a domain-specific programming language. Adopting a high-level programming model can simplify the programmer's life and make the code amenable to automated verification, while still compiling to efficiently executable code. We conclude by summarizing the current status of an ongoing language design and implementation project that is based on this idea

LNCS

Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an adequate domain of limits for the well-structured transition systems that are induced by depth-bounded processes. An immediate consequence of our result is that there exists a forward algorithm that decides the covering problem for this class. Unlike backward algorithms, the forward algorithm terminates even if the depth of the process is not known a priori. More importantly, our result suggests a whole spectrum of forward algorithms that enable the effective verification of a large class of mobile systems

A prospective evaluation of ultrasound as a diagnostic tool in acute microcrystalline arthritis.

The performance of ultrasound (US) in the diagnosis of acute gouty (MSU) arthritis and calcium pyrophosphate (CPP) arthritis is not yet well defined. Most studies evaluated US as the basis for diagnosing crystal arthritis in already diagnosed cases of gout and few prospective studies have been performed. One hundred nine consecutive patients who presented an acute arthritis of suspected microcrystalline arthritis were prospectively included. All underwent an US of the symptomatic joints(s) and of knees, ankles and 1(st) metatarsopalangeal (MTP) joints by a rheumatologist "blinded" to the clinical history. 92 also had standard X-rays. Crystal identification was the gold standard. Fifty-one patients had MSU, 28 CPP and 9 had both crystals by microscopic analysis. No crystals were detected in 21. One had septic arthritis. Based on US signs in the symptomatic joint, the sensitivity of US for both gout and CPP was low (60% for both). In gout, the presence of US signs in the symptomatic joint was highly predictive of the diagnosis (PPV = 92%). When US diagnosis was based on an examination of multiple joints, the sensitivity for both gout and CPP rose significantly but the specificity and the PPV decreased. In the absence of US signs in all the joints studied, CPP arthritis was unlikely (NPV = 87%) particularly in patients with no previous crisis (NPV = 94%). X-ray of the symptomatic joints was confirmed to be not useful in diagnosing gout and was equally sensitive or specific as US in CPP arthritis. Arthrocenthesis remains the key investigation for the diagnosis of microcrystalline acute arthritis. Although US can help in the diagnostic process, its diagnostic performance is only moderate. US should not be limited to the symptomatic joint. Examination of multiple joints gives a better diagnostic sensitivity but lower specificity

Static scheduling in clouds

Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We present a new job execution environment Flextic that exploits scal- able static scheduling techniques to provide the user with a flexible pricing model, such as a tradeoff between dif- ferent degrees of execution speed and execution price, and at the same time, reduce scheduling overhead for the cloud provider. We have evaluated a prototype of Flextic on Amazon EC2 and compared it against Hadoop. For various data parallel jobs from machine learning, im- age processing, and gene sequencing that we considered, Flextic has low scheduling overhead and reduces job du- ration by up to 15% compared to Hadoop, a dynamic cloud scheduler

LNCS

Fault-tolerant distributed algorithms play an important role in ensuring the reliability of many software applications. In this paper we consider distributed algorithms whose computations are organized in rounds. To verify the correctness of such algorithms, we reason about (i) properties (such as invariants) of the state, (ii) the transitions controlled by the algorithm, and (iii) the communication graph. We introduce a logic that addresses these points, and contains set comprehensions with cardinality constraints, function symbols to describe the local states of each process, and a limited form of quantifier alternation to express the verification conditions. We show its use in automating the verification of consensus algorithms. In particular, we give a semi-decision procedure for the unsatisfiability problem of the logic and identify a decidable fragment. We successfully applied our framework to verify the correctness of a variety of consensus algorithms tolerant to both benign faults (message loss, process crashes) and value faults (message corruption)

FlexPRICE: Flexible provisioning of resources in a cloud environment

Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We claim that, in order to realize the full potential of cloud computing, the user must be presented with a pricing model that offers flexibility at the requirements level, such as a choice between different degrees of execution speed and the cloud provider must be presented with a programming model that offers flexibility at the execution level, such as a choice between different scheduling policies. In such a flexible framework, with each job, the user purchases a virtual computer with the desired speed and cost characteristics, and the cloud provider can optimize the utilization of resources across a stream of jobs from different users. We designed a flexible framework to test our hypothesis, which is called FlexPRICE (Flexible Provisioning of Resources in a Cloud Environment) and works as follows. A user presents a job to the cloud. The cloud finds different schedules to execute the job and presents a set of quotes to the user in terms of price and duration for the execution. The user then chooses a particular quote and the cloud is obliged to execute the job according to the chosen quote. FlexPRICE thus hides the complexity of the actual scheduling decisions from the user, but still provides enough flexibility to meet the users actual demands. We implemented FlexPRICE in a simulator called PRICES that allows us to experiment with our framework. We observe that FlexPRICE provides a wide range of execution options-from fast and expensive to slow and cheap-- for the whole spectrum of data-intensive and computation-intensive jobs. We also observe that the set of quotes computed by FlexPRICE do not vary as the number of simultaneous jobs increases