OpenRaiser/Intern-Atlas huggingface dataset:
Annotea: an open RDF infrastructure for shared Web annotations
Authors: José Kahan, Marja-Riitta Koivunen
Venue: WWW
Year: 2001

Article Annotea: an open RDF infrastructure for shared Web annotations Share on Authors: José Kahan W3C INRIA Rhône-Alpes, ZIRST 655, av. de l'Europe, 38330 Montbonnot Saint-Martin, France W3C INRIA Rhône-Alpes, ZIRST 655, av. de l'Europe, 38330 Montbonnot Saint-Martin, FranceView Profile , Marja-Ritta Koivunen Eric Prud'Hommeaux, Ralph R. Swick, W3C MIT/LCS, 200 Tech. Square, Cambridge, MA Eric Prud'Hommeaux, Ralph R. Swick, W3C MIT/LCS, 200 Tech. Square, Cambridge, MAView Profile Authors Info & Claims WWW '01: Proceedings of the 10th international conference on World Wide WebMay 2001 Pages 623–632https://doi.org/10.1145/371920.372166Online:01 April 2001Publication History 265citation1,173DownloadsMetricsTotal Citations265Total Downloads1,173Last 12 Months26Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Efficient Web form entry on PDAs
Authors: Oliver Kaljuvee, Orkut Buyukkokten, Hector Garcia-Molina, Andreas Paepcke
Venue: WWW
Year: 2001

We propose a design for displaying and manipulating HTML forms on small PDA screens. The form input widgets are not shown until the user is ready to fill them in. At that point, only one widget is shown at a time. The form is summarized on the screen by displaying just the text labels that prompt the user for each widget&apos;s information. The challenge of this design is to automatically find the match between each text label in a form, and the input widget for which it is the prompt. We developed eight algorithms for performing such label-widget matches. Some of the algorithms are based on n-gram comparisons, while others are based on common form layout conventions. We applied a combination of these algorithms to 100 simple HTML forms with an average of four input fields per form. These experiments achieved a 95% matching accuracy. We developed a scheme that combines all algorithms into a matching system. This system did well even on complex forms, achieving 80% accuracy in our experiments involving 330 input fields spread over 48 complex forms.
Protecting web servers from distributed denial of service attacks
Authors: Frank Kargl, Jörn Maier, Michael Weber
Venue: WWW
Year: 2001

Recently many prominent web sites face so called Distributed Denial of Service Attacks (DDoS). While former security threats could be faced by a tight security policy and active measures like using rewalls, vendor patches etc. these DDoS are new in suchway that there is no completely satisfying protection yet. In this paper we categorize different forms of attacks and give an overview over the most common DDoS tools. Furthermore we present a solution based on Class Based Routing mechanisms in the Linux kernel that will prevent the most severe impacts of DDoS on clusters of web servers with a prepended load balancing server. The goal is to keep the web servers under attack responding to the normal client requests. Some performance tests and a comparison to other approaches conclude our paper.
1000 years of the olympic games: treasures of ancient Greece. digital reconstruction at the home of the gods
Authors: Sarah Kenderdine
Venue: WWW
Year: 2001

Article Share on 1000 years of the olympic games: treasures of ancient Greece. digital reconstruction at the home of the gods Author: Sarah Kenderdine Project Manager/Creative Producer, Special Projects, Powerhouse Museum, 500 Harris St, Ultimo, Sydney, NSW 2007, Australia Project Manager/Creative Producer, Special Projects, Powerhouse Museum, 500 Harris St, Ultimo, Sydney, NSW 2007, AustraliaView Profile Authors Info & Claims WWW '01: Proceedings of the 10th international conference on World Wide WebMay 2001 Pages 67–75https://doi.org/10.1145/371920.371943Published:01 April 2001Publication History 4citation985DownloadsMetricsTotal Citations4Total Downloads985Last 12 Months24Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
On granting limited access to private information
Authors: Frans A. Lategan, Martin S. Olivier
Venue: WWW
Year: 2001

We distribute our private information on an everincreasing number of computers daily, and we eectively give target organisations carte blanche to do what they want with our private information once they have collected it. We have only their privacy policy as a possible safeguard against misuse of our private information. In this paper we describe a classi cation of private information based on the purpose it is acquired for. We also propose a method bywhich we can grant limited access to our private information, and thus enforce the terms of their privacy policies. Private information is also revealed at the last possible stage, further reducing the possibility of misuse. This safeguards private information in four of the ve categories mentioned. ######### Privacy, access control 1.
PicASHOW: pictorial authority search by hyperlinks on the Web
Authors: Ronny Lempel, Aya Soffer
Venue: WWW
Year: 2001

Article Share on PicASHOW: pictorial authority search by hyperlinks on the Web Authors: Ronny Lempel Department of Computer Science, The Technion, Haifa 32000, Israel Department of Computer Science, The Technion, Haifa 32000, IsraelView Profile , Aya Soffer IBM Research Lab in Haifa, Matam, Haifa 31905, Israel IBM Research Lab in Haifa, Matam, Haifa 31905, IsraelView Profile Authors Info & Claims WWW '01: Proceedings of the 10th international conference on World Wide WebMay 2001 Pages 438–448https://doi.org/10.1145/371920.372098Online:01 April 2001Publication History 37citation449DownloadsMetricsTotal Citations37Total Downloads449Last 12 Months15Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Constructing multi-granular and topic-focused web site maps
Authors: Wen-Syan Li, Necip Fazil Ayan, Okan Kolak, Quoc Vu, Hajime Takano, Hisashi Shimamura
Venue: WWW
Year: 2001

Site maps are essential to assist users in navigating a Web site. Most of the site maps are constructed manually and are static. However, di erent users may have di erent preferences and purposes for using a Web site. For example, a user may want to see a more detailed map while another user prefers a more abstract map. Two users looking for di erent topics at a large portal site would bene t more from two site maps with di erent focuses than a single map. In this paper, we present a technique for automatically constructing multi-granular and topic-focused site maps by utilizing directory paths, page contents, and link structures. In these site maps, the Web site topology is preserved and document importance, indicated by citation and semantic relevancy to user's topics of interest, is used for prioritizing the presentation of pages and directories. Experiments on real Web data have been conducted to validate the usefulness of the technique.
Retrieving and organizing web pages by "information unit"
Authors: Wen-Syan Li, K. Selçuk Candan, Quoc Vu, Divyakant Agrawal
Venue: WWW
Year: 2001

Article Retrieving and organizing web pages by "information unit" Share on Authors: Wen-Syan Li C&C Research Laboratories, NE, Inc., 110 Rio Robles, M/S SJ100, San Jose, CA C&C Research Laboratories, NE, Inc., 110 Rio Robles, M/S SJ100, San Jose, CAView Profile , K. Selçuk Candan C&C Research Laboratories, NE, Inc., 110 Rio Robles, M/S SJ100, San Jose, CA C&C Research Laboratories, NE, Inc., 110 Rio Robles, M/S SJ100, San Jose, CAView Profile , Quoc Vu C&C Research Laboratories, NE, Inc., 110 Rio Robles, M/S SJ100, San Jose, CA C&C Research Laboratories, NE, Inc., 110 Rio Robles, M/S SJ100, San Jose, CAView Profile , Divyakant Agrawal C&C Research Laboratories, NE, Inc., 110 Rio Robles, M/S SJ100, San Jose, CA C&C Research Laboratories, NE, Inc., 110 Rio Robles, M/S SJ100, San Jose, CAView Profile Authors Info & Claims WWW '01: Proceedings of the 10th international conference on World Wide WebMay 2001 Pages 230–244https://doi.org/10.1145/371920.372057Online:01 April 2001Publication History 66citation1,478DownloadsMetricsTotal Citations66Total Downloads1,478Last 12 Months11Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Distributed cooperative Apache web server
Authors: Quanzhong Li, Bongki Moon
Venue: WWW
Year: 2001

Given explosive data trac in the world-wide web (WWW), it is crucial to achieve the scalable performance of web servers. The overall performance and resource utilization can be improved by spreading document requests among a group of web servers. This leads to the design and implementation of Distributed Cooperative Apache (#########)web server. In this paper, we describe the unique features of the ######### system (1) to migrate and replicate documents among cooperating servers, (2) using dynamic hyperlink generation to distribute requests for documents to balance the load, and (3) to maintain replicated copies in a consistent state. We also address the issue of storage management for more eective document replication under limited capacity. In the experiments, the ######### system demonstrated its ability to achieve high performance and scalability by eectively distributing load among a group of cooperating Apache servers and by eliminating hot spots and performance bottleneck with replicated documents. The ######### system is an eective and practical solution to provide high performance and scalability to cope with ever increasing demands from clients all over the web. ######### WWW, Scalable Web server, Apache, DCApache, Distributed Web server, Replication, Load balancing 1.
Batch rekeying for secure group communications
Authors: Xiaozhou (Steve) Li, Yang Richard Yang, Mohamed G. Gouda, Simon S. Lam
Venue: WWW
Year: 2001

Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph approach has been proposed for group key management. Key tree and key star are two important types of key graphs. Previous work has been focused on individual rekeying, i.e., rekeying after each join or leave request. In this paper, we first identify two problems with individual rekeying: inefficiency and an out-of-sync problem between keys and data. We then propose the use of periodic batch rekeying which can improve efficiency and alleviate the out-of-sync problem. We devise a marking algorithm to process a batch of join and leave requests. We then analyze the key server&apos;s processing cost for batch rekeying. Our results show that batch rekeying, compared to individual rekeying, saves server cost substantially. We also show that when the number of requests in a batch is not large, the best key tree degree is four; otherwise, key star (a special key tree with root degree equal to group size) outperforms small-degree key trees. Keywords: Secure group communications, group key management, rekeying. 1.
Breadth-first crawling yields high-quality pages
Authors: Marc Najork, Janet L. Wiener
Venue: WWW
Year: 2001

Article Breadth-first crawling yields high-quality pages Share on Authors: Marc Najork Compaq Systems Research Center, 130 Lytton Avenue, Palo Alto, CA Compaq Systems Research Center, 130 Lytton Avenue, Palo Alto, CAView Profile , Janet L. Wiener Compaq Systems Research Center, 130 Lytton Avenue, Palo Alto, CA Compaq Systems Research Center, 130 Lytton Avenue, Palo Alto, CAView Profile Authors Info & Claims WWW '01: Proceedings of the 10th international conference on World Wide WebMay 2001 Pages 114–118https://doi.org/10.1145/371920.371965Online:01 April 2001Publication History 187citation1,650DownloadsMetricsTotal Citations187Total Downloads1,650Last 12 Months60Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Support concepts for Web navigation: a cognitive engineering approach
Authors: Mark A. Neerincx, Jasper Lindenberg, Steven Pemberton
Venue: WWW
Year: 2001

Current Network User Interfaces (NUIs) provide entrances to an enormous amount of Web-based services, bringing about new use problems such as laborious and unsuccessful navigation. Such problems are generally more severe for users with regression of cognitive functions (e.g. for some elderly). This paper identifies four fundamental cognitive determinants of navigation performance that may explain these problems: situation awareness, spatial ability, task-set switching and user control of support. Based on an analysis of these demands and current support functions for navigation, three “refined” support concepts were developed: categorising landmarks, history map and navigation assistant. Via the specification of humancomputer co-operative processes and scenarios, the concepts were implemented for two rather different web-based services. The present paper provides an example implementation of the navigation assistant. The results of the study will feed into a cognitive engineering method for the design of NUIs.
XML Query Forms (XQForms): Declarative Specification of XML Query Interfaces
Authors: Michalis Petropoulos, Vasilis Vassalos, Yannis Papakonstantinou
Venue: WWW
Year: 2001

Article XML query forms (XQForms): declarative specification of XML query interfaces Share on Authors: Michalis Petropoulos Dept. of Computer Science and Engineering, University of California, San Diego Dept. of Computer Science and Engineering, University of California, San DiegoView Profile , Vasilis Vassalos Information Systems Dept., New York University and Enosys Markets, Inc Information Systems Dept., New York University and Enosys Markets, IncView Profile , Yannis Papakonstantinou Dept. of Computer Science and Engineering, University of California, San Diego and Enosys Markets, Inc Dept. of Computer Science and Engineering, University of California, San Diego and Enosys Markets, IncView Profile Authors Info & Claims WWW '01: Proceedings of the 10th international conference on World Wide WebMay 2001 Pages 642–651https://doi.org/10.1145/371920.372170Online:01 April 2001Publication History 17citation517DownloadsMetricsTotal Citations17Total Downloads517Last 12 Months4Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
A metro map metaphor for guided tours on the Web: the Webvise guided tour system
Authors: Elmer Sandvad, Kaj Grønbæk, Lennert Sloth, Jørgen Lindskov Knudsen
Venue: WWW
Year: 2001

This paper presents a guided tour system for the WWW. It is a module for the Webvise open hypermedia system that implements the ideas of trails and guided tours, originating from the hypertext field. Webvise appears as an open hypermedia helper application to the user and stores the guided tours in an XML format called OHIF separated from the WWW documents included in the tour. The main advantages of the system are: (1) a browser independent format in terms of HTML and PNG-based image maps for reading the guided tours; (2) support for a familiar metaphor, namely, a metro route map; (3) overview maps and route maps with indication of which stations of a tour have been visited; and finally (4) support for arbitrary web pages as stations on the tour. The paper discusses the Webvise Guided Tour System and illustrates its use in a digital library portal. The system is compared to other recent Web-based guided tour systems, and it is argued that Webvise Guided Tour System solves a number of prior system problems.
Visitor awareness in the web
Authors: Albrecht Schmidt, Hans-Werner Gellersen
Venue: WWW
Year: 2001

All in-text\treferences\tunderlined\tin\tblue\tare\tlinked\tto\tpublications\ton\tResearchGate, letting you\taccess\tand\tread\tthem\timmediately.
An intelligent distributed environment for active learning
Authors: Yi Shang, Hongchi Shi, Su-Shing Chen
Venue: WWW
Year: 2001

Active learning is an effective learning approach. In this article we present an intelligent agent-assisted environment for active learning to better support the student-centered, self-paced, and highly interactive learning approach. The environment uses the student’s learning-related profile such as learning style and background knowledge in selecting, organizing, and presenting learning material, and it adopts a new approach to course content organization and delivery based on smart instructional components that can be integrated into a wide range of courses. The environment is being implemented using the prevalent Internet, Web, digital library, and multiagent technologies.
A case study in web search using TREC algorithms
Authors: Amit Singhal, Marcin Kaszkiel
Venue: WWW
Year: 2001

Web search engines rank potentially relevant pages/sites for a user query. Ranking documents for user queries has also been at the heart of the Text REtrieval Conference (TREC in short) under the label ###### retrieval. The TREC community has developed document ranking algorithms that are known to be the best for searching the document collections used in TREC, which are mainly comprised of newswire text. However, the web search community has developed its own methods to rank web pages/sites, many of which use link structure on the web, and are quite dierentfrom the algorithms developed at TREC. This study evaluates the performance of a state-of-the-art keyword-based document ranking algorithm (coming out of TREC) on a popular web search task: nding the web page/site of an entity, #### companies, universities, organizations, individuals, etc. This form of querying is quite prevalentonthe web. The results from the TREC algorithms are compared to four commercial web search engines. Results show that for nding the web page/site of an entity, commercial web search engines are notably better than a state-of-the-art TREC algorithm. These results are in sharp contrast to results from several previous studies. Keywords Search engines, TREC ad-hoc, keyword-based ranking, linkbased ranking 1.
Mining web logs to improve website organization
Authors: Ramakrishnan Srikant, Yinghui Yang
Venue: WWW
Year: 2001

Many websites have a hierarchical organization of content. This organization may be quite different from the organization expected by visitors to the website. In particular, it is often unclear where a specific document is located. In this paper, we propose an algorithm to automatically find pages in a website whose location is different from where visitors expect to find them. The key insight is that visitors will backtrack if they do not find the information where they expect it: the point from where they backtrack is the expected location for the page. We present an algorithm for discovering such expected locations that can handle page caching by the browser. Expected locations with a significant number of hits are then presented to the website administrator. We also present algorithms for selecting expected locations (for adding navigation links) to optimize the benefit to the website or the visitor. We ran our algorithm on the Wharton business school website and found that even on this small website, there were many pages with expected locations different from their actual location. 1.
Communication design for electronic negotiations on the basis of XML schema
Authors: Michael Ströbel
Venue: WWW
Year: 2001

Representation of negotiations in electronic markets and their support are important issues in today&apos;s e-commerce research. Whereas most activities are focused on automation aspects, only few efforts address the design of electronic negotiations - e.g. the sequence of actions, or obligations and responsibilities of the negotiating parties. However, an explicit negotiation design can also address what is commonly referred to as the ontology problem of electronic negotiations: how can one ensure that the negotiating parties have the same understanding regarding the issues that are subject to the negotiation? The solution this paper proposes is to perform a communication design for electronic negotiations that explicitly specifies the common syntax and semantics of the negotiating parties, the logical space of the electronic negotiation. Furthermore, XML Schema is suggested as the mechanism for the runtime representation of the logical space and the validation of actual negotiations from a syntactical and semantical perspective. On the basis of this approach, organisations creating an electronic market or sellers who intend to offer their buyers the ability to bargain can design and generate support mechanisms for electronic negotiations in a flexible and efficient way. The communication design action- and meta-model presented are part of SILKROAD, a design and application framework for electronic negotiations.
ViBE: virtual biology experiments
Authors: Rajaram Subramanian, Ivan Marsic
Venue: WWW
Year: 2001

Article Share on ViBE: virtual biology experiments Authors: Rajaram Subramanian Department of Electrical and Computer Engineering and the CAIP Center, Rutgers -- The State University of New Jersey, Piscataway, NJ Department of Electrical and Computer Engineering and the CAIP Center, Rutgers -- The State University of New Jersey, Piscataway, NJView Profile , Ivan Marsic Department of Electrical and Computer Engineering and the CAIP Center, Rutgers -- The State University of New Jersey, Piscataway, NJ Department of Electrical and Computer Engineering and the CAIP Center, Rutgers -- The State University of New Jersey, Piscataway, NJView Profile Authors Info & Claims WWW '01: Proceedings of the 10th international conference on World Wide WebMay 2001 Pages 316–325https://doi.org/10.1145/371920.372076Online:01 April 2001Publication History 14citation844DownloadsMetricsTotal Citations14Total Downloads844Last 12 Months17Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access