The use and effectiveness of the eLib subject gateways: a preliminary investigation

Internet subject gateways were set up under the Electronic Libraries Programme (eLib) in order to address some of the problems of searching the Internet which have been identified by information professionals, i.e. locating relevant, good quality information. This preliminary study examines the extent to which academics in two universities use three eLib subject gateways (EEVL, OMNI and SOSIG). The results are generally encouraging for the eLib programme, but it is necessary for the gateways to be more effectively promoted. The study also found that academics do not have the same misgivings about the general search engines as the information professionals and seem to use them more readily than the gateways

Atom-molecule coherence in a one-dimensional system

We study a model of one-dimensional fermionic atoms that can bind in pairs to form bosonic molecules. We show that at low energy, a coherence develops between the molecule and fermion Luttinger liquids. At the same time, a gap opens in the spin excitation spectrum. The coherence implies that the order parameters for the molecular Bose-Einstein Condensation and the atomic BCS pairing become identical. Moreover, both bosonic and fermionic charge density wave correlations decay exponentially, in contrast with a usual Luttinger liquid. We exhibit a Luther-Emery point where the systems can be described in terms of noninteracting pseudofermions. At this point, we provide closed form expressions for the density-density response functions.Comment: 5 pages, no figures, Revtex 4; (v2) added a reference to cond-mat/0505681 where related results are reported; (v3) Expression of correlation functions given in terms of generalized hypergeometric function

Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems

The tree automaton completion is an algorithm used for proving safety properties of systems that can be modeled by a term rewriting system. This representation and verification technique works well for proving properties of infinite systems like cryptographic protocols or more recently on Java Bytecode programs. This algorithm computes a tree automaton which represents a (regular) over approximation of the set of reachable terms by rewriting initial terms. This approach is limited by the lack of information about rewriting relation between terms. Actually, terms in relation by rewriting are in the same equivalence class: there are recognized by the same state in the tree automaton. Our objective is to produce an automaton embedding an abstraction of the rewriting relation sufficient to prove temporal properties of the term rewriting system. We propose to extend the algorithm to produce an automaton having more equivalence classes to distinguish a term or a subterm from its successors w.r.t. rewriting. While ground transitions are used to recognize equivalence classes of terms, epsilon-transitions represent the rewriting relation between terms. From the completed automaton, it is possible to automatically build a Kripke structure abstracting the rewriting sequence. States of the Kripke structure are states of the tree automaton and the transition relation is given by the set of epsilon-transitions. States of the Kripke structure are labelled by the set of terms recognized using ground transitions. On this Kripke structure, we define the Regular Linear Temporal Logic (R-LTL) for expressing properties. Such properties can then be checked using standard model checking algorithms. The only difference between LTL and R-LTL is that predicates are replaced by regular sets of acceptable terms

What is the impact of giant cell arteritis on patients' lives?: a UK qualitative study

Objectives: Clinical management of giant cell arteritis (GCA) involves balancing the risks and burdens arising from the disease with those arising from treatment, but there is little research on the nature of those burdens. We aimed to explore the impact of giant cell arteritis (GCA) and its treatment on patients’ lives. Methods: UK patients with GCA participated in semi-structured telephone interviews. Inductive thematic analysis was employed. Results: 24 participants were recruited (age: 65–92 years, time since diagnosis: 2 months to >6 years). The overarching themes from analysis were: ongoing symptoms of the disease and its treatment; and ‘life-changing’ impacts. The overall impact of GCA on patients’ lives arose from a changing combination of symptoms, side effects, adaptations to everyday life and impacts on sense of normality. Important factors contributing to loss of normality were glucocorticoid-related treatment burdens and fear about possible future loss of vision. Conclusions: The impact of GCA in patients’ everyday lives can be substantial, multifaceted and ongoing despite apparent control of disease activity. The findings of this study will help doctors better understand patient priorities, legitimise patients’ experiences of GCA and work with patients to set realistic treatment goals and plan adaptations to their everyday lives

Object-oriented Programming Laws for Annotated Java Programs

Object-oriented programming laws have been proposed in the context of languages that are not combined with a behavioral interface specification language (BISL). The strong dependence between source-code and interface specifications may cause a number of difficulties when transforming programs. In this paper we introduce a set of programming laws for object-oriented languages like Java combined with the Java Modeling Language (JML). The set of laws deals with object-oriented features taking into account their specifications. Some laws deal only with features of the specification language. These laws constitute a set of small transformations for the development of more elaborate ones like refactorings