OpenRaiser/Intern-Atlas huggingface dataset:
GlobeDB: autonomic data replication for web applications
Authors: Swaminathan Sivasubramanian, Gustavo Alonso, Guillaume Pierre, Maarten van Steen
Venue: WWW
Year: 2005

We present GlobeDB, a system for hosting Web applications that performs autonomic replication of application data. GlobeDB offers data-intensive Web applications the benefits of low access latencies and reduced update traffic. The major distinction in our system compared to existing edge computing infrastructures is that the process of distribution and replication of application data is handled by the system automatically with very little manual administration. We show that significant performance gains can be obtained this way. Performance evaluations with the TPC-W benchmark over an emulated wide-area network show that GlobeDB reduces latencies by a factor of 4 compared to non-replicated systems and reduces update traffic by a factor of 6 compared to fully replicated systems.
Multi-step media adaptation: implementation of a knowledge-based engine
Authors: Peter Soetens, Matthias De Geyter
Venue: WWW
Year: 2005

Continuing changes in the domains of consumer devices and multimedia formats demand for a new approach to media adaptation. The publication of customized content on a device requires an automatic adaptation engine that takes into account the specifications of both the device and the material to be published. These specifications can be expressed using a single domain ontology that describes the concepts of the media adaptation domain. In this document, we provide insight into the implementation of an adaptation engine that exploits this domain knowledge. We explain how this engine, through the use of description matching and Semantic Web Services, composes a chain of adaptation services which will alter the original content to the needs of the target device.
WebRogue: virtual presence in web sites
Authors: Alessandro Soro, Ivan Marcialis, Davide Carboni, Gavino Paddeu
Venue: WWW
Year: 2005

WebRogue is an application for virtual presence over the Web. It provides the Web Browser with a chat subwindow that allows users connected to the same Web site to meet, share opinions and cooperate in a totally free, non moderated and uncensored environment. Each time the user loads a Web page in the Web Browser, WebRogue opens a discussion channel in a centralized server application, that is completely decoupled from the Web server, using the URL of the Web site as a key. Thus whenever a new page is loaded the user can see who is connected, as if entering a physical site. Interactivity is supported by means of two type of commands: comunication commands allow synchronous interaction as with chat or instant messaging software; Social commands allow cooperation: group surfing, exchange of visit-cards and wait in line.
On business activity modeling using grammars
Authors: Savitha Srinivasan, Arnon Amir, Prasad Deshpande, Vladimir Zbarsky
Venue: WWW
Year: 2005

Web based applications offer a mainstream channel for businesses to manage their activities. We model such business activity in a grammar-based framework. The Backus Naur form notation is used to represent the syntax of a regular grammar corresponding to Web log patterns of interest. Then, a deterministic finite state machine is used to parse Web logs against the grammar. Detected tasks are associated with metadata such as time taken to perform the activity, and aggregated along relevant corporate dimensions.
Application networking on peer-to-peer networks
Authors: Mu Su, Chi-Hung Chi
Venue: WWW
Year: 2005

This paper proposes the AN.P2P architecture to facilitate efficient peer-to-peer content delivery with heterogeneous presentation requirements. In general, the AN.P2P enables a peer to deliver the original content objects and an associated workflow to other peers. The workflow is composed of content adaptation tasks. Hence, the recipient can reuse the original object to generate appropriate presentations for other peers.
Finding group shilling in recommendation system
Authors: Xue-Feng Su, Hua-Jun Zeng, Zheng Chen
Venue: WWW
Year: 2005

In the age of information explosion, recommendation system has been proved effective to cope with information overload in e-commerce area. However, unscrupulous producers shill the systems in many ways to make profit, and it makes the system imprecise and unreliable in a long term. Among many shilling behaviors, a new form of attack, called group shilling, appears and does great harm to the system. Because group shilling users are now well organized and become more hidden among various normal users, it is hard to find them by traditional methods. However, these group shilling users are similar to some extent, for they both shill the target items. We bring out a similarity spreading algorithm to find these group shilling users and protect recommendation system from unfair ratings. In our algorithm, we try to find these cunning group shilling users through propagating similarities from items to users iteratively. The experiment shows our similarity spreading algorithm improves the precision of the system and provides the system a reliable protection.
Interactive web-wrapper construction for extracting relational information from web documents
Authors: Tsuyoshi Sugibuchi, Yuzuru Tanaka
Venue: WWW
Year: 2005

In this paper, we propose a new user interface to interactively specify Web wrappers to extract relational information from Web documents. In this study, we focused on improving user’s trialand-error repetitions for constructing a wrapper. Our approach is a combination of a light-weight wrapper construction method and the dynamic previewing interface which quickly previews how generated wrapper works. We adopted a simple algorithm which can construct a Web wrapper from given extraction examples in less than 100 milliseconds. By using the algorithm, our system dynamically generates a new wrapper from a stream of user’s mouse events for specifying extraction examples, and immediately updates a preview result that shows how the generated wrapper extracts HTML nodes from a source Web document. Through this animated display, a user can make a lot of wrapper construction trials with various different combinations of extraction examples by only moving a mouse on the Web document, and reach a good set of examples to obtain an intended wrapper in a short time.
Transforming web contents into a storybook with dialogues and animations
Authors: Kaoru Sumi, Katsumi Tanaka
Venue: WWW
Year: 2005

This paper describes a medium, called Interactive e-Hon, for helping children to understand contents from the Web. It works by transforming electronic contents into an easily understandable storybook world. In this world, easy-to-understand contents are generated by creating 3D animations that include contents and metaphors, and by using a child-parent model with dialogue expression and a question-answering style comprehensible to children.
Can link analysis tell us about web traffic?
Authors: Marcin Sydow
Venue: WWW
Year: 2005

In this paper we measure correlation between link analysis characteristics for Web pages such as in- and out-degree, PageRank and RBS with those obtained from real Web traffic analysis. Measurements made on real data from the Polish Web show that PageRank is observably but not strongly correlated with actual visits made by Web users to Web pages and that our RBS algorithm[2] is more correlated with traffic data than PageRank in some cases.
An adaptive, fast, and safe XML parser based on byte sequences memorization
Authors: Toshiro Takase, Hisashi Miyashita, Toyotaro Suzumura, Michiaki Tatsubori
Venue: WWW
Year: 2005

XML (Extensible Markup Language) processing can incur significant runtime overhead in XML-based infrastructural middleware such as Web service application servers. This paper proposes a novel mechanism for efficiently processing similar XML documents. Given a new XML document as a byte sequence, the XML parser proposed in this paper normally avoids syntactic analysis but simply matches the document with previously processed ones, reusing those results. Our parser is adaptive since it partially parses and then remembers XML document fragments that it has not met before. Moreover, it processes safely since its partial parsing correctly checks the well-formedness of documents. Our implementation of the proposed parser complies with the JSR 63 standard of the Java API for XML Processing (JAXP) 1.1 specification. We evaluated Deltarser performance with messages using Google Web services. Comparing to Piccolo (and Apache Xerces), it effectively parses 35 % (106%) faster in a server-side use-case scenario, and 73 % (126%) faster in a client-side use-case scenario.
A multilingual usage consultation tool based on internet searching: more than a search engine, less than QA
Authors: Kumiko Tanaka-Ishii, Hiroshi Nakagawa
Venue: WWW
Year: 2005

We present a usage consultation tool, based on Internet searching, for language learners. When a user enters a string of words for which he wants to find usages, the system sends this string as a query to a search engine and obtains search results about the string. The usages are extracted by performing statistical analysis on snippets and then fed back to the user.Unlike existing tools, this usage consultation tool is multi-lingual, so that usages can be obtained even in a language for which there are no well-established analytical methods. Our evaluation has revealed that usages can be obtained more effectively than by only using a search engine directly. Also, we have found that the resulting usage does not depend on the search engine for a prominent usage when the amount of data downloaded from the search engine is increased.
Multiple strategies detection in ontology mapping
Authors: Jie Tang, Yong Liang, Zi Li
Venue: WWW
Year: 2005

Ontology mapping is the task of finding semantic relationships between entities (i.e. concept, attribute and relation) of two ontologies. In the existing literatures, many (semi-)automatic approaches have found considerable interest by combining several mapping strategies (namely multi-strategy mapping). However, experiments show that multi-strategy based mapping does not always outperform its single-strategy counterpart. We here mainly consider the following questions: For a new, unseen mapping task, should one use a multi-strategy or a single-strategy? And if the task is suitable for multi-strategy, then which strategies should be selected in the combined scenario? This paper proposes an approach of multiple strategies detection for ontology mapping. The results obtained so far show that multi-strategy detection improves both on precision and recall significantly.
Analyzing web page headings considering various presentation
Authors: Yushin Tatsumi, Toshiyuki Asahi
Venue: WWW
Year: 2005

Exploiting document structure can solve the usability problem when browsing web pages designed for PCs with non-PC terminals. For example, by exploiting headings among document structure and showing them selectively within a display, users can easily grasp a page's overview. In this paper, as a basic part of document structure analysis, we propose a heading analysis method for web pages considering various presentation. Results of evaluation experiments confirmed that our proposed method could extract many headings that could not be extracted by using HTML element names.
A clustering method for news articles retrieval system
Authors: Hiroyuki Toda, Ryoji Kataoka
Venue: WWW
Year: 2005

Organizing the results of a search facilitates the user in overviewing the information returned. We regard the clustering task as the tasks of making labels for a list of items and we focus on news articles and propose a clustering method that uses named entity extraction.
Technical challenges in exploiting the web as a business resource
Authors: Andrew Tomkins
Venue: WWW
Year: 2005

In this talk, I'll describe some recent indicators suggesting that businesses are on the cusp of operational exploitation of the web as a decision support resource. From consumer research and purchasing behavior to enterprise brand tracking, intelligence gathering, and advertising, the web is suddenly on everybody's mind - not as an exciting future possibility, but as an exploitable resource. I'll describe some technological approaches to employing this resource, talk about what's possible today, and describe some challenges for the future. As a running example, I'll cover IBM's WebFountain system: its architecture, analytical model, and applications.
Using OWL for querying an XML/RDF syntax
Authors: Rubén Tous, Jaime Delgado
Venue: WWW
Year: 2005

Some recent initiatives try to take profit from RDF to make XML documents interoperate at the semantic level. Ontologies are used to establish semantic connections among XML languages, and some mechanisms have been defined to query them with natural XML query languages like XPath and XML Query. Generally structure-mapping approaches define a simple translation between trivial XPath expressions and some RDF query language like RDQL; however some XPath constructs cannot be covered in a structure-mapping strategy. In contrast, our work takes the model-mapping approach, respectful with node order, that allows mapping all XPath axis. The obtained XPath implementation has the properties of schema-awareness and IDREF-awareness, so it can be used to exploit inheritance hierarchies defined in one or more XML schemas.
DoCoMo's challenge towards new mobile services
Authors: Kiyoyuki Tsujimura
Venue: WWW
Year: 2005

NTT DoCoMo, the provider of "i-mode" mobile Internet service, which accommodates over 40 million subscribers in Japan, is now working to create new types of mobile communications services featuring visual content and contactless IC technology.
Signing individual fragments of an RDF graph
Authors: Giovanni Tummarello, Christian Morbidoni, Paolo Puliti, Francesco Piazza
Venue: WWW
Year: 2005

Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statements. Groups of statements signed with this methodology can be safely inserted into any existing triple store without the loss of provenance information since only standard RDF semantics and constructs are used. This methodology has been implemented and is both available as open source library and deployed in a SW P2P project.
Cataclysm: policing extreme overloads in internet applications
Authors: Bhuvan Urgaonkar, Prashant J. Shenoy
Venue: WWW
Year: 2005

In this paper we present the Cataclysm server platform for handling extreme overloads in hosted Internet applications. The primary contribution of our work is to develop a low overhead, highly scalable admission control technique for Internet applications. Cataclysm provides several desirable features, such as guarantees on response time by conducting accurate size-based admission control, revenue maximization at multiple time-scales via preferential admission of important requests and dynamic capacity provisioning, and the ability to be operational even under extreme overloads. Cataclysm can transparently trade-off the accuracy of its decision making with the intensity of the workload allowing it to handle incoming rates of several tens of thousands of requests/second. We implement a prototype Cataclysm hosting platform on a Linux cluster and demonstrate the benefits of our integrated approach using a variety of workloads.
Answering order-based queries over XML data
Authors: Zografoula Vagena, Nick Koudas, Divesh Srivastava, Vassilis J. Tsotras
Venue: WWW
Year: 2005

Order-based queries over XML data include XPath navigation axes such as following-sibling and following. In this paper, we present holistic algorithms that evaluate such order-based queries. An experimental comparison with previous approaches shows the performance benefits of our algorithms.
Automatic text processing to enhance product search for on-line shopping
Authors: Gilles Vandelle
Venue: WWW
Year: 2005

The growing eCommerce business requires an advanced way of searching for products. Buyers today are not only using the web to accomplish transactions but also to search for and select products that fit their needs. The products are now global but the users want a site that uses their language when shopping. This talk will describe how Kelkoo built a solution used across. The multiple European languages have been addressed with a simple linguistic approach combined with machine learning technologies. In this talk we will put the emphasis on the use of machine learning to address local diversity.
A language for expressing user-context preferences in the web
Authors: Juan Ignacio Vázquez, Diego López de Ipiña
Venue: WWW
Year: 2005

In this paper, we introduce WPML (WebProfiles Markup Language) for expressing user-context preferences information in the Web. Using WPML a service provider can negotiate and obtain user-related information to personalise service experience without explicit manual configuration by the user, while preserving his privacy using P3P.
Ontology-based learning content repurposing
Authors: Katrien Verbert, Dragan Gasevic, Jelena Jovanovic, Erik Duval
Venue: WWW
Year: 2005

This paper investigates basic research issues that need to be addressed for developing an architecture that enables repurposing of learning objects in a flexible way. Currently, there are a number of Learning Object Content Models (e.g. the SCORM Content Aggregation Model) that define learning objects and their components in a more or less precise way. However, these models do not allow repurposing of fine-grained components (sentences, images). We developed an ontology-based solution for content repurposing. The ontology is a solid basis for an architecture that will enable on-the-fly access to learning object components and that will facilitate repurposing these components.
TruRank: taking PageRank to the limit
Authors: Sebastiano Vigna
Venue: WWW
Year: 2005

PageRank is defined as the stationary state of a Markov chain depending on a damping factor α that spreads uniformly part of the rank. The choice of α is eminently empirical, and in most cases the original suggestion α=0.85 by Brin and Page is still used. It is common belief that values of α closer to 1 give a "truer to the web" PageRank, but a small α accelerates convergence. Recently, however, it has been shown that when α=1 all pages in the core component are very likely to have rank 0 [1]. This behaviour makes it difficult to understand PageRank when α≈1, as it converges to a meaningless value for most pages. We propose a simple and natural modification to the standard preprocessing performed on the adjacency matrix of the graph, resulting in a ranking scheme we call TruRank. TruRank ranks the web with principles almost identical to PageRank, but it gives meaningful values also when α☰ 1.
A fast XPATH evaluation technique with the facility of updates
Authors: Ashish Virmani, Suchit Agarwal, Rahul Thathoo, Shekhar Suman, Sudip Sanyal
Venue: WWW
Year: 2005

This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and also provide for updates without the need for the entire document being re-indexed in the RDBMS. We introduce a new labeling schema called the &quot;Z-Label&quot; for efficiently processing XPATH queries involving child and descendant axes.The use of &quot;Z-Label&quot; coupled with the indexing schema provides for smooth updates in the XML document.
An abuse-free fair contract signing protocol based on the RSA signature
Authors: Guilin Wang
Venue: WWW
Year: 2005

A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a fair way, so that either each of them obtains the other's signature, or neither party does. Based on the RSA signature scheme, a new digital contract signing protocol is proposed in this paper. Like the existing RSA-based solutions for the same problem, our protocol is not only fair, but also optimistic, since the third trusted party is involved only in the situations where one party is cheating or the communication channel is interrupted. Furthermore, the proposed protocol satisfies a new property, i.e., it is abuse-free. That is, if the protocol is executed unsuccessfully, none of the two parties can show the validity of intermediate results to others. Technical details are provided to analyze the security and performance of the proposed protocol. In summary, we present the first abuse-free fair contract signing protocol based on the RSA signature, and show that it is both secure and efficient.
Verify Feature Models using protegeowl
Authors: Hai H. Wang, Yuan-Fang Li, Jing Sun, Hongyu Zhang
Venue: WWW
Year: 2005

Feature models are widely used in domain engineering to capture common and variant features among systems in a particular domain. However, the lack of a widely-adopted means of precisely representing and formally verifying feature models has hindered the development of this area. This paper presents an approach to modeling and verifying feature diagrams using Semantic Web ontologies.
Web resource geographic location classification and detection
Authors: Chuang Wang, Xing Xie, Lee Wang, Yansheng Lu, Wei-Ying Ma
Venue: WWW
Year: 2005

Rapid pervasion of the web into users' daily lives has put much importance on capturing location-specific information on the web, due to the fact that most human activities occur locally around where a user is located. This is especially true in the increasingly popular mobile and local search environments. Thus, how to correctly and effectively detect locations from web resources has become a key challenge to location-based web applications. In this paper, we first explicitly distinguish the locations of web resources into three types to cater to different application needs: 1) provider location; 2) content location; and 3) serving location. Then we describe a unified system that computes each of the three locations, employing a set of algorithms and different geographic sources.
MemoSpace: a visualization tool for web navigation
Authors: Jacqueline Waniek, Holger Langner, Falk Schmidsberger
Venue: WWW
Year: 2005

A central aspect of reducing orientation problems in web navigation concerns the design of adequate navigation aids. Visualization of users' navigation path in form of a temporal-spatial template can function as external memory of users' search history, thereby supporting the user to find previously visited sites, getting an overview of the search process and moreover, provide structure for the complex WorldWideWeb (WWW) environment. This paper presents an application for dynamic 2 and 3 dimensional visualizations of users' navigation paths, called MemoSpace. In an explorative study, users behavior and subjective evaluation of a MemoSpace application was examined.
Design and implementation of a feedback controller for slowdown differentiation on internet servers
Authors: Jianbin Wei, Cheng-Zhong Xu
Venue: WWW
Year: 2005

Proportional slowdown differentiation (PSD) aims to maintain slowdown ratios between different classes of clients according to their pre-specified differentiation parameters. In this paper, we design a feedback controller to allocate processing rate on Internet servers for PSD. In this approach, the processing rate of a class is adjusted by an integral feedback controller according to the difference between the target slowdown ratio and the achieved one. The initial rate class is estimated based on predicted workload using queueing theory. We implement the feedback controller in an Apache Web server. The experimental results under various environments demonstrate the controller's effectiveness and robustness.