Notice Board :

Call for Paper
Vol. 11 Issue 4

Submission Start Date:
April 01, 2019

Acceptence Notification Start:
April 10, 2019

Submission End:
April 20, 2019

Final MenuScript Due:
April 22, 2019

Publication Date:
April 25, 2019
                         Notice Board: Call for PaperVol. 11 Issue 4      Submission Start Date: April 01, 2019      Acceptence Notification Start: April 10, 2019      Submission End: April 20, 2019      Final MenuScript Due: April 22, 2019      Publication Date: April 25, 2019




Volume IX Issue VI

Author Name
J Bremer
Year Of Publication
2017
Volume and Issue
Volume 9 Issue 6
Abstract
Internet is treasure of information i.e. all information are available on the Internet. Security is the major challenge when sharing information on shared media. So many encryption algorithms like RSA; DES etc are developed to unauthorized access of information in any form. Encryption Algorithms gives the response depending on programming language in which they developed. Java Script is the most popular scripting language for development of Encryption Algorithms. Web browsers are used to retrieve the information stored on World Wide Web, the retrieval response may depends on many factors like Programming language, Operating System, Internet bandwidth, congestion etc. In this paper we have chosen RSA algorithm in JavaScript scripting language to analyzed performance on different web browsers and finally we study that different Web browsers perform differently on RSA Algorithm in terms of response time.
PaperID
2017/EUSRM/6/2017/43721

Author Name
T Casse
Year Of Publication
2017
Volume and Issue
Volume 9 Issue 6
Abstract
In this paper, we explore a new real time sequence pattern technique for web access pattern. It uses a preorder linked, position coded version of UAP tree and eliminates recursive reconstruction of intermediate trees, starting with suffix sequences and ending with prefix sequences by UAP tree technique. An attempt has been made to modify UAP tree approach for improving efficiency. This algorithm totally eliminates the need to engage in numerous reconstructions of intermediate UAP-trees during mining and considerably reduces execution time. PS-UAP produces significant reduction in response time achieved by the PS-UAP algorithm and provides a position code mechanism for remembering the stored database, thus, eliminating the need to re-scan the original database as would be necessary for applications like those incrementally maintaining mined frequent patterns, performing stream or dynamic mining.
PaperID
2017/EUSRM/6/2017/43796 Implementation