Une généralisation du lemme de Hensel

Une généralisation automorphe des nombres de Stirling

Let [n] be theset {1,2, *.. , n> and CT a given permutation in S,, the symmetric group on [n]. The (unsigned) Stirling numbers of the first kind enumerate the permutations on En] with k cycles and those of the second kind give the number partitions of [n] having k blocks. In this paper we compute the number of permutations on [n] with k cycles and the number of partitions on [n] having k blocks...

Sur une souche de Pasteurella agent d'abcès enzootiques du lapin

Une généralisation de la notion d'automate et applications

Une generalisation du theoreme de Kobayashi-Ochiai

Hiérarchies de généralisation dans les bases de données relationnelles : une approche hybride de rétro-conception

This paper proposes to combine a heuristic technique and an algorithmic one to provide a method to reverse engineer the generalization/specialization links hidden in a relational database. The heuristic phase combines the exploration of three sources: DDL specifications, DML specifications and data to provide information, such as inclusion links and existence constraints. This information is th...