A domain specific web search engine is a search engine which replies to domain specific user queries. The crawler in a domain specific search engine must crawl through the domain specific web pages in the World Wide W...
详细信息
A domain specific web search engine is a search engine which replies to domain specific user queries. The crawler in a domain specific search engine must crawl through the domain specific web pages in the World Wide web (WWW). For a crawler it is not an easy task to download the domain specific web pages. Ontology can play a vital role in this context. Our focus will be to identify web pages for a particular domain in WWW.
In this paper, an approach for storing Markov tree, used in various versions of PPM model while predicting next web-page is proposed. Markov tree requires huge amount of memory. This problem is solved using cellular a...
详细信息
In this paper, an approach for storing Markov tree, used in various versions of PPM model while predicting next web-page is proposed. Markov tree requires huge amount of memory. This problem is solved using cellular automata which is considered as a fast and inexpensive mechanism. The proposed technique utilizes non-linear single cycle multiple attractor cellular automata (SMACA) which replaces Markov tree for minimizing the memory requirement.
Search for any topic or a word using web search engine depends on its ranking mechanism. Generally, search engine sorts through the millions of web pages and then present the significant web-pages that match search to...
详细信息
Search for any topic or a word using web search engine depends on its ranking mechanism. Generally, search engine sorts through the millions of web pages and then present the significant web-pages that match search topic of the user. These matches will be further ranked, so that the most relevant ones come first. This paper proposes an alternate way to rank hyper-linked web page through analysis of link structure. This link structure is stored in an efficient way to minimize the storage space using Galois Extension Field GF (2 P ).
Both symmetric and asymmetric key algorithms are used to secure a network. Asymmetric key approach involves greater time complexity and hence prone to higher power consumption. Symmetric key cryptography, on the other...
详细信息
ISBN:
(纸本)0769530451
Both symmetric and asymmetric key algorithms are used to secure a network. Asymmetric key approach involves greater time complexity and hence prone to higher power consumption. Symmetric key cryptography, on the other hand, involves a key exchange phase. In this paper, we propose an authentication technique for new nodes to an ad-hoc network that would also extract the advantages of both symmetric and asymmetric key cryptography while avoiding the adversities. In the proposed collaborative technique, the new node is not only authenticated, but the request-reply messages have been used to generate a secret key at the two ends. The proposed algorithm estimates the distance of a node X from the power loss of a message from X. Both the sender and the receiver separately compute the same secret key based on this distance. The proposed algorithm does not use GPS and identifies location of nodes by distance and direction only.
Search for a web-page using Crawler based Search Engine depends on its Ranking Mechanism. Search Engine sorts through millions of web-pages and present the significant web-pages through Ranking method. A new approach ...
详细信息
Search for a web-page using Crawler based Search Engine depends on its Ranking Mechanism. Search Engine sorts through millions of web-pages and present the significant web-pages through Ranking method. A new approach is proposed here adopting Cellular Automata.
暂无评论