We did gram-based indexing and the retrieval with NTCIR-4 WEB task. The time required to make indices are 34.7 hours. The size of indices is 30.2Gbyte. The median of retrieval time par word is 26msec. The ranking algorithm of retrieval results is based on a traditional probabilistic model. We report on the result of gram-based indexing and the retrieval, and propose a scoring method based on li...

One of the simplest creative act is the invention of a new word that captures some characteristics of objects or processes, for example industrial or software products, activity of companies, or the main topic of web pages. Neurocognitive mechanisms responsible for this process are partially understood and in a simplified form may be implemented in a computational model. An algorithm based on s...

Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To better capture the structure of documents, the underlying data model should be able to represent the phrases in the document as well as single terms. We present a novel data model, the Document Index Graph, which indexes web documents based on phrases, rather than sing...

People can easily determine whether or not a given document is interesting just by glancing through it. However, when asked to explicitly list the rules upon which such a decision is based, they are unable to do so. This is because our personal interests are examples of tacit knowledge. I have implemented a prototype agent-based retrieval system, capable of finding web documents matching a user...

Many web sources provide access to an underlying database containing structured data. These data can be usually accessed in HTML form only, which makes it difficult for software programs to obtain them in structured form. Nevertheless, web sources usually encode data records using a consistent template or layout, and the implicit regularities in the template can be used to automatically infer t...

Predicting the next page to be accessed by Web users has attracted a large amount of research work lately due to the positive impact of such prediction on different areas of Web based applications. Major techniques applied for this intention are Markov model and clustering. Low order Markov models are coupled with low accuracy, whereas high order Markov models are associated with high state spa...

Today most of the information in all areas is available over the web. It increases the web utilization as well as attracts the interest of researchers to improve the effectiveness of web access and web utilization. As the number of web clients gets increased, the bandwidth sharing is performed that decreases the web access efficiency. Web page prefetching improves the effectiveness of web acces...

This paper explores the problem of page migration in ring networks. A ring network is a connected graph, in which each node is connected with exactly two other nodes. In this problem, one of the nodes in a given network holds a page of size D. This node is called the server and the page is a non-duplicable data in the network. Requests are issued by nodes to access the page one after another. E...

The Distributed Shared Memory (DSM) system is designed on the basis of page-based, shared-variable-based or object-based access. There are certain advantages and disadvantages of each access methodology. Comparison of such different access types in a distributed environment is based on parameters namely, type of operation (data read or update), maintenance of consistent data copies on all nodes...

In this work we propose a representation of the web as a directed hypergraph, instead of a graph, where links can connect not only pairs of pages, but also pairs of disjoint sets of pages. In our model, the web hypergraph is derived from the web graph by dividing the set of pages into non-overlapping blocks and using the links between pages of distinct blocks to create hyperarcs. Each hyperarc ...