Notice Board :

Call for Paper
Vol. 5 Issue 8

Submission Start Date:
Aug 01, 2018

Acceptence Notification Start:
Aug 10, 2018

Submission End:
Aug 15, 2018

Final MenuScript Due:
Aug 30, 2018

Publication Date:
Sep 01, 2018
                         Notice Board: Call for PaperVol. 5 Issue 8      Submission Start Date: Aug 01, 2018      Acceptence Notification Start: Aug 10, 2018      Submission End: Aug 15, 2018      Final MenuScript Due: Aug 30, 2018      Publication Date: Sep 01, 2018




Volume III Issue V

Author Name
Reshma Ann Mathews, Ajoy Thomas
Year Of Publication
2016
Volume and Issue
Volume 3 Issue 5
Abstract
Nowadays the use of internet increases day by day. So the security of each and every information is very important. Cryptography plays a vital role in ensuring the security in modern era. Visual cryptography is one of the encryption mechanism that is quite popular. NVSS(Natural Image based Visual Secret Sharing) scheme is the scheme that used to share secret image over (n-1) natural shares .It reduces the problems of sharing to a limit. Conventional NVSS scheme suffers management problem and security problem. So, we proposed an efficient and secure method of NVSS scheme using Lazy Wavelet and LSB technique
PaperID
2016/IJTRM/5/2016/6536

Author Name
Reshma Dharman, Ajoy Thomas
Year Of Publication
2016
Volume and Issue
Volume 3 Issue 5
Abstract
Steganographic attacks are happening repeatedly throughout different conducts. Such attacks are complicated to distinguish as it conceals presence of message itself, they are done through digital media which come out as normal such as MP3, MP4, PNG, JPEG etc. Mainly targets on the passive distribution of malevolent code by hiding in image, these sorts of attacks suggest the call for of application which can examine, discover the presence of malware in image file entering a network.
PaperID
2016/IJTRM/5/2016/6591

Author Name
Jayshree G Patil
Year Of Publication
2016
Volume and Issue
Volume 3 Issue 5
Abstract
Comparing DNA sequences is one of the basic tasks in computational biology. In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences. Aligned sequences of nucleotide or amino acid residues are typically represented as rows within a matrix. Gaps are inserted between the residues so that identical or similar characters are aligned in successive columns. The comparison and alignment of DNA and protein sequences are important tasks in molecular biology and bioinformatics. There are several algorithms for sequence comparison. The parallel solution is based on the dynamic programming approach and presents less processing time. In this paper we review different algorithms, the Needleman-Wunsch algorithm, and the first algorithm applying the dynamic programming to comparing biological sequences. Later the Smith-Waterman
PaperID
2016/IJTRM/5/2016/6615

Author Name
Ankit Chakrawarti, Mr. Vijay Malviya
Year Of Publication
2016
Volume and Issue
Volume 3 Issue 5
Abstract
Nodes are connected wirelessly in mobile ad hoc network (MANET). Thus connectivity becomes a difficulty in such network. The topology of such network is outlined by its routing strategy. Routing algorithms are responsible for searching routes between source and destination, under independent mobility environment. Additionally, in such kind of network organization performance is an important issue. The route of network is suffering from the mobility due to which the network is suffering from path break problems. Routing plays a big role in MANETs. In recent years, numerous routing protocols with distinctive feature have been newly proposed. In order to provide a comprehensive understanding of these routing protocols designed for MANETs and pave the way for the any analysis, a survey of the routing protocols is discussed in detail in this paper.
PaperID
2016/IJTRM/5/2016/6631