Matches in ScholarlyData for { ?s ?p ?o. }
- 200 type InProceedings.
- 200 label "Towards the Theoretical Foundation of Choreography".
- 200 sameAs 200.
- 200 abstract "With the growth of interest on the web services, people pay more and more attention to choreography, that is, to describe collaborations of participants from a global viewpoint, in accomplishing a common business goal. In this paper, based on a simple choreography languages and a role-oriented process languages, we study some fundamental issues related to choreography, especially related to implementation, including semantics, projection and natural projection, dominant role in choices and iterations, etc. We develop the concept of \emph{dominant role} and propose some novel languages structures related to it. The study reveals some clues about the language, semantics, specification and implementation of choreography.".
- 200 hasAuthorList authorList.
- 200 isPartOf proceedings.
- 200 title "Towards the Theoretical Foundation of Choreography".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent zongyan-qiu.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent xiangpeng-zhao.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent chao-cai.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent hongli-yang.
- item-4 previous item-3.
- 207 creator christos-faloutsos.
- 207 creator duen-horng-chau.
- 207 creator samuel-wang.
- 207 creator shashank-pandit.
- 207 type InProceedings.
- 207 label "NetProbe: A Fast and Scalable System for Fraud Detection in Online Auction Networks".
- 207 sameAs 207.
- 207 abstract "Given a large online network of online auction uesrs and their histories of transactions, how can we spot anomalies, or even auction fraud? We describe the algorithms and system design decisions behind our proposed NetProbe system for uncovering auction fraud. We show that it is possible to do fast and scalable fraud detection, in large auction networks. The main idea is to use the machinery of "Markov Random Fields" (MRF), and try to guess the hidden state (fraud/honest) of each participant. We describe the algorithms behind our system, that are based on "belief propagation"; we provide our own incremental but accurate approximations to it; and we list and justify our design decisions for efficient crawling of real auction networks. We report experiments on synthetic graphs containing as many as 7,000 nodes and 30,000 edges, where NetProbe was able to spot fraudulent nodes with over 90 % precision and recall, with execution times in the order of seconds. We also report experiments on a real graph consisting of about 700,000 transactions between more than 66,000 eBay users, where NetProbe was highly effective at unearthing hidden networks of fraudsters, within a realistic response time of about 6 minutes.".
- 207 hasAuthorList authorList.
- 207 isPartOf proceedings.
- 207 title "NetProbe: A Fast and Scalable System for Fraud Detection in Online Auction Networks".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasItem item-4.
- authorList hasLastItem item-4.
- item-1 type ListItem.
- item-1 hasContent shashank-pandit.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent duen-horng-chau.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent samuel-wang.
- item-3 next item-4.
- item-3 previous item-2.
- item-4 type ListItem.
- item-4 hasContent christos-faloutsos.
- item-4 previous item-3.
- 215 creator anish-das-sarma.
- 215 creator arvind-jain.
- 215 creator gurmeet-manku.
- 215 type InProceedings.
- 215 label "Detecting Near-Duplicates for Web Crawling".
- 215 sameAs 215.
- 215 abstract "Near-duplicate documents are commonly found on the web. A pair of near-duplicate web pages differ from each other in a very small portion. The differences commonly consist of advertisements and timestamps. Such differences are irrelevant for web search. During web crawling, it is useful to quickly ascertain whether a newly crawled web page is a near-duplicate of a previously crawled web page or not.<br /><br /> In the course of developing a practical system for near-duplicate detection, we make two research contributions. First, we demonstrate the effectiveness of Charikar's fingerprinting technique for identifying near-duplicate web pages. We show that for 8 billion web-pages, a good choice of parameters is 64-bit fingerprints and 3-bit Hamming distances. Second, we present an algorithmic technique for identifying existing f-bit fingerprints that differ from a given fingerprint in at most k bit-positions, for small k. Our technique is useful for both online queries (single fingerprints) and batch queries (multiple fingerprints). Experimental evaluation over real data confirms the practicality of our design.".
- 215 hasAuthorList authorList.
- 215 isPartOf proceedings.
- 215 title "Detecting Near-Duplicates for Web Crawling".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasItem item-3.
- authorList hasLastItem item-3.
- item-1 type ListItem.
- item-1 hasContent gurmeet-manku.
- item-1 next item-2.
- item-2 type ListItem.
- item-2 hasContent arvind-jain.
- item-2 next item-3.
- item-2 previous item-1.
- item-3 type ListItem.
- item-3 hasContent anish-das-sarma.
- item-3 previous item-2.
- 216 creator krithi-ramamritham.
- 216 creator rajeev-gupta.
- 216 type InProceedings.
- 216 label "Optimized Query Planning of Continuous Aggregation Queries in Dynamic Data Dissemination Networks".
- 216 sameAs 216.
- 216 abstract "Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some aggregation function over distributed data items, for example, to know (a) the average of temperatures sensed by a set of sensors (b) the value of index of mid-cap stocks. In these queries a client specifies a coherency or accuracy requirement as part of the query. In this paper we present a low-cost, scalable technique to answer continuous aggregation queries using a content distribution network of dynamic data items. In such a network of data aggregators, each data aggregator serves a set of data items at specific coherencies. Just as various fragments of a dynamic web-page are served by one or more nodes of a CDN, our technique involves decomposing a client query into sub-queries and executing sub-queries on judiciously chosen data aggregators For executing an incoherency bounded continuous query, a query plan is required which includes the set of sub-queries, their individual incoherency bounds and data aggregators which can execute these sub-queries. An optimal query execution plan should satisfy client query's coherency requirement with least cost, measured in terms of the number of refresh messages sent from aggregators to the client. For estimating query execution cost, we build a continuous query cost model which can be used to estimate the number of messages required to satisfy the client specified incoherency bound. Performance results using real-world traces show that our cost based query planning leads to queries being executed using less than one third the number of messages required by existing schemes.".
- 216 hasAuthorList authorList.
- 216 isPartOf proceedings.
- 216 title "Optimized Query Planning of Continuous Aggregation Queries in Dynamic Data Dissemination Networks".
- authorList type List.
- authorList hasFirstItem item-1.
- authorList hasItem item-1.
- authorList hasItem item-2.
- authorList hasLastItem item-2.