We observe recent results on the applications of extremal graph theory to cryptography. Classical Extremal Graph Theory contains Erdős Even Circuite Theorem and other remarkable results on the maximal size of graphs without certain cycles. Finite automaton is roughly a directed graph with labels on directed arrows. The most important advantage of Turing machine in comparison with finite automat...

RÉSUMÉ . En dépit de leurs nombreuses qualités, les patrons de conception par objets ont le défaut de généralement « disparaître » dans l’implémentation des applications, parce qu’ils sont définis sur plusieurs classes. La programmation par aspects propose des mécanismes permettant une représentation explicite d’aspects, c'est à dire d’unités modulaires transversales aux classes, qui permet de ...

We consider the non-linear VPFP system with a coulombian repulsive interaction potential and a generic confining potential in space dimension d ≥ 3. Using spectral and kinetic methods we prove the existence and uniqueness of a mild solution with bounds uniform in time in weighted spaces, and for small total charge we find an explicit exponential rate of convergence toward the equilibrium in ter...

RÉSUMÉ. Les méthodes de RIS visent à s’affranchir des problèmes classiques de synonymie et polysémie via le passage au niveau conceptuel. Elles reposent souvent sur l’utilisation d’une ressource sémantique. La qualité des résultats dépend des fonctionnalités sémantiques mises en place ainsi que de la qualité de la ressource utilisée. Malgré la profusion des propositions, l’apport d’une sémantiq...

One of the most important performance issues on NUMA systems is data locality since remote memory accesses have latencies several magnitudes higher than local memory accesses. This paper presents a tool environment targeting at tuning NUMA-based shared memory applications towards better memory locality. This tool environment comprises tools, supporting system facilities, and their interface. To...

We consider a class of transcendental meromorphic functions f : C → C with infinitely many poles. Under some regularity assumption on the location of poles and the behavior of the function near the poles, we provide explicite lower bounds for the hyperbolic dimension (Hausdorff dimension of radial points) of the Julia set and upper bounds for the Hausdorff dimension of the set of escaping point...

Given ψ ∈ L2(R) and a finite sequence {(aγ , λγ)}γ∈Γ ⊆ R+ × R consisting of distinct points, the corresponding wavelet system is the set of functions { 1 a 1/2 γ ψ( x aγ − λγ)}γ∈Γ. We prove that for a dense set of functions ψ ∈ L2(R), the wavelet system corresponding to any choice of {(aγ , λγ)}γ∈Γ is linearly independent, and we derive explicite estimates for the corresponding lower (frame) bo...

RÉSUMÉ Nous présentons une extension du procédé d’analyse sémantique explicite de Gabrilovich et Markovitch. À l’aide de leur mesure de parenté sémantique, nous pondérons le graphe des catégories de Wikipédia. Puis, nous en extrayons un arbre couvrant minimal par le biais de l’algorithme de Chu-Liu & Edmonds. Nous définissons une notion de tfidf stratifié, les strates étant, pour une page Wikip...

Electronic books are not yet heavily used because they still do not offer sufficient benefits. The Slicing Book approach is a new approach to electronic books offering personalized electronic textbooks for learners. Books are split into slices and the logical relationship between those slices is made explicite, e.g. what slice builds on knowledge provided by what other slices. This knowledge ca...

A generalized Monte Carlo simulation method is presented for tolerance analysis of mechanical assemblies with small kinematic adjustments. This is a new tool for assembly tolerance analysis based on vector-loop-based assembly models with kinematic assembly constraints. Methods have been developed for simulating both closed loop and open loop assembly constraints as well as over-determined assem...