OpenRaiser/Intern-Atlas huggingface dataset:
Metacrystal: visualizing the degree of overlap between different search engines
Authors: Anselm Spoerri
Venue: WWW
Year: 2004

MetaCrystal enables users to visualize and control the degree of overlap between the results returned by different search engines. Several linked overview tools support rapid exploration, facilitate complex filtering operations and guide users toward relevant information. MetaCrystal addresses the problem of the effective fusion of different search results by helping users to visually combine and filter the top results returned by the different engines. Users can apply weights to the search engines to create their own ranking functions. They can control the degree of overlap by modifying the URL directory depth used to match documents or by changing the number of top documents being compared.
Authoring of learning styles in adaptive hypermedia: problems and solutions
Authors: Natalia Stash, Alexandra I. Cristea, Paul De Bra
Venue: WWW
Year: 2004

Learning styles, as well as the best ways of responding with corresponding instructional strategies, have been intensively studied in the classical educational (classroom) setting. There is much less research of application of learning styles in the new educational space, created by the Web. Moreover, authoring applications are scarce, and they do not provide explicit choices and creation of instructional strategies for specific learning styles. The main objective of the research described in this paper is to provide the authors with a tool which will allow them to incorporate different learning styles in their adaptive educational hypermedia applications. In this way, we are creating a semantically significant interface between classical learning styles and instructional strategies and the modern field of adaptive educational hypermedia.
Index structures and algorithms for querying distributed RDF repositories
Authors: Heiner Stuckenschmidt, Richard Vdovjak, Geert-Jan Houben, Jeen Broekstra
Venue: WWW
Year: 2004

A technical infrastructure for storing, querying and managing RDF data is a key element in the current semantic web development. Systems like Jena, Sesame or the ICS-FORTH RDF Suite are widely used for building semantic web applications. Currently, none of these systems supports the integrated querying of distributed RDF repositories. We consider this a major shortcoming since the semantic web is distributed by nature. In this paper we present an architecture for querying distributed RDF repositories by extending the existing Sesame system. We discuss the implications of our architecture and propose an index structure as well as algorithms for query processing and optimization in such a distributed context.
Tv2web: generating and browsing web with multiple lod from video streams and their metadata
Authors: Kazutoshi Sumiya, Mahendren Munisamy, Katsumi Tanaka
Venue: WWW
Year: 2004

We propose a method of automatically constructing Web content from video streams with metadata that we call TV2Web. The Web content includes thumbnails of video units and caption data generated from metadata. Users can watch TV ona normal Web browser. They can also manipulate Web content with zooming metaphors to seamlessly alter the level of detail (LOD) of the content being viewed. They can search for favorite scenes faster than with analog video equipment, and experience a new cross-media environment. We also developed a prototype of the TV2Web system and discuss its implementation.
Random surfer with back step
Authors: Marcin Sydow
Venue: WWW
Year: 2004

We present a novel link-based ranking algorithm RBS, which may be viewed as an extension of PageRank by back-step feature.
EIOP: an e-commerce interoperability platform
Authors: Yusuf Tambag
Venue: WWW
Year: 2004

Interoperability has become one of the big problems of e-commerce since it was born. A number of B2B standards like ebXML, UDDI, RosettaNet, xCBL, etc. emerged recently to solve the interoperability problem.Currently, there exists many B2B standards each provide competing and complementary solutions to B2B interoperability. So, there is a need for serving implementation of these standards from a single, central store to ease the use and management of the implementations. This paper presents EIOP, an E-commerce Interoperability Platform. EIOP is designed to provide a central store for implementations of e-commerce specifications to be able to use and configure these implementations from a single, central point. It defines the term EIOP Component which corresponds to plug&play e-commerce applications that are stored in the EIOP.
Continuous web: a new image-based hypermedia and scape-oriented browsing
Authors: Hiroya Tanaka, Katsumi Tanaka
Venue: WWW
Year: 2004

Conventionally, Web pages have been recognized as documents described by HTML. Image data, such as photographs, logos, maps, illustrations, and decorated text, have been treated as sub-components of Web documents. However, we can alternatively recognize all Web pages as images on the screen. When a Web page is treated as an image, its HTML data is considered to be metadata which describes the image content. Taking such a viewpoint, we propose a new image-based hypermedia which we call continuous web. In our model, there is no distinction between Web images and other images such as photographs.Regarding everything on the Web as images leads us to consider a new style of browsing and navigating. We use the term scape-oriented browsing. We define a scape as a collection of continuously accumulated images. For example, whenever we walk in the real world, we can perceive and remember various forms of information through a scape process. Here, we describe new methods for scape-oriented browsing, such as see-through anchors, parallel navigation, and peripheral scape presentation. We have designed and implemented a prototype system based on our model. Our system offers continuous browsing and navigation to users. We explain our concepts and discuss the effectiveness and potential of this approach.
Semantic resource management for the web: an e-learning application
Authors: Julien Tane, Christoph Schmitz, Gerd Stumme
Venue: WWW
Year: 2004

Topics in education are changing with an ever faster pace. ELearning resources tend to be more and more decentralized. Users increasingly need to be able to use the resources of the web. For this, they should have tools for finding and organizing information in a decentralized way. In this paper, we show how an ontologybased tool suite allows to make the most of the resources available on the web.
BizCQ: using continual queries to cope with changes in business information exchange
Authors: Wei Tang, R. Kipp Jones, Ling Liu, Calton Pu
Venue: WWW
Year: 2004

In this poster, we propose the framework of BizCQ, a system to apply Continual Queries [7][8] on Web-based content to manage information exchanges between two business partners. In this poster, we describe ways to leverage previous research in Web monitoring techniques applied to the everyday problem of managing change within a business environment, and focus on the difficulties of managing changes that are caused by external parties in business-to-business (B2B) information exchanges.
Implementing a proxy agent based writable web for a dynamic information sharing system
Authors: Noriharu Tashiro, Hiromitsu Hattori, Takayuki Ito, Toramatsu Shintani
Venue: WWW
Year: 2004

In this paper, we propose a Web based information sharing system called the Proxy Agent-based Information Sharing(PAIS).We also developed a writable Web mechanism called Web browser-based Direct Editing (Wedit), that is a major component of PAIS. Wedit enables public users to effectively edit HTML text on an existing Web browser. Since Wedit was developed with conventional technologies, users quickly learn how to use it. PAIS is implemented by using Wedit and a proxy agent. PAIS enables users to share information via Web pages using Wedit. The proxy agent maintainsusers' editing data. The agent autonomously sends its user's modification data to other agents in the same community. In PAIS, certain confidential information in the community is not publicly shared by using the proxy agent.
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
Authors: Christoph Tempich, Steffen Staab, Adrian Wranik
Venue: WWW
Year: 2004

In peer-to-peer networks, finding the appropriate answer for an information request, such as the answer to a query for RDF(S) data, depends on selecting the right peer in the network. We hereinvestigate how social metaphors can be exploited effectively andefficiently to solve this task. To this end, we define a method for query routing, REMINDIN', that lets <em>(i)</em> peers observewhich queries are successfully answered by other peers,<em>(ii)</em>, memorizes this observation, and, <em>(iii)</em>,subsequently uses this information in order to select peers to forward requests to.REMINDIN' has been implemented for the SWAP peer-to-peer platformas well as for a simulation environment. We have used the simulation environment in order to investigate how successfulvariations of REMINDIN' are and how they compare to baseline strategies in terms of number of messages forwarded in the networkand statements appropriately retrieved.
Graph-based text database for knowledge discovery
Authors: Junji Tomita, Hidekazu Nakawatase, Megumi Ishii
Venue: WWW
Year: 2004

While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling operations such as similar text search or text clustering. Drawing an analogy from the relational data model, we propose a text representation model that simplifies the steps. The model represents texts in a formal manner, Subject Graphs, described herein, provides text handling operations whose inputs and outputs are identical in form, i.e. a set of subject graphs. We develop a graph-based text database, which is based on the model, and an interactive knowledge discovery system. Trials of the system show that it allows the user to interactively and intuitively discover knowledge in Web pages by combining text handling operations defined on subject graphs in various orders.
Dynamic search in peer-to-peer networks
Authors: Hsinping Wang, Tsungnan Lin, Chia Hung Chen, Yennan Shen
Venue: WWW
Year: 2004

This work specifically addresses the search issues in unstructured peer-to-peer (P2P) systems that involve the design of an efficient search algorithm, the proposed dynamic search, and the modeling of P2P systems reflecting real measured P2P networks. Through simulations, we will show dynamic search outperforms other existing ones in terms of performance aspects.
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
Authors: Szu-Chi Wang, David S. L. Wei, Sy-Yen Kuo
Venue: WWW
Year: 2004

In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network. Each mobile node determines its own transmission power based only on its local information. The proposed algorithm constructs local shortest path trees from the unit disk graph. The performance improvements of our algorithm are demonstrated through simulations.
A scheme of service discovery and control on ubiquitous devices
Authors: Mitsutaka Watanabe, Ken-ichi Takaya, Akishi Seo, Masatomo Hashimoto, Tomonori Izumida, Akira Mori
Venue: WWW
Year: 2004

We have developed a set of hardware and software components to realize ubiquitous computing environments, based on two keywords, simple (easy to implement) and open(adopt widely publicized specifications). Then this set has been resulted into UBKit (Ubiquity Building Toolkit). The Micro-Server an instance of UBKitenables existing consumer electronics to join in computer networks. In this paperwe propose a scheme for discovery and control of deviecs attached to micro-servers.
A multimodal interaction manager for device independent mobile applications
Authors: Florian Wegscheider, Thomas Dangl, Michael Jank, Rainer Simon
Venue: WWW
Year: 2004

This poster presents an overview of the work on an interaction manager of a platform for multimodal applications in 2.5G and 3G mobile phone networks and WLAN environments. The poster describes the requirements for the interaction manager (IM), its tasks and the resulting structure. We examine the W3C's definition of an interaction manager and compare it to our implementation, which accomplishes some additional tasks.
Associative sources and agents for zero-input publishing
Authors: David Wolber, Christopher H. Brooks
Venue: WWW
Year: 2004

This paper presents an associative agent that allows seamless navigation from one's own personal space to third-party associative sources, as well as the personal spaces of other users. The agent provides users with access to a dynamically growing list of information sources, all of which follow a common associative sources API that we have defined. The agent also allows users act as sources themselves and take part in peer-to peer knowledge sharing.
A diagrammatic inference system for the web
Authors: Michael Wollowski, Peter Nei, Chris Barrell
Venue: WWW
Year: 2004

We developed a diagrammatic inference system for the World Wide Web. Our system enables the creation of diagrams such that the information contained in them can be searched and inference can be performed on it. We developed an XMLSchema for bar, line, and pie charts. Based on it, we developed software that transforms a corresponding XML file into an SVG image, which in turn is rendered by the client as an image. Additionally, we developed a search engine which enables a user to find information explicitly contained in the XML file, and as such in the image. Furthermore, we developed an inference engine which enables a user to locate information that is implicitly contained in the image.
Site-to-site (s2s) searching using the p2p framework with cgi
Authors: Wan Yeung Wong
Venue: WWW
Year: 2004

Peer-To-Peer (P2P) networks like Gnutella improve some shortcomings of Conventional Search Engines (CSE) such as centralized and outdated indexing by distributing the search engines over the peers, which maintain their updated local contents. But they are designed for sharing and searching the contents in personal computers instead of websites. In this work, we propose a novel web information retrieval method called Site-To-Site (S2S) searching, which uses the P2P framework with CGI as protocol. It helps the site owners to turn their websites into autonomous search engines without extra hardware and software costs. In this paper, we introduce S2S searching with some related work. We also describe the system architecture and communication protocol. Finally, we summarize the experimental results, and show that S2S searching works well in one thousand sites.
A smart hill-climbing algorithm for application server configuration
Authors: Bowei Xi, Zhen Liu, Mukund Raghavachari, Cathy H. Xia, Li Zhang
Venue: WWW
Year: 2004

The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has ledto an increase in the deployment of complex enterprise applications. These applications typically run on Web Application Servers, which assume the burden of managing many tasks, such as concurrency, memory management, database access, etc., required by these applications. The performance of an Application Server depends heavily on appropriate configuration. Configuration is a difficult and error-prone task dueto the large number of configuration parameters and complex interactions between them. We formulate the problem of finding an optimal configuration for a given application as a black-box optimization problem. We propose a smart hill-climbing algorithm using ideas of importance sampling and Latin Hypercube Sampling (LHS). The algorithm is efficient in both searching and random sampling. It consists of estimating a local function, and then, hill-climbing in the steepest descent direction. The algorithm also learns from past searches and restarts in a smart and selective fashion using the idea of importance sampling. We have carried out extensive experiments with an on-line brokerage application running in a WebSphere environment. Empirical results demonstrate that our algorithm is more efficient than and superior to traditional heuristic methods.
Link fusion: a unified link analysis framework for multi-type interrelated data objects
Authors: Wensi Xi, Benyu Zhang, Zheng Chen, Yizhou Lu, Shuicheng Yan, Wei-Ying Ma, Edward A. Fox
Venue: WWW
Year: 2004

Web link analysis has proven to be a significant enhancement for quality based web search. Most existing links can be classified into two categories: intra-type links (e.g., web hyperlinks), which represent the relationship of data objects within a homogeneous data type (web pages), and inter-type links (e.g., user browsing log) which represent the relationship of data objects across different data types (users and web pages). Unfortunately, most link analysis research only considers one type of link. In this paper, we propose a unified link analysis framework, called "link fusion", which considers both the inter- and intra- type link structure among multiple-type inter-related data objects and brings order to objects in each data type at the same time. The PageRank and HITS algorithms are shown to be special cases of our unified link analysis framework. Experiments on an instantiation of the framework that makes use of the user data and web pages extracted from a proxy log show that our proposed algorithm could improve the search effectiveness over the HITS and DirectHit algorithms by 24.6% and 38.2% respectively.
PipeCF: a scalable DHT-based collaborative filtering recommendation system
Authors: Bo Xie, Peng Han, Ruimin Shen
Venue: WWW
Year: 2004

Collaborative Filtering (CF) technique has proved to be one of the most successful techniques in recommendation systems in recent years. However, traditional centralized CF system has suffered from its shortage in scalability as their calculation complexity increases quickly both in time and space when the record in user database increases. In this paper, we propose a decentralized CF algorithm, called PipeCF, based on distributed hash table (DHT) method. We also propose two novel approaches to improve the scalability and prediction accuracy of DHT-based CF algorithm. The experimental data show that our DHT-based CF system has better prediction accuracy, efficiency and scalability than traditional CF systems.
Scheduling web requests in broadcast environments
Authors: Jianliang Xu, Wang-Chien Lee, Jiangchuan Liu
Venue: WWW
Year: 2004

On-demand broadcast has been supported in the Internet to enhance system scalability. Unfortunately, most of existing on-demand scheduling algorithms did not consider the time constraints associated with web requests. This paper proposes a novel scheduling algorithm, called Slack Inverse Number of requests (SIN), that takes into account the urgency and productivity of serving pending requests. Trace-driven experiments demonstrate that SIN significantly out performs existing algorithms over a wide range of workloads.
Similarity spreading: a unified framework for similarity calculation of interrelated objects
Authors: Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Wei-Ying Ma, Yong Yu
Venue: WWW
Year: 2004

In many Web search applications, similarities between objects of one type (say, queries) can be affected by the similarities between their interrelated objects of another type (say, Web pages), and vice versa. We propose a novel framework called similarity spreading to take account of the interrelationship and improve the similarity calculation. Experiment results show that the proposed framework can significantly improve the accuracy of the similarity measurement of the objects in a search engine.
On a web browsing support system with 3d visualization
Authors: Toshihiro Yamaguchi, Hiromitsu Hattori, Takayuki Ito, Toramatsu Shintani
Venue: WWW
Year: 2004

Existing commercial Web browsers provide various utilities and functions, e.g., Web bookmarks and a browsing history list. Since the bookmark and history functions only the title and URL of the Web page, users who cannot remember the contents of each Web page have difficulty retracing their steps. In this paper, we propose a bookmark system based on a 3D interface. Additionally, our system offers three main functions a 3D browsing history function, a marker function, and a look-ahead loading function. These functions enable users to browse Web pages more effectively.
FADA: find all distinct answers
Authors: Hui Yang, Tat-Seng Chua
Venue: WWW
Year: 2004

The wealth of information available on the web makes it an attractive resource for seeking quick answers. While web-based question answering becomes an emerging topic in recent years, the problem of efficiently locating a complete set of distinct answers on the Web is far from being solved. We introduce our system, FADA, which relies on question event analysis, web page clustering, and natural language parsing, to find reliable distinct answers with high recall. The method has been found to be effective in strengthening state-of-the-art Web question answering techniques by emphasizing on answer completeness and uniqueness.
DANTE: annotation and transformation of web pages for visually impaired users
Authors: Yeliz Yesilada, Simon Harper, Carole A. Goble, Robert Stevens
Venue: WWW
Year: 2004

Most Web pages are designed for visual interaction so the mobility, or ease of travel, of visually impaired Web travellers is reduced [2]. Objects that support travel and mobility are not in an appropriate form for nonvisual interaction. Our goal is to enhance the mobility of visually impaired Web travellers by annotating pages with a travel ontology that aims to encapsulate rich structural and navigational knowledge. We propose a semi-automated tool 'Dante' which aims to analyse Web pages to extract travel objects, discover their roles, annotate them with a travel ontology and transform pages based on the annotations to enhance the provided mobility support. This poster introduces the travel ontology and presents how Web pages are annotated with this ontology to guide the transformations.
The effect of different types of site maps on user's performance in an information-searching task
Authors: A. Yip
Venue: WWW
Year: 2004

This study examines the effects of different types of site maps on user's performance in an information-searching task for three web sites. Forty-two participants (22 males and 20 females) participated in the study. The results showed significant effects on the types of site maps used. It was found that participants found the correct answers more often, required less time, visited significantly fewer web pages, and required fewer clicks to complete the task when the site map was visible. However, it was found that the participants had a lower success rate in finding the correct answers when the site map had hyperlinks. In addition, the results showed significant performance differences among the three web sites and the effects of a site map were found to be more prominent for a larger web site.
Visual web mining
Authors: Amir H. Youssefi, David J. Duke, Mohammed Javeed Zaki
Venue: WWW
Year: 2004

Analysis of web site usage data involves two significant challenges: firstly the volume of data, arising from the growth of the web, and secondly, the structural complexity of web sites. In this paper we apply Data Mining and Information Visualization techniques to the web domain in order to benefit from the power of both human visual perception and computing we term this Visual Web Mining. In response to the two challenges, we propose a generic framework, where we apply Data Mining techniques to large web data sets and use Information Visualization methods on the results. The goal is to correlate the outcomes of mining Web Usage Logs and the extracted Web Structure by visually superimposing the results. We design several new information visualization diagrams.