Construction of random pooling designs based on singular linear space over finite fields

<abstract><p>Faced with a large number of samples to be tested, if there are requiring to be tested one by one and complete in a short time, it is difficult to save time and save costs at the same time. The random pooling designs can deal with it to some degree. In this paper, a family of random pooling designs based on the singular linear spaces and related counting theorems are constructed. Furtherly, based on it we construct an $ \alpha $-$ almost\ d^e $-disjunct matrix and an $ \alpha $-$ almost\ (d, r, z] $-disjunct matrix, and all the parameters and properties of these random pooling designs are given. At last, by comparing to Li's construction, we find that our design is better under certain condition.</p></abstract>

Modified Master Key Based Multipath Reinforcement Pre-Distribution Scheme For Wireles Sensor Networks

Wireless Sensor Network (WSN) is one of the budding fields of technology. It is mainly used for Environmental monitoring and Data accumulation. Due to the limited energy in WSNs, it faces many practical difficulties. The main challenge is the security issues. Objective of this project is to provide security against clone attack in a WSN that are arranged in cluster topology. In this paper, a method to implement three important security measures namely i) Master – Key Pre-distribution solutions, ii) Super imposed disjunct matrix code and iii) Multipath key reinforcement scheme is discussed. One method complements the advantage of other method and thus provides high security. The final analysis shows that the computational overhead is minimum.

A NEW CONSTRUCTION FOR POOLING DESIGNS

Pooling designs are a very helpful tool for reducing the number of tests for DNA library screening. A disjunct matrix is usually used to represent the pooling design. In this paper, we construct a new family of disjunct matrices and prove that it has a good row to column ratio and error-tolerant property.

ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES

In this paper, we define an α-almost (k; 2e + 1)-separable matrix and an α-almostke-disjunct matrix. Using their complements, we devise algorithms for fault-tolerant trivial two-stage group tests (pooling designs) for k-complexes. We derive the expected values for the given algorithms to identify all such positive complexes.