it is further illustrated in this paper that this is not only one of the optimized algorithms to provide a tradeoff between security and computational speed but also adds some sort of defense strategy against various attacks in a layered approach. Krishnan Batri in his paper "An Effective Pareto Optimality Based Fusion

scores by considering non dependency among all participating strategies. Relevance score assignment based on the relationship between that specific document and all other documents in the corpus. The existing Comb functions treated as the baseline functions for the proposed functions. Proposed and baseline functions’ performance tested among three medium size corpuses. The average precision value of functions indicates that, one of the proposed functions achieves better performance in comparison with the base line functions. The statistical analysis confirms the same. We would like to thank all the authors and reviewers for their collaborative efforts to make this issue possible. It is our sincere wish that this journal become an attractive knowledge exchange platform among information systems researchers. Finally, to our loyal readers around the world, we hope you find the contents of the papers useful to your work or research.