OpenRaiser/Intern-Atlas huggingface dataset:
Adaptive ranking of web pages
Authors: Ah Chung Tsoi, Gianni Morini, Franco Scarselli, Markus Hagenbuchner, Marco Maggini
Venue: WWW
Year: 2003

In this paper, we consider the possibility of altering the PageRank of web pages, from an administrator's point of view, through the modification of the PageRank equation. It is shown that this problem can be solved using the traditional quadratic programming techniques. In addition, it is shown that the number of parameters can be reduced by clustering web pages together through simple clustering techniques. This problem can be formulated and solved using quadratic programming techniques. It is demonstrated experimentally on a relatively large web data set, viz., the WT10G, that it is possible to modify the PageRanks of the web pages through the proposed method using a set of linear constraints. It is also shown that the PageRank of other pages may be affected; and that the quality of the result depends on the clustering technique used. It is shown that our results compared well with those obtained by a HITS based method.
On admission control for profit maximization of networked service providers
Authors: Akshat Verma, Sugata Ghosal
Venue: WWW
Year: 2003

Variability and diverseness among incoming requests to a service hosted on a finite capacity resource necessitates sophisticated request admission control techniques for providing guaranteed quality of service (QoS). We propose in this paper a service time based online admission control methodology for maximizing profits of a service provider. The proposed methodology chooses a subset of incoming requests such that the revenue of the provider is maximized. Admission control decision in our proposed system is based upon an estimate of the service time of the request, QoS bounds, prediction of arrivals and service times of requests to come in the short-term future, and rewards associated with servicing a request within its QoS bounds. Effectiveness of the proposed admission control methodology is demonstrated using experiments with a content-based messaging middleware service.
Peer-to-peer architecture for content-based music retrieval on acoustic data
Authors: Cheng Yang
Venue: WWW
Year: 2003

In traditional peer-to-peer search networks, operations focus on properly labeled files such as music or video, and the actual search is often limited to text tags. The explosive growth of available multimedia documents in recent years calls for more flexible search capabilities, namely search by content. Most content-based search algorithms are computationally intensive, making them inappropriate for a peer-to-peer environment. In this paper, we discuss a content-based music retrieval algorithm that can be decomposed and parallelized efficiently. We present a peer-to-peer architecture for such a system that makes use of spare resources among subscribers, with protocols that dynamically redistribute load in order to maximize throughput and minimize inconvenience to subscribers. Our framework can be extended beyond the music retrieval domain and adapted to other scenarios where resource pooling is desired, as long as the underlying algorithm satisfies certain conditions.
Web browsing performance of wireless thin-client computing
Authors: S. Jae Yang, Jason Nieh, Shilpa Krishnappa, Aparna Mohla, Mahdi Sajjadpour
Venue: WWW
Year: 2003

Web applications are becoming increasingly popular for mobile wireless systems. However, wireless networks can have high packet loss rates, which can degrade web browsing performance on wireless systems. An alternative approach is wireless thin-client computing, in which the web browser runs on a remote thin server with a more reliable wired connection to the Internet. A mobile client then maintains a connection to the thin server to receive display updates over the lossy wireless network. To assess the viability of this thin-client approach, we compare the web browsing performance of thin clients against fat clients that run the web browser locally in lossy wireless networks. Our results show that thin clients can operate quite effectively over lossy networks. Compared to fat clients running web browsers locally, our results show surprisingly that thin clients can be faster and more resilient on web applications over lossy wireless LANs despite having to send more data over the network. We characterize and analyze different design choices in various thin-client systems and explain why these approaches can yield superior web browsing performance in lossy wireless networks.
A foundation for tool based mobility support for visually impaired web users
Authors: Yeliz Yesilada, Robert Stevens, Carole A. Goble
Venue: WWW
Year: 2003

Users make journeys through the Web. Web travel encompasses the tasks of orientation and navigation, the environment and the purpose of the journey. The ease of travel, its mobility, varies from page to page and site to site. For visually impaired users, in particular, mobility is reduced; the objects that support travel are inaccessible or missing altogether. Web development tools need to include support to increase mobility. We present a framework for finding and classifying travel objects within Web pages. The evaluation carried out has shown that this framework supports a systematic and consistent method for assessing travel upon the Web. We propose that such a framework can provide the foundation for a semi-automated tool for the support of travel upon the Web.
Evaluation of edge caching/offloading for dynamic content delivery
Authors: Chun Yuan, Yu Chen, Zheng Zhang
Venue: WWW
Year: 2003

Abstract—As dynamic content becomes increasingly dominant, it becomes an important research topic as how the edge resources such as client-side proxies, which are otherwise underutilized for such content, can be put into use. However, it is unclear what will be the best strategy, and the design/deployment trade offs lie therein. In this paper, using one representative e-commerce benchmark, we report our experience of an extensive investigation of different offloading and caching options. Our results point out that, while great benefits can be reached in general, advanced offloading strategies can be overly complex and even counterproductive. In contrast, simple augmentation at proxies to enable fragment caching and page composition achieves most of the benefit without compromising important considerations such as security. We also present Proxy+ architecture which supports such capabilities for existing Web applications with minimal reengineering effort. Index Terms—Edge caching, offloading, dynamic content, fragment caching, page composition. 1
Similarity measure and instance selection for collaborative filtering
Authors: Chun Zeng, Chun-Xiao Xing, Li-Zhu Zhou
Venue: WWW
Year: 2003

Collaborative filtering has been very successful in both research and applications such as information filtering and E-commerce. The k-Nearest Neighbor (KNN) method is a popular way for its realization. Its key technique is to find k nearest neighbors for a given user to predict his interests. However, this method suffers from two fundamental problems: sparsity and scalability. In this paper, we present our solutions for these two problems. We adopt two techniques: a matrix conversion method for similarity measure and an instance selection method. And then we present an improved collaborative filtering algorithm based on these two methods. In contrast with existing collaborative algorithms, our method shows its satisfactory accuracy and performance.
Outlink estimation for pagerank computation under missing data
Authors: Sreangsu Acharyya, Joydeep Ghosh
Venue: WWW
Year: 2004

The enormity and rapid growth of the web-graph forces quantities such as its pagerank tobe computed under missing information consisting of outlinks of pages that have not yet been crawled. This paper examines the role played by the size and distribution of this missing data in determining the accuracy of the computed pagerank, focusing on questions such as (i) the accuracy of pageranks under missing information, (ii) the size at which a crawl process may be aborted while still ensuring reasonable accuracy of pageranks, and (iii) algorithms to estimate pageranks under such missing information. Thefirst couple of questions are addressed on the basis of certain simple bounds relating the expected distance between the true and computed pageranks and the size of the missing data. The third question is explored by devising algorithms to predict the pageranks when full information is not available. A key feature of the "dangling link estimation" and "clustered link estimation" algorithms proposed is that, they do not need to run the pagerank iteration afresh once the outlinks have been estimated.
Reactive rules inference from dynamic dependency models
Authors: Asaf Adi, Opher Etzion, Dagan Gilat, Royi Ronen, Guy Sharon, Inna Skarbovsky
Venue: WWW
Year: 2004

Defining dependency models is sometimes an easier, more intuitive way for ontology representation than defining reactive rules directly, as it provides a higher level of abstraction. We will shortly introduce the ADI (Active Dependency Integration) model capabilities, emphasizing new developments: 1. Support of automatic dependencies instantiation from an abstract definition that expresses a general dependency in the ontology, namely a "template". 2. Inference of rules for dynamic dependency models where dependencies and entities may be inserted deleted and updated. We use the eTrade example in order to exemplify those capabilities.
Business objective based resource management
Authors: Sarel Aiber, Dagan Gilat, Ariel Landau, Natalia Razinkov, Aviad Sela, Segev Wasserkrug
Venue: WWW
Year: 2004

Enterprises today wish to manage their IT resources so as to optimize business objectives, such as income, rather than IT metrics, such as response times. Therefore, we introduce a new paradigm, which focuses on such business objective oriented resource management. Additionally, we define a general simulation-based autonomous process enabling such optimizations, and describe a case study, demonstrating the usefulness of such a process.
Small world peer networks in distributed web search
Authors: Ruj Akavipat, Le-Shin Wu, Filippo Menczer
Venue: WWW
Year: 2004

In ongoing research, a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines. Here we introduce a local adaptive routing algorithm used to dynamically change the topology of the peer network based on a simple learning scheme driven by query response interactions among neighbors. We test the algorithm via simulations with 70 model users based on actual Web crawls. We find that the network topology rapidly converges from a random network to a small world network, with emerging clusters that match the user communities with shared interests.
A web personalization system based on web usage mining techniques
Authors: Massimiliano Albanese, Antonio Picariello, Carlo Sansone, Lucio Sansone
Venue: WWW
Year: 2004

In the past few years, web usage mining techniques have grown rapidly together with the explosive growth of the web, both in the research and commercial areas. In this work we present a Web mining strategy for Web personalization based on a novel pattern recognition strategy which analyzes and classifies both static and dynamic features. The results of experiments on the data from a large commercial web site are presented to show the effectiveness of the proposed system.
A community-aware search engine
Authors: Rodrigo B. Almeida, Virgílio A. F. Almeida
Venue: WWW
Year: 2004

Current search technologies work in &quot;one size fits all&quot; fashion. Therefore, the answer to a query is independent of specific user information need. In this paper, we describe a novel ranking technique for personalized search services that combines content-based and community-based evidences. The community-based information is used in order to provide context for queries and is influenced by the current interaction of the user with the service. Our algorithm is evaluated using data derived from an actual service available on the Web, an online bookstore. We show that the quality of content-based ranking strategies can be improved by the use of community information as another evidential source of relevance. In our experiments, the improvements reach up to 48% in terms of average precision.
Texquery: a full-text search extension to xquery
Authors: Sihem Amer-Yahia, Chavdar Botev, Jayavel Shanmugasundaram
Venue: WWW
Year: 2004

One of the key benefits of XML is its ability to represent a mix of structured and unstructured (text) data. Although current XML query languages such as XPath and XQuery can express rich queries over structured data, they can only express very rudimentary queries over text data. We thus propose TeXQuery, which is a powerful full-text search extension to XQuery. TeXQuery provides a rich set of fully composable full-text search primitives,such as Boolean connectives, phrase matching, proximity distance, stemming and thesauri. TeXQuery also enables users to seamlessly query over both structured and text data by embedding TeXQuery primitives in XQuery, and vice versa. Finally, TeXQuery supports a flexible scoring construct that can be used toscore query results based on full-text predicates. TeXQuery is the precursor ofthe full-text language extensions to XPath 2.0 and XQuery 1.0 currently being developed by the W3C.
Can I find what I'm looking for?
Authors: Patrizia Andronico, Marina Buzzi, Barbara Leporini
Venue: WWW
Year: 2004

In recent years, search engine research has grown rapidly in areas such as algorithms, strategies and architecture, increasing both effectiveness and quality of results. However, a very important aspect that is often neglected is the user interface. In this work we analyzed the interfaces of several popular search tools from the user's point of view, and collected individual feedback in order to determine whether it is possible to improve interface design.
A framework for the server-side management of conversations with web services
Authors: Liliana Ardissono, Davide Cardinio, Giovanna Petrone, Marino Segnan
Venue: WWW
Year: 2004

The emerging standards for the publication of Web Services are focused on the specification of the static interfaces of the operations to be invoked, or on the service composition. Few efforts have been made to specify the interaction between a Web Service and the individual consumer, although this aspect is essential to the successful service execution. In fact, while “one-shot ” services may be invoked in a straightforward way, the invocation of services requiring complex interactions, where multiple messages are needed to complete the service, depends on the fact that the consumer respects the business logic of the Web Service. In this paper, we propose a framework for the server-side management of the interaction between a Web Service and its consumers. In our approach, the Web Service is in charge of assisting the consumer during the service invocation, by managing the interaction context and instructing the consumer about the operations that can be invoked and their actual parameters, at each step of the conversation. Our framework is based on the exchange of SOAP messages specifying the invocation of Java-based operations. Moreover, in order to support the interoperability with other software environments, the conversation flow specification is exported to a WSDL format that enables heterogeneous consumers to invoke the Web Service in a seamless way.
Best bets: thousands of queries in search of a client
Authors: Giuseppe Attardi, Andrea Esuli, Maria Simi
Venue: WWW
Year: 2004

A number of applications require selecting targets for specific contents on the basis of criteria defined by the contents providers rather than selecting documents in response to user queries, as in ordinary information retrieval. We present a class of retrieval systems, called Best Bets, that generalize Information Filtering and encompass a variety of applications including editorial suggestions, promotional campaigns and targeted advertising, such as Google AdWords™. We developed techniques for implementing Best Bets systems addressing performance issues for large scale deployment as efficient query search, incremental updates and dynamic ranking.
Web engineering with the visual software circuit board
Authors: Hovhannes Avoyan, Barry Levine
Venue: WWW
Year: 2004

The Visual Software Circuit Board (VSCB) platform supports a component based development methodology towards the development of software systems. The circuit board design techniques and methodologies have evolved for electronic device and component engineering for decades. The circuit board approach, now applied for software systems and applications, makes the component based development process easy to visualize and comprehend. This paper describes the VSCB based design methodology with a specific focus on usage of VSCB for web application engineering.
Online feedback by tests and reporting for elearning and certification programs
Authors: Dirk Bade, Georg Nüssel, Gerd Wilts
Venue: WWW
Year: 2004

The evaluation of eLearning success is an indispensable business requirement of education programs: the easy registration of `visits' to eLearning websites is, however, not sufficient in most cases. Additional metrics from authenticated logins and reports of learning activity and success - as obtained from specific online tests ' are required. The aim is to document the acceptance, progress and return of investment (ROI) of eLearning programs, and set up additional training well tailored to the needs of a specific learning community. An example from a corporate certification program proves the applicability of the proposed processes.
Web page ranking using link attributes
Authors: Ricardo A. Baeza-Yates, Emilio Davis
Venue: WWW
Year: 2004

We present a variant of PageRank, WLRank, that considers different Web page attributes to give more weight to some links. Our evaluation shows that the precision of the answers can improve significantly.
Through different eyes: assessing multiple conceptual views for querying web services
Authors: Wolf-Tilo Balke, Matthias Wagner
Venue: WWW
Year: 2004

We present enhancements for UDDI / DAML-S registries allow-ing cooperative discovery and selection of Web services with a focus on personalization. To find the most useful service in each instance of a request, not only explicit parameters of the request have to be matched against the service offers. Also user preferences or implicit assumptions of a user with respect to common knowledge in a certain domain have to be considered to improve the quality of service provisioning. In the area of Web services the notion of service ontologies together with cooperative answering techniques can take a lot of this responsibility. However, without quality assessments for the relaxation of service requests and queries a personalized service discovery and selection is virtually impossible. This paper focuses on assessing the semantic meaning of query relaxation plans over multiple conceptual views of the service ontology, each one representing a soft query constraint of the user request. Our focus is on the question what constitutes a minimum amount of necessary relaxation to answer each individual request in a cooperative manner. Incorporating such assessments as early as possible we propose to integrate ontology-based discovery directly into UDDI directories or query facilities in service provisioning portals. Using the quality assessments presented here, this integration promises to propel today's Web services towards an intuitive user-centered service provisioning.
An outsider's view on "topic-oriented blogging"
Authors: Judit Bar-Ilan
Venue: WWW
Year: 2004

The number of Web blogs is growing extremely fast, thus this phenomenon cannot be ignored. This paper discusses the issue through monitoring a set of blogs for a two months period in September-October 2003 and characterizing these blogs based on descriptive statistics and content analysis.
Sic transit gloria telae: towards an understanding of the web's decay
Authors: Ziv Bar-Yossef, Andrei Z. Broder, Ravi Kumar, Andrew Tomkins
Venue: WWW
Year: 2004

The rapid growth of the web has been noted and tracked extensively. Recent studies have however documented the dual phenomenon: web pages have small half lives, and thus the web exhibits rapid death as well. Consequently, page creators are faced with an increasingly burdensome task of keeping links up-to-date, and many are falling behind. In addition to just individual pages, collections of pages or even entire neighborhoods of the web exhibit significant decay, rendering them less effective as information resources. Such neighborhoods are identified only by frustrated searchers, seeking a way out of these stale neighborhoods, back to more up-to-date sections of the web; measuring the decay of a page purely on the basis of dead links on the page is too naive to reflect this frustration. In this paper we formalize a strong notion of a decay measure and present algorithms for computing it efficiently. We explore this measure by presenting a number of validations, and use it to identify interesting artifacts on today's web. We then describe a number of applications of such a measure to search engines, web page maintainers, ontologists, and individual users.
OpenMVC: a non-proprietry component-based framework for web applications
Authors: Ronan Barrett, Sarah Jane Delany
Venue: WWW
Year: 2004

The lack of standardised approaches in the development of web-based systems is an ongoing issue for the developers of commercial software. To address this issue we proposes a hybrid development framework for web-based solutions that combines much of the best attributes of existing frameworks but utilises open, standardised W3C technologies where possible. This framework called openMVC is an evolution of the Model-View-Controller (MVC) pattern. An implementation of openMVC has been built over a 5-tier architecture using Java and .NET.
An evaluation of binary XML encoding optimizations for fast stream based xml processing
Authors: Roberto J. Bayardo Jr., Daniel Gruhl, Vanja Josifovski, Jussi Myllymaki
Venue: WWW
Year: 2004

This paper provides an objective evaluation of the performance impacts of binary XML encodings, using a fast stream-based XQuery processor as our representative application. Instead of proposing one binary format and comparing it against standard XML parsers, we investigate the individual effects of several binary encoding techniques that are shared by many proposals. Our goal is to provide a deeper understanding of the performance impacts of binary XML encodings in order to clarify the ongoing and often contentious debate over their merits, particularly in the domain of high performance XML stream processing.
Parsing owl dl: trees or triples?
Authors: Sean Bechhofer, Jeremy J. Carroll
Venue: WWW
Year: 2004

The Web Ontology Language (OWL) defines three classes of documents: Lite, DL, and Full. All RDF/XML documents are OWL Full documents, some OWL Full documents are also OWL DL documents, and some OWL DL documents are also OWL Lite documents. This paper discusses parsing and species recognition -- that is the process of determining whether a given document falls into the OWL Lite, DL or Full class. Wedescribe two alternative approaches to this task, one based on abstract syntax trees, the other on RDF triples, and compare their key characteristics.