OpenRaiser/Intern-Atlas huggingface dataset:
How to influence my customers?: the impact of electronic market design
Authors: Nan Hu, Ling Liu, Bin Chen, Jialie Shen
Venue: WWW
Year: 2008

This paper investigates the strategic decisions of online vendors for offering different mechanism, such as sampling and online reviews of information products, to increase their online sales. Focusing on measuring the effectiveness of electronic market design (offering reviews, sampling, or both), our study shows that online markets behavior as communication markets, and consumers learn product quality information both passively (reading online reviews) and actively but subjectively (listening to music sampling). Using data from Amazon, first we show that sampling along is a strong product quality signal that reduces the product uncertainty after controlling for halo effect. In general, products with sampling option enjoy a higher conversion rate (which leads to better sales) than those without sampling because sampling decreases the uncertainty of consuming experience goods. Second, the impact of online reviews on sales conversion rate is lower for experience goods with a sampling option than those without. Third, when the uncertainty of the societal reviews is higher, sampling plays a more important role because it mitigates such uncertainty introduced by online reviews.
Histrace: building a search engine of historical events
Authors: Lian&apos, en Huang, Jonathan J. H. Zhu, Xiaoming Li
Venue: WWW
Year: 2008

In this paper, we describe an experimental search engine on our Chinese web archive since 2001. The original data set contains nearly 3 billion Chinese web pages crawled from past 5 years. From the collection, 430 million "article-like" pages are selected and then partitioned into 68 million sets of similar pages. The titles and publication dates are determined for the pages. An index is built. When searching, the system returns related pages in a chronological order. This way, if a user is interested in news reports or commentaries for certain previously happened event, he/she will be able to find a quite rich set of highly related pages in a convenient way.
Towards the policy-aware web: the real web 3.0?
Authors: Renato Iannella
Venue: WWW
Year: 2008

The sharing and control of information on the Web needs to be balanced to provide the web community with the best experience and outcomes. The Policy-Aware Web is an emerging direction that may hold the key in getting this balance right by allowing future policy languages to maintain this harmonization. This panel will discuss, highlight, and debate the challenges in moving towards the Policy-Aware Web and the paths it could lead. The target audience includes all web stakeholders as most policies, such as privacy and rights, are intrinsic to all web users, information, services and content.
Wiki content templating
Authors: Angelo Di Iorio, Fabio Vitali, Stefano Zacchiroli
Venue: WWW
Year: 2008

Wiki content templating enables reuse of content structures among wiki pages. In this paper we present a thorough study of this widespread feature, showing how its two state of the art models (functional and creational templating) are sub-optimal. We then propose a third, better, model called lightly constrained (LC) templating and show its implementation in the Moin wiki engine. We also show how LC templating implementations are the appropriate technologies to push forward semantically rich web pages on the lines of (lowercase) semantic web and microformats.
Extracting spam blogs with co-citation clusters
Authors: Kazunari Ishida
Venue: WWW
Year: 2008

This paper reports the estimated number of spam blogs in order to assess their current state in the blogosphere. To extract spam blogs, I developed a traversal method among co-citation clusters of blogs from a spam seed. Spam seeds were collected in terms of high out-degree and spam keyword. According to the experiment, a mixed seed set composed of high out-degree and spam keyword seeds is more effective than individual seed sets in terms of F-Measure. In conclusion, mixed seeds from different methods are effective in improving the F-Measure results of spam extraction with co-citation clusters.
KC3 browser: semantic mash-up and link-free browsing
Authors: Michiaki Iwazume, Ken Kaneiwa, Koji Zettsu, Takafumi Nakanishi, Yutaka Kidawara, Yasushi Kiyoki
Venue: WWW
Year: 2008

This paper proposes a general framework of for a system with a semantic browsing and visualization interface called Knowledge Communication, Collaboration and Creation Browser (KC3 Browser) integrates multimedia contests and web services on the grid networks, and makes a semantic mash-up called knowledge workspace (k-workspace) with various visual gadgets according to user's contexts (e.g. their interests, purpose and computational environments).
Forcehttps: protecting high-security web sites from network attacks
Authors: Collin Jackson, Adam Barth
Venue: WWW
Year: 2008

As wireless networks proliferate, web browsers operate in an increasingly hostile network environment. The HTTPS protocol has the potential to protect web users from network attackers, but real-world deployments must cope with misconfigured servers, causing imperfect web sites and users to compromise browsing sessions inadvertently. ForceHTTPS is a simple browser security mechanism that web sites or users can use to opt in to stricter error processing, improving the security of HTTPS by preventing network attacks that leverage the browser's lax error processing. By augmenting the browser with a database of custom URL rewrite rules, ForceHTTPS allows sophisticated users to transparently retrofit security onto some insecure sites that support HTTPS. We provide a prototype implementation of ForceHTTPS as a Firefox browser extension.
WS7 - MobEA VI: personal rich social media
Authors: Rittwik Jana, Daniel Appelquist, Galit Zadok, Bin Wei
Venue: WWW
Year: 2008

2008 will be the "Mobile Eureka! Moment". With the Olympics just round the corner and the mobile market experiencing a phenomenal growth, we believe that WWW 2008 will truly be the climax and focal point in the midst of this mobile revolution. Mobile Web Initiative spearheaded by W3C is making a strong stand on how to realize the vision of pervasive mobile computing. Three screen services (TV, PC, Phone) are demanding new architectures to be developed. Furthermore, the need to go beyond technology, demands an embrace of the human-centric aspects of mobile computing. The objective of this workshop is to provide a single forum for researchers, sociologists, and technologists to discuss the state-of-the-art, present their contributions, and set future directions in personalized applications for mobile users with a focus in rich social media.
2lip: the step towards the web3d
Authors: Jacek Jankowski, Sebastian Ryszard Kruk
Venue: WWW
Year: 2008

The World Wide Web allows users to create and publish a variety of resources, including multimedia ones. Most of the contemporary best practices for designing web interfaces, however, do not take into account the 3D techniques.
Visualizing historical content of web pages
Authors: Adam Jatowt, Yukiko Kawai, Katsumi Tanaka
Venue: WWW
Year: 2008

Recently, along with the rapid growth of the Web, the preservation efforts have also increased. As a consequence, large amounts of past Web data are stored in Web archives. This historical data can be used for better understanding of long-term page topics and characteristics. In this paper, we propose an interactive visualization system called Page History Explorer for exploring page histories. It allows for roughly portraying evolution of pages and summarizing their content over time. We use a temporal term cloud as a structure for visualizing prevailing and active terms appearing on pages in the past.
Larger is better: seed selection in link-based anti-spamming algorithms
Authors: Qiancheng Jiang, Lei Zhang, Yizhen Zhu, Yan Zhang
Venue: WWW
Year: 2008

Seed selection is of significant importance for the biased PageRank algorithms such as TrustRank to combat link spamming. Previous work usually uses a small seed set, which has a big problem that the top ranking results have a strong bias towards seeds. In this paper, we analyze the relationship between the result bias and the number of seeds. Furthermore, we experimentally show that an automatically selected large seed set can work better than a carefully selected small seed set.
Generating hypotheses from the web
Authors: Wei Jin, Rohini K. Srihari, Abhishek Singh
Venue: WWW
Year: 2008

Hypothesis generation is a crucial initial step for making scientific discoveries. This paper addresses the problem of automatically discovering interesting hypotheses from the web. Given a query containing one or two entities of interest, our algorithm automatically generates a semantic profile describing the specified entity or provides the potential connections between two entities of interest. We implemented a prototype on top of the Google search engine and the experimental results demonstrate the effectiveness of our algorithms.
Ranking refinement and its application to information retrieval
Authors: Rong Jin, Hamed Valizadegan, Hang Li
Venue: WWW
Year: 2008

We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, interested in learning a better ranking function using two complementary sources of information, ranking information given by the existing ranking function (i.e., a base ranker) and that obtained from users' feedbacks. This problem is very important in information retrieval where the feedback is gradually collected. The key challenge in combining the two sources of information arises from the fact that the ranking information presented by the base ranker tends to be imperfect and the ranking information obtained from users' feedbacks tends to be noisy. We present a novel boosting framework for ranking refinement that can effectively leverage the uses of the two sources of information. Our empirical study shows that the proposed algorithm is effective for ranking refinement, and furthermore significantly outperforms the baseline algorithms that incorporate the outputs from the base ranker as an additional feature.
Enabling secure digital marketplace
Authors: Hongxia Jin, Vladimir Zbarsky
Venue: WWW
Year: 2008

The fast development of the Web provides new ways for effective distribution of network-based digital goods. A digital marketplace provides a platform to enable Web users to effectively acquire, share, market and distribute digital content. However, the success of the digital marketplace business models hinges on securely managing the digital rights and usage of the digital content. For example, the digital content should be only consumable by paid users. This paper describes a Web-based system that enables the secure exchange of digital content between Web users and prevents users from illegally re-sell of the digital content. Part of our solution is based on broadcast encryption technology.
The future of online social interactions: what to expect in 2020
Authors: Ajita John, Lada A. Adamic, Marc Davis, Frank Nack, David A. Shamma, Dorée D. Seligmann
Venue: WWW
Year: 2008

Blogs, wikis, tagging, podcasts, and social networking websites such as MySpace, Facebook, Flickr and YouTube have radically changed user interactions on the World Wide Web from a static, one-way, consumption model to a dynamic, multi-way, participation model. Broad user power and flexibility have changed how people engage in and experience their interconnections, interests, and collaborations. Online social interactions will evolve in the next decade to address the growing needs of its user community and make entries into many aspects of our lives. This evolution may very well be among the most exciting ones of our times where the individual and collective power of people to contribute and share content, experiences, ideas, expertise etc. may be even more enhanced than it is today. The enhancement may be shaped through a better understanding of user needs and behavior and it may be enabled through the seamless convergence of multi-modal technologies, new applications, new domains, data mining and better navigational and search capabilities. Some of these changes will also permeate into the workplace and change the way we work. This panel will discuss how online social interactions may evolve in the next decade and what impact it may have on diverse dimensions in our world.
Understanding internet video sharing site workload: a view from data center design
Authors: Xiaozhu Kang, Hui Zhang, Guofei Jiang, Haifeng Chen, Xiaoqiao Meng, Kenji Yoshihira
Venue: WWW
Year: 2008

In this paper we measured and analyzed the workload on Yahoo! Video, the 2nd largest U.S. video sharing site, to understand its nature and the impact on online video data center design. We discovered interesting statistical properties on both static and temporal dimensions of the workload including file duration and popularity distributions, arrival rate dynamics and predictability, and workload stationarity and burstiness. Complemented with queueing-theoretic techniques, we further extended our understanding on the measurement data with a virtual design on the workload and capacity management components of a data center assuming the same workload as measured, which reveals key results regarding the impact of Service Level Agreements (SLAs) and workload scheduling schemes on the design and operations of such large-scale video distribution systems.
SMash: secure component model for cross-domain mashups on unmodified browsers
Authors: Frederik De Keukelaere, Sumeer Bhola, Michael Steiner, Suresh Chari, Sachiko Yoshihama
Venue: WWW
Year: 2008

Mashup applications mix and merge content (data and code) from multiple content providers in a user's browser, to provide high-value web applications that can rival the user experience provided by desktop applications. Current browser security models were not designed to support such applications and they are therefore implemented with insecure workarounds. In this paper, we present a secure component model, where components are provided by different trust domains, and can interact using a communication abstraction that allows ease of specification of a security policy. We have developed an implementation of this model that works currently in all major browsers, and addresses challenges of communication integrity and frame-phishing. An evaluation of the performance of our implementation shows that this approach is not just feasible but also practical.
Guanxi in the chinese web - a study of mutual linking
Authors: Valerie King, Louis Lei Yu, Yan Zhuang
Venue: WWW
Year: 2008

Guanxi is a type of dyadic social interaction based on feelings ("qing") and trust ("xin"). Long studied by scholars of Chinese origin, it has recently drawn the attention of researchers outside of China. We define the concept of guanxi as applied to the interaction between web sites. We explore methods to identify guanxi in the Chinese web, show the unique characteristics of the Chinese web which result from it, and introduce a mechanism for simulating guanxi in a web graph model.
Psst: a web-based system for tracking political statements
Authors: Samantha Kleinberg, Bud Mishra
Venue: WWW
Year: 2008

Determining candidates' views on important issues is critical in deciding whom to support and vote for; but finding their statements and votes on an issue can be laborious. In this paper we present PSST, (Political Statement and Support Tracker), a search engine to facilitate analysis of political statements and votes over time. We show that prior tools for text analysis can be combined with minimal manual processing to provide a first step in the full automation of this process.
Extending the compatibility notion for abstract WS-BPEL processes
Authors: Dieter König, Niels Lohmann, Simon Moser, Christian Stahl, Karsten Wolf
Venue: WWW
Year: 2008

WS-BPEL defines a standard for executable processes. Executable processes are business processes which can be automated through an IT infrastructure. The WS-BPEL specification also introduces the concept of abstract processes: In contrast to their executable siblings, abstract processes are not executable and can have parts where business logic is disguised. Nevertheless, the WS-BPEL specification introduces a notion of compatibility between such an under-specified abstract process and a fully specified executable one. Basically, this compatibility notion defines a set of syntactical rules that can be augmented or restricted by profiles. So far, there exist two of such profiles: the Abstract Process Profile for Observable Behavior and the Abstract Process Profile for Templates. None of these profiles defines a concept of behavioral equivalence. Therefore, both profiles are too strict with respect to the rules they impose when deciding whether an executable process is compatible to an abstract one. In this paper, we propose a novel profile that extends the existing Abstract Process Profile for Observable Behavior by defining a behavioral relationship. We also show that our novel profile allows for more flexibility when deciding whether an executable and an abstract process are compatible.
Towards a programming language for services computing
Authors: Arun Kumar, D. Janakiram
Venue: WWW
Year: 2008

Services Computing is emerging as a new discipline. The acceptance of web services technology stems from the fact that services enable easy integration and interoperation of enterprise level distributed systems. However, currently software developers are forced to translate business level service requirements and encode them into programs using low level abstractions such as objects. We propose to introduce language constructs for Service Oriented Programming that would enable raising programming abstractions from objects to services.
Organizing the unorganized - employing IT to empower the under-privileged
Authors: Arun Kumar, Nitendra Rajput, Sheetal K. Agarwal, Dipanjan Chakraborty, Amit Anil Nanavati
Venue: WWW
Year: 2008

Various sectors in developing countries are typically dominated by the presence of a large number of small and microbusinesses that operate in an informal, unorganized manner. Many of these are single person run micro-businesses and cannot afford to buy and maintain their own IT infrastructure. For others, easy availability of cheap labour provides a convenient alternative even though it results in inefficiency, as little or no records are maintained, and only manual, paper-based processes are followed. This results in high response times for customers, no formal accountability and higher charges. For the businesses this translates to lower earnings and losses due to inefficiencies. In this paper, we look at few such micro-business segments and explore their current models of operation, while identifying existing inefficiencies and pain points. We build upon the findings and propose an approach for delivering benefits of IT solutions to such micro-business segments. Finally, we present technology that realizes the proposed approach in the specific context of two such segments.
Folksoviz: a subsumption-based folksonomy visualization using wikipedia texts
Authors: Kangpyo Lee, Hyunwoo Kim, Chungsu Jang, Hyoung-Joo Kim
Venue: WWW
Year: 2008

In this paper, targeting del.icio.us tag data, we propose a method, FolksoViz, for deriving subsumption relationships between tags by using Wikipedia texts, and visualizing a folksonomy. To fulfill this method, we propose a statistical model for deriving subsumption relationships based on the frequency of each tag on the Wikipedia texts, as well as the TSD (Tag Sense Disambiguation) method for mapping each tag to a corresponding Wikipedia text. The derived subsumption pairs are visualized effectively on the screen. The experiment shows that the FolksoViz manages to find the correct subsumption pairs with high accuracy.
IRLbot: scaling to 6 billion pages and beyond
Authors: Hsin-Tsang Lee, Derek Leonard, Xiaoming Wang, Dmitri Loguinov
Venue: WWW
Year: 2008

This paper shares our experience in designing a web crawler that can download billions of pages using a single-server implementation and models its performance. We show that with the quadratically increasing complexity of verifying URL uniqueness, BFS crawl order, and fixed per-host rate-limiting, current crawling algorithms cannot effectively cope with the sheer volume of URLs generated in large crawls, highly-branching spam, legitimate multi-million-page blog sites, and infinite loops created by server-side scripts. We offer a set of techniques for dealing with these issues and test their performance in an implementation we call IRLbot. In our recent experiment that lasted 41 days, IRLbot running on a single server successfully crawled 6.3 billion valid HTML pages ($7.6$ billion connection requests) and sustained an average download rate of 319 mb/s (1,789 pages/s). Unlike our prior experiments with algorithms proposed in related work, this version of IRLbot did not experience any bottlenecks and successfully handled content from over 117 million hosts, parsed out 394 billion links, and discovered a subset of the web graph with 41 billion unique nodes.
A framework for fast community extraction of large-scale networks
Authors: Yutaka I. Leon-Suematsu, Kikuo Yuta
Venue: WWW
Year: 2008

Most of the faster community extraction algorithms are based on the Clauset, Newman and Moore (CNM), which is employed for networks with sizes up to 500,000 nodes. The modification proposed by Danon, Diaz and Arenas (DDA) obtains better modularity among CNM and its variations, but there is no improvement in speed as its authors expressed. In this paper, we identify some inefficiencies in the data structure employed by former algorithms. We propose a new framework for the algorithm and a modification of the DDA to make it applicable to large-scale networks. For instance, the community extraction of a network with 1 million nodes and 5 million edges was performed in about 14 minutes in contrast to former CNM that required 45 hours (192 times the former CNM, obtaining better modularity).
Toward a model of service interaction enabler in mobile environment
Authors: Eddie Leung, Maria Indrawan, Sea Ling
Venue: WWW
Year: 2008

Proliferation of mobile devices has posed challenges in the development of interaction models among devices. These models should allow the devices involved in an interaction to detect and analyze possible communications or services to invoke before the actual interaction can take place. In this paper, we propose a model that allows analysis of possible interactions of devices. Our model provides a logical structure to construct and compare the essential elements that defines the capability of a device. These elements can then be examined in the proposed interaction possibility analysis to determine possible interactions through the invocation of services.
Efficient vectorial operators for processing xml twig queries
Authors: Guoliang Li, Jianhua Feng, Jianyong Wang, Feng Lin, Lizhu Zhou
Venue: WWW
Year: 2008

This paper proposes several vectorial operators for processing XML twig queries, which are easy to be performed and inherently efficient for both Ancestor-Descendant (A-D) and Parent-Child (P-C) relationships. We develop optimizations on the vectorial operators to improve the efficiency of answering twig queries in holistic. We propose an algorithm to answer GTP queries based on our vectorial operators.