comment étudier les textes romanesques français si nombreux depuis la formation définitive de la langue française au xviie siècle? c'est la question à laquelle les critiques ont essayé de répondre. pourtant, de la critique traditionnelle à celle moderne, le chercheur est confronté à une diversité vertigineuse qui ne cesse de croître. suite à la nouvelle critique rassemblant les jeunes critiques...

The Condorcet efficiency of a social choice procedure is usually defined as the probability that this procedure coincides with the majority winner (or majority ordering) in random samples, given a majority winner exists (or given the majority ordering is transitive). Consequently, it is in effect a conditional probability that two sample statistics coincide, given certain side conditions. We ra...

Is it possible to distinguish algebraic from transcendental real numbers by considering the b-ary expansion in some base b 2? In 1950, É. Borel suggested that the answer is no and that for any real irrational algebraic number x and for any base g 2, the g-ary expansion of x should satisfy some of the laws that are shared by almost all numbers. For instance, the frequency where a given finite se...

This paper describes a new empirical watershed model, the prime feature of which is its parsimony. It involves only three free parameters, a characteristic unparalleled by continuous process models able to work on a wide array of catchments. In spite of its crude simplicity, it achieved, on average, worthwhile results on a set of 140 French catchments and overwhelmingly outperformed a linear mo...

We study the Borel summation method. We obtain a general sufficient condition for a given matrix A to have the Borel property. We deduce as corollaries, earlier results obtained by G. Müller and J.D. Hill. Our result is expressed in terms belonging to the theory of Gaussian processes. We show that this result cannot be extended to the study of the Borel summation method on arbitrary dynamical s...

Linear programming is a very important class of problems, both algorithmically and combinatorially. Linear programming has many applications. From an algorithmic point-of-view, the simplex was proposed in the forties (soon after the war, and was motivated by military applications) and, although it has performed very well in practice, is known to run in exponential time in the worst-case. On the...

Shannon’s noiseless coding theorem tells us how compactly we can compress messages in which all letters are drawn independently from an alphabet A and we are given the probability pa of each letter a ∈ A appearing in the message. Shannon’s theorem says that, for random messages with n letters, the expected number of bits we need to transmit is at least nH(p) = −n ∑ a∈A pa log2 pa bits, and ther...

The purpose of this study was to examine the role technological intensity in the choice of compensation policies, and the influence of such policies on market performance and turnover in high and low technological intensity firms. Using a survey of 252 Canadian firms, we show technology intensity has significant influence on compensation policies. A second survey of 128 Canadian organizations s...

If G is undirected, then we say that it has a nowhere-zero Γ flow if the graph admits a nowhere-zero Γ flow after giving an orientation to all the edges. As we saw, if one orientation works then any does, since inverses exist in abelian groups. Definition 2 Let G be an undirected graph. For integer k ≥ 2, a nowhere-zero k-flow φ is an assignment φ : E → {1, . . . , k−1} such that for some orien...