Search result re-ranking based on gap between search queries and social tags Both search engine click-through log and social annotation have been utilized as user feedback for search result re-ranking . However , to our best knowledge , no previous study has explored the correlation between these two factors for the task of search result ranking . In this paper , we show that the gap between search queries and social tags of the same Web page can well reflect its user preference score . Motivated by this observation , we propose a novel algorithm , called Query-Tag-Gap ( QTG ) , to re-rank search results for better user satisfaction . Intuitively , on one hand , the search users ' intentions are generally described by their queries before they read the search results . On the other hand , the Web annotators semantically tag Web pages after they read the content of the pages . The difference between users ' recognition of the same page before and after they read it is a good reflection of user satisfaction . In this extended abstract , we formally define the query set and tag set of the same page as users ' pre - and post - knowledge respectively . We empirically show the strong correlation between user satisfaction and user 's knowledge gap before and after reading the page . Based on this gap , experiments have shown outstanding performance of our proposed QTG algorithm in search result re-ranking .

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

information search and retrieval
query log
social tagging


A service creation environment based on end to end composition of Web services The demand for quickly delivering new applications is increasingly becoming a business imperative today . Application development is often done in an ad hoc manner , without standard frameworks or libraries , thus resulting in poor reuse of software assets . Web services have received much interest in industry due to their potential in facilitating seamless business-to-business or enterprise application integration . A web services composition tool can help automate the process , from creating business process functionality , to developing executable workflows , to deploying them on an execution environment . However , we find that the main approaches taken thus far to standardize and compose web services are piecemeal and insufficient . The business world has adopted a ( distributed ) programming approach in which web service instances are described using WSDL , composed into flows with a language like BPEL and invoked with the SOAP protocol . Academia has propounded the AI approach of formally representing web service capabilities in ontologies , and reasoning about their composition using goal-oriented inferencing techniques from planning . We present the first integrated work in composing web services end to end from specification to deployment by synergistically combining the strengths of the above approaches . We describe a prototype service creation environment along with a use-case scenario , and demonstrate how it can significantly speed up the time-to-market for new services .

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


Web service interfaces We present a language for specifying web service interfaces . A web service interface puts three kinds of constraints on the users of the service . First , the interface specifies the methods that can be called by a client , together with types of input and output parameters ; these are called signature constraints . Second , the interface may specify propositional constraints on method calls and output values that may occur in a web service conversation ; these are called consistency constraints . Third , the interface may specify temporal constraints on the ordering of method calls ; these are called protocol constraints . The interfaces can be used to check , first , if two or more web services are compatible , and second , if a web service A can be safely substituted for a web service B. The algorithm for compatibility checking verifies that two or more interfaces fulfill each others ' constraints . The algorithm for substitutivity checking verifies that service A demands fewer and fulfills more constraints than service B.

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

formal specification
formal verification
web service compatibility
web service substitutivity


Collective privacy management in social networks Social Networking is one of the major technological phenomena of the Web 2.0 , with hundreds of millions of people participating . Social networks enable a form of self expression for users , and help them to socialize and share content with other users . In spite of the fact that content sharing represents one of the prominent features of existing Social Network sites , Social Networks yet do not support any mechanism for collaborative management of privacy settings for shared content . In this paper , we model the problem of collaborative enforcement of privacy policies on shared data by using game theory . In particular , we propose a solution that offers automated ways to share images based on an extended notion of content ownership . Building upon the Clarke-Tax mechanism , we describe a simple mechanism that promotes truthfulness , and that rewards users who promote co-ownership . We integrate our design with inference techniques that free the users from the burden of manually selecting privacy preferences for each picture . To the best of our knowledge this is the first time such a protection mechanism for Social Networking has been proposed . In the paper , we also show a proof-of-concept application , which we implemented in the context of Facebook , one of today 's most popular social networks . We show that supporting these type of solutions is not also feasible , but can be implemented through a minimal increase in overhead to end-users .

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


Mining the peanut gallery : opinion extraction and semantic classification of product reviews The web contains a wealth of product reviews , but sifting through them is a daunting task . Ideally , an opinion mining tool would process a set of search results for a given item , generating a list of product attributes ( quality , features , etc. ) and aggregating opinions about each of them ( poor , mixed , good ) . We begin by identifying the unique properties of this problem and develop a method for automatically distinguishing between positive and negative reviews . Our classifier draws on information retrieval techniques for feature extraction and scoring , and the results for various metrics and heuristics vary depending on the testing situation . The best methods work as well as or better than traditional machine learning . When operating on individual sentences collected from web searches , performance is limited due to noise and ambiguity . But in the context of a complete web-based tool and aided by a simple method for grouping sentences into attributes , the results are qualitatively quite useful .

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


Towards robust trust establishment in web-based social networks with socialtrust We propose the SocialTrust framework for tamper-resilient trust establishment in online social networks . Two of the salient features of SocialTrust are its dynamic revision of trust by ( i ) distinguishing relationship quality from trust ; and ( ii ) incorporating a personalized feedback mechanism for adapting as the social network evolves .

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


Online curriculum on the semantic Web : the CSD-UoC portal for peer-to-peer e-learning Online Curriculum Portals aim to support networks of instructors and learners by providing a space of convergence for enhancing peer-to-peer learning interactions among individuals of an educational institution . To this end , effective , open and scalable e-learning systems are required to acquire , store , and share knowledge under the form of learning objects ( LO ) . In this paper , we are interested in exploiting the semantic relationships that characterize these LOs ( e.g. , prerequisite , part-of or see-also ) in order to capture and access individual and group knowledge in conjunction with the learning processes supported by educational institutions . To achieve this functionality , Semantic Web ( e.g. , RDF\/s ) and declarative query languages ( e.g. , RQL ) are employed to represent LOs and their relationships ( e.g. , LOM ) , as well as , to support navigation at the conceptual e-learning Portal space . In this way , different LOs could be presented to the same learners , according to the traversed schema navigation paths ( i.e. , learning paths ) . Using the Apache Jetspeed framework we are able to generate and assemble at run-time portlets ( i.e. , pluggable web components ) for visualizing personalized views as dynamic web pages . Last but not least , both learners and instructors can employ the same Portal GUI for updating semantically described LOs and thus support an open-ended continuum of learning . To the best of our knowledge , the work presented in this paper is the first Online Curriculum Portal platform supporting the aforementioned functionality .

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

e-learning portals
ieee-lom
jetspeed portlets


Mining anchor text for query refinement When searching large hypertext document collections , it is often possible that there are too many results available for ambiguous queries . Query refinement is an interactive process of query modification that can be used to narrow down the scope of search results . We propose a new method for automatically generating refinements or related terms to queries by mining anchor text for a large hypertext document collection . We show that the usage of anchor text as a basis for query refinement produces high quality refinement suggestions that are significantly better in terms of perceived usefulness compared to refinements that are derived using the document content . Furthermore , our study suggests that anchor text refinements can also be used to augment traditional query refinement algorithms based on query logs , since they typically differ in coverage and produce different refinements . Our results are based on experiments on an anchor text collection of a large corporate intranet .

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


Small world peer networks in distributed web search In ongoing research , a collaborative peer network application is being proposed to address the scalability limitations of centralized search engines . Here we introduce a local adaptive routing algorithm used to dynamically change the topology of the peer network based on a simple learning scheme driven by query response interactions among neighbors . We test the algorithm via simulations with 70 model users based on actual Web crawls . We find that the network topology rapidly converges from a random network to a small world network , with emerging clusters that match the user communities with shared interests .

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

distributed systems
information search and retrieval
peer collaborative search
topical crawlers


Automatic generation of link collections and their visualization In this paper , we describe a method of generating link collections in a user-specified category by comprehensively collecting existing link collections and analyzing their hyperlink references . Moreover , we propose a visualization method for a bird 's - eye view of the generated link collections . Our methods are effective in grasping intuitively the trend of significant sites and keywords in a category .

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

hyperlink analysis
hypertext/hypermedia
link collection


Model-based version and configuration management for a web engineering lifecycle During a lifecycle of a large-scale Web application , Web developers produce a wide variety of inter-related Web objects . Following good Web engineering practice , developers often create them based on a Web application development method , which requires certain logical models for the development and maintenance process . Web development is dynamic , thus , those logical models as well as Web artifacts evolve over time . However , the task of managing their evolution is still very inefficient because design decisions in models are not directly accessible in existing file-based software configuration management repositories . Key limitations of existing Web version control tools include their inadequacy in representing semantics of design models and inability to manage the evolution of model-based objects and their logical connections to Web documents . This paper presents a framework that allows developers to manage versions and configurations of models and to capture changes to model-to-model relations among Web objects . Model-based objects , Web documents , and relations are directly represented and versioned in a structure-oriented manner .

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

hypertext/hypermedia
model-based configuration management
versioned hypermedia


Modeling and predicting behavioral dynamics on the web User behavior on the Web changes over time . For example , the queries that people issue to search engines , and the underlying informational goals behind the queries vary over time . In this paper , we examine how to model and predict this temporal user behavior . We develop a temporal modeling framework adapted from physics and signal processing that can be used to predict time-varying user behavior using smoothing and trends . We also explore other dynamics of Web behaviors , such as the detection of periodicities and surprises . We develop a learning procedure that can be used to construct models of users ' activities based on features of current and historical behaviors . The results of experiments indicate that by using our framework to predict user behavior , we can achieve significant improvements in prediction compared to baseline models that weight historical evidence the same for all queries . We also develop a novel learning algorithm that explicitly learns when to apply a given prediction model among a set of such models . Our improved temporal modeling of user behavior can be used to enhance query suggestions , crawling policies , and result ranking .

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

applications
behavioral analysis
predictive behavioral models


Economics of BitTorrent communities Over the years , private file-sharing communities built on the BitTorrent protocol have developed their own policies and mechanisms for motivating members to share content and contribute resources . By requiring members to maintain a minimum ratio between uploads and downloads , private communities effectively establish credit systems , and with them full-fledged economies . We report on a half-year-long measurement study of DIME -- a community for sharing live concert recordings -- that sheds light on the economic forces affecting users in such communities . A key observation is that while the download of files is priced only according to the size of the file , the rate of return for seeding new files is significantly greater than for seeding old files . We find via a natural experiment that users react to such differences in resale value by preferentially consuming older files during a ` free leech ' period . We consider implications of these finding on a user 's ability to earn credits and meet ratio enforcements , focusing in particular on the relationship between visitation frequency and wealth and on low bandwidth users . We then share details from an interview with DIME moderators , which highlights the goals of the community based on which we make suggestions for possible improvement .

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

bittorrent
private communities
resale value

distributed systems
incentives
peer-to-peer
share ratio enforcement


Detecting web page structure for adaptive viewing on small form factor devices Mobile devices have already been widely used to access the Web . However , because most available web pages are designed for desktop PC in mind , it is inconvenient to browse these large web pages on a mobile device with a small screen . In this paper , we propose a new browsing convention to facilitate navigation and reading on a small-form-factor device . A web page is organized into a two level hierarchy with a thumbnail representation at the top level for providing a global view and index to a set of sub-pages at the bottom level for detail information . A page adaptation technique is also developed to analyze the structure of an existing web page and split it into small and logically related units that fit into the screen of a mobile device . For a web page not suitable for splitting , auto-positioning or scrolling-by-block is used to assist the browsing as an alterative . Our experimental results show that our proposed browsing convention and developed page adaptation scheme greatly improve the user 's browsing experiences on a device with a small display .

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

adaptive hypermedia
content adaptation
mobile browser


Second international workshop on RESTful design ( WS-REST 2011 ) Over the past few years , the discussion between the two major architectural styles for designing and implementing Web services , the RPC-oriented approach and the resource-oriented approach , has been mainly held outside of traditional research communities . Mailing lists , forums and developer communities have seen long and fascinating debates around the assumptions , strengths , and weaknesses of these two approaches . The Second International Workshop on RESTful Design ( WS-REST 2011 ) has the goal of getting more researchers involved in the debate by providing a forum where discussions around the resource-oriented style of Web services design take place . Representational State Transfer ( REST ) is an architectural style and as such can be applied in different ways , can be extended by additional constraints , or can be specialized with more specific interaction patterns . WS-REST is the premier forum for discussing research ideas , novel applications and results centered around REST at the World Wide Web conference , which provides a great setting to host this second edition of the workshop dedicated to research on the architectural style underlying the Web .

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


Constructing virtual documents for ontology matching On the investigation of linguistic techniques used in ontology matching , we propose a new idea of virtual documents to pursue a cost-effective approach to linguistic matching in this paper . Basically , as a collection of weighted words , the virtual document of a URIref declared in an ontology contains not only the local descriptions but also the neighboring information to reflect the intended meaning of the URIref . Document similarity can be computed by traditional vector space techniques , and then be used in the similarity-based approaches to ontology matching . In particular , the RDF graph structure is exploited to define the description formulations and the neighboring operations . Experimental results show that linguistic matching based on the virtual documents is dominant in average F-Measure as compared to other three approaches . It is also demonstrated by our experiments that the virtual documents approach is cost-effective as compared to other linguistic matching approaches .

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

description
linguistic matching
ontology matching

formulation
neighboring operation
vector space model


Anycast-aware transport for content delivery networks Anycast-based content delivery networks ( CDNs ) have many properties that make them ideal for the large scale distribution of content on the Internet . However , because routing changes can result in a change of the endpoint that terminates the TCP session , TCP session disruption remains a concern for anycast CDNs , especially for large file downloads . In this paper we demonstrate that this problem does not require any complex solutions . In particular , we present the design of a simple , yet efficient , mechanism to handle session disruptions due to endpoint changes . With our mechanism , a client can continue the download of the content from the point at which it was before the endpoint change . Furthermore , CDN servers purge the TCP connection state quickly to handle frequent switching with low system overhead . We demonstrate experimentally the effectiveness of our proposed mechanism and show that more complex mechanisms are not required . Specifically , we find that our mechanism maintains high download throughput even with a reasonably high rate of endpoint switching , which is attractive for load balancing scenarios . Moreover , our results show that edge servers can purge TCP connection state after a single timeout-triggered retransmission without any tangible impact on ongoing connections . Besides improving server performance , this behavior improves the resiliency of the CDN to certain denial of service attacks .

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

anycast
content delivery networks
internet


Toward tighter integration of web search with a geographic information system Integration of Web search with geographic information has recently attracted much attention . There are a number of local Web search systems enabling users to find location-specific Web content . In this paper , however , we point out that this integration is still at a superficial level . Most local Web search systems today only link local Web content to a map interface . They are extensions of a conventional stand-alone geographic information system ( GIS ) , applied to a Web-based client-server architecture . In this paper , we discuss the directions available for tighter integration of Web search with a GIS , in terms of extraction , knowledge discovery , and presentation . We also describe implementations to support our argument that the integration must go beyond the simple map-and hyperlink architecture .

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


An efficient and systematic method to generate xslt stylesheets for different wireless pervasive devices It is a tedious and cumbersome process to update directly a WML document for the wireless Web because its content composes of both data and presentation . Thus , XML is used to handle the data while its XSLT stylesheet is used to extract and format the data for presentation . However , different stylesheets have to be used for different devices . An efficient and systematic method based on the idea of generating two separate sets of rules corresponding to content extracting and formatting parts of the stylesheet is described in this paper . The data extraction part is constructed from content rules while the formatting part is constructed from presentation rules . They are then combined together to form a stylesheet by an XSLT generator . A large number of stylesheets corresponding to different devices and a number of standard DTD documents or XML schemas can be generated in this way and stored in the pool during application setup stage . They will be individually selected from the pool by an XSLT engine to produce different WML documents for different devices during run time .

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


Volunteer computing : a model of the factors determining contribution to community-based scientific research Volunteer computing is a powerful way to harness distributed resources to perform large-scale tasks , similarly to other types of community-based initiatives . Volunteer computing is based on two pillars : the first is computational - allocating and managing large computing tasks ; the second is participative - making large numbers of individuals volunteer their computer resources to a project . While the computational aspects of volunteer computing received much research attention , the participative aspect remains largely unexplored . In this study we aim to address this gap : by drawing on social psychology and online communities research , we develop and test a three-dimensional model of the factors determining volunteer computing users ' contribution . We investigate one of the largest volunteer computing projects - SETI@home - by linking survey data about contributors ' motivations to their activity logs . Our findings highlight the differences between volunteer computing and other forms of community-based projects , and reveal the intricate relationship between individual motivations , social affiliation , tenure in the project , and resource contribution . Implications for research and practice are discussed .

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

motivations
online communities
volunteer computing

boinc
citizen science
crowdsourcing
seti@home


Automatic matchmaking of web services

on-line information services
semantic web services


Using static analysis for Ajax intrusion detection We present a static control-flow analysis for JavaScript programs running in a web browser . Our analysis tackles numerous challenges posed by modern web applications including asynchronous communication , frameworks , and dynamic code generation . We use our analysis to extract a model of expected client behavior as seen from the server , and build an intrusion-prevention proxy for the server : the proxy intercepts client requests and disables those that do not meet the expected behavior . We insert random asynchronous requests to foil mimicry attacks . Finally , we evaluate our technique against several real applications and show that it protects against an attack in a widely-used web application .

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


Thumbs-up : a game for playing to rank search results Human computation is an effective way to channel human effort spent playing games to solving computational problems that are easy for humans but difficult for computers to automate . We propose Thumbs-Up , a new game for human computation with the purpose of playing to rank search result . Our experience from users shows that Thumbs-Up is not only fun to play , but produces more relevant rankings than both a major search engine and optimal rank aggregation using the Kemeny rule .

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

human computation
rank aggregation
search engine

games with a purpose
online games
relevance


Personalizing web sites for mobile users


DiTaBBu : automating the production of time-based hypermedia content We present DiTaBBu , Digital Talking Books Builder , a framework for automatic production of time-based hypermedia for the Web , focusing on the Digital Talking Books domain . Delivering Digital Talking Books collections to a wide range of users is an expensive task , as it must take into account each user profile 's different needs , therefore authoring should be dismissed in favor of automation . With DiTaBBu , we enable automated content delivery in several playback platforms , targeted to specific user needs , featuring powerful navigation capabilities over the content . DiTaBBu can also be used as testbed for prototyping novel capabilities , through its flexible extension mechanisms .

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

digital talking books
ditabbu
hypermedia

accessibility
automatic presentation generation
document preparation
hypertext/hypermedia
multimodality
user interfaces


Survivability-oriented self-tuning of web systems Running in a highly uncertain and changing environment , Web systems can not always provide full set of services with optim ¬ al quality , especially when the workload is high or failures in subsys-tems occur frequently . It is thus desirable to continuously maintain a high satisfaction level of the system value proposition , hereafter survivability assurance , while relaxing\/sacrificing certain quality\/functional requirements that are not crucial to the survival of the Web systems . In this paper , we propose a requirements-driven self-tuning method for survivability assurance of Web systems . Using a value-based feedback controller plus a requirements-oriented reasoner , our method makes both quality and functional requirements tradeoffs decisions at runtime .

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


User-centric Web crawling Search engines are the primary gateways of information access on the Web today . Behind the scenes , search engines crawl the Web to populate a local indexed repository of Web pages , used to answer user search queries . In an aggregate sense , the Web is very dynamic , causing any repository of Web pages to become out of date over time , which in turn causes query answer quality to degrade . Given the considerable size , dynamicity , and degree of autonomy of the Web as a whole , it is not feasible for a search engine to maintain its repository exactly synchronized with the Web . In this paper we study how to schedule Web pages for selective ( re ) downloading into a search engine repository . The scheduling objective is to maximize the quality of the user experience for those who query the search engine . We begin with a quantitative characterization of the way in which the discrepancy between the content of the repository and the current content of the live Web impacts the quality of the user experience . This characterization leads to a user-centric metric of the quality of a search engine 's local repository . We use this metric to derive a policy for scheduling Web page ( re ) downloading that is driven by search engine usage and free of exterior tuning parameters . We then focus on the important subproblem of scheduling refreshing of Web pages already present in the repository , and show how to compute the priorities efficiently . We provide extensive empirical comparisons of our user-centric method against prior Web page refresh strategies , using real Web data . Our results demonstrate that our method requires far fewer resources to maintain same search engine quality level for users , leaving substantially more resources available for incorporating new Web pages into the search repository .

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


Efficient search for peer-to-peer information retrieval using semantic small world This paper proposes a semantic overlay based on the small world phenomenon that facilitates efficient search for information retrieval in unstructured P2P systems . In the semantic overlay , each node maintains a number of short-range links which are semantically similar to each other , together with a small collection of long-range links that help increasing recall rate of information retrieval and reduce network traffic as well . Experimental results show that our model can improve performance by 150 % compared to Gnutella and by up to 60 % compared to the Interest-based model - a similar shortcut-based search technique .

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

information retrieval
semantic
small world


The Yin\/Yang web : XML syntax and RDF semantics XML is the W3C standard document format for writing and exchanging information on the Web . RDF is the W3C standard model for describing the semantics and reasoning about information on the Web . Unfortunately , RDF and XML -- although very close to each other -- are based on two different paradigms . We argue that in order to lead the Semantic Web to its full potential , the syntax and the semantics of information needs to work together . To this end , we develop a model-theoretic semantics for the XML XQuery 1.0 and XPath 2.0 Data Model , which provides a unified model for both XML and RDF . This unified model can serve as the basis for Web applications that deal with both data and semantics . We illustrate the use of this model on a concrete information integration scenario . Our approach enables each side of the fence to benefit from the other , notably , we show how the RDF world can take advantage of XML query languages , and how the XML world can take advantage of the reasoning capabilities available for RDF .

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

knowledge representation formalisms and methods


Are web pages characterized by color ? When human guess the content of a web page , not only the text on the page but also its appearance is an important factor . However , there have been few studies on the relationshipbetween the content and visual appearance of a web page . We investigating the tendencybetween them , especially web content and color use , we found a tendency to use color for some kinds of content pages . We think this result opens the way to estimating web content using color information .

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

contents of web page
general
miscellaneous


b-Bit minwise hashing This paper establishes the theoretical framework of b-bit minwise hashing . The original minwise hashing method has become a standard technique for estimating set similarity ( e.g. , resemblance ) with applications in information retrieval , data management , computational advertising , etc. . By only storing b bits of each hashed value ( e.g. , b = 1 or 2 ) , we gain substantial advantages in terms of storage space . We prove the basic theoretical results and provide an unbiased estimator of the resemblance for any b. We demonstrate that , even in the least favorable scenario , using b = 1 may reduce the storage space at least by a factor of 21.3 ( or 10.7 ) compared to b = 64 ( or b = 32 ) , if one is interested in resemblance ) 0.5 .

O O B O O O O O O O O O B O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 unified framework for name disambiguation Name ambiguity problem has been a challenging issue for a long history . In this paper , we intend to make a thorough investigation of the whole problem . Specifically , we formalize the name disambiguation problem in a unified framework . The framework can incorporate both attribute and relationship into a probabilistic model . We explore a dynamic approach for automatically estimating the person number K and employ an adaptive distance measure to estimate the distance between objects . Experimental results show that our proposed framework can significantly outperform the baseline method .

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

database applications
digital library
information search and retrieval
learning


TruRank : taking PageRank to the limit PageRank is defined as the stationary state of a Markov chain depending on a damping factor α that spreads uniformly part of the rank . The choice of α is eminently empirical , and in most cases the original suggestion α = 0.85 by Brin and Page is still used . It is common belief that values of α closer to 1 give a `` truer to the web '' PageRank , but a small α accelerates convergence . Recently , however , it has been shown that when α = 1 all pages in the core component are very likely to have rank 0 ( 1 ) . This behavior makes it difficult to understand PageRank when α ≈ 1 , as it converges to a meaningless value for most pages . We propose a simple and natural modification to the standard preprocessing performed on the adjacency matrix of the graph , resulting in a ranking scheme we call TruRank . TruRank ranks the web with principles almost identical to PageRank , but it gives meaningful values also when α ☰ 1 .

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


Contextual advertising by combining relevance with click feedback Contextual advertising supports much of the Web 's ecosystem today . User experience and revenue ( shared by the site publisher and the ad network ) depend on the relevance of the displayed ads to the page content . As with other document retrieval systems , relevance is provided by scoring the match between individual ads ( documents ) and the content of the page where the ads are shown ( query ) . In this paper we show how this match can be improved significantly by augmenting the ad-page scoring function with extra parameters from a logistic regression model on the words in the pages and ads . A key property of the proposed model is that it can be mapped to standard cosine similarity matching and is suitable for efficient and scalable implementation over inverted indexes . The model parameter values are learned from logs containing ad impressions and clicks , with shrinkage estimators being used to combat sparsity . To scale our computations to train on an extremely large training corpus consisting of several gigabytes of data , we parallelize our fitting algorithm in a Hadoop framework ( 10 ) . Experimental evaluation is provided showing improved click prediction over a holdout set of impression and click events from a large scale real-world ad placement engine . Our best model achieves a 25 % lift in precision relative to a traditional information retrieval model which is based on cosine similarity , for recalling 10 % of the clicks in our test data .

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

clickthrough rate
interaction effects
miscellaneous
modeling


OCTOPUS : aggressive search of multi-modality data using multifaceted knowledge base An important trend in Web information processing is the support of multimedia retrieval . However , the most prevailing paradigm for multimedia retrieval , content-based retrieval ( CBR ) , is a rather conservative one whose performance depends on a set of specifically defined low-level features and a carefully chosen sample object . In this paper , an aggressive search mechanism called Octopus is proposed which addresses the retrieval of multi-modality data using multifaceted knowledge . In particular , Octopus promotes a novel scenario in which the user supplies seed objects of arbitrary modality as the hint of his information need , and receives a set of multi-modality objects satisfying his need . The foundation of Octopus is a multifaceted knowledge base constructed on a layered graph model ( LGM ) , which describes the relevance between media objects from various perspectives . Link analysis based retrieval algorithm is proposed based on the LGM . A unique relevance feedback technique is developed to update the knowledge base by learning from user behaviors , and to enhance the retrieval performance in a progressive manner . A prototype implementing the proposed approach has been developed to demonstrate its feasibility and capability through illustrative examples .

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

layered graph model
link analysis
multifaceted knowledge base
multimedia retrieval
relevance feedback


Searching for events in the blogosphere Over the last few years , blogs ( web logs ) have gained massive popularity and have become one of the most influential web social media in our times . Every blog post in the Blogosphere has a well defined timestamp , which is not taken into account by search engines . By conducting research regarding this feature of the Blogosphere , we can attempt to discover bursty terms and correlations between them during a time interval . We apply Kleinberg 's automaton on extracted titles of blog posts to discover bursty terms , we introduce a novel representation of a term 's burstiness evolution called State Series and we employ a Euclidean-based distance metric to discover potential correlations between terms without taking into account their context . We evaluate the results trying to match them with real life events . Finally , we propose some ideas for further evaluation techniques and future research in the field .

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

burst analysis
hot topics
information retrieval
keyword correlation
miscellaneous
text mining


Trains of thought : generating information maps When information is abundant , it becomes increasingly difficult to fit nuggets of knowledge into a single coherent picture . Complex stories spaghetti into branches , side stories , and intertwining narratives . In order to explore these stories , one needs a map to navigate unfamiliar territory . We propose a methodology for creating structured summaries of information , which we call metro maps . Our proposed algorithm generates a concise structured set of documents maximizing coverage of salient pieces of information . Most importantly , metro maps explicitly show the relations among retrieved pieces in a way that captures story development . We first formalize characteristics of good maps and formulate their construction as an optimization problem . Then we provide efficient methods with theoretical guarantees for generating maps . Finally , we integrate user interaction into our framework , allowing users to alter the maps to better reflect their interests . Pilot user studies with a real-world dataset demonstrate that the method is able to produce maps which help users acquire knowledge efficiently .

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

content analysis and indexing
general
information search and retrieval
summarization


CiteSeerx : an architecture and web service design for an academic document search engine CiteSeer is a scientific literature digital library and search engine which automatically crawls and indexes scientific documents in the field of computer and information science . After serving as a public search engine for nearly ten years , CiteSeer is starting to have scaling problems for handling of more documents , adding new feature and more users . Its monolithic architecture design prevents it from effectively making use of new web technologies and providing new services . After analyzing the current system problems , we propose a new architecture and data model , CiteSeerx . CiteSeerx that will overcome the existing problems as well as provide scalability and better performance plus new services and system features .

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


Analyzing and accelerating web access in a school in peri-urban India While computers and Internet access have growing penetration amongst schools in the developing world , intermittent connectivity and limited bandwidth often prevent them from being fully utilized by students and teachers . In this paper , we make two contributions to help address this problem . First , we characterize six weeks of HTTP traffic from a primary school outside of Bangalore , India , illuminating opportunities and constraints for improving performance in such settings . Second , we deploy an aggressive caching and prefetching engine and show that it accelerates a user 's overall browsing experience ( apart from video content ) by 2.8 x. Our accelerator leverages innovative techniques that have been proposed , but not evaluated in detail , including the effectiveness of serving stale pages , cached page highlighting , and client-side prefetching . Unlike proxy-based techniques , our system is bundled as an open-source Firefox plugin and runs directly on client machines . This allows easy installation and configuration by end users , which is especially important in developing regions where a lack of permissions or technical expertise often prevents modification of internal network settings .

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

browser extension
computer uses in education
hypertext/hypermedia
web acceleration


Session level techniques for improving web browsing performance on wireless links Recent observations through experiments that we have performed incurrent third generation wireless networks have revealed that the achieved throughput over wireless links varies widely depending on the application . In particular , the throughput achieved by file transfer application ( FTP ) and web browsing application ( HTTP ) are quite different . The throughput achieved over a HTTP session is much lower than that achieved over an FTP session . The reason for the lower HTTP throughput is that the HTTP protocol is affected by the large Round-Trip Time ( RTT ) across Wireless links . HTTP transfers require multiple TCP connections and DNS lookups before a HTTP page can be displayed . Each TCP connection requires several RTTs to fully open the TCP send window and each DNS lookup requires several RTTs before resolving the domain name to IP mapping . These TCP\/DNS RTTs significantly degrade the performance of HTTP over wireless links . To overcome these problems , we have developed session level optimization techniques to enhance HTTP download mechanisms . These techniques ( a ) minimize the number of DNS lookups over the wireless link and ( b ) minimize the number of TCP connections opened by the browser . These optimizations bridge the mismatch caused by wireless links between application-level protocols ( such as HTTP ) and transport-level protocols ( such asTCP ) . Our solutions do not require any client-side software and can be deployed transparently on a service provider network toprovide 30-50 % decrease in end-to-end user perceived latency and 50-100 % increase in data throughput across wireless links for HTTP sessions .

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


Learning to tag Social tagging provides valuable and crucial information for large-scale web image retrieval . It is ontology-free and easy to obtain ; however , irrelevant tags frequently appear , and users typically will not tag all semantic objects in the image , which is also called semantic loss . To avoid noises and compensate for the semantic loss , tag recommendation is proposed in literature . However , current recommendation simply ranks the related tags based on the single modality of tag co-occurrence on the whole dataset , which ignores other modalities , such as visual correlation . This paper proposes a multi-modality recommendation based on both tag and visual correlation , and formulates the tag recommendation as a learning problem . Each modality is used to generate a ranking feature , and Rankboost algorithm is applied to learn an optimal combination of these ranking features from different modalities . Experiments on Flickr data demonstrate the effectiveness of this learning-based multi-modality recommendation strategy .

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

learning to tag
social tagging
tag recommendation


Distributed graph pattern matching Graph simulation has been adopted for pattern matching to reduce the complexity and capture the need of novel applications . With the rapid development of the Web and social networks , data is typically distributed over multiple machines . Hence a natural question raised is how to evaluate graph simulation on distributed data . To our knowledge , no such distributed algorithms are in place yet . This paper settles this question by providing evaluation algorithms and optimizations for graph simulation in a distributed setting . ( 1 ) We study the impacts of components and data locality on the evaluation of graph simulation . ( 2 ) We give an analysis of a large class of distributed algorithms , captured by a message-passing model , for graph simulation . We also identify three complexity measures : visit times , makespan and data shipment , for analyzing the distributed algorithms , and show that these measures are essentially controversial with each other . ( 3 ) We propose distributed algorithms and optimization techniques that exploit the properties of graph simulation and the analyses of distributed algorithms . ( 4 ) We experimentally verify the effectiveness and efficiency of these algorithms , using both real-life and synthetic data .

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


XML design for relational storage Design principles for XML schemas that eliminate redundancies and avoid update anomalies have been studied recently . Several normal forms , generalizing those for relational databases , have been proposed . All of them , however , are based on the assumption of anative XML storage , while in practice most of XML data is stored inrelational databases . In this paper we study XML design and normalization for relational storage of XML documents . To be able to relate and compare XML and relational designs , we use an information-theoretic framework that measures information content in relations and documents , with higher values corresponding to lower levels of redundancy . We show that most common relational storage schemes preserve the notion of being well-designed ( i.e. , anomalies - and redundancy-free ) . Thus , existing XML normal forms guarantee well-designed relational storagesas well . We further show that if this perfect option is not achievable , then a slight restriction on XML constraints guarantees a `` second-best '' relational design , according to possible values of the information-theoretic measure . We finally consider an edge-based relational representation of XML documents , and show that while it has similar information-theoretic properties with other relational representations , it can behave significantly worse in terms of enforcing integrity constraints .

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

equality-generating dependencies
functional dependencies


Keys for XML


Finding advertising keywords on web pages A large and growing number of web pages display contextual advertising based on keywords automatically extracted from the text of the page , and this is a substantial source of revenue supporting the web today . Despite the importance of this area , little formal , published research exists . We describe a system that learns how to extract keywords from web pages for advertisement targeting . The system uses a number of features , such as term frequency of each potential keyword , inverse document frequency , presence in meta-data , and how often the term occurs in search query logs . The system is trained with a set of example pages that have been hand-labeled with `` relevant '' keywords . Based on this training , it can then extract new keywords from previously unseen pages . Accuracy is substantially better than several baseline systems .

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

information extraction
keyword extraction
miscellaneous


Managing versions of web documents in a transaction-time web server This paper presents a transaction-time HTTP server , called TTApache that supports document versioning . A document often consists of a main file formatted in HTML or XML and several included files such as images and stylesheets . A change to any of the files associated with a document creates a new version of that document . To construct a document version history , snapshots of the document 's files are obtained over time . Transaction times are associated with each file version to record the version 's lifetime . The transaction time is the system time of the edit that created the version . Accounting for transaction time is essential to supporting audit queries that delve into past document versions and differential queries that pinpoint differences between two versions . TTApache performs automatic versioning when a document is read thereby removing the burden of versioning from document authors . Since some versions may be created but never read , TTApache distinguishes between known and assumed versions of a document . TTApache has a simple query language to retrieve desired versions . A browser can request a specific version , or the entire history of a document . Queries can also rewrite links and references to point to current or past versions . Over time , the version history of a document continually grows . To free space , some versions can be vacuumed . Vacuuming a version however changes the semantics of requests for that version . This paper presents several policies for vacuuming versions and strategies for accounting for vacuumed versions in queries .

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


Middleware services for web service compositions WS - \* specifications cover a variety of issues ranging from security and reliability to transaction support in web services . However , these specifications do not address web service compositions . On the other hand , BPEL as the future standard web service composition language allows the specification of the functional part of the composition as a business process but it fails short in expressing non-functional properties such as security , reliability and persistence . In this paper , we propose an approach for the transparent integration of technical concerns in web service compositions . Our approach is driven by the analogy between web services and software components and is inspired from server-side component models such as Enterprise Java Beans . The main components of our framework are the process container , the middleware services and the deployment descriptor .

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


Efficient and robust streaming provisioning in VPNs Today , most large companies maintain virtual private networks ( VPNs ) to connect their remote locations into a single secure network . VPNs can be quite large covering more than 1000 locations and in most cases use standard Internet protocols and services . Such VPNs are implemented using a diverse set of technologies such as Frame Relay , MPLS , or IPSEC to achieve the goal of privacy and performance isolation from the public Internet . Using VPNs to distribute live content has recently received tremendous interest . For example , a VPN could be used to broadcast a CEO-employee town hall meeting . To distribute this type of content economically without overloading the network , the deployment of streaming caches or splitters is most likely required . In this paper , we address the problem of optimally placing such streaming splitters or caches to broadcast to a given set of VPN endpoints under the constraints typically found within a VPN . In particular , we introduce an efficient algorithm with complexity O ( V ) , V being the number of routers in the VPN . This guarantees the optimal cache placement if interception is used for redirection . We prove that the general problem is NP-hard and introduce multiple heuristics for efficient and robust cache placement suitable under different constraints . At the expense of increased implementation complexity , each heuristic solution provides additional saving in the number of caches required . We evaluate proposed solutions using extensive simulations . In particular , we show our flow-based solution is very close to the optimal .

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


The distribution of pageRank follows a power-law only for particular values of the damping factor We show that the empirical distribution of the PageRank values in a large set of Web pages does not follow a power-law except for some particular choices of the damping factor . We argue that for a graph with an in-degree distribution following a power-law with exponent between 2.1 and 2.2 , choosing a damping factor around 0.85 for PageRank yields a power-law distribution of its values . We suggest that power-law distributions of PageRank in Web graphs have been observed because the typical damping factor used in practice is between 0.85 and 0.90 .

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

miscellaneous
pagerank distribution
web graph


On measuring the quality of Wikipedia articles This paper discusses an approach to modeling and measuring information quality of Wikipedia articles . The approach is based on the idea that the quality of Wikipedia articles with distinctly different profiles needs to be measured using different information quality models . We report on our initial study , which involved two categories of Wikipedia articles : `` stabilized '' ( those , whose content has not undergone major changes for a significant period of time ) and `` controversial '' ( the articles , which have undergone vandalism , revert wars , or whose content is subject to internal discussions between Wikipedia editors ) . We present simple information quality models and compare their performance on a subset of Wikipedia articles with the information quality evaluations provided by human users . Our experiment shows , that using special-purpose models for information quality captures user sentiment about Wikipedia articles better than using a single model for both categories of articles .

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


Where to adapt dynamic service compositions Peer services depend on one another to accomplish their tasks , and their structures may evolve . A service composition may be designed to replace its member services whenever the quality of the composite service fails to meet certain quality-of-service ( QoS ) requirements . Finding services and service invocation endpoints having the greatest impact on the quality are important to guide subsequent service adaptations . This paper proposes a technique that samples the QoS of composite services and continually analyzes them to identify artifacts for service adaptation . The preliminary results show that our technique has the potential to effectively find such artifacts in services .

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


Using web browser interactions to predict task The automatic identification of a user 's task has the potential to improve information filtering systems that rely on implicit measures of interest and whose effectiveness may be dependant upon the task at hand . Knowledge of a user 's current task type would allow information filtering systems to apply the most useful measures of user interest . We recently conducted a field study in which we logged all participants ' interactions with their web browsers and asked participants to categorize their web usage according to a high-level task schema . Using the data collected during this study , we have conducted a preliminary exploration of the usefulness of logged web browser interactions to predict users ' tasks . The results of this initial analysis suggest that individual models of users ' web browser interactions may be useful in predicting task type .

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

field study
information filtering
task
web


ASDL : a wide spectrum language for designing web services A Service oriented system emerges from composition of services . Dynamically composed reactive Web services form a special class of service oriented system , where the delays associated with communication , unreliability and unavailability of services , and competition for resources from multiple service requesters are dominant concerns . As complexity of services increase , an abstract design language for the specification of services and interaction between them is desired . In this paper , we present ASDL ( Abstract Service Design Language ) , a wide spectrum language for modelling Web services . We initially provide an informal description of our computational model for service oriented systems . We then present ASDL along with its specification oriented semantics defined in Interval Temporal Logic ( ITL ) : a sound formalism for specifying and reasoning about temporal properties of systems . The objective of ASDL is to provide a notation for the design of service composition and interaction protocols at an abstract level .

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

asdl
computational model
web services
wide spectrum

formal languages
models of computation
semantics of programming languages


Statistical analysis of the social network and discussion threads in slashdot We analyze the social network emerging from the user comment activity on the website Slashdot . The network presents common features of traditional social networks such as a giant component , small average path length and high clustering , but differs from them showing moderate reciprocity and neutral assortativity by degree . Using Kolmogorov-Smirnov statistical tests , we show that the degree distributions are better explained by log-normal instead of power-law distributions . We also study the structure of discussion threads using an intuitive radial tree representation . Threads show strong heterogeneity and self-similarity throughout the different nesting levels of a conversation . We use these results to propose a simple measure to evaluate the degree of controversy provoked by a post .

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

bulletin board
h-index
log-normal
online communities
power-law
thread
weblogs


Towards content trust of web resources Trust is an integral part of the Semantic Web architecture . While most prior work focuses on entity-centered issues such as authentication and reputation , it does not model the content , i.e. the nature and use of the information being exchanged . This paper discusses content trust as an aggregate of other trust measures that have been previously studied . The paper introduces several factors that users consider in deciding whether to trust the content provided by a Web resource . Many of these factors are hard to capture in practice , since they would require a large amount of user input . Our goal is to discern which of these factors could be captured in practice with minimal user interaction in order to maximize the system 's trust estimates . The paper also describes a simulation environment that we have designed to study alternative models of content trust .

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

information search and retrieval
web of trust


Filtering spam e-mail on a global scale In this paper we analyze a very large junk e-mail corpus which was generated by a hundred thousand volunteer users of the Hotmail e-mail service . We describe how the corpus is being collected , and analyze : the geographic origins of the e-mail who the e-mail is targeting and what the e-mail is selling .

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


Using proportional transportation similarity with learned element semantics for XML document clustering This paper proposes a novel approach to measuring XML document similarity by taking into account the semantics between XML elements . The motivation of the proposed approach is to overcome the problems of `` under-contributionö and `` over-contributionö existing in previous work . The element semantics are learned in an unsupervised way and the Proportional Transportation Similarity is proposed to evaluate XML document similarity by modeling the similarity calculation as a transportation problem . Experiments of clustering are performed on three ACM SIGMOD data sets and results show the favorable performance of the proposed approach .

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

proportional transportation similarity
xml document clustering


A comprehensive comparative study on term weighting schemes for text categorization with support vector machines Term weighting scheme , which has been used to convert the documents as vectors in the term space , is a vital step in automatic text categorization . In this paper , we conducted comprehensive experiments to compare various term weighting schemes with SVM on two widely-used benchmark data sets . We also presented a new term weighting scheme tf-rf to improve the term 's discriminating power . The controlled experimental results showed that this newly proposed tf-rf scheme is significantly better than other widely-used term weighting schemes . Compared with schemes related with tf factor alone , the idf factor does not improve or even decrease the term 's discriminating power for text categorization .

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

categorization
svm
term weighting schemes
text


Associative sources and agents for zero-input publishing This paper presents an associative agent that allows seamless navigation from one 's own personal space to third-party associative sources , as well as the personal spaces of other users . The agent provides users with access to a dynamically growing list of information sources , all of which follow a common associative sources API that we have defined . The agent also allows users act as sources themselves and take part in peer-to peer knowledge sharing .

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

aggregation
associativity
communications applications
context
polymorphism
reconnaissance
web services


SGPS : a semantic scheme for web service similarity Today 's Web becomes a platform for services to be dynamically interconnected to produce a desired outcome . It is important to formalize the semantics of the contextual elements of web services . In this paper , we propose a novel technique called Semantic Genome Propagation Scheme ( SGPS ) for measuring similarity between semantic concepts . We show how SGPS is used to compute a multi-dimensional similarity between two services . We evaluate the SGPS similarity measurement in terms of the similarity performance and scalability .

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


Vinci : a service-oriented architecture for rapid development of web applications


Knowledge sharing and yahoo answers : everyone knows something Yahoo Answers ( YA ) is a large and diverse question-answer forum , acting not only as a medium for sharing technical knowledge , but as a place where one can seek advice , gather opinions , and satisfy one 's curiosity about a countless number of things . In this paper , we seek to understand YA 's knowledge sharing and activity . We analyze the forum categories and cluster them according to content characteristics and patterns of interaction among the users . While interactions in some categories resemble expertise sharing forums , others incorporate discussion , everyday advice , and support . With such a diversity of categories in which one can participate , we find that some users focus narrowly on specific topics , while others participate across categories . This not only allows us to map related categories , but to characterize the entropy of the users ' interests . We find that lower entropy correlates with receiving higher answer ratings , but only for categories where factual expertise is primarily sought after . We combine both user attributes and answer characteristics to predict , within a given category , whether a particular answer will be chosen as the best answer by the asker .

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

expertise finding
help seeking
online communities
question answering
social network analysis


Learning deterministic regular expressions for the inference of schemas from XML data Inferring an appropriate DTD or XML Schema Definition ( XSD ) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of positive example words . Unfortunately , there is no algorithm capable of learning the complete class of deterministic regular expressions from positive examples only , as we will show . The regular expressions occurring in practical DTDs and XSDs , however , are such that every alphabet symbol occurs only a small number of times . As such , in practice it suffices to learn the subclass of regular expressions in which each alphabet symbol occurs at most k times , for some small k. We refer to such expressions as k-occurrence regular expressions ( k-OREs for short ) . Motivated by this observation , we provide a probabilistic algorithm that learns k-OREs for increasing values of k , and selects the one that best describes the sample based on a Minimum Description Length argument . The effectiveness of the method is empirically validated both on real world and synthetic data . Furthermore , the method is shown to be conservative over the simpler classes of expressions considered in previous work .

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

document preparation
formal languages
schema inference


Testing google interfaces modified for the blind We present the results of a research project focus on improving the usability of web search tools for blind users who interact via screen reader and voice synthesizer . In the first stage of our study , we proposed eight specific guidelines for simplifying this interaction with search engines . Next , we evaluated these criteria by applying them to Google UIs , re-implementing the simple search and the result page . Finally , we prepared the environment for a remote test with 12 totally blind users . The results highlight how Google interfaces could be improved in order to simplify interaction for the blind .

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

accessibility
search engine
user interface design


Texquery : a full-text search extension to xquery One of the key benefits of XML is its ability to represent a mix of structured and unstructured ( text ) data . Although current XML query languages such as XPath and XQuery can express rich queries over structured data , they can only express very rudimentary queries over text data . We thus propose TeXQuery , which is a powerful full-text search extension to XQuery . TeXQuery provides a rich set of fully composable full-text search primitives , such as Boolean connectives , phrase matching , proximity distance , stemming and thesauri . TeXQuery also enables users to seamlessly query over both structured and text data by embedding TeXQuery primitives in XQuery , and vice versa . Finally , TeXQuery supports a flexible scoring construct that can be used toscore query results based on full-text predicates . TeXQuery is the precursor ofthe full-text language extensions to XPath 2.0 and XQuery 1.0 currently being developed by the W3C .

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


Off the beaten tracks : exploring three aspects of web navigation This paper presents results of a long-term client-side Web usage study , updating previous studies that range in age from five to ten years . We focus on three aspects of Web navigation : changes in the distribution of navigation actions , speed of navigation and within-page navigation . `` Navigation actionsö corresponding to users ' individual page requests are discussed by type . We reconfirm links to be the most important navigation element , while backtracking has lost more than half of its previously reported share and form submission has become far more common . Changes of the Web and the browser interfaces are candidates for causing these changes . Analyzing the time users stayed on pages , we confirm Web navigation to be a rapidly interactive activity . A breakdown of page characteristics shows that users often do not take the time to read the available text or consider all links . The performance of the Web is analyzed and reassessed against the resulting requirements . Finally , habits of within-page navigation are presented . Although most selected hyperlinks are located in the top left corner of the = screen , in nearly a quarter of all cases people choose links that require scrolling . We analyzed the available browser real estate to gain insights for the design of non-scrolling Web pages .

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

clickstream study
hypertext
user modeling


Networked graphs : a declarative mechanism for SPARQL rules , SPARQL views and RDF data integration on the web Easy reuse and integration of declaratively described information in a distributed setting is one of the main motivations for building the Semantic Web . Despite of this claim , reuse and recombination of RDF data today is mostly done using data replication and procedural code . A simple declarative mechanism for reusing and combining RDF data would help users to generate content for the semantic web . Having such a mechanism , the Semantic Web could better benefit from user generated content , as it is broadly present in the so called Web 2.0 , but also from better linkage of existing content . We propose Networked Graphs , which allow users to define RDF graphs both , by extensionally listing content , but also by using views on other graphs . These views can be used to include parts of other graphs , to transform data before including it and to denote rules . The relationships between graphs are described declaratively using SPARQL queries and an extension of the SPARQL semantics . Networked Graphs are easily exchangeable between and interpretable on different computers . Using existing protocols , Networked Graphss can be evaluated in a distributed setting .

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

distributed rules
information storage and retrieval
well founded semantics


Web accessibility : a broader view Web accessibility is an important goal . However , most approaches to its attainment are based on unrealistic economic models in which Web content developers are required to spend too much for which they receive too little . We believe this situation is due , in part , to the overly narrow definitions given both to those who stand to benefit from enhanced access to the Web and what is meant by this enhanced access . In this paper , we take a broader view , discussing a complementary approach that costs developers less and provides greater advantages to a larger community of users . While we have quite specific aims in our technical work , we hope it can also serve as an example of how the technical conversation regarding Web accessibility can move beyond the narrow confines of limited adaptations for small populations .

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

handicapped persons/special needs
input devices and strategies
standards
user interface


Towards second and third generation web-based multimedia


Automated object persistence for JavaScript Traditionally web applications have required an internet connection in order to work with data . Browsers have lacked any mechanisms to allow web applications to operate offline with a set of data to provide constant access to applications . Recently , through browser plug-ins such as Google Gears , browsers have gained the ability to persist data for offline use . However , until now it 's been difficult for a web developer using these plug-ins to manage persisting data both locally for offline use and in the internet cloud due to : synchronization requirements , managing throughput and latency to the cloud , and making it work within the confines of a standards-compliant web browser . Historically in non-browser environments , programming language environments have offered automated object persistence to shield the developer from these complexities . In our research we have created a framework which introduces automated persistence of data objects for JavaScript utilizing the internet . Unlike traditional object persistence solutions , ours relies only on existing or forthcoming internet standards and does not rely upon specific runtime mechanisms such as OS or interpreter\/compiler support . A new design was required in order to be suitable to the internet 's unique characteristics of varying connection quality and a browser 's specific restrictions . We validate our approach using benchmarks which show that our framework can handle thousands of data objects automatically , reducing the amount of work needed by developers to support offline Web applications .

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

html5
json
object-oriented programming
web storage


Page-level template detection via isotonic smoothing We develop a novel framework for the page-level template detection problem . Our framework is built on two main ideas . The first is theautomatic generation of training data for a classifier that , given apage , assigns a templateness score to every DOM node of the page . The second is the global smoothing of these per-node classifier scores bysolving a regularized isotonic regression problem ; the latter follows from a simple yet powerful abstraction of templateness on a page . Our extensive experiments on human-labeled test data show that our approachdetects templates effectively .

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

miscellaneous
webpage sectioning
webpage segmentation


Crawling a country : better strategies than breadth-first for web page ordering This article compares several page ordering strategies for Web crawling under several metrics . The objective of these strategies is to download the most `` important '' pages `` early '' during the crawl . As the coverage of modern search engines is small compared to the size of the Web , and it is impossible to index all of the Web for both theoretical and practical reasons , it is relevant to index at least the most important pages . We use data from actual Web pages to build Web graphs and execute a crawler simulator on those graphs . As the Web is very dynamic , crawling simulation is the only way to ensure that all the strategies considered are compared under the same conditions . We propose several page ordering strategies that are more efficient than breadth - first search and strategies based on partial Pagerank calculations .

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

performance evaluation
scheduling policy
web crawler
web page importance


iRIN : image retrieval in image-rich information networks In this demo , we present a system called iRIN designed for performing image retrieval in image-rich information networks . We first introduce MoK-SimRank to significantly improve the speed of SimRank , one of the most popular algorithms for computing node similarity in information networks . Next , we propose an algorithm called SimLearn to ( 1 ) extend MoK-SimRank to heterogeneous image-rich information network , and ( 2 ) account for both link-based and content-based similarities by seamlessly integrating reinforcement learning with feature learning .

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

content analysis and indexing
information search and retrieval
ranking


A probabilistic semantic approach for discovering web services Service discovery is one of challenging issues in Service-Oriented computing . Currently , most of the existing service discovering and matching approaches are based on keywords-based strategy . However , this method is inefficient and time-consuming . In this paper , we present a novel approach for discovering web services . Based on the current dominating mechanisms of discovering and describing Web Services with UDDI and WSDL , the proposed approach utilizes Probabilistic Latent Semantic Analysis ( PLSA ) to capture semantic concepts hidden behind words in the query and advertisements in services so that services matching is expected to carry out at concept level . We also present related algorithms and preliminary experiments to evaluate the effectiveness of our approach .

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

on-line information services
web service
web services matching