Randomising set index functions, randomisation functions for short, can significantly reduce conflict misses in data caches by placing cache blocks in a conflict-free manner. XOR-based functions are a broad class of functions that generally exhibit few conflict misses. Topham and González claimed that the sub-class of functions based on division of polynomials over contains those functions that...

Previous fixed point indexes defined for a set-valued map in an infinite-dimensional space have required the values of this map to be convex sets. The corresponding assumption of this paper is that the values be (co-)acyclic sets, i.e., that the reduced Alexander cohomology group of each of these sets be trivial in each dimension. Other assumptions are that the space is locally convex and that ...

Because of the isomorphism between P2P networks and mobile ad hoc networks (MANET), many research communities are focusing on the work based on the combination of P2P and the backbone strategy, and this produces a field called mobile peer-to-peer (MP2P) networks. An effective algorithm for searching and retrieving information has proven to make a great impact on the performance of MP2P systems....

In many real world datasets both the individual and coordinated action of features may be relevant for class identification. In this paper, a computational strategy for relevant feature selection based on the characterization of redundant or complementary features is proposed. The characterization is achieved using fuzzy measures and an interaction index computed from fuzzy measure coefficients...

In 1833, André-Michel Guerry wrote his famous Essai sur la statistique morale de la France. This data set has been recently studied in Friendly (2007), Dray and Jombard (2011), Filzmoser et al. (2012). The aim of this document is to present some tools of the R package GeoXp (Laurent et al., 2012) to analyze this data set.

ABSTRACT Let ‎G=(V,E) ‎be a‎ ‎simple ‎connected ‎graph ‎with ‎vertex ‎set ‎V‎‎‎ ‎and ‎edge ‎set ‎‎‎E. ‎The Szeged index ‎of ‎‎G is defined by ‎ where ‎ respectively ‎ ‎ is the number of vertices of ‎G ‎closer to ‎u‎ (‎‎respectively v)‎ ‎‎than ‎‎‎v (‎‎respectively u‎).‎ ‎‎If ‎‎‎‎S ‎is a‎ ‎set ‎of ‎size‎ ‎ ‎ ‎let ‎‎V ‎be ‎the ‎set ‎of ‎all ‎subsets ‎of ‎‎S ‎of ‎size ‎3. ‎Then ‎we ‎define ‎t...

We review and study the performance of four diierent index structures for indexing set-valued attributes designed to speed up set equality, subset and superset queries. All index structures are based on traditional techniques, namely signatures and inverted les. More speciically, we consider sequential signature les, signature trees, extendible signature hashing, and a B-tree based implementati...

We consider the problem of manipulability of social choice rules in impartial anonymous and neutral culture model (IANC). We derive some properties of anonymous and neutral equivalence classes in order to evaluate maximal difference of Nitzan-Kelly’s index in impartial culture (IC) and IANC model. The value of Nitzan-Kelly’s index was calculated in IANC and compared with the same index in IC mo...

Let G be a graph. The Wiener index of G, W (G), is defined as the sum of distances between all pairs of vertices of G. Denote by L i (G) its i-iterated line graph. In the talk, we will consider the equation W (L i (T)) = W (T) where T is a tree and i ≥ 1.