Modeling anchor text and classifying queries to enhance web document retrieval Several types of queries are widely used on the World Wide Web and the expected retrieval method can vary depending on the query type . We propose a method for classifying queries into informational and navigational types . Because terms in navigational queries often appear in anchor text for links to other pages , we analyze the distribution of query terms in anchor texts on the Web for query classification purposes . While content-based retrieval is effective for informational queries , anchor-based retrieval is effective for navigational queries . Our retrieval system combines the results obtained with the content-based and anchor-based retrieval methods , in which the weight for each retrieval result is determined automatically depending on the result of the query classification . We also propose a method for improving anchor-based retrieval . Our retrieval method , which computes the probability that a document is retrieved in response to the given query , identifies synonyms of query terms in the anchor texts on the Web and uses these synonyms for smoothing purposes in the probability estimation . We use the NTCIR test collections and show the effectiveness of individual methods and the entire Web retrieval system experimentally .

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

anchor text
query classification
web retrieval


Background knowledge for ontology construction In this paper we describe a solution for incorporating background knowledge into the OntoGen system for semi-automatic ontology construction . This makes it easier for different users to construct different and more personalized ontologies for the same domain . To achieve this we introduce a word weighting schema to be used in the document representation . The weighting schema is learned based on the background knowledge provided by user . It is than used by OntoGen 's machine learning and text mining algorithms .

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


Using visual cues for extraction of tabular data from arbitrary HTML documents We describe a method to extract tabular data from web pages . Rather than just analyzing the DOM tree , we also exploit visual cues in the rendered version of the document to extract data from tables which are not explicitly marked with an HTML table element . To detect tables , we rely on a variant of the well-known X-Y cut algorithm as used in the OCR community . We implemented the system by directly accessing Mozilla 's box model that contains the positional data for all HTML elements of a given web page .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 capture
systems and software
table detection
visual analysis
web information extraction


Adaptive filtering of advertisements on web pages We present a browser extension to dynamically learn to filter unwanted images ( such as advertisements or flashy graphics ) based on minimal user feedback . To do so , we apply the weighted majority algorithm using pieces of the Uniform Resource Locators of such images as predictors . Experimental results tend to confirm that the accuracy of the predictions converges quickly to very high levels .

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

advertisement filtering
interface agents


Resource management for scalable disconnected access to Web services


A new suffix tree similarity measure for document clustering In this paper , we propose a new similarity measure to compute the pairwise similarity of text-based documents based on suffix tree document model . By applying the new suffix tree similarity measure in Group-average Agglomerative Hierarchical Clustering ( GAHC ) algorithm , we developed a new suffix tree document clustering algorithm ( NSTC ) . Experimental results on two standard document clustering benchmark corpus OHSUMED and RCV1 indicate that the new clustering algorithm is a very effective document clustering algorithm . Comparing with the results of traditional word term weight tf-idf similarity measure in the same GAHC algorithm , NSTC achieved an improvement of 51 % on the average of F-measure score . Furthermore , we apply the new clustering algorithm in analyzing the Web documents in online forum communities . A topic oriented clustering algorithm is developed to help people in assessing , classifying and searching the the Web documents in a large forum community .

O O B I 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 B I B I O O O O O B I B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 model
similarity measure
suffix tree


Protecting web servers from distributed denial of service attacks

class based routing
ddos
linux
security and protection
unix
web server security


An admission control scheme for predictable server response time for web accesses

service differentiating internet servers


A constraint extension to scalable vector graphics

constraints
csvg
differential scaling
interaction
multimedia information systems
semantic zooming
svg
three-dimensional graphics and realism
user interfaces


Efficient pagerank approximation via graph aggregation We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation . We ( 1 ) partition the Web 's graph into classes of quasi-equivalent vertices , ( 2 ) project the page-based random walk to be approximated onto those classes , and ( 3 ) compute the stationary probability distribution of the resulting class-based random walk . From this distribution we can quickly reconstruct a distribution on pages . Inparticular , our framework can approximate the well-known PageRank distribution by setting the classes according to the set of pages on each Web host . We experimented on a Web-graph containing over 1.4 billion pages , and were able to produce a ranking that has Spearman rank-order correlation of 0.95 with respect to PageRank . A simplistic implementation of our method required less than half the running time of a highly optimized implementation of PageRank , implying that larger speedup factors are probably possible .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
link analysis
search engines
web information retrieval


Providing session management as core business service It is extremely hard for a global organization with services over multiple channels to capture a consistent and unified view of its data , services , and interactions . While SOA and web services are addressing integration and interoperability problems , it is painful for an operational organization with legacy systems to quickly switch to service-based methods . We need methods to combine advantages of traditional ( i.e. web , desktop , or mobile ) application development environments and service-based deployments . In this paper , we focus on the design and implementation of session management as a core service to support business processes and go beyond application-specific sessions and web sessions . We develop local session components for different platforms and complement them with a remote `` session service '' that is independent of applications and platforms . We aim to close the gap between the two worlds by combining their performance , availability and interoperability advantages .

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

data serialization
multi-channel integration


Characterizing insecure javascript practices on the web JavaScript is an interpreted programming language most often used for enhancing webpage interactivity and functionality . It has powerful capabilities to interact with webpage documents and browser windows , however , it has also opened the door for many browser-based security attacks . Insecure engineering practices of using JavaScript may not directly lead to security breaches , but they can create new attack vectors and greatly increase the risks of browser-based attacks . In this paper , we present the first measurement study on insecure practices of using JavaScript on the Web . Our focus is on the insecure practices of JavaScript inclusion and dynamic generation , and we examine their severity and nature on 6,805 unique websites . Our measurement results reveal that insecure JavaScript practices are common at various websites : ( 1 ) at least 66.4 % of the measured websites manifest the insecure practices of including JavaScript files from external domains into the top-level documents of their webpages ; ( 2 ) over 44.4 % of the measured websites use the dangerous eval ( ) function to dynamically generate and execute JavaScript code on their webpages ; and ( 3 ) in JavaScript dynamic generation , using the document . write ( ) method and the innerHTML property is much more popular than using the relatively secure technique of creating script elements via DOM methods . Our analysis indicates that safe alternatives to these insecure practices exist in common cases and ought to be adopted by website developers and administrators for reducing potential security risks .

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

ast tree matching
execution-based measurement
same origin policy
unauthorized access
web engineering


Data quality in web archiving Web archives preserve the history of Web sites and have high long-term value for media and business analysts . Such archives are maintained by periodically re-crawling entire Web sites of interest . From an archivist 's point of view , the ideal case to ensure highest possible data quality of the archive would be to `` freeze '' the complete contents of an entire Web site during the time span of crawling and capturing the site . Of course , this is practically infeasible . To comply with the politeness specification of a Web site , the crawler needs to pause between subsequent http requests in order to avoid unduly high load on the site 's http server . As a consequence , capturing a large Web site may span hours or even days , which increases the risk that contents collected so far are incoherent with the parts that are still to be crawled . This paper introduces a model for identifying coherent sections of an archive and , thus , measuring the data quality in Web archiving . Additionally , we present a crawling strategy that aims to ensure archive coherence by minimizing the diffusion of Web site captures . Preliminary experiments demonstrate the usefulness of the model and the effectiveness of the strategy .

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

content analysis and indexing
temporal coherence


CS AKTive space : representing computer science in the semantic web We present a Semantic Web application that we callCS AKTive Space . The application exploits a wide range of semantically heterogeneousand distributed content relating to Computer Science research in theUK . This content is gathered on a continuous basis using a variety of methods including harvesting and scraping as well as adopting a range models for content acquisition . The content currently comprises aroundten million RDF triples and we have developed storage , retrieval andmaintenance methods to support its management . The content is mediated through an ontology constructed for the application domainand incorporates components from other published ontologies . CS AKTive Spacesupports the exploration of patterns and implications inherent in the content and exploits a variety of visualisations and multi dimensional representations . Knowledge services supported in the applicationinclude investigating communities of practice : who is working , researching or publishing with whom . This work illustrates a number ofsubstantial challenges for the Semantic Web . These include problems of referential integrity , tractable inference and interaction support . Wereview our approaches to these issues and discuss relevant related work .

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

semantic web challenge groups
user interfaces


Building reactive web applications The Adaptive Web is a new research area addressing the personalization of the Web experience for each user . In this paper we propose a new high-level model for the specification of Web applications that take into account the manner users interact with the application for supplying appropriate contents or gathering profile data . We therefore consider entire processes ( rather than single properties ) as smallest information units , allowing for automatic restructuring of application components . For this purpose , a high-level Event-Condition-Action ( ECA ) paradigm is proposed , which enables capturing arbitrary ( and timed ) clicking behaviors .

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


ATMEN : a triggered network measurement infrastructure Web performance measurements and availability tests have been carried out using a variety of infrastructures over the last several years . Disruptions in the Internet can lead to Web sites being unavailable or increase user-perceived latency . The unavailability could be due to DNS , failures in segments of the physical network cutting off thousands of users , or attacks . Prompt reactions to network-wide events can be facilitated by local or remote measurement and monitoring . Better yet , a distributed set of intercommunicating measurement and monitoring entities that react to events dynamically could go a long way to handle disruptions . We have designed and built ATMEN , a triggered measurement infrastructure to communicate and coordinate across various administrative entities . ATMEN nodes can trigger new measurements , query ongoing passive measurements or historical measurements stored on remote nodes , and coordinate the responses to make local decisions . ATMEN reduces wasted measurements by judiciously reusing measurements along three axes : spatial , temporal , and application . We describe the use of ATMEN for key Web applications such as performance based ranking of popular Web sites and availability of DNS servers on which most Web transactions are dependent . The evaluation of ATMEN is done using multiple network monitoring entities called Gigascopes installed across the USA , measurement data of a popular network application involving millions of users distributed across the Internet , and scores of clients to aid in gathering measurement information upon demand . Our results show that such a system can be built in a scalable fashion .

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

dns availability
performance-based ranking
reuse
triggered measurements


MemoSpace : a visualization tool for web navigation A central aspect of reducing orientation problems in web navigation concerns the design of adequate navigation aids . Visualization of users ' navigation path in form of a temporal-spatial template can function as external memory of users ' search history , thereby supporting the user to find previously visited sites , getting an overview of the search process and moreover , provide structure for the complex WorldWideWeb ( WWW ) environment . This paper presents an application for dynamic 2 and 3 dimensional visualizations of users ' navigation paths , called MemoSpace . In an explorative study , users behavior and subjective evaluation of a MemoSpace application was examined .

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


Preference-based selection of highly configurable web services A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configurations . Current approaches , such as WS-Agreement , describe Web services by enumerating the various possible service configurations , an inefficient approach when dealing with numerous service attributes with large value spaces . We model Web service configurations and associated prices and preferences more compactly using utility function policies , which also allows us to draw from multi-attribute decision theory methods to develop an algorithm for optimal service selection . In this paper , we present an OWL ontology for the specification of configurable Web service offers and requests , and a flexible and extensible framework for optimal service selection that combines declarative logic-based matching rules with optimization methods , such as linear programming . Assuming additive price\/preference functions , experimental results indicate that our algorithm introduces an overhead of only around 2 sec . ~ compared to random service selection , while giving optimal results . The overhead , as percentage of total time , decreases as the number of offers and configurations increase .

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

customisation
preference-based service selection


From actors , politicians , to CEOs : domain adaptation of relational extractors using a latent relational mapping We propose a method to adapt an existing relation extraction system to extract new relation types with minimum supervision . Our proposed method comprises two stages : learning a lower-dimensional projection between different relations , and learning a relational classifier for the target relation type with instance sampling . We evaluate the proposed method using a dataset that contains 2000 instances for 20 different relation types . Our experimental results show that the proposed method achieves a statistically significant macro-average F-score of 62.77 . Moreover , the proposed method outperforms numerous baselines and a previously proposed weakly-supervised relation extraction method .

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


Social search and discovery using a unified approach We explore new ways of improving a search engine using data from Web 2.0 applications such as blogs and social bookmarks . This data contains entities such as documents , people and tags , and relationships between them . We propose a simple yet effective method , based on faceted search , that treats all entities in a unified manner : returning all of them ( documents , people and tags ) on every search , and allowing all of them to be used as search terms . We describe an implementation of such a social search engine on the intranet of a large enterprise , and present large-scale experiments which verify the validity of our approach .

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

enterprise search
information search and retrieval


Utility analysis for topically biased PageRank PageRank is known to be an efficient metric for computing general document importance in the Web . While commonly used as a one-size-fits-all measure , the ability to produce topically biased ranks has not yet been fully explored in detail . In particular , it was still unclear to what granularity of `` topic '' the computation of biased page ranks makes sense . In this paper we present the results of a thorough quantitative and qualitative analysis of biasing PageRank on Open Directory categories . We show that the MAP quality of Biased PageRank generally increases with the ODP level up to a certain point , thus sustaining the usage of more specialized categories to bias PageRank on , in order to improve topic specific search .

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


Crosslanguage blog mining and trend visualisation People use weblogs to express thoughts , present ideas and share knowledge , therefore weblogs are extraordinarily valuable resources , amongs others , for trend analysis . Trends are derived from the chronological sequence of blog post count per topic . The comparison with a reference corpus allows qualitative statements over identified trends . We propose a crosslanguage blog mining and trend visualisation system to analyze blogs across languages and topics . The trend visualisation facilitates the identification of trends and the comparison with the reference news article corpus . To prove the correctness of our system we computed the correlation between trends in blogs and news articles for a subset of blogs and topics . The evaluation corroborated our hypothesis of a high correlation coefficient for these subsets and therefore the correctness of our system for different languages and topics is proven .

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

blog mining
crosslanguage
trend visualisation


Static approximation of dynamically generated Web pages Server-side programming is one of the key technologies that support today 's WWW environment . It makes it possible to generate Web pages dynamically according to a user 's request and to customize pages for each user . However , the flexibility obtained by server-side programming makes it much harder to guarantee validity and security of dynamically generated pages . To check statically the properties of Web pages generated dynamically by a server-side program , we develop a static program analysis that approximates the string output of a program with a context-free grammar . The approximation obtained by the analyzer can be used to check various properties of a server-side program and the pages it generates . To demonstrate the effectiveness of the analysis , we have implemented a string analyzer for the server-side scripting language PHP . The analyzer is successfully applied to publicly available PHP programs to detect cross-site scripting vulnerabilities and to validate pages they generate dynamically .

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

context-free grammars
cross-site scripting
html validation
server-side scripting
static analysis


Model checking cobweb protocols for verification of HTML frames behavior HTML documents composed of frames can be difficult to write correctly . We demonstrate a technique that can be used by authors manually creating HTML documents ( or by document editors ) to verify that complex frame construction exhibits the intended behavior when browsed . The method is based on model checking ( an automated program verification technique ) , and on temporal logic specifications of expected frames behavior . We show how to model the HTML frames source as a CobWeb protocol , related to the Trellis model of hypermedia documents . We show how to convert the CobWeb protocol to input for a model checker , and discuss several ways for authors to create the necessary behavior specifications . Our solution allows Web documents to be built containing a large number of frames and content pages interacting in complex ways . We expect such Web structures to be more useful in `` literary '' hypermedia than for Web `` sites '' used as interfaces to organizational information or databases .

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

frames
html
model checking
temporal logic

browsing semantics
formal semantics
literary hypertext


Mining clickthrough data for collaborative web search This paper is to investigate the group behavior patterns of search activities based on Web search history data , i.e. , clickthrough data , to boost search performance . We propose a Collaborative Web Search ( CWS ) framework based on the probabilistic modeling of the co-occurrence relationship among the heterogeneous web objects : users , queries , and Web pages . The CWS framework consists of two steps : ( 1 ) a cube-clustering approach is put forward to estimate the semantic cluster structures of the Web objects ; ( 2 ) Web search activities are conducted by leveraging the probabilistic relations among the estimated cluster structures . Experiments on a real-world clickthrough data set validate the effectiveness of our CWS approach .

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

clickthrough data
collaborative web search


EPCI : extracting potentially copyright infringement texts from the web In this paper , we propose a new system extracting potentially copyright infringement texts from the Web , called EPCI . EPCI extracts them in the following way : ( 1 ) generating a set of queries based on a given copyright reserved seed-text , ( 2 ) putting every query to search engine API , ( 3 ) gathering the search result Web pages from high ranking until the similarity between the given seed-text and the search result pages becomes less than a given threshold value , and ( 4 ) merging all the gathered pages , then re-ranking them in the order of their similarity . Our experimental result using 40 seed-texts shows that EPCI is able to extract 132 potentially copyright infringement Web pages per a given copyright reserved seed-text with 94 % precision in average .

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

copy detection
information retrieval
information search and retrieval


Online mining of frequent query trees over XML data streams In this paper , we proposed an online algorithm , called FQT-Stream ( Frequent Query Trees of Streams ) , to mine the set of all frequent tree patterns over a continuous XML data stream . A new numbering method is proposed to represent the tree structure of a XML query tree . An effective sub-tree numeration approach is developed to extract the essential information from the XML data stream . The extracted information is stored in an effective summary data structure . Frequent query trees are mined from the current summary data structure by a depth-first-search manner .

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

data streams
frequent query trees
online mining
xml


Near real time information mining in multilingual news This paper presents a near real-time multilingual news monitoring and analysis system that forms the backbone of our research work . The system integrates technologies to address the problems related to information extraction and analysis of open source intelligence on the World Wide Web . By chaining together different techniques in text mining , automated machine learning and statistical analysis , we can automatically determine who , where and , to a certain extent , what is being reported in news articles .

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

automated media monitoring
information mining and analysis
multi-linguality
open source text


Opinion observer : analyzing and comparing opinions on the Web The Web has become an excellent source for gathering consumer opinions . There are now numerous Web sites containing such opinions , e.g. , customer reviews of products , forums , discussion groups , and blogs . This paper focuses on online customer reviews of products . It makes two contributions . First , it proposes a novel framework for analyzing and comparing consumer opinions of competing products . A prototype system called Opinion Observer is also implemented . The system is such that with a single glance of its visualization , the user is able to clearly see the strengths and weaknesses of each product in the minds of consumers in terms of various product features . This comparison is useful to both potential customers and product manufacturers . For a potential customer , he\/she can see a visual side-by-side and feature-by-feature comparison of consumer opinions on these products , which helps him\/her to decide which product to buy . For a product manufacturer , the comparison enables it to easily gather marketing intelligence and product benchmarking information . Second , a new technique based on language pattern mining is proposed to extract product features from Pros and Cons in a particular type of reviews . Such features form the basis for the above comparison . Experimental results show that the technique is highly effective and outperform existing methods significantly .

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

information extraction
opinion analysis
sentiment analysis


Learning information intent via observation Users in an organization frequently request help by sending request messages to assistants that express information intent : an intention to update data in an information system . Human assistants spend a significant amount of time and effort processing these requests . For example , human resource assistants process requests to update personnel records , and executive assistants process requests to schedule conference rooms or to make travel reservations . To process the intent of a request , assistants read the request and then locate , complete , and submit a form that corresponds to the expressed intent . Automatically or semi-automatically processing the intent expressed in a request on behalf of an assistant would ease the mundane and repetitive nature of this kind of work . For a well-understood domain , a straightforward application of natural language processing techniques can be used to build an intelligent form interface to semi-automatically process information intent request messages . However , high performance parsers are based on machine learning algorithms that require a large corpus of examples that have been labeled by an expert . The generation of a labeled corpus of requests is a major barrier to the construction of a parser . In this paper , we investigate the construction of a natural language processing system and an intelligent form system that observes an assistant processing requests . The intelligent form system then generates a labeled training corpus by interpreting the observations . This paper reports on the measurement of the performance of the machine learning algorithms based on real data . The combination of observations , machine learning and interaction design produces an effective intelligent form interface based on natural language processing .

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

domestication
interaction styles
weak labeling


SEMPL : a semantic portal Semantic Web technology is intended for the retrieval , collection , and analysis of meaningful data with significant automation afforded by machine understandability of data ( 1 ) . As one illustration of semantic web technology in action , we present SEMPL , a semantic web portal for the Large Scale Distributed Information Systems lab ( LSDIS ) at the University of Georgia . SEMPL , which is powered by a state of the art commercial system , Semagix Freedom ( 7 ) , uses an ontology-driven approach to provide semantic browsing , linking , and contextual querying of content within the portal . By using the ontology based information integration technique , SEMPL can specify the context of a particular piece of research information , annotate web pages , and provide links to semantically related areas enabling a rich contextual retrieval of information .

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


Quicklink selection for navigational query results Quicklinks for a website are navigational shortcuts displayed below the website homepage on a search results page , and that let the users directly jump to selected points inside the website . Since the real-estate on a search results page is constrained and valuable , picking the best set of quicklinks to maximize the benefits for a majority of the users becomes an important problem for search engines . Using user browsing trails obtained from browser toolbars , and a simple probabilistic model , we formulate the quicklink selection problem as a combinatorial optimizaton problem . We first demonstrate the hardness of the objective , and then propose an algorithm that is provably within a factor of 1-1 \/ e of the optimal . We also propose a different algorithm that works on trees and that can find the optimal solution ; unlike the previous algorithm , this algorithm can incorporate natural constraints on the set of chosen quicklinks . The efficacy of our methods is demonstrated via empirical results on both a manually labeled set of websites and a set for which quicklink click-through rates for several webpages were obtained from a real-world search engine .

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

miscellaneous
navigational queries
toolbar data


A combinatorial allocation mechanism with penalties for banner advertising Most current banner advertising is sold through negotiation thereby incurring large transaction costs and possibly suboptimal allocations . We propose a new automated system for selling banner advertising . In this system , each advertiser specifies a collection of host webpages which are relevant to his product , a desired total quantity of impressions on these pages , and a maximum per-impression price . The system selects a subset of advertisers as ` winners ' and maps each winner to a set of impressions on pages within his desired collection . The distinguishing feature of our system as opposed to current combinatorial allocation mechanisms is that , mimicking the current negotiation system , we guarantee that winners receive at least as many advertising opportunities as they requested or else receive ample compensation in the form of a monetary payment by the host . Such guarantees are essential in markets like banner advertising where a major goal of the advertising campaign is developing brand recognition . As we show , the problem of selecting a feasible subset of advertisers with maximum total value is inapproximable . We thus present two greedy heuristics and discuss theoretical techniques to measure their performances . Our first algorithm iteratively selects advertisers and corresponding sets of impressions which contribute maximum marginal per-impression profit to the current solution . We prove a bi-criteria approximation for this algorithm , showing that it generates approximately as much value as the optimum algorithm on a slightly harder problem . However , this algorithm might perform poorly on instances in which the value of the optimum solution is quite large , a clearly undesirable failure mode . Hence , we present an adaptive greedy algorithm which again iteratively selects advertisers with maximum marginal per-impression profit , but additionally reassigns impressions at each iteration . For this algorithm , we prove a structural approximation result , a newly defined framework for evaluating heuristics ( 10 ) . We thereby prove that this algorithm has a better performance guarantee than the simple greedy algorithm .

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

combinatorial auctions
general
internet advertising
supply guarantee


Detecting Wikipedia vandalism with active learning and statistical language models This paper proposes an active learning approach using language model statistics to detect Wikipedia vandalism . Wikipedia is a popular and influential collaborative information system . The collaborative nature of authoring , as well as the high visibility of its content , have exposed Wikipedia articles to vandalism . Vandalism is defined as malicious editing intended to compromise the integrity of the content of articles . Extensive manual efforts are being made to combat vandalism and an automated approach to alleviate the laborious process is needed . This paper builds statistical language models , constructing distributions of words from the revision history of Wikipedia articles . As vandalism often involves the use of unexpected words to draw attention , the fitness ( or lack thereof ) of a new edit when compared with language models built from previous versions may well indicate that an edit is a vandalism instance . In addition , the paper adopts an active learning model to solve the problem of noisy and incomplete labeling of Wikipedia vandalism . The Wikipedia domain with its revision histories offers a novel context in which to explore the potential of language models in characterizing author intention . As the experimental results presented in the paper demonstrate , these models hold promise for vandalism detection .

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

active learning
statistical language models
vandalism
wikipedia


A comparative analysis of web and peer-to-peer traffic Peer-to-Peer ( P2P ) applications continue to grow in popularity , and have reportedly overtaken Web applications as the single largest contributor to Internet traffic . Using traces collected from a large edge network , we conduct an extensive analysis of P2P traffic , compare P2P traffic with Web traffic , and discuss the implications of increased P2P traffic . In addition to studying the aggregate P2P traffic , we also analyze and compare the two main constituents of P2P traffic in our data , namely BitTorrent and Gnutella . The results presented in the paper may be used for generating synthetic workloads , gaining insights into the functioning of P2P applications , and developing network management strategies . For example , our results suggest that new models are necessary for Internet traffic . As a first step , we present flow-level distributional models for Web and P2P traffic that may be used in network simulation and emulation experiments .

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

model development
network protocols
peer-to-peer
traffic characterization
traffic models


Collaborative filtering for orkut communities : discovery of user latent behavior Users of social networking services can connect with each other by forming communities for online interaction . Yet as the number of communities hosted by such websites grows over time , users have even greater need for effective community recommendations in order to meet more users . In this paper , we investigate two algorithms from very different domains and evaluate their effectiveness for personalized community recommendation . First is association rule mining ( ARM ) , which discovers associations between sets of communities that are shared across many users . Second is latent Dirichlet allocation ( LDA ) , which models user-community co-occurrences using latent aspects . In comparing LDA with ARM , we are interested in discovering whether modeling low-rank latent structure is more effective for recommendations than directly mining rules from the observed data . We experiment on an Orkut data set consisting of 492,104 users and 118,002 communities . Our empirical comparisons using the top-k recommendations metric show that LDA performs consistently better than ARM for the community recommendation task when recommending a list of 4 or more communities . However , for recommendation lists of up to 3 communities , ARM is still a bit better . We analyze examples of the latent information learned by LDA to explain this finding . To efficiently handle the large-scale data set , we parallelize LDA on distributed computers and demonstrate our parallel implementation 's scalability with varying numbers of machines .

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

association rule mining
collaborative filtering


Towards a theory model for product search With the growing pervasiveness of the Internet , online search for products and services is constantly increasing . Most product search engines are based on adaptations of theoretical models devised for information retrieval . However , the decision mechanism that underlies the process of buying a product is different than the process of locating relevant documents or objects . We propose a theory model for product search based on expected utility theory from economics . Specifically , we propose a ranking technique in which we rank highest the products that generate the highest surplus , after the purchase . In a sense , the top ranked products are the `` best value for money '' for a specific user . Our approach builds on research on `` demand estimation '' from economics and presents a solid theoretical foundation on which further research can build on . We build algorithms that take into account consumer demographics , heterogeneity of consumer preferences , and also account for the varying price of the products . We show how to achieve this without knowing the demographics or purchasing histories of individual consumers but by using aggregate demand data . We evaluate our work , by applying the techniques on hotel search . Our extensive user studies , using more than 15,000 user-provided ranking comparisons , demonstrate an overwhelming preference for the rankings generated by our techniques , compared to a large number of existing strong state-of-the-art baselines .

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

consumer surplus
information search and retrieval
text mining
user-generated content


Long distance wireless mesh network planning : problem formulation and solution Several research efforts as well as deployments have chosen IEEE802 .11 as a low-cost , long-distance access technology to bridge the digital divide . In this paper , we consider the important issue of planning such networks to the minimize system cost . This is a non-trivial task since it involves several sets of variables : the network topology , tower heights , antenna types to be used and the irorientations , and radio transmit powers . The task is further complicated due to the presence of network performance constraints , and the inter-dependence among the variables . Our first contribution in this paper is the formulation of this problem in terms of the variables , constraints and the optimization criterion . Our second contribution is in identifying the dependencies among the variables and breaking-down the problem into four tractable sub-parts . In this process , we extensively use domain knowledge to strike a balance between tractability and practicality . We have evaluated the proposed algorithms using random input sets as well as real-life instances with success . We have been able to show detailed planning of network topology , required tower heights , antenna types , and transmit powers for the Ashwini project , a long distance WiFi network under deployment in Andhra Pradesh , India , In this case , we are able to achieve within 2 % additional cost of a lower bound estimate .

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

802.11 mesh networks
long-distance wifi
low cost networking
rural connectivity


Collaborative location and activity recommendations with GPS history data With the increasing popularity of location-based services , such as tour guide and location-based social network , we now have accumulated many location data on the Web . In this paper , we show that , by using the location data based on GPS and users ' comments at various locations , we can discover interesting locations and possible activities that can be performed there for recommendations . Our research is highlighted in the following location-related queries in our daily life : 1 ) if we want to do something such as sightseeing or food-hunting in a large city such as Beijing , where should we go ? 2 ) If we have already visited some places such as the Bird 's Nest building in Beijing 's Olympic park , what else can we do there ? By using our system , for the first question , we can recommend her to visit a list of interesting locations such as Tiananmen Square , Bird 's Nest , etc. . For the second question , if the user visits Bird 's Nest , we can recommend her to not only do sightseeing but also to experience its outdoor exercise facilities or try some nice food nearby . To achieve this goal , we first model the users ' location and activity histories that we take as input . We then mine knowledge , such as the location features and activity-activity correlations from the geographical databases and the Web , to gather additional inputs . Finally , we apply a collective matrix factorization method to mine interesting locations and activities , and use them to recommend to the users where they can visit if they want to perform some specific activities and what they can do if they visit some specific places . We empirically evaluated our system using a large GPS dataset collected by 162 users over a period of 2.5 years in the real-world . We extensively evaluated our system and showed that our system can outperform several state-of-the-art baselines .

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


Improvement of HITS-based algorithms on web documents In this paper , we present two ways to improve the precision of HITS-based algorithms on Web documents . First , by analyzing the limitations of current HITS-based algorithms , we propose a new weighted HITS-based method that assigns appropriate weights to in-links of root documents . Then , we combine content analysis with HITS-based algorithms and study the effects of four representative relevance scoring methods , VSM , Okapi , TLS , and CDR , using a set of broad topic queries . Our experimental results show that our weighted HITS-based method performs significantly better than Bharat 's improved HITS algorithm . When we combine our weighted HITS-based method or Bharat 's HITS algorithm with any of the four relevance scoring methods , the combined methods are only marginally better than our weighted HITS-based method . Between the four relevance-scoring methods , there is no significant quality difference when they are combined with a HITS-based algorithm .

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

general
hits-based algorithms
information retrieval


Constructing extensible XQuery mappings Constructing and maintaining semantic mappings are necessary but troublesome in data sharing systems . While most current work focuses on seeking automated techniques to solve this problem , this paper proposes a combination model for constructing exten-sible mappings between XML schemas . In our model , complex global mappings are constructed by first defining simple atomic mappings for each target schema element , and then combining them using a few basic operators . At the same time , we provide automated support for constructing such combined mappings .

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

extensibility
heterogeneous databases
mapping


Fine-grained privilege separation for web applications We present a programming model for building web applications with security properties that can be confidently verified during a security review . In our model , applications are divided into isolated , privilege-separated components , enabling rich security policies to be enforced in a way that can be checked by reviewers . In our model , the web framework enforces privilege separation and isolation of web applications by requiring the use of an object-capability language and providing interfaces that expose limited , explicitly-specified privileges to application components . This approach restricts what each component of the application can do and quarantines buggy or compromised code . It also provides a way to more safely integrate third-party , less-trusted code into a web application . We have implemented a prototype of this model based upon the Java Servlet framework and used it to build a webmail application . Our experience with this example suggests that the approach is viable and helpful at establishing reviewable application-specific security properties .

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


An investigation of cloning in web applications Cloning ( ad hoc reuse by duplication of design or code ) speeds up development , but also hinders future maintenance . Cloning also hints at reuse opportunities that , if exploited systematically , might have positive impact on development and maintenance productivity . Unstable requirements and tight schedules pose unique challenges for Web Application engineering that encourage cloning . We are conducting a systematic study of cloning in Web Applications of different sizes , developed using a range of Web technologies , and serving diverse purposes . Our initial results show cloning rates up to 63 % in both newly developed and already maintained Web Applications . Expected contribution of this work is two-fold : ( 1 ) to confirm potential benefits of reuse-based methods in addressing clone related problems of Web engineering , and ( 2 ) to create a framework of metrics and presentation views to be used in other similar studies .

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

clone analysis
clone metrics
clones
software maintenance
software reuse


Diversified SCM standard for the Japanese retail industry In this paper , we present the concept of a diversified SCM ( supply chain management ) standard and distributed hub architecture which were used in B2B experiments for the Japanese retail industry . The conventional concept of B2B standards develops a single ideal set of business transactions to be supported . In contrast , our concept allows a wide range of diverse business transaction patterns necessary for industry supply chains . An industry develops a standard SCM model that partitions the whole supply chain into several transaction segments , each of which provides alternative business transaction patterns . For B2B collaboration , companies must agree on a collaboration configuration , which chooses the transaction alternatives from each segment . To support the development of a B2B system that executes an agreed collaboration , we introduce an SOA ( service oriented architecture ) based pattern called a distributed hub architecture . As a hub of B2B collaboration , it includes a complete set of services that can process every possible business transaction included in a standard SCM model . However , it does not function as a centralized service that coordinates participants . Instead , it is deployed on every participant and executes the assigned part of the supply chain collaboratively with other distributed hubs . Based on this concept , we analyzed actual business transactions in the Japanese retail industry and developed a standard SCM model , which represents more than a thousand possible transaction patterns . Based on the model , we developed an experimental system for the Japanese retail industry . The demonstration experiment involved major players in the industry including one of the largest general merchandise stores , one of the largest wholesalers , and major manufacturers in Japan .

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

b2b collaboration
retail industry
soa
supply chain management

business process management
ebxml
electronic data interchange
web services


Liveclassifier : creating hierarchical text classifiers through web corpora Many Web information services utilize techniques of information extraction ( IE ) to collect important facts from the Web . To create more advanced services , one possible method is to discover thematic information from the collected facts through text classification . However , most conventional text classification techniques rely on manual-labelled corpora and are thus ill-suited to cooperate with Web information services with open domains . In this work , we present a system named LiveClassifier that can automatically train classifiersthrough Web corpora based on user-defined topic hierarchies . Due to its flexibility and convenience , LiveClassifier can be easily adapted for various purposes . New Web information services can be created to fully exploit it ; human users can use it to create classifiers for their personal applications . The effectiveness of classifiers created by LiveClassifier is well supportedby empirical evidence .

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

information storage and retrieval
topic hierarchy
web mining


Three theses of representation in the semantic web The Semantic Web is vitally dependent on a formal meaning for the constructs of its languages . For Semantic Web languages to work well together their formal meanings must employ a common view ( or thesis ) of representation , otherwise it will not be possible to reconcile documents written in different languages . The thesis of representation underlying RDF and RDFS is particularly troublesome in this regard , as it has several unusual aspects , both semantic and syntactic . A more-standard thesis of representation would result in the ability to reuse existing results and tools in the Semantic Web .

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


Max algorithms in crowdsourcing environments Our work investigates the problem of retrieving the maximum item from a set in crowdsourcing environments . We first develop parameterized families of max algorithms , that take as input a set of items and output an item from the set that is believed to be the maximum . Such max algorithms could , for instance , select the best Facebook profile that matches a given person or the best photo that describes a given restaurant . Then , we propose strategies that select appropriate max algorithm parameters . Our framework supports various human error and cost models and we consider many of them for our experiments . We evaluate under many metrics , both analytically and via simulations , the tradeoff between three quantities : ( 1 ) quality , ( 2 ) monetary cost , and ( 3 ) execution time . Also , we provide insights on the effectiveness of the strategies in selecting appropriate max algorithm parameters and guidelines for choosing max algorithms and strategies for each application .

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

human computation
miscellaneous
plurality voting
vote aggregation
worker models


Profiles for the situated web The World Wide Web is evolving into a medium that will soon make it possible for conceiving and implementing situation-aware services . A situation-aware or situated web application is one that renders the user with an experience ( content , interaction and presentation ) that is so tailored to his\/her current situation . This requires the facts and opinions regarding the context to be communicated to the server by means of a profile , which is then applied against the description of the application objects at the server in order to generate the required experience . This paper discusses a profiles view of the situated web architecture and analyzes the key technologies and capabilities that enable them . We conclude that trusted frameworks wherein rich vocabularies describing users and their context , applications and documents , along with rules for processing them , are critical elements of such architectures .

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

cc/pp
representations
situated-aware applications
vocabulary
xml


TotalRank : ranking without damping PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor α that spreads part of the rank . The choice of α is eminently empirical , but most applications use α = 0.85 ; nonetheless , the selection of α is critical , and some believe that link farms may use this choice adversarially . Recent results ( 1 ) prove that the PageRank of a page is a rational function of α , and that this function can be approximated quite efficiently : this fact can be used to define a new form of ranking , TotalRank , that averages PageRanks over all possible α 's . We show how this rank can be computed efficiently , and provide some preliminary experimental results on its quality and comparisons with PageRank .

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

discrete mathematics
kendall's τ
probability and statistics


XSLT by example XQBE ( XQuery By Example , ( 1 ) ) , a visual dialect of XQuery , uses hierarchical structures to express transformations between XML documents . XSLT , the standard transformation language for XML , is increasingly popular among programmers and Web developers for separating the application and presentation layers of Web applications . However , its syntax and its rule-based execution paradigm are rather intricate , and the number of XSLT experts is limited ; the availability of easier `` dialects '' could be extremely valuable and may contribute to the adoption of XML for developing data-centered Web applications and services . With this motivation in mind , we adapted XQBE to serve as a visual interface for expressing XML-to-XML transformations and generate the XSLT code that performs such transformations .

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

data manipulation languages
design tools and techniques
semi-structured data
visual query languages


SLL : running my web services on your WS platforms Today , the choice for a particular programming language limits the alternative products that can be used to deploy the program . For instance , a Java program must be executed using a Java VM . This limitation is particularly harmful for the emergence of a new programming paradigm like SOA and Web Services because platforms for new innovative programming languages are typically not as stable and mature as the established platforms for traditional programming paradigms . The purpose of this work is to break the strong ties between programming languages and runtime environments and thus make it possible to innovate at both ends independently . Thereby , the specific focus is on Web Services and Service-Oriented Architectures ; focusing on this domain makes it possible to achieve this goal with affordable efforts . The key idea is to introduce a Service Language Layer ( SLL ) which gives a high-level abstraction of a service-oriented program and which can easily and efficiently be executed on alternative Web Services platforms .

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

decoupling
transformation
xml
xml-based service language


Efficient web change monitoring with page digest The Internet and the World Wide Web have enabled a publishing explosion of useful online information , which has produced the unfortunate side effect of information overload : it is increasingly difficult for individuals to keep abreast of fresh information . In this paper we describe an approach for building a system for efficiently monitoring changes to Web documents . This paper has three main contributions . First , we present a coherent framework that captures different characteristics of Web documents . The system uses the Page Digest encoding to provide a comprehensive monitoring system for content , structure , and other interesting properties of Web documents . Second , the Page Digest encoding enables improved performance for individual page monitors through mechanisms such as short-circuit evaluation , linear time algorithms for document and structure similarity , and data size reduction . Finally , we develop a collection of sentinel grouping techniques based on the Page Digest encoding to reduce redundant processing in large-scale monitoring systems by grouping similar monitoring requests together . We examine how effective these techniques are over a wide range of parameters and have seen an order of magnitude speed up over existing Web-based information monitoring systems .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 storage
scalability
systems and software
web document monitoring


Visualising student tracking data to support instructors in web-based distance education This paper presents a novel approach of using web log data generated by course management systems ( CMS ) to help instructors become aware of what is happening in distance learning classes . Specifically , techniques from Information Visualization are used to graphically render complex , multidimensional student tracking data collected by CMS . A system , called CourseVis , illustrates the proposed approach . Graphical representations from the use of CourseVis to visualise data from a java on-line distance course ran with WebCT are presented . Findings from the evaluation of CourseVis are presented , and it is argued that CourseVis can help teachers become aware of some social , behavioural , and cognitive aspects related to distance learners . Using graphical representations of student tracking data , instructors can identify tendencies in their classes , or quickly discover individuals that need special attention .

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

information visualization
student tracking


Equip tourists with knowledge mined from travelogues With the prosperity of tourism and Web 2.0 technologies , more and more people have willingness to share their travel experiences on the Web ( e.g. , weblogs , forums , or Web 2.0 communities ) . These so-called travelogues contain rich information , particularly including location-representative knowledge such as attractions ( e.g. , Golden Gate Bridge ) , styles ( e.g. , beach , history ) , and activities ( e.g. , diving , surfing ) . The location-representative information in travelogues can greatly facilitate other tourists ' trip planning , if it can be correctly extracted and summarized . However , since most travelogues are unstructured and contain much noise , it is difficult for common users to utilize such knowledge effectively . In this paper , to mine location-representative knowledge from a large collection of travelogues , we propose a probabilistic topic model , named as Location-Topic model . This model has the advantages of ( 1 ) differentiability between two kinds of topics , i.e. , local topics which characterize locations and global topics which represent other common themes shared by various locations , and ( 2 ) representation of locations in the local topic space to encode both location-representative knowledge and similarities between locations . Some novel applications are developed based on the proposed model , including ( 1 ) destination recommendation for on flexible queries , ( 2 ) characteristic summarization for a given destination with representative tags and snippets , and ( 3 ) identification of informative parts of a travelogue and enriching such highlights with related images . Based on a large collection of travelogues , the proposed framework is evaluated using both objective and subjective evaluation methods and shows promising results .

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

probabilistic topic model
recommendation


Sig . ma : live views on the web of data We demonstrate Sig . ma , both a service and an end user application to access the Web of Data as an integrated information space . Sig . ma uses an holistic approach in which large scale semantic web indexing , logic reasoning , data aggregation heuristics , ad hoc ontology consolidation , external services and responsive user interaction all play together to create rich entity descriptions . These consolidated entity descriptions then form the base for embeddable data mashups , machine oriented services as well as data browsing services . Finally , we discuss Sig . ma 's peculiar characteristics and report on lessions learned and ideas it inspires .

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


Enhancing diversity , coverage and balance for summarization through structure learning Document summarization plays an increasingly important role with the exponential growth of documents on the Web . Many supervised and unsupervised approaches have been proposed to generate summaries from documents . However , these approaches seldom simultaneously consider summary diversity , coverage , and balance issues which to a large extent determine the quality of summaries . In this paper , we consider extract-based summarization emphasizing the following three requirements : 1 ) diversity in summarization , which seeks to reduce redundancy among sentences in the summary ; 2 ) sufficient coverage , which focuses on avoiding the loss of the document 's main information when generating the summary ; and 3 ) balance , which demands that different aspects of the document need to have about the same relative importance in the summary . We formulate the extract-based summarization problem as learning a mapping from a set of sentences of a given document to a subset of the sentences that satisfies the above three requirements . The mapping is learned by incorporating several constraints in a structure learning framework , and we explore the graph structure of the output variables and employ structural SVM for solving the resulted optimization problem . Experiments on the DUC2001 data sets demonstrate significant performance improvements in terms of F1 and ROUGE metrics .

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

balance
coverage
diversity
structural svm
summarization


Quality driven web services composition The process-driven composition of Web services is emerging as a promising approach to integrate business applications within and across organizational boundaries . In this approach , individual Web services are federated into composite Web services whose business logic is expressed as a process model . The tasks of this process model are essentially invocations to functionalities offered by the underlying component services . Usually , several component services are able to execute a given task , although with different levels of pricing and quality . In this paper , we advocate that the selection of component services should be carried out during the execution of a composite service , rather than at design-time . In addition , this selection should consider multiple criteria ( e.g. , price , duration , reliability ) , and it should take into account global constraints and preferences set by the user ( e.g. , budget constraints ) . Accordingly , the paper proposes a global planning approach to optimally select component services during the execution of a composite service . Service selection is formulated as an optimization problem which can be solved using efficient linear programming methods . Experimental results show that this global planning approach outperforms approaches in which the component services are selected individually for each task in a composite service .

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


Optimizing scoring functions and indexes for proximity search in type-annotated corpora We introduce a new , powerful class of text proximity queries : find an instance of a given `` answer type '' ( person , place , distance ) near `` selector '' tokens matching given literals or satisfying given ground predicates . An example query is type = distance NEAR Hamburg Munich . Nearness is defined as a flexible , trainable parameterized aggregation function of the selectors , their frequency in the corpus , and their distance from the candidate answer . Such queries provide a key data reduction step for information extraction , data integration , question answering , and other text-processing applications . We describe the architecture of a next-generation information retrieval engine for such applications , and investigate two key technical problems faced in building it . First , we propose a new algorithm that estimates a scoring function from past logs of queries and answer spans . Plugging the scoring function into the query processor gives high accuracy : typically , an answer is found at rank 2-4 . Second , we exploit the skew in the distribution over types seen in query logs to optimize the space required by the new index structures required by our system . Extensive performance studies with a 10GB , 2-million document TREC corpus and several hundred TREC queries show both the accuracy and the efficiency of our system . From an initial 4.3 GB index using 18,000 types from WordNet , we can discard 88 % of the space , while inflating query times by a factor of only 1.9 . Our final index overhead is only 20 % of the total index space needed .

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


Supporting end-users in the creation of dependable web clips Web authoring environments enable end-users to create applications that integrate information from other web sources . Users can create web sites that include built-in components to dynamically incorporate , for example , weather information , stock-quotes , or the latest news from different web sources . Recent surveys conducted among end-users have indicated an increasing interest in creating such applications . Unfortunately , web authoring environments do not provide support beyond a limited set of built-in components . This work addresses this limitation by providing end-user support for `` clipping '' information from a target web site to incorporate it into the end-user site . The support consists of a mechanism to identify the target clipping with multiple markers to increase robustness , and a dynamic assessment of the retrieved information to quantify its reliability . The clipping approach has been integrated as a feature into a popular web authoring tool on which we present the results of two preliminary studies .

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

dependability
end-users
interaction styles
web authoring tools


DemIL : an online interaction language between citizen and government Electronic democracy should provide information and service for the citizens on the Internet , allowing room for debate , participation and electronic voting . The languages being adopted by mass communication means , especially Reality Shows , are efficient and encourage public participation in decision-making . This paper discusses a citizen-government interaction language intended to facilitate citizen participation in the government 's decisions . An e-Democracy Model for people participation through web-based technologies is conceived . This model specifies the syntax of an Democracy Interaction Language , a DemIL . Such language incorporates characteristics of Reality Show Formats , and it is the back-end of a web-interface project in the domain researched . The study of case Participative Budget of Brazil represents the language proposed .

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

e-democracy
e-government
interface
user interfaces


Factal : integrating deep web based on trust and relevance We demonstrate `` Factal '' -- a system for integrating deep web sources . Factal is based on the recently introduced source selection method `` SourceRank '' ; which is a measure of trust and relevance based on the agreement between the sources . SourceRank selects popular and trustworthy sources from autonomous and open collections like the deep web . This trust and popularity awareness distinguishes Factal from the existing systems like Google Product Search . Factal selects and searches active online databases on multiple domains . The demonstration scenarios include improved trustworthiness , relevance of results , and comparison shopping . We believe that by incorporating effective source selection based on the SourceRank , Factal demonstrates a significant step towards a deep-web-scale integration system .

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


Protocol-aware matching of web service interfaces for adapter development With the rapid growth in the number of online Web services , the problem of service adaptation has received significant attention . In matching and adaptation , the functional description of services including interface and data as well as behavioral descriptions are important . Existing work on matching and adaptation focuses only on one aspect . In this paper , we present a semi-automated matching approach that considers both service descriptions . We introduce two protocol-aware service interface matching algorithms , i.e. depth-based interface matching and iterative reference-based interface matching . These algorithms refine the results of interface matching by incorporating the ordering constraints imposed by business protocol definitions on service operations . We have implemented a prototype and performed experiments using the specification of synthetic and real-world Web services . Experiments show that the proposed approaches lead to a significant improvement in the quality of matching between services .

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


Mining search engine query logs for query recommendation This paper presents a simple and intuitive method for mining search engine query logs to get fast query recommendations on a large scale industrial strength search engine . In order to get a more comprehensive solution , we combine two methods together . On the one hand , we study and model search engine users ' sequential search behavior , and interpret this consecutive search behavior as client-side query refinement , that should form the basis for the search engine 's own query refinement process . On the other hand , we combine this method with a traditional content based similarity method to compensate for the high sparsity of real query log data , and more specifically , the shortness of most query sessions . To evaluate our method , we use one hundred day worth query logs from SINA ' search engine to do off-line mining . Then we analyze three independent editors evaluations on a query test set . Based on their judgement , our method was found to be effective for finding related queries , despite its simplicity . In addition to the subjective editors ' rating , we also perform tests based on actual anonymous user search sessions .

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


TCOZ approach to semantic web services design Complex Semantic Web ( SW ) services may have intricate data state , autonomous process behavior and concurrent interactions . The design of such SW service systems requires precise and powerful modelling techniques to capture not only the ontology domain properties but also the services ' process behavior and functionalities . In this paper we apply an integrated formal modeling language , Timed Communicating Object Z ( TCOZ ) , to design SW services . Furthermore , the paper presents the development of the systematic translation rules and tools which can automatically extract the SW ontology and services semantic markup from the formal TCOZ design model .

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


Information transfer in social media Recent research has explored the increasingly important role of social media by examining the dynamics of individual and group behavior , characterizing patterns of information diffusion , and identifying influential individuals . In this paper we suggest a measure of causal relationships between nodes based on the information -- theoretic notion of transfer entropy , or information transfer . This theoretically grounded measure is based on dynamic information , captures fine -- grain notions of influence , and admits a natural , predictive interpretation . Networks inferred by transfer entropy can differ significantly from static friendship networks because most friendship links are not useful for predicting future dynamics . We demonstrate through analysis of synthetic and real-world data that transfer entropy reveals meaningful hidden network structures . In addition to altering our notion of who is influential , transfer entropy allows us to differentiate between weak influence over large groups and strong influence over small groups .

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

causality
point processes
prediction
social networks
spam


SPath : a path language for XML schema XML is increasingly being used as a typed data format , and therefore it becomes more important to gain access to the type system ; very often this is an XML Schema . The XML Schema Path Language ( SPath ) presented in this paper provides access to XML Schema components by extending the well-known XPath language to also include the domain of XML Schemas . Using SPath , XML developers gain access to XML Schemas and thus can more easily develop software which is type - or schema-aware , and thus more robust .

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


Web customization using behavior-based remote executing agents ReAgents are remotely executing agents that customize Web browsing for non-standard clients . A reAgent is essentially a one-shot '' mobile agent that acts as an extension of a client dynamically launched by the client to run on its behalf at a remote more advantageous location . ReAgents simplify the use of mobile agent technology by transparently handling data migration and run-time network communications and provide a general interface for programmers to more easily implement their application-specific customizing logic . This is made possible by the identification of useful remote behaviors i.e. common patterns of actions that exploit the ability to process and communicate remotely . Examples of such behaviors are transformers monitors cachers and collators . In this paper we identify a set ofuseful reAgent behaviors for interacting with Web services via astandard browser describe how to program and use reAgents and show that the overhead of using reAgents is low and outweighed by its benefits .

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

dynamic deployment
remote agents
software architectures


Behavioral profiles for advanced email features We examine the behavioral patterns of email usage in a large-scale enterprise over a three-month period . In particular , we focus on two main questions : ( Q1 ) what do replies depend on ? and ( Q2 ) what is the gain of augmenting contacts through the friends of friends from the email social graph ? For Q1 , we identify and evaluate the significance of several factors that affect the reply probability and the email response time . We find that all factors of our considered set are significant , provide their relative ordering , and identify the recipient list size , and the intensity of email communication between the correspondents as the dominant factors . We highlight various novel threshold behaviors and provide support for existing hypotheses such as that of the least-effort reply . For Q2 , we find that the number of new contacts extracted from the friends-of-friends relationships amounts to a large number , but which is still a limited portion of the total enterprise size . We believe that our results provide significant insights towards informed design of advanced email features , including those of social-networking type .

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


Defeating script injection attacks with browser-enforced embedded policies Web sites that accept and display content such as wiki articles or comments typically filter the content to prevent injected script code from running in browsers that view the site . The diversity of browser rendering algorithms and the desire to allow rich content make filtering quite difficult , however , and attacks such as the Samy and Yamanner worms have exploited filtering weaknesses . This paper proposes a simple alternative mechanism for preventing script injection called Browser-Enforced Embedded Policies ( BEEP ) . The idea is that a web site can embed a policy in its pages that specifies which scripts are allowed to run . The browser , which knows exactly when it will run a script , can enforce this policy perfectly . We have added BEEP support to several browsers , and built tools to simplify adding policies to web applications . We found that supporting BEEP in browsers requires only small and localized modifications , modifying web applications requires minimal effort , and enforcing policies is generally lightweight .

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

cross-site scripting
invasive software
unauthorized access
web application security