Volume 2 Issue 7- July 2012


S.No Title Page
1. DNA Sequence Alignment based on Bioinformatics
Shivani Sharma, Amardeep singh

DNA Sequence alignmentis the most fundamental and essential task of computational biology and forms the base for other tasks of bioinformatics. The two basic alignment algorithms i.e. Smith Waterman for local alignment and Needleman Wunsch for global alignment have been used in this paper. The algorithms have been developed and simulated using MATLAB for genome analysis and sequence alignment. The local and global alignment has been presented and the results are shown in the form of Dot plots and local and global scores for the sequences.
Keywords:Bioinformatics, DNA Sequence Alignment, Smith-Waterman, Needleman-Wunsch, local alignment, global alignment

Full Text PDF
2. From Permutations to Iterative Permutations
Hoang Chi Thanh , Nguyen Thi Thuy Loan, Nguyen Duy Ham

In this paper we construct a new efficient simple algorithm to generate all permutations of a finite set. And then we extend the algorithm for generating all iterative permutations of a multi-set. Applying the parallelizing method based on output decomposition we parallelize this algorithm. Further, we use the parallel algorithm to solve an optimal problem of task arrangement.
Keywords-- complexity, multi-set, optimal arrangement, parallel algorithm, permutation

Full Text PDF
3. Modelling and Performance Evaluation of Router Transparent Web cache Mode
Emad Hassan Al-Hemiary

Abstract— This paper models and evaluates the performance of router transparent web cache mode in local area networks. A nearby transparent Web cache server intercepts client’s requests; forwarded by a layer 3 router or a layer 4 switch, and looks for a copy in its local cache store; if the object requested exits in its local cache, then a cache hit results and the object is forwarded to the router immediately which in turns delivers it to the client. Otherwise, the Web cache establishes a one-time TCP connection with the origin HTTP server and downloads that object. The analytical modelling is carried out using state transition diagrams and open queuing network modelling where the average response time is evaluated for different parameters like probability of cache hit, client HTTP requests (arrival) rate and external arrivals at the origin HTTP server. We also include the delay effects of transmission media between the local network and the Internet where the origin servers reside. Results obtained validate the model and show the significance of deploying Web cache server in a network.
Keywords—Web cache model, performance of transparent Web cache, Web cache state transition diagram.

Ful Text PDF
4. Advanced Symmetric key Cryptography using extended MSA method: BLZ symmetric key algorithm
Abhilash G, Sudhakar KN, Dr. JItendranath Mungara


Full Text PDF
5. An Efficient Algorithm for Frequent Pattern Mining using Web Analysis Approach
Monika Verma, Shikha Pandey

In this paper a complete structure with new modified algorithm for mining and finding web usage patterns from a Web Application is presented. The Web Application can be a real Web site that has all the challenging aspects of real-life Web usage mining, including evolving user profiles and external data describing ontology of the Web content. A name is given to each phase used in this framework i.e. Data Collection & Preprocessing, Pattern Discovery and Pattern Analysis. Our research work is started by invoking pages of our application over Internet, user may navigate from that to his/her intended destination. In this we recognize and analyze different patterns (page sequence) invoked in intra page navigation by different users then we will count the frequency of a particular pattern by the means of number of hits. In Pattern Analysis we have developed a modified algorithm for mining frequent pattern that consume less time and memory usage as compare to traditional frequent pattern mining algorithm.

Keywords- Web usage pattern, Web Application, Data Collection & Preprocessing, Pattern Discovery, Pattern Analysis, Frequent pattern mining.

Full Text PDF
6. Comparison on Different Load Balancing Algorithms of Peer to Peer Networks
K.N.Sirisha , S.Bhagya Rekha

Load balancing is the process of improving the performance of a peer to peer networks through a redistribution of load among the processors. In this paper we present the performance analysis of various load balancing algorithms based on different parameters, considering two typical load balancing approaches static and dynamic. The analysis indicates that static and dynamic both types of algorithm can have advancements as well as weaknesses over each other. Deciding type of algorithm to be implemented will be based on type of parallel applications to solve. The main purpose of this paper is to help in design of new algorithms in future by studying the behavior of various existing algorithms.

Keywords- Peer to Peer networks,  Load Balancing Algorithms. Distributed systems

Full Text PDF