Background The complexity of health care today requires nursing graduates to use effective thinking skills. Many nursing programs are revising curricula to include concept-based learning that encourages problem-solving, effective thinking, and the ability to transfer knowledge to a variety of situations-requiring nurse educators to modify their teaching styles and methods to promote student-cen...

In the paper [MTT] a conceptuel description of compactifications of moduli spaces of stable vector bundles on surfaces has been given, whose boundaries consist of vector bundles on trees of sufaces. In this article a typical basic case for the projective plane is described explicitly including the constrution of a relevant Kirwan blow up.

For several languages only potentially non-projective dependency parses are readily available. Projectivizing the parses and utilizing them in syntax-based translation systems often yields particularly bad translation results indicating that those translation models cannot properly utilize such information. We demonstrate that our system based on multi bottom-up tree transducers, which can nati...

This paper describes a treebanking project for Hindi/Urdu. We are annotating dependency syntax, lexical predicate-argument structure, and phrase structure syntax in a coordinated and partly automated manner. The paper focuses on choices in syntactic representation, and the stages we think are most appropriate for annotating differnt types of information.

A generative statistical model of dependency syntax is proposed based on Tesni ere's classical theory. It provides a stochastic formalization of the original model of syntactic structure and augments it with a model of the string realization process, the latter which is lacking in Tesni ere's original work. The resulting theory models crossing dependency links, discontinuous nuclei and string m...

We introduce a framework for lightweight dependency syntax annotation. Our formalism builds upon the typical representation for unlabeled dependencies, permitting a simple notation and annotation workflow. Moreover, the formalism encourages annotators to underspecify parts of the syntax if doing so would streamline the annotation process. We demonstrate the efficacy of this annotation on three ...

This paper shows how to introduce predicative adjunction in a dependency grammar inspired from TAG, MTT and RG. The addition of predicative adjunction allows us to obtain a modular surface syntactic grammar, the derivation structures of which can be interpreted as semantic representations.

In this talk, we contend that, for NLs, the divide between model-theoretic semantics and proof-theoretic semantics has not been well-understood. In particular, the formal semantics based on modern type theories (MTTs) may be seen as both model-theoretic and prooftheoretic. To be more precise, it may be seen both ways in the sense that the NL semantics can first be represented in an MTT in a mod...

Differential 2.2μm (K-band) luminosity functions are presented for a complete sample of 1570 nearby (Vgsr ≤ 3000 km/s, where Vgsr is the velocity measured with respect to the Galactic standard of rest), bright (K ≤ 10 mag), galaxies segregated by visible morphology. The K-band luminosity function for late-type spirals follows a power law that rises towards low luminosities whereas the K-band lu...

Data warehouse systems integrate data from heterogeneous sources. These sources are autonomous in nature and change independently of a data warehouse. Owing to changes in data sources, the content and the schema of a data warehouse may need to be changed for accurate decision making. Slowly changing dimensions and temporal data warehouses are the available solutions to manage changes in the con...