This article examines group testing procedures where units within a group (or pool) may be correlated. The expected number of tests per unit (i.e., efficiency) of hierarchical- and matrix-based procedures is derived based on a class of models of exchangeable binary random variables. The effect on efficiency of the arrangement of correlated units within pools is then examined. In general, when c...

In this paper we address the problem of pool based active learning, and provide an algorithm, called UPAL, that works by minimizing the unbiased estimator of the risk of a hypothesis in a given hypothesis space. For the space of linear classifiers and the squared loss we show that UPAL is equivalent to an exponentially weighted average forecaster. Exploiting some recent results regarding the sp...

The technology of flash memory SSDs (solid state drives) which are increasingly adopted in a wide spectrum of storage systems has the potential of changing the database architecture and principles. With the high random access speed and high IOPS of the SSD, this paper describes a secondary buffer pool & readahead solution based on OLTP for MySQL InnoDB which can reduce I/O requests & latency an...

In this paper we analyze a simple model of adaptive competition which captures essential features of a variety of adaptive competitive systems in the social and biological sciences. In this model, each of N agents, at each time step of a game, joins one of two groups. The agents in the minority group are awarded a point, while the agents in the majority group get nothing. Each agent has a fixed...

Abstract There has been growing interest in studies of general random intersection graphs. In this paper, we consider a general random intersection graphG(n,−→a ,−→ Kn, Pn) defined on a set Vn comprising n vertices, where−→a is a probability vector (a1, a2, . . . , am) and −→ Kn is (K1,n,K2,n, . . . ,Km,n). This graph has been studied in the literature [10,11,20,29] including a most recent work...

Clustering accuracy of partitional clustering algorithm for categorical data depends primarily on the choice of initial data points to instigate the clustering process and hence the clustering results cannot be generated and repeated consistently. In this paper we present an approach to compute initial modes for K-mode partitional clustering algorithm to cluster categorical data sets. Here we u...

background: infections are readily transmitted as a result of bacterial contamination of swimming pools. therefore, hygiene and preventing the contamination of swimming pools is of particular importance. the objective of this study was to determine the amount of bacterial contamination in indoor pools of yazd in 2013. methods: in this descriptive and analytical study, all indoor swimming pools ...

Two experiments utilized a new experimental paradigm – the IPD-MD game – to study how relative deprivation at the group level affects intergroup competition. The IPD-MD game enables group members to make a costly contribution to either a within-group pool that benefits fellow in-group members, or a between-group pool, which, in addition harms out-group members. We found that when group members ...

Partially randomized (doped) pools are important for optimizing activities initially isolated by selection-amplification or SELEX, and for locating nucleotides critical for function. Here we present a method for calculating the number of unique sequences in a pool, and the expected copy number of each unique sequence with a specified number of changes from the original sequence. Surprisingly, s...

This paper presents a new algorithm that simplifies the process of generating and expanding cipher key, which is considered one of the most important elements in ciphering process. The algorithm generates a random pool of keys (long size key), this key is sent to the authorized receiver. During the ciphering process the algorithm will select the schedule keys randomly from the pool of keys. The...