BACKGROUND To analyze the incidence and clinical-microbiological characteristics of osteomyelitis (OM) in a tertiary Spanish hospital. METHODS All cases diagnosed with OM between January 2007 and December 2010 were retrospectively reviewed. The variables examined include epidemiological characteristics, risk factors, affected bone, radiographic changes, histology, microbiological culture resu...

Electronic markets and especially online auctions gain more and more importance and a plethora of market mechanisms is emerging on the Internet. The great variety of trading rules hinders agents easily switching between different marketplaces and, therefore, fragments the overall market – supply and demand might fail to meet due to agents’ inability to interact with the same market mechanism. T...

We continue with the task of obtaining a unifying view of process semantics by considering in this case the logical characterization of the semantics. We start by considering the classic linear timebranching time spectrum developed by R.J. van Glabbeek. He provided a logical characterization of most of the semantics in his spectrum but, without following a unique pattern. In this paper, we pres...

This paper studies the descriptional complexity of multi-parallel grammars with respect to the number of nonterminals and selectors, and the length of these selectors. As a result, it proves that every recursively enumerable language is generated by a multi-parallel grammar with no more than seven nonterminals and four selectors of length five.

Protection of privacy in databases has become of increasing importance. While a number of techniques have been proposed to query databases while preserving privacy of individual records in the database, very little is done to define a measure on how much privacy is lost after statistical releases. We suggest a definition based on information theory. Intuitively, the privacy loss is proportional...

Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of ω-regular languages, i.e., a set of infinite words is weakly recognizable by such a morphism if and only if it is accepted by some Büchi automaton. We consider the descriptional complexity of various constructions for weakly recognizing morphisms. This includes the conversion f...