The chatty web : emergent semantics through gossiping This paper describes a novel approach for obtaining semantic interoperability among data sources in a bottom-up , semi-automatic manner without relying on pre-existing , global semantic models . We assume that large amounts of data exist that have been organized and annotated according to local schemas . Seeing semantics as a form of agreement , our approach enables the participating data sources to incrementally develop global agreement in an evolutionary and completely decentralized process that solely relies on pair-wise , local interactions : Participants provide translations between schemas they are interested in and can learn about other translations by routing queries ( gossiping ) . To support the participants in assessing the semantic quality of the achieved agreements we develop a formal framework that takes into account both syntactic and semantic criteria . The assessment process is incremental and the quality ratings are adjusted along with the operation of the system . Ultimately , this process results in global agreement , i.e. , the semantics that all participants understand . We discuss strategies to efficiently find translations and provide results from a case study to justify our claims . Our approach applies to any system which provides a communication infrastructure ( existing websites or databases , decentralized systems , P2P systems ) and offers the opportunity to study semantic interoperability as a global phenomenon in a network of information sharing parties .

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

data translation
self-organization
semantic agreements
semantic integration


An expressive mechanism for auctions on the web Auctions are widely used on the Web . Applications range from internet advertising to platforms such as eBay . In most of these applications the auctions in use are single\/multi-item auctions with unit demand . The main drawback of standard mechanisms for this type of auctions , such as VCG and GSP , is the limited expressiveness that they offer to the bidders . The General Auction Mechanism ( GAM ) of ( 1 ) is taking a first step towards addressing the problem of limited expressiveness by computing a bidder optimal , envy free outcome for linear utility functions with identical slopes and a single discontinuity per bidder-item pair . We show that in many practical situations this does not suffice to adequately model the preferences of the bidders , and we overcome this problem by presenting the first mechanism for piece-wise linear utility functions with non-identical slopes and multiple discontinuities . Our mechanism runs in polynomial time . Like GAM it is incentive compatible for inputs that fulfill a certain non-degeneracy requirement , but our requirement is more general than the requirement of GAM . For discontinuous utility functions that are non-degenerate as well as for continuous utility functions the outcome of our mechanism is a competitive equilibrium . We also show how our mechanism can be used to compute approximately bidder optimal , envy free outcomes for a general class of continuous utility functions via piece-wise linear approximation . Finally , we prove hardness results for even more expressive settings .

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

competitive equilibrium
expressiveness
general auction mechanism
gsp
vcg

bidder optimality
envy freeness
nonnumerical algorithms and problems


A class-feature-centroid classifier for text categorization Automated text categorization is an important technique for many web applications , such as document indexing , document filtering , and cataloging web resources . Many different approaches have been proposed for the automated text categorization problem . Among them , centroid-based approaches have the advantages of short training time and testing time due to its computational efficiency . As a result , centroid-based classifiers have been widely used in many web applications . However , the accuracy of centroid-based classifiers is inferior to SVM , mainly because centroids found during construction are far from perfect locations . We design a fast Class-Feature-Centroid ( CFC ) classifier for multi-class , single-label text categorization . In CFC , a centroid is built from two important class distributions : inter-class term index and inner-class term index . CFC proposes a novel combination of these indices and employs a denormalized cosine measure to calculate the similarity score between a text vector and a centroid . Experiments on the Reuters-21578 corpus and 20-newsgroup email collection show that CFC consistently outperforms the state-of-the-art SVM classifiers on both micro-F1 and macro-F1 scores . Particularly , CFC is more effective and robust than SVM when data is sparse .

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

inner-class
inter-class
text classification


Lightweight automatic face annotation in media pages Labeling human faces in images contained in Web media stories enables enriching the user experience offered by media sites . We propose a lightweight framework for automatic image annotation that exploits named entities mentioned in the article to significantly boost the accuracy of face recognition . While previous works in the area labor to train comprehensive offline visual models for a pre-defined universe of candidates , our approach models the people mentioned in a given story on the y , using a standard Web image search engine as an image sampling mechanism . We overcome multiple sources of noise introduced by this ad-hoc process , to build a fast and robust end-to-end system from off-the-shelf error-prone text analysis and machine vision components . In experiments conducted on approximately 900 faces depicted in 500 stories from a major celebrity news website , we were able to correctly label 81.5 % of the faces while mislabeling 14.8 % of them .

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

applications
electronic publishing
machine learning
web search


Performance enhancement of scheduling algorithms in clusters and grids using improved dynamic load balancing techniques This paper describes the research work done for during PhD study . Cluster computing , grid computing and cloud computing are distributed computing environments ( DCEs ) widely accepted for the next generation Web based commercial and scientific applications . These applications work around the globally distributed data of petabyte scale that can only be processed by the aggregating the capability of globally distributed resources . The resource management and process scheduling in large scale distributed computing environment are a challenging task . In this research work we have devised new scheduling algorithms and resource management strategies specially designed for the cluster and grid cloud and peer-to-peer computing . The research work finally presented the distributed computing solutions to one scientific and one commercial application viz . e-Learning and data mining .

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


Extracting context to improve accuracy for HTML content extraction Previous work on content extraction utilized various heuristics such as link to text ratio , prominence of tables , and identification of advertising . Many of these heuristics were associated with `` settings '' , whereby some heuristics could be turned on or off and others parameterized by minimum or maximum threshold values . A given collection of settings - such as removing table cells with high linked to non-linked text ratios and removing all apparent advertising -- might work very well for a news website , but leave little or no content left for the reader of a shopping site or a web portal We present a new technique , based on incrementally clustering websites using search engine snippets , to associate a newly requested website with a particular `` genre '' , and then employ settings previously determined to be appropriate for that genre , with dramatically improved content extraction results overall .

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

accessibility
dom trees
electronic publishing
reformatting
speech rendering


Estimating sizes of social networks via biased sampling Online social networks have become very popular in recent years and their number of users is already measured in many hundreds of millions . For various commercial and sociological purposes , an independent estimate of their sizes is important . In this work , algorithms for estimating the number of users in such networks are considered . The proposed schemes are also applicable for estimating the sizes of networks ' sub-populations . The suggested algorithms interact with the social networks via their public APIs only , and rely on no other external information . Due to obvious traffic and privacy concerns , the number of such interactions is severely limited . We therefore focus on minimizing the number of API interactions needed for producing good size estimates . We adopt the abstraction of social networks as undirected graphs and use random node sampling . By counting the number of collisions or non-unique nodes in the sample , we produce a size estimate . Then , we show analytically that the estimate error vanishes with high probability for smaller number of samples than those required by prior-art algorithms . Moreover , although our algorithms are provably correct for any graph , they excel when applied to social network-like graphs . The proposed algorithms were evaluated on synthetic as well real social networks such as Facebook , IMDB , and DBLP . Our experiments corroborated the theoretical results , and demonstrated the effectiveness of the algorithms .

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

nonnumerical algorithms and problems
population estimator
social network
undirected graph


Query-driven indexing for peer-to-peer text retrieval We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks . To cope with the bandwidth consumption problem that has been identified as the major obstacle for full-text retrieval in P2P networks , we truncate posting lists associated with indexing features to a constant size storing only top-k ranked document references . To compensate for the loss of information caused by the truncation , we extend the set of indexing features with carefully chosen term sets . Indexing term sets are selected based on the query statistics extracted from query logs , thus we index only such combinations that are a ) frequently present in user queries and b ) non-redundant w.r.t the rest of the index . The distributed index is compact and efficient as it constantly evolves adapting to the current query popularity distribution . Moreover , it is possible to control the tradeoff between the storage\/bandwidth requirements and the quality of query answering by tuning the indexing parameters . Our theoretical analysis and experimental results indicate that we can indeed achieve scalable P2P text retrieval for very large document collections and deliver good retrieval performance .

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


Influence and passivity in social media The ever-increasing amount of information flowing through Social Media forces the members of these networks to compete for attention and influence by relying on other people to spread their message . A large study of information propagation within Twitter reveals that the majority of users act as passive information consumers and do not forward the content to the network . Therefore , in order for individuals to become influential they must not only obtain attention and thus be popular , but also overcome user passivity . We propose an algorithm that determines the influence and passivity of users based on their information forwarding activity . An evaluation performed with a 2.5 million user dataset shows that our influence measure is a good predictor of URL clicks , outperforming several other measures that do not explicitly take user passivity into account . We demonstrate that high popularity does not necessarily imply high influence and vice-versa .

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


How people use the web on mobile devices This paper describes a series of user studies on how people use the Web via mobile devices . The data primarily comes from contextual inquiries with 47 participants between 2004 and 2007 , and is complemented with a phone log analysis of 577 panelists in 2007 . We report four key contextual factors in using the Web on mobile devices and propose mobile Web activity taxonomy . The framework contains three user activity categories identical to previous stationary Web studies : information seeking , communication , and transaction , and a new category : personal space extension . The new category refers to the practice that people put their content on the Web for personal access , therefore extending their personal information space .

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

activity taxonomy
information seeking
mobile web
personal space extension


Geographical topic discovery and comparison This paper studies the problem of discovering and comparing geographical topics from GPS-associated documents . GPS-associated documents become popular with the pervasiveness of location-acquisition technologies . For example , in Flickr , the geo-tagged photos are associated with tags and GPS locations . In Twitter , the locations of the tweets can be identified by the GPS locations from smart phones . Many interesting concepts , including cultures , scenes , and product sales , correspond to specialized geographical distributions . In this paper , we are interested in two questions : ( 1 ) how to discover different topics of interests that are coherent in geographical regions ? ( 2 ) how to compare several topics across different geographical locations ? To answer these questions , this paper proposes and compares three ways of modeling geographical topics : location-driven model , text-driven model , and a novel joint model called LGTA ( Latent Geographical Topic Analysis ) that combines location and text . To make a fair comparison , we collect several representative datasets from Flickr website including Landscape , Activity , Manhattan , National park , Festival , Car , and Food . The results show that the first two methods work in some datasets but fail in others . LGTA works well in all these datasets at not only finding regions of interests but also providing effective comparisons of the topics across different locations . The results confirm our hypothesis that the geographical distributions can help modeling topics , while topics provide important cues to group different geographical regions .

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


Finding specification pages according to attributes This paper presents a method for finding a specification page on the web for a given object ( e.g. `` Titanic ö ) and its class label ( e.g. `` film ö ) . A specification page for an object is a web page which gives concise attribute-value information about the object ( e.g. `` director ö - `` James Cameron öfor `` Titanic ö ) . A simple unsupervised method using layout and symbolic decoration cues was applied to a large number of web pages to acquire the class attributes . We used these acquired attributes to select a representative specification page for a given object from the web pages retrieved by a normal search engine . Experimental results revealed that our method greatly outperformed the normal search engine in terms of specification retrieval .

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

attribute acquisition
information search and retrieval
specification finding
web search


Dealing with different distributions in learning from In the problem of learning with positive and unlabeled examples , existing research all assumes that positive examples P and the hidden positive examples in the unlabeled set U are generated from the same distribution . This assumption may be violated in practice . In such cases , existing methods perform poorly . This paper proposes a novel technique A-EM to deal with the problem . Experimental results with product page classification demonstrate the effectiveness of the proposed technique .

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


Semantic resource management for the web : an e-learning application Topics in education are changing with an ever faster pace . ELearning resources tend to be more and more decentralized . Users increasingly need to be able to use the resources of the web . For this , they should have tools for finding and organizing information in a decentralized way . In this paper , we show how an ontologybased tool suite allows to make the most of the resources available on the web .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
document capture
e-learning
knowledge management
semantic web


SOFIE : a self-organizing framework for information extraction This paper presents SOFIE , a system for automated ontology extension . SOFIE can parse natural language documents , extract ontological facts from them and link the facts into an ontology . SOFIE uses logical reasoning on the existing knowledge and on the new knowledge in order to disambiguate words to their most probable meaning , to reason on the meaning of text patterns and to take into account world knowledge axioms . This allows SOFIE to check the plausibility of hypotheses and to avoid inconsistencies with the ontology . The framework of SOFIE unites the paradigms of pattern matching , word sense disambiguation and ontological reasoning in one unified model . Our experiments show that SOFIE delivers high-quality output , even from unstructured Internet documents .

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


On granting limited access to private information


Unsupervised query segmentation using only query logs We introduce an unsupervised query segmentation scheme that uses query logs as the only resource and can effectively capture the structural units in queries . We believe that Web search queries have a unique syntactic structure which is distinct from that of English or a bag-of-words model . The segments discovered by our scheme help understand this underlying grammatical structure . We apply a statistical model based on Hoeffding 's Inequality to mine significant word n-grams from queries and subsequently use them for segmenting the queries . Evaluation against manually segmented queries shows that this technique can detect rare units that are missed by our Pointwise Mutual Information ( PMI ) baseline .

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

hoeffding's inequality
query grammar
query structure


The infocious web search engine : improving web searching through linguistic analysis In this paper we present the Infocious Web search engine ( 23 ) . Our goal in creating Infocious is to improve the way people find information on the Web by resolving ambiguities present in natural language text . This is achieved by performing linguistic analysis on the content of the Web pages we index , which is a departure from existing Web search engines that return results mainly based on keyword matching . This additional step of linguistic processing gives Infocious two main advantages . First , Infocious gains a deeper understanding of the content of Web pages so it can better match users ' queries with indexed documents and therefore can improve relevancy of the returned results . Second , based on its linguistic processing , Infocious can organize and present the results to the user in more intuitive ways . In this paper we present the linguistic processing technologies that we incorporated in Infocious and how they are applied in helping users find information on the Web more efficiently . We discuss the various components in the architecture of Infocious and how each of them benefits from the added linguistic processing . Finally , we experimentally evaluate the performance of a component which leverages linguistic information in order to categorize Web pages .

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

concept extraction
content analysis and indexing
crawling
digital libraries
indexing
information retrieval
information search and retrieval
language analysis
linguistic analysis of web text
natural language processing
part-of-speech tagging
phrase identification
word sense disambiguation


A flexible learning system for wrapping tables and lists in HTML documents A program that makes an existing website look like a database is called a wrapper . Wrapper learning is the problem of learning website wrappers from examples . We present a wrapper-learning system called WL2 that can exploit several different representations of a document . Examples of such different representations include DOM-level and token-level representations , as well as two-dimensional geometric views of the rendered page ( for tabular data ) and representations of the visual appearance of text asm it will be rendered . Additionally , the learning system is modular , and can be easily adapted to new domains and tasks . The learning system described is part of an `` industrial-strength '' wrapper management system that is in active use at WhizBang Labs . Controlled experiments show that the learner has broader coverage and a faster learning rate than earlier wrapper-learning systems .

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

canopy
record linkage
reference matching


OREL : an ontology-based rights expression language This paper proposes an Ontology-based Rights Expression Language , called OREL . Based on OWL Web Ontology Language , OREL allows not only users but also machines to handle digital rights at semantics level . The ontology-based rights model of OREL is also presented . The usage of OREL and its advantages against existing RELs are discussed .

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


Flash crowds and denial of service attacks : characterization and implications for CDNs and web sites The paper studies two types of events that often overload Web sites to a point when their services are degraded or disrupted entirely - flash events ( FEs ) and denial of service attacks ( DoS ) . The former are created by legitimate requests and the latter contain malicious requests whose goal is to subvert the normal operation of the site . We study the properties of both types of events with a special attention to characteristics that distinguish the two . Identifying these characteristics allows a formulation of a strategy for Web sites to quickly discard malicious requests . We also show that some content distribution networks ( CDNs ) may not provide the desired level of protection to Web sites against flash events . We therefore propose an enhancement to CDNs that offers better protection and use trace-driven simulations to study the effect of our enhancement on CDNs and Web sites .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 distribution network performance


Bilingual web page and site readability assessment Readability assessment is a method to measure the difficulty of a piece of text material , and it is widely used in educational field to assist instructors to prepare appropriate materials for students . In this paper , we investigate the applications of readability assessment in Web development , such that users can retrieve information which is appropriate to their levels . We propose a bilingual ( English and Chinese ) assessment scheme for Web page and Web site readability based on textual features , and conduct a series of experiments with real Web data to evaluate our scheme . Experimental results show that , apart from just indicating the readability level , the estimated score acts as a good heuristic to figure out pages with low textual content . Furthermore , we can obtain the overall content distribution in a Web site by studying the variation of its readability .

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


Analysis of communication models in web service compositions In this paper we describe an approach for the verification of Web service compositions defined by sets of BPEL processes . The key aspect of such a verification is the model adopted for representing the communications among the services participating in the composition . Indeed , these communications are asynchronous and buffered in the existing execution frameworks , while most verification approaches assume a synchronous communication model for efficiency reasons . In our approach , we develop a parametric model for describing Web service compositions , which allows us to capture a hierarchy of communication models , ranging from synchronous communications to asynchronous communications with complex buffer structures . Moreover , we develop a technique to associate with a Web service composition the most adequate communication model , i.e. , the simplest model that is sufficient to capture all the behaviors of the composition . This way , we can provide an accurate model of a wider class of service composition scenarios , while preserving as much as possible an efficient performance in verification .

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

asynchronous communications
bpel
web service composition

formal verification
systems and information theory


WebPod : persistent Web browsing sessions with pocketable storage devices We present WebPod , a portable system that enables mobile users to use the same persistent , personalized web browsing session on any Internet-enabled device . No matter what computer is being used , WebPod provides a consistent browsing session , maintaining all of a user 's plugins , bookmarks , browser web content , open browser windows , and browser configuration options and preferences . This is achieved by leveraging rapid improvements in capacity , cost , and size of portable storage devices . WebPod provides a virtualization and checkpoint\/restart mechanism that decouples the browsing environment from the host , enabling web browsing sessions to be suspended to portable storage , carried around , and resumed from the storage device on another computer . WebPod virtualization also isolates web browsing sessions from the host , protecting the browsing privacy of the user and preventing malicious web content from damaging the host . We have implemented a Linux WebPod prototype and demonstrate its ability to quickly suspend and resume web browsing sessions , enabling a seamless web browsing experience for mobile users as they move among computers .

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

portable storage
virtualization
web browsing


An agent system reasoning about the web and the user The paper describes some innovations related to the ongoing work on the GSA prototype , an integrated information retrieval agent . In order to improve the original system effectiveness , we propose the GSA2 system , introducing a new internal architecture based on a message-passing framework and on an ontology description formalism ( WOLF , Web ontology Framework ) . GSA2 is conceived in order to describe and easily perform reasoning on `` facts about the web and the user '' . The most innovative aspect of the project is its customizable and flexible reasoning system , based on Answer Set Programming it plays the role of the central decision making module , and allows the Agent to take proactive decisions . The introduction of a logic language allows one to describe , program and plan behaviors of the Agent easily and quickly , and to experiment with a large variety of Information Retrieval strategies . Both the System Architecture and WOLF are general and reusable , and the result constitutes a good example of real implementation of agents based on logics .

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

agents
answer set programming
information retrieval

distributed artificial intelligence
logic programming


Efficient interactive fuzzy keyword search Traditional information systems return answers after a user submits a complete query . Users often feel `` left in the dark '' when they have limited knowledge about the underlying data , and have to use a try-and-see approach for finding information . A recent trend of supporting autocomplete in these systems is a first step towards solving this problem . In this paper , we study a new information-access paradigm , called `` interactive , fuzzy search , '' in which the system searches the underlying data `` on the fly '' as the user types in query keywords . It extends autocomplete interfaces by ( 1 ) allowing keywords to appear in multiple attributes ( in an arbitrary order ) of the underlying data ; and ( 2 ) finding relevant records that have keywords matching query keywords approximately . This framework allows users to explore data as they type , even in the presence of minor errors . We study research challenges in this framework for large amounts of data . Since each keystroke of the user could invoke a query on the backend , we need efficient algorithms to process each query within milliseconds . We develop various incremental-search algorithms using previously computed and cached results in order to achieve an interactive speed . We have deployed several real prototypes using these techniques . One of them has been deployed to support interactive search on the UC Irvine people directory , which has been used regularly and well received by users due to its friendly interface and high efficiency .

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

autocomplete
fuzzy search
interactive search


Context-aware citation recommendation When you write papers , how many times do you want to make some citations at a place but you are not sure which papers to cite ? Do you wish to have a recommendation system which can recommend a small number of good candidates for every place that you want to make some citations ? In this paper , we present our initiative of building a context-aware citation recommendation system . High quality citation recommendation is challenging : not only should the citations recommended be relevant to the paper under composition , but also should match the local contexts of the places citations are made . Moreover , it is far from trivial to model how the topic of the whole paper and the contexts of the citation places should affect the selection and ranking of citations . To tackle the problem , we develop a context-aware approach . The core idea is to design a novel non-parametric probabilistic model which can measure the context-based relevance between a citation context and a document . Our approach can recommend citations for a context effectively . Moreover , it can recommend a set of citations for a paper with high quality . We implement a prototype system in CiteSeerX . An extensive empirical evaluation in the CiteSeerX digital library against many baselines demonstrates the effectiveness and the scalability of our 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

bibliometrics
gleason's theorem
recommender systems


Semantic link based top-K join queries in P2P networks An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizing the number of objects that have to be accessed . This paper resolves this issue by organizing peers in a Semantic Link Network Overlay , where semantic links are established to denote the semantic relationship between peers ' data schemas . A query request will be routed to appropriate peers according to the semantic link type and a lower bound of rank function . Optimization strategies are proposed to reduce the total amount of data transmitted .

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


Find me if you can : improving geographical prediction with social and spatial proximity Geography and social relationships are inextricably intertwined ; the people we interact with on a daily basis almost always live near us . As people spend more time online , data regarding these two dimensions -- geography and social relationships -- are becoming increasingly precise , allowing us to build reliable models to describe their interaction . These models have important implications in the design of location-based services , security intrusion detection , and social media supporting local communities . Using user-supplied address data and the network of associations between members of the Facebook social network , we can directly observe and measure the relationship between geography and friendship . Using these measurements , we introduce an algorithm that predicts the location of an individual from a sparse set of located users with performance that exceeds IP-based geolocation . This algorithm is efficient and scalable , and could be run on a network containing hundreds of millions of 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


A machine learning based approach for table detection on the web Table is a commonly used presentation scheme , especially for describing relational information . However , table understanding remains an open problem . In this paper , we consider the problem of table detection in web documents . Its potential applications include web mining , knowledge management , and web content summarization and delivery to narrow-bandwidth devices . We describe a machine learning based approach to classify each given table entity as either genuine or non-genuine . Various features reflecting the layout as well as content characteristics of tables are studied . In order to facilitate the training and evaluation of our table classifier , we designed a novel web document table ground truthing protocol and used it to build a large table ground truth database . The database consists of 1,393 HTML files collected from hundreds of different web sites and contains 11,477 leaf TABLE elements , out of which 1,740 are genuine tables . Experiments were conducted using the cross validation method and an F-measure of 95.89 % was achieved .

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

decision tree
information retrieval
layout analysis
support vector machine


Towards the self-annotating web The success of the Semantic Web depends on the availability of ontologies as well as on the proliferation of web pages annotated with metadata conforming to these ontologies . Thus , a crucial question is where to acquire these metadata from . In this paper wepropose PANKOW ( Pattern-based Annotation through Knowledge on theWeb ) , a method which employs an unsupervised , pattern-based approach to categorize instances with regard to an ontology . The approach is evaluated against the manual annotations of two human subjects . The approach is implemented in OntoMat , an annotation tool for the Semantic Web and shows very promising results .

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

document and text editing
information extraction
natural language processing
semantic annotation


The WT10G dataset and the evolution of the web The purpose of this paper is threefold . First , we study the evolution of the web based on data available from an earlier snapshot of the web and compare the results with those predicted in ( 2 ) . Secondly , we establish whether the WT10G dataset , a popular benchmark for the development and evaluation of internet based applications is appropriate for the tasks . Finally , is there a need for a collection of a new dataset for such purposes . The findings are that the appropriateness of using the popular WT10G dataset in recent Internet-based experiments is questionable and that there is a need for a new collection of dataset for development and evaluation purposes of algorithms related to Internet search engine developments .

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

hypertext/hypermedia
miscellaneous
rate of change
standard datasets
web evolution


Keynote talk Richard Granger will be providing an update on the deployment of information technology at a national scale in the NHS in England . Particular topics that will be covered include variability of performance and user organizations and suppliers . Access\/channel strategies for NHS users and members of the public . Take-up rates for new technologies including internet adoption . Data on number of users and transactions to date will also be provided .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
world wide web


Enabling entity-based aggregators for web 2.0 data Selecting and presenting content culled from multiple heterogeneous and physically distributed sources is a challenging task . The exponential growth of the web data in modern times has brought new requirements to such integration systems . Data is not any more produced by content providers alone , but also from regular users through the highly popular Web 2.0 social and semantic web applications . The plethora of the available web content increased its demand by regular users who could not any more wait the development of advanced integration tools . They wanted to be able to build in a short time their own specialized integration applications . Aggregators came to the risk of these users . They allowed them not only to combine distributed content , but also to process it in ways that generate new services available for further consumption . To cope with the heterogeneous data , the Linked Data initiative aims at the creation and exploitation of correspondences across data values . In this work , although we share the Linked Data community vision , we advocate that for the modern web , linking at the data value level is not enough . Aggregators should base their integration tasks on the concept of an entity , i.e. , identifying whether different pieces of information correspond to the same real world entity , such as an event or a person . We describe our theory , system , and experimental results that illustrate the approach 's effectiveness .

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

design tools and techniques
entity matching


Dynamic and graphical web page breakpoints Breakpoints are perhaps the quintessential feature of a de-bugger : they allow a developer to stop time and study the program state . Breakpoints are typically specified by selecting a line of source code . For large , complex , web pages with multiple developers , the relevant source line for a given user interface problem may not be known to the developer . In this paper we describe the implementation of breakpoints in dynamically created source , and on error messages , network events , DOMmutation , DOMobject property changes , and CSS style rule updates . Adding these domain-specific breakpoints to a general-purpose debugger for Javascript allows the developer to initiate the debugging process via Web page abstractions rather than lower level source code views . The breakpoints are implemented in the open source Fire-bug project , version 1.5 , for the Firefox Web browser .

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

breakpoints css debugging dynamic firebug javascript web


Foundations for service ontologies : aligning OWL-S to dolce Clarity in semantics and a rich formalization of this semantics are important requirements for ontologies designed to be deployed in large-scale , open , distributed systems such as the envisioned Semantic Web This is especially important for the description of Web Services , which should enable complex tasks involving multiple agents . As one of the first initiatives of the Semantic Webcommunity for describing Web Services , OWL-S attracts a lot of interest even though it is still under development . We identify problematic aspects of OWL-S and suggest enhancements through alignment to a foundational ontology . Another contribution of ourwork is the Core Ontology of Services that tries to fill the epistemological gap between the foundational ontology and OWL-S . It can be reused to align other Web Service description languages as well . Finally , we demonstrate the applicability of our work byaligning OWL-S ' standard example called CongoBuy .

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

core ontology of services
dolce
semantic web
web services

daml-s
descriptions and situations
owl-s


An evaluation of TCP splice benefits in web proxy servers This study is the first to evaluate the performance benefits of using the recently proposed TCP Splice kernel service in Web proxy servers . Previous studies show that splicing client and server TCP connections in the IP layer improves the throughput of proxy servers like firewalls and content routers by reducing the data transfer overheads . In a Web proxy server , data transfer overheads represent a relatively large fraction of the request processing overheads , in particular when content is not cacheable or the proxy cache is memory-based . The study is conducted with a socket-level implementation of TCP Splice . Compared to IP-level implementations , socket-level implementations make possible the splicing of connections with different TCP characteristics , and improve response times by reducing recovery delay after a packet loss . The experimental evaluation is focused on HTTP request types for which the proxy can fully exploit the TCP Splice service , which are the requests for non-cacheabl . content and SSL tunneling . The experimental testbed includes an emulated WAN environment and benchmark applications for HTTP\/1 .0 Web client , Web server , and Web proxy running on AIX RS\/6000 machines . Our experiments demonstrate that TCP Splice enables reductions in CPU utilization of 10-43 % of the CPU , depending on file sizes and request rates . Larger relative reductions are observed when tunneling SSL connections , in particular for small file transfers . Response times are also reduced by up to 1.8 sec .

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


YAGO2 : exploring and querying world knowledge in time , space , context , and many languages We present YAGO2 , an extension of the YAGO knowledge base with focus on temporal and spatial knowledge . It is automatically built from Wikipedia , GeoNames , and WordNet , and contains nearly 10 million entities and events , as well as 80 million facts representing general world knowledge . An enhanced data representation introduces time and location as first-class citizens . The wealth of spatio-temporal information in YAGO can be explored either graphically or through a special time - and space-aware query language .

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

geo-spatial multilingual ontology textual


Composite event queries for reactivity on the web Reactivity on the Web is an emerging issue . The capability to automatically react to events ( such as updates to Web resources ) is essential for both Web services and Semantic Web systems . Such systems need to have the capability to detect and react to complex , real life situations . This presentation gives flavors of the high-level language XChange , for programming reactive behavior on the Web .

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

composite events
event-condition-action rules
language constructs and features
reactive languages


Identifying primary content from web pages and its application to web search ranking Web pages are usually highly structured documents . In some documents , content with different functionality is laid out in blocks , some merely supporting the main discourse . In other documents , there may be several blocks of unrelated main content . Indexing a web page as if it were a linear document can cause problems because of the diverse nature of its content . If the retrieval function treats all blocks of the web page equally without attention to structure , it may lead to irrelevant query matches . In this paper , we describe how content quality of different blocks of a web page can be utilized to improve a retrieval function . Our method is based on segmenting a web page into semantically coherent blocks and learning a predictor of segment content quality . We also describe how to use segment content quality estimates as weights in the BM25F formulation . Experimental results show our method improves relevance of retrieved results by as much as 4.5 % compared to BM25F that treats the body of a web page as a single section , and by a larger margin of over 9 % for difficult queries .

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

content quality models
information search and retrieval
page structure
segmentation


Value-based web caching Despite traditional web caching techniques , redundant data is often transferred over HTTP links . These redundant transfers result from both resource modification and aliasing . Resource modification causes the data represented by a single URI to change ; often , in transferring the new data , some old data is retransmitted . Aliasing , in contrast , occurs when the same data is named by multiple URIs , often in the context of dynamic or advertising content . Traditional web caching techniques index data by its name and thus often fail to recognize and take advantage of aliasing . Despite traditional web caching techniques , redundant data is often transferred over HTTP links . These redundant transfers result from both resource modification and aliasing . Resource modification causes the data represented by a single URI to change ; often , in transferring the new data , some old data is retransmitted . Aliasing , in contrast , occurs when the same data is named by multiple URIs , often in the context of dynamic or advertising content . Traditional web caching techniques index data by its name and thus often fail to recognize and take advantage of aliasing .

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

aliasing
caching
http
redundant transfers
resource modification

applications
duplicate suppression
dynamic content
hypertext transfer protocol
privacy
proxy
scalability
world wide web
www


Semantic search Activities such as Web Services and the Semantic Web are working to create a web of distributed machine understandable data . In this paper we present an application called ` Semantic Search ' which is built on these supporting technologies and is designed to improve traditional web searching . We provide an overview of TAP , the application framework upon which the Semantic Search is built . We describe two implemented Semantic Search systems which , based on the denotation of the search query , augment traditional search results with relevant data aggregated from distributed sources . We also discuss some general issues related to searching and the Semantic Web and outline how an understanding of the semantics of the search terms can be used to provide better results .

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


Preserving XML queries during schema evolution In XML databases , new schema versions may be released as frequently as once every two weeks . This poster describes a taxonomy of changes for XML schema evolution . It examines the impact of those changes on schema validation and query evaluation . Based on that study , it proposes guidelines for XML schema evolution and for writing queries in such a way that they continue to operate as expected across evolving schemas .

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


Addressing the testing challenge with a web-based e-assessment system that tutors as it assesses Secondary teachers across the country are being asked to use formative assessment data to inform their classroom instruction . At the same time , critics of No Child Left Behind are calling the bill `` No Child Left Untestedö emphasizing the negative side of assessment , in that every hour spent assessing students is an hour lost from instruction . Or does it have to be ? What if we better integrated assessment into the classroom , and we allowed students to learn during the test ? Maybe we could even provide tutoring on the steps of solving problems . Our hypothesis is that we can achieve more accurate assessment by not only using data on whether students get test items right or wrong , but by also using data on the effort required for students to learn how to solve a test item . We provide evidence for this hypothesis using data collected with our E-ASSISTment system by more than 600 students over the course of the 2004-2005 school year . We also show that we can track student knowledge over time using modern longitudinal data analysis techniques . In a separate paper ( 9 ) , we report on the ASSISTment system 's architecture and scalability , while this paper is focused on how we can reliably assess student learning .

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

computer-assisted instruction
intelligent tutoring system
mcas
predict


Web taxonomy integration using support vector machines We address the problem of integrating objects from a source taxonomy into a master taxonomy . This problem is not only currently pervasive on the web , but also important to the emerging semantic web . A straightforward approach to automating this process would be to train a classifier for each category in the master taxonomy , and then classify objects from the source taxonomy into these categories . In this paper we attempt to use a powerful classification method , Support Vector Machine ( SVM ) , to attack this problem . Our key insight is that the availability of the source taxonomy data could be helpful to build better classifiers in this scenario , therefore it would be beneficial to do transductive learning rather than inductive learning , i.e. , learning to optimize classification performance on a particular set of test examples . Noticing that the categorizations of the master and source taxonomies often have some semantic overlap , we propose a method , Cluster Shrinkage ( CS ) , to further enhance the classification by exploiting such implicit knowledge . Our experiments with real-world web data show substantial improvements in the performance of taxonomy integration .

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

classification
semantic web
support vector machines
taxonomy integration
transductive learning


Mining collective local knowledge from Google MyMaps The emerging popularity of location-aware devices and location-based services has generated a growing archive of digital traces of people 's activities and opinions in physical space . In this study , we leverage geo-referenced user-generated content from Google MyMaps to discover collective local knowledge and understand the differing perceptions of urban space . Working with the large collection of publicly available , annotation-rich MyMaps data , we propose a highly parallelizable approach in order to merge identical places , discover landmarks , and recommend places . Additionally , we conduct interviews with New York City residents\/visitors to validate the quantitative findings .

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

geo-tagged data
miscellaneous
place recommendation
user-generated content


Mining RDF metadata for generalized association rules : knowledge discovery in the semantic web era In this paper , we present a novel frequent generalized pattern mining algorithm , called GP-Close , for mining generalized associations from RDF metadata . To solve the over-generalization problem encountered by existing methods , GP-Close employs the notion of emphgeneralization closure for systematic over-generalization reduction .

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


All your contacts are belong to us : automated identity theft attacks on social networks Social networking sites have been increasingly gaining popularity . Well-known sites such as Facebook have been reporting growth rates as high as 3 % per week . Many social networking sites have millions of registered users who use these sites to share photographs , contact long-lost friends , establish new business contacts and to keep in touch . In this paper , we investigate how easy it would be for a potential attacker to launch automated crawling and identity theft attacks against a number of popular social networking sites in order to gain access to a large volume of personal user information . The first attack we present is the automated identity theft of existing user profiles and sending of friend requests to the contacts of the cloned victim . The hope , from the attacker 's point of view , is that the contacted users simply trust and accept the friend request . By establishing a friendship relationship with the contacts of a victim , the attacker is able to access the sensitive personal information provided by them . In the second , more advanced attack we present , we show that it is effective and feasible to launch an automated , cross-site profile cloning attack . In this attack , we are able to automatically create a forged profile in a network where the victim is not registered yet and contact the victim 's friends who are registered on both networks . Our experimental results with real users show that the automated attacks we present are effective and feasible in practice .

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


Extracting events and event descriptions from Twitter This paper describes methods for automatically detecting events involving known entities from Twitter and understanding both the events as well as the audience reaction to them . We show that NLP techniques can be used to extract events , their main actors and the audience reactions with encouraging results .

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

information extraction
opinion mining
social media


A semantic-link-based infrastructure for web service discovery in P2P networks An important issue arising from P2P applications is how to accurately and efficiently retrieve the required Web services from large-scale repositories . This paper resolves this issue by organizing services in the overlay combining the Semantic Service Link Network and the Chord P2P network . A service request will first be routed in the Chord according to the given service operation names and keywords . Then , the same request will be routed in the Semantic Link Network according to the service link type and semantic matching . Compared with previous P2P service discovery approaches , the proposed approach has two advantages : ( 1 ) produce more accurate and meaning results when searching for particular services in a P2P network ; and ( 2 ) enable users and peers to discover services in a more flexible way .

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


Multi-factor clustering for a marketplace search interface Search engines provide a small window to the vast repository of data they index and against which they search . They try their best to return the documents that are of relevance to the user but often a large number of results may be returned . Users struggle to manage this vast result set looking for the items of interest . Clustering search results is one way of alleviating this navigational pain . In this paper we describe a clustering system that enables clustering search results in an online marketplace search system .

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


Test case prioritization for regression testing of service-oriented business applications Regression testing assures the quality of modified service-oriented business applications against unintended changes . However , a typical regression test suite is large in size . Earlier execution of those test cases that may detect failures is attractive . Many existing prioritization techniques order test cases according to their respective coverage of program statements in a previous version of the application . On the other hand , industrial service-oriented business applications are typically written in orchestration languages such as WS-BPEL and integrated with workflow steps and web services via XPath and WSDL . Faults in these artifacts may cause the application to extract wrong data from messages , leading to failures in service compositions . Surprisingly , current regression testing research hardly considers these artifacts . We propose a multilevel coverage model to capture the business process , XPath , and WSDL from the perspective of regression testing . We develop a family of test case prioritization techniques atop the model . Empirical results show that our techniques can achieve significantly higher rates of fault detection than existing techniques .

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


Design , implementation , and evaluation of a client characterization driven web server In earlier work we proposed a way for a Web server to detect connectivity information about clients accessing it in order to take tailored actions for a client request . This paper describes the design , implementation , and evaluation of such a working system . A Web site has a strong incentive to reduce the ` time-to-glass ' to retain users who may otherwise lose interest and leave the site . We have performed a measurement study from multiple client sites around the world with various levels of connectivity to the Internet communicating with modified Apache Web servers under our control . The results show that clients can be classified in a correct and stable manner and that user-perceived latency can be reduced via tailored actions . Our measurements show that classification and determination of server actions are done without significant overhead on the Web server . We explore a variety of modified actions ranging from selecting a lower quality version of the resource to altering the manner of content delivery . By studying numerous performance related factors in a single unified framework and examining both individual actions as well as combination of actions , our modified Web server implementation shows the efficacy of various server actions .

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

apache server
client classification
computer system implementation
general
httperf
performance of systems
server adaptation
web performance


Semantic wiki aided business process specification This paper formulates a collaborative system for modeling business application . The system uses a Semantic Wiki to enable collaboration between the various stakeholders involved in the design of the system and translates the captured intelligence into business models which are used for designing a business system .

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

business modeling
business process modeling language
rdf
semantic web
software


Automatically generating metadata for digital photographs with geographic coordinates Given location information on digital photographs , we can automatically generate an abundance of photo-related metadata using off-the-shelf and web-based data sources . These metadata can serve as additional memory cues and filters when browsing a personal or global collection of photos .

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


Finding the search engine that works for you A search engine evaluation model that considers over seventy performance and feature parameters is presented . The design of a web-based system that allows the user to tailor the model to his\/her own preference , and to evaluate search engines of interest , is introduced . The results presented to the user identify the most suitable search engine that suits his\/her needs .

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


Identifying link farm spam pages With the increasing importance of search in guiding today 's web traffic , more and more effort has been spent to create search engine spam . Since link analysis is one of the most important factors in current commercial search engines ' ranking systems , new kinds of spam aiming at links have appeared . Building link farms is one technique that can deteriorate link-based ranking algorithms . In this paper , we present algorithms for detecting these link farms automatically by first generating a seed set based on the common link set between incoming and outgoing links of Web pages and then expanding it . Links between identified pages are re-weighted , providing a modified web graph to use in ranking page importance . Experimental results show that we can identify most link farm spam pages and the final ranking results are improved for almost all tested queries .

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

hits
information search and retrieval
pagerank
web search engine


DIDO : a disease-determinants ontology from web sources This paper introduces DIDO , a system providing convenient access to knowledge about factors involved in human diseases , automatically extracted from textual Web sources . The knowledge base is bootstrapped by integrating entities from hand-crafted sources like MeSH and OMIM . As these are short on relationships between dierent types of biomedical entities , DIDO employs flexible and robust pattern learning and constraint-based reasoning methods to automatically extract new relational facts from textual sources . These facts can then be iteratively added to the knowledge base . The result is a semantic graph of typed entities and relations between diseases , their symptoms , and their factors , with emphasis on environmental factors but covering also molecular determinants . We demonstrate the value of DIDO for knowledge discovery about causal factors and properties of complex diseases , including factor-disease chains .

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

biomedical knowledge base
disease factors
general
relation extraction


Efficient application placement in a dynamic hosting platform Web hosting providers are increasingly looking into dynamic hosting to reduce costs and improve the performance of their platforms . Instead of provisioning fixed resources to each customer , dynamic hosting maintains a variable number of application instances to satisfy current demand . While existing research in this area has mostly focused on the algorithms that decide on the number and location of application instances , we address the problem of efficient enactment of these decisions once they are made . We propose a new approach to application placement and experimentally show that it dramatically reduces the cost of application placement , which in turn improves the end-to-end agility of the hosting platform in reacting to demand changes .

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

application servers
dynamic placement
startup performance


Implementing the media fragments URI specification In this paper , we describe two examples of implementations of the Media Fragments URI specification which is currently being developed by the W3C Media Fragments Working Group . The group 's mission is to create standard addressing schemes for media fragments on the Web using Uniform Resource Identifiers ( URIs ) . We describe two scenarios to illustrate the implementations . More specifically , we show how User Agents ( UA ) will either be able to resolve media fragment URIs without help from the server , or will make use of a media fragments-aware server . Finally , we present some ongoing discussions and issues regarding the implementation of the Media Fragments specification .

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


Simplifying friendlist management Online social networks like Facebook allow users to connect , communicate , and share content . The popularity of these services has lead to an information overload for their users ; the task of simply keeping track of different interactions has become daunting . To reduce this burden , sites like Facebook allows the user to group friends into specific lists , known as friendlists , aggregating the interactions and content from all friends in each friendlist . While this approach greatly reduces the burden on the user , it still forces the user to create and populate the friendlists themselves and , worse , makes the user responsible for maintaining the membership of their friendlists over time . We show that friendlists often have a strong correspondence to the structure of the social network , implying that friendlists may be automatically inferred by leveraging the social network structure . We present a demonstration of Friendlist Manager , a Facebook application that proposes friendlists to the user based on the structure of their local social network , allows the user to tweak the proposed friendlists , and then automatically creates the friendlists for the user .

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

communications applications
on-line information services
privacy
social applications


Large scale integration of senses for the semantic web Nowadays , the increasing amount of semantic data available on the Web leads to a new stage in the potential of Semantic Web applications . However , it also introduces new issues due to the heterogeneity of the available semantic resources . One of the most remarkable is redundancy , that is , the excess of different semantic descriptions , coming from different sources , to describe the same intended meaning . In this paper , we propose a technique to perform a large scale integration of senses ( expressed as ontology terms ) , in order to cluster the most similar ones , when indexing large amounts of online semantic information . It can dramatically reduce the redundancy problem on the current Semantic Web . In order to make this objective feasible , we have studied the adaptability and scalability of our previous work on sense integration , to be translated to the much larger scenario of the Semantic Web . Our evaluation shows a good behavior of these techniques when used in large scale experiments , then making feasible the proposed approach .

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

miscellaneous
ontologies
scalable sense integration


Content hole search in community-type content In community-type content such as blogs and SNSs , we call the user 's unawareness of information as a `` content hole '' and the search for this information as a `` content hole search . '' A content hole search differs from similarity searching and has a variety of types . In this paper , we propose different types of content holes and define each type . We also propose an analysis of dialogue related to community-type content and introduce content hole search by using Wikipedia as an example .

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


Exploit sequencing views in semantic cache to accelerate xpath query evaluation In XML databases , materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I\/O cost . Although there are a number of proposals of semantic cache for XML queries , the issues of fast cache lookup and compensation query construction could be further studied . In this paper , based on sequential XPath queries , we propose fastCLU , a fast Cache LookUp algorithm and effiCQ , an efficient Compensation Query constructing algorithm to solve these two problems . Experimental results show that our algorithms outperform previous algorithms and can achieve good performance of query evaluation .

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

query evaluation
semantic cache
xml
xpath


Model-directed web transactions under constrained modalities Online transactions ( e.g. , buying a book on the Web ) typically involve a number of steps spanning several pages . Conducting such transactions under constrained interaction modalities as exemplified by small screen handhelds or interactive speech interfaces - the primary mode of communication for visually impaired individuals - is a strenuous , fatigue-inducing activity . But usually one needs to browse only a small fragment of a Web page to perform a transactional step such as a form fillout , selecting an item from a search results list , etc. . We exploit this observation to develop an automata-based process model that delivers only the `` relevant '' page fragments at each transactional step , thereby reducing information overload on such narrow interaction bandwidths . We realize this model by coupling techniques from content analysis of Web documents , automata learning and statistical classification . The process model and associated techniques have been incorporated into Guide-O , a prototype system that facilitates online transactions using speech\/keyboard interface ( Guide-O-Speech ) , or with limited-display size handhelds ( Guide-O-Mobile ) . Performance of Guide-O and its user experience are reported .

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

assisstive device
content adaption
web transaction


Understanding and combating link farming in the twitter social network Recently , Twitter has emerged as a popular platform for discovering real-time information on the Web , such as news stories and people 's reaction to them . Like the Web , Twitter has become a target for link farming , where users , especially spammers , try to acquire large numbers of follower links in the social network . Acquiring followers not only increases the size of a user 's direct audience , but also contributes to the perceived influence of the user , which in turn impacts the ranking of the user 's tweets by search engines . In this paper , we first investigate link farming in the Twitter network and then explore mechanisms to discourage the activity . To this end , we conducted a detailed analysis of links acquired by over 40,000 spammer accounts suspended by Twitter . We find that link farming is wide spread and that a majority of spammers ' links are farmed from a small fraction of Twitter users , the social capitalists , who are themselves seeking to amass social capital and links by following back anyone who follows them . Our findings shed light on the social dynamics that are at the root of the link farming problem in Twitter network and they have important implications for future designs of link spam defenses . In particular , we show that a simple user ranking scheme that penalizes users for connecting to spammers can effectively address the problem by disincentivizing users from linking with other users simply to gain influence .

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

collusionrank
pagerank
security and protection


Three-level caching for efficient query processing in large Web search engines Large web search engines have to answer thousands of queries per second with interactive response times . Due to the sizes of the data sets involved , often in the range of multiple terabytes , a single query may require the processing of hundreds of megabytes or more of index data . To keep up with this immense workload , large search engines employ clusters of hundreds or thousands of machines , and a number of techniques such as caching , index compression , and index and query pruning are used to improve scalability . In particular , two-level caching techniques cache results of repeated identical queries at the frontend , while index data for frequently used query terms are cached in each node at a lower level . We propose and evaluate a three-level caching scheme that adds an intermediate level of caching for additional performance gains . This intermediate level attempts to exploit frequently occurring pairs of terms by caching intersections or projections of the corresponding inverted lists . We propose and study several offline and online algorithms for the resulting weighted caching problem , which turns out to be surprisingly rich in structure . Our experimental evaluation based on a large web crawl and real search engine query log shows significant performance gains for the best schemes , both in isolation and in combination with the other caching levels . We also observe that a careful selection of cache admission and eviction policies is crucial for best overall performance .

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


Clustering for opportunistic communication We describe ongoing work on I2I , a system aimed at fostering opportunistic communication among users viewing or manipulating content on the Web and in productivity applications . Unlike previous work in which the URLs of Web resources are used to group users visiting the same resource , we present a more general framework for clustering work contexts to group users together that accounts for dynamic content and distributional properties of Web accesses which can limit the utility URL based systems . In addition , we describe a method for scaffolding asynchronous communication in the context of an ongoing task that takes into account the ephemeral nature of the location of content on the Web . The techniques we describe also nicely cover local files in progress , in addition to publicly available Web content . We present the results of several evaluations that indicate systems that use the techniques we employ may be more useful than systems that are strictly URL based .

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

agents
awareness
collaboration
critical mass


EDUTELLA : a P2P networking infrastructure based on RDF Metadata for the World Wide Web is important , but metadata for Peer-to-Peer ( P2P ) networks is absolutely crucial . In this paper we discuss the open source project Edutella which builds upon metadata standards defined for the WWW and aims to provide an RDF-based metadata infrastructure for P2P applications , building on the recently announced JXTA Framework . We describe the goals and main services this infrastructure will provide and the architecture to connect Edutella Peers based on exchange of RDF metadata . As the query service is one of the core services of Edutella , upon which other services are built , we specify in detail the Edutella Common Data Model ( ECDM ) as basis for the Edutella query exchange language ( RDF-QEL-i ) and format implementing distributed queries over the Edutella network . Finally , we shortly discuss registration and mediation services , and introduce the prototype and application scenario for our current Edutella aware peers .

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


Compositional knowledge management for medical services on semantic web The vision of the Semantic Web is to reduce manual discovery and usage of Web resources ( documents and services ) and to allow software agents to automatically identify these Web resources , integrate them and execute them for achieving the intended goals of the user . Such a composed Web service may be represented as a workflow , called service flow . Current Web service standards are not sufficient for automatic composition . This paper presents different types of compositional knowledge required for Web service discovery and composition . As a proof of concept , we have implemented our framework in a cardiovascular domain which requires advanced service discovery and composition across heterogeneous platforms of multiple organizations .

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


How opinions are received by online communities : a case study on amazon.com helpfulness votes There are many on-line settings in which users publicly express opinions . A number of these offer mechanisms for other users to evaluate these opinions ; a canonical example is Amazon.com , where reviews come with annotations like `` 26 of 32 people found the following review helpful . '' Opinion evaluation appears in many off-line settings as well , including market research and political campaigns . Reasoning about the evaluation of an opinion is fundamentally different from reasoning about the opinion itself : rather than asking , `` What did Y think of X ? '' , we are asking , `` What did Z think of Y 's opinion of X ? '' Here we develop a framework for analyzing and modeling opinion evaluation , using a large-scale collection of Amazon book reviews as a dataset . We find that the perceived helpfulness of a review depends not just on its content but also but also in subtle ways on how the expressed evaluation relates to other evaluations of the same product . As part of our approach , we develop novel methods that take advantage of the phenomenon of review `` plagiarism '' to control for the effects of text in opinion evaluation , and we provide a simple and natural mathematical model consistent with our findings . Our analysis also allows us to distinguish among the predictions of competing theories from sociology and social psychology , and to discover unexpected differences in the collective opinion-evaluation behavior of user populations from ifferent countries .

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

opinion mining
review helpfulness
review utility
sentiment analysis
social influence


Understanding the functions of business accounts on Twitter This paper performs an initial exploration of business Twitter accounts in order to start understanding how businesses interact with their users and viceversa . We provide an analysis of business tweet types and topics and show that specific business tweet classes such as deals and events can be reliably identified for customer use .

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

business intelligence
general
information extraction


A system for principled matchmaking in an electronic marketplace More and more resources are becoming available on the Web , and there is a growing need for infrastructures that , based on advertised descriptions , are able to semantically match demands with supplies . We formalize general properties a matchmaker should have , then we present a matchmaking facilitator , compliant with desired properties . The system embeds a NeoClassic reasoner , whose structural subsumption algorithm has been modified to allow match categorization into potential and partial , and ranking of matches within categories . Experiments carried out show the good correspondence between users and system rankings .

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

decision support
description logics
e-commerce
knowledge representation