In this paper we investigate document ranking methods in thesaurus-based boolean retrieval systems, and propose a new thesaurus-based ranking algorithm called the Extended Relevance (E-Relevance) algorithm. The E-Relevance algorithm integrates the extended boolean model and the thesaurus-based relevance algorithm. Since the E-Relevance algorithm has all the desirable properties of the extended ...

Relevance feedback methods have been used in information retrieval to generate improved query formulations based on information contained in previously retrieved documents. The relevance feedback techniques have been applied to extended Boolean query formulations as well as to vector query formulations. In this paper, we propose an adaptive way to improve the retrieval performance in an extende...

Algebraic immunity AI(f) defined for a boolean function f measures the resistance of the function against algebraic attacks. Currently known algorithms for computing the optimal annihilator of f and AI(f) are inefficient. This work consists of two parts. In the first part, we extend the concept of algebraic immunity. In particular, we argue that a function f may be replaced by another boolean f...

In this paper we have used one 2 variable Boolean function called Rule 6 to define another beautiful transformation named as Extended Rule-6. Using this function we have explored the algebraic beauties and its application to an efficient Round Robin Tournament (RRT) routine for 2 (k is any natural number) number of teams. At the end, we have thrown some light towards any number of teams of the ...

We characterise the aperiodic autocorrelation for a Boolean function, f , and define the Aperiodic Propagation Criteria (APC) of degree l and order q. We establish the strong similarity between APC and the Extended Propagation Criteria (EPC) as defined by Preneel et al. in 1991, although the criteria are not identical. We also show how aperiodic autocorrelation can be related to the first deriv...

While not explicitly intended for feature transformation, some methods for switching circuit design implicitly deal with this problem. Given a tabulated Boolean function, these methods construct a circuit that implements that function. In 1950s and 1960s, Ashenhurst [1] and Curtis [2] proposed a function decomposition method that develops a switching circuit by constructing a nested hierarchy o...

While not explicitly intended for feature transformation, some methods for switching circuit design implicitly deal with this problem. Given a tabulated Boolean function, these methods construct a circuit that implements that function. In 1950s and 1960s, Ashenhurst 1] and Curtis 2] proposed a function decomposition method that develops a switching circuit by constructing a nested hierarchy of ...