In this paper, we focus on similarity searching for similar acoustic data over unstructured decentralised P2P networks. Similarity is measured in terms of time warping, which can cope with distortion that is naturally present when query-by-content is performed. We propose a novel framework, which takes advantage of the absence of overhead in unstructured P2P networks and minimises the required ...

The purpose of this paper is to study a stochastic model which assesses the effect of mutual interference on the searching efficiency in populations of insect parasites. By looking carefully at the assumptions which govern the model, I shall explain why the searching efficiency is of the same order as the total number, N, in the population, a conclusion which is consistent with the predictions ...

This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling the basic trade-off between forwarding queries among peers and maintaining lookup tables in peers, so that we can utilize optimized lookup table scale to minimize bandwidth consumption, and to greatly improve the searc...

The research focus of Peer-to-Peer (P2P) network design had long been on low-complexity content mapping and efficient search mechanisms. System such as CAN, Chord, Pastry are pioneers in the area and have been cited by almost every P2P work. These systems provide an efficient substrate for sharing/distributing small files like MP3 or images, because searching time is essential to the overall pe...

The research focus of Peer-to-Peer (P2P) network design had long been on low-complexity content mapping and efficient search mechanisms. System such as CAN, Chord, Pastry are pioneers in the area and have been cited by almost every P2P work. These systems provide an efficient substrate for sharing/distributing small files like MP3 or images, because searching time is essential to the overall pe...

We introduce the concepts of Grover operators and Grover kernels to systematically analyse Grover’s searching algorithms. Then, we investigate a one-parameter family of quantum searching algorithms of Grover’s type and we show that the standard Grover’s algorithm is a distinguished member of this family. We show that all the algorithms of this class solve the searching problem with an efficienc...

common pistachio psylla, agonoscena pistaciae burckardt and lauterer (hemiptera: aphalaridae) is one of the economical pest among the pistachio orchards. the adonis' ladybird, hippodamia variegata (goeze) (col: coccinellidae) is one of the most prominent coccinellid predator in pistachio orchards. it is omnivorous and feed on aphids and psylla. functional response studies using a suitable ...

We introduce the tree cross-product problem, which abstracts a data structure common to applications in graph visualization, string matching, and software analysis. We design solutions with a variety of tradeoffs, yielding improvements and new results for these applications.

To ensure security, encryption techniques play a major role when data are outsourced to the cloud. Problem of retrieving the data from the cloud servers is considered. Many searching techniques are used for retrieving the data. This study focused on a set of keyword based search algorithms. It provides secure data retrieval with high efficiency. It concludes Ranked Searchable Symmetric Encrypti...

In this paper we present a Basic Bioinformatics Meta-searcher (BBMS), a web-based service aiming to simplify and integrate biological data searching through selected biological databases. BBMS facilitates biological data searching enabling multiple sources transparently, increasing research productivity as it avoids time consuming learning and parameterization of different search engines. As a ...