Refine
Year of publication
- 2010 (50) (remove)
Document Type
- Conference Proceeding (50) (remove)
Has Fulltext
- yes (50)
Is part of the Bibliography
- no (50)
Keywords
- Deklination (2)
- Healthcare worker (2)
- Morphosyntax (2)
- Pronomen (2)
- Vaccine uptake rate (2)
- Ableitung <Linguistik> (1)
- Adjektiv (1)
- Aikido (1)
- Akupressur (1)
- Akupunktur (1)
Institute
- Physik (13)
- Medizin (6)
- Extern (3)
- Zentrum für Weiterbildung (2)
- Erziehungswissenschaften (1)
- Frankfurt Institute for Advanced Studies (FIAS) (1)
- Geschichtswissenschaften (1)
- Informatik (1)
- Internationales Studienzentrum (1)
- Sportwissenschaften (1)
ecently, pertussis has become a problem also in the adult population, with incidences even higher than in children. Pediatric health care workers (HCWs) are an important source of transmission, exposing very young and immunocompromised patients to an increased risk of potentially severe pertussis infections. Encouraging HCWs to get vaccinated can play a vital role in stopping the transmission of pertussis, thereby reducing institutional outbreaks.
In Germany, HCWs come up with all sorts of reasons for not getting pertussis vaccination. This study was meant to provide information in order to better understand the backgrounds of these attitudes.
A survey was conducted at the children's university hospital in Frankfurt, using an anonymous questionnaire. Survey results were used to design an intervention to increase the immunization rate of staff. Disappointingly, our efforts to increase the acceptance of the immunization program by providing information in advance were not yet satisfying.
Misconception about pertussis vaccination was prevalent especially among nursing staff. The main reasons for non-compliance included: unawareness of an own risk of infection, the belief that pertussis is not a serious illness, fear of side effects, the belief that the pertussis vaccine might trigger the pertussis disease itself, and skepticism about the efficacy of the pertussis vaccination.
With respect to nosocomial influenza infections, the welfare of patients is best served by high rates of staff immunity against influenza. However, data from the Centers of Disease Control (CDC) in the USA and the Robert Koch-Institute (RKI) in Germany indicate that most of health care workers (HCWs) choose not to be vaccinated. Under voluntary influenza immunization standards, institutional influenza outbreaks occur every flu season. The question about the legality of implementation mandatory flu vaccination for HCWs is an ongoing debate, which covers several different positions.
To characterize the attitudes of German HCWs toward mandatory influenza immunization, an anonymous questionnaire was offered to HCWs of the University Hospital in Frankfurt/Main / Germany. Our study showed that almost 70% of the respondents would accept mandatory influenza vaccination.
In our opinion an annual influenza vaccination should be required for HCWs who care for immunocompromised patients and residents in long-term care if there will be a failure of voluntary vaccination programs. An informed declination should be obtained from employees who decline vaccination and these HCWs ought to work in uncritical areas of patient care.
We compute the static-light baryon spectrum with Nf = 2 flavors of sea quarks using Wilson twisted mass lattice QCD. As light valence quarks we consider quarks, which have the same mass as the sea quarks with corresponding pion masses in the range 340MeV<∼ mPS<∼ 525MeV, as well as partially quenched quarks, which have the mass of the physical s quark. We extract masses of states with isospin I = 0,1/2,1, with strangeness S = 0,−1,−2, with angular momentum of the light degrees of freedom j = 0,1 and with parity P = +,−. We present a preliminary extrapolation in the light u/d and an interpolation in the heavy b quark mass to the physical point and compare with available experimental results.
The isospin, spin and parity dependent potential of a pair of static-light mesons is computed using Wilson twisted mass lattice QCD with two flavors of degenerate dynamical quarks. From the results a simple rule can be deduced stating, which isospin, spin and parity combinations correspond to attractive and which to repulsive forces.
In this paper, I discuss verb to noun conversion in French. The properties of the input verb and the output noun are presented and a formal representation is proposed using the SBCG framework. The use of such a formalism based on constraints and multiple inheritance highlights the difficulties in defining what exactly is a conversion rule. I propose that the different properties of the input verb and the output noun can be thought of as different dimensions of classification, which characterize the verb to noun conversion rule.
The KADoNiS (Karlsruhe Astrophysical Database of Nucleosynthesis in Stars) project is an online
database (www.kadonis.org) for cross sections relevant to the s-process and the p-process.
The first version was an updated sequel to the previous Bao et al. [1] compilations from 1987
and 2000 for (n; g) cross sections relevant to Big Bang and s-process nucleosynthesis. The first
update, KADoNiS v0.2, was published in 2006 [2]. It contained mainly Maxwellian averaged
(n; g) cross sections relevant to the s-process, and some experimental charged particle induced
reaction relevant to the p-process. After that a second update was presented in 2009 [3].
Recently, we started to collect and review all existing experimental data relevant for p-process
nucleosynthesis and to provide a user-friendly database based on the KADoNiS framework. The
p-process part of the KADoNiS database is currently being extended and will include all available
experimental data from (p; g), (p;n), (p;a), (a,g), (a;n) and (a; p) reactions in or close to the
respective Gamow window.
Based on the notion of a lexicon with default inheritance, I address the problem of how to provide a template for lexical representations that allows us to capture the relatedness between inflected word forms and canonically derived lexemes within a broadly realizational-inferential model of morphology. To achieve this we need to be able to represent a whole host of intermediate types of lexical relatedness that are much less frequently discussed in the literature. These include transpositions such as deverbal participles, in which a word's morphosyntactic class changes (e.g. verb ⇒ adjective) but no semantic predicate is added to the semantic representation and the derived word remains, in an important sense, a "form" of the base lexeme (e.g. the 'present participle form of the verb'). I propose a model in which morphological properties are inherited by default from syntactic properties and syntactic properties are inherited from semantic properties, such as ontological category (the Default Cascade). Relatedness is defined in terms of a Generalized Paradigm Function (perhaps in reality a relation), a generalization of the Paradigm Function of Paradigm Function Morphology (Stump 2001). The GPF has four components which deliver respectively specifications of a morphological form, syntactic properties, semantic representation and a lexemic index (LI) unique to each individuated lexeme in the lexicon. In principle, therefore, the same function delivers derived lexemes as inflected forms. In order to ensure that a newly derived lexeme of a distinct word class can be inflected I assume two additional principles. First, I assume an Inflectional Specifiability Principle, which states that the form component of the GPF (which defines inflected word forms of a lexeme) is dependent on the specification of the lexeme's morpholexical signature, a declaration of the properties that the lexeme is obliged to inflect for (defined by default on the basis of morpholexical class). I then propose a Category Erasure Principle, which states that 'lower' attributes are erased when the GPF introduces a non-trivial change to a 'higher' attribute (e.g. a change to the semantic representation entails erasure of syntactic and morphological information). The required information is then provided by the Default Cascade, unless overridden by specific declarations in the GPF. I show how this model can account for a variety of intermediate types of relatedness which cannot easily be treated as either inflection or derivation, and conclude with a detailed illustration of how the system applies to a particularly interesting type of transposition in the Samoyedic language Sel'kup, in which a noun is transposed to a similitudinal adjective whose form is in paradigmatic opposition to case-marked noun forms, and which is therefore a kind of inflection.
This paper primarily presents an analysis of nominal inflection in Hindi within the framework of Distributed Morphology (Halle & Marantz 1993, 1994 and Harley and Noyer 1999). Müller (2002, 2003, 2004) for German, Icelandic and Russian nouns respectively and Weisser (2006) for Croatian nouns have also used Distributed Morphology (henceforth DM) to analyze nominal inflectional morphology. This paper will discuss in detail the inflectional categories and inflectional classes, the morphological processes operating at syntax, the distribution of vocabulary items and the readjustment rules required to describe Hindi nominal inflection. Earlier studies on Hindi inflectional morphology (Guru 1920, Vajpeyi 1958, Upreti 1964, etc.) were greatly influenced by the Paninian tradition (classical Sanskrit model) and work with Paninian constructs such as root and stem. They only provide descriptive studies of Hindi nouns and verbs and their inflections without discussing the role or status of affixes that take part in inflection. The discussion on the mechanisms (morphological operations and rules) used to analyze or generate word forms are missing in these studies. In addition, these studies do not account for syntax-morphology or morphology-phonology mismatches that show up in word formation. One aim of this paper is to present an economical way of forming noun classes in Hindi as compared to other traditional methods, especially gender and stem ending based or paradigm based methods that give rise to a large number of inflectional paradigms. Using inflectional class information to analyse the various forms of Hindi nouns, we can reduce the number of affixes and word-generation and readjustment rules that are required to describe nominal inflection. The analysis also helps us in developing a morphological analyzer for Hindi. The small set of rules and fewer inflectional classes are of great help to lexicographers and system developers. To the best of our knowledge, the analysis of Hindi inflectional morphology based on DM and its implementation in a Hindi morphological analyzer has not been done before. The methods discussed here can be applied to other Indian languages for analysis as well as word generation.
CMOS sensors are the most promising candidates for the Micro-Vertex-Detector (MVD) of the CBM experiment at GSI, as they provide an unprecedented compromise between spatial resolution, low material budget, adequate radiation tolerance and readout speed. To study the integration of these sensors into a detector module, a so-called MVD-demonstrator has been developed. The demonstrator and its in-beam performance will be presented and discussed in this work.
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-need lambda calculus with letrec. Bisimilarity simplifies equivalence proofs in the calculus and opens a way for more convenient correctness proofs for program transformations. Although this property may be a natural one to expect, to the best of our knowledge, this paper is the first one providing a proof. The proof technique is to transfer the contextual approximation into Abramsky’s lazy lambda calculus by a fully abstract and surjective translation. This also shows that the natural embedding of Abramsky’s lazy lambda calculus into the call-by-need lambda calculus with letrec is an isomorphism between the respective term-models. We show that the equivalence property proven in this paper transfers to a call-by-need letrec calculus developed by Ariola and Felleisen. 1998 ACM Subject Classification: F.4.2, F.3.2, F.3.3, F.4.1. Key words and phrases: semantics, contextual equivalence, bisimulation, lambda calculus, call-by-need, letrec.