Towards identifying arguments in Wikipedia pages Wikipedia is one of the most widely used repositories of human knowledge today , contributed mostly by a few hundred thousand regular editors . In this open environment , inevitably , differences of opinion arise among editors of the same article . Especially for polemical topics such as religion and politics , difference of opinions among editors may lead to intense `` edit wars '' in which editors compete to have their opinions and points of view accepted . While such disputes can compromise the reliability of the article ( or at least portions of it ) , they are recorded in the edit history of the articles . We posit that exposing such disputes to the reader , and pointing to the portions of the text where they manifest most prominently can be beneficial in helping concerned readers in understanding such topics . In this paper , we discuss our initial efforts towards the problem of automatic evaluation of extracting controversial points in Wikipedia pages .

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


Search engine retrieval of changing information In this paper we analyze the Web coverage of three search engines , Google , Yahoo and MSN . We conducted a 15 month study collecting 15,770 Web content or information pages linked from 260 Australian federal and local government Web pages . The key feature of this domain is that new information pages are constantly added but the 260 web pages tend to provide links only to the more recently added information pages . Search engines list only some of the information pages and their coverage varies from month to month . Meta-search engines do little to improve coverage of information pages , because the problem is not the size of web coverage , but the frequency with which information is updated . We conclude that organizations such as governments which post important information on the Web can not rely on all relevant pages being found with conventional search engines , and need to consider other strategies to ensure important information can be found .

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


Description logic programs : combining logic programs with description logic We show how to interoperate , semantically and inferentially , between the leading Semantic Web approaches to rules ( RuleML Logic Programs ) and ontologies ( OWL\/DAML + OIL Description Logic ) via analyzing their expressive intersection . To do so , we define a new intermediate knowledge representation ( KR ) contained within this intersection : Description Logic Programs ( DLP ) , and the closely related Description Horn Logic ( DHL ) which is an expressive fragment of first-order logic ( FOL ) . DLP provides a significant degree of expressiveness , substantially greater than the RDF-Schema fragment of Description Logic . We show how to perform DLP-fusion : the bidirectional translation of premises and inferences ( including typical kinds of queries ) from the DLP fragment of DL to LP , and vice versa from the DLP fragment of LP to DL . In particular , this translation enables one to `` build rules on top of ontologies '' : it enables the rule KR to have access to DL ontological definitions for vocabulary primitives ( e.g. , predicates and individual constants ) used by the rules . Conversely , the DLP-fusion technique likewise enables one to `` build ontologies on top of rules '' : it enables ontological definitions to be supplemented by rules , or imported into DL from rules . It also enables available efficient LP inferencing algorithms\/implementations to be exploited for reasoning over large-scale DL ontologies .

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

description logic
inferencing
knowledge representation
logic programs
ontologies
rules
semantic web
translation

information integration
interoperability
miscellaneous
model-theoretic semantics
rdf
systems and software
xml


Querying and maintaining a compact XML storage As XML database sizes grow , the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance . This paper presents a new storage scheme for XML data that supports all navigational operations in near constant time . In addition to supporting efficient queries , the space requirement of the proposed scheme is within a constant factor of the information theoretic minimum , while insertions and deletions can be performed in near constant time as well . As a result , the proposed structure features a small memory footprint that increases cache locality , whilst still supporting standard APIs , such as DOM , and necessary database operations , such as queries and updates , efficiently . Analysis and experiments show that the proposed structure is space and time efficient .

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

compact storage
information storage
query processing
storage optimization


Detecting soft errors by redirection classification A soft error redirection is a URL redirection to a page that returns the HTTP status code 200 ( OK ) but has actually no relevant content to the client request . Since such redirections degrade the performance of web search engines in many ways , it is highly desirable to remove as many of them as possible . We propose a novel approach to detect soft error redirections by analyzing redirection logs collected during crawling operation . Experimental results on huge crawl data show that our measure can classify soft error redirections effectively .

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

information search and retrieval
search engine
soft 404
spam


A graphical user interface toolkit approach to thin-client computing Network and server-centric computing paradigms are quickly returning to being the dominant methods by which we use computers . Web applications are so prevalent that the role of a PC today has been largely reduced to a terminal for running a client or viewer such as a Web browser . Implementers of network-centric applications typically rely on the limited capabilities of HTML , employing proprietary `` plug ins '' or transmitting the binary image of an entire application that will be executed on the client . Alternatively , implementers can develop without regard for remote use , requiring users who wish to run such applications on a remote server to rely on a system that creates a virtual frame buffer on the server , and transmits a copy of its raster image to the local client . We review some of the problems that these current approaches pose , and show how they can be solved by developing a distributed user interface toolkit . A distributed user interface toolkit applies techniques to the high level components of a toolkit that are similar to those used at a low level in the X Window System . As an example of this approach , we present RemoteJFC , a working distributed user interface toolkit that makes it possible to develop thin-client applications using a distributed version of the Java Foundation Classes .

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

client-server systems
distributed systems
language constructs and features
network computing
remote method invocation
user interfaces


visKQWL , a visual renderer for a semantic web query language KiWi is a semantic Wiki that combines the Wiki philosophy of collaborative content creation with the methods of the Semantic Web in order to enable effective knowledge management . Querying a Wiki must be simple enough for beginning users , yet powerful enough to accommodate experienced users . To this end , the keyword-based KiWi query language ( KWQL ) supports queries ranging from simple lists of keywords to expressive rules for selecting and reshaping Wiki ( meta - ) data . In this demo , we showcase visKWQL , a visual interface for the KWQL language aimed at supporting users in the query construction process . visKWQL and its editor are described , and their functionality is illustrated using example queries . visKWQL 's editor provides guidance throughout the query construction process through hints , warnings and highlighting of syntactic errors . The editor enables round-tripping between the twin languages KWQL and visKWQL , meaning that users can switch freely between the textual and visual form when constructing or editing a query . It is implemented using HTML , JavaScript , and CSS , and can thus be used in ( almost ) any web browser without any additional software .

O O O O O O O B I O O O O O O B 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 B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
keyword querying
semantic wikis
visual query languages


First-order focused crawling This paper reports a new general framework of focused web crawling based on `` relational subgroup discovery '' . Predicates are used explicitly to represent the relevance clues of those unvisited pages in the crawl frontier , and then first-order classification rules are induced using subgroup discovery technique . The learned relational rules with sufficient support and confidence will guide the crawling process afterwards . We present the many interesting features of our proposed first-order focused crawler , together with preliminary promising experimental results .

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

focused crawling
relational subgroup discovery


Constraint SVG We believe it is important for web graphic standards such as SVG to support user interaction and diagrams that can adapt their layout and appearance to their viewing context so as to take into account viewing device charateristics and the viewer 's requirements . Previously we suggested that adding expression-based attributes to SVG and using one-way constraints to evaluate these dynamically would considerably improve SVG 's support for adaptive layout and user interaction . We describe a minimal backward compatible extension to SVG 1.1 , called Constraint SVG ( CSVG ) , that provides such expression-based attributes and its implementation on top of Batik . CSVG also provides another significant extension to SVG 1.1 : it allows the author to define new custom elements using XSLT .

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

adaptivity
constraint-based graphics
differential scaling
document formats
miscellaneous
scalable vector graphics
semantic zooming
user interfaces


A dynamic bayesian network click model for web search ranking As with any application of machine learning , web search ranking requires labeled data . The labels usually come in the form of relevance assessments made by editors . Click logs can also provide an important source of implicit feedback and can be used as a cheap proxy for editorial labels . The main difficulty however comes from the so called position bias - urls appearing in lower positions are less likely to be clicked even if they are relevant . In this paper , we propose a Dynamic Bayesian Network which aims at providing us with unbiased estimation of the relevance from the click logs . Experiments show that the proposed click model outperforms other existing click models in predicting both click-through rate and relevance .

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

dynamic bayesian network
learning
ranking
web search

click modeling
click-through rate
information search and retrieval
on-line information services


Serf and turf : crowdturfing for fun and profit Popular Internet services in recent years have shown that remarkable things can be achieved by harnessing the power of the masses using crowd-sourcing systems . However , crowd-sourcing systems can also pose a real challenge to existing security mechanisms deployed to protect Internet services . Many of these security techniques rely on the assumption that malicious activity is generated automatically by automated programs . Thus they would perform poorly or be easily bypassed when attacks are generated by real users working in a crowd-sourcing system . Through measurements , we have found surprising evidence showing that not only do malicious crowd-sourcing systems exist , but they are rapidly growing in both user base and total revenue . We describe in this paper a significant effort to study and understand these `` crowdturfing '' systems in today 's Internet . We use detailed crawls to extract data about the size and operational structure of these crowdturfing systems . We analyze details of campaigns offered and performed in these sites , and evaluate their end-to-end effectiveness by running active , benign campaigns of our own . Finally , we study and compare the source of workers on crowdturfing sites in different countries . Our results suggest that campaigns on these systems are highly effective at reaching users , and their continuing growth poses a concrete threat to online communities both in the US and elsewhere .

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


Yago : a core of semantic knowledge We present YAGO , a light-weight and extensible ontology with high coverage and quality . YAGO builds on entities and relations and currently contains more than 1 million entities and 5 million facts . This includes the Is-A hierarchy as well as non-taxonomic relations between entities ( such as HASONEPRIZE ) . The facts have been automatically extracted from Wikipedia and unified with WordNet , using a carefully designed combination of rule-based and heuristic methods described in this paper . The resulting knowledge base is a major step beyond WordNet : in quality by adding knowledge about individuals like persons , organizations , products , etc. with their semantic relationships - and in quantity by increasing the number of facts by more than an order of magnitude . Our empirical evaluation of fact correctness shows an accuracy of about 95 % . YAGO is based on a logically clean model , which is decidable , extensible , and compatible with RDFS . Finally , we show how YAGO can be further extended by state-of-the-art information extraction techniques .

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


Web data extraction based on partial tree alignment This paper studies the problem of extracting data from a Web page that contains several structured data records . The objective is to segment these data records , extract data items\/fields from them and put the data in a database table . This problem has been studied by several researchers . However , existing methods still have some serious limitations . The first class of methods is based on machine learning , which requires human labeling of many examples from each Web site that one is interested in extracting data from . The process is time consuming due to the large number of sites and pages on the Web . The second class of algorithms is based on automatic pattern discovery . These methods are either inaccurate or make many assumptions . This paper proposes a new method to perform the task automatically . It consists of two steps , ( 1 ) identifying individual data records in a page , and ( 2 ) aligning and extracting data items from the identified data records . For step 1 , we propose a method based on visual information to segment data records , which is more accurate than existing methods . For step 2 , we propose a novel partial alignment technique based on tree matching . Partial alignment means that we align only those data fields in a pair of data records that can be aligned ( or matched ) with certainty , and make no commitment on the rest of the data fields . This approach enables very accurate alignment of multiple data records . Experimental results using a large number of Web pages from diverse domains show that the proposed two-step technique is able to segment data records , align and extract data from them very accurately .

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

data record extraction
miscellaneous
wrapper


An intelligent distributed environment for active learning

multi-agent system
web-based education
xmeta
xml


XAR-miner : efficient association rules mining for XML data In this paper , we propose a framework , called XAR-Miner , for mining ARs from XML documents efficiently . In XAR-Miner , raw data in the XML document are first preprocessed to transform to either an Indexed Content Tree ( IX-tree ) or Multi-relational databases ( Multi-DB ) , depending on the size of XML document and memory constraint of the system , for efficient data selection and AR mining . Task-relevant concepts are generalized to produce generalized meta-patterns , based on which the large ARs that meet the support and confidence levels are generated .

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


Towards network-aware service composition in the cloud Service-Oriented Computing ( SOC ) enables the composition of loosely coupled services provided with varying Quality of Service ( QoS ) levels . Selecting a ( near - ) optimal set of services for a composition in terms of QoS is crucial when many functionally equivalent services are available . With the advent of Cloud Computing , both the number of such services and their distribution across the network are rising rapidly , increasing the impact of the network on the QoS of such compositions . Despite this , current approaches do not differentiate between the QoS of services themselves and the QoS of the network . Therefore , the computed latency differs substantially from the actual latency , resulting in suboptimal QoS for service compositions in the cloud . Thus , we propose a network-aware approach that handles the QoS of services and the QoS of the network independently . First , we build a network model in order to estimate the network latency between arbitrary services and potential users . Our selection algorithm then leverages this model to find compositions that will result in a low latency given an employed execution policy . In our evaluation , we show that our approach efficiently computes compositions with much lower latency than current approaches .

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


Semantic personalization of web portal contents Enriching Web applications with personalized data is of major interest for facilitating the user access to the published contents , and therefore , for guaranteeing successful user navigation . We propose a conceptual model for extracting personalized recommendations based on user profiling , ontological domain models , and semantic reasoning . The approach offers a high-level representation of the designed application based on a domain-specific metamodel for Web applications called WebML .

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

computer-aided software engineering
conceptual modeling
ontology
semantic web


Predicting popular messages in Twitter Social network services have become a viable source of information for users . In Twitter , information deemed important by the community propagates through retweets . Studying the characteristics of such popular messages is important for a number of tasks , such as breaking news detection , personalized message recommendation , viral marketing and others . This paper investigates the problem of predicting the popularity of messages as measured by the number of future retweets and sheds some light on what kinds of factors influence information propagation in Twitter . We formulate the task into a classification problem and study two of its variants by investigating a wide spectrum of features based on the content of the messages , temporal information , metadata of messages and users , as well as structural properties of the users ' social graph on a large scale dataset . We show that our method can successfully predict messages which will attract thousands of retweets with good performance .

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

information diffusion
information search and retrieval
microblogs
social media


Information search and re-access strategies of experienced web users Experienced web users have strategies for information search and re-access that are not directly supported by web browsers or search engines . We studied how prevalent these strategies are and whether even experienced users have problems with searching and re-accessing information . With this aim , we conducted a survey with 236 experienced web users . The results showed that this group has frequently used key strategies ( e.g. , using several browser windows in parallel ) that they find important , whereas some of the strategies that have been suggested in previous studies are clearly less important for them ( e.g. , including URLs on a webpage ) . In some aspects , such as query formulation , this group resembles less experienced web users . For instance , we found that most of the respondents had misconceptions about how their search engine handles queries , as well as other problems with information search and re-access . In addition to presenting the prevalence of the strategies and rationales for their use , we present concrete designs solutions and ideas for making the key strategies also available to less experienced users .

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

information re-access
questionnaire study
user interface management systems
web search


A content-driven reputation system for the wikipedia We present a content-driven reputation system for Wikipedia authors . In our system , authors gain reputation when the edits they perform to Wikipedia articles are preserved by subsequent authors , and they lose reputation when their edits are rolled back or undone in short order . Thus , author reputation is computed solely on the basis of content evolution ; user-to-user comments or ratings are not used . The author reputation we compute could be used to flag new contributions from low-reputation authors , or it could be used to allow only authors with high reputation to contribute to controversialor critical pages . A reputation system for the Wikipedia could also provide an incentive for high-quality contributions . We have implemented the proposed system , and we have used it to analyze the entire Italian and French Wikipedias , consisting of a total of 691 , 551 pages and 5 , 587 , 523 revisions . Our results show that our notion of reputation has good predictive value : changes performed by low-reputation authors have a significantly larger than average probability of having poor quality , as judged by human observers , and of being later undone , as measured by our algorithms .

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


Providing ranked relevant results for web database queries Often Web database users experience difficulty in articulating their needs using a precise query . Providing ranked set of possible answers would benefit such users . We propose to provide ranked answers to user queries by identifying a set of queries from the query log whose answers are relevant to the given user query . The relevance detection is done using a domain and end-user independent content similarity estimation technique .

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


On directly mapping relational databases to RDF and OWL Mapping relational databases to RDF is a fundamental problem for the development of the Semantic Web . We present a solution , inspired by draft methods defined by the W3C where relational databases are directly mapped to RDF and OWL . Given a relational database schema and its integrity constraints , this direct mapping produces an OWL ontology , which , provides the basis for generating RDF instances . The semantics of this mapping is defined using Datalog . Two fundamental properties are information preservation and query preservation . We prove that our mapping satisfies both conditions , even for relational databases that contain null values . We also consider two desirable properties : monotonicity and semantics preservation . We prove that our mapping is monotone and also prove that no monotone mapping , including ours , is semantic preserving . We realize that monotonicity is an obstacle for semantic preservation and thus present a non-monotone direct mapping that is semantics preserving .

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

direct mapping
owl
rdf
relational databases
semantic web


Online modeling of proactive moderation system for auction fraud detection We consider the problem of building online machine-learned models for detecting auction frauds in e-commence web sites . Since the emergence of the world wide web , online shopping and online auction have gained more and more popularity . While people are enjoying the benefits from online trading , criminals are also taking advantages to conduct fraudulent activities against honest parties to obtain illegal profit . Hence proactive fraud-detection moderation systems are commonly applied in practice to detect and prevent such illegal and fraud activities . Machine-learned models , especially those that are learned online , are able to catch frauds more efficiently and quickly than human-tuned rule-based systems . In this paper , we propose an online probit model framework which takes online feature selection , coefficient bounds from human knowledge and multiple instance learning into account simultaneously . By empirical experiments on a real-world online auction fraud detection data we show that this model can potentially detect more frauds and significantly reduce customer complaints compared to several baseline models and the human-tuned rule-based system .

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

learning
online auction
online feature selection
online modeling

fraudulence detection
multiple instance learning


Authoring and annotation of web pages in CREAM Richly interlinked , machine-understandable data constitute the basis for the Semantic Web . We provide a framework , CREAM , that allows for creation of metadata . While the annotation mode of CREAM allows to create metadata for existing web pages , the authoring mode lets authors create metadata -- almost for free -- while putting together the content of a page . As a particularity of our framework , CREAM allows to create relational metadata , i.e. metadata that instantiate interrelated definitions of classes in a domain ontology rather than a comparatively rigid template-like schema asm Dublin Core . We discuss some of the requirements one has to meet when developing such an ontology-based framework , e.g. the integration of a metadata crawler , inference services , document management and a meta-ontology , and describe its implementation , viz . Ont-O-Mat , a component-based , ontology-driven Web page authoring and annotation tool .

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

document and text editing
rdf
semanticweb


Highly scalable web applications with zero-copy data transfer The performance of server-side applications is becoming increasingly important as more applications exploit the Web application model . Extensive work has been done to improve the performance of individual software components such as Web servers and programming language runtimes . This paper describes a novel approach to boost Web application performance by improving inter-process communication between a programming language runtime and Web server runtime . The approach reduces redundant processing for memory copying and the context switch overhead between user space and kernel space by exploiting the zero-copy data transfer methodology , such as the sendfile system call . In order to transparently utilize this optimization feature with existing Web applications , we propose enhancements of the PHP runtime , FastCGI protocol , and Web server . Our proposed approach achieves a 126 % performance improvement with micro-benchmarks and a 44 % performance improvement for a standard Web benchmark , SPECweb2005 .

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


Clustering e-commerce search engines In this paper , we sketch a method for clustering e-commerce search engines by the type of products\/services they sell . This method utilizes the special features of interface pages of such search engines . We also provide an analysis of different types of ESE interface pages .

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

document clustering
search engine categorization


Analyzing web access control policies XACML has emerged as a popular access control language on the Web , but because of its rich expressiveness , it has proved difficult to analyze in an automated fashion . In this paper , we present a formalization of XACML using description logics ( DL ) , which are a decidable fragment of First-Order logic . This formalization allows us to cover a more expressive subset of XACML than propositional logic-based analysis tools , and in addition we provide a new analysis service ( policy redundancy ) . Also , mapping XACML to description logics allows us to use off-the-shelf DL reasoners for analysis tasks such as policy comparison , verification and querying . We provide empirical evaluation of a policy analysis tool that was implemented on top of open source DL reasoner Pellet .

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

access control
description logics
policy analysis
xacml


The classroom sentinel : supporting data-driven decision-making in the classroom Whereas schools typically record mounds of data regarding student performance , attendance , and other behaviors over the course of a school year , rarely is that data consulted and used to inform day-to-day instructional practice in the classroom . As teachers come under increasing pressure to ensure success for all of their students , we are attempting to provide tools to help teachers make sense of what is happening in their classrooms and take appropriate proactive and\/or remedial action . One such tool is a Web service we 've dubbed the Classroom Sentinel . The Classroom Sentinel mines electronic gradebook and other student information system data sources to detect critical teaching and learning patterns and bring those patterns to the attention of the teacher in the form of timely alerts . In this paper , we introduce the notion of classroom patterns , present some examples , and describe a framework for alert generation and delivery .

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

classroom pattern detection
computer-managed instruction
data integration
data-driven decision making
teacher cognition


Structured objects in owl : representation and reasoning Applications of semantic technologies often require the representation of and reasoning with structured objects - that is , objects composed of parts connected in complex ways . Although OWL is a general and powerful language , its class descriptions and axioms can not be used to describe arbitrarily connected structures . An OWL representation of structured objects can thus be underconstrained , which reduces the inferences that can be drawn and causes performance problems in reasoning . To address these problems , we extend OWL with description graphs , which allow for the description of structured objects in a simple and precise way . To represent conditional aspects of the domain , we also allow for SWRL-like rules over description graphs . Based on an observation about the nature of structured objects , we ensure decidability of our formalism . We also present a hypertableau-based decision procedure , which we implemented in the HermiT reasoner . To evaluate its performance , we have extracted description graphs from the GALEN and FMA ontologies , classified them successfully , and even detected a modeling error in GALEN .

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


The web of topics : discovering the topology of topic evolution in a corpus In this paper we study how to discover the evolution of topics over time in a time-stamped document collection . Our approach is uniquely designed to capture the rich topology of topic evolution inherent in the corpus . Instead of characterizing the evolving topics at fixed time points , we conceptually define a topic as a quantized unit of evolutionary change in content and discover topics with the time of their appearance in the corpus . Discovered topics are then connected to form a topic evolution graph using a measure derived from the underlying document network . Our approach allows inhomogeneous distribution of topics over time and does not impose any topological restriction in topic evolution graphs . We evaluate our algorithm on the ACM corpus . The topic evolution graphs obtained from the ACM corpus provide an effective and concrete summary of the corpus with remarkably rich topology that are congruent to our background knowledge . In a finer resolution , the graphs reveal concrete information about the corpus that were previously unknown to us , suggesting the utility of our approach as a navigational tool for the corpus .

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

citation network
general
information search and retrieval
language model


Visibly pushdown automata for streaming XML We propose the study of visibly pushdown automata ( VPA ) for processing XML documents . VPAs are pushdown automata where the input determines the stack operation , and XML documents are naturally visibly pushdown with the VPA pushing onto the stack on open-tags and popping the stack on close-tags . In this paper we demonstrate the power and ease visibly pushdown automata give in the design of streaming algorithms for XML documents . We study the problems of type-checking streaming XML documents against SDTD schemas , and the problem of typing tags in a streaming XML document according to an SDTD schema . For the latter problem , we consider both pre-order typing and post-order typing of a document , which dynamically determines types at open-tags and close-tags respectively as soon as they are met . We also generalize the problems of pre-order and post-order typing to prefix querying . We show that a deterministic VPA yields an algorithm to the problem of answering in one pass the set of all answers to any query that has the property that a node satisfying the query is determined solely by the prefix leading to the node . All the streaming algorithms we develop in this paper are based on the construction of deterministic VPAs , and hence , for any fixed problem , the algorithms process each element of the input in constant time , and use space ( d ) , where d is the depth of the document .

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

pushdown automata
query
schema
streaming algorithms
typing
xml


Low-infrastructure methods to improve internet access for mobile users in emerging regions As information technology supports more aspects of modern life , digital access has become an important tool for developing regions to lift themselves from poverty . Though broadband internet connectivity will not be universally available in the short-term , widely-employed mobile devices coupled with novel delay-tolerant networking do allow limited forms of connectivity . This paper explores the design space for internet access systems operating with constrained connectivity . Our starting point is C-LINK , a collaborative caching system that enhances the performance of interactive web access over DTN and cellular connectivity . We discuss our experiences and results from deploying C-LINK in Nicaragua , before moving on to a broader design study of other issues that further influence operation . We consider the impact of ( i ) storing web content collaboratively cached across all user nodes , ( ii ) hybrid transport layers exploiting the best attributes of limited cellular and DTN-style connectivity . We also explore the behavior of future systems under a range of usage and mobility scenarios . Even under adverse conditions , our techniques can improve average service latency for page requests by a factor of 2X . Our results point to the considerable power of leveraging user mobility and collaboration in providing very-low-infrastructure internet access to developing regions .

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

delay tolerant networking
network architecture and design
simulation
systems and software


The volume and evolution of web page templates Web pages contain a combination of unique content and template material , which is present across multiple pages and used primarily for formatting , navigation , and branding . We study the nature , evolution , and prevalence of these templates on the web . As part of this work , we develop new randomized algorithms for template extraction that perform approximately twenty times faster than existing approaches with similar quality . Our results show that 40 -- 50 % of the content on the web is template content . Over the last eight years , the fraction of template content has doubled , and the growth shows no sign of abating . Text , links , and total HTML bytes within templates are all growing as a fraction of total content at a rate of between 6 and 8 % per year . We discuss the deleterious implications of this growth for information retrieval and ranking , classification , and link analysis .

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

boilerplate
data cleaning
data mining
information search and retrieval
web mining


Understanding the function of web elements for mobile content delivery using random walk models In this paper , we describe a method for understanding the function of web elements . It classifies web elements into five functional categories : Content ( C ) , Related Links ( R ) , Navigation and Support ( N ) , Advertisement ( A ) and Form ( F ) . We construct five graphs for a web page , and each graph is designed such that most of the probability mass of the stationary distribution is concentrated in nodes belong to its corresponding category . We perform random walks on these graphs until convergence and classify based on its rank value in different graphs . Our experiment shows that the new method performed very well comparing to basic machine learning methods .

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

classification
graphical user interfaces
html
www


Video summarization via transferrable structured learning It is well-known that textual information such as video transcripts and video reviews can significantly enhance the performance of video summarization algorithms . Unfortunately , many videos on the Web such as those from the popular video sharing site YouTube do not have useful textual information . The goal of this paper is to propose a transfer learning framework for video summarization : in the training process both the video features and textual features are exploited to train a summarization algorithm while for summarizing a new video only its video features are utilized . The basic idea is to explore the transferability between videos and their corresponding textual information . Based on the assumption that video features and textual features are highly correlated with each other , we can transfer textual information into knowledge on summarization using video information only . In particular , we formulate the video summarization problem as that of learning a mapping from a set of shots of a video to a subset of the shots using the general framework of SVM-based structured learning . Textual information is transferred by encoding them into a set of constraints used in the structured learning process which tend to provide a more detailed and accurate characterization of the different subsets of shots . Experimental results show significant performance improvement of our approach and demonstrate the utility of textual information for enhancing video summarization .

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


Unsupervised extraction of template structure in web search queries Web search queries are an encoding of the user 's search intent and extracting structured information from them can facilitate central search engine operations like improving the ranking of search results and advertisements . Not surprisingly , this area has attracted a lot of attention in the research community in the last few years . The problem is , however , made challenging by the fact that search queries tend to be extremely succinct ; a condensation of user search needs to the bare-minimum set of keywords . In this paper we consider the problem of extracting , with no manual intervention , the hidden structure behind the observed search queries in a domain : the origins of the constituent keywords as well as the manner the individual keywords are assembled together . We formalize important properties of the problem and then give a principled solution based on generative models that satisfies these properties . Using manually labeled data we show that the query templates extracted by our solution are superior to those discovered by strong baseline methods . The query templates extracted by our approach have potential uses in many search engine tasks ; query answering , advertisement matching and targeting , to name a few . In this paper we study one such task , estimating Query-Advertisability , and empirically demonstrate that using extracted template information can improve performance over and above the current state-of-the-art .

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


A larger scale study of robots . txt A website can regulate search engine crawler access to its content using the robots exclusion protocol , specified in its robots . txt file . The rules in the protocol enable the site to allow or disallow part or all of its content to certain crawlers , resulting in a favorable or unfavorable bias towards some of them . A 2007 survey on the robots . txt usage of about 7,593 sites found some evidence of such biases , the news of which led to widespread discussions on the web . In this paper , we report on our survey of about 6 million sites . Our survey tries to correct the shortcomings of the previous survey and shows the lack of any significant preferences towards any particular search engine .

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


Detection and analysis of drive-by-download attacks and malicious JavaScript code JavaScript is a browser scripting language that allows developers to create sophisticated client-side interfaces for web applications . However , JavaScript code is also used to carry out attacks against the user 's browser and its extensions . These attacks usually result in the download of additional malware that takes complete control of the victim 's platform , and are , therefore , called `` drive-by downloads . '' Unfortunately , the dynamic nature of the JavaScript language and its tight integration with the browser make it difficult to detect and block malicious JavaScript code . This paper presents a novel approach to the detection and analysis of malicious JavaScript code . Our approach combines anomaly detection with emulation to automatically identify malicious JavaScript code and to support its analysis . We developed a system that uses a number of features and machine-learning techniques to establish the characteristics of normal JavaScript code . Then , during detection , the system is able to identify anomalous JavaScript code by emulating its behavior and comparing it to the established profiles . In addition to identifying malicious code , the system is able to support the analysis of obfuscated code and to generate detection signatures for signature-based systems . The system has been made publicly available and has been used by thousands of analysts .

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

drive-by-download attacks
security and protection
web client exploits


Smartback : supporting users in back navigation This paper presents the design and user evaluation of SmartBack , a feature that complements the standard Back button by enabling users to jump directly to key pages in their navigation session , making common navigation activities more efficient . Defining key pages was informed by the findings of a user study that involved detailed monitoring of Web usage and analysis of Web browsing in terms of navigation trails . The pages accessible through SmartBack are determined automatically based on the structure of the user 's navigation trails or page association with specific user 's activities , such as search or browsing bookmarked sites . We discuss implementation decisions and present results of a usability study in which we deployed the SmartBack prototype and monitored usage for a month in both corporate and home settings . The results show that the feature brings qualitative improvement to the browsing experience of individuals who use it .

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

back navigation
browsing
usability study
web usage


Ranking a stream of news According to a recent survey made by Nielsen NetRatings , searching on news articles is one of the most important activity online . Indeed , Google , Yahoo , MSN and many others have proposed commercial search engines for indexing news feeds . Despite this commercial interest , no academic research has focused on ranking a stream of news articles and a set of news sources . In this paper , we introduce this problem by proposing a ranking framework which models : ( 1 ) the process of generation of a stream of news articles , ( 2 ) the news articles clustering by topics , and ( 3 ) the evolution of news story over the time . The ranking algorithm proposed ranks news information , finding the most authoritative news sources and identifying the most interesting events in the different categories to which news article belongs . All these ranking measures take in account the time and can be obtained without a predefined sliding window of observation over the stream . The complexity of our algorithm is linear in the number of pieces of news still under consideration at the time of a new posting . This allow a continuous on-line process of ranking . Our ranking framework is validated on a collection of more than 300,000 pieces of news , produced in two months by more then 2000 news sources belonging to 13 different categories ( World , U. S , Europe , Sports , Business , etc ) . This collection is extracted from the index of comeToMyHead , an academic news search engine available online .

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

information extraction
news engines
news ranking


Navigationaided retrieval Users searching for information in hypermedia environments often perform querying followed by manual navigation . Yet , the conventional text\/hypertext retrieval paradigm does not explicity take post-query navigation into account . This paper proposes a new retrieval paradigm , called navigation-aided retrieval ( NAR ) , which treats both querying and navigation as first-class activities . In the NAR paradigm , querying is seen as a means to identify starting points for navigation , and navigation is guided based on information supplied in the query . NAR is a generalization of the conventional probabilistic information retrieval paradigm , which implicitly assumes no navigation takes place . This paper presents a formal model for navigation-aided retrieval , and reports empirical results that point to the real-world applicability of the model . The experiments were performed over a large Web corpus provided by TREC , using human judgments on a new rating scale developed for navigation-aided retrieval . In the case of ambiguous queries , the new retrieval model identifies good starting points for post-query navigation . For less ambiguous queries that need not be paired with navigation , the output closely matches that of a conventional retrieval system .

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

browsing
information search and retrieval
link analysis
underspecified search tasks
web search


Graph-based text database for knowledge discovery While we expect to discover knowledge in the texts available on the Web , such discovery usually requires many complex analysis steps , most of which require different text handling operations such as similar text search or text clustering . Drawing an analogy from the relational data model , we propose a text representation model that simplifies the steps . The model represents texts in a formal manner , Subject Graphs , described herein , provides text handling operations whose inputs and outputs are identical in form , i.e. a set of subject graphs . We develop a graph-based text database , which is based on the model , and an interactive knowledge discovery system . Trials of the system show that it allows the user to interactively and intuitively discover knowledge in Web pages by combining text handling operations defined on subject graphs in various orders .

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


Targeted disambiguation of ad-hoc , homogeneous sets of named entities In many entity extraction applications , the entities to be recognized are constrained to be from a list of `` target entities '' . In many cases , these target entities are ( i ) ad-hoc , i.e. , do not exist in a knowledge base and ( ii ) homogeneous ( e.g. , all the entities are IT companies ) . We study the following novel disambiguation problem in this unique setting : given the candidate mentions of all the target entities , determine which ones are true mentions of a target entity . Prior techniques only consider target entities present in a knowledge base and\/or having a rich set of attributes . In this paper , we develop novel techniques that require no knowledge about the entities except their names . Our main insight is to leverage the homogeneity constraint and disambiguate the candidate mentions collectively across all documents . We propose a graph-based model , called MentionRank , for that purpose . Furthermore , if additional knowledge is available for some or all of the entities , our model can leverage it to further improve quality . Our experiments demonstrate the effectiveness of our model . To the best of our knowledge , this is the first work on targeted entity disambiguation for ad-hoc entities .

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

entity extraction
mentionrank
targeted disambiguation

ad-hoc entity identification
information search and retrieval
named entity disambiguation


Sailer : an effective search engine for unified retrieval of heterogeneous xml and web documents This paper studies the problem of unified ranked retrieval of heterogeneous XML documents and Web data . We propose an effective search engine called Sailer to adaptively and versatilely answer keyword queries over the heterogenous data . We model the Web pages and XML documents as graphs . We propose the concept of pivotal trees to effectively answer keyword queries and present an effective method to identify the top-k pivotal trees with the highest ranks from the graphs . Moreover , we propose effective indexes to facilitate the effective unified ranked retrieval . We have conducted an extensive experimental study using real datasets , and the experimental results show that Sailer achieves both high search efficiency and accuracy , and outperforms the existing approaches significantly .

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

database applications
keyword search
unified keyword search


A user-tunable approach to marketplace search The notion of relevance is key to the performance of search engines as they interpret the user queries and respond with matching results . Online search engines have used other features beyond pure IR features to return relevant matching documents . However , over-emphasis on relevance could lead to redundancy in search results . In document search , diversity is simply the variety of documents that span the result set . In an online marketplace the diversity in the result set is represented by items for sale by different sellers at different prices with different sales options . For such a marketplace , in order to minimize query abandonment and the risk of dissatisfaction to the average user , several factors like diversity , trust and value need to be taken into account . Previous work in this field ( 4 ) has shown an impossibility result that there exists no such function that can optimize for all these factors . Since these factors and the measures associated with the factors could be subjective we take an approach of giving the control back to the user . In this paper we describe an interface which enables users to have more control over the optimization function used to present the results . We demonstrate this for search on eBay - one of the largest online marketplaces with a vibrant user community and dynamic inventory . We use an algorithm based on bounded greedy selection ( 5 ) to construct the result set based on parameters specified by the user .

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


Spam attacks : p2p to the rescue We propose a decentralized privacy-preserving approach to spam filtering . Our solution exploits robust digests to identify messages that are a slight variation of one another and a peer-to-peer architecture between mail servers to collaboratively share knowledge about spam .

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

distributed systems
reputation
security and protection
structured p2p


Web data integration using approximate string join Web data integration is an important preprocessing step for web mining . It is highly likely that several records on the web whose textual representations differ may represent the same real world entity . These records are called approximate duplicates . Data integration seeks to identify such approximate duplicates and merge them into integrated records . Many existing data integration algorithms make use of approximate string join , which seeks to ( approximately ) find all pairs of strings whose distances are less than a certain threshold . In this paper , we propose a new mapping method to detect pairs of strings with similarity above a certain threshold . In our method , each string is first mapped to a point in a high dimensional grid space , then pairs of points whose distances are 1 are identified . We implement it using Oracle SQL and PL\/SQL . Finally , we evaluate this method using real data sets . Experimental results suggest that our method is both accurate and efficient .

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

approximate string join
data integration


Event synchronization for interactive cyberdrama generation on the web : a distributed approach The digital generation of a story in which users have influence over the narrative is emerging as an exciting example of computer-based interactive entertainment . Interactive storytelling has existed in non digital versions for thousand of years , but with the advent of the Web the demand for enabling distributed cyberdrama generation is becoming increasingly common . To govern the complexity stemming from the distributed generation of complex plots , we have devised an event synchronization service that may be exploited to support the distribution of interactive storytelling activities over the Web . The main novelty of our approach is that the semantics of the cyberdrama is exploited to discard obsolete events . This brings to the positive result of speeding up the activity of drama generation , thus enabling an augmented interactivity among dispersed players .

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

cyberdrama generation
interactive storytelling

computer-based entertainment
web-based multiplayer games


Schemapath , a minimal extension to xml schema for conditional constraints In the past few years , a number of constraint languages for XML documents has been proposed . They are cumulatively called schema languages or validation languages and they comprise , among others , DTD , XML Schema , RELAX NG , Schematron , DSD , xlinkit . One major point of discrimination among schema languages is the support of co-constraints , or co-occurrence constraints , e.g. , requiring that attribute A is present if and only if attribute B is ( or is not ) presentin the same element . Although there is no way in XML Schema to express these requirements , they are in fact frequently used in many XML document types , usually only expressed in plain human-readable text , and validated by means of special code modules by the relevant applications . In this paper we propose SchemaPath , a light extension of XML Schema to handle conditional constraints on XML documents . Two new constructs have been added to XML Schema : conditions -- based on XPath patterns -- on type assignments for elements and attributes ; and a new simple type , xsd : error , for the direct expression of negative constraints ( e.g. it is prohibited for attribute A to be present if attribute B is also present ) . A proof-of-concept implementation is provided . A Web interface is publicly accessible for experiments and assessments of the real expressiveness of the proposed extension .

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


Who says what to whom on twitter We study several longstanding questions in media communications research , in the context of the microblogging service Twitter , regarding the production , flow , and consumption of information . To do so , we exploit a recently introduced feature of Twitter known as `` lists '' to distinguish between elite users - by which we mean celebrities , bloggers , and representatives of media outlets and other formal organizations - and ordinary users . Based on this classification , we find a striking concentration of attention on Twitter , in that roughly 50 % of URLs consumed are generated by just 20K elite users , where the media produces the most information , but celebrities are the most followed . We also find significant homophily within categories : celebrities listen to celebrities , while bloggers listen to bloggers etc ; however , bloggers in general rebroadcast more information than the other categories . Next we re-examine the classical `` two-step flow '' theory of communications , finding considerable support for it on Twitter . Third , we find that URLs broadcast by different categories of users or containing different types of content exhibit systematically different lifespans . And finally , we examine the attention paid by the different user categories to different news topics .

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

communication networks
information flow
two-step flow
user/machine systems


Supporting management reporting : a writable web case study The World-Wide Web was originally developed as a shared , writable , hypertext medium , a facility that is still widely needed . We have recently developed a Web-based management reporting system for a legal firm in an attempt to improve the efficiency and management of their overall business process . This paper shares our experiences in relating the firm 's specific writing and issue tracking tasks to existing Web , open hypermedia , and Semantic Web research , and describes why we chose to develop a new solution -- a set of open hypermedia components collectively called the Management Reporting System -- rather than employ an existing system .

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

document preparation
electronic publishing
hypertext writing
hypertext/hypermedia
structural computing


Web log mining with adaptive support thresholds With the fast increase in Web activities , Web data mining has recently become an important research topic . However , most previous studies of mining path traversal patterns are based on the model of a uniform support threshold without taking into consideration such important factors as the length of a pattern , the positions of Web pages , and the importance of a particular pattern , etc. . In view of this , we study and apply the Markov chain model to provide the determination of support threshold of Web documents . Furthermore , by properly employing some techniques devised for joining reference sequences , a new mining procedure of Web traversal patterns is proposed in this paper .

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

markov model
path traversal pattern
web mining


Impact of search engines on page popularity Recent studies show that a majority of Web page accesses are referred by search engines . In this paper we study the widespread use of Web search engines and its impact on the ecology of the Web . In particular , we study how much impact search engines have on the popularity evolution of Web pages . For example , given that search engines return currently popular '' pages at the top of search results , are we somehow penalizing newly created pages that are not very well known yet ? Are popular pages getting even more popular and new pages completely ignored ? We first show that this unfortunate trend indeed exists on the Web through an experimental study based on real Web data . We then analytically estimate how much longer it takes for a new page to attract a large number of Web users when search engines return only popular pages at the top of search results . Our result shows that search engines can have an immensely worrisome impact on the discovery of new Web pages .

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

change in pagerank
information search and retrieval
miscellaneous
pagerank
random surfer model
search engine's impact
web evolution


On revenue in the generalized second price auction The Generalized Second Price ( GSP ) auction is the primary auction used for selling sponsored search advertisements . In this paper we consider the revenue of this auction at equilibrium . We prove that if agent values are drawn from identical regular distributions , then the GSP auction paired with an appropriate reserve price generates a constant fraction ( 1\/6th ) of the optimal revenue . In the full-information game , we show that at any Nash equilibrium of the GSP auction obtains at least half of the revenue of the VCG mechanism excluding the payment of a single participant . This bound holds also with any reserve price , and is tight . Finally , we consider the tradeoff between maximizing revenue and social welfare . We introduce a natural convexity assumption on the click-through rates and show that it implies that the revenue-maximizing equilibrium of GSP in the full information model will necessarily be envy-free . In particular , it is always possible to maximize revenue and social welfare simultaneously when click-through rates are convex . Without this convexity assumption , however , we demonstrate that revenue may be maximized at a non-envy-free equilibrium that generates a socially inefficient allocation .

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

nonnumerical algorithms and problems
sponsored search auctions


Personalized recommendation on dynamic content using predictive bilinear models In Web-based services of dynamic content ( such as news articles ) , recommender systems face the difficulty of timely identifying new items of high-quality and providing recommendations for new users . We propose a feature-based machine learning approach to personalized recommendation that is capable of handling the cold-start issue effectively . We maintain profiles of content of interest , in which temporal characteristics of the content , e.g. popularity and freshness , are updated in real-time manner . We also maintain profiles of users including demographic information and a summary of user activities within Yahoo ! properties . Based on all features in user and content profiles , we develop predictive bilinear regression models to provide accurate personalized recommendations of new items for both existing and new users . This approach results in an offline model with light computational overhead compared with other recommender systems that require online re-training . The proposed framework is general and flexible for other personalized tasks . The superior performance of our approach is verified on a large-scale data set collected from the Today-Module on Yahoo ! Front Page , with comparison against six competitive approaches .

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

bilinear models
general
recommender systems
regression

dynamic features
personalization
ranking
user and content profile


Explorations in the use of semantic web technologies for product information management Master data refers to core business entities a company uses repeatedly across many business processes and systems ( such as lists or hierarchies of customers , suppliers , accounts , products , or organizational units ) . Product information is the most important kind of master data and product information management ( PIM ) is becoming critical for modern enterprises because it provides a rich business context for various applications . Existing PIM systems are less flexible and scalable for on-demand business , as well as too weak to completely capture and use the semantics of master data . This paper explores how to use semantic web technologies to enhance a collaborative PIM system by simplifying modeling and representation while preserving enough dynamic flexibility . Furthermore , we build a semantic PIM system using one of the state-of-art ontology repositories and summarize the challenges we encountered based on our experimental results , especially on performance and scalability . We believe that our study and experiences are valuable for both semantic web community and master data management community .

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

master data management
modeling
ontology
product information management
semantic web


The freshman handbook : a hint for the server placement of social networks There has been a recent unprecedented increase in the use of Online Social Networks ( OSNs ) to expand our social life , exchange information and share common interests . Many popular OSNs today attract hundreds of millions of users who share tremendous amount of data on it such as Facebook , Twitter , and Buzz . Given the huge business opportunities OSNs may bring , more and more new social applications has emerged on the Internet . For these newcomers in the social network business , one of the first key decisions to make is to where to deploy the computational resources to best accommodate future client requests . In this work , we aim at providing useful suggests to the new born social network providers ( freshman ) on the intelligent server placement , by exploring available public information from existing social network communities . In this work , we first propose three scalable server placement strategies for OSNs . Our solution can scalably select server locations among all the possible locations , at the same time reducing the cost for inter-user data sharing .

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


Mirror site maintenance based on evolution associations of web directories Mirroring Web sites is a well-known technique commonly used in the Web community . A mirror site should be updated frequently to ensure that it reflects the content of the original site . Existing mirroring tools apply page-level strategies to check each page of a site , which is inefficient and expensive . In this paper , we propose a novel site-level mirror maintenance strategy . Our approach studies the evolution of Web directorystructures and mines association rules between ancestor-descendant Web directories . Discovered rules indicate the evolution correlations between Web directories . Thus , when maintaining the mirror of a Web site ( directory ) , we can optimally skipsubdirectories which are negatively correlated with it in undergoing significant changes . The preliminary experimental results show that our approach improves the efficiency of the mirror maintenance process significantly while sacrificing slightly in keeping the `` freshness '' of the mirrors .

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


Visual web mining Analysis of web site usage data involves two significant challenges : firstly the volume of data , arising from the growth of the web , and secondly , the structural complexity of web sites . In this paper we apply Data Mining and Information Visualization techniques to the web domain in order to benefit from the power of both human visual perception and computing we term this Visual Web Mining . In response to the two challenges , we propose a generic framework , where we apply Data Mining techniques to large web data sets and use Information Visualization methods on the results . The goal is to correlate the outcomes of mining Web Usage Logs and the extracted Web Structure by visually superimposing the results . We design several new information visualization diagrams .

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

frequent access patterns
systems and software
visual data exploration
web usage mining


Simple authentication for the web Automated email-based password reestablishment ( EBPR ) is an efficient , cost-effective means to deal with forgotten passwords . In this technique , email providers authenticate users on behalf of web sites . This method works because web sites trust email providers to deliver messages to their intended recipients . Simple Authentication for the Web ( SAW ) improves upon this basic approach to user authentication to create an alternative to password-based logins . SAW : 1 ) Removes the setup and management costs of passwords at sites that accept the risks of EBPR ; 2 ) Provides single sign-on without a specialized identity provider ; 3 ) Thwarts all passive attacks .

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


Semantic virtual environments Today 's Virtual Environment ( VE ) systems share a number of issues with the HTML-based World Wide Web . Their content is usually designed for presentation to humans , and thus is not suitable for machine access . This is complicated by the large number of different data models and network protocols in use . Accordingly , it is difficult to develop VE software , such as agents , services , and tools . In this paper we adopt the Semantic Web idea to the field of virtual environments . Using the Resource Description Framework ( RDF ) we establish a machine-understandable abstraction of existing VE systems -- the Semantic Virtual Environments ( SVE ) . On this basis it is possible to develop system-independent software , which could even operate across VE system boundaries .

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

framework
semantic web
virtual environments

knowledge representation formalisms and methods


Focused crawling by exploiting anchor text using decision tree Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines . To design a focused crawler , the choice of strategy for prioritizing unvisited URLs is crucial . In this paper , we propose a method using a decision tree on anchor texts of hyperlinks . We conducted experiments on the real data sets of four Japanese universities and verified our approach .

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


Periodic transfers in mobile applications : network-wide origin , impact , and optimization Cellular networks employ a specific radio resource management policy distinguishing them from wired and Wi-Fi networks . A lack of awareness of this important mechanism potentially leads to resource-inefficient mobile applications . We perform the first network-wide , large-scale investigation of a particular type of application traffic pattern called periodic transfers where a handset periodically exchanges some data with a remote server every t seconds . Using packet traces containing 1.5 billion packets collected from a commercial cellular carrier , we found that periodic transfers are very prevalent in today 's smartphone traffic . However , they are extremely resource-inefficient for both the network and end-user devices even though they predominantly generate very little traffic . This somewhat counter-intuitive behavior is a direct consequence of the adverse interaction between such periodic transfer patterns and the cellular network radio resource management policy . For example , for popular smartphone applications such as Facebook , periodic transfers account for only 1.7 % of the overall traffic volume but contribute to 30 % of the total handset radio energy consumption . We found periodic transfers are generated for various reasons such as keep-alive , polling , and user behavior measurements . We further investigate the potential of various traffic shaping and resource control algorithms . Depending on their traffic patterns , applications exhibit disparate responses to optimization strategies . Jointly using several strategies with moderate aggressiveness can eliminate almost all energy impact of periodic transfers for popular applications such as Facebook and Pandora .

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

periodic transfers
smartphone applications

3g networks
periodicity detection
radio resource optimization
rrc state machine


Automated construction of web accessibility models from transaction click-streams Screen readers , the dominant assistive technology used by visually impaired people to access the Web , function by speaking out the content of the screen serially . Using screen readers for conducting online transactions can cause considerable information overload , because transactions , such as shopping and paying bills , typically involve a number of steps spanning several web pages . One can combat this overload by using a transaction model for web accessibility that presents only fragments of web pages that are needed for doing transactions . We can realize such a model by coupling a process automaton , encoding states of a transaction , with concept classifiers that identify page fragments `` relevant '' to a particular state of the transaction . In this paper we present a fully automated process that synergistically combines several techniques for transforming unlabeled click-stream data generated by transactions into a transactionmodel . These techniques include web content analysis to partition a web page into segments consisting of semantically related content , contextual analysis of data surrounding clickable objects in a page , and machine learning methods , such as clustering of page segments based on contextual analysis , statistical classification , and automata learning . The use of unlabeled click streams in building transaction models has important benefits : ( i ) visually impaired users do not have to depend on sighted users for creating manually labeled training data to construct the models ; ( ii ) it is possible to mine personalized models from unlabeled transaction click-streams associated with sites that visually impaired users visit regularly ; ( iii ) since unlabeled data is relatively easy to obtain , it is feasible to scale up the construction of domain-specific transaction models ( e.g. , separate models for shopping , airline reservations , bill payments , etc. ) ; ( iv ) adjusting the performance of deployed models over timtime with new training data is also doable . We provide preliminary experimental evidence of the practical effectiveness of both domain-specific , as well as personalized accessibility transaction models built using our approach . Finally , this approach is applicable for building transaction models for mobile devices with limited-size displays , as well as for creating wrappers for information extraction from web sites .

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

context
process models
user interface management systems
web transaction


D2RQ\/update : updating relational data via virtual RDF D2RQ is a popular RDB-to-RDF mapping platform that supports mapping relational databases to RDF and posing SPARQL queries to these relational databases . However , D2RQ merely provides a read-only RDF view on relational databases . Thus , we introduce D2RQ\/Update -- an extension of D2RQ to enable executing SPARQL\/Update statements on the mapped data , and to facilitate the creation of a read-write Semantic Web .

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

linked data
rdb-to-rdf mapping
relational database
sparql/update


Search engines and their public interfaces : which apis are the most synchronized ? Researchers of commercial search engines often collect datausing the application programming interface ( API ) or by `` scraping '' results from the web user interface ( WUI ) , butanecdotal evidence suggests the interfaces produce differentresults . We provide the first in-depth quantitative analysisof the results produced by the Google , MSN and Yahoo APIand WUI interfaces . After submitting a variety of queriesto the interfaces for 5 months , we found significant discrepanciesin several categories . Our findings suggest that theAPI indexes are not older , but they are probably smaller for Google and Yahoo . Researchers may use our findings tobetter understand the differences between the interfaces andchoose the best API for their particular types of queries .

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


RankCompete : simultaneous ranking and clustering of web photos With the explosive growth of digital cameras and online media , it has become crucial to design efficient methods that help users browse and search large image collections . The recent VisualRank algorithm ( 4 ) employs visual similarity to represent the link structure in a graph so that the classic PageRank algorithm can be applied to select the most relevant images . However , measuring visual similarity is difficult when there exist diversified semantics in the image collection , and the results from VisualRank can not supply good visual summarization with diversity . This paper proposes to rank the images in a structural fashion , which aims to discover the diverse structure embedded in photo collections , and rank the images according to their similarity among local neighborhoods instead of across the entire photo collection . We design a novel algorithm named RankCompete , which generalizes the PageRank algorithm for the task of simultaneous ranking and clustering . The experimental results show that RankCompete outperforms VisualRank and provides an efficient but effective tool for organizing web photos .

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

image ranking
image summarization
information search and retrieval