394 research outputs found
Clinical efficacy of amoxycillin/clavulanate in laparoscopically confirmed salpingitis
To test the efficacy and safety of amoxycillin/clavulanate (Augmenting 102 hospital patients with laparoscopically confirmed acute salpingitis were treated with paren-teral amoxycillin/clavulanate (l.2g qid for three days) followed by oral amoxycillin/ clavulanate (two tablets of 625 mg tid for a further six days). Bacteriological samples were obtained from the cervix uteri and the pouch of Douglas. One hundred patients were assessable for clinical outcome using several variables including pain scores. Amoxycillin/clavulanate alone was effective in 95 patients (95%). Three patients (3%) responded to amoxycillin/clavulanate with marked improvement but another antibiotic was subsequently added to their treatment regimen. Treatment failed in two patients. At follow-up two weeks after hospital discharge, three patients (3.8%) had relapsed or were re-infected. Adverse drug events included one case of drug fever, one case of rash and one case of severe diarrhoea. Treatment was stopped in all three cases. Gastrointestinal reactions, mainly mild diarrhoea, were seen in 31 patients. No clinically relevant changes in haematological or clinical chemical indices were attributable to the amoxycillin/clavulanate treatment. We conclude that amoxycillin/clavulanate is a clinically effective and safe treatment for acute salpingiti
Components, contracts, and connectors for the Unified Modelling Language UML
The lack of a component concept for the UML is widely ac-\ud
knowledged. Contracts between components can be the starting point for introducing components and component interconnections. Contracts between service providers and service users are formulated based on abstractions of action and operation behaviour using the pre- and postcon-\ud
dition technique. A valid contract allows to establish an interconnection- a connector - between the provider and the user. The contract concept supports the re-use of components by providing means to establish and modify component interconnections. A flexible contract concept shall be based on a renement relation for operations and classes, derived from operation abstractions. Abstract behaviour, expressed by pre- and post-conditions, and renement are the key elements in the denition of a formal and flexible component and component interconnection approach
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets
of real numbers encoded in positional notation. We consider Muller automata as
well as the restricted class of weak deterministic automata, used as symbolic
set representations in actual applications. In previous work, it has been
established that the sets of numbers that are recognizable by weak
deterministic automata in two bases that do not share the same set of prime
factors are exactly those that are definable in the first order additive theory
of real and integer numbers. This result extends Cobham's theorem, which
characterizes the sets of integer numbers that are recognizable by finite
automata in multiple bases.
In this article, we first generalize this result to multiplicatively
independent bases, which brings it closer to the original statement of Cobham's
theorem. Then, we study the sets of reals recognizable by Muller automata in
two bases. We show with a counterexample that, in this setting, Cobham's
theorem does not generalize to multiplicatively independent bases. Finally, we
prove that the sets of reals that are recognizable by Muller automata in two
bases that do not share the same set of prime factors are exactly those
definable in the first order additive theory of real and integer numbers. These
sets are thus also recognizable by weak deterministic automata. This result
leads to a precise characterization of the sets of real numbers that are
recognizable in multiple bases, and provides a theoretical justification to the
use of weak automata as symbolic representations of sets.Comment: 17 page
Ecological strategies in stable and disturbed environments depend on species specialisation
Ecological strategies are integral to understanding species survival in different environments. However, how habitat specialisation is involved in such strategies is not fully understood, particularly in heterogeneous and disturbed environments. Here, we studied the trait associations between specialisation, dispersal ability, competitiveness, reproductive investment and survival rate in a spatially explicit metacommunity model under various disturbance rates. Though no unique trait values were associated with specialisation, relationships were uncovered depending on environmental factors. We found strong trait associations mainly for generalist species, while specialist species exhibited a larger range of trait combinations. Trait associations were driven first by the disturbance rate and second by species’ dispersal ability and generation overlap. With disturbance, low dispersal ability was strongly selected against, for specialists as well as for generalists. Our results demonstrate that habitat specialisation is critical for the emergence of trait strategies in metacommunities and that disturbance in interaction with dispersal ability limits not only the range of trait values but also the type of possible trait associations
Imitation in Large Games
In games with a large number of players where players may have overlapping
objectives, the analysis of stable outcomes typically depends on player types.
A special case is when a large part of the player population consists of
imitation types: that of players who imitate choice of other (optimizing)
types. Game theorists typically study the evolution of such games in dynamical
systems with imitation rules. In the setting of games of infinite duration on
finite graphs with preference orderings on outcomes for player types, we
explore the possibility of imitation as a viable strategy. In our setup, the
optimising players play bounded memory strategies and the imitators play
according to specifications given by automata. We present algorithmic results
on the eventual survival of types
On Second-Order Monadic Monoidal and Groupoidal Quantifiers
We study logics defined in terms of second-order monadic monoidal and
groupoidal quantifiers. These are generalized quantifiers defined by monoid and
groupoid word-problems, equivalently, by regular and context-free languages. We
give a computational classification of the expressive power of these logics
over strings with varying built-in predicates. In particular, we show that
ATIME(n) can be logically characterized in terms of second-order monadic
monoidal quantifiers
- …