Rinkle Rani Aggarwal

An Efficient Algorithm for Web Page Change Detection

Internet is actively used for the exchange of information. People upload the web pages and updating the new web pages very frequently. There is a frequent change in the content of the web page hence it become necessary to develop an efficient system which could detect these changes efficiently and in the minimum browsing time. So as to achieve this we compare the old web page and the new web page. Changes in a web page can be detected with the use of various algorithms. Various tools and services are also available which can be used to detect these changes. In this paper a new algorithm for the structural as well as content change detection has been proposed and described. For better results tree has been designed for the corresponding web pages. The proposed change detection algorithm is based on assigning hash value to each leaf node and tag value to the non leaf nodes. Bottom up approach has been used for assignment. The level of each node has been used to find hash values and modification in a node. It has been shown with the help of suitable examples that the proposed algorithm extracts the changes very efficiently from the various web pages.

Reference Scan Algorithm for Path Traversal Patterns

The paper focuses the path of exploring an algorithm which involves mining frequently used user traversals pattern while using the World Wide Web by the user. As the web’s becoming more and more popular, web servers gather the large amount of data from the web in the form of web server logs. The web server log provides important information aiding to analysing the user surfing behavior and thus extract important information. Web Usage Mining analyses the Web access logs to find how the users surf a website so as to bring out interesting patterns which can be used for improving user profile, web site design, business and marketing decision support and web server system. Firstly, the server log is scanned and the maximal forward references are obtained for which effect of backward references is not considered and secondly, the maximal forward references obtained in the first step are used to finally obtain the large references which are frequently accessed patterns by the user.

An efficient Routing Scheme to provide more Fault-tolerance for an Irregular Multistage Interconnection Network

Fault-tolerance in an interconnection network is very important for its continuous operation over a relatively long period of time. Fault-tolerance is the ability of the system to continue operating in the presence of faults. In this paper a new irregular network IABN has been proposed and an efficient routing procedure has been defined to study the fault tolerance of the network. The behavior of this network has been analysed and compared with regular network ABN, under fault free conditions and in the presence of faults. It has been found that in an IABN, there are six possible paths between any source-destination pair, whereas ABN has only two paths. Thus the proposed network IABN is more fault-tolerant.