Delivering web service coordination capability to users As web service technology matures there is growing interest in exploiting workflow techniques to coordinate web services . Bioinformaticians are a user community who combine web resources to perform in silico experiments . These users are scientists and not information technology experts they require workflow solutions that have a low cost of entry for service users and providers . Problems satisfying these requirements with current techniques led to the development of the Simple conceptual unified flow language ( Scufl ) . Scufl is supported by the Freefluo enactment engine ( 1 ) , and the Taverna editing workbench ( 3 ) . The extensibility of Scufl , supported by these tools , means that workflows coordinating web services can be matched to how users view their problems . The Taverna workbench exploits the web to keep Scufl simple by retrieving detail from URIs when required , and by scavenging the web for services . Scufl and its tools are not bioinformatics specific . They can be exploited by other communities who require user-driven composition and execution of workflows coordinating web resources .

O B I I 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 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 B O O O O O O O O O O O O O O O O O O O O O

bioinformatics
web service coordination
web services

e-science
scientific workflows
web programming


Hunter gatherer : interaction support for the creation and management of within-web-page collections Hunter Gatherer is an interface that lets Web users carry out three main tasks : ( 1 ) collect components from within Web pages ; ( 2 ) represent those components in a collection ; ( 3 ) edit those component collections . Our research shows that while the practice of making collections of content from within Web pages is common , it is not frequent , due in large part to poor interaction support in existing tools . We engaged with users in task analysis as well as iterative design reviews in order to understand the interaction issues that are part of within-Web-page collection making and to design an interaction that would support that process . We report here on that design development , as well as on the evaluations of the tool that evolved from that process , and the future work stemming from these results , in which our critical question is : what happens to users perceptions and expectations of web-based information ( their web-based information management practices ) when they can treat this information as harvestable , recontextualizable data , rather than as fixed pages ?

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

attention
information gathering and management
transclusions
web-based interaction design


Using d-gap patterns for index compression Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property . In this paper the information of d-gap sequential patterns is used as a new dimension for improving inverted index compression . We first detect d-gap sequential patterns using a novel data structure , UpDown Tree . Based on the detected patterns , we further substitute each pattern with its pattern Id in the inverted lists that contain it . The resulted inverted lists are then coded with an existing coding scheme . Experiments show that this approach can effectively improve the compression ratio of existing codes .

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 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


An experimental study on large-scale web categorization Taxonomies of the Web typically have hundreds of thousands of categories and skewed category distribution over documents . It is not clear whether existing text classification technologies can perform well on and scale up to such large-scale applications . To understand this , we conducted the evaluation of several representative methods ( Support Vector Machines , k-Nearest Neighbor and Naive Bayes ) with Yahoo ! taxonomies . In particular , we evaluated the effectiveness\/efficiency tradeoff in classifiers with hierarchical setting compared to conventional ( flat ) setting , and tested popular threshold tuning strategies for their scalability and accuracy in large-scale classification problems .

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

algorithm complexity
parameter tuning strategies
text categorization
very large web taxonomies


A browser for browsing the past web We describe a browser for the past web . It can retrieve data from multiple past web resources and features a passive browsing style based on change detection and presentation . The browser shows past pages one by one along a time line . The parts that were changed between consecutive page versions are animated to reflect their deletion or insertion , thereby drawing the user 's attention to them . The browser enables automatic skipping of changeless periods and filtered browsing based on user specified query .

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Web browsing performance of wireless thin-client computing Web applications are becoming increasingly popular for mobile wireless systems . However , wireless networks can have high packet loss rates , which can degrade web browsing performance on wireless systems . An alternative approach is wireless thin-client computing , in which the web browser runs on a remote thin server with a more reliable wired connection to the Internet . A mobile client then maintains a connection to the thin server to receive display updates over the lossy wireless network . To assess the viability of this thin-client approach , we compare the web browsing performance of thin clients against fat clients that run the web browser locally in lossy wireless networks . Our results show that thin clients can operate quite effectively over lossy networks . Compared to fat clients running web browsers locally , our results show surprisingly that thin clients can be faster and more resilient on web applications over lossy wireless LANs despite having to send more data over the network . We characterize and analyze different design choices in various thin-client systems and explain why these approaches can yield superior web browsing performance in lossy wireless networks .

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

thin-client computing
web performance
wireless and mobility


Efficiently evaluating graph constraints in content-based publish\/subscribe We introduce the problem of evaluating graph constraints in content-based publish\/subscribe ( pub\/sub ) systems . This problem formulation extends traditional content-based pub\/sub systems in the following manner : publishers and subscribers are connected via a ( logical ) directed graph G with node and edge constraints , which limits the set of valid paths between them . Such graph constraints can be used to model a Web advertising exchange ( where there may be restrictions on how advertising networks can connect advertisers and publishers ) and content delivery problems in social networks ( where there may be restrictions on how information can be shared via the social graph ) . In this context , we develop efficient algorithms for evaluating graph constraints over arbitrary directed graphs G. We also present experimental results that demonstrate the effectiveness and scalability of the proposed algorithms using a realistic dataset from Yahoo ! 's Web advertising exchange .

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 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 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


On the informativeness of cascade and intent-aware effectiveness measures The Maximum Entropy Method provides one technique for validating search engine effectiveness measures . Under this method , the value of an effectiveness measure is used as a constraint to estimate the most likely distribution of relevant documents under a maximum entropy assumption . This inferred distribution may then be compared to the actual distribution to quantify the `` informativeness '' of the measure . The inferred distribution may also be used to estimate values for other effectiveness measures . Previous work focused on traditional effectiveness measures , such as average precision . In this paper , we extend the Maximum Entropy Method to the newer cascade and intent-aware effectiveness measures by considering the dependency of the documents ranked in a results list . These measures are intended to reflect the novelty and diversity of search results in addition to the traditional relevance . Our results indicate that intent-aware measures based on the cascade model are informative in terms of both inferring actual distribution and predicting the values of other retrieval measures .

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 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 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 B 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

diversity
effectiveness measures
novelty


Web resource geographic location classification and detection Rapid pervasion of the web into users ' daily lives has put much importance on capturing location-specific information on the web , due to the fact that most human activities occur locally around where a user is located . This is especially true in the increasingly popular mobile and local search environments . Thus , how to correctly and effectively detect locations from web resources has become a key challenge to location-based web applications . In this paper , we first explicitly distinguish the locations of web resources into three types to cater to different application needs : 1 ) provider location ; 2 ) content location ; and 3 ) serving location . Then we describe a unified system that computes each of the three locations , employing a set of algorithms and different geographic sources .

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 B I 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

content location
geographic location
provider location
serving location

location-based web application
web location


Subspace : secure cross-domain communication for web mashups Combining data and code from third-party sources has enabled a new wave of web mashups that add creativity and functionality to web applications . However , browsers are poorly designed to pass data between domains , often forcing web developers to abandon security in the name of functionality . To address this deficiency , we developed Subspace , a cross-domain communication mechanism that allows efficient communication across domains without sacrificing security . Our prototype requires only a small JavaScript library , and works across all major browsers . We believe Subspace can serve as a new secure communication primitive for web mashups .

access control
same origin policy
trust
unauthorized access
web services


Efficient search engine measurements We address the problem of measuring global quality met-rics of search engines , like corpus size , index freshness , anddensity of duplicates in the corpus . The recently proposedestimators for such metrics ( 2 , 6 ) suffer from significant biasand\/or poor performance , due to inaccurate approximationof the so called . document degrees . . We present two new estimators that are able to overcomethe bias introduced by approximate degrees . Our estimatorsare based on a careful implementation of an approximateimportance sampling procedure . Comprehensive theoreti-cal and empirical analysis of the estimators demonstratesthat they have essentially no bias even in situations wheredocument degrees are poorly approximated . Building on an idea from ( 6 ) , we discuss Rao Blackwelliza-tion as a generic method for reducing variance in searchengine estimators . We show that Rao-Blackwellizing ourestimators results in significant performance improvements , while not compromising accuracy .

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

corpus size estimation
evaluation
information search and retrieval


Trust-based recommendation systems : an axiomatic approach High-quality , personalized recommendations are a key feature in many online systems . Since these systems often have explicit knowledge of social network structures , the recommendations may incorporate this information . This paper focuses on networks that represent trust and recommendation systems that incorporate these trust relationships . The goal of a trust-based recommendation system is to generate personalized recommendations by aggregating the opinions of other users in the trust network . In analogy to prior work on voting and ranking systems , we use the axiomatic approach from the theory of social choice . We develop a set of five natural axioms that a trust-based recommendation system might be expected to satisfy . Then , we show that no system can simultaneously satisfy all the axioms . However , for any subset of four of the five axioms we exhibit a recommendation system that satisfies those axioms . Next we consider various ways of weakening the axioms , one of which leads to a unique recommendation system based on random walks . We consider other recommendation systems , including systems based on personalized PageRank , majority of majorities , and minimum cuts , and search for alternative axiomatizations that uniquely characterize these systems . Finally , we determine which of these systems are incentive compatible , meaning that groups of agents interested in manipulating recommendations can not induce others to share their opinion by lying about their votes or modifying their trust links . This is an important property for systems deployed in a monetized environment .

O B 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 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 O O O O O O O O O O O O O O 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

axiomatic approach
recommendation systems

general
reputation systems
trust networks


Analysis and tracking of emotions in english and bengali texts : a computational approach The present discussion highlights the aspects of an ongoing doctoral thesis grounded on the analysis and tracking of emotions from English and Bengali texts . Development of lexical resources and corpora meets the preliminary urgencies . The research spectrum aims to identify the evaluative emotional expressions at word , phrase , sentence , and document level granularities along with their associated holders and topics . Tracking of emotions based on topic or event was carried out by employing sense based affect scoring techniques . The labeled emotion corpora are being prepared from unlabeled examples to cope with the scarcity of emotional resources , especially for the resource constraint language like Bengali . Different unsupervised , supervised and semi-supervised strategies , adopted for coloring each outline of the research spectrum produce satisfactory outcomes

O O B 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 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 B O 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 O O O O O O O O O O O O

bengwal
blogs
crf
expression
holder
svm
syntactic argument structure


Answering bounded continuous search queries in the world wide web Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries . The improvement of continuous search queries may concern not only the quality of retrieved results but also the freshness of results , i.e. the time between the availability of a respective data object on the Web and the notification of a user by the search engine . In some cases a user should be notified immediately since the value of the respective information decreases quickly , as e.g. news about companies that affect the value of respective stocks , or sales offers for products that may no longer be available after a short period of time . In the document filtering literature , the optimization of such queries is usually based on threshold classification . Documents above a quality threshold are returned to a user . The threshold is tuned in order to optimize the quality of retrieved results . The disadvantage of such approaches is that the amount of information returned to a user may hardly be controlled without further user-interaction . In this paper , we consider the optimization of bounded continuous search queries where only the estimated best k elements are returned to a user . We present a new optimization method for bounded continuous search queries based on the optimal stopping theory and compare the new method to methods currently applied by Web search systems . The new method provides results of significantly higher quality for the cases where very fresh results have to be delivered .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


Accessibility : a Web engineering approach Currently , the vast majority of web sites do not support accessibility for visually impaired users . Usually , these users have to rely on screen readers : applications that sequentially read the content of a web page in audio . Unfortunately , screen readers are not able to detect the meaning of the different page objects , and thus the implicit semantic knowledge conveyed in the presentation of the page is lost . One approach described in literature to tackle this problem , is the Dante approach , which allows semantic annotation of web pages to provide screen readers with extra ( semantic ) knowledge to better facilitate the audio presentation of a web page . Until now , such annotations were done manually , and failed for dynamic pages . In this paper , we combine the Dante approach with a web design method , WSDM , to fully automate the generation of the semantic annotation for visually impaired users . To do so , the semantic knowledge gathered during the design process is exploited , and the annotations are generated as a by-product of the design process , requiring no extra effort from the designer .

B O O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Webanywhere : enabling a screen reading interface for the web on any computer People often use computers other than their own to access web content , but blind users are restricted to using computers equipped with expensive , special-purpose screen reading programs that they use to access the web . WebAnywhere is a web-based , self-voicing web application that enables blind web users to access the web from almost any computer that can produce sound without installing new software . WebAnywhere could serve as a convenient , low-cost solution for blind users on-the-go , for blind users unable to afford another screen reader and for web developers targeting accessible design . This paper describes the implementation of WebAnywhere , overviews an evaluation of it by blind web users , and summarizes a survey of public terminals that shows it can run on most public computers .

O O O 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 B I 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 O O O O O O O O


Mining advertiser-specific user behavior using adfactors Consider an online ad campaign run by an advertiser . The ad serving companies that handle such campaigns record users ' behavior that leads to impressions of campaign ads , as well as users ' responses to such impressions . This is summarized and reported to the advertisers to help them evaluate the performance of their campaigns and make better budget allocation decisions . The most popular reporting statistics are the click-through rate and the conversion rate . While these are indicative of the effectiveness of an ad campaign , the advertisers often seek to understand more sophisticated long-term effects of their ads on the brand awareness and the user behavior that leads to the conversion , thus creating a need for the reporting measures that can capture both the duration and the frequency of the pathways to user conversions . In this paper , we propose an alternative data mining framework for analyzing user-level advertising data . In the aggregation step , we compress individual user histories into a graph structure , called the adgraph , representing local correlations between ad events . For the reporting step , we introduce several scoring rules , called the adfactors ( AF ) , that can capture global role of ads and ad paths in the adgraph , in particular , the structural correlation between an ad impression and the user conversion . We present scalable local algorithms for computing the adfactors ; all algorithms were implemented using the MapReduce programming model and the Pregel framework . Using an anonymous user-level dataset of sponsored search campaigns for eight different advertisers , we evaluate our framework with different adgraphs and adfactors in terms of their statistical fit to the data , and show its value for mining the long-term behavioral patterns in the advertising data .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

clickthrough rate
conversion rate
sponsored search

ad auctions
miscellaneous
online advertising
pagerank
user behavior models


Topic-oriented query expansion for web search The contribution of this paper includes three folders : ( 1 ) To introduce a topic-oriented query expansion model based on the Information Bottleneck theory that classify terms into distinct topical clusters in order to find out candidate terms for the query expansion . ( 2 ) To define a term-term similarity matrix that is available to improve the term ambiguous problem . ( 3 ) To propose two measures , intracluster and intercluster similarities , that are based on proximity between the topics represented by two clusters in order to evaluate the retrieval effectiveness . Results of several evaluation experiments in Web search exhibit the average intracluster similarity was improved for the gain of 79.1 % while the average intercluster similarity was decreased for the loss of 36.0 % .

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 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 B I O O O O O O O O O O O B I O O O O O O O O O

information bottleneck
intercluster similarity
intracluster similarity
query expansion

term-term similarity matrix
topic-oriented


Exploiting the web for point-in-time file sharing We describe a simple approach to `` point-in-time '' file sharing based on time expiring web links and personal webservers . This approach to file sharing is useful in environments where instant messaging clients are varied and do n't necessarily support ( compatible ) file transfer protocols . We discuss the features of such an approach along with a successfully deployed implementation now in wide use throughout the IBM corporation .

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 B I 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


A quality model for multichannel adaptive information The ongoing diffusion of novel and mobile devices offers new ways to provide services across a growing set of network technologies . As a consequence , traditional information systems evolve to multichannel systems in which services are provided through different channels , being a channel the abstraction of a device and a network . This work proposes a quality model suitable for capturing and reasoning about quality aspects of multichannel information systems . In particular , the model enables a clear separation of modeling aspects of services , networks , and devices . Further , it embeds rules enabling the evaluation of end-to-end quality , which can be used to select services according to the actual quality perceived by users .

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 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 O O O O O O O O O O O O O O


Xspect : bridging open hypermedia and XLink This paper evaluates the XLink format in comparison with other linking formats . The comparison is based on Xspect , an implementation of XLink . Xspect handles transformation between an open hypermedia format ( OHIF ) and XLink , and the paper discusses this isomorphic transformation and generalises it to include another open hypermedia format , FOHM . The Xspect system , based on XSLT and Javascript , provides users with an interface to browse and merge linkbases . Xspect supports navigational hypermedia in the form of links inserted on the fly into Web pages , as well as guided tours presented as SVG . Xspect has two implementations : one server-side and one running on the client . Both implementation provide the user with an interface for the creation of annotations . The main result of the paper is a critique of XLink . XLink is shown to be a format well suited for navigational hypermedia , but lacking in more advanced constructs . More problematic are the issues regarding large-scale use , such as evaluating validity and credibility of linkbases , and ensuring general support for a format as flexible as XLink .

B O O B I O B O O O O B O O O O O O O O O O O O O B O O O O B O B O O O O B I O O B O O B O O O O O O O O O O O O O O B I O O B O O B 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 B 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 B 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 B O

annotations
fohm
ohif
open hypermedia
svg
xlink
xspect


Semantic web applications to e-science in silico experiments This paper explains our research and implementations of manual , automatic and deep annotations of provenance logs for e-Science insilico experiments . Compared to annotating general Web documents , annotations for scientific data require more sophisticated professional knowledge to recognize concepts from documents , and more complex text extraction and mapping mechanisms . A simple automatic annotation approach based on `` lexicons '' and a deep annotation implemented by semantically populating , translating and annotating provenance logs are introduced in this paper . We used COHSE ( Conceptual Open Hypermedia Services Environment ) to annotate and browse provenance logs from my Grid project , which are conceptually linked together as a hypertext Web of provenance logs and experiment resources , based on the associated conceptual metadata and reasoning over these metadata .

B I 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 B 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 B 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

database applications
e-science
hypertext/hypermedia
integration
ontology


PRIVE : anonymous location-based queries in distributed mobile systems Nowadays , mobile users with global positioning devices canaccess Location Based Services ( LBS ) and query about pointsof interest in their proximity . For such applications to succeed , privacy and confidentiality are essential . Encryptionalone is not adequate ; although it safeguards the systemagainst eavesdroppers , the queries themselves may disclosethe location and identity of the user . Recently , there havebeen proposed centralized architectures based on K-anonymity , which utilize an intermediate anonymizer between themobile users and the LBS . However , the anonymizer mustbe updated continuously with the current locations of allusers . Moreover , the complete knowledge of the entire systemposes a security threat , if the anonymizer is compromised . In this paper we address two issues : ( i ) We show thatexisting approaches may fail to provide spatial anonymityfor some distributions of user locations and describe a noveltechnique which solves this problem . ( ii ) We propose Prive , a decentralized architecture for preserving the anonymityof users issuing spatial queries to LBS . Mobile users self-organizeinto an overlay network with good fault toleranceand load balancing properties . Prive avoids the bottleneckcaused by centralized techniques both in terms of anonymizationand location updates . Moreover , the system state isdistributed in numerous users , rendering Prive resilient toattacks . Extensive experimental studies suggest that Priveis applicable to real-life scenarios with large populations ofmobile users .

O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

anonymity
dpatial databases
peer-to-peer


XJ : facilitating XML processing in Java The increased importance of XML as a data representation format has led to several proposals for facilitating the development of applications that operate on XML data . These proposals range from runtime API-based interfaces to XML-based programming languages . The subject of this paper is XJ , a research language that proposes novel mechanisms for the integration of XML as a first-class construct into Java ™ . The design goals of XJ distinguish it from past work on integrating XML support into programming languages -- specifically , the XJ design adheres to the XML Schema and XPath standards . Moreover , it supports in-place updates of XML data thereby keeping with the imperative nature of Java . We have built a prototype compiler for XJ , and our preliminary experiments demonstrate that the performance of XJ programs can approach that of traditional low-level API-based interfaces , while providing a higher level of abstraction .

O O O B 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 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 B 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 B O O O O O O O O O O O O B 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

document preparation
language constructs and features
language design


Pragmatic evaluation of folksonomies Recently , a number of algorithms have been proposed to obtain hierarchical structures - so-called folksonomies - from social tagging data . Work on these algorithms is in part driven by a belief that folksonomies are useful for tasks such as : ( a ) Navigating social tagging systems and ( b ) Acquiring semantic relationships between tags . While the promises and pitfalls of the latter have been studied to some extent , we know very little about the extent to which folksonomies are pragmatically useful for navigating social tagging systems . This paper sets out to address this gap by presenting and applying a pragmatic framework for evaluating folksonomies . We model exploratory navigation of a tagging system as decentralized search on a network of tags . Evaluation is based on the fact that the performance of a decentralized search algorithm depends on the quality of the background knowledge used . The key idea of our approach is to use hierarchical structures learned by folksonomy algorithm as background knowledge for decentralized search . Utilizing decentralized search on tag networks in combination with different folksonomies as hierarchical background knowledge allows us to evaluate navigational tasks in social tagging systems . Our experiments with four state-of-the-art folksonomy algorithms on five different social tagging datasets reveal that existing folksonomy algorithms exhibit significant , previously undiscovered , differences with regard to their utility for navigation . Our results are relevant for engineers aiming to improve navigability of social tagging systems and for scientists aiming to evaluate different folksonomy algorithms from a pragmatic perspective .

O B 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 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 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 O O O O O O O O O O B I O O O O O O B 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 B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

decentralized search
evaluation
folksonomies


An audio\/video analysis mechanism for web indexing The high availability of video streams is making necessary mechanisms for indexing such contents in the Web world . In this paper we focus on news programs and we propose a mechanism that integrates low and high level video features to provide a high level semantic description . A color\/luminance analysis is coupled with audio analysis to provide a better identification of all the video segments that compose the video stream . Each video segment is subject to speech detection and is described through MPEG7 so that the resulting metadata description can be used to index the video stream . An experimental evaluation shows the benefits of integrating audio and video analysis .

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

automatic speech fecognition
content analysis and indexing
contents indexing
mpeg7-ddl
shot boundary detection
video indexing


Wireless SOAP : optimizations for mobile wireless web services We propose a set of optimization techniques , collectively called Wireless SOAP ( WSOAP ) , to compress SOAP messages transmitted across a wireless link . The Name Space Equivalency technique rests on the observation that exact recovery of compressed messages is not required at the receiver ; an equivalent form suffices . The WSDL Aware Encoding technique obtains further savings by utilizing knowledge of the underlying WSDL by means of an offline protocol we define . We summarize the design , implementation and performance of our Wireless SOAP prototype , and show that Wireless SOAP can reduce message sizes by 3x-12x compared to SOAP .

B B O O O O B O B O O O O O O O O O O B B 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 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 B B O O O O O B B O O O O O O O O B O

applications
compression
networks
protocol architecture
standards
web services


Mapping-driven XML transformation Clio is an existing schema-mapping tool that provides user-friendly means to manage and facilitate the complex task of transformation and integration of heterogeneous data such as XML over the Web or in XML databases . By means of mappings from source to target schemas , Clio can help users conveniently establish the precise semantics of data transformation and integration . In this paper we study the problem of how to efficiently implement such data transformation ( i.e. , generating target data from the source data based on schema mappings ) . We present a three-phase framework for high-performance XML-to-XML transformation based on schema mappings , and discuss methodologies and algorithms for implementing these phases . In particular , we elaborate on novel techniques such as streamed extraction of mapped source values and scalable disk-based merging of overlapping data ( including duplicate elimination ) . We compare our transformation framework with alternative methods such as using XQuery or SQL\/XML provided by current commercial databases . The results demonstrate that the three-phase framework ( although as simple as it is ) is highly scalable and outperforms the alternative methods by orders of magnitude .

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


IEPAD : information extraction based on pattern discovery

extraction rule
multiple string alignment
pat tree
segmentation
web


Joint relevance and freshness learning from clickthroughs for news search In contrast to traditional Web search , where topical relevance is often the main selection criterion , news search is characterized by the increased importance of freshness . However , the estimation of relevance and freshness , and especially the relative importance of these two aspects , are highly specific to the query and the time when the query was issued . In this work , we propose a unified framework for modeling the topical relevance and freshness , as well as their relative importance , based on click logs . We use click statistics and content analysis techniques to define a set of temporal features , which predict the right mix of freshness and relevance for a given query . Experimental results on both historical click data and editorial judgments demonstrate the effectiveness of the proposed approach .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

learning to rank
relevance and freshness modeling


Debugging standard document formats We present a tool for helping XML schema designers to obtain a high quality level for their specifications . The tool allows one to analyze relations between classes of XML documents and formally prove them . For instance , the tool can be used to check forward and backward compatibilities of recommendations . When such a relation does not hold , the tool allows one to identify the reasons and reports detailed counter-examples that exemplify the problem . For this purpose , the tool relies on recent advances in logic-based automated theorem proving techniques that allow for efficient reasoning on very large sets of XML documents . We believe this tool can be of great value for standardization bodies that define specifications using various XML type definition languages ( such as W3C specifications ) , and are concerned with quality assurance for their normative recommendations .

O O O O O O 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 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 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


Rated aspect summarization of short comments Web 2.0 technologies have enabled more and more people to freely comment on different kinds of entities ( e.g. sellers , products , services ) . The large scale of information poses the need and challenge of automatic summarization . In many cases , each of the user-generated short comments comes with an overall rating . In this paper , we study the problem of generating a `` rated aspect summary '' of short comments , which is a decomposed view of the overall ratings for the major aspects so that a user could gain different perspectives towards the target entity . We formally define the problem and decompose the solution into three steps . We demonstrate the effectiveness of our methods by using eBay sellers ' feedback comments . We also quantitatively evaluate each step of our methods and study how well human agree on such a summarization task . The proposed methods are quite general and can be used to generate rated aspect summary automatically given any collection of short comments each associated with an overall rating .

B I 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 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 B I O O O O O O O

rated aspect summarization
short comments

information search and retrieval
rating prediction


Web page ranking using link attributes We present a variant of PageRank , WLRank , that considers different Web page attributes to give more weight to some links . Our evaluation shows that the precision of the answers can improve significantly .

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

on-line information services
web link ranking


To join or not to join : the illusion of privacy in social networks with mixed public and private user profiles In order to address privacy concerns , many social media websites allow users to hide their personal profiles from the public . In this work , we show how an adversary can exploit an online social network with a mixture of public and private user profiles to predict the private attributes of users . We map this problem to a relational classification problem and we propose practical models that use friendship and group membership information ( which is often not hidden ) to infer sensitive attributes . The key novel idea is that in addition to friendship links , groups can be carriers of significant information . We show that on several well-known social media sites , we can easily and accurately recover the information of private-profile users . To the best of our knowledge , this is the first work that uses link-based and group-based classification to study privacy implications in social networks with mixed public and private user profiles .

O O O O O O O O O O B O B I 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 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 B I O O O O O O O O


Finding visual concepts by web image mining We propose measuring `` visualness '' of concepts with images on the Web , that is , what extent concepts have visual characteristics . This is a new application of `` Web image mining '' . To know which concept has visually discriminative power is important for image recognition , since not all concepts are related to visual contents . Mining image data on the Web with our method enables it . Our method performs probabilistic region selection for images and computes an entropy measure which represents `` visualness '' of concepts . In the experiments , we collected about forty thousand images from the Web for 150 concepts . We examined which concepts are suitable for annotation of image contents .

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 B I 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

image processing and computer vision
probabilistic method


E-learning personalization based on itineraries and long-term navigational behavior In this paper we describe a practical framework for studying then a navigational behavior of the users of an e-learning environment integrated in a virtual campus . The students navigate through the web based virtual campus interacting with learning resources which are structured following the SCORM e-learning standard . Our main goal is to design a usage mining tool for analyzing such user navigational behavior and for extracting relevant information that can be used to validate several aspects related to virtual campus design and usability but also to determine the optimal scheduling for each course depending on user profile . We intend to extend these quencing capabilities of the SCORM standard to include the concept of recommended itinerary , by combining teachers expertise with learned experience acquired by system usage analysis .

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 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 B O O O O O O O O O O O O O O O O O O O O O O

computer uses in education
data mining
e-learning
navigational patterns
user interfaces


On the lack of typical behavior in the global Web traffic network We offer the first large-scale analysis of Web traffic based on network flow data . Using data collected on the Internet2 network , we constructed a weighted bipartite client-server host graph containing more than 18 x 106 vertices and 68 x 106 edges valued by relative traffic flows . When considered as a traffic map of the World-Wide Web , the generated graph provides valuable information on the statistical patterns that characterize the global information flow on the Web . Statistical analysis shows that client-server connections and traffic flows exhibit heavy-tailed probability distributions lacking any typical scale . In particular , the absence of an intrinsic average in some of the distributions implies the absence of a prototypical scale appropriate for server design , Web-centric network design , or traffic modeling . The inspection of the amount of traffic handled by clients and servers and their number of connections highlights non-trivial correlations between information flow and patterns of connectivity as well as the presence of anomalous statistical patterns related to the behavior of users on the Web . The results presented here may impact considerably the modeling , scalability analysis , and behavioral study of Web applications .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

degree
network flows
performance evaluation
power laws
scale-free networks
strength
traffic statistics
web usage


A framework for coordinated multi-modal browsing with multiple clients As users acquire or gain access to an increasingly diverse range of web access clients , web applications are adapting their user interfaces to support multiple modalities on multiple client types . User experiences can be enhanced by clients with differing capabilities combining to provide a distributed user interface to applications . Indeed , users will be frustrated if their interaction with applications is limited to one client at a time . This paper discusses the requirements for coordinating web interaction across an aggregation of clients . We present a framework for multi-device browsing that provides both coordinated navigation between web resources and coordinated interaction between variants , or representations , of those resources once instantiated in the clients . The framework protects the application from some of the complexities of client aggregation . We show how a small number of enhancements to the XForms and XML Events vocabularies can facilitate coordination between clients and provide an appropriate level of control to applications . We also describe a novel proxy which consolidates HTTP requests from aggregations of clients and reduces the burden that multi-client browsing places on the application .

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

graphical user interfaces
multi-modal browsing
web proxy


Anycast CDNS revisited Because it is an integral part of the Internet routing apparatus , and because it allows multiple instances of the same service to be `` naturally '' discovered , IP Anycast has many attractive features for any service that involve the replication of multiple instances across the Internet . While briefly considered as an enabler when content distribution networks ( CDNs ) first emerged , the use of IP Anycast was deemed infeasible in that environment . The main reasons for this decision were the lack of load awareness of IP Anycast and unwanted side effects of Internet routing changes on the IP Anycast mechanism . Prompted by recent developments in route control technology , as well as a better understanding of the behavior of IP Anycast in operational settings , we revisit this decision and propose a load-aware IP Anycast CDN architecture that addresses these concerns while benefiting from inherent IP Anycast features . Our architecture makes use of route control mechanisms to take server and network load into account to realize load-aware Anycast . We show that the resulting redirection requirements can be formulated as a Generalized Assignment Problem and present practical algorithms that address these requirements while at the same time limiting session disruptions that plague regular IP Anycast . We evaluate our algorithms through trace based simulation using traces obtained from an operation CDN network .

B 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 O O O O O O O O O O O O O O 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 B 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 B O O O O O O O O O O O O O B 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 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 O O O O O O O O O O O O O O O B O O

autonomous system
load balancing
miscellaneous


Learning consensus opinion : mining data from a labeling game We consider the problem of identifying the consensus ranking for the results of a query , given preferences among those results from a set of individual users . Once consensus rankings are identified for a set of queries , these rankings can serve for both evaluation and training of retrieval and learning systems . We present a novel approach to collecting the individual user preferences over image-search results : we use a collaborative game in which players are rewarded for agreeing on which image result is best for a query . Our approach is distinct from other labeling games because we are able to elicit directly the preferences of interest with respect to image queries extracted from query logs . As a source of relevance judgments , this data provides a useful complement to click data . Furthermore , the data is free of positional biases and is collected by the game without the risk of frustrating users with non-relevant results ; this risk is prevalent in standard mechanisms for debiasing clicks . We describe data collected over 34 days from a deployed version of this game that amounts to about 18 million expressed preferences between pairs . Finally , we present several approaches to modeling this data in order to extract the consensus rankings from the preferences and better sort the search results for targeted queries .

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

learning preferences
preference judgments


Exploiting social context for review quality prediction Online reviews in which users publish detailed commentary about their experiences and opinions with products , services , or events are extremely valuable to users who rely on them to make informed decisions . However , reviews vary greatly in quality and are constantly increasing in number , therefore , automatic assessment of review helpfulness is of growing importance . Previous work has addressed the problem by treating a review as a stand-alone document , extracting features from the review text , and learning a function based on these features for predicting the review quality . In this work , we exploit contextual information about authors ' identities and social networks for improving review quality prediction . We propose a generic framework for incorporating social context information by adding regularization constraints to the text-based predictor . Our approach can effectively use the social context information available for large quantities of unlabeled reviews . It also has the advantage that the resulting predictor is usable even when social context is unavailable . We validate our framework within a real commerce portal and experimentally demonstrate that using social context information can help improve the accuracy of review quality prediction especially when the available training data is sparse .

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 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 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 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 B I O O O O O O O O O O

learning
review helpfulness
review quality

graph regularization
miscellaneous
social network


Topic segmentation of message hierarchies for indexing and navigation support Message hierarchies in web discussion boards grow with new postings . Threads of messages evolve as new postings focus within or diverge from the original themes of the threads . Thus , just by investigating the subject headings or contents of earlier postings in a message thread , one may not be able to guess the contents of the later postings . The resulting navigation problem is further compounded for blind users who need the help of a screen reader program that can provide only a linear representation of the content . We see that , in order to overcome the navigation obstacle for blind as well as sighted users , it is essential to develop techniques that help identify how the content of a discussion board grows through generalizations and specializations of topics . This knowledge can be used in segmenting the content in coherent units and guiding the users through segments relevant to their navigational goals . Our experimental results showed that the segmentation algorithm described in this paper provides up to 80-85 % success rate in labeling messages . The algorithm is being deployed in a software system to reduce the navigational load of blind students in accessing web-based electronic course materials ; however , we note that the techniques are equally applicable for developing web indexing and summarization tools for users with sight .

O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

assistive technology for blind users
navigational aid


DSNotify : handling broken links in the web of data The Web of Data has emerged as a way of exposing structured linked data on the Web . It builds on the central building blocks of the Web ( URIs , HTTP ) and benefits from its simplicity and wide-spread adoption . It does , however , also inherit the unresolved issues such as the broken link problem . Broken links constitute a major challenge for actors consuming Linked Data as they require them to deal with reduced accessibility of data . We believe that the broken link problem is a major threat to the whole Web of Data idea and that both Linked Data consumers and providers will require solutions that deal with this problem . Since no general solutions for fixing such links in the Web of Data have emerged , we make three contributions into this direction : first , we provide a concise definition of the broken link problem and a comprehensive analysis of existing approaches . Second , we present DSNotify , a generic framework able to assist human and machine actors in fixing broken links . It uses heuristic feature comparison and employs a time-interval-based blocking technique for the underlying instance matching problem . Third , we derived benchmark datasets from knowledge bases such as DBpedia and evaluated the effectiveness of our approach with respect to the broken link problem . Our results show the feasibility of a time-interval-based blocking approach for systems that aim at detecting and fixing broken links in the Web of Data .

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 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 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 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 B O O O O O O O O O B I O O O O O O

blocking
broken links
instance matching
linked data

information search and retrieval
link integrity


CaTTS : calendar types and constraints for Web applications Data referring to cultural calendars such as the widespread Gregorian dates but also dates after the Chinese , Hebrew , or Islamic calendars as well as data referring to professional calendars like fiscal years or teaching terms are omnipresent on the Web . Formalisms such as XML Schema have acknowledged this by offering a rather extensive set of Gregorian dates and times as basic data types . This article introduces into CaTTS , the ( u ) C ( \/ u ) alendar ( u ) a ( \/ u ) nd ( u ) T ( \/ u ) ime ( u ) T ( \/ u ) ype ( u ) S ( \/ u ) ystem . CaTTS goes far beyond predefined date and time types after the Gregorian calendar as supported by XML Schema . CaTTS first gives rise to declaratively specify more or less complex cultural or professional calendars including specificities such as leap seconds , leap years , and time zones . CaTTS further offers a tool for the static type checking ( of data typed after calendar ( s ) defined in CaTTS ) . CaTTS finally offers a language for declaratively expressing and a solver for efficiently solving temporal constraints ( referring to calendar ( s ) expressed in CaTTS ) . CaTTS complements data modeling and reasoning methods designed for generic Semantic Web applications such as RDF or OWL with methods specific to the particular application domain of calendars and time .

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 B 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 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 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 B 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 B O B O


Statically locating web application bugs caused by asynchronous calls Ajax becomes more and more important for web applications that care about client side user experience . It allows sending requests asynchronously , without blocking clients from continuing execution . Callback functions are only executed upon receiving the responses . While such mechanism makes browsing a smooth experience , it may cause severe problems in the presence of unexpected network latency , due to the non-determinism of asynchronism . In this paper , we demonstrate the possible problems caused by the asynchronism and propose a static program analysis to automatically detect such bugs in web applications . As client side Ajax code is often wrapped in server-side scripts , we also develop a technique that extracts client-side JavaScript code from server-side scripts . We evaluate our technique on a number of real-world web applications . Our results show that it can effectively identify real bugs . We also discuss possible ways to avoid such bugs .

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 B 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


Path summaries and path partitioning in modern XML databases


A framework for the server-side management of conversations with web services The emerging standards for the publication of Web Services are focused on the specification of the static interfaces of the operations to be invoked , or on the service composition . Few efforts have been made to specify the interaction between a Web Service and the individual consumer , although this aspect is essential to the successful service execution . In fact , while `` one-shot '' services may be invoked in a straight forward way , the invocation of services requiring complex interactions , where multiple messages are needed to complete the service , depends on the fact that the consumer respects the business logic of the Web Service . In this paper , we propose a framework for the server-side management of the interaction between a Web Service and its consumers . In our approach , the Web Service is in charge of assisting the consumer during the service invocation , by managing the interaction context and instructing the consumer about the operations that can be invoked and their actual parameters , at each step of the conversation . Our framework is based on the exchange of SOAP messages specifying the invocation of Java-based operations . Moreover , in order to support the interoperability with other software environments , the conversation flow specification is exported to a WSDL format that enables heterogeneous consumers to invoke the Web Service in a seamless way .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

tools and technologies for web services development


XQuery at your web service XML messaging is at the heart of Web services , providing the flexibility required for their deployment , composition , and maintenance . Yet , current approaches to Web services development hide the messaging layer behind Java or C # APIs , preventing the application to get direct access to the underlying XML information . To address this problem , we advocate the use of a native XML language , namely XQuery , as an integral part of the Web services development infrastructure . The main contribution of the paper is a binding between WSDL , the Web Services Description Language , and XQuery . The approach enables the use of XQuery for both Web services deployment and composition . We present a simple command-line tool that can be used to automatically deploy a Web service from a given XQuery module , and extend the XQuery language itself with a statement for accessing one or more Web services . The binding provides tight-coupling between WSDL and XQuery , yielding additional benefits , notably : the ability to use WSDL as an interface language for XQuery , and the ability to perform static typing on XQuery programs that include Web service calls . Last but not least , the proposal requires only minimal changes to the existing infrastructure . We report on our experience implementing this approach in the Galax XQuery processor .

B O O O O B 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 B O O O O O O O O O O O O O O B O O O B O O O O O O O B I O O O O O O O O O O O O O B O O B I O O O O B O O O O O O 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 B O O O O O B O O O O O O O O O O B I O O O O O O B O B O O O O O O O O O O O B O O B 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 O O O O O O O O O O O O O O O B O O


Discovering the best web service Major research challenges in discovering Web services include , provisioning of services across multiple or heterogeneous registries , differentiating between services that share similar functionalities , improving end-to-end Quality of Service ( QoS ) , and enabling clients to customize the discovery process . Proliferation and interoperability of this multitude of Web services have lead to the emergence of new standards on how services can be published , discovered , or used ( i.e. UDDI , WSDL , SOAP ) . Such standards can potentially provide many of these features and much more , however , there are technical challenges associated with existing standards . One of these challenges is the client . s ability to control the discovery process across accessible service registries for finding services of interest . This work proposes a solution to this problem and introduces the Web Service Relevancy Function ( WsRF ) used for measuring the relevancy ranking of a particular Web service based on QoS metrics and client preferences . We present experimental validation , results , and analysis of the presented ideas .

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

quality of services
tmodel
uddi business registries
uddi extension


P-TAG : large scale automatic generation of personalized annotation tags for the web The success of the Semantic Web depends on the availability of Web pages annotated with metadata . Free form metadata or tags , as used in social bookmarking and folksonomies , have become more and more popular and successful . Such tags are relevant keywords associated with or assigned to a piece of information ( e.g. , a Web page ) , describing the item and enabling keyword-based classification . In this paper we propose P-TAG , a method which automatically generates personalized tags for Web pages . Upon browsing a Web page , P-TAG produces keywords relevant both to its textual content , but also to the data residing on the surfer 's Desktop , thus expressing a personalized viewpoint . Empirical evaluations with several algorithms pursuing this approach showed very promising results . We are therefore very confident that such a user oriented automatic tagging approach can provide large scale personalized metadata annotations as an important step towards realizing the Semantic Web .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

content analysis and indexing
on-line information services
personalization
user desktop
web annotations


DoNet : a semantic domotic framework In the very near future complete households will be entirely networked as a de facto standard . In this poster we briefly describe our work in the area of domotics , where personalization , semantics and agent technology come together . We illustrate a home system oriented ontology and an intelligent agent based framework for the rapid development of home control and automation . The ever changing nature of the home , places the user in a position were he needs to be involved and become , through DoNet , a part of an ongoing home system optimization process .

O O O O O O O O O O O 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

agents
reusable software
semantic web
software architectures


Bayesian network based sentence retrieval model This paper makes an intensive investigation of the application of Bayesian network in sentence retrieval and introduces three Bayesian network based sentence retrieval models with or without consideration of term relationships . Term relationships in this paper are considered from two perspectives : relationships between pairs of terms and relationships between terms and term sets . Experiments have proven the efficiency of Bayesian network in the application of sentence retrieval . Particularly , retrieval result with consideration of the second kind of term relationship performs better in improving retrieval precision .

B I O B I O O O O O O O O O O O B I O B I 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 O O O O B I O O O O B I O O O O O O O O O O O O B I O O O O O O O

bayesian network
sentence retrieval
term relationship


Authoring of learning styles in adaptive hypermedia : problems and solutions Learning styles , as well as the best ways of responding with corresponding instructional strategies , have been intensively studied in the classical educational ( classroom ) setting . There is much less research of application of learning styles in the new educational space , created by the Web . Moreover , authoring applications are scarce , and they do not provide explicit choices and creation of instructional strategies for specific learning styles . The main objective of the research described in this paper is to provide the authors with a tool which will allow them to incorporate different learning styles in their adaptive educational hypermedia applications . In this way , we are creating a semantically significant interface between classical learning styles and instructional strategies and the modern field of adaptive educational hypermedia .

O O B I 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 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 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

authoring of adaptive hypermedia
user modeling


Automatic identification of user goals in Web search There has been recent interests in studying the `` goal '' behind a user 's Web query , so that this goal can be used to improve the quality of a search engine 's results . Previous studies have mainly focused on using manual query-log investigation to identify Web query goals . In this paper we study whether and how we can automate this goal-identification process . We first present our results from a human subject study that strongly indicate the feasibility of automatic query-goal identification . We then propose two types of features for the goal-identification task : user-click behavior and anchor-link distribution . Our experimental evaluation shows that by combining these features we can correctly identify the goals for 90 % of the queries studied .

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Enhancing the privacy of web-based communication A profiling adversary is an adversary whose goal is to classify a population of users into categories according to messages they exchange . This adversary models the most common privacy threat against web based communication . We propose a new encryption scheme , called stealth encryption , that protects users from profiling attacks by concealing the semantic content of plaintext while preserving its grammatical structure and other non-semantic linguistic features , such as word frequency distribution . Given English plaintext , stealth encryption produces ciphertext that can not efficiently be distinguished from normal English text ( our techniques apply to other languages as well ) .

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 B 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


Fluid annotations through open hypermedia : using and extending emerging web standards The Fluid Documents project has developed various research prototypes that show that powerful annotation techniques based on animated typographical changes can help readers utilize annotations more effectively . Our recently-developed Fluid Open Hypermedia prototype supports the authoring and browsing of fluid annotations on third-party Web pages . This prototype is an extension of the Arakne Environment , an open hypermedia application that can augment Web pages with externally stored hypermedia structures . This paper describes how various Web standards , including DOM , CSS , XLink , XPointer , and RDF , can be used and extended to support fluid annotations .

O B 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 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 B O B O O B O O O O O O O O O B O

annotations
fluid documents
rdf
xlink
xpointer

annotea
web augmentation with open hypermedia


Extracting query modifications from nonlinear SVMs When searching the WWW , users often desire results restricted to a particular document category . Ideally , a user would be able to filter results with a text classifier to minimize false positive results ; however , current search engines allow only simple query modifications . To automate the process of generating effective query modifications , we introduce a sensitivity analysis-based method for extracting rules from nonlinear support vector machines . The proposed method allows the user to specify a desired precision while attempting to maximize the recall . Our method performs several levels of dimensionality reduction and is vastly faster than searching the combination feature space ; moreover , it is very effective on real-world data .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 modification
rule extraction
sensitivity analysis
support vector machine


Learning to recognize reliable users and content in social media with coupled mutual reinforcement Community Question Answering ( CQA ) has emerged as a popular forum for users to pose questions for other users to answer . Over the last few years , CQA portals such as Naver and Yahoo ! Answers have exploded in popularity , and now provide a viable alternative to general purpose Web search . At the same time , the answers to past questions submitted in CQA sites comprise a valuable knowledge repository which could be a gold mine for information retrieval and automatic question answering . Unfortunately , the quality of the submitted questions and answers varies widely - increasingly so that a large fraction of the content is not usable for answering queries . Previous approaches for retrieving relevant and high quality content have been proposed , but they require large amounts of manually labeled data -- which limits the applicability of the supervised approaches to new sites and domains . In this paper we address this problem by developing a semi-supervised coupled mutual reinforcement framework for simultaneously calculating content quality and user reputation , that requires relatively few labeled examples to initialize the training process . Results of a large scale evaluation demonstrate that our methods are more effective than previous approaches for finding high-quality answers , questions , and users . More importantly , our quality estimation significantly improves the accuracy of search over CQA archives over the state-of-the-art methods .

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

authority and expertise in online communities


Efficient resource allocation and power saving in multi-tiered systems In this paper , we present Fastrack , a parameter-free algorithm for dynamic resource provisioning that uses simple statistics to promptly distill information about changes in workload burstiness . This information , coupled with the application 's end-to-end response times and system bottleneck characteristics , guide resource allocation that shows to be very effective under a broad variety of burstiness profiles and bottleneck scenarios .

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 B I O O O O O O O O O O O B O O O O O

multi-tiered systems
performance evaluation


KnowledgeTree : a distributed architecture for adaptive e-learning This paper presents KnowledgeTree , an architecture for adaptive E-Learning based on distributed reusable intelligent learning activities . The goal of KnowledgeTree is to bridge the gap between the currently popular approach to Web-based education , which is centered on learning management systems vs. the powerful but underused technologies in intelligent tutoring and adaptive hypermedia . This integrative architecture attempts to address both the component-based assembly of adaptive systems and teacher-level reusability .

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

adaptive content service
adaptive web
content re-use
e-learning
learning object metadata
learning portal
student model server


Actions speak as loud as words : predicting relationships from social behavior data In recent years , new studies concentrating on analyzing user personality and finding credible content in social media have become quite popular . Most such work augments features from textual content with features representing the user 's social ties and the tie strength . Social ties are crucial in understanding the network the people are a part of . However , textual content is extremely useful in understanding topics discussed and the personality of the individual . We bring a new dimension to this type of analysis with methods to compute the type of ties individuals have and the strength of the ties in each dimension . We present a new genre of behavioral features that are able to capture the `` function '' of a specific relationship without the help of textual features . Our novel features are based on the statistical properties of communication patterns between individuals such as reciprocity , assortativity , attention and latency . We introduce a new methodology for determining how such features can be compared to textual features , and show , using Twitter data , that our features can be used to capture contextual information present in textual features very accurately . Conversely , we also demonstrate how textual features can be used to determine social attributes related to an individual .

O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

behavior analysis
social networks
social signals


ZenCrowd : leveraging probabilistic reasoning and crowdsourcing techniques for large-scale entity linking We tackle the problem of entity linking for large collections of online pages ; Our system , ZenCrowd , identifies entities from natural language text using state of the art techniques and automatically connects them to the Linked Open Data cloud . We show how one can take advantage of human intelligence to improve the quality of the links by dynamically generating micro-tasks on an online crowdsourcing platform . We develop a probabilistic framework to make sensible decisions about candidate links and to identify unreliable human workers . We evaluate ZenCrowd in a real deployment and show how a combination of both probabilistic reasoning and crowdsourcing techniques can significantly improve the quality of the links , while limiting the amount of work performed by the crowd .

O O O B I O B O O O B I 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 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 B I O B O O O O O O O O O O O O O O O O O O O O O

crowdsourcing
entity linking
probabilistic reasoning


Understanding user goals in web search Previous work on understanding user web search behavior has focused on how people search and what they are searching for , but not why they are searching . In this paper , we describe a framework for understanding the underlying goals of user searches , and our experience in using the framework to manually classify queries from a web search engine . Our analysis suggests that so-called navigational '' searches are less prevalent than generally believed while a previously unexplored `` resource-seeking '' goal may account for a large fraction of web searches . We also illustrate how this knowledge of user search goals might be used to improve future web search engines .

O B I O B I 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 B I O O

information retrieval
query classification
user behavior


Model based engineering of learning situations for adaptive web based educational systems In this paper , we propose an approach for the engineering of web based educational applications . The applications that we focus require advanced functionality for regulating and tutoring learners ' activities ( dynamics of learning ) . Our approach aims at proposing models , not only to describe details of such learning situations , but also to characterize the constraints that the Learning Management System exploiting such situations must satisfy in this sense , this approach also contributes to the specification of the Adaptive Web Based Educational System ( AWBES ) fitted to a particular learning situation . Moreover , this approach for the engineering of learning situations conforms to current software engineering research works .

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

architectures and designs for web-based learning delivery environments

specification of educational applications


Detecting the origin of text segments efficiently In the origin detection problem an algorithm is given a set S of documents , ordered by creation time , and a query document D. It needs to output for every consecutive sequence of k alphanumeric terms in D the earliest document in $ S$ in which the sequence appeared ( if such a document exists ) . Algorithms for the origin detection problem can , for example , be used to detect the `` origin '' of text segments in D and thus to detect novel content in D. They can also find the document from which the author of D has copied the most ( or show that D is mostly original . ) We concentrate on solutions that use only a fixed amount of memory . We propose novel algorithms for this problem and evaluate them together with a large number of previously published algorithms . Our results show that ( 1 ) detecting the origin of text segments efficiently can be done with very high accuracy even when the space used is less than 1 % of the size of the documents in $ S$ , ( 2 ) the precision degrades smoothly with the amount of available space , ( 3 ) various estimation techniques can be used to increase the performance of the algorithms .

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

document overlap
miscellaneous
shingling


Dynamic assembly of learning objects This paper describes one solution to the problem of how to select sequence , and link Web resources into a coherent , focused organization for instruction that addresses a user 's immediate and focused learning need . A system is described that automatically generates individualized learning paths from a repository of XML Web resources . Each Web resource has an XML Learning Object Metadata ( LOM ) description consisting of General , Educational , and Classification metadata . Dynamic assembly of these learning objects is based on the relative match of the learning object content and metadata to the learner 's needs , preferences , context , and constraints . Learning objects are connected into coherent paths based on their LOM topic classifications and the proximity of these topics in a Resource Description Framework ( RDF ) graph . An instructional sequencing policy specifies how to arrange the objects on the path into a particular learning sequence . The system has been deployed and evaluated within a corporate setting .

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 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 B I B O B O O O O O O O O O O B O O 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 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 O O O O O O O O O O O O O O O O O O O O O O O

assembly
instruction
learning object
lom
metadata
organization
rdf

computer-managed instruction
content management
data retrieval
information retrieval
linking
semantic web


Building a companion website in the semantic web A problem facing many textbook authors ( including one of the authors of this paper ) is the inevitable delay between new advances in the subject area and their incorporation in a new ( paper ) edition of the textbook . This means that some textbooks are quickly considered out of date , particularly in active technological areas such as the Web , even though the ideas presented in the textbook are still valid and important to the community . This paper describes our approach to building a companion website for the textbook Hypermedia and the Web : An Engineering Approach . We use Bloom 's taxonomy of educational objectives to critically evaluate a number of authoring and presentation techniques used in existing companion websites , and adapt these techniques to create our own companion website using Semantic Web technologies in order to overcome the identified weaknesses . Finally , we discuss a potential model of future companion websites , in the context of an e-publishing , e-commerce Semantic Web services scenario .

O O B I O O B I 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 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 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 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 B I O O O


Prophiler : a fast filter for the large-scale detection of malicious web pages Malicious web pages that host drive-by-download exploits have become a popular means for compromising hosts on the Internet and , subsequently , for creating large-scale botnets . In a drive-by-download exploit , an attacker embeds a malicious script ( typically written in JavaScript ) into a web page . When a victim visits this page , the script is executed and attempts to compromise the browser or one of its plugins . To detect drive-by-download exploits , researchers have developed a number of systems that analyze web pages for the presence of malicious code . Most of these systems use dynamic analysis . That is , they run the scripts associated with a web page either directly in a real browser ( running in a virtualized environment ) or in an emulated browser , and they monitor the scripts ' executions for malicious activity . While the tools are quite precise , the analysis process is costly , often requiring in the order of tens of seconds for a single page . Therefore , performing this analysis on a large set of web pages containing hundreds of millions of samples can be prohibitive . One approach to reduce the resources required for performing large-scale analysis of malicious web pages is to develop a fast and reliable filter that can quickly discard pages that are benign , forwarding to the costly analysis tools only the pages that are likely to contain malicious code . In this paper , we describe the design and implementation of such a filter . Our filter , called Prophiler , uses static analysis techniques to quickly examine a web page for malicious content . This analysis takes into account features derived from the HTML contents of a page , from the associated JavaScript code , and from the corresponding URL . We automatically derive detection models that use these features using machine-learning techniques applied to labeled datasets . To demonstrate the effectiveness and efficiency of Prophiler , we crawled and collected millions of pages , which we analyzed for malicious behavior . Our results show that our filter is able to reduce the load on a more costly dynamic analysis tools by more than 85 % , with a negligible amount of missed malicious pages .

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

drive-by download exploits
efficient web page filtering
invasive software
malicious web page analysis


Beyond dwell time : estimating document relevance from cursor movements and other post-click searcher behavior Result clickthrough statistics and dwell time on clicked results have been shown valuable for inferring search result relevance , but the interpretation of these signals can vary substantially for different tasks and users . This paper shows that that post-click searcher behavior , such as cursor movement and scrolling , provides additional clues for better estimating document relevance . To this end , we identify patterns of examination and interaction behavior that correspond to viewing a relevant or non-relevant document , and design a new Post-Click Behavior ( PCB ) model to capture these patterns . To our knowledge , PCB is the first to successfully incorporate post-click searcher interactions such as cursor movements and scrolling on a landing page for estimating document relevance . We evaluate PCB on a dataset collected from a controlled user study that contains interactions gathered from hundreds of unique queries , result clicks , and page examinations . The experimental results show that PCB is significantly more effective than using page dwell time information alone , both for estimating the explicit judgments of each user , and for re-ranking the results using the estimated relevance .

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

post-click search behavior
relevance estimation