462 resultados para Notation <Klassifikation>
Resumo:
Background. There are two child-specific fracture classification systems for long bone fractures: the AO classification of pediatric long-bone fractures (PCCF) and the LiLa classification of pediatric fractures of long bones (LiLa classification). Both are still not widely established in comparison to the adult AO classification for long bone fractures. Methods. During a period of 12 months all long bone fractures in children were documented and classified according to the LiLa classification by experts and non-experts. Intraobserver and interobserver reliability were calculated according to Cohen (kappa). Results. A total of 408 fractures were classified. The intraobserver reliability for location in the skeletal and bone segment showed an almost perfect agreement (K=0.91-0.95) and also the morphology (joint/shaft fracture) (K=0.87-0.93). Due to different judgment of the fracture displacement in the second classification round, the intraobserver reliability of the whole classification revealed moderate agreement (K=0.53-0.58). Interobserver reliability showed moderate agreement (K=0.55) often due to the low quality of the X-rays. Further differences occurred due to difficulties in assigning the precise transition from metaphysis to diaphysis. Conclusions. The LiLa classification is suitable and in most cases user-friendly for classifying long bone fractures in children. Reliability is higher than in established fracture specific classifications and comparable to the AO classification of pediatric long bone fractures. Some mistakes were due to a low quality of the X-rays and some due to difficulties to classify the fractures themselves. Improvements include a more precise definition of the metaphysis and the kind of displacement. Overall the LiLa classification should still be considered as an alternative for classifying pediatric long bone fractures.
Resumo:
Der Vortrag geht der Frage nach, unter welchen Umständen es möglich und sinnvoll ist, von der Existenz eines Religionsdiskurses auszugehen und seine historischen Entwicklungen zu erfassen. Ich möchte dabei an einem historischen Beispiel zeigen, wie die Aushandlungen um die Klassifikation konkreter Gegenstande als "Religion" einerseits in ihren singulären Äusserungen von empirisch erfassbaren historischen, politischen, ökonomischen und anderen Faktoren abhängig sind. Andererseits besteht aber gleichzeitig eine Wechselbeziehungen dieser Aushandlungen mit der diskursiven Konstitution von Religionsverständnissen, Religionsdefinitionen und etablierten Zuordnungen, die als Tiefenstrukturen eines "Religionsdiskurses" im Hintergrund immer mitgedacht werden müssen. Ich werde von da aus argumentieren, dass ein Verständnis und eine Analyse diskursiver Prozesse im Kleinen nicht möglich wären, ohne die konstitutiven Wirkungen grösserer diskursiver Einheiten mit einzubeziehen.
Resumo:
Isidor Groß
Resumo:
Alexander Marx
Resumo:
Anonym
Resumo:
Von J. C. Arthur
Resumo:
Nondeterminism and partially instantiated data structures give logic programming expressive power beyond that of functional programming. However, functional programming often provides convenient syntactic features, such as having a designated implicit output argument, which allow function cali nesting and sometimes results in more compact code. Functional programming also sometimes allows a more direct encoding of lazy evaluation, with its ability to deal with infinite data structures. We present a syntactic functional extensión, used in the Ciao system, which can be implemented in ISO-standard Prolog systems and covers function application, predefined evaluable functors, functional definitions, quoting, and lazy evaluation. The extensión is also composable with higher-order features and can be combined with other extensions to ISO-Prolog such as constraints. We also highlight the features of the Ciao system which help implementation and present some data on the overhead of using lazy evaluation with respect to eager evaluation.
Resumo:
Certain aspects of functional programming provide syntactic convenience, such as having a designated implicit output argument, which allows function cali nesting and sometimes results in more compact code. Functional programming also sometimes allows a more direct encoding of lazy evaluation, with its ability to deal with infinite data structures. We present a syntactic functional extensión of Prolog covering function application, predefined evaluable functors, functional definitions, quoting, and lazy evaluation. The extensión is also composable with higher-order features. We also highlight the Ciao features which help implementation and present some data on the overhead of using lazy evaluation with respect to eager evaluation.