In this paper, the authors attempt to compute a global ranking for all web pages, based solely on their location in the Web’s graph structure. This PageRank indicates the importance of each page. Once again, the Web is modeled as a directed graph G = (V;E), where V is the set of nodes (pages) and E the set of edges and there exists an edge (i; j) from node i to node j in the graph if and only i...

With rapid growth of information on the Web, Web search engines have gained great momentum for exploiting valuable Web resources. Although keywords-based Web search engines provide relevant search results in response to users’ queries, future enhancement is still needed. Three important issues include (1) search results can be diverse because ambiguous keywords in queries can be interpreted to ...

In this paper, we present an approach and a visual tool, called HWrap (Handle Based Wrapper), for creating web wrappers to extract data records from web pages. In our approach, we mainly rely on the visible page content to identify data regions on a web page. In our extraction algorithm, we inspired by the way a human user scans the page content for specific data. In particular, we use text fea...

for years, search engines have been considered as one of the most frequently used information seeking tools through the web. efficiency, ease of use and search quality are the main factors for giving precedence over search engines. search quality is assessed based on the concept of page rank which is applied to scoring web documents. the structures designed for linkage among the pages of a site...

Aim of this paper is to describe a method of automatic web page classification to semantic domains and its evaluation. The classification method exploits machine learning algorithms and several morphological as well as semantical text processing tools. In contrast to general text document classification, in the web document classification there are often problems with short web pages. In this p...

In quantum teleportation, an unknown quantum state is transmitted from one party to another using only local operations and classical communication, at the cost of shared entanglement. Is possible similarly, using an N party entangled state, to have the state retrievable by any of the N − 1 possible receivers? If the receivers cooperate, and share a suitable state, this can be done reliably. Th...

The World Wide Web has become a key intermediary between producers and consumers of information. Web’s linkage structure has been exploited by contemporary search engines to decrease the search cost for consumers while usually also rewarding the producers of higher status Web pages. In addition to influencing visibility and accessibility, in-links, as marks of recognition, accord status to a We...

Discovering related concepts in a multi-agent system among agents with diverse ontologies is difficult using existing knowledge representation languages and approaches. We describe an approach for identifying candidate relations between expressive, diverse ontologies using concept cluster integration. We evaluate the feasibility of this approach using lightweight ontologies. These lightweight o...

Introduction ........................................................................................................................................................ 1 Features Overview......................................................................................................................................... 1 Usage Overview ............................................................

We present a proxy-based system for augmenting the capabilities of the World Wide Web. Our system adds two-way association links and automatically removes these links when they break, while the existing web features only one-way links and lingering broken links. Several web augmentation systems have been developed in the past that add two-way links. Our key contribution is in terms of link mana...