It was conjectured that the smallest minimal point sets of PG(2s, q), q a square, that meet every s-subspace and that generate the whole space are Baer subgeometries PG(2s, √ q). This was shown in 1971 by Bruen for s = 1, and by Metsch and Storme [5] for s = 2. Our main interest in this paper is to prepare a possible proof of this conjecture by proving a strong theorem on line-blocking sets in ...

A unit two variable per inequality (UTVPI) constraint is of the form a.x+b.y ≤ d where x and y are integer variables, the coefficients a, b ∈ {−1, 0, 1} and the bound d is an integer constant. This paper presents an efficient decision procedure for UTVPI constraints. Given m such constraints over n variables, the procedure checks the satisfiability of the constraints in O(n.m) time and O(n+m) s...

we find an explicit expression of the tutte polynomial of an $n$-fan. we also find a formula of the tutte polynomial of an $n$-wheel in terms of the tutte polynomial of $n$-fans. finally, we give an alternative expression of the tutte polynomial of an $n$-wheel and then prove the explicit formula for the tutte polynomial of an $n$-wheel.

A prime number sieve is an algorithm that nds the primes up to a bound n. We present four new prime number sieves. Each of these sieves gives new space complexity bounds for certain ranges of running times. In particular, we give a linear time sieve that uses only O(p n=(log log n) 2) bits of space, an O l (n= log log n) time sieve that uses O(n=((log n) l log log n)) bits of space, where l > 1...

We prove the following finite generator theorem. Let G be a countable group acting ergodically on a standard probability space. Suppose this action admits a generating partition having finite Shannon entropy. Then the action admits a finite generating partition. We also discuss relationships between generating partitions and f-invariant and sofic entropies.

information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. the document processor, matching function and query analyzer are the main components of an information retrieval system. document retrieval system is fundamentally based on: boolean, vector-space, probabilistic, and language models. in this paper, a new methodology for mat...

A system for transferring vocal expressions separately from singing voices with accompaniment to singing voice synthesizers is described. The expressions appear as fluctuations in the fundamental frequency contour of the singing voice, such as vibrato, glissando, and kobushi. The fundamental frequency contour of the singing voice is estimated using the subharmonic summation in a limited frequen...

In this paper we present two different approaches to the modeling of the singing voice. Each of these approaches has been thought to fit in the specific requirements of two applications. These are an automatic voice impersonator for karaoke systems and a singing voice synthesizer.