We introduce a decentralized replication strategy for peerto-peer file exchange based on exhaustive exploration of the neighborhood of any node in the network. The replication scheme lets the replicas evenly populate the network mesh, while regulating the total number of replicas at the same time. This is achieved by self adaptation to entering or leaving of nodes. Exhaustive exploration is ach...

In this note, by using complex variable functions, we present a new simpler proof of the degeneracy property of the longest-edge n-section of triangles for n P 4. This means that the longest-edge n-section of triangles for n P 4 produces a sequence of triangles with minimum interior angle converging to zero. 2012 Elsevier Inc. All rights reserved.

A standard way of dealing with matrix polynomial eigenvalue problems is to use linearizations. Byers, Mehrmann and Xu have recently defined and studied linearizations of dimensions smaller than the classical ones. In this paper, lower bounds are provided for the dimensions of linearizations and strong linearizations of a given m×n matrix polynomial, and particular linearizations are constructed...

This paper describes an algorithm to implement image filtering and enhancement operations by processing adaptive triangular meshes that represent gray-level images. Experimental results show that these operations are significantly more efficient when they are performed upon triangular meshes than by sequentially processing all the pixels contained in the given images.

In this paper, we study the Bauer-Fike type theorems for regular matrix pairs and its general form. Besides these, we also obtain some bounds for measuring approximate generalized eigenvalues and for the perturbation of generalized eigenvalues concerning an approximate generalized invariant subspace. To estimate all these bounds, p-Hölder norm and an ad hoc pseudo-metric called p-Chordal matric...

The paper describes a set of methods to automatically acquire the Urdu nouns (and its gender) on the basis of inflectional and contextual clues. The algorithms used are a blend of computer's brute force on the corpus and careful design of distinguishing rules on the basis linguistic knowledge. As there are homograph inflections for Urdu nouns, adjectives and verbs, we compare potential inflecti...

Point-of-Interest (POI) data are location enriched word data, which consist of personal names, place names including administrative districts, and names of business and recreational locations. They are essential to the development of applications such as Telematics, wireless location-based services (LBS), and tourism and other business applications. Being a major component of Text-to-Speech (TT...