This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space requirements for their indices of chunks. Since a hash function can produce the same value for different chunks, false matches are possible. In this paper we propose an algorithm that can be used for eliminating those fal...

We present a distributed algorithm for file allocation that guarantees high assurance, availability, and scalability in a large distributed file system. The algorithm can use replication and fragmentation schemes to allocate the files over multiple servers. The file confidentiality and integrity are preserved, even in the presence of a successful attack that compromises a subset of the file ser...

Annotating the tremendous amount of sequence information being generated requires accurate automated methods for recognizing homology. Although sequence similarity is only one of many indicators of evolutionary homology, it is often the only one used. Here we find that supplementing sequence similarity with information from biomedical literature is successful in increasing the accuracy of homol...

Intelligent energy management is a key challenge in Wireless Sensor Networks. The choice of an appropriate routing algorithm constitutes a critical factor, especially in unstructured networks where, due to their dynamic nature, a reactive routing protocol is necessary. Such networks often favour packet flooding to fulfil this need. One such algorithm is IDEALS, a technique proposed in the liter...

Wireless sensor networks are employed in many critical applications. The K-coverage configuration is usually adopted to guarantee the quality of surveillance. A sensor node can be determined to be ineligible to stay active when its sensing range is K-covered. Although many algorithms have been proposed to reduce the complexity of the K-coverage configuration, the accuracy cannot be preserved wh...

Many researchers have worked on example-based machine translation and different techniques have been investigated in the area. In literature, a method of using translation templates learned from bilingual example pairs was proposed. The paper investigates the possibility of applying the same idea for close languages where word order is preserved. In addition to applying the original algorithm f...

Edge preserved smoothing techniques has gained importance for the purpose of image denoising. A good edge preserved filtering is given by nonlocal-means filter than any linear model based approaches.The contributions are in two fold. First, this paper explores a refined approach of nonlocal-means filter by using robust estimation function rather than the usual exponential function for its weigh...

A common practice when ltering a case-base is to employ a ltering scheme that decides which cases to delete, as well as how many cases to delete, such that the storage requirements are minimized and the classiication competence is preserved or improved. We introduce an algorithm that rivals the most successful existing algorithm in the average case when ltering 30 classiication problems. Neithe...

In this paper we propose a new decentralized algorithm to solve the consensus on the average problem on arbitrary strongly connected digraphs through a gossip algorithm based on broadcasts. We directly extend previous results by not requiring that the digraph is balanced. Our algorithm is an improvement respect to known gossip algorithms based on broadcasts in that the average of the initial st...

A mesh insertion method is presented to merge a tool mesh into a target mesh. All the entities of the tool mesh are preserved in the output mesh while some of the entities of the target mesh are modified or eliminated in order to obtain a topologically conforming mesh. The algorithm can handle non-manifold surfaces formed of quadrilaterals and/or triangles as well as volumetric meshes based on ...