Extracting semantic structure of web documents using content and visual information This work aims to provide a page segmentation algorithm which uses both visual and content information to extract the semantic structure of a web page . The visual information is utilized using the VIPS algorithm and the content information using a pre-trained Naive Bayes classifier . The output of the algorithm is a semantic structure tree whose leaves represent segments having unique topic . However contents of the leaf segments may possibly be physically distributed in the web page . This structure can be useful in many web applications like information retrieval , information extraction and automatic web page adaptation . This algorithm is expected to outperform other existing page segmentation algorithms since it utilizes both content and visual information .

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

naive bayes classifier
page segmentation
vips

dom
hypertext/hypermedia
topic hierarchy


Online expansion of rare queries for sponsored search Sponsored search systems are tasked with matching queries to relevant advertisements . The current state-of-the-art matching algorithms expand the user 's query using a variety of external resources , such as Web search results . While these expansion-based algorithms are highly effective , they are largely inefficient and can not be applied in real-time . In practice , such algorithms are applied offline to popular queries , with the results of the expensive operations cached for fast access at query time . In this paper , we describe an efficient and effective approach for matching ads against rare queries that were not processed offline . The approach builds an expanded query representation by leveraging offline processing done for related popular queries . Our experimental results show that our approach significantly improves the effectiveness of advertising on rare queries with only a negligible increase in computational cost .

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

information search and retrieval
query expansion
tail queries


Reactive rules inference from dynamic dependency models Defining dependency models is sometimes an easier , more intuitive way for ontology representation than defining reactive rules directly , as it provides a higher level of abstraction . We will shortly introduce the ADI ( Active Dependency Integration ) model capabilities , emphasizing new developments : 1 . Support of automatic dependencies instantiation from an abstract definition that expresses a general dependency in the ontology , namely a `` template '' . 2 . Inference of rules for dynamic dependency models where dependencies and entities may be inserted deleted and updated . We use the eTrade example in order to exemplify those capabilities .

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

active databases
active systems
event correlation
relationships between entities
rule engine


LCA-based selection for XML document collections In this paper , we address the problem of database selection for XML document collections , that is , given a set of collections and a user query , how to rank the collections based on their goodness to the query . Goodness is determined by the relevance of the documents in the collection to the query . We consider keyword queries and support Lowest Common Ancestor ( LCA ) semantics for defining query results , where the relevance of each document to a query is determined by properties of the LCA of those nodes in the XML document that contain the query keywords . To avoid evaluating queries against each document in a collection , we propose maintaining in a preprocessing phase , information about the LCAs of all pairs of keywords in a document and use it to approximate the properties of the LCA-based results of a query . To improve storage and processing efficiency , we use appropriate summaries of the LCA information based on Bloom filters . We address both a boolean and a weighted version of the database selection problem . Our experimental results show that our approach incurs low errors in the estimation of the goodness of a collection and provides rankings that are very close to the actual ones .

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

database selection
lowest common ancestor
xml


A novel clustering-based RSS aggregator In recent years , different commercial Weblog subscribing systems have been proposed to return stories from users . subscribed feeds . In this paper , we propose a novel clustering-based RSS aggregator called as RSS Clusgator System ( RCS ) for Weblog reading . Note that an RSS feed may have several different topics . A user may only be interested in a subset of these topics . In addition there could be many different stories from multiple RSS feeds , which discuss similar topic from different perspectives . A user may be interested in this topic but do not know how to collect all feeds related to this topic . In contrast to many previous works , we cluster all stories in RSS feeds into hierarchical structure to better serve the readers . Through this way , users can easily find all their interested stories . To make the system current , we propose a flexible time window for incremental clustering . RCS utilizes both link information and content information for efficient clustering . Experiments show the effectiveness of RCS .

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


Trust-serv : model-driven lifecycle management of trust negotiation policies for web services A scalable approach to trust negotiation is required in Web service environments that have large and dynamic requester populations . We introduce Trust-Serv , a model-driven trust negotiation framework for Web services . The framework employs a model for trust negotiation that is based on state machines , extended with security abstractions . Our policy model supports lifecycle management , an important trait in the dynamic environments that characterize Web services . In particular , we provide a set of change operations to modify policies , and migration strategies that permit ongoing negotiations to be migrated to new policies without being disrupted . Experimental results show the performance benefit of these strategies . The proposed approach has been implemented as a container-centric mechanism that is transparent to the Web services and to the developers of Web services , simplifying Web service development and management as well as enabling scalable deployments .

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

lifecycle management
trust negotiation
web services

conceptual modeling
on-line information services
security and protection
social issues


Data summaries for on-demand queries over linked data Typical approaches for querying structured Web Data collect ( crawl ) and pre-process ( index ) large amounts of data in a central data repository before allowing for query answering . However , this time-consuming pre-processing phase however leverages the benefits of Linked Data -- where structured data is accessible live and up-to-date at distributed Web resources that may change constantly -- only to a limited degree , as query results can never be current . An ideal query answering system for Linked Data should return current answers in a reasonable amount of time , even on corpora as large as the Web . Query processors evaluating queries directly on the live sources require knowledge of the contents of data sources . In this paper , we develop and evaluate an approximate index structure summarising graph-structured content of sources adhering to Linked Data principles , provide an algorithm for answering conjunctive queries over Linked Data on theWeb exploiting the source summary , and evaluate the system using synthetically generated queries . The experimental results show that our lightweight index structure enables complete and up-to-date query results over Linked Data , while keeping the overhead for querying low and providing a satisfying source ranking at no additional cost .

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


Choosing the best knowledge base system for large semantic web applications We present an evaluation of four knowledge base systems with respect to use in large Semantic Web applications . We discuss the performance of each system . In particular , we show that existing systems need to place a greater emphasis on scalability .

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

evaluation
knowledge base system
semantic web


Placing search in context : the concept revisited

invisible web
semantic processing
statistical natural language processing


OWL FA : a metamodeling extension of OWL D This paper proposes OWL FA , a decidable extension of OWL DL with the metamodeling architecture of RDFS ( FA ) . It shows that the knowledge base satisfiability problem of OWL FA can be reduced to that of OWL DL , and compares the FA semantics with the recently proposed contextual semantics and Hilog semantics for OWL .

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

knowledge representation formalisms and methods


Automatic construction of a context-aware sentiment lexicon : an optimization approach The explosion of Web opinion data has made essential the need for automatic tools to analyze and understand people 's sentiments toward different topics . In most sentiment analysis applications , the sentiment lexicon plays a central role . However , it is well known that there is no universally optimal sentiment lexicon since the polarity of words is sensitive to the topic domain . Even worse , in the same domain the same word may indicate different polarities with respect to different aspects . For example , in a laptop review , `` large '' is negative for the battery aspect while being positive for the screen aspect . In this paper , we focus on the problem of learning a sentiment lexicon that is not only domain specific but also dependent on the aspect in context given an unlabeled opinionated text collection . We propose a novel optimization framework that provides a unified and principled way to combine different sources of information for learning such a context-dependent sentiment lexicon . Experiments on two data sets ( hotel reviews and customer feedback surveys on printers ) show that our approach can not only identify new sentiment words specific to the given domain but also determine the different polarities of a word depending on the aspect in context . In further quantitative evaluation , our method is proved to be effective in constructing a high quality lexicon by comparing with a human annotated gold standard . In addition , using the learned context-dependent sentiment lexicon improved the accuracy in an aspect-level sentiment classification task .

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

optimization
sentiment analysis
sentiment lexicon


Structuring and presenting annotated media repositories We generate hypermedia presentations from annotated media repositories using simple document structure as an intermediate phase . This poster applies Web style technologies to this process . Results include style specification for accessing semantically annotated media repositories , for determining document structure from semantic structure and for applying this document structure to the final presentation .

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


Modeling relationship strength in online social networks Previous work analyzing social networks has mainly focused on binary friendship relations . However , in online social networks the low cost of link formation can lead to networks with heterogeneous relationship strengths ( e.g. , acquaintances and best friends mixed together ) . In this case , the binary friendship indicator provides only a coarse representation of relationship information . In this work , we develop an unsupervised model to estimate relationship strength from interaction activity ( e.g. , communication , tagging ) and user similarity . More specifically , we formulate a link-based latent variable model , along with a coordinate ascent optimization procedure for the inference . We evaluate our approach on real-world data from Facebook and LinkedIn , showing that the estimated link weights result in higher autocorrelation and lead to improved classification accuracy .

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

homophily
miscellaneous
randomization
social influence


Netprobe : a fast and scalable system for fraud detection in online auction networks Given a large online network of online auction users and their histories of transactions , how can we spot anomalies and auction fraud ? This paper describes the design and implementation of NetProbe , a system that we propose for solving this problem . NetProbe models auction users and transactions as a Markov Random Field tuned to detect the suspicious patterns that fraudsters create , and employs a Belief Propagation mechanism to detect likely fraudsters . Our experiments show that NetProbe is both efficient and effective for fraud detection . We report experiments on synthetic graphs with as many as 7,000 nodes and 30,000 edges , where NetProbe was able to spot fraudulent nodes with over 90 % precision and recall , within a matter of seconds . We also report experiments on a real dataset crawled from eBay , with nearly 700,000 transactions between more than 66,000 users , where NetProbe was highly effective at unearthing hidden networks of fraudsters , within a realistic response time of about 6 minutes . For scenarios where the underlying data is dynamic in nature , we propose IncrementalNetProbe , which is an approximate , but fast , variant of NetProbe . Our experiments prove that Incremental NetProbe executes nearly doubly fast as compared to NetProbe , while retaining over 99 % of its accuracy .

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

bipartite cores
markov random fields
miscellaneous


Adaptive query routing in peer web search An unstructured peer network application was proposed to address the query forwarding problem of distributed search engines and scalability limitations of centralized search engines . Here we present novel techniques to improve local adaptive routing , showing they perform significantly better than a simple learning scheme driven by query response interactions among neighbors . We validate prototypes of our peer network application via simulations with 500 model users based on actual Web crawls . We finally compare the quality of the results with those obtained by centralized search engines , suggesting that our application can draw advantages from the context and coverage of the peer collective .

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

information search and retrieval
peer collaborative search
performance evaluation
topical crawlers


Document recommendation in social tagging services Social tagging services allow users to annotate various online resources with freely chosen keywords ( tags ) . They not only facilitate the users in finding and organizing online resources , but also provide meaningful collaborative semantic data which can potentially be exploited by recommender systems . Traditional studies on recommender systems focused on user rating data , while recently social tagging data is becoming more and more prevalent . How to perform resource recommendation based on tagging data is an emerging research topic . In this paper we consider the problem of document ( e.g. Web pages , research papers ) recommendation using purely tagging data . That is , we only have data containing users , tags , documents and the relationships among them . We propose a novel graph-based representation learning algorithm for this purpose . The users , tags and documents are represented in the same semantic space in which two related objects are close to each other . For a given user , we recommend those documents that are sufficiently close to him\/her . Experimental results on two data sets crawled from Del. icio . us and CiteULike show that our algorithm can generate promising recommendations and outperforms traditional recommendation algorithms .

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


Feature weighting in content based recommendation system using social network analysis We propose a hybridization of collaborative filtering and content based recommendation system . Attributes used for content based recommendations are assigned weights depending on their importance to users . The weight values are estimated from a set of linear regression equations obtained from a social network graph which captures human judgment about similarity of items .

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


Modeling online reviews with multi-grain topic models In this paper we present a novel framework for extracting the ratable aspects of objects from online user reviews . Extracting such aspects is an important challenge in automatically mining product opinions from the web and in generating opinion-based summaries of user reviews ( 18 , 19 , 7 , 12 , 27 , 36 , 21 ) . Our models are based on extensions to standard topic modeling methods such as LDA and PLSA to induce multi-grain topics . We argue that multi-grain models are more appropriate for our task since standard models tend to produce topics that correspond to global properties of objects ( e.g. , the brand of a product type ) rather than the aspects of an object that tend to be rated by a user . The models we present not only extract ratable aspects , but also cluster them into coherent topics , e.g. , ` waitress ' and ` bartender ' are part of the same topic ` staff ' for restaurants . This differentiates it from much of the previous work which extracts aspects through term frequency analysis with minimal clustering . We evaluate the multi-grain models both qualitatively and quantitatively to show that they improve significantly upon standard topic models .

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

content analysis and indexing
general
opinion mining


Topic sentiment mixture : modeling facets and opinions in weblogs In this paper , we define the problem of topic-sentiment analysis on Weblogs and propose a novel probabilistic model to capture the mixture of topics and sentiments simultaneously . The proposed Topic-Sentiment Mixture ( TSM ) model can reveal the latent topical facets in a Weblog collection , the subtopics in the results of an ad hoc query , and their associated sentiments . It could also provide general sentiment models that are applicable to any ad hoc topics . With a specifically designed HMM structure , the sentiment models and topic models estimated with TSM can be utilized to extract topic life cycles and sentiment dynamics . Empirical experiments on different Weblog datasets show that this approach is effective for modeling the topic facets and sentiments and extracting their dynamics from Weblog collections . The TSM model is quite general ; it can be applied to any text collections with a mixture of topics and sentiments , thus has many potential applications , such as search result summarization , opinion tracking , and user behavior prediction .

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

information search and retrieval
mixture model
sentiment analysis
topic-sentiment mixture


Proximity within paragraph : a measure to enhance document retrieval performance We created a proximity measure , called Proximity Within Paragraph ( PWP ) , which is based on the concept of value assignment to queried words , grouped by associated ideas within paragraphs . Based on the WT10G dataset , a test system comprising three test sets and fifty queries were constructed to evaluate the effectiveness of PWP by comparing it with the existing method : Minimum Distance Between Queried Pairs . A further experiment combines the scores obtained from both methods and the results suggest that the combination can significantly improve the effectiveness .

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

information search and retrieval
ranking algorithm


Sync kit : a persistent client-side database caching toolkit for data intensive websites We introduce a client-server toolkit called Sync Kit that demonstrates how client-side database storage can improve the performance of data intensive websites . Sync Kit is designed to make use of the embedded relational database defined in the upcoming HTML5 standard to offload some data storage and processing from a web server onto the web browsers to which it serves content . Our toolkit provides various strategies for synchronizing relational database tables between the browser and the web server , along with a client-side template library so that portions web applications may be executed client-side . Unlike prior work in this area , Sync Kit persists both templates and data in the browser across web sessions , increasing the number of concurrent connections a server can handle by up to a factor of four versus that of a traditional server-only web stack and a factor of three versus a recent template caching approach .

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


Partitioned multi-indexing : bringing order to social search To answer search queries on a social network rich with user-generated content , it is desirable to give a higher ranking to content that is closer to the individual issuing the query . Queries occur at nodes in the network , documents are also created by nodes in the same network , and the goal is to find the document that matches the query and is closest in network distance to the node issuing the query . In this paper , we present the `` Partitioned Multi-Indexing '' scheme , which provides an approximate solution to this problem . With m links in the network , after an offline ~ O ( m ) pre-processing time , our scheme allows for social index operations ( i.e. , social search queries , as well as insertion and deletion of words into and from a document at any node ) , all in time ~ O ( 1 ) . Further , our scheme can be implemented on open source distributed streaming systems such as Yahoo ! S4 or Twitter 's Storm so that every social index operation takes ~ O ( 1 ) processing time and network queries in the worst case , and just two network queries in the common case where the reverse index corresponding to the query keyword is much smaller than the memory available at any distributed compute node . Building on Das Sarma et al. 's approximate distance oracle , the worst-case approximation ratio of our scheme is ~ O ( 1 ) for undirected networks . Our simulations on the social network Twitter as well as synthetic networks show that in practice , the approximation ratio is actually close to 1 for both directed and undirected networks . We believe that this work is the first demonstration of the feasibility of social search with real-time text updates at large scales .

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

information search and retrieval
partitioned multi-indexing
real time
scalable


Analyzing client interactivity in streaming media This paper provides an extensive analysis of pre-stored streaming media workloads , focusing on the client interactive behavior . We analyze four workloads that fall into three different domains , namely , education , entertainment video and entertainment audio . Our main goals are : ( a ) to identify qualitative similarities and differences in the typical client behavior for the three workload classes and ( b ) to provide data for generating realistic synthetic workloads .

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


Analyzing online discussion for marketing intelligence We present a system that gathers and analyzes online discussion as it relates to consumer products . Weblogs and online message boards provide forums that record the voice of the public . Woven into this discussion is a wide range of opinion and commentary about consumer products . Given its volume , format and content , the appropriate approach to understanding this data is large-scale web and text data mining . By using a wide variety of state-of-the-art techniques including crawling , wrapping , text classification and computational linguistics , online discussion is gathered and annotated within a framework that provides for interactive analysis that yields marketing intelligence for our customers .

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

content systems
information retrieval
information search and retrieval
machine learning
text mining


Index structures and algorithms for querying distributed RDF repositories A technical infrastructure for storing , querying and managing RDFdata is a key element in the current semantic web development . Systems like Jena , Sesame or the ICS-FORTH RDF Suite are widelyused for building semantic web applications . Currently , none ofthese systems supports the integrated querying of distributed RDF repositories . We consider this a major shortcoming since the semanticweb is distributed by nature . In this paper we present an architecture for querying distributed RDF repositories by extending the existing Sesame system . We discuss the implications of our architectureand propose an index structure as well as algorithms forquery processing and optimization in such a distributed context .

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


Information integration over time in unreliable and uncertain environments Often an interesting true value such as a stock price , sports score , or current temperature is only available via the observations of noisy and potentially conflicting sources . Several techniques have been proposed to reconcile these conflicts by computing a weighted consensus based on source reliabilities , but these techniques focus on static values . When the real-world entity evolves over time , the noisy sources can delay , or even miss , reporting some of the real-world updates . This temporal aspect introduces two key challenges for consensus-based approaches : ( i ) due to delays , the mapping between a source 's noisy observation and the real-world update it observes is unknown , and ( ii ) missed updates may translate to missing values for the consensus problem , even if the mapping is known . To overcome these challenges , we propose a formal approach that models the history of updates of the real-world entity as a hidden semi-Markovian process ( HSMM ) . The noisy sources are modeled as observations of the hidden state , but the mapping between a hidden state ( i.e. real-world update ) and the observation ( i.e. source value ) is unknown . We propose algorithms based on Gibbs Sampling and EM to jointly infer both the history of real-world updates as well as the unknown mapping between them and the source values . We demonstrate using experiments on real-world datasets how our history-based techniques improve upon history-agnostic consensus-based approaches .

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

heterogeneous databases
probabilistic model
semi-markov


A non-syntactic approach for text sentiment classification with stopwords The present approach uses stopwords and the gaps that occur between successive stopwords - formed by contentwords - as features for sentiment classification .

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

latent dirichlet allocation
sentiment mining
stop-words
text and language applications
topic models


Architecture of a p2p distributed adaptive directory

adaptivity
bookmark sharing
peer to peer


XQuery in the browser Since the invention of the Web , the browser has become more and more powerful . By now , it is a programming and execution environment in itself . The predominant language to program applications in the browser today is JavaScript . With browsers becoming more powerful , JavaScript has been extended and new layers have been added ( e.g. , DOM-Support and XPath ) . Today , JavaScript is very successful and applications and GUI features implemented in the browser have become increasingly complex . The purpose of this paper is to improve the programmability of Web browsers by enabling the execution of XQuery programs in the browser . Although it has the potential to ideally replace JavaScript , it is possible to run it in addition to JavaScript for more flexibility . Furthermore , it allows instant code migration from the server to the client and vice-versa . This enables a significant simplification of the technology stack . The intuition is that programming the browser involves mostly XML ( i.e. , DOM ) navigation and manipulation , and the XQuery family of W3C standards were designed exactly for that purpose . The paper proposes extensions to XQuery for Web browsers and gives a number of examples that demonstrate the usefulness of XQuery for the development of AJAX-style applications . Furthermore , the paper presents the design of an XQuery plug-in for Microsoft 's Internet Explorer . The paper also gives examples of applications which were developed with the help of this plug-in .

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

client-side programming
css
events
general
html
language classifications
mash-up
script
scripting
stylesheets
xhtml


A software framework for matchmaking based on semantic web technology An important objective of the Semantic Web is to make Electronic Commerce interactions more flexible and automated . To achieve this , standardization of ontologies , message content and message protocols will be necessary . In this paper we investigate how Semantic and Web Services technologies can be used to support service advertisement and discovery in e-commerce . In particular , we describe the design and implementation of a service matchmaking prototype which uses a DAML-S based ontology and a Description Logic reasoner to compare ontology based service descriptions . We also present the results of initial experiments testing the performance of this prototype implementation in a realistic agent based e-commerce scenario .

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


Adaptive record extraction from web pages We describe an adaptive method for extracting records from web pages . Our algorithm combines a weighted tree matching metric with clustering for obtaining data extraction patterns . We compare our method experimentally to the state-of-the-art , and show that our approach is very competitive for rigidly-structured records ( such as product descriptions ) and far superior for loosely-structured records ( such as entrieson blogs ) .

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


Active objects : actions for entity-centric search We introduce an entity-centric search experience , called Active Objects , in which entity-bearing queries are paired with actions that can be performed on the entities . For example , given a query for a specific flashlight , we aim to present actions such as reading reviews , watching demo videos , and finding the best price online . In an annotation study conducted over a random sample of user query sessions , we found that a large proportion of queries in query logs involve actions on entities , calling for an automatic approach to identifying relevant actions for entity-bearing queries . In this paper , we pose the problem of finding actions that can be performed on entities as the problem of probabilistic inference in a graphical model that captures how an entity bearing query is generated . We design models of increasing complexity that capture latent factors such as entity type and intended actions that determine how a user writes a query in a search box , and the URL that they click on . Given a large collection of real-world queries and clicks from a commercial search engine , the models are learned efficiently through maximum likelihood estimation using an EM algorithm . Given a new query , probabilistic inference enables recommendation of a set of pertinent actions and hosts . We propose an evaluation methodology for measuring the relevance of our recommended actions , and show empirical evidence of the quality and the diversity of the discovered actions .

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

entity-centric search
query log mining
web search


Cat and mouse : content delivery tradeoffs in web access Web pages include extraneous material that may be viewed as undesirable by a user . Increasingly many Web sites also require users to register to access either all or portions of the site . Such tension between content owners and users has resulted in a `` cat and mouse '' game between content provided and how users access it . We carried out a measurement-based study to understand the nature of extraneous content and its impact on performance as perceived by users . We characterize how this content is distributed and the effectiveness of blocking mechanisms to stop it as well as countermeasures taken by content owners to negate such mechanisms . We also examine sites that require some form of registration to control access and the attempts made to circumvent it . Results from our study show that extraneous content exists on a majority of popular pages and that a 25-30 % reduction in downloaded objects and bytes with corresponding latency reduction can be attained by blocking such content . The top ten advertisement delivering companies delivered 40 % of all URLs matched as ads in our study . Both the server name and the remainder of the URL are important in matching a URL as an ad . A majority of popular sites require some form of registration and for such sites users can obtain an account from a shared public database . We discuss future measures and countermeasures on the part of each side .

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

anonymity
computer-communication networks
content blocking
privacy
web registration


WS-replication : a framework for highly available web services Due to the rapid acceptance of web services and its fast spreading , a number of mission-critical systems will be deployed as web services in next years . The availability of those systems must be guaranteed in case of failures and network disconnections . An example of web services for which availability will be a crucial issue are those belonging to coordination web service infrastructure , such as web services for transactional coordination ( e.g. , WS-CAF and WS-Transaction ) . These services should remain available despite site and connectivity failures to enable business interactions on a 24x7 basis . Some of the common techniques for attaining availability consist in the use of a clustering approach . However , in an Internet setting a domain can get partitioned from the network due to a link overload or some other connectivity problems . The unavailability of a coordination service impacts the availability of all the partners in the business process . That is , coordination services are an example of critical components that need higher provisions for availability . In this paper , we address this problem by providing an infrastructure , WS-Replication , for WAN replication of web services . The infrastructure is based on a group communication web service , WS-Multicast , that respects the web service autonomy . The transport of WS-Multicast is based on SOAP and relies exclusively on web service technology for interaction across organizations . We have replicated WS-CAF using our WS-Replication framework and evaluated its performance .

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

availability
group communication
web services


Automatically generating labels based on unified click model Ground truth labels are one of the most important parts in many test collections for information retrieval . Each label , depicting the relevance between a query-document pair , is usually judged by a human , and this process is time-consuming and labor-intensive . Automatically Generating labels from click-through data has attracted increasing attention . In this paper , we propose a Unified Click Model to predict the multi-level labels , which aims at comprehensively considering the advantages of the Position Models and Cascade Models . Experiments show that the proposed click model outperforms the existing click models in predicting the multi-level labels , and could replace the labels judged by humans for test collections .

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


Geographic locations of web servers The ccTLD ( country code Top Level Domain ) in a URL does not necessarily point to the geographic location of the server concerned . The authors have surveyed sample servers belonging to 60 ccTLDs in Africa , with regard to the number of hops required to reach the target site from Japan , the response time , and the NIC registration information of each domain . The survey has revealed the geographical distribution of server sites as well as their connection environments . It has been found that the percentage of offshore ( out of home country ) servers is as high as 80 % and more than half of these are located in Europe . Offshore servers not only provide little benefit to the people of the country to which each ccTLD rightly belongs but their existence also heightens the risk of a country being unable to control them with its own policies and regulations . Offshore servers constitute a significant aspect of the digital divide problem .

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

africa
cctld
nic registration information
number of hops
response time

digital-divide
geographic location of servers
offshore server
traceroute


Discovering the staring people from social networks In this paper , we study a novel problem of staring people discovery from social networks , which is concerned with finding people who are not only authoritative but also sociable in the social network . We formalize this problem as an optimization programming problem . Taking the co-author network as a case study , we define three objective functions and propose two methods to combine these objective functions . A genetic algorithm based method is further presented to solve this problem . Experimental results show that the proposed solution can effectively find the staring people from social networks .

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


Dynamic learning-based mechanism design for dependent valued exchange economies Learning private information from multiple strategic agents poses challenge in many Internet applications . Sponsored search auctions , crowdsourcing , Amazon 's mechanical turk , various online review forums are examples where we are interested in learning true values of the advertisers or true opinion of the reviewers . The common thread in these decision problems is that the optimal outcome depends on the private information of all the agents , while the decision of the outcome can be chosen only through reported information which may be manipulated by the strategic agents . The other important trait of these applications is their dynamic nature . The advertisers in an online auction or the users of mechanical turk arrive and depart , and when present , interact with the system repeatedly , giving the opportunity to learn their types . Dynamic mechanisms , which learn from the past interactions and make present decisions depending on the expected future evolution of the game , has been shown to improve performance over repeated versions of static mechanisms . In this paper , we will survey the past and current state-of-the-art dynamic mechanisms and analyze a new setting where the agents consist of buyers and sellers , known as exchange economies , and agents having value interdependency , which are relevant in applications illustrated through examples . We show that known results of dynamic mechanisms with independent value settings can not guarantee certain desirable properties in this new significantly different setting . In the future work , we propose to analyze similar settings with dynamic types and population .

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

incentive compatibility
individual rationality
nash equilibrium


An adaptive crawler for locating hidden-Web entry points In this paper we describe new adaptive crawling strategies to efficiently locate the entry points to hidden-Web sources . The fact that hidden-Web sources are very sparsely distributedmakes the problem of locating them especially challenging . We deal with this problem by using the contents ofpages to focus the crawl on a topic ; by prioritizing promisinglinks within the topic ; and by also following links that may not lead to immediate benefit . We propose a new frameworkwhereby crawlers automatically learn patterns of promisinglinks and adapt their focus as the crawl progresses , thus greatly reducing the amount of required manual setup andtuning . Our experiments over real Web pages in a representativeset of domains indicate that online learning leadsto significant gains in harvest rates ' the adaptive crawlers retrieve up to three times as many forms as crawlers thatuse a fixed focus strategy .

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

learning classifiers
web crawling strategies


Nearest-neighbor caching for content-match applications Motivated by contextual advertising systems and other web applications involving efficiency-accuracy tradeoffs , we study similarity caching . Here , a cache hit is said to occur if the requested item is similar but not necessarily equal to some cached item . We study two objectives that dictate the efficiency-accuracy tradeoff and provide our caching policies for these objectives . By conducting extensive experiments on real data we show similarity caching can significantly improve the efficiency of contextual advertising systems , with minimal impact on accuracy . Inspired by the above , we propose a simple generative model that embodies two fundamental characteristics of page requests arriving to advertising systems , namely , long-range dependences and similarities . We provide theoretical bounds on the gains of similarity caching in this model and demonstrate these gains empirically by fitting the actual data to the model .

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


Towards a multimedia formatting vocabulary Time-based , media-centric Web presentations can be described declaratively in the XML world through the development of languages such as SMIL . It is difficult , however , to fully integrate them in a complete document transformation processing chain . In order to achieve the desired processing of data-driven , time-based , media-centric presentations , the text-flow based formatting vocabularies used by style languages such as XSL , CSS and DSSSL need to be extended . The paper presents a selection of use cases which are used to derive a list of requirements for a multimedia style and transformation formatting vocabulary . The boundaries of applicability of existing text-based formatting models for media-centric transformations are analyzed . The paper then discusses the advantages and disadvantages of a fully-fledged time-based multimedia formatting model . Finally , the discussion is illustrated by describing the key properties of the example multimedia formatting vocabulary currently implemented in the back-end of our Cuypers multimedia transformation engine .

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

cuypers
document transformation
multimedia

document preparation
formatting objects
hyper-media
hypertext/hypermedia
multimedia information systems


Item-based collaborative filtering recommendation algorithms


Integrating value-based requirement engineering models to webml using vip business modeling framework Requirement engineering ( RE ) is emerging as an increasingly important discipline for supporting Web application development , as these are designed to satisfy diverse stakeholder needs , additional functional , information , multimedia and usability requirements as compared to traditional software applications . Moreover , when considering innovative e-commerce applications , value-based RE is an extremely relevant methodology which exploits the concept of economic value during the RE activity . In contrast , most of the methodologies proposed for the development of Web applications , primarily focus on the system design , and paying less attention to the RE , and specifically to value-based RE . Focusing this aspect , the paper presents integration of value-based RE models to WebML models using our recently proposed VIP Business Modeling Framework ( 1 ) . We also analyze the framework 's potential in linking other modeling approaches , and argue about its significant integration potential with various E-R\/OO-based , process aware Web modeling approaches .

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

business information model
business process model
business value model
general


A trust management framework for service-oriented environments Many reputation management systems have been developed under the assumption that each entity in the system will use a variant of the same scoring function . Much of the previous work in reputation management has focused on providing robustness and improving performance for a given reputation scheme . In this paper , we present a reputation-based trust management framework that supports the synthesis of trust-related feedback from many different entities while also providing each entity with the flexibility to apply different scoring functions over the same feedback data for customized trust evaluations . We also propose a novel scheme to cache trust values based on recent client activity . To evaluate our approach , we implemented our trust management service and tested it on a realistic application scenario in both LAN and WAN distributed environments . Our results indicate that our trust management service can effectively support multiple scoring functions with low overhead and high availability .

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

distributed systems
security and protection
service-oriented architectures


Acquiring ontological knowledge from query logs We present a method for acquiring ontological knowledge using search query logs . We first use query logs to identify important contexts associated with terms belonging to a semantic category ; we then use these contexts to harvest new words belonging to this category . Our evaluation on selected categories indicates that the method works very well to help harvesting terms , achieving 85 % to 95 % accuracy in categorizing newly acquired terms .

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


Estimating web site readability using content extraction Nowadays , information is primarily searched on the WWW . From a user perspective , the readability is an important criterion for measuring the accessibility and thereby the quality of an information . We show that modern content extraction algorithms help to estimate the readability of a web document quite accurate .

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


Knowledge encapsulation for focused search from pervasive devices

disconnected search
knowledge agents
portable devices
web


The indexable web is more than 11.5 billion pages In this short paper we estimate the size of the public indexable web at 11.5 billion pages . We also estimate the overlap and the index size of Google , MSN , Ask\/Teoma and Yahoo !

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

index sizes
information search and retrieval
search engines
size of the web


Towards effective browsing of large scale social annotations This paper is concerned with the problem of browsing social annotations . Today , a lot of services ( e.g. , Del. icio . us , Filckr ) have been provided for helping users to manage and share their favorite URLs and photos based on social annotations . Due to the exponential increasing of the social annotations , more and more users , however , are facing the problem how to effectively find desired resources from large annotation data . Existing methods such as tag cloud and annotation matching work well only on small annotation sets . Thus , an effective approach for browsing large scale annotation sets and the associated resources is in great demand by both ordinary users and service providers . In this paper , we propose a novel algorithm , namely Effective Large Scale Annotation Browser ( ELSABer ) , to browse large-scale social annotation data . ELSABer helps the users browse huge number of annotations in a semantic , hierarchical and efficient way . More specifically , ELSABer has the following features : 1 ) the semantic relations between annotations are explored for browsing of similar resources ; 2 ) the hierarchical relations between annotations are constructed for browsing in a top-down fashion ; 3 ) the distribution of social annotations is studied for efficient browsing . By incorporating the personal and time information , ELSABer can be further extended for personalized and time-related browsing . A prototype system is implemented and shows promising results .

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

annotation browsing
clustering
evaluation


Estimating the impressionrank of web pages The ImpressionRank of a web page ( or , more generally , of a web site ) is the number of times users viewed the page while browsing search results . ImpressionRank captures the visibility of pages and sites in search engines and is thus an important measure , which is of interest to web site owners , competitors , market analysts , and end users . All previous approaches to estimating the ImpressionRank of a page rely on privileged access to private data sources , like the search engine 's query log . In this paper we present the first external algorithm for estimating the ImpressionRank of a web page . This algorithm relies on access to three public data sources : the search engine , the query suggestion service of the search engine , and the web . In addition , the algorithm is local and uses modest resources . It can therefore be used by almost any party to estimate the ImpressionRank of any page on any search engine . En route to estimating the ImpressionRank of a page , our algorithm solves a novel variant of the keyword extraction problem : it finds the most popular search keywords that drive impressions of a page . Empirical analysis of the algorithm on the Google and Yahoo ! search engines indicates that it is accurate and provides interesting insights about sites and search queries .

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

auto-completions
data mining
estimation,
information search and retrieval
popular keyword extraction
suggestions


Exploring social annotations for information retrieval Social annotation has gained increasing popularity in many Web-based applications , leading to an emerging research area in text analysis and information retrieval . This paper is concerned with developing probabilistic models and computational algorithms for social annotations . We propose a unified framework to combine the modeling of social annotations with the language modeling-based methods for information retrieval . The proposed approach consists of two steps : ( 1 ) discovering topics in the contents and annotations of documents while categorizing the users by domains ; and ( 2 ) enhancing document and query language models by incorporating user domain interests as well as topical background models . In particular , we propose a new general generative model for social annotations , which is then simplified to a computationally tractable hierarchical Bayesian network . Then we apply smoothing techniques in a risk minimization framework to incorporate the topical information to language models . Experiments are carried out on a real-world annotation data set sampled from del. icio . us . Our results demonstrate significant improvements over the traditional approaches .

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

information retrieval
social annotations


Improving web performance by client characterization driven server adaptation We categorize the set of clients communicating with a server on the Web based on information that can be determined by the server . The Web server uses the information to direct tailored actions . Users with poor connectivity may choose not to stay at a Web site if it takes a long time to receive a page , even if the Web server at the site is not the bottleneck . Retaining such clients may be of interest to a Web site . Better connected clients can receive enhanced representations of Web pages , such as with higher quality images . We explore a variety of considerations that could be used by a Web server in characterizing a client . Once a client is characterized as poor or rich , the server can deliver altered content , alter how content is delivered , alter policy and caching decisions , or decide when to redirect the client to a mirror site . We also use network-aware client clustering techniques to provide a coarser level of client categorization and use it to categorize subsequent clients from that cluster for which a client-specific categorization is not available . Our results for client characterization and applicable server actions are derived from real , recent , and diverse set of Web server logs . Our experiments demonstrate that a relatively simple characterization policy can classify poor clients such that these clients subsequently make the majority of badly performing requests to a Web server . This policy is also stable in terms of clients staying in the same class for a large portion of the analysis period . Client clustering can significantly help in initially classifying clients for which no previous information about the client is known . We also show that different server actions can be applied to a significant number of request sequences with poor performance .

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

client characterization
server adaptation


Web4CE : accessing web-based applications on consumer devices In a world where all devices will be interconnected , the boundaries between the different devices will start to disappear . Devices will be able to access each other 's applications ; sessions can be suspended on one device and resumed on another device ; devices can serve as each other 's input and output device , and all devices will be able to connect to the Internet . This will give true mobility to the user as he\/she will not be restricted to the time and location where he\/she accesses an application . Of course , we need a variety of different mechanisms and technologies to enable this , such as : Remote rendering of UIs on other devices in the network . Infrastructure for discovering client and servers in a network . Mechanisms to exchange capability information between devices , and to adapt the UI based on these capabilities . Mechanisms to deal with session migration . Support for a wide range of consumer devices , ranging from mobile phones to high-end TVs . This requires technologies that cross different domains , i.e. the PC domain , mobile domain , and TV domain . Several major companies within these different domains have decided to work together on these issues . One of the results is a framework for remote user interfaces for both UPnP '' networks and the Internet . This framework is called Web4CE ( a.k.a. CEA-2014 ) ( 1 ) , and has been accepted as the baseline remote user interface technology within the Digital Living Network Alliance ( DLNA ) ( 2 ) , which is a large industry-wide effort for creating true interoperability between network-enabled devices . This paper provides a short overview of the Web4CE framework , and some of the use cases that it enables .

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

ajax
ce-html
cea
consumer electronics devices
embedded browsers
mobile and tv-based services
on-line information services
pervasive web applications
w3c
web 2.0


A multimodal interaction manager for device independent mobile applications This poster presents an overview of the work on an interaction manager of a platform for multimodal applications in 2.5 G and 3G mobile phone networks and WLAN environments . The poster describes the requirements for the interaction manager ( IM ) , its tasks and the resulting structure . We examine the W3C 's definition of an interaction manager and compare it to our implementation , which accomplishes some additional tasks .

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

device independence
mobile network
multi-user applications
multimodal interface
session management
user interface management systems


XQuery containment in presence of variable binding dependencies Semantic caching is an important technology for improving the response time of future user queries specified over remote servers . This paper deals with the fundamental query containment problem in an XQuery-based semantic caching system . To our best knowledge , the impact of subtle differences in XQuery semantics caused by different ways of specifying variables on query containment has not yet been studied . We introduce the concept of variable binding dependencies for representing the hierarchical element dependencies preserved by an XQuery . We analyze the problem of XQuery containment in the presence of such dependencies . We propose a containment mapping technique for nested XQuery in presence of variable binding dependencies . The implication of the nested block structure on XQuery containment is also considered . We mention the performance gains achieved by a semantic caching system we build based on the proposed technique .

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

database applications
expressions and their representation
variable binding dependency


Modeling click-through based word-pairs for web search Statistical translation models and latent semantic analysis ( LSA ) are two effective approaches to exploit click-through data for web search ranking . This paper presents two document ranking models that combine both approaches by explicitly modeling word-pairs . The first model , called PairModel , is a monolingual ranking model based on word pairs that are derived from click-through data . It maps queries and documents into a concept space spanned by these word pairs . The second model , called Bilingual Paired Topic Model ( BPTM ) , uses bilingual word pairs and jointly models a bilingual query-document collection . This model maps queries and documents in multiple languages into a lower dimensional semantic subspace . Experimental results on web search task show that they significantly outperform the state-of-the-art baseline models , and the best result is obtained by interpolating PairModel and BPTM .

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

clickthrough data
latent semantic analysis
web search

information search and retrieval
multilingual ir
topic models
translation model


Extraction and search of chemical formulae in text documents on the web Often scientists seek to search for articles on the Web related to a particular chemical . When a scientist searches for a chemical formula using a search engine today , she gets articles where the exact keyword string expressing the chemical formula is found . Searching for the exact occurrence of keywords during searching results in two problems for this domain : a ) if the author searches for CH4 and the article has H4C , the article is not returned , and b ) ambiguous searches like `` He '' return all documents where Helium is mentioned as well as documents where the pronoun `` he '' occurs . To remedy these deficiencies , we propose a chemical formula search engine . To build a chemical formula search engine , we must solve the following problems : 1 ) extract chemical formulae from text documents , 2 ) index chemical formulae , and 3 ) designranking functions for the chemical formulae . Furthermore , query models are introduced for formula search , and for each a scoring scheme based on features of partial formulae is proposed tomeasure the relevance of chemical formulae and queries . We evaluate algorithms for identifying chemical formulae in documents using classification methods based on Support Vector Machines ( SVM ) , and a probabilistic model based on conditional random fields ( CRF ) . Different methods for SVM and CRF to tune the trade-off between recall and precision forim balanced data are proposed to improve the overall performance . A feature selection method based on frequency and discrimination isused to remove uninformative and redundant features . Experiments show that our approaches to chemical formula extraction work well , especially after trade-off tuning . The results also demonstrate that feature selection can reduce the index size without changing ranked query results much .

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

chemical formula
conditional random fields
feature selection
query models
support vector machines

entity extraction
feature boosting
ranking
similarity search


A P2P based distributed services network for next generation mobile internet communications In this poster , we present a novel P2P ( Peer to Peer ) based distributed services network ( DSN ) , which is a next generation operable and manageable distributed core network architecture and functional structure , proposed by China Mobile for telecommunication services and wireless Internet . Our preliminary implementations of P2P VoIP ( Voice over Internet Protocol ) system over DSN platform demonstrate its effectiveness and promising future .

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

distributed computing
mobile communication


An ontology for internal and external business processes In this paper we introduce our multi metamodel process ontology ( m3po ) , which is based on various existing reference models and languages from the workflow and choreography domain . This ontology allows the extraction of arbitrary choreography interface descriptions from arbitrary internal workflow models . We also report on an initial validation : we translate an IBM Websphere MQ Workflow model into the m3po ontology and then extract an Abstract BPEL model from the ontology .

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

meta model integration
workflow modelling


High-performance spatial indexing for location-based services Much attention has been accorded to Location-Based Services and location tracking , a necessary component in active , trigger-based LBS applications . Tracking the location of a large population of moving objects requires very high update and query performance of the underlying spatial index . In this paper we investigate the performance and scalability of three main-memory based spatial indexing methods under dynamic update and query loads : an R-tree , a ZB-tree , and an array\/hashtable method . By leveraging the LOCUS performance evaluation testbed and the City Simulator dynamic spatial data generator , we are able to demonstrate the scalability of these methods and determine the maximum population size supported by each method , a useful parameter for capacity planning by wireless carriers .

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

database applications
location-based services
mobile computing


Using semantic rules to determine access control for web services Semantic Web technologies are bring increasingly employed to solve knowledge management issues in traditional Web technologies . This paper follows that trend and proposes using Semantic rule languages to construct rules for defining access control rules for Web Services . Using these rules , a system will be able to manage access to Web Services and also the information accessed via these services .

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

authorisation
owl
security and protection
swrl
web service security


Vertex collocation profiles : subgraph counting for link analysis and prediction We introduce the concept of a vertex collocation profile ( VCP ) for the purpose of topological link analysis and prediction . VCPs provide nearly complete information about the surrounding local structure of embedded vertex pairs . The VCP approach offers a new tool for domain experts to understand the underlying growth mechanisms in their networks and to analyze link formation mechanisms in the appropriate sociological , biological , physical , or other context . The same resolution that gives VCP its analytical power also enables it to perform well when used in supervised models to discriminate potential new links . We first develop the theory , mathematics , and algorithms underlying VCPs . Then we demonstrate VCP methods performing link prediction competitively with unsupervised and supervised methods across several different network families . We conclude with timing results that introduce the comparative performance of several existing algorithms and the practicability of VCP computations on large networks .

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


Context-sensitive query auto-completion Query auto completion is known to provide poor predictions of the user 's query when her input prefix is very short ( e.g. , one or two characters ) . In this paper we show that context , such as the user 's recent queries , can be used to improve the prediction quality considerably even for such short prefixes . We propose a context-sensitive query auto completion algorithm , NearestCompletion , which outputs the completions of the user 's input that are most similar to the context queries . To measure similarity , we represent queries and contexts as high-dimensional term-weighted vectors and resort to cosine similarity . The mapping from queries to vectors is done through a new query expansion technique that we introduce , which expands a query by traversing the query recommendation tree rooted at the query . In order to evaluate our approach , we performed extensive experimentation over the public AOL query log . We demonstrate that when the recent user 's queries are relevant to the current query she is typing , then after typing a single character , NearestCompletion 's MRR is 48 % higher relative to the MRR of the standard MostPopularCompletion algorithm on average . When the context is irrelevant , however , NearestCompletion 's MRR is essentially zero . To mitigate this problem , we propose HybridCompletion , which is a hybrid of NearestCompletion with MostPopularCompletion . HybridCompletion is shown to dominate both NearestCompletion and MostPopularCompletion , achieving a total improvement of 31.5 % in MRR relative to MostPopularCompletion on average .

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

context-awareness
information search and retrieval
query auto-completion


Predicting outcomes of web navigation Two exploratory studies examined the relationships among web navigation metrics , measures of lostness , and success on web navigation tasks . The web metrics were based on counts of visits to web pages , properties of the web usage graph , and similarity to an optimal path . Metrics based on similarity to an optimal path were good predictors of lostness and task success .

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


Enforcing strict model-view separation in template engines The mantra of every experienced web application developer is the same : thou shalt separate business logic from display . Ironically , almost all template engines allow violation of this separation principle , which is the very impetus for HTML template engine development . This situation is due mostly to a lack of formal definition of separation and fear that enforcing separation emasculates a template 's power . I show that not only is strict separation a worthy design principle , but that we can enforce separation while providing a potent template engine . I demonstrate my StringTemplate engine , used to build jGuru.com and other commercial sites , at work solving some nontrivial generational tasks . My goal is to formalize the study of template engines , thus , providing a common nomenclature , a means of classifying template generational power , and a way to leverage interesting results from formal language theory . I classify three types of restricted templates analogous to Chomsky 's type 1 . .3 grammar classes and formally define separation including the rules that embody separation . Because this paper provides a clear definition of model-view separation , template engine designers may no longer blindly claim enforcement of separation . Moreover , given theoretical arguments and empirical evidence , programmers no longer have an excuse to entangle model and view .

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


Using semantic web approach in augmented audio reality system for museum visitors In this paper , we describe our work in progress on the reasoning module of ec ( h ) o , an augmented audio-reality interface for museum visitors utilizing spatialized soundscapes and a semantic web approach to information . We used ontologies to describe the semantics of sound objects and represent user model . A rule-based system for selecting sound object uses semantic description of objects , visitor 's interaction history and heuristics for continuity of the dialogue between user and the 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 B O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Design and development of learning management system at universiti Putra Malaysia : a case study of e-SPRINT This paper reports the design and development of the e-SPRINT , Learning Management System , which has been derived from Sistem Pengurusan Rangkaian Integrasi Notakuliah dalam Talian - mod Elektronik ) and currently being implemented at Universiti Putra Malaysia ( UPM ) . The e-SPRINT was developed by utilizing PERL ( Practical Extraction and Report Language ) and was supported by standard database in Linux\/UNIX environment operating system . The system is currently being used to supplement and complement part of the classroom-based teaching . This paper covers the architecture and features of the e-SPRINT system which consists of five main modules . Some general issues and challenges of such e-learning initiatives implementation will also be discussed .

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

information systems applications
internet


Bridging the gap between OWL and relational databases Schema statements in OWL are interpreted quite differently from analogous statements in relational databases . If these statements are meant to be interpreted as integrity constraints ( ICs ) , OWL 's interpretation may seem confusing and\/or inappropriate . Therefore , we propose an extension of OWL with ICs that captures the intuition behind ICs in relational databases . We discuss the algorithms for checking IC satisfaction for different types of knowledge bases , and show that , if the constraints are satisfied , we can disregard them while answering a broad range of positive queries .

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

knowledge representation formalisms and methods


Dynamics of bidding in a P2P lending service : effects of herding and predicting loan success Online peer-to-peer ( P2P ) lending services are a new type of social platform that enables individuals borrow and lend money directly from one to another . In this paper , we study the dynamics of bidding behavior in a P2P loan auction website , Prosper.com . We investigate the change of various attributes of loan requesting listings over time , such as the interest rate and the number of bids . We observe that there is herding behavior during bidding , and for most of the listings , the numbers of bids they receive reach spikes at very similar time points . We explain these phenomena by showing that there are economic and social factors that lenders take into account when deciding to bid on a listing . We also observe that the profits the lenders make are tied with their bidding preferences . Finally , we build a model based on the temporal progression of the bidding , that reliably predicts the success of a loan request listing , as well as whether a loan will be paid back or not .

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

miscellaneous
peer-to-peer lending service
user behavior


A generic uiml vocabulary for device - and modality independent user interfaces We present in this poster our work on a User Interface Markup Language ( UIML ) vocabulary for the specification of device - and modality independent user interfaces . The work presented here is part of an application-oriented project . One of the results of the project is a prototype implementation of a generic platform for device independent multimodal mobile applications . The poster presents the requirements for a generic user interface description format and explains our approach on an integrated description of user interfaces for both graphical and voice modality . A basic overview of the vocabulary structure , its language elements and main features is presented .

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

device-independence
graphical user interfaces
interaction styles
mobile devices
mobile networks
multimodal user interfaces
multimodality
voice interfaces


An automatic semantic relationships discovery approach An important obstacle to the success of the Semantic Web is that the establishment of the semantic relationship is labor-intensive . This paper proposes an automatic semantic relationship discovering approach for constructing the semantic link network . The basic premise of this work is that the semantics of a web page can be reflected by a set of keywords , and the semantic relationship between two web pages can be determined by the semantic relationship between their keyword sets . The approach adopts the data mining algorithms to discover the semantic relationships between keyword sets , and then uses deductive and analogical reasoning to enrich the semantic relationships . The proposed algorithms have been implemented . Experiment shows that the approach is feasible .

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

analogical reasoning
data mining
semantic link network
semantic web


OWL DL vs. OWL flight : conceptual modeling and reasoning for the semantic Web The Semantic Web languages RDFS and OWL have been around for some time now . However , the presence of these languages has not brought the breakthrough of the Semantic Web the creators of the languages had hoped for . OWL has a number of problems in the area of interoperability and usability in the context of many practical application scenarios which impede the connection to the Software Engineering and Database communities . In this paper we present OWL Flight , which is loosely based on OWL , but the semantics is grounded in Logic Programming rather than Description Logics , and it borrows the constraint-based modeling style common in databases . This results in different types of modeling primitives and enforces a different style of ontology modeling . We analyze the modeling paradigms of OWL DL and OWL Flight , as well as reasoning tasks supported by both languages . We argue that different applications on the Semantic Web require different styles of modeling and thus both types of languages are required for the Semantic Web .

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

description logics
logic programming
semantic web


Dynamic coordination of information management services for processing dynamic web content Dynamic Web content provides us with time-sensitive and continuously changing data . To glean up-to-date information , users need to regularly browse , collect and analyze this Web content . Without proper tool support this information management task is tedious , time-consuming and error prone , especially when the quantity of the dynamic Web content is large , when many information management services are needed to analyze it , and when underlying services\/network are not completely reliable . This paper describes a multi-level , lifecycle ( design-time and run-time ) coordination mechanism that enables rapid , efficient development and execution of information management applications that are especially useful for processing dynamic Web content . Such a coordination mechanism brings dynamism to coordinating independent , distributed information management services . Dynamic parallelism spawns\/merges multiple execution service branches based on available data , and dynamic run-time reconfiguration coordinates service execution to overcome faulty services and bottlenecks . These features enable information management applications to be more efficient in handling content and format changes in Web resources , and enable the applications to be evolved and adapted to process dynamic Web content .

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

scalable component-based software systems


Towards domain-independent information extraction from web tables Traditionally , information extraction from web tables has focused on small , more or less homogeneous corpora , often based on assumptions about the use of

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

information search and retrieval
visual analysis
web mining
web page representation


Personalized interactive faceted search Faceted search is becoming a popular method to allow users to interactively search and navigate complex information spaces . A faceted search system presents users with key-value metadata that is used for query refinement . While popular in e-commerce and digital libraries , not much research has been conducted on which metadata to present to a user in order to improve the search experience . Nor are there repeatable benchmarks for evaluating a faceted search engine . This paper proposes the use of collaborative filtering and personalization to customize the search interface to each user 's behavior . This paper also proposes a utility based framework to evaluate the faceted interface . In order to demonstrate these ideas and better understand personalized faceted search , several faceted search algorithms are proposed and evaluated using the novel evaluation methodology .

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

evaluation
faceted search
personalization

collaborative recommendation
interactive search
user modeling