—Gaussian Mixture Models (GMMs) are the most popular techniques in background modeling but present some limitations when some dynamic changes occur like camera jitter, illumination changes, movement in the background. Furthermore, the GMM are initialized using a training sequence which may be noisy and/or insufficient to model correctly the background. All these critical situations generate fal...

We construct a strongly minimal (and thus uncountably categorical) but not totally categorical theory in a nite language of binary predicates whose only constructive (or recursive) model is the prime model. 0. Introduction. E ective (or recursive) model theory studies to which degree constructions in model theory and algebra can be made e ective. A presentation of a countable model M is an isom...

By RCA0, we denote the system of second order arithmetic based on recursive comprehension axioms and Σ1 induction. WKL0 is defined to be RCA0 plus weak König’s lemma: every infinite tree of sequences of 0’s and 1’s has an infinite path. In this paper, we first show that for any countable model M of RCA0, there exists a countable model M ′ of WKL0 whose first order part is the same as that of M ...

We present low-rank methods for event detection. We assume that normal observation come from a low-rank subspace, prior to being corrupted by a uniformly distributed noise. Correspondingly, we aim at recovering a representation of the subspace, and perform event detection by running point-to-subspace distance query in `∞, for each incoming observation. In particular, we use a variant of matrix ...

Let T be a complete first order theory in a language L satisfying uniform finiteness and let TP be the model companion of T in an expanded language LP with a new unary predicate P . We show that: TP satisfies uniform finiteness; if T is an expansion of the theory of dense linear order then every cut definable in a model M of TP is definable in M L; and, if T is an expansion of the theory dense ...

This predicate1 has played a central role in the debate on the special composition question and on related metaphysical issues concerning the mereological structure of objects. In this note we show that the characterization in (1) is nonetheless inadequate. We do so by constructing a mereological model M where everything qualifies as composed of atoms even though some elements in the domain are...