This paper presents the evaluation of automatic break insertion for standard Basque. Basque is an agglutinative and inflected language and POS features, widely used for other languages, are not enough to accurately predict the insertion of breaks in the text. Other morpho-syntactic features, like grammatical case and information about syntagms have also been taken into account. With a textual c...

At present, the Small Area Income and Poverty Estimates (SAIPE) program at the U.S. Census Bureau estimates state, county, and school district poverty and state and county median household income (MHI). The current county models of child poverty are Empirical Bayes models where the direct survey estimates of poverty and MHI are shrunk with weightedregression model-based estimates of poverty and...

We present a model construction method based on a local fitting of polynomial functions to noisy data and building the entire model as a union of regions explained by such polynomial functions. Local fitting is shown to reduce to solving a polynomial eigenvalue problem where the matrix coefficients are data covariance and approximated noise covariance matrices that capture distortion effects by...

Many medication errors could be avoided if administration was more closely linked with structured monitoring. The contributory factors to administration errors occurred in one recent year were reviewed and identified contributory factors to errors as six domains of administration principles according to the report from the Quality and Safety website. The current measures including guidelines, p...

Lambda-lifting is a program transformation used in compilers and in partial evaluators and that operates in cubic time. In this article, we show how to reduce this complexity to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting transforms a block-structured program into a set of recursive equations, one for each local function in the...

The paper consists of two parts. The rst one is a concise introduction to epistemic (both propositional and predicate) logic with common knowl-ege operator. As the full common knowledge predicate logics are not even recursively enumerable, in the second part we introduce and investigate the monodic fragment of these logics which allows applications of the epistemic operators to formulas with at...

Let z = (z1, z2, · · · , zn) be noncommutative free variables and t a formal parameter which commutes with z. Let k be a unital commutative ring of any characteristic and Ft(z) = z−Ht(z) with Ht(z) ∈ k[[t]]〈〈z〉〉 ×n and o(Ht(z)) ≥ 2. Note that Ft(z) can be viewed as a deformation of the formal map F (z) := z−Ht=1(z) when it makes sense. The inverse map Gt(z) of Ft(z) can always be written as Gt(...

In this paper we prove decidability of two kinds of branching time temporal logics. First we show that the non-local version of propositional , in which truth values of atoms may depend on the branch of evaluation, is decidable. Then we use this result to establish decidability of various fragments of quantified , where the next-time operator can be applied only to formulas with at most one fre...

Affine λ-terms are λ-terms in which each bound variable occurs at most once and linear λ-terms are λ-terms in which each bound variable occurs once. and only once. In this paper we count the number of closed affine λ-terms of size n, closed linear λ-terms of size n, affine β-normal forms of size n and linear β-normal forms of size n, for different ways of measuring the size of λ-terms. From the...

We consider reductions in Orthogonal Expression Reduction Systems (OERS), that is, Orthogonal Term Rewriting Systems with bound variables and substitutions, as in the-calculus. We design a strategy that for any given term t constructs a longest reduction starting from t if t is strongly normalizable, and constructs an innnite reduction otherwise. The Conservation Theorem for OERSs follows easil...