Fractal summarization for mobile devices to access large documents on the web Wireless access with mobile ( or handheld ) devices is a promising addition to the WWW and traditional electronic business . Mobile devices provide convenience and portable access to the huge information space on the Internet without requiring users to be stationary with network connection . However , the limited screen size , narrow network bandwidth , small memory capacity and low computing power are the shortcomings of handheld devices . Loading and visualizing large documents on handheld devices become impossible . The limited resolution restricts the amount of information to be displayed . The download time is intolerably long . In this paper , we introduce the fractal summarization model for document summarization on handheld devices . Fractal summarization is developed based on the fractal theory . It generates a brief skeleton of summary at the first stage , and the details of the summary on different levels of the document are generated on demands of users . Such interactive summarization reduces the computation load in comparing with the generation of the entire summary in one batch by the traditional automatic summarization , which is ideal for wireless access . Three-tier architecture with the middle-tier conducting the major computation is also discussed . Visualization of summary on handheld devices is also investigated .

B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B I O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O

document summarization
fractal summarization
handheld devices


Retrieving multimedia web objects based on PageRank algorithm Hyperlink analysis has been widely investigated to support the retrieval of Web documents in Internet search engines . It has been proven that the hyperlink analysis significantly improves the relevance of the search results and these techniques have been adopted in many commercial search engines , e.g. Google . However , hyperlink analysis is mostly utilized in the ranking mechanism of Web pages only but not including other multimedia objects , such as images and video . In this project , we propose a modified Multimedia PageRank algorithm to support the searching of multimedia objects in the Web .

O O O O O O B O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O

content based retrieval
hits
multimedia retrieval
web search engines


SCAD : collective discovery of attribute values Search engines today offer a rich user experience , no longer restricted to `` ten blue links '' . For example , the query `` Canon EOS Digital Camera '' returns a photo of the digital camera , and a list of suitable merchants and prices . Similar results are offered in other domains like food , entertainment , travel , etc. . All these experiences are fueled by the availability of structured data about the entities of interest . To obtain this structured data , it is necessary to solve the following problem : given a category of entities with its schema , and a set of Web pages that mention and describe entities belonging to the category , build a structured representation for the entity under the given schema . Specifically , collect structured numerical or discrete attributes of the entities . Most previous approaches regarded this as an information extraction problem on individual documents , and made no special use of numerical attributes . In contrast , we present an end-to-end framework which leverages signals not only from the Web page context , but also from a collective analysis of all the pages corresponding to an entity , and from constraints related to the actual values within the domain . Our current implementation uses a general and flexible Integer Linear Program ( ILP ) to integrate all these signals into holistic decisions over all attributes . There is one ILP per entity and it is small enough to be solved in under 38 milliseconds in our experiments . We apply the new framework to a setting of significant practical importance : catalog expansion for Commerce search engines , using data from Bing Shopping . Finally , we present experiments that validate the effectiveness of the framework and its superiority to local extraction .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O

attribute discovery
collective information extraction
information search and retrieval
natural language processing
weak supervision


Relationship between web links and trade We report on observations on Web characterization studies that suggest that the amount of Web links among sites under different country-code top-level domains is related to the amount of trade between the corresponding countries .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

miscellaneous
national web domains
world trade graph


Time-dependent semantic similarity measure of queries using historical click-through data It has become a promising direction to measure similarity of Web search queries by mining the increasing amount of click-through data logged by Web search engines , which record the interactions between users and the search engines . Most existing approaches employ the click-through data for similarity measure of queries with little consideration of the temporal factor , while the click-through data is often dynamic and contains rich temporal information . In this paper we present a new framework of time-dependent query semantic similarity model on exploiting the temporal characteristics of historical click-through data . The intuition is that more accurate semantic similarity values between queries can be obtained by taking into account the timestamps of the log data . With a set of user-defined calendar schema and calendar patterns , our time-dependent query similarity model is constructed using the marginalized kernel technique , which can exploit both explicit similarity and implicit semantics from the click-through data effectively . Experimental results on a large set of click-through data acquired from a commercial search engine show that our time-dependent query similarity model is more accurate than the existing approaches . Moreover , we observe that our time-dependent query similarity model can , to some extent , reflect real-world semantics such as real-world events that are happening over time .

O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

marginalized kernel
semantic similarity measure

click-through data
event detection
evolution pattern


Summarizing email conversations with clue words Accessing an ever increasing number of emails , possibly on small mobile devices , has become a major problem for many users . Email summarization is a promising way to solve this problem . In this paper , we propose a new framework for email summarization . One novelty is to use a fragment quotation graph to try to capture an email conversation . The second novelty is to use clue words to measure the importance of sentences in conversation summarization . Based on clue words and their scores , we propose a method called CWS , which is capable of producing a summary of any length as requested by the user . We provide a comprehensive comparison of CWS with various existing methods on the Enron data set . Preliminary results suggest that CWS provides better summaries than existing methods .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


WISER : a web-based interactive route search system for smartphones Many smartphones , nowadays , use GPS to detect the location of the user , and can use the Internet to interact with remote location-based services . These two capabilities support online navigation that incorporates search . In this demo we presents WISER -- a system for Web-based Interactive Search en Route . In the system , users perform route search by providing ( 1 ) a target location , and ( 2 ) search terms that specify types of geographic entities to be visited . The task is to find a route that minimizes the travel distance from the initial location of the user to the target , via entities of the specified types . However , planning a route under conditions of uncertainty requires the system to take into account the possibility that some visited entities will not satisfy the search requirements , so that the route may need to go via several entities of the same type . In an interactive search , the user provides feedback regarding her satisfaction with entities she visits during the travel , and the system changes the route , in real time , accordingly . The goal is to use the interaction for computing a route that is more effective than a route that is computed in a non-interactive fashion .

O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


An event-condition-action language for XML XML repositories are now a widespread means for storing and exchanging information on the Web . As these repositories become increasingly used in dynamic applications such as e-commerce , there is a rapidly growing need for a mechanism to incorporate reactive functionality in an XML setting . Event-condition-action ( ECA ) rules are a technology from active databases and are a natural method for supporting suchfunctionality . ECA rules can be used for activities such as automatically enforcing document constraints , maintaining repository statistics , and facilitating publish\/subscribe applications . An important question associated with the use of a ECA rules is how to statically predict their run-time behavior . In this paper , we define a language for ECA rules on XML repositories . We then investigate methods for analyzing the behavior of a set of ECA rules , a task which has added complexity in this XML setting compared with conventional active databases .

O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O

event-condition-action rules
rule analysis
xml repositories


Information flow using edge stress factor This paper shows how a corpus of instant messages can be employed to detect de facto communities of practice automatically . A novel algorithm based on the concept of Edge Stress Factor is proposed and validated . Results show that this approach is fast and effective in studying collaborative behavior .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

graph clustering
social network analysis


Towards intent-driven bidterm suggestion In online advertising , pervasive in commercial search engines , advertisers typically bid on few terms , and the scarcity of data makes ad matching difficult . Suggesting additional bidterms can significantly improve ad clickability and conversion rates . In this paper , we present a large-scale bidterm suggestion system that models an advertiser 's intent and finds new bidterms consistent with that intent . Preliminary experiments show that our system significantly increases the coverage of a state of the art production system used at Yahoo while maintaining comparable precision .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information search and retrieval
sponsored search


Automatic search engine performance evaluation with click-through data analysis Performance evaluation is an important issue in Web search engine researches . Traditional evaluation methods rely on much human efforts and are therefore quite time-consuming . With click-through data analysis , we proposed an automatic search engine performance evaluation method . This method generates navigational type query topics and answers automatically based on search users . querying and clicking behavior . Experimental results based on a commercial Chinese search engine 's user logs show that the automatically method gets a similar evaluation result with traditional assessor-based ones .

O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


DOM-based content extraction of HTML documents Web pages often contain clutter ( such as pop-up ads , unnecessary images and extraneous links ) around the body of an article that distracts a user from actual content . Extraction of `` useful and relevant '' content from web pages has many applications , including cell phone and PDA browsing , speech rendering for the visually impaired , and text summarization . Most approaches to removing clutter or making content more readable involve changing font size or removing HTML and data components such as images , which takes away from a webpage 's inherent look and feel . Unlike `` Content Reformatting '' , which aims to reproduce the entire webpage in a more convenient form , our solution directly addresses `` Content Extraction '' . We have developed a framework that employs easily extensible set of techniques that incorporate advantages of previous work on content extraction . Our key insight is to work with the DOM trees , rather than with raw HTML markup . We have implemented our approach in a publicly available Web proxy to extract content from HTML web pages .

O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O

content extraction
dom trees
html documents
reformatting
speech rendering


PAKE-based mutual HTTP authentication for preventing phishing attacks We developed a new Web authentication protocol with password-based mutual authentication which prevents various kinds of phishing attacks . This protocol provides a protection of user 's passwords against any phishers even if a dictionary attack is employed , and prevents phishers from imitating a false sense of successful authentication to users . The protocol is designed considering interoperability with many recent Web applications which requires many features which current HTTP authentication does not provide . The protocol is proposed as an Internet Draft submitted to IETF , and implemented in both server side ( as an Apache extension ) and client side ( as a Mozilla-based browser and an IE-based one ) .

O O B O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Effective Web data extraction with standard XML technologies

crawling
deep web
methodologies
semistructured data
wrappers


Shilling recommender systems for fun and profit Recommender systems have emerged in the past several years as an effective way to help people cope with the problem of information overload . One application in which they have become particularly common is in e-commerce , where recommendation of items can often help a customer find what she is interested in and , therefore can help drive sales . Unscrupulous producers in the never-ending quest for market penetration may find it profitable to shill recommender systems by lying to the systems in order to have their products recommended more often than those of their competitors . This paper explores four open questions that may affect the effectiveness of such shilling attacks : which recommender algorithm is being used , whether the application is producing recommendations or predictions , how detectable the attacks are by the operator of the system , and what the properties are of the items being attacked . The questions are explored experimentally on a large data set of movie ratings . Taken together , the results of the paper suggest that new ways must be used to evaluate and detect shilling attacks on recommender systems .

B B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O B I O


Best bets : thousands of queries in search of a client A number of applications require selecting targets for specific contents on the basis of criteria defined by the contents providers rather than selecting documents in response to user queries , as in ordinary information retrieval . We present a class of retrieval systems , called Best Bets , that generalize Information Filtering and encompass a variety of applications including editorial suggestions , promotional campaigns and targeted advertising , such as Google AdWords ™ . We developed techniques for implementing Best Bets systems addressing performance issues for large scale deployment as efficient query search , incremental updates and dynamic ranking .

O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O


Semantic email This paper investigates how the vision of the Semantic Web can be carried overto the realm of email . We introduce a general notion of semantice mail , in which an email message consists of an RDF query or update coupled with corresponding explanatory text . Semantic email opens the door to a wide range of automated , email-mediated applications with formally guaranteed properties . In particular , this paper introduces a broad class of semantic email processes . For example consider the process of sending an email to a program committee asking who will attend the PC dinner automatically collecting the responses and tallying them up . We define bothlogical and decision-theoretic models where an email process ismodeled as a set of updates to a data set on which we specify goals via certain constraints or utilities . We then describe a set ofinference problems that arise while trying to satisfy these goals and analyze their computational tractability . In particular weshow that for the logical model it is possible to automatically infer which email responses are acceptable w.r.t. a set ofconstraints in polynomial time and for the decision-theoreticmodel it is possible to compute the optimal message-handling policy in polynomial time . Finally we discuss our publicly available implementation of semantic email and outline research challenges inthis realm .

O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

decision-theoretic
formal model
miscellaneous
satisfiability


Using symbolic objects to cluster web documents Web Clustering is useful for several activities in the WWW , from automatically building web directories to improve retrieval performance . Nevertheless , due to the huge size of the web , a linear mechanism must be employed to cluster web documents . The k-means is one classic algorithm used in this problem . We present a variant of the vector model to be used with the k-means algorithm . Our representation uses symbolic objects for clustering web documents . Some experiments were done with positive results and future work is optimistic .

O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

metrics
miscellaneous
symbolic data analysis


Co-browsing dynamic web pages Collaborative browsing , or co-browsing , is the co-navigation of the web with other people at-a-distance , supported by software that takes care of synchronizing the browsers . Current state-of-the-art solutions are able to do co-browsing of `` static web pages '' , and do not support the synchronization of JavaScript interactions . However , currently many web pages use JavaScript and Ajax techniques to create highly dynamic and interactive web applications . In this paper , we describe two approaches for co-browsing that both support the synchronization of the JavaScript and Ajax interactions of dynamic web pages . One approach is based on synchronizing the output of the JavaScript engine by sending over the changes made on the DOM tree . The other approach is based on synchronizing the input of the JavaScript engine by synchronizing UI events and incoming data . Since the latter solution offers a better user experience and is more scalable , it is elaborated in more detail . An important aspect of both approaches is that they operate at the DOM level . Therefore , the client-side can be implemented in JavaScript and no browser extensions are required . To the best of the authors ' knowledge this is the first DOM-level co-browsing solution that also enables co-browsing of the dynamic interaction parts of web pages . The presented co-browsing solution has been implemented in a research demonstrator which allows users to do co-browsing of web-applications on browser-based networked televisions .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

co-browsing
collaboration
collaborative computing
shared browsing
web4ce


Generative models for name disambiguation Name ambiguity is a special case of identity uncertainty where one person can be referenced by multiple name variations in different situations or evenshare the same name with other people . In this paper , we present an efficient framework by using two novel topic-based models , extended from Probabilistic Latent Semantic Analysis ( PLSA ) and Latent Dirichlet Allocation ( LDA ) . Our models explicitly introduce a new variable for persons and learn the distribution of topics with regard to persons and words . Experiments indicate that our approach consistently outperforms other unsupervised methods including spectral and DBSCAN clustering . Scalability is addressed by disambiguating authors in over 750,000 papers from the entire CiteSeer dataset .

O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information search and retrieval
unsupervised machine learning


Unsupervised query categorization using automatically-built concept graphs Automatic categorization of user queries is an important component of general purpose ( Web ) search engines , particularly for triggering rich , query-specific content and sponsored links . We propose an unsupervised learning scheme that reduces dramatically the cost of setting up and maintaining such a categorizer , while retaining good categorization power . The model is stored as a graph of concepts where graph edges represent the cross-reference between the concepts . Concepts and relations are extracted from query logs by an offline Web mining process , which uses a search engine as a powerful summarizer for building a concept graph . Empirical evaluation indicates that the system compares favorably on publicly available data sets ( such as KDD Cup 2005 ) as well as on portions of the current query stream of Yahoo ! Search , where it is already changing the experience of millions of Web search users .

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

query categorization
unsupervised learning
web mining

concept networks
cross-reference
information search and retrieval
knowledge based search


Decentralized orchestration of composite web services Web services make information and software available programmatically via the Internet and may be used as building blocks for applications . A composite web service is one that is built using multiple component web services and is typically specified using a language such as BPEL4WS or WSIPL . Once its specification has been developed , the composite service may be orchestrated either in a centralized or in a decentralized fashion . Decentralized orchestration offers performance improvements in terms of increased throughput and scalability and lower response time . However , decentralized orchestration also brings additional complexity to the system in terms of error recovery and fault handling . Further , incorrect design of a decentralized system can lead to potential deadlock or non-optimal usage of system resources . This paper investigates build time and runtime issues related to decentralized orchestration of composite web services . We support our design decisions with performance results obtained on a decentralized setup using BPEL4WS to describe the composite web services and BPWS4J as the underlying runtime environment to orchestrate them .

B I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I I O O O O O O O O O O O O O O O B O O O B I I O O O O O O O O O O O

bpel4ws
composite web services
decentralized orchestration


Live web search experiments for the rest of us There are significant barriers to academic research into user Web search preferences . Academic researchers are unable to manipulate the results shown by a major search engine to users and would have no access to the interaction data collected by the engine . Our initial approach to overcoming this was to ask participants to submit queries to an experimental search engine rather than their usual search tool . Over several different experiments we found that initial user buy-in was high but that people quickly drifted back to their old habits and stopped contributing data . Here , we report our investigation of possible reasons why this occurs . An alternative approach is exemplified by the Lemur browser toolbar , which allows local collection of user interaction data from search engine sessions , but does not allow result pages to be modified . We will demonstrate a new Firefox toolbar that we have developed to support experiments in which search results may be arbitrarily manipulated . Using our toolbar , academics can set up the experiments they want to conduct , while collecting ( subject to human experimentation guidelines ) queries , clicks and dwell times as well as optional explicit judgments .

O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

browser extensions
implicit measures
performance evaluation


Probabilistic question answering on the web Web-based search engines such as Google and NorthernLight return documents that are relevant to a user query , not answers to user questions . We have developed an architecture that augments existing search engines so that they support natural language question answering . The process entails five steps : query modulation , document retrieval , passage extraction , phrase extraction , and answer ranking . In this paper we describe some probabilistic approaches to the last three of these stages . We show how our techniques apply to a number of existing search engines and we also present results contrasting three different methods for question answering . Our algorithm , probabilistic phrase reranking ( PPR ) using proximity and question type features achieves a total reciprocal document rank of .20 on the TREC 8 corpus . Our techniques have been implemented as a Web-accessible system , called NSIR .

O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

query modulation
question answering
search engines

answer extraction
answer selection
information retrieval
miscellaneous
natural language processing


Ranking related entities for web search queries Entity ranking is a recent paradigm that refers to retrieving and ranking related objects and entities from different structured sources in various scenarios . Entities typically have associated categories and relationships with other entities . In this work , we present an extensive analysis of Web-scale entity ranking , based on machine learned ranking models using an ensemble of pairwise preference models . Our proposed system for entity ranking uses structured knowledge bases , entity relationship graphs and user data to derive useful features to facilitate semantic search with entities directly within the learning to rank framework . The experimental results are validated on a large-scale graph containing millions of entities and hundreds of millions of entity relationships . We show that our proposed ranking solution clearly improves a simple user behavior based ranking model .

O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A game theoretic formulation of the service provisioning problem in cloud systems Cloud computing is an emerging paradigm which allows the on-demand delivering of software , hardware , and data as services . As cloud-based services are more numerous and dynamic , the development of efficient service provisioning policies become increasingly challenging . Game theoretic approaches have shown to gain a thorough analytical understanding of the service provisioning problem . In this paper we take the perspective of Software as a Service ( SaaS ) providers which host their applications at an Infrastructure as a Service ( IaaS ) provider . Each SaaS needs to comply with quality of service requirements , specified in Service Level Agreement ( SLA ) contracts with the end-users , which determine the revenues and penalties on the basis of the achieved performance level . SaaS providers want to maximize their revenues from SLAs , while minimizing the cost of use of resources supplied by the IaaS provider . Moreover , SaaS providers compete and bid for the use of infrastructural resources . On the other hand , the IaaS wants to maximize the revenues obtained providing virtualized resources . In this paper we model the service provisioning problem as a Generalized Nash game , and we propose an efficient algorithm for the run time management and allocation of IaaS resources to competing SaaSs .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

game theory
generalized nash equilibrium
resource allocation


A pruning-based approach for supporting Top-K join queries An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost . This paper resolves this issue by proposing an efficient pruning-based approach to answer top-K join queries . The total amount of transmitted data can be greatly reduced by pruning tuples that can not produce the desired join results with a rank value greater than or equal to the rank value generated so far .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Unsupervised learning of soft patterns for generating definitions from online news Breaking news often contains timely definitions and descriptions of current terms , organizations and personalities . We utilize such web sources to construct definitions for such terms . Previous work has identified definitions using hand-crafted rules or supervised learning that constructs rigid , hard text patterns . In contrast , we demonstrate a new approach that uses flexible , soft matching patterns to characterize definition sentences . Our soft patterns are able to effectively accommodate the diversity of definition sentence structure exhibited in news . We use pseudo-relevance feedback to automatically label sentences for use in soft pattern generation . The application of our unsupervised method significantly improves baseline systems on both the standardized TREC corpus as well as crawled online news articles by 27 % and 30 % , respectively , in terms of F measure . When applied to a state-of-art definition generation system recently fielded in the TREC 2003 definitional question answering task , it improves the performance by 14 % .

B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I I O O O O O O O O O O

definition generation
definitional question answering
soft patterns
unsupervised learning

information search and retrieval
pseudo-relevance feedback


Counting beyond a Yottabyte , or how SPARQL 1.1 property paths will prevent adoption of the standard SPARQL - the standard query language for querying RDF - provides only limited navigational functionalities , although these features are of fundamental importance for graph data formats such as RDF . This has led the W3C to include the property path feature in the upcoming version of the standard , SPARQL 1.1 . We tested several implementations of SPARQL 1.1 handling property path queries , and we observed that their evaluation methods for this class of queries have a poor performance even in some very simple scenarios . To formally explain this fact , we conduct a theoretical study of the computational complexity of property paths evaluation . Our results imply that the poor performance of the tested implementations is not a problem of these particular systems , but of the specification itself . In fact , we show that any implementation that adheres to the SPARQL 1.1 specification ( as of November 2011 ) is doomed to show the same behavior , the key issue being the need for counting solutions imposed by the current specification . We provide several intractability results , that together with our empirical results , provide strong evidence against the current semantics of SPARQL 1.1 property paths . Finally , we put our results in perspective , and propose a natural alternative semantics with tractable evaluation , that we think may lead to a wide adoption of the language by practitioners , developers and theoreticians .

O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

bag semantics
counting complexity
sparql 1.1


Clustering user queries of a search engine

query clustering
user log
web data mining


Random surfer with back step We present a novel link-based ranking algorithm RBS , which may be viewed as an extension of PageRank by back-step feature .

O O O B I O O O O O O O O O O O O O O O O O B O O O O


Measuring the web crawler ethics Web crawlers are highly automated and seldom regulated manually . The diversity of crawler activities often leads to ethical problems such as spam and service attacks . In this research , quantitative models are proposed to measure the web crawler ethics based on their behaviors on web servers . We investigate and define rules to measure crawler ethics , referring to the extent to which web crawlers respect the regulations set forth in robots . txt configuration files . We propose a vector space model to represent crawler behavior and measure the ethics of web crawlers based on the behavior vectors . The results show that ethicality scores vary significantly among crawlers . Most commercial web crawlers ' behaviors are ethical . However , many commercial crawlers still consistently violate or misinterpret certain robots . txt rules . We also measure the ethics of big search engine crawlers in terms of return on investment . The results show that Google has a higher score than other search engines for a US website but has a lower score than Baidu for Chinese websites .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Building adaptable and reusable XML applications with model transformations We present an approach in which the semantics of an XML language is defined by means of a transformation from an XML document model ( an XML schema ) to an application specific model . The application specific model implements the intended behavior of documents written in the language . A transformation is specified in a model transformation language used in the Model Driven Architecture ( MDA ) approach for software development . Our approach provides a better separation of three concerns found in XML applications : syntax , syntax processing logic and intended meaning of the syntax . It frees the developer of low-level syntactical details and improves the adaptability and reusability of XML applications . Declarative transformation rules and the explicit application model provide a finer control over the application parts affected by adaptations . Transformation rules and the application model for an XML language may be composed with the corresponding rules and application models defined for other XML languages . In that way we achieve reuse and composition of XML applications .

O O O O B O O B I O O O O O O O O O O B O O O O O O O O O O B O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O B O O

mda
model transformations
transformation language
xml


A component model for stardardized web-based education

authoring tools
collaborative systems
educational web applications
learing technology standardization
learning technology
practice and experience
web-based course delivery systems


Object-level ranking : bringing order to Web objects In contrast with the current Web search methods that essentially do document-level ranking and retrieval , we are exploring a new paradigm to enable Web search at the object level . We collect Web information for objects relevant for a specific application domain and rank these objects in terms of their relevance and popularity to answer user queries . Traditional PageRank model is no longer valid for object popularity calculation because of the existence of heterogeneous relationships between objects . This paper introduces PopRank , a domain-independent object-level link analysis model to rank the objects within a specific domain . Specifically we assign a popularity propagation factor to each type of object relationship , study how different popularity propagation factors for these heterogeneous relationships could affect the popularity ranking , and propose efficient approaches to automatically decide these factors . Our experiments are done using 1 million CS papers , and the experimental results show that PopRank can achieve significantly better ranking results than naively applying PageRank on the object graph .

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O

link analysis
pagerank
poprank
web objects

information search and retrieval
web information retrieval


Reliable QoS monitoring based on client feedback Service-level agreements ( SLAs ) establish a contract between service providersand clients concerning Quality of Service ( QoS ) parameters . Without properpenalties , service providers have strong incentives to deviate from theadvertised QoS , causing losses to the clients . Reliable QoS monitoring ( andproper penalties computed on the basis of delivered QoS ) are thereforeessential for the trustworthiness of a service-oriented environment . In thispaper , we present a novel QoS monitoring mechanism based on quality ratings from theclients . A reputation mechanism collects the ratings and computes theactual quality delivered to the clients . The mechanism provides incentives forthe clients to report honestly , and pays special attention to minimizing costand overhead1 .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

distributed artificial intelligence
incentive compatibility
quality-of-service
service-level agreement
service-oriented computing


The credibility of the posted information in a recommendation system based on a map We propose a method for estimating the credibility of the posted information from users . The system displays these information on the map . Since posted information can include subjective information from various perspectives , we ca n't trust all of the postings as they are . We propose and integrate factors of the user 's geographic posting tendency and votes by other users .

O B O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O


Invisible participants : how cultural capital relates to lurking behavior The asymmetry of activity in virtual communities is of great interest . While participation in the activities of virtual communities is crucial for a community 's survival and development , many people prefer lurking , that is passive attention over active participation . Lurking can be measured and perhaps affected by both dispositional and situational variables . This work investigates the concept of cultural capital as situational antecedent of lurking and de-lurking ( the decision to start posting after a certain amount of lurking time ) . Cultural capital is defined as the knowledge that enables an individual to interpret various cultural codes . The main hypothesis states that a user 's cultural capital affects her level of activity in a community and her decision to de-lurk and cease to exist in very active communities because of information overload . This hypothesis is analyzed by mathematically defining a social communication network ( SCN ) of activities in authenticated discussion forums . We validate this model by examining the SCN using data collected in a sample of 636 online forums in Open University in Israel and 2 work based communities from IBM . The hypotheses verified here make it clear that fostering receptive participation may be as important and constructive as encouraging active contributions in online communities .

O O O O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B I O O O O B O O O O O O O O O O O O O B O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Highly efficient algorithms for structural clustering of large websites In this paper , we present a highly scalable algorithm for structurally clustering webpages for extraction . We show that , using only the URLs of the webpages and simple content features , it is possible to cluster webpages effectively and efficiently . At the heart of our techniques is a principled framework , based on the principles of information theory , that allows us to effectively leverage the URLs , and combine them with content and structural properties . Using an extensive evaluation over several large full websites , we demonstrate the effectiveness of our techniques , at a scale unattainable by previous techniques .

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information extraction
minimum description length


Learning to detect phishing emails Each month , more attacks are launched with the aim of making web users believe that they are communicating with a trusted entity for the purpose of stealing account information , logon credentials , and identity information in general . This attack method , commonly known as `` phishing , '' is most commonly initiated by sending out emails with links to spoofed websites that harvest information . We present a method for detecting these attacks , which in its most general form is an application of machine learning on a feature set designed to highlight user-targeted deception in electronic communication . This method is applicable , with slight modification , to detection of phishing websites , or the emails used to direct victims to these sites . We evaluate this method on a set of approximately 860 such phishing emails , and 6950 non-phishing emails , and correctly identify over 96 % of the phishing emails while only mis-classifying on the order of 0.1 % of the legitimate emails . We conclude with thoughts on the future for such techniques to specifically identify deception , specifically with respect to the evolutionary nature of the attacks and information available .

B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Capturing RIA concepts in a web modeling language This work addresses conceptual modeling and automatic code generation for Rich Internet Applications , a variant of Web-based systems bridging the gap between desktop and Web interfaces . The approach we propose is a first step towards a full integration of RIA paradigms into the Web development process , enabling the specification of complex Web solutions mixing HTTP+HTML and Rich Internet Applications , using a single modeling language and tool .

O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O

computer-aided software engineering
web engineering
web site design


LSH forest : self-tuning indexes for similarity search We consider the problem of indexing high-dimensional data for answering ( approximate ) similarity-search queries . Similarity indexes prove to be important in a wide variety of settings : Web search engines desire fast , parallel , main-memory-based indexes for similarity search on text data ; database systems desire disk-based similarity indexes for high-dimensional data , including text and images ; peer-to-peer systems desire distributed similarity indexes with low communication cost . We propose an indexing scheme called LSH Forest which is applicable in all the above contexts . Our index uses the well-known technique of locality-sensitive hashing ( LSH ) , but improves upon previous designs by ( a ) eliminating the different data-dependent parameters for which LSH must be constantly hand-tuned , and ( b ) improving on LSH 's performance guarantees for skewed data distributions while retaining the same storage and query overhead . We show how to construct this index in main memory , on disk , in parallel systems , and in peer-to-peer systems . We evaluate the design with experiments on multiple text corpora and demonstrate both the self-tuning nature and the superior performance of LSH Forest .

O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Scheduling web requests in broadcast environments 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 .

O B O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

scheduling algorithms
time constraints
web


WCAG formalization with W3C standards Web accessibility consists on a set of checkpoints which are rather expensive to evaluate or to spot . However , using W3C technologies , this cost can be clearly minimized . This article presents a W3C formalized rule-set version for automatable checkpoints from WCAG 1.0 .

B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O

hypertext/hypermedia
miscellaneous
user interfaces
wai
xpath
xpointer
xquery


Securing web application code by static analysis and runtime protection Security remains a major roadblock to universal acceptance of the Web for many kinds of transactions , especially since the recent sharp increase in remotely exploitable vulnerabilities have been attributed to Web application bugs . Many verification tools are discovering previously unknown vulnerabilities in legacy C programs , raising hopes that the same success can be achieved with Web applications . In this paper , we describe a sound and holistic approach to ensuring Web application security . Viewing Web application vulnerabilities as a secure information flow problem , we created a lattice-based static analysis algorithm derived from type systems and typestate , and addressed its soundness . During the analysis , sections of code considered vulnerable are instrumented with runtime guards , thus securing Web applications in the absence of user intervention . With sufficient annotations , runtime overhead can be reduced to zero . We also created a tool named . WebSSARI ( Web application Security by Static Analysis and Runtime Inspection ) to test our algorithm , and used it to verify 230 open-source Web application projects on SourceForge.net , which were selected to represent projects of different maturity , popularity , and scale . 69 contained vulnerabilities . After notifying the developers , 38 acknowledged our findings and stated their plans to provide patches . Our statistics also show that static analysis reduced potential runtime overhead by 98.4 % .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information flow
type systems
web application security

invasive software
noninterference
program security
security vulnerabilities
unauthorized access


A proposal for an owl rules language Although the OWLWeb Ontology Language adds considerable expressive power to the Semantic Web it does have expressive limitations , particularly with respect to what can be said about properties . Wepresent ORL ( OWL Rules Language ) , a Horn clause rules extension to OWL that overcomes many of these limitations . ORL extends OWL in a syntactically and semantically coherent manner : the basic syntax for ORL rules is an extension of the abstract syntax for OWL DL and OWLLite ; ORL rules are given formal meaning via an extension of the OWLDL model-theoretic semantics ; ORL rules are given an XML syntax basedon the OWL XML presentation syntax ; and a mapping from ORL rules to RDF graphs is given based on the OWL RDF\/XML exchange syntax . Wediscuss the expressive power of ORL , showing that the ontology consistency problem is undecidable , provide several examples of ORLusage , and discuss how reasoning support for ORL might be provided .

O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Improving pseudo-relevance feedback in web information retrieval using web page segmentation In contrast to traditional document retrieval , a web page as a whole is not a good information unit to search because it often contains multiple topics and a lot of irrelevant information from navigation , decoration , and interaction part of the page . In this paper , we propose a VIsion-based Page Segmentation ( VIPS ) algorithm to detect the semantic content structure in a web page . Compared with simple DOM based segmentation method , our page segmentation scheme utilizes useful visual cues to obtain a better partition of a page at the semantic level . By using our VIPS algorithm to assist the selection of query expansion terms in pseudo-relevance feedback in web information retrieval , we achieve 27 % performance improvement on Web Track dataset .

O O O O B I I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I I O O O O O O O O O O O O

page segmentation
query expansion
web information retrieval


Web page rank prediction with markov models In this paper we propose a method for predicting the ranking position of a Web page . Assuming a set of successive past top-k rankings , we study the evolution of Web pages in terms of ranking trend sequences used for Markov Models training , which are in turn used to predict future rankings . The predictions are highly accurate for all experimental setups and similarity measures .

O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O


A scheme of service discovery and control on ubiquitous devices 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 . ''

O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

ad-hoc network
peer to peer
user interfaces


Web-scale classification with naive bayes Traditional Naive Bayes Classifier performs miserably on web-scale taxonomies . In this paper , we investigate the reasons behind such bad performance . We discover that the low performance are not completely caused by the intrinsic limitations of Naive Bayes , but mainly comes from two largely ignored problems : contradiction pair problem and discriminative evidence cancelation problem . We propose modifications that can alleviate the two problems while preserving the advantages of Naive Bayes . The experimental results show our modified Naive Bayes can significantly improve the performance on real web-scale taxonomies .

O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O


Combining anchor text categorization and graph analysis for paid link detection In order to artificially boost the rank of commercial pages in search engine results , search engine optimizers pay for links to these pages on other websites . Identifying paid links is important for a web search engine to produce highly relevant results . In this paper we introduce a novel method of identifying such links . We start with training a classifier of anchor text topics and analyzing web pages for diversity of their outgoing commercial links . Then we use this information and analyze link graph of the Russian Web to find pages that sell links and sites that buy links and to identify the paid links . Testing on manually marked samples showed high efficiency of the algorithm .

O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

language model
link analysis
machine learning
search engines
web mining


SemTag and seeker : bootstrapping the semantic web via automated semantic annotation This paper describes Seeker , a platform for large-scale text analytics , and SemTag , an application written on the platform to perform automated semantic tagging of large corpora . We apply SemTag to a collection of approximately 264 million web pages , and generate approximately 434 million automatically disambiguated semantic tags , published to the web as a label bureau providing metadata regarding the 434 million annotations . To our knowledge , this is the largest scale semantic tagging effort to date . We describe the Seeker platform , discuss the architecture of the SemTag application , describe a new disambiguation algorithm specialized to support ontological disambiguation of large-scale data , evaluate the algorithm , and present our final results with information about acquiring and making use of the semantic tags . We argue that automated large scale semantic tagging of ambiguous content can bootstrap and accelerate the creation of the semantic web .

O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

automated semantic tagging
text analytics

data mining
information retrieval
large text datasets
software architectures


Personalizing E-commerce applications with on-line heuristic decision making

b2c e-commerce
decision support
personalization
pro-active intervention
vortex rules system


Forcehttps : protecting high-security web sites from network attacks 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 .

O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O

eavesdropping
pharming
same-origin policy
unauthorized access


SweetDeal : representing agent contracts with exceptions using XML rules , ontologies , and process descriptions SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create , evaluate , negotiate , and execute contracts with substantial automation and modularity . It builds upon the situated courteous logic programs knowledge representation in RuleML , the emerging standard for Semantic Web XML rules . Here , we newly extend the SweetDeal approach by also incorporating process knowledge descriptions whose ontologies are represented in DAML+OIL ( emerging standard for Semantic Web ontologies ) thereby enabling more complex contracts with behavioral provisions , especially for handling exception conditions ( e.g. , late delivery or non-payment ) that might arise during the execution of the contract . This provides a foundation for representing and automating deals about services -- in particular , about Web Services , so as to help search , select , and compose them . Our system is also the first to combine emerging Semantic Web standards for knowledge representation of rules ( RuleML ) with ontologies ( DAML+OIL ) for a practical e-business application domain , and further to do so with process knowledge . This also newly fleshes out the evolving concept of Semantic Web Services . A prototype ( soon public ) is running .

O O O O O O O O B B O B O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I B I O O O O O O O B I B B O O O O O O O O O O O O B I O O B O O O O O O O O B I B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O O B I O B O O O O B O O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O

knowledge representation
logic programs
ontologies
process descriptions
process knowledge
rules
semantic web
web services
xml

business process automation
daml+oil
declarative
description logic
electronic commerce
electronic contracts
intelligent software agents
knowledge-based
owl
rdf
representations
semantic web services


The two cultures : mashing up web 2.0 and the semantic web A common perception is that there are two competing visions for the future evolution of the Web : the Semantic Web and Web 2.0 . A closer look , though , reveals that the core technologies and concerns of these two approaches are complementary and that each field can and must draw from the other 's strengths . We believe that future web applications will retain the Web 2.0 focus on community and usability , while drawing on Semantic Web infrastructure to facilitate mashup-like information sharing . However , there are several open issues that must be addressed before such applications can become commonplace . In this paper , we outline a semantic weblogs scenario that illustrates the potential for combining Web 2.0 and Semantic Web technologies , while highlighting the unresolved issues that impede its realization . Nevertheless , we believe that the scenario can be realized in the short-term . We point to recent progress made in resolving each of the issues as well as future research directions for each of the communities .

O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

blog
on-line information services
rdf
vision
web 2.0


Automatic extraction of web search interfaces for interface schema integration This paper provides an overview of a technique for extracting information from the Web search interfaces of e-commerce search engines that is useful for supporting automatic search interface integration . In particular , we discuss how to group elements and labels on a search interface into attributes and how to derive certain meta-information for each attribute .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

metasearch engine
search engine
search interface extraction
search interface representation
user interface management systems


Hierarchical substring caching for efficient content distribution to low-bandwidth clients While overall bandwidth in the internet has grown rapidly over the last few years , and an increasing number of clients enjoy broadband connectivity , many others still access the internet over much slower dialup or wireless links . To address this issue , a number of techniques for optimized delivery of web and multimedia content over slow links have been proposed , including protocol optimizations , caching , compression , and multimedia transcoding , and several large ISPs have recently begun to widely promote dialup acceleration services based on such techniques . A recent paper by Rhea , Liang , and Brewer proposed an elegant technique called value-based caching that caches substrings of files , rather than entire files , and thus avoids repeated transmission of substrings common to several pages or page versions . We propose and study a hierarchical substring caching technique that provides significant savings over this basic approach . We describe several additional techniques for minimizing overheads and perform an evaluation on a large set of real web access traces that we collected . In the second part of our work , we compare our approach to a widely studied alternative approach based on delta compression , and show how to integrate the two for best overall performance . The studied techniques are typically employed in a client-proxy environment , with each proxy serving a large number of clients , and an important aspect is how to conserve resources on the proxy while exploiting the significant memory and CPU power available on current clients .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

applications
http
web caching
web proxies
www


Better abstractions for secure server-side scripting It is notoriously difficult to program a solid web application . Besides addressing web interactions , state maintenance , and whimsical user navigation behaviors , programmers must also avoid a minefield of security vulnerabilities . The problem is twofold . First , we lack a clear understanding of the new computation model underlying web applications . Second , we lack proper abstractions for hiding common and subtle coding details that are orthogonal to the business functionalities of specific web applications . This paper addresses both issues . First , we present a language BASS for declarative server-side scripting . BASS allows programmers to work in an ideal world , using new abstractions to tackle common but problematic aspects of web programming . The meta properties of BASS provide useful security guarantees . Second , we present a language MOSS reflecting realistic web programming concepts and scenarios , thus articulating the computation model behind web programming . Finally , we present a translation from BASS to MOSS , demonstrating how the ideal programming model and security guarantees of BASS can be implemented in practice .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

formal definitions and theory
server-side scripting
web application security


Automatic detection of fragments in dynamically generated web pages Dividing web pages into fragments has been shown to provide significant benefits for both content generation and caching . In order for a web site to use fragment-based content generation , however , good methods are needed for dividing web pages into fragments . Manual fragmentation of web pages is expensive , error prone , and unscalable . This paper proposes a novel scheme to automatically detect and flag fragments that are cost-effective cache units in web sites serving dynamic content . We consider the fragments to be interesting if they are shared among multiple documents or they have different lifetime or personalization characteristics . Our approach has three unique features . First , we propose a hierarchical and fragment-aware model of the dynamic web pages and a data structure that is compact and effective for fragment detection . Second , we present an efficient algorithm to detect maximal fragments that are shared among multiple documents . Third , we develop a practical algorithm that effectively detects fragments based on their lifetime and personalization characteristics . We evaluate the proposed scheme through a series of experiments , showing the benefits and costs of the algorithms . We also study the impact of adopting the fragments detected by our system on disk space utilization and network bandwidth consumption .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

dynamic content caching
fragment-based caching
general
l-p fragments
shared fragments


Visual diversification of image search results Due to the reliance on the textual information associated with an image , image search engines on the Web lack the discriminative power to deliver visually diverse search results . The textual descriptions are key to retrieve relevant results for a given user query , but at the same time provide little information about the rich image content . In this paper we investigate three methods for visual diversification of image search results . The methods deploy lightweight clustering techniques in combination with a dynamic weighting function of the visual features , to best capture the discriminative aspects of the resulting set of images that is retrieved . A representative image is selected from each cluster , which together form a diverse result set . Based on a performance evaluation we find that the outcome of the methods closely resembles human perception of diversity , which was established in an extensive clustering experiment carried out by human assessors .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

content analysis and indexing
flickr
image clustering
on-line information services
visual diversity


Map adaptation for users of mobile systems

adaptive application
portable devices
quality of service
web


Efficient k-nearest neighbor graph construction for generic similarity measures K-Nearest Neighbor Graph ( K-NNG ) construction is an important operation with many web related applications , including collaborative filtering , similarity search , and many others in data mining and machine learning . Existing methods for K-NNG construction either do not scale , or are specific to certain similarity measures . We present NN-Descent , a simple yet efficient algorithm for approximate K-NNG construction with arbitrary similarity measures . Our method is based on local search , has minimal space overhead and does not rely on any shared global index . Hence , it is especially suitable for large-scale applications where data structures need to be distributed over the network . We have shown with a variety of datasets and similarity measures that the proposed method typically converges to above 90 % recall with each point comparing only to several percent of the whole dataset on average .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

arbitrary similarity measure
information storage and retrieval
iterative method
k-nearest neighbor graph


SemRank : ranking complex relationship search results on the semantic web While the idea that querying mechanisms for complex relationships ( otherwise known as Semantic Associations ) should be integral to Semantic Web search technologies has recently gained some ground , the issue of how search results will be ranked remains largely unaddressed . Since it is expected that the number of relationships between entities in a knowledge base will be much larger than the number of entities themselves , the likelihood that Semantic Association searches would result in an overwhelming number of results for users is increased , therefore elevating the need for appropriate ranking schemes . Furthermore , it is unlikely that ranking schemes for ranking entities ( documents , resources , etc. ) may be applied to complex structures such as Semantic Associations . In this paper , we present an approach that ranks results based on how predictable a result might be for users . It is based on a relevance model SemRank , which is a rich blend of semantic and information-theoretic techniques with heuristics that supports the novel idea of modulative searches , where users may vary their search modes to effect changes in the ordering of results depending on their need . We also present the infrastructure used in the SSARK system to support the computation of SemRank values for resulting Semantic Associations and their ordering .

B O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O

discovery query
information search and retrieval
path expression tree
ranking complex relationships
semantic associations search
semantic match
semantic ranking
semantic relationship search
semantic similarity
semantic summary


POLYPHONET : an advanced social network extraction system from the web Social networks play important roles in the Semantic Web : knowledge management , information retrieval , ubiquitous computing , and so on . We propose a social network extraction system called POLYPHONET , which employs several advanced techniques to extract relations of persons , detect groups of persons , and obtain keywords for a person . Search engines , especially Google , are used to measure co-occurrence of information and obtain Web documents . Several studies have used search engines to extract social networks from the Web , but our research advances the following points : First , we reduce the related methods into simple pseudocodes using Google so that we can build up integrated systems . Second , we develop several new algorithms for social networking mining such as those to classify relations into categories , to make extraction scalable , and to obtain and utilize person-to-word relations . Third , every module is implemented in POLYPHONET , which has been used at four academic conferences , each with more than 500 participants . We overview that system . Finally , a novel architecture called Super Social Network Mining is proposed ; it utilizes simple modules using Google and is characterized by scalability and Relate-Identify processes : Identification of each entity and extraction of relations are repeated to obtain a more precise social network .

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O

information search and retrieval
search engine
web mining


Service-oriented data denormalization for scalable web applications Many techniques have been proposed to scale web applications . However , the data interdependencies between the database queries and transactions issued by the applications limit their efficiency . We claim that major scalability improvements can be gained by restructuring the web application data into multiple independent data services with exclusive access to their private data store . While this restructuring does not provide performance gains by itself , the implied simplification of each database workload allows a much more efficient use of classical techniques . We illustrate the data denormalization process on three benchmark applications : TPC-W , RUBiS and RUBBoS . We deploy the resulting service-oriented implementation of TPC-W across an 85-node cluster and show that restructuring its data can provide at least an order of magnitude improvement in the maximum sustainable throughput compared to master-slave database replication , while preserving strong consistency and transactional properties .

O B I O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

data denormalization
scalability
web applications


FLUX : fuzzy content and structure matching of XML range queries An XML range query may impose predicates on the numerical or textual contents of the elements and\/or their respective path structures . In order to handle content and structure range queries efficiently , an XML query processing engine needs to incorporate effective indexing and summarization techniques to efficiently partition the XML document and locate the results . In this paper , we propose a dynamic summarization and indexing method , FLUX , based on Bloom filters and B + - trees to tackle these problems . The results of our extensive experimental evaluations indicated the efficiency of the proposed system .

O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Using urls and table layout for web classification tasks We propose new features and algorithms for automating Web-page classification tasks such as content recommendation and ad blocking . We show that the automated classification of Web pages can be much improved if , instead of looking at their textual content , we consider each links 's URL and the visual placement of those links on a referring page . These features are unusual : rather than being scalar measurements like word counts they are tree structured -- describing the position of the item in a tree . We develop a model and algorithm for machine learning using such tree-structured features . We apply our methods in automated tools for recognizing and blocking Web advertisements and for recommending `` interesting '' news stories to a reader . Experiments show that our algorithms are both faster and more accurate than those based on the text content of Web documents .

O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

models and principles
news recommendation
tree structures
web applications


N for the price of 1 : bundling web objects for more efficient content delivery

delta encoding
http
network protocols
persistent connections
standards
web performance


Semantic WS-agreement partner selection In a dynamic service oriented environment it is desirable for service consumers and providers to offer and obtain guarantees regarding their capabilities and requirements . WS-Agreement defines a language and protocol for establishing agreements between two parties . The agreements are complex and expressive to the extent that the manual matching of these agreements would be expensive both in time and resources . It is essential to develop a method for matching agreements automatically . This work presents the framework and implementation of an innovative tool for the matching providers and consumers based on WS-Agreements . The approach utilizes Semantic Web technologies to achieve rich and accurate matches . A key feature is the novel and flexible approach for achieving user personalized matches .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

agreement matching
arl
dynamic service selection
information search and retrieval
multi-ontology service annotation
ontologies
owl
semantic policy matching
semantic web service
snobase
ws-agreement
wsdl-s


General auction mechanism for search advertising In sponsored search , a number of advertising slots is available on a search results page , and have to be allocated among a set of advertisers competing to display an ad on the page . This gives rise to a bipartite matching market that is typically cleared by the way of an automated auction . Several auction mechanisms have been proposed , with variants of the Generalized Second Price ( GSP ) being widely used in practice . There is a rich body of work on bipartite matching markets that builds upon the stable marriage model of Gale and Shapley and the assignment model of Shapley and Shubik . This line of research offers deep insights into the structure of stable outcomes in such markets and their incentive properties . In this paper , we model advertising auctions in terms of an assignment model with linear utilities , extended with bidder and item specific maximum and minimum prices . Auction mechanisms like the commonly used GSP or the well-known Vickrey-Clarke-Groves ( VCG ) can be interpreted as simply computing a bidder-optimal stable matching in this model , for a suitably defined set of bidder preferences , but our model includes much richer bidders and preferences . We prove that in our model the existence of a stable matching is guaranteed , and under a non-degeneracy assumption a bidder-optimal stable matching exists as well . We give an algorithm to find such matching in polynomial time , and use it to design truthful mechanism that generalizes GSP , is truthful for profit-maximizing bidders , correctly implements features like bidder-specific minimum prices and position-specific bids , and works for rich mixtures of bidders and preferences . Our main technical contributions are the existence of bidder-optimal matchings and strategyproofness of the resulting mechanism , and are proved by induction on the progress of the matching algorithm .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

game theory
sponsored search auctions
stable matchings


Design for verification for asynchronously communicating Web services 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 .

O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

asynchronous communication
design patterns
design tools and techniques


CTR-S

a

logic

for

specifying

contracts

in

semantic

web

services

A

requirements

analysis

in

the

emerging

field

of

Semantic

Web

Services

SWS

see

http:\/\/daml.org\/services\/swsl\/requirements\/

has

identified

four

major

areas

of

research

intelligent

service

discovery

automated

contracting

of

services

process

modeling

and

service

enactment

This

paper

deals

with

the

intersection

of

two

of

these

areas

process

modeling

as

it

pertains

to

automated

contracting

Specifically

we

propose

a

logic

called

CTR-S

which

captures

the

dynamic

aspects

of

contracting

for

services

Since

CTR-S

is

an

extension

of

the

classical

first-order

logic

it

is

well-suited

to

model

the

static

aspects

of

contracting

as

well

A

distinctive

feature

of

contracting

is

that

it

involves

two

or

more

parties

in

a

potentially

adversarial

situation

CTR-S

is

designed

to

model

this

adversarial

situation

through

its

novel

model

theory

which

incorporates

certain

game-theoretic

concepts

In

addition

to

the

model

theory

we

develop

a

proof

theory

for

CTR-S

and

demonstrate

the

use

of

the

logic

formodeling

and

reasoning

about

Web

service

contracts

O O O O O O B O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O

languages and systems
miscellaneous
services composition


Race : finding and ranking compact connected trees for keyword proximity search over xml documents In this paper , we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness . We take the disjunctive semantics among input keywords into consideration and identify meaningful compact connected trees as the answers of keyword proximity queries . We introduce the notions of Compact Lowest Common Ancestor ( CLCA ) and Maximal CLCA ( MCLCA ) and propose Compact Connected Trees ( CCTrees ) and Maximal CCTrees ( MCCTrees ) to efficiently and effectively answer keyword queries . We propose a novel ranking mechanism , RACE , to Rank compAct Connected trEes , by taking into consideration both the structural similarity and the textual similarity . Our extensive experimental study shows that our method achieves both high search efficiency and effectiveness , and outperforms existing approaches significantly .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Using proxy cache relocation to accelerate Web browsing in wireless\/mobile communications

learning automaton
mobile computing
path prediction
proxy cache
w4


VoiSTV : voice-enabled social TV Until recently , the TV viewing experience has not been a very social activity compared to activities on the World Wide Web . In this work , we will present a Voice-enabled Social TV system ( VoiSTV ) which allows users to interact , follow and monitor the online social media messages related to a TV show while watching it . Users can create , send , and reply to messages using spoken language . VoiSTV also provides metadata information about TV shows such as trends , hot topics , popularity as well as aggregated sentiment of show-related messages , all of which are valuable for TV program search and recommendation .

O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

iptv
social data mining
speech interface
twitter
user interfaces


Exploiting web search to generate synonyms for entities Tasks recognizing named entities such as products , people names , or locations from documents have recently received significant attention in the literature . Many solutions to these tasks assume the existence of reference entity tables . An important challenge that needs to be addressed in the entity extraction task is that of ascertaining whether or not a candidate string approximately matches with a named entity in a given reference table . Prior approaches have relied on string-based similarity which only compare a candidate string and an entity it matches with . In this paper , we exploit web search engines in order to define new similarity functions . We then develop efficient techniques to facilitate approximate matching in the context of our proposed similarity functions . In an extensive experimental evaluation , we demonstrate the accuracy and efficiency of our techniques .

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O