OpenRaiser/Intern-Atlas huggingface dataset:
On the temporal dimension of search
Authors: Philip S. Yu, Xin Li, Bing Liu
Venue: WWW
Year: 2004

Web search is probably the single most important application on the Internet. The most famous search techniques are perhaps the PageRank and HITS algorithms. These algorithms are motivated by the observation that a hyperlink from a page to another is an implicit conveyance of authority to the target page. They exploit this social phenomenon to identify quality pages, e.g., "authority" pages and "hub" pages. In this paper we argue that these algorithms miss an important dimension of the Web, the temporal dimension. The Web is not a static environment. It changes constantly. Quality pages in the past may not be quality pages now or in the future. These techniques favor older pages because these pages have many in-links accumulated over time. New pages, which may be of high quality, have few or no in-links and are left behind. Bringing new and quality pages to users is important because most users want the latest information. Research publication search has exactly the same problem. This paper studies the temporal dimension of search in the context of research publication search. We propose a number of methods deal with the problem. Our experimental results show that these methods are highly effective.
SLA based profit optimization in web systems
Authors: Li Zhang, Danilo Ardagna
Venue: WWW
Year: 2004

With the rapid growth of eBusiness, the Web services are becoming a commodity. To reduce the management cost for the IT infrastructure, companies often outsource their IT services to third party service providers. Large service centers have been setup to provide services to many customers by sharing the IT resources. This leads to the efficient use of resources and a reduction of the operating cost. The service provider and their customers often negotiate utility based Service Level Agreements (SLAs) to determine the cost and penalty based on the achieved performance level. The system is based on a centralized controller which can control the request volumes at various servers and the scheduling policy at each server. The controller can also decide to turn ON or OFF servers depending on the system load. This paper designs a resource allocation scheduler for such web environments so as to maximize the profits associated with multiple class SLAs.
Gossip based streaming
Authors: Xinyan Zhang, Jiangchuan Liu
Venue: WWW
Year: 2004

In this paper, we propose a novel multicast streaming protocol foroverlay networks, called Gossip Based Streaming (GBS). In GBS,streaming contents are not come from a single upstream source,but delivered from several sources to a client. Though being similarto existing gossip protocols, the unique requirements forstreaming, such as continuous playback, are addressed in our design.Preliminary results show that GBS performs much better indynamic user environments.
Semantic web applications to e-science in silico experiments
Authors: Jun Zhao, Carole A. Goble, Robert Stevens
Venue: WWW
Year: 2004

This paper explains our research and implementations of manual, automatic and deep annotations of provenance logs for e-Science insilico experiments. Compared to annotating general Web documents, annotations for scientific data require more sophisticated professional knowledge to recognize concepts from documents, and more complex text extraction and mapping mechanisms. A simple automatic annotation approach based on "lexicons" and a deep annotation implemented by semantically populating, translating and annotating provenance logs are introduced in this paper. We used COHSE (Conceptual Open Hypermedia Services Environment) to annotate and browse provenance logs from my Grid project, which are conceptually linked together as a hypertext Web of provenance logs and experiment resources, based on the associated conceptual metadata and reasoning over these metadata.
Flexible on-device service object replication with replets
Authors: Dong Zhou, Nayeem Islam, Ali Ismael
Venue: WWW
Year: 2004

An increasingly large amount of Web applications employ service objects such as Servlets to generate dynamic and personalized content. Existing caching infrastructures are not well suited for caching such content in mobile environments because of disconnection and weak connection. One possible approach to this problem is to replicate Web-related application logic to client devices. The challenges to this approach are to deal with client devices that exhibit huge divergence in resource availabilities, to support applications that have different data sharing and coherency requirements, and to accommodate the same application under different deployment environments.
XML data mediator integrated solution for xml roundtrip from xml to relational
Authors: Nianjun Zhou, George A. Mihaila, Dikran S. Meliksetian
Venue: WWW
Year: 2004

This paper presents a system for efficient data transformations between XML and relational databases, called XML Data Mediator (XDM). XDM enables the transformation by externalizing the specification of the mapping in a script and using an efficient run-time engine that automates the conversion task. The runtime engine is independent from the mapping script. A parser converts a mapping script into an internal conversion object. For the mapping from relational to XML, we use a tagging tree as a conversion object inside the runtime engine, and use an SQL outer-join scheme to combine multiple SQL queries in order to reduce the number of backend relational database accesses. For the mapping from XML to relational, the conversion object is a shredding tree, and we use an innovative algorithm to process the XML as a stream in order to achieve linear complexity with respect to the size of the XML document.
Modeling the growth of future web
Authors: Hai Zhuge, Xue Chen, Xiang Li
Venue: WWW
Year: 2004

The future Web can be imagined as a life network consisting of resource nodes and semantic relationship links between them. Any node has a life span from birth - adding it to the network - to death - removing it from the network. Through establishing and investigating two types of models for such a network, we obtain the same scale free distribution of semantic links. Simulations and comparisons validate the rationality of the proposed models.
Active e-course for constructivist learning
Authors: Hai Zhuge, Yanyan Li
Venue: WWW
Year: 2004

An active e-course is a self-representable and self-organizable document mechanism with a flexible structure. The kernel of the active e-course is to organize learning materials into a "concept space" rather than a "page space". Besides highly interactive service it supports adaptive learning by dynamically selecting organizing and presenting the learning materials for different students. During the learning progress it also provides assessments on students' learning performances and gives suggestions to guide them in further learning. We have implemented an authoring tool and a course prototype to support the constructivist learning.
A novel heterogeneous data integration approach for p2p semantic link network
Authors: Hai Zhuge, Jie Liu
Venue: WWW
Year: 2004

This paper proposes a novel approach to integrate heterogeneous data in P2P networks. The approach includes a tool for building P2P semantic link networks, mechanisms for peer schema mapping, criteria for peer similarity degree measurement, and algorithms for heterogeneous data integration. The approach has three advantages: First, it uses semantic links to describe semantic relationships between peers' data schemas. Second, it deals with the semantic heterogeneity, the structural heterogeneity and the data value inconsistency. Finally, it considers the semantic similarity and structural similarity to forward queries to relevant peers.
An automatic semantic relationships discovery approach
Authors: Hai Zhuge, Liping Zheng, Nan Zhang, Xiang Li
Venue: WWW
Year: 2004

An important obstacle to the success of the Semantic Web is that the establishment of the semantic relationship is labor-intensive. This paper proposes an automatic semantic relationship discovering approach for constructing the semantic link network. The basic premise of this work is that the semantics of a web page can be reflected by a set of keywords, and the semantic relationship between two web pages can be determined by the semantic relationship between their keyword sets. The approach adopts the data mining algorithms to discover the semantic relationships between keyword sets, and then uses deductive and analogical reasoning to enrich the semantic relationships. The proposed algorithms have been implemented. Experiment shows that the approach is feasible.
Sampling search-engine results
Authors: Aris Anagnostopoulos, Andrei Z. Broder, David Carmel
Venue: WWW
Year: 2005

We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approximate algorithms for several applications, such as:
Mapping XML instances
Authors: Sai Anand, Erik Wilde
Venue: WWW
Year: 2005

For XML-based applications in general and B2B applications in particular, mapping between differently structured XML documents, to enable exchange of data, is a basic problem. A generic solution to the problem is of interest and desirable both in an academic and practical sense. We present a case study of the problem that arises in an XML based project, which involves mapping of different XML schemas to each other. We describe our approach to solving the problem, its advantages and limitations. We also compare and contrast our approach with previously known approaches and commercially available software solutions.
Wireless SOAP: optimizations for mobile wireless web services
Authors: Naresh Apte, Keith Deutsch, Ravi Jain
Venue: WWW
Year: 2005

We propose a set of optimization techniques, collectively called Wireless SOAP (WSOAP), to compress SOAP messages transmitted across a wireless link. The Name Space Equivalency technique rests on the observation that exact recovery of compressed messages is not required at the receiver; an equivalent form suffices. The WSDL Aware Encoding technique obtains further savings by utilizing knowledge of the underlying WSDL by means of an offline protocol we define. We summarize the design, implementation and performance of our Wireless SOAP prototype, and show that Wireless SOAP can reduce message sizes by 3x-12x compared to SOAP.
Advanced fault analysis in web service composition
Authors: Liliana Ardissono, Luca Console, Anna Goy, Giovanna Petrone, Claudia Picardi, Marino Segnan, Daniele Theseider Dupré
Venue: WWW
Year: 2005

Currently, fault management in Web Services orchestrating multiple suppliers relies on a local analysis, that does not span across individual services, thus limiting the effectiveness of recovery strategies. We propose to address this limitation by employing Model-Based Diagnosis to enhance fault analysis. In our approach, a Diagnostic Web Service is added to the set of Web Services providing the overall service, and acts as a supervisor of their execution, by identifying anomalies and explaining them in terms of faults to be repaired.
Shared lexicon for distributed annotations on the Web
Authors: Paolo Avesani, Marco Cova
Venue: WWW
Year: 2005

The interoperability among distributed and autonomous systems is the ultimate challenge facing the semantic web. Heterogeneity of data representation is the main source of problems. This paper proposes an innovative solution that combines lexical approaches and language games. The benefits for distributed annotation systems on the web are twofold: firstly, it will reduce the complexity of the semantic problem by moving the focus from the full-featured ontology level to the simpler lexicon level; secondly, it will avoid the drawback of a centralized third party mediator that may become a single point of failure.The main contributions of this work are concerned with:
Popular web hot spots identification and visualization
Authors: D. Avramouli, John D. Garofalakis, Dimitris J. Kavvadias, Christos Makris, Yannis Panagis, Evangelos Sakkopoulos
Venue: WWW
Year: 2005

This work aims a two-fold contribution: it presents a software to analyse logfiles and visualize popular web hot spots and, additionally, presents an algorithm to use this information in order to identify subsets of the website that display large access patterns. Such information is extremely valuable to the site maintainer, since it indicates points that may need content intervention or/and site graph restructuring. Experimental validation verified that the visualization tool, when coupled with algorithms that infer frequent traversal patterns, is both effective in indicating popular hot spots and efficient in doing so by using graph-based representations of popular traversals.
Automatic generation of web portals using artificial ants
Authors: Hanene Azzag, Gilles Venturini, Christiane Guinot
Venue: WWW
Year: 2005

We present in this work a new model (named AntTree) based on artificial ants for document hierarchical clustering. This model is inspired from the self-assembly behavior of real ants. We have simulated this behavior to build a hierarchical tree-structured partitioning of a set of documents, according to the similarities between these documents. We have successfully compared our results to those obtained by ascending hierarchical clustering.
Composite event queries for reactivity on the web
Authors: James Bailey, François Bry, Paula-Lavinia Patranjan
Venue: WWW
Year: 2005

Reactivity on the Web is an emerging issue. The capability to automatically react to events (such as updates to Web resources) is essential for both Web services and Semantic Web systems. Such systems need to have the capability to detect and react to complex, real life situations. This presentation gives flavours of the high-level language XChange, for programming reactive behaviour on the Web.
Merkle tree authentication of HTTP responses
Authors: Roberto J. Bayardo, Jeffrey S. Sorensen
Venue: WWW
Year: 2005

We propose extensions to existing web protocols that allow proofs of authenticity of HTTP server responses, whether or not the HTTP server is under the control of the publisher. These extensions protect users from content that may be substituted by malicious servers, and therefore have immediate applications in improving the security of web caching, mirroring, and relaying systems that rely on untrusted machines [2,4]. Our proposal relies on Merkle trees to support 200 and 404 response authentication while requiring only a single cryptographic hash of trusted data per repository. While existing web protocols such as HTTPS can provide authenticity guarantees (in addition to confidentiality), HTTPS consumes significantly more computational resources, and requires that the hosting server act without malice in generating responses and in protecting the publisher’s private key.
Exploiting the web for point-in-time file sharing
Authors: Roberto J. Bayardo Jr., Sebastian Thomschke
Venue: WWW
Year: 2005

We describe a simple approach to "point-in-time" file sharing based on time expiring web links and personal webservers. This approach to file sharing is useful in environments where instant messaging clients are varied and don't necessarily support (compatible) file transfer protocols. We discuss the features of such an approach along with a successfully deployed implementation now in wide use throughout the IBM corporation.
From user-centric web traffic data to usage data
Authors: Thomas Beauvisage, Houssem Assadi
Venue: WWW
Year: 2005

In this paper, we describe a user-centric Internet usage data processing platform. Raw usage data is collected using a software probe installed on a panel of Internet users' workstations. It is then processed by our platform. The transformation of raw usage data into qualified and usable information by Internet usage sociology researchers means setting up a series of relatively complex processes using quite a wide variety of resources. We use a combination of ad hoc rule-based systems and external resources to qualify the visited Web pages. We also implemented topological and temporal indicators in order to describe the dynamics of Web sessions.
Multichannel publication of interactive media documents in a news environment
Authors: Tom Beckers, Nico Oorts, Filip Hendrickx, Rik Van de Walle
Venue: WWW
Year: 2005

Multichanne l publication of multime dia pre se ntations pose s a significant challe nge on the ge ne ric de scription ofthe pre - se tation conte nt and the syst e ne ceGAwT to conveT the se de scriptions into final-formpre se ntations. We pre se nt a solution base d on the XiMPF docume nt mode l and a compone nt base d syste m archite cture .
Disambiguating Web appearances of people in a social network
Authors: Ron Bekkerman, Andrew McCallum
Venue: WWW
Year: 2005

Say you are looking for information about a particular person. A search engine returns many pages for that person's name but which pages are about the person you care about, and which are about other people who happen to have the same name? Furthermore, if we are looking for multiple people who are related in some way, how can we best leverage this social network? This paper presents two unsupervised frameworks for solving this problem: one based on link structure of the Web pages, another using Agglomerative/Conglomerative Double Clustering (A/CDC)---an application of a recently introduced multi-way distributional clustering method. To evaluate our methods, we collected and hand-labeled a dataset of over 1000 Web pages retrieved from Google queries on 12 personal names appearing together in someones in an email folder. On this dataset our methods outperform traditional agglomerative clustering by more than 20%, achieving over 80% F-measure.
On the feasibility of low-rank approximation for personalized PageRank
Authors: András A. Benczúr, Károly Csalogány, Tamás Sarlós
Venue: WWW
Year: 2005

Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized PageRank on the fly are either limited to a restricted choice of page selection or believed to behave well only on sparser regions of the Web. In this paper we show the feasibility of computing personalized PageRank by a k
A model for short-term content adaptation
Authors: Marco Benini, Alberto Trombetta, Michela Acquaviva
Venue: WWW
Year: 2005

This paper proposes a model for short-term content adaptation whose aim is to satisfy the contingent needs of users by adjusting the information a web-application provides on the basis of a short-term user profile. The mathematical model results in the design of an adaptive filter that profiles users by observing their queries to the application and that adjusts the answers of the application according to the inferred user needs. Also, the mathematical model ensures the correctness of the filter, that is, the filter is guaranteed to exhibit a coherent short-term adaptive behaviour.
WWW at 15 years: looking forward
Authors: Tim Berners-Lee
Venue: WWW
Year: 2005

The key property of the WWWW is its universality: One must be able to access it whatever the hardware device, software platform, and network one is using, and despite the disabilities one might have, and whether oner is in a "developed" or "developing" country; it must support information of any language, culture, quality, medium, and field without discrimination so that a hypertext link can go anywhere; it must support information intended for people, and that intended for machine processing. The Web architecture incorporated various choices which support these axes of universality.Currently the architecture and the principles are being exploited in the recent Mobile Web initiative in W3C to promote content which can be accessed optimally from conventional computers and mobile devices. New exciting areas arise every few months as possible Semantic Web flagship applications. As new areas burst forth, the fundamental principles remain important and are extended and adjusted. At the same time, the principles of openness and consensus among international stakeholders which the WWW consortium employs for new technology are adjusted, but ever-important.
Design for verification for asynchronously communicating Web services
Authors: Aysu Betin-Can, Tevfik Bultan, Xiang Fu
Venue: WWW
Year: 2005

We present a design for verification approach to developing reliable web services. We focus on composite web services which consist of asynchronously communicating peers. Our goal is to automatically verify properties of interactions among such peers. We propose a design pattern that eases the development of such web services and enables a modular, assume-guarantee style verification strategy. In the proposed design pattern, each peer is associated with a behavioral interface description which specifies how that peer will interact with other peers. Using these peer interfaces we automatically generate BPEL specifications to publish for interoperability. Assuming that the participating peers behave according to their interfaces, we verify safety and liveness properties about the global behavior of the composite web service during behavior verification. During interface verification, we check that each peer implementation conforms to its interface. Using the modularity in the proposed design pattern, we are able to perform the interface verification of each peer and the behavior verification as separate steps. Our experiments show that, using this modular approach, one can automatically and efficiently verify web service implementations.
Expressiveness of XSDs: from practice to theory, there and back again
Authors: Geert Jan Bex, Wim Martens, Frank Neven, Thomas Schwentick
Venue: WWW
Year: 2005

On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an investigation of the XML Schema Definitions (XSDs) occurring in practice reveals that the vast majority of them are structurally equivalent to DTDs. This might be due to the complexity of the XML Schema specification and the difficulty to understand the effect of constraints on typing and validation of schemas. To shed some light on the actual expressive power of XSDs this paper studies the impact of the Element Declarations Consistent (EDC) and the Unique Particle Attribution (UPA) rule. An equivalent formalism based on contextual patterns rather than on recursive types is proposed which might serve as a light-weight front end for XML Schema. Finally, the effect of EDC and UPA on the way XML documents can be typed is discussed. It is argued that a cleaner, more robust, stronger but equally efficient class is obtained by replacing EDC and UPA with the notion of 1-pass preorder typing: schemas that allow to determine the type of an element of a streaming document when its opening tag is met. This notion can be defined in terms of restrained competition regular expressions and there is again an equivalent syntactical formalism based on contextual patterns.