Requested Web Pages Research Articles

Detection Method for Distributed Web-Crawlers: A Long-Tail Threshold Model

This paper proposes an advanced countermeasure against distributed web-crawlers. We investigated other methods for crawler detection and analyzed how distributed crawlers can bypass these methods. Our method can detect distributed crawlers by focusing on the property that web traffic follows the power distribution. When we sort web pages by the number of requests, most of requests are concentrated on the most frequently requested web pages. In addition, there will be some web pages that normal users do not generally request. But crawlers will request for these web pages because their algorithms are intended to request iteratively by parsing web pages to collect every item the crawlers encounter. Therefore, we can assume that if some IP addresses are frequently used to request the web pages that are located in the long-tail area of a power distribution graph, those IP addresses can be classified as crawler nodes. The experimental results with NASA web traffic data showed that our method was effective in identifying distributed crawlers with 0.0275% false positives when a conventional frequency-based detection method shows 2.882% false positives with an equal access threshold.

Analysis and Neural Networks Modeling of Web Server Performances Using MySQL and PostgreSQL

The purpose of this study is to analyze and then model, using neural network models, the performance of the Web server in order to improve them. In our experiments, the parameters taken into account are the number of instances of clients simultaneously requesting the same Web page that contains the same SQL queries, the number of tables queried by the SQL, the number of records to be displayed on the requested Web pages, and the type of used database server. This work demonstrates the influences of these parameters on the results of Web server performance analyzes. For the MySQL database server, it has been observed that the mean response time of the Web server tends to become increasingly slow as the number of client connection occurrences as well as the number of records to display increases. For the PostgreSQL database server, the mean response time of the Web server does not change much, although there is an increase in the number of clients and/or size of information to be displayed on Web pages. Although it has been observed that the mean response time of the Web server is generally a little faster for the MySQL database server, it has been noted that this mean response time of the Web server is more stable for PostgreSQL database server.

Enhancing web accessibility by implementing context aware proxy

Purpose Millions of visually impaired people (VIP) in the world still face difficulties browsing the Web and accessing information. This paper aims to present a proxy service that takes advantage of the concept of context-aware to help contextualizing web pages for visually impaired users. Design/methodology/approach The VIP-aware proxy combines five components to utilize the user preferences, adapts the requested web page and reorganizes its content to best match the preferences set by the user. This new scenario will assist VIP in browsing the Web more effectively. Findings A preliminary evaluation of the system resulted in general user satisfaction. Practical implications The VIP-aware proxy will provide users with a clean, accessible web page, save them time when screen readers examine content related to their preferences and save them money when unnecessary content is not downloaded. Originality/value The VIP-aware proxy presented in this paper is the first of its kind targeting VIP.

An Heighten PSO-K-harmonic Mean Based Pattern Recognition in User Navigation

The website navigation patterns can be searched and analyzed with the introduction of the new methodology. The user navigation path is stored as a sequence of URL categories in web server. The approaches followed are to separate the users and sessions from the web log files and acquiring the necessary patterns for web personalization. The clustering concept is used for grouping the necessary patterns in separate groups. The approaches used for clustering of navigation patterns are done with improvised particle swarm optimization technique which divides users depends on the order in which they request web pages. This approach mines the web log files which are resultant from the web users while interacting with web pages for a particular period of web sessions. The work carried with an optimized method of particle swarm optimization-K-Harmonic means to cluster the similar users based on their navigation pattern. Particle swarm optimization-K-Harmonic method is used to discover or extract user

An Execution-flow Based Method for Detecting Cross-Site Scripting of Ajax Applications

We present an execution-flow analysis for JavaScript programs running in a web browser to prevent Cross-site Scripting (XSS) attacks. We construct finite-state automata (FSA) to model the client-side behavior of Ajax applications under normal execution. Our system is deployed in proxy mode. The proxy analyzes the execution flow of client-side JavaScript before the requested web pages arrive at the browser to prevent potentially malicious scripts, which do not conform to the FSA. We evaluate our technique against several real-world applications and the result shows that it protects against a variety of XSS attacks with an acceptable performance overhead.

Analysis of a Cyclic Multicast Proxy Server Architecture

The exponential growths of the World Wide Web (WWW) users have made the deployment of proxy servers popular on a network with limited resources. WWW clients perceive better response time, improved performance and speed when response to requested pages are served from the cache of a proxy server, resulting in faster response times after the first document fetch. This work proposes cyclic multicast as a scalable technique for improving proxy server perfo rmance for next generation networks. The proposed system uses a cyclic multicast engine for the deliv ery of popular web pages from the proxy server cach e to increasingly large users under limited server capac ity and network resources. The cyclic multicast tec hnique would be more efficient for the delivery of highly requested web pages from the cache to large number of receivers. We describe the operation of the cyclic multicast proxy server and characterized the gains in performance.

Proposte per facilitare accesso e scambio via internet delle informazioni dei piani di assestamento forestale

A wide database including 916 forest management plans of the Trentino Region (North-eastern Italy) has been made available on-line through a server-side web application implemented and developed ad hoc to promote and encourage knowledge transfer of scientific information in the forestry sector. The application developed may generate on request web pages conveying several kind of information, including cartography, alphanumerical data and some queries. We used free software so as to produce a cheap and flexible tool that could be easily implemented by any forest administration. Data are encoded in XML files which we propose as possible standard for data exchange in Italian Forestry.

Model-Based Clustering and Visualization of Navigation Patterns on a Web Site

We present a new methodology for exploring and analyzing navigation patterns on a web site. The patterns that can be analyzed consist of sequences of URL categories traversed by users. In our approach, we first partition site users into clusters such that users with similar navigation paths through the site are placed into the same cluster. Then, for each cluster, we display these paths for users within that cluster. The clustering approach we employ is model-based (as opposed to distance-based) and partitions users according to the order in which they request web pages. In particular, we cluster users by learning a mixture of first-order Markov models using the Expectation-Maximization algorithm. The runtime of our algorithm scales linearly with the number of clusters and with the size of the datas and our implementation easily handles hundreds of thousands of user sessions in memory. In the paper, we describe the details of our method and a visualization tool based on it called WebCANVAS. We illustrate the use of our approach on user-traffic data from msnbc.com.

Digestor: device-independent access to the World Wide Web

Digestor is a software system which automatically re-authors arbitrary documents from the world-wide web to display appropriately on small screen devices such as PDAs and cellular phones, providing device-independent access to the web. Digestor is implemented as an HTTP proxy which dynamically re-authors requested web pages using a heuristic planning algorithm and a set of structural page transformations to achieve the best looking document for a given display size.