The PageRank algorithm is an iterative algorithm used in the Google search engine to improve the results of requests by taking into account the link structure of the web. More interesting and intelligent surfer model combining the link and content information in PageRank have been proposed in the literature. The main disadvantage of those models is that the combination of single word PageRank t...

In this paper we provide theoretical and experimental results on a random-surfer model for construction of a random graph. In this model, a new node connects to the existing graph by choosing a start node uniformly at random and then performing a short random walk. We show that in certain formulations, this results in the same distribution as the preferential-attachment random-graph model, and ...

Telah dilakukan analisis kontur isodosis radiasi dari pesawat sinar-X di instalasi radiologi Rumah Sakit Universitas Andalas menggunakan software surfer. Penelitian ini bertujuan untuk mendapatkan gambaran sebaran laju dosis pada jarak dan ketinggian yang berbeda agar pekerja dapat mengetahui titik aman bagi pekerja. Pengukuran surveymeter fluke 9 pengukuran dengan 3 variasi berbeda. Pengambila...

We propose Focused Page Rank (FPR) algorithm adaptation for the problem of scientific papers ranking. FPR is based on the Focused Surfer model, where the probability to follow the reference in a paper is proportional to its citation count. Evaluation on Citeseer autonomous digital library content showed that proposed model is a tradeoff between traditional citation count and basic Page Rank (PR...

The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by taking into account the link structure of the Web. PageRank assigns to a page a score proportional to the number of times a random surfer would visit that page, if it surfed indefinitely from page to page, following all outlinks from a page with equal probability. We propose to improve PageRa...

PageRank is a way to rank Web pages taking into account hyper-link structure of the Web. PageRank provides efficient and simple method to find out ranking of Web pages exploiting hyper-link structure of the Web. However, it produces just an approximation of the ranking since the random surfer model uses just uniform distributions for all situation of choice happening during the surf process. In...

The surveillance game [Fomin et al., 2012] models the problem of web-page prefetching as a pursuit evasion game played on a graph. This two-player game is played turn-by-turn. The first player, called the observer, can mark a fixed amount of vertices at each turn. The second one controls a surfer that stands at vertices of the graph and can slide along edges. The surfer starts at some initially...

This short feature describes a project to create an online opera which deploys a new web technology, the Syzygy Surfer, developed in the Institute of Creative Technologies (IOCT) at De Montfort University. The project is a collaboration between the IOCT and The Opera Group.