Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
386
A large-scale study of the evolution of web pages
- In Proceedings of the 12th International World Wide Web Conference
, 2003
"... How fast does the web change? Does most of the content remain unchanged once it has been authored, or are the documents continuously updated? Do pages change a little or a lot? Is the extent of change correlated to any other property of the page? All of these questions are of interest to those who m ..."
Abstract
-
Cited by 241 (5 self)
- Add to MetaCart
text of each download of the corresponding pages. After completion of the crawl, we analyzed the degree of change of each page, and investigated which factors are correlated with change intensity. We found that the average degree of change varies widely across top-level domains, and that larger pages
Unification-based Pointer Analysis with Directional Assignments
, 2000
"... This paper describes a new algorithm for flow and context insensitive pointer analysis of C programs. Our studies show that the most common use of pointers in C programs is in passing the addresses of composite objects or updateable values as arguments to procedures. Therefore, we have designed a lo ..."
Abstract
-
Cited by 217 (7 self)
- Add to MetaCart
subtyping. Our "one level flow" algorithm uses a restricted form of subtyping to avoid unification of symbols at the top levels of pointer chains in the points-to graph, while using unification elsewhere in the graph. The method scales easily to large programs. For instance, we are able to analyze
DOI 10.1007/s10444-010-9168-x Top-level acceleration of adaptive algebraic multilevel methods for steady-state solution to Markov chains
, 2010
"... Abstract In many application areas, including information retrieval and networking systems, finding the steady-state distribution vector of an irreducible Markov chain is of interest and it is often difficult to compute efficiently. The steady-state vector is the solution to a nonsymmetric eigenprob ..."
Abstract
- Add to MetaCart
. These methods use multiplicative iterate updates versus the additive error corrections that are typically used in nonsingular linear solvers. This paper discusses an outer iteration that accelerates convergence of multiplicative update methods, similar in principle to a preconditioned flexible Krylov wrapper
Performance Modelling and Evaluation of Event-Condition-Action Rules on RDF in P2P networks
"... This paper studies the performance and scalability aspects of processing Event-Condition-Action (ECA) rules on RDF metadata in peer-to-peer (P2P) environments. This work has been motivated by the increasing use of RDF in distributed web-based applications that require timely notification and propaga ..."
Abstract
- Add to MetaCart
to complete all rule processing resulting from a top-level update submitted to one of the peers in the network. We examine how this time varies with the network topology, number of peers, number of rules, and degree of metadata replication between peers. We describe a simulation of the system
FOUNDATION FOR INTELLIGENT PHYSICAL AGENTS FIPA Agent Message Transport Envelope Representation in XML Specification Document title FIPA Agent Message Transport Envelope Representation in XML Specification Document number PC00085F Document source FIPA Age
"... 2000/06/16 Updated the DTD to resolve some ambiguities and updated example accordingly. Replaced href attribute with value. Modified the AID object semantics in order to permit the name field to contain a URL and to clearly specify the name of the userdefined properties. 2000/06/19 Added a notes app ..."
Abstract
- Add to MetaCart
appendix temporarily to keep track of issues related to the specification. Minor phrasing edits. 2000/06/21 Modified the semantics of user-defined for AID level and top level. Updated DTD and examples. 2000/06/29 Made use of user defined parameters more clear; changed a-id to agentidentifier; changed a
Multiview Access Protocols for Large-Scale Replication
- ACM Transactions on Database Systems
, 1998
"... This article proposes a scalable protocol for replication management in large-scale replicated systems. The protocol organizes sites and data replicas into a tree-structured, hierarchical cluster architecture. The basic idea of the protocol is to accomplish the complex task of updating replicated da ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
, thanks to a smaller number of replicas each transaction needs to atomically update in a cluster, the protocol significantly reduces the transaction abort rate, which tends to soar in large transactional systems. Second, the protocol improves user-level transaction response time as top-level update
Sketch-based Change Detection: Methods, Evaluation, and Applications
- IN INTERNET MEASUREMENT CONFERENCE
, 2003
"... Traffic anomalies such as failures and attacks are commonplace in today's network, and identifying them rapidly and accurately is critical for large network operators. The detection typically treats the traffic as a collection of flows that need to be examined for significant changes in traffic ..."
Abstract
-
Cited by 165 (17 self)
- Add to MetaCart
data structure, k-ary sketch, which uses a constant, small amount of memory, and has constant per-record update and reconstruction cost. Its linearity property enables us to summarize traffic at various levels. We then implement a variety of time series forecast models (ARIMA, Holt-Winters, etc
Incremental Polymorphic Type Checking With Update
, 1992
"... We describe a variant of Milner's ML type inference algorithm which can be used to perform incremental type checking of programs with partially unspecied functions (or predicates in Prolog). This supports modication (e.g. for correction) of procedures dened previously and provides for a conveni ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
convenient treatment of top-level mutual recursion including Prolog-style incremental clausal denition. The system allows us to: dene a function of, say, type ! , use it in suceeding functions and then modify its denition to a type instance, such as list( int) ! list( int), provided that, in the meantime
Implementation of Delayed Updates in Heraclitus
, 1992
"... The Heraclitus languages are database programming languages that give prominence to "delayed updates" or deltas, which are first-class values representing sets of proposed updates, such as inserts and deletes, to the underlying persistent store. Deltas can be created, inspected and comb ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
The Heraclitus languages are database programming languages that give prominence to "delayed updates" or deltas, which are first-class values representing sets of proposed updates, such as inserts and deletes, to the underlying persistent store. Deltas can be created, inspected
Logical Update Queries as Open Nested Transactions
- In Transactions and Database Dynamics, volume 1773 of LNCS
, 2000
"... . The rule-based update language ULTRA has been designed for the specification of complex database updates in a modular fashion. The logical semantics of update goals is based on update request sets, which correspond to deferred basic updates in the database. The declarative character of the logi ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
independently from the toplevel transaction, but also complex operations defined by update rules. This leads to an open nested transaction hierarchy, which allows to exploit the semantical properties of complex operations to gain more concurrency. On the other hand, high-level compensation is necessary
Results 1 - 10
of
386
