Let U be a Haar distributed matrix in U(n) or O(n). In a previous paper, we proved that after centering, the two-parameter process T (s, t) = ∑ i≤⌊ns⌋,j≤⌊nt⌋ |Uij | 2 converges in distribution to the bivariate tied-down Brownian bridge. In the present paper, we replace the deterministic truncation of U by a random one, where each row (resp. column) is chosen with probability s (resp. t) indepen...

The standard preference ordering on the well-known centering transitions Continue, Retain, Shift is argued to be unmotivated: a partial, context-dependent ordering emerges from the interaction between principles dubbed cohesion (maintaining the same center of attention) and salience (realizing the center of attention as the most prominent NP). A new formulation of Rule 2 of centering theory is ...

Recently, Roos proposed a full-Newton step infeasible interiorpoint method (IIPM) for solving linear optimization (LO) problems. Later on, more variants of this algorithm were published. However, each main step of these methods is composed of one feasibility step and several centering steps. The purpose of this paper is to prove that by using a new search direction it is enough to take only one...

In this article we discuss several metrics of coherence defined using centering theory and investigate the usefulness of such metrics for information ordering in automatic text generation. We estimate empirically which is the most promising metric and how useful this metric is using a general methodology applied on several corpora. Our main result is that the simplest metric (which relies exclu...

This paper deals with the retrieval of document images especially applied to the digitized old books. In these old books our system allows the retrieval of graphical parts and especially the drop caps. The aim of our system is to process large image databases. For that purpose, we have developed a fast approach based on a Run Length Encoding (RLE) of images. We use this last one in a image comp...