The tenacity of an incomplete connected graph G is defined as T (G) = min{ |S|+m(G−S) ω(G−S) : S ⊂ V (G), ω(G− S) > 1}, where ω(G− S) and m(G− S), respectively, denote the number of components and the order of a largest component inG−S. This is a reasonable parameter to measure the vulnerability of networks, as it takes into account both the amount of work done to damage the network and how bad...

Topoi are known to be categories with extra properties that make them much alike the category of Sets. In a Topoi it is possible to define adequate notions of membership, elements and subobjects, power ”sets”, and finally, every Topoi has an internal logic able to justify any reasoning carried inside it. Most of the cases, this logic is not Classical (Boolean). The general logic for the Topoi i...

Article history: Available online 25 March 2011 Submitted by J.J. Loiseau AMS classification: 15A80 15A39 15A03

This paper aims to combine film-editing principles with basic design principles to explore what graphic designers do in terms of storytelling. The sequential aspect of film is designed and examined through the art of editing. Examining the rules, principles and formulas of film editing can be a used as a method by graphic designers to further practice the art of storytelling. There are many pub...

In cancer survival studies, death certificate information can be missing, or incidental and fatal occurrences may be indistinguishable for some subjects, leading to missing censoring indicators (MCIs). For the framework of right censored data with MCIs, sub-density function kernel estimators play a significant role for estimating a survival function. Data-driven bandwidths for computing these k...

Rfesuml Si une base de donnfees est astreinte ä satisfaire des contraintes d'intfegritfe, cette proprifetfe doit fetre vferififee ä chaque modification de faits ou de rfegles de dfeduction. Des mfethodes de maintien de rintfegritfe ont fetfe proposfees, qui simplifient Evaluation des contraintes d'intfegritfe dans une base de donnfees mise ä jour. Ces mfethodes tirent partie de rintfegritfe de ...

Résumé : Cet article présente une adaptation du boosting à l’inférence grammaticale. Notre but est d’améliorer les performances d’un algorithme à base de fusion d’états, en présence de données bruitées. Notre algorithme de boosting utilise une nouvelle règle de mise à jour des poids qui tient compte d’une information supplémentaire fournie par un oracle. Cette information est une évaluation de ...

distance-balanced graphs are introduced as graphs in which every edge uv has the followingproperty: the number of vertices closer to u than to v is equal to the number of vertices closerto v than to u. basic properties of these graphs are obtained. in this paper, we study theconditions under which some graph operations produce a distance-balanced graph.

We find a new obstruction to the principal graphs of subfactors. It shows that in a certain family of 3-supertransitive principal graphs, there must be a cycle by depth 6, with one exception, the principal graph of the Haagerup subfactor. This is the published version of arXiv:1302.5148. A II1 subfactor is an inclusion A ⊂ B of infinite von Neumann algebras with trivial centre and a compatible ...