Publish/subscribe (pub/sub) systems are designed to efficiently match incoming events (e.g., stock quotes) against a set of subscriptions (e.g., trader profiles specifying quotes of interest). However, current pub/sub systems only support a simple binary notion of matching: an event either matches a subscription or it does not; for instance, a stock quote will either match or not match a trader...

P2P deployments are a natural infrastructure for building distributed search networks. Proposed systems support locating and retrieving all results, but lack the information necessary to rank them. Users, however, are primarily interested in the most relevant results, not necessarily all possible results. Using random sampling, we extend a class of well-known information retrieval ranking algor...

In insulating lanthanides, unquenched orbital momentum and weak crystal-field (CF) splitting of the atomic $J$ multiplet at lanthanide ions result in a highly ranked (multipolar) exchange interaction between them complex low-temperature magnetic order not fully uncovered by experiment. Explicitly correlated {\it ab initio } methods proved to be efficient for an accurate description CF multiplet...

nowadays, the use of innovative nano-technology in the food industry quality control has significantly increased and it is widely employed in numerous fields such as diagnosis of microbial toxin of foods using nano-biosensors, increasing food shelf-life with the help of nano-clay and nano-silver packaging, as well as changing some of the unpleasant organoleptic properties such as taste, color, ...

Multistage pair ranked set sampling (MSPRSS) is a rank-based design that improves statistical inference with respect to simple random of the same size. It applicable when exact measurement difficult, but judgment raking potential sample units can be done fairly accurately and easily. The ranking usually performed based on personal or concomitant variable, need not totally free errors. This arti...

Let D be a collection of string documents of n characters in total. The top-k document retrieval problem is to preprocess D into a data structure that, given a query (P, k), can return the k documents of D most relevant to pattern P . The relevance of a document d for a pattern P is given by a predefined ranking function w(P, d). Linear space and optimal query time solutions already exist for t...

The notion of co derivations of ranked bigroupoids is discussed by Alshehri et al. in press , and their generalized version is studied by Jun et al. under review press . In particular, Jun et al. under review press studied coderivations of ranked bigroupoids. In this paper, the generalization of coderivations of ranked bigroupoids is discussed. The notion of generalized coderivations in ranked ...

This paper is intended to provide the reader with an introduction to ranked set sampling, a statistical technique for data collection that generally leads to more efficient estimators than competitors based on simple random samples. Methods for obtaining ranked set samples are described and the structural differences between ranked set samples and simple random samples are discussed. Properties...