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...

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.

Conjugacy classes of primitive words in the free group of rank two can indexed by the rationals. A representative for each conjugacy class is given by a recursive enumeration scheme and the representative, usually called a Farey word, is denoted by Wp/q where p and q are relatively prime integers. Primitive pairs, that is, pairs of words that generate the free group, correspond to pairs of word...

We introduce the notion of a cosheaf on a fan Σ and define the Z2 Hodge spaces Hpq(Σ), which are the homology groups Hp(∧E ) of the qth exterior power of the cosheaf E on Σ. Geometrically, for σ ∈ Σ the stalk Eσ of the cosheaf E is the compact real torus in the real orbit Oσ(R) of the real toric variety XΣ(R). The Z2 Hodge spaces Hpq(Σ) are indexed by pairs p, q with 0 ≤ q ≤ p ≤ d, where d = di...

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and let $d_u$ denote the degree of vertex $u$ in $G$. The Randi'c index of $G$ is defined as${R}(G) =sum_{uvin E(G)} 1/sqrt{d_ud_v}.$In this paper, we investigate the relationships between Randi'cindex and several topological indices.

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 ‎three ‎...