aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
cs0411010 | 2952058472 | We propose a new simple logic that can be used to specify , i.e. security properties that refer to a single participant of the protocol specification. Our technique allows a protocol designer to provide a formal specification of the desired security properties, and integrate it naturally into the design process of cryp... | The approach presented in this paper belongs to the spectrum of intensional specifications, and is related to @cite_18 @cite_6 . In @cite_6 , a requirement specification language is proposed. This language is useful for specifying sets of requirements for classes of protocol; the requirements can be mapped onto a parti... | {
"cite_N": [
"@cite_18",
"@cite_10",
"@cite_6"
],
"mid": [
"",
"1997596059",
"2078142047"
],
"abstract": [
"",
"Although there is a substantial amount of work on formal requirements for two and three-party key distribution protocols, very little has been done on requirements f... |
cs0411010 | 2952058472 | We propose a new simple logic that can be used to specify , i.e. security properties that refer to a single participant of the protocol specification. Our technique allows a protocol designer to provide a formal specification of the desired security properties, and integrate it naturally into the design process of cryp... | In @cite_20 , Cremers, Mauw and de Vink present another logic for specifying local security properties. Similarly to us, in @cite_20 the authors define the message authenticity property by referring to the variables occurring in the protocol role. In addition, in @cite_20 , it is defined a new kind of authentication, c... | {
"cite_N": [
"@cite_20"
],
"mid": [
"146967524"
],
"abstract": [
"In this paper we define a general trace model for security protocols which allows to reason about various formal definitions of authentication. In the model, we define a strong form of authentication which we call synchronization. ... |
cs0411046 | 1622839875 | We present a novel framework, called balanced overlay networks (BON), that provides scalable, decentralized load balancing for distributed computing using large-scale pools of heterogeneous computers. Fundamentally, BON encodes the information about each node's available computational resources in the structure of the ... | The authors have previously considered topologically-based load balancing with a simpler model than BON which is amenable to analytical study @cite_17 . In that work each node's resources were proportional to in-degree and load was distributed by performing a short random walk and migrating load to the last node of the... | {
"cite_N": [
"@cite_17"
],
"mid": [
"2071293938"
],
"abstract": [
"The maximum entropy principle from statistical mechanics states that a closed system attains an equilibrium distribution that maximizes its entropy. We first show that for graphs with fixed number of edges one can define a stochas... |
cs0411046 | 1622839875 | We present a novel framework, called balanced overlay networks (BON), that provides scalable, decentralized load balancing for distributed computing using large-scale pools of heterogeneous computers. Fundamentally, BON encodes the information about each node's available computational resources in the structure of the ... | The majority of distributed computing research has focused on central server methods, DHT architectures, agent-based systems, randomized algorithms and local diffusive techniques @cite_22 @cite_21 @cite_13 @cite_10 @cite_3 @cite_18 @cite_12 . Some of the most successful systems to date @cite_14 @cite_5 have used a cent... | {
"cite_N": [
"@cite_13",
"@cite_18",
"@cite_14",
"@cite_22",
"@cite_9",
"@cite_21",
"@cite_3",
"@cite_23",
"@cite_5",
"@cite_10",
"@cite_12"
],
"mid": [
"1411713",
"2030235801",
"2142863519",
"2114860831",
"2088240190",
"1571078753",
"198595... |
cs0411046 | 1622839875 | We present a novel framework, called balanced overlay networks (BON), that provides scalable, decentralized load balancing for distributed computing using large-scale pools of heterogeneous computers. Fundamentally, BON encodes the information about each node's available computational resources in the structure of the ... | BON is designed to be deployed on extremely large ensembles of nodes. This is a major similarity with BOINC @cite_14 . The Einstein@home project which processes gravitation data and Predictor@home which studies protein-related disease are based on BOINC, the latest infrastructure for creating public-resource computing ... | {
"cite_N": [
"@cite_14"
],
"mid": [
"2142863519"
],
"abstract": [
"BOINC (Berkeley Open Infrastructure for Network Computing) is a software system that makes it easy for scientists to create and operate public-resource computing projects. It supports diverse applications, including those with lar... |
cs0410066 | 2949608853 | Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree structure to determine the responsible node for accessing or storing the data. Examples include object tracking in sensor networks, packet routi... | The concept of the memory wall has been popularized by Wulf @cite_5 . Many researchers have been working on improving cache efficiency to overcome the memory wall problem. The pioneering work @cite_11 done by has both theoretically and experimentally studied the blocking technique and described the factors that affect ... | {
"cite_N": [
"@cite_5",
"@cite_11"
],
"mid": [
"1983096721",
"2014515453"
],
"abstract": [
"Static cache analysis characterizes a program's cache behavior by determining in a sound but approximate manner which memory accesses result in cache hits and which result in cache misses. Such inf... |
cs0410066 | 2949608853 | Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree structure to determine the responsible node for accessing or storing the data. Examples include object tracking in sensor networks, packet routi... | In the area of theory and experimental algorithms, @cite_0 proposed an analytical model to predict the cache performance. In their model, they assume all nodes in a tree are accessed uniformly. This model is not accurate for the tree lookup problem. Because the number of nodes from root node to leaf nodes is exponentia... | {
"cite_N": [
"@cite_0",
"@cite_7"
],
"mid": [
"1965929361",
"2091829363"
],
"abstract": [
"analyze them. This paper describes a model for studying the cache performance of algorithms in a direct-mapped cache. Using this model, we analyze the cache performance of several commonly occurring... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | The system was the first setup in which a supergravity dual of pure @math SYM theory with no hypermultiplets was studied @cite_9 . It was constructed by wrapping BPS D-branes on a K3 manifold, and studying the resulting geometry. From the supergravity point of view, the system exhibited a novel singularity resolution m... | {
"cite_N": [
"@cite_9"
],
"mid": [
"2040482607"
],
"abstract": [
"We study brane configurations that give rise to large-N gauge theories with eight supersymmetries and no hypermultiplets. These configurations include a variety of wrapped, fractional, and stretched branes or strings. The correspon... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | A natural generalisation was to study geometries for which the system gains energy above the BPS bound. An unusual two-branch structure was found @cite_9 @cite_0 . One class of possible solutions had the appearance of a black hole (or black brane), and was dubbed the horizon branch, while the other appeared to have an ... | {
"cite_N": [
"@cite_0",
"@cite_9"
],
"mid": [
"2079936263",
"2040482607"
],
"abstract": [
"The enhancon mechanism removes a family of time-like singularities from certain supergravity spacetimes by forming a shell of branes on which the exterior geometry terminates. The problematic interi... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | Dimitriadis and Ross did a preliminary search @cite_6 for a classical instability that would provide evidence that the two branches are connected. Such an instability, which is fundamentally different in nature from the Gregory-Laflamme instability, could be interpreted as signalling a phase transition in the dual gaug... | {
"cite_N": [
"@cite_7",
"@cite_6"
],
"mid": [
"2471626564",
"1505471498"
],
"abstract": [
"We study the supergravity solutions describing nonextremal enhan c c ons. There are two branches of solutions: a shell branch'' connected to the extremal solution, and a horizon branch'' which conne... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | Surprisingly, when the system is near extremality and the asymptotic volume of the K3 is large, the first two terms combine into a dominant, negative, contribution. Thus the shell branch violates the WEC. It was argued @cite_7 that the shell branch should therefore be regarded as unphysical. Accordingly, the horizon br... | {
"cite_N": [
"@cite_7"
],
"mid": [
"2471626564"
],
"abstract": [
"We study the supergravity solutions describing nonextremal enhan c c ons. There are two branches of solutions: a shell branch'' connected to the extremal solution, and a horizon branch'' which connects to the Schwarzschild black ho... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | In subsequent work on non-BPS , involving two of the current authors, we used simple supergravity techniques to find the most general solutions with the correct symmetries and asymptotic charges of the hot system @cite_3 . We showed that the only non-BPS solution with a well-behaved event horizon is the horizon branch. | {
"cite_N": [
"@cite_3"
],
"mid": [
"1965302333"
],
"abstract": [
"We extend the investigation of nonextremal enhan c c ons, finding the most general solutions with the correct symmetry and charges. There are two families of solutions. One of these contains a solution with a regular horizon found ... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | Here, the story is particularly simple. We find that, at some radius greater than @math , the volume of the K3 always shrinks to zero, indicating that somewhere outside this radius, the K3 has reached its stringy volume. Note that the old ( @math ) shell solution @cite_0 falls into this category. | {
"cite_N": [
"@cite_0"
],
"mid": [
"2079936263"
],
"abstract": [
"The enhancon mechanism removes a family of time-like singularities from certain supergravity spacetimes by forming a shell of branes on which the exterior geometry terminates. The problematic interior geometry is replaced by a new ... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | It is straightforward to find an expression for the radius of the @math -shell solutions: We could also rewrite this in terms of the parameters: @math , @math , @math , in order to put the solution exactly in terms of the language of previous studies @cite_0 . | {
"cite_N": [
"@cite_0"
],
"mid": [
"2079936263"
],
"abstract": [
"The enhancon mechanism removes a family of time-like singularities from certain supergravity spacetimes by forming a shell of branes on which the exterior geometry terminates. The problematic interior geometry is replaced by a new ... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | In a related context, the geometry of fractional D @math -branes was studied @cite_5 . Fractional branes can be described as regular D @math -branes wrapped on a vanishing two-cycle inside the @math orbifold limit of K3. The dual gauge theory is again @math SYM with no hypermultiplets. Attempting to take the decoupling... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2019049541"
],
"abstract": [
"Abstract By looking at fractional D p -branes of type IIA on T 4 Z 2 as wrapped branes and by using boundary state techniques we construct the effective low-energy action for the fields generated by fractional branes, build their w... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | The authors of @cite_5 found supergravity solutions for fractional branes in six dimensions using two different methods. First, they used boundary state technology to produce a consistent truncation of Type II supergravity coupled to fractional brane sources; second, they related their consistent truncation to the hete... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2019049541"
],
"abstract": [
"Abstract By looking at fractional D p -branes of type IIA on T 4 Z 2 as wrapped branes and by using boundary state techniques we construct the effective low-energy action for the fields generated by fractional branes, build their w... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | The natural extension of this work was, again, to consider the systems when energy is added to take them above the BPS bound. In @cite_2 , a consistent six-dimensional truncation ansatz for fractional Dp-branes in orbifold backgrounds was provided, for general @math . Solutions corresponding to the geometry of non-BPS ... | {
"cite_N": [
"@cite_0",
"@cite_2"
],
"mid": [
"2079936263",
"2152342374"
],
"abstract": [
"The enhancon mechanism removes a family of time-like singularities from certain supergravity spacetimes by forming a shell of branes on which the exterior geometry terminates. The problematic interi... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | The construction of fractional brane geometries that exhibit the mechanism is expected to be dual (through T-duality of type IIA on K3) to the original geometries @cite_9 @cite_5 @cite_2 . However, in view of work reviewed in the previous subsection, the conclusion that horizons never form in the non-BPS fractional bra... | {
"cite_N": [
"@cite_5",
"@cite_9",
"@cite_2"
],
"mid": [
"2019049541",
"2040482607",
"2152342374"
],
"abstract": [
"Abstract By looking at fractional D p -branes of type IIA on T 4 Z 2 as wrapped branes and by using boundary state techniques we construct the effective low-energy a... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | We will show that this apparent discord is actually an artifact. The hot fractional brane system exhibits the exact dual behavior to that of the hot . In particular, we will show that the solutions of @cite_2 are related by duality to the hot solutions of @cite_0 . By continuously varying the K3 moduli away from the or... | {
"cite_N": [
"@cite_0",
"@cite_2"
],
"mid": [
"2079936263",
"2152342374"
],
"abstract": [
"The enhancon mechanism removes a family of time-like singularities from certain supergravity spacetimes by forming a shell of branes on which the exterior geometry terminates. The problematic interi... |
hep-th0409280 | 2070302448 | We review what has been learnt and what remains unknown about the physics of hot enhancons following studies in supergravity. We recall a rather general family of static, spherically symmetric, non-extremal enhancon solutions describing D4 branes wrapped on K3 and discuss physical aspects of the solutions. We embed the... | In order to embed the non-extremal D4 brane solutions of @cite_3 in the six dimensional supergravity, we display a simple two charge truncation which describes the solutions studied in @cite_3 . These solutions can then be lifted straight across into the larger supergravity theory. In deriving the truncation, it is con... | {
"cite_N": [
"@cite_3",
"@cite_2"
],
"mid": [
"1965302333",
"2152342374"
],
"abstract": [
"We extend the investigation of nonextremal enhan c c ons, finding the most general solutions with the correct symmetry and charges. There are two families of solutions. One of these contains a solut... |
cs0408007 | 2952840318 | We consider a the general online convex optimization framework introduced by Zinkevich. In this setting, there is a sequence of convex functions. Each period, we must choose a signle point (from some feasible set) and pay a cost equal to the value of the next function on our chosen point. Zinkevich shows that, if the e... | For direct offline optimization, i.e. from an oracle that evaluates the function, in theory one can use the ellipsoid @cite_6 or more recent random-walk based approaches @cite_2 . In black-box optimization, practitioners often use Simulated Annealing @cite_12 or finite difference simulated perturbation stochastic appro... | {
"cite_N": [
"@cite_6",
"@cite_2",
"@cite_5",
"@cite_16",
"@cite_12",
"@cite_11"
],
"mid": [
"",
"2106318612",
"",
"2064076655",
"2024060531",
"2012117977"
],
"abstract": [
"",
"Minimizing a convex function over a convex set in n-dimensional space is a ... |
cs0408007 | 2952840318 | We consider a the general online convex optimization framework introduced by Zinkevich. In this setting, there is a sequence of convex functions. Each period, we must choose a signle point (from some feasible set) and pay a cost equal to the value of the next function on our chosen point. Zinkevich shows that, if the e... | In addition to the appeal of an online model of convex optimization, Zinkevich's gradient descent analysis can be applied to several other online problems for which gradient descent and other special-purpose algorithms have been carefully analyzed, such as Universal Portfolios @cite_0 @cite_18 @cite_19 , online linear ... | {
"cite_N": [
"@cite_18",
"@cite_3",
"@cite_0",
"@cite_19",
"@cite_13"
],
"mid": [
"1964964840",
"1527666879",
"",
"2076798318",
"2069317438"
],
"abstract": [
"We present an on-line investment algorithm that achieves almost the same wealth as the best constant-rebal... |
cs0408007 | 2952840318 | We consider a the general online convex optimization framework introduced by Zinkevich. In this setting, there is a sequence of convex functions. Each period, we must choose a signle point (from some feasible set) and pay a cost equal to the value of the next function on our chosen point. Zinkevich shows that, if the e... | A similar line of research has developed for the problem of online linear optimization @cite_1 @cite_10 @cite_9 . Here, one wants to solve the related but incomparable problem of optimizing a sequence of linear functions, over a possibly non-convex feasible set, modeling problems such as online shortest paths and onlin... | {
"cite_N": [
"@cite_10",
"@cite_9",
"@cite_1"
],
"mid": [
"2014482607",
"2116067849",
"80526489"
],
"abstract": [
"Minimal delay routing is a fundamental task in networks. Since delays depend on the (potentially unpredictable) traffic distribution, online delay optimization can be... |
cs0408007 | 2952840318 | We consider a the general online convex optimization framework introduced by Zinkevich. In this setting, there is a sequence of convex functions. Each period, we must choose a signle point (from some feasible set) and pay a cost equal to the value of the next function on our chosen point. Zinkevich shows that, if the e... | A few comparisons are interesting to make with the online linear optimization problem. First of all, for the bandit versions of the linear problems, there was a distinction between exploration phases and exploitation phases. During exploration phases, one action from a barycentric spanner @cite_10 basis of @math action... | {
"cite_N": [
"@cite_9",
"@cite_10"
],
"mid": [
"2116067849",
"2014482607"
],
"abstract": [
"In the multi-armed bandit problem, a gambler must decide which arm of K non-identical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received... |
cs0407006 | 2951800949 | Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems using a combination of a decision procedure for a subset of first-order logic and symbolic methods originally developed for finite-state model checking. We consider models containing first-order state variables, where the ... | Regular model checking @cite_17 @cite_28 uses regular languages to represent parameterized systems and computes the closure for the regular relations to construct the reachable state space. In general, the method is not guaranteed to be complete and requires various acceleration techniques (sometimes guided by the user... | {
"cite_N": [
"@cite_28",
"@cite_17"
],
"mid": [
"1861590051",
"1926085771"
],
"abstract": [
"We present regular model checking, a framework for algorithmic verification of infinite-state systems with, e.g., queues, stacks, integers, or a parameterized linear topology. States are represent... |
cs0407006 | 2951800949 | Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems using a combination of a decision procedure for a subset of first-order logic and symbolic methods originally developed for finite-state model checking. We consider models containing first-order state variables, where the ... | Several researchers have investigated restrictions on the system description to make the parameterized verification problem decidable. Notable among them is the early work by German and Sistla @cite_0 for verifying single-indexed properties for synchronously communicating systems. For restricted systems, finite cut-off... | {
"cite_N": [
"@cite_0",
"@cite_27",
"@cite_16",
"@cite_12"
],
"mid": [
"2036526834",
"",
"2051054731",
"1589760516"
],
"abstract": [
"Methods are given for automatically verifying temporal properties of concurrent systems containing an arbitrary number of finite-state proc... |
cs0407006 | 2951800949 | Predicate abstraction provides a powerful tool for verifying properties of infinite-state systems using a combination of a decision procedure for a subset of first-order logic and symbolic methods originally developed for finite-state model checking. We consider models containing first-order state variables, where the ... | Flanagan and Qadeer @cite_2 use indexed predicates to synthesize loop invariants for sequential software programs that involve unbounded arrays. They also provide heuristics to extract some of the predicates from the program text automatically. The heuristics are specific to loops in sequential software and not suited ... | {
"cite_N": [
"@cite_25",
"@cite_22",
"@cite_2"
],
"mid": [
"2066210260",
"2151643528",
""
],
"abstract": [
"So-called “guarded commands” are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least t... |
math0407092 | 2952242105 | In this paper we study a random graph with @math nodes, where node @math has degree @math and @math are i.i.d. with @math . We assume that @math for some @math and some constant @math . This graph model is a variant of the so-called configuration model, and includes heavy tail degrees with finite variance. The minimal ... | A second related model can be found in @cite_15 and @cite_42 , where edges between nodes @math and @math are present with probability equal to @math for some expected degree vector' @math . Chung and Lu @cite_15 show that when @math is proportional to @math the average distance between pairs of nodes is @math when @mat... | {
"cite_N": [
"@cite_15",
"@cite_42"
],
"mid": [
"2027377866",
"2112976607"
],
"abstract": [
"Abstract Random graph theory is used to examine the “small-world phenomenon”; any two strangers are connected through a short chain of mutual acquaintances. We will show that for certain families ... |
math0407092 | 2952242105 | In this paper we study a random graph with @math nodes, where node @math has degree @math and @math are i.i.d. with @math . We assume that @math for some @math and some constant @math . This graph model is a variant of the so-called configuration model, and includes heavy tail degrees with finite variance. The minimal ... | The reason why we study the random graphs at a given time instant is that we are interested in the topology of the random graph. In @cite_36 , and inspired by the observed power law degree sequence in @cite_12 , the configuration model with i.i.d. degrees is proposed as a model for the AS-graph in Internet, and it is a... | {
"cite_N": [
"@cite_36",
"@cite_12"
],
"mid": [
"2163252320",
"1976969221"
],
"abstract": [
"Following the long-held belief that the Internet is hierarchical, the network topology generators most widely used by the Internet research community, Transit-Stub and Tiers, create networks with ... |
cs0406019 | 2950243200 | We consider the problem of providing service guarantees in a high-speed packet switch. As basic requirements, the switch should be scalable to high speeds per port, a large number of ports and a large number of traffic flows with independent guarantees. Existing scalable solutions are based on Virtual Output Queuing, w... | In recent years, these potential scalability concerns have been addressed by implementing a very small number of independent service guarantees. Under the Differentiated Services framework @cite_12 , flows are aggregated in @math classes, and service guarantees are offered for classes. The downside is that the realized... | {
"cite_N": [
"@cite_11",
"@cite_9",
"@cite_1",
"@cite_12",
"@cite_17"
],
"mid": [
"",
"2109130057",
"2126499691",
"1977867261",
"1556897819"
],
"abstract": [
"",
"The Differentiated Service (Diff-Serv) architecture [1] advocates a model based on different “gran... |
cs0406019 | 2950243200 | We consider the problem of providing service guarantees in a high-speed packet switch. As basic requirements, the switch should be scalable to high speeds per port, a large number of ports and a large number of traffic flows with independent guarantees. Existing scalable solutions are based on Virtual Output Queuing, w... | More recent proposals @cite_16 decrease the time interval between two runs of the matching algorithm, but with a tradeoff in increased burstiness and additional scheduling algorithms for mitigating unbounded delays. Moreover, the service presented in @cite_16 is of type Premium 1-to-1, but cannot provide Assured N-to-1... | {
"cite_N": [
"@cite_16"
],
"mid": [
"89807891"
],
"abstract": [
"Input-Output buffered crossbars are popular building blocks for scalable high-speed switching because they require minimum speed-up of memory bandwidth. Scaling the design of crossbar switches to large capacities is limited by techn... |
cond-mat0406404 | 1540064387 | Mapping the Internet generally consists in sampling the network from a limited set of sources by using "traceroute"-like probes. This methodology, akin to the merging of different spanning trees to a set of destinations, has been argued to introduce uncontrolled sampling biases that might produce statistical properties... | Work by @cite_21 has shown that power-law like distributions can be obtained for subgraphs of Erd "os-R 'enyi random graphs when the subgraph is the result of a traceroute exploration with relatively few sources and destinations. They discuss the origin of these biases and the effect of the distance between source and ... | {
"cite_N": [
"@cite_21"
],
"mid": [
"2107648668"
],
"abstract": [
"Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led some to conclude that the router graph of the Internet ... |
cond-mat0406404 | 1540064387 | Mapping the Internet generally consists in sampling the network from a limited set of sources by using "traceroute"-like probes. This methodology, akin to the merging of different spanning trees to a set of destinations, has been argued to introduce uncontrolled sampling biases that might produce statistical properties... | In Ref. @cite_11 , Petermann and De Los Rios have studied a traceroute -like procedure on various examples of scale-free graphs, showing that, in the case of a single source, power-law distributions with underestimated exponents are obtained. Analytical estimates of the measured exponents as a function of the true ones... | {
"cite_N": [
"@cite_28",
"@cite_11"
],
"mid": [
"1479935453",
"2949920252"
],
"abstract": [
"Internet maps are generally constructed using the traceroute tool from a few sources to many destinations. It appeared recently that this exploration process gives a partial and biased view of the... |
cs0405044 | 2950057546 | Most previous work on the recently developed language-modeling approach to information retrieval focuses on document-specific characteristics, and therefore does not take into account the structure of the surrounding corpus. We propose a novel algorithmic framework in which information provided by document-based langua... | Document clustering has a long history in information retrieval @cite_11 @cite_12 ; in particular, approximating topics via clusters is a recurring theme @cite_18 . Arguably the work most related to ours by dint of employing both clustering and language modeling in the context of ad hoc retrieval See e.g., @cite_16 , @... | {
"cite_N": [
"@cite_18",
"@cite_10",
"@cite_1",
"@cite_3",
"@cite_5",
"@cite_15",
"@cite_16",
"@cite_13",
"@cite_12",
"@cite_11"
],
"mid": [
"1990388042",
"1880262756",
"1519270649",
"2112874453",
"2074449313",
"1602444393",
"2121227244",
"2... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | The protocol described here is derived from earlier work @cite_21 in which we covered the background of the LOCKSS system. That protocol used redundancy, rate limitation, effort balancing, bimodal behavior (polls must be won or lost by a landslide) and friend bias (soliciting some percentage of votes from peers on the ... | {
"cite_N": [
"@cite_21"
],
"mid": [
"2144552569"
],
"abstract": [
"The LOCKSS project has developed and deployed in a world-wide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It consists of a large number of independent, low-cost... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | Our attrition adversary draws on a wide range of work in detecting @cite_60 , measuring @cite_34 , and combating @cite_8 @cite_38 @cite_27 @cite_49 network-level DDoS attacks capable of stopping traffic to and from our peers. This work observes that current attacks are not simultaneously of high intensity, long duratio... | {
"cite_N": [
"@cite_38",
"@cite_8",
"@cite_60",
"@cite_27",
"@cite_49",
"@cite_34"
],
"mid": [
"2154178154",
"2120065915",
"2159160833",
"1967949770",
"",
""
],
"abstract": [
"The current Internet infrastructure has very few built-in protection mechanisms, ... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | Related to first-hand reputation is the use of game-theoretic analysis of peer behavior by @cite_7 to show that a reciprocative strategy in admission control policy can motivate cooperation among selfish peers. | {
"cite_N": [
"@cite_7"
],
"mid": [
"2100642498"
],
"abstract": [
"Lack of cooperation (free riding) is one of the key problems that confronts today's P2P systems. What makes this problem particularly difficult is the unique set of challenges that P2P systems pose: large populations, high turnover... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | Admission control has been used to improve the usability of overloaded services. For example, @cite_1 propose admission control strategies that help protect long-running Web service sessions (i.e., related sequences of requests) from abrupt termination. Preserving the responsiveness of Web services in the face of deman... | {
"cite_N": [
"@cite_14",
"@cite_1"
],
"mid": [
"2158656420",
"2160436229"
],
"abstract": [
"We describe a simple but effective traffic model that can be used to understand the effects of denial-of-service (DoS) attacks based on query floods in Gnutella networks. We run simulations based o... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | Golle and Mironov @cite_2 provide compliance enforcement in the context of distributed computation using a receipt technique similar to ours. Random auditing using challenges and hashing has been proposed @cite_42 @cite_37 as a means of enforcing trading requirements in some distributed storage systems. | {
"cite_N": [
"@cite_37",
"@cite_42",
"@cite_2"
],
"mid": [
"1585819637",
"2148042433",
"1506068270"
],
"abstract": [
"Peer-to-peer (p2p) networking technologies have gained popularity as a mechanism for users to share files without the need for centralized servers. A p2p network p... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | In DHTs waves of synchronized routing updates caused by joins or departures cause instability during periods of high churn. Bamboo's @cite_28 desynchronization defense using lazy updates is effective. | {
"cite_N": [
"@cite_28"
],
"mid": [
"2162733677"
],
"abstract": [
"This paper addresses the problem of churn--the continuous process of node arrival and departure--in distributed hash tables (DHTs). We argue that DHTs should perform lookups quickly and consistently under churn rates at least as h... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | The previous version of the LOCKSS protocol used rate-limiting, inherent intrusion detection through bimodal system behavior, and churning of friends into the reference list to prevent poll samples from being influenced by nominated peers. These techniques are effective in defending against adversaries attempting to mo... | {
"cite_N": [
"@cite_21"
],
"mid": [
"2144552569"
],
"abstract": [
"The LOCKSS project has developed and deployed in a world-wide test a peer-to-peer system for preserving access to journals and other archival information published on the Web. It consists of a large number of independent, low-cost... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | . Rate limits on peers joining a DHT have been suggested @cite_47 @cite_37 as a defense against attempts to control parts of the hash space, for example to control the placement of certain data objects or for misrouting. Limiting both joins and stores to empirically determined safe rates will also be needed to thwart t... | {
"cite_N": [
"@cite_24",
"@cite_47",
"@cite_37"
],
"mid": [
"1972699782",
"",
"1585819637"
],
"abstract": [
"In the span of only a few years, the Internet has experienced an astronomical increase in the use of specialized content delivery systems, such as content delivery networks... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | : Admission control appears frequently as a defense against overloading, for example in the context of Web services. For example, @cite_1 propose admission control strategies that help protect long-running sessions (i.e., related sequences of requests) from abrupt termination. However, several of the pertinent assumpti... | {
"cite_N": [
"@cite_14",
"@cite_1"
],
"mid": [
"2158656420",
"2160436229"
],
"abstract": [
"We describe a simple but effective traffic model that can be used to understand the effects of denial-of-service (DoS) attacks based on query floods in Gnutella networks. We run simulations based o... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | . Some researchers have proposed storing useless content in exchange for having content be stored as a way to enforce symmetric storage relationships. Compliance enforcement is achieved by asking the peer storing the file of interest to hash some portion of the file as proof that it is still storing the file @cite_42 @... | {
"cite_N": [
"@cite_37",
"@cite_42"
],
"mid": [
"1585819637",
"2148042433"
],
"abstract": [
"Peer-to-peer (p2p) networking technologies have gained popularity as a mechanism for users to share files without the need for centralized servers. A p2p network provides a scalable and fault-tole... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | . Waves of synchronized routing updates caused by joins or departures cause instability during periods of high churn @cite_28 . Breaking the synchrony through lazy updates (e.g., in Bamboo @cite_28 ) can absorb the brunt of a churn attack. | {
"cite_N": [
"@cite_28"
],
"mid": [
"2162733677"
],
"abstract": [
"This paper addresses the problem of churn--the continuous process of node arrival and departure--in distributed hash tables (DHTs). We argue that DHTs should perform lookups quickly and consistently under churn rates at least as h... |
cs0405111 | 2950383323 | In peer-to-peer systems, attrition attacks include both traditional, network-level denial of service attacks as well as application-level attacks in which malign peers conspire to waste loyal peers' resources. We describe several defenses for LOCKSS, a peer-to-peer digital preservation system, that help ensure that app... | As (the rate at which the peer population changes) increases, both the latency and the probability of failure of queries to a DHT increases @cite_28 . An attrition attack might consist of adversary peers joining and leaving fast enough to destabilize the routing infrastructure. | {
"cite_N": [
"@cite_28"
],
"mid": [
"2162733677"
],
"abstract": [
"This paper addresses the problem of churn--the continuous process of node arrival and departure--in distributed hash tables (DHTs). We argue that DHTs should perform lookups quickly and consistently under churn rates at least as h... |
cs0405070 | 2949521043 | We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynamics and generates weighted directed graphs exhibiting the statistical properties observed in the Web. In particular, the model yields a non-trivi... | A very interesting class of models that considers the main features of the WWW growth has been introduced by @cite_11 in order to produce a mechanism which does not assume the knowledge of the degree of the existing vertices. Each newly introduced vertex @math selects at random an already existing vertex @math ; for ea... | {
"cite_N": [
"@cite_11"
],
"mid": [
"2115579680"
],
"abstract": [
"The Web may be viewed as a directed graph each of whose vertices is a static HTML Web page, and each of whose edges corresponds to a hyperlink from one Web page to another. We propose and analyze random graph models inspired by a ... |
cs0404002 | 2138964611 | We review existing approaches to mathematical modeling and analysis of multi-agent systems in which complex collective behavior arises out of local interactions between many simple agents. Though the behavior of an individual agent can be considered to be stochastic and unpredictable, the collective behavior of such sy... | With the exceptions noted below, there has been very little prior work on mathematical analysis of multi-agent systems. The closest in spirit to our paper is the work by Huberman, Hogg and coworkers on computational ecologies @cite_5 @cite_73 . These authors mathematically studied collective behavior in a system of age... | {
"cite_N": [
"@cite_5",
"@cite_73",
"@cite_71"
],
"mid": [
"13086009",
"1973321347",
"2127034968"
],
"abstract": [
"",
"Abstract We investigate the effect of predictions upon a model of coevolutionary systems which was originally inspired by computational ecosystems. The model... |
cs0404002 | 2138964611 | We review existing approaches to mathematical modeling and analysis of multi-agent systems in which complex collective behavior arises out of local interactions between many simple agents. Though the behavior of an individual agent can be considered to be stochastic and unpredictable, the collective behavior of such sy... | In the robotics domain, Sugawara and coworkers @cite_62 @cite_26 developed simple state-based analytical models of cooperative foraging in groups of communicating and non-co -mmu -ni -cating robots and studied them quantitatively. Although these models are similar to ours, they are overly simplified and fail to take cr... | {
"cite_N": [
"@cite_29",
"@cite_46",
"@cite_62",
"@cite_26"
],
"mid": [
"1578969637",
"2137153348",
"2053796391",
"2090703876"
],
"abstract": [
"In multi-robot applications, such as foraging or collection tasks, interference, which results from competition for space betwee... |
cs0404037 | 1653657989 | Component-based software development has posed a serious challenge to system verification since externally-obtained components could be a new source of system failures. This issue can not be completely solved by either model-checking or traditional software testing techniques alone due to several reasons: 1) externally... | Recently, Bertolino et. al. @cite_17 recognized the importance of testing a software component in its deployment environment. They developed a framework that supports functional testing of a software component with respect to customer's specification, which also provides a simple way to enclose with a component the dev... | {
"cite_N": [
"@cite_19",
"@cite_17"
],
"mid": [
"2121376435",
"2100161032"
],
"abstract": [
"We present a new, automatic technique to assess whether replacing a component of a software system by a purportedly compatible component may change the behavior of the system. The technique operat... |
cs0404037 | 1653657989 | Component-based software development has posed a serious challenge to system verification since externally-obtained components could be a new source of system failures. This issue can not be completely solved by either model-checking or traditional software testing techniques alone due to several reasons: 1) externally... | In the formal verification area, there has been a long history of research on verification of systems with modular structure (called modular verification @cite_9 ). A key idea @cite_31 @cite_11 in modular verification is the assume-guarantee paradigm: A module should guarantee to have the desired behavior once the envi... | {
"cite_N": [
"@cite_0",
"@cite_9",
"@cite_31",
"@cite_11"
],
"mid": [
"1596365597",
"2130025446",
"2086070079",
"1488659932"
],
"abstract": [
"R. Alur1, T.A. Henzinger2, F.Y.C. Mang2, S. Qadeer2, S.K. Rajamani2, and S. Tasiran2 1 Computer & Information Science Department, ... |
cs0404037 | 1653657989 | Component-based software development has posed a serious challenge to system verification since externally-obtained components could be a new source of system failures. This issue can not be completely solved by either model-checking or traditional software testing techniques alone due to several reasons: 1) externally... | In the past decade, there has also been some research on combining model-checking and testing techniques for system verification, which can be classified into a broader class of techniques called specification-based testing. But most of the work only utilizes model-checkers' ability of generating counter-examples from ... | {
"cite_N": [
"@cite_30",
"@cite_35",
"@cite_18",
"@cite_4",
"@cite_32",
"@cite_39",
"@cite_25"
],
"mid": [
"1896160926",
"1506339322",
"2115309705",
"1558093988",
"",
"2101361140",
"2055647675"
],
"abstract": [
"We apply a model checker to the probl... |
cs0404037 | 1653657989 | Component-based software development has posed a serious challenge to system verification since externally-obtained components could be a new source of system failures. This issue can not be completely solved by either model-checking or traditional software testing techniques alone due to several reasons: 1) externally... | Callahan et. al. @cite_32 used the model-checker SPIN @cite_18 to check a program's execution traces generated during white-box testing and to generate new test-cases from the counter-example found by SPIN; in @cite_35 , SPIN was also used to generate test-cases from counter-examples found during model-checking system ... | {
"cite_N": [
"@cite_30",
"@cite_35",
"@cite_18",
"@cite_4",
"@cite_32",
"@cite_39",
"@cite_25",
"@cite_12"
],
"mid": [
"1896160926",
"1506339322",
"2115309705",
"1558093988",
"",
"2101361140",
"2055647675",
""
],
"abstract": [
"We apply a mo... |
cs0404037 | 1653657989 | Component-based software development has posed a serious challenge to system verification since externally-obtained components could be a new source of system failures. This issue can not be completely solved by either model-checking or traditional software testing techniques alone due to several reasons: 1) externally... | Peled et. al. @cite_27 @cite_29 @cite_5 studied the issue of checking a black-box against a temporal property (called black-box checking). But their focus is on how to efficiently establish an abstract model of the black-box through black-box testing , and their approach requires a clearly-defined property (LTL formula... | {
"cite_N": [
"@cite_28",
"@cite_29",
"@cite_6",
"@cite_24",
"@cite_27",
"@cite_5"
],
"mid": [
"",
"1493173186",
"2141399917",
"1968542268",
"1482663303",
"1539019418"
],
"abstract": [
"",
"The AMC (for adaptive model checking) system allows one to perfo... |
cs0402003 | 2952176458 | The notion of preference is becoming more and more ubiquitous in present-day information systems. Preferences are primarily used to filter and personalize the information reaching the users of such systems. In database systems, preferences are usually captured as preference relations that are used to build preference q... | The basic reference for semantic query optimization is @cite_11 . The most common techniques are: join elimination introduction, predicate elimination and introduction, and detecting an empty answer set. @cite_15 discusses the implementation of predicate introduction and join elimination in an industrial query optimize... | {
"cite_N": [
"@cite_14",
"@cite_8",
"@cite_2",
"@cite_15",
"@cite_11"
],
"mid": [
"1501976648",
"2108930340",
"2147722789",
"",
"2006519067"
],
"abstract": [
"We investigate the optimization of extended relational queries used in systems holding, for example, spati... |
cs0312023 | 2951755603 | This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalises traditional termination analysis where an analyser tries to verify termination for a specified mode. Our contribution is a methodology in which components of traditional termination analysis are combined ... | This paper draws on results from two areas: termination (checking) analysis and backwards analysis. It shows how to combine components implementing these so as to obtain an analyser for termination inference. Termination checking for logic programs has been studied extensively (see for example the survey @cite_18 ). Ba... | {
"cite_N": [
"@cite_18",
"@cite_14",
"@cite_23",
"@cite_15"
],
"mid": [
"2009286786",
"",
"1999783590",
"1524883003"
],
"abstract": [
"Abstract We survey termination analysis techniques for Logic Programs. We give an extensive introduction to the topic. We recall several m... |
cs0312023 | 2951755603 | This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalises traditional termination analysis where an analyser tries to verify termination for a specified mode. Our contribution is a methodology in which components of traditional termination analysis are combined ... | Both systems compute the greatest fixed point of a system of recursive equations. In our case the implementation is based on a simple meta-interpreter written in Prolog. In cTI, the implementation is based on a @math -calculus interpreter. In our case this system of equations is set up as an instance of backwards analy... | {
"cite_N": [
"@cite_23"
],
"mid": [
"1999783590"
],
"abstract": [
"The Constraint Logic Programming (CLP) Scheme merges logic programming with constraint solving over predefined domains. In this article, we study proof methods for universal left termination of constraint logic programs. We provid... |
math0312490 | 2166075559 | As a sequel to our proof of the analog of Serre's conjecture for function fields in Part I of this work, we study in this paper the deformation rings of @math -dimensional mod @math representations @math of the arithmetic fundamental group @math where @math is a geometrically irreducible, smooth curve over a finite fie... | The key qualitative difference between the mentioned works and ours is that we can prove automorphy of residual representations like @math in the theorem, while in the other works this has to be at the moment an imprtant assumption that seems extremely difficult to verify in their number field case; further we are main... | {
"cite_N": [
"@cite_22"
],
"mid": [
"2121723322"
],
"abstract": [
"On demontre la correspondance de Langlands pour GL r sur les corps de fonctions. La preuve generalise celle de Drinfeld en rang 2 : elle consiste a realiser la correspondance en rang r dans la cohomologie l-adique des varietes mod... |
cs0311008 | 2952174649 | Argumentation has proved a useful tool in defining formal semantics for assumption-based reasoning by viewing a proof as a process in which proponents and opponents attack each others arguments by undercuts (attack to an argument's premise) and rebuts (attack to an argument's conclusion). In this paper, we formulate a ... | In @cite_20 , an argumentation semantics for extended logic programs, similar to Prakken and Sartor's, is proposed; it is influenced by WFSX, and distinguishes between sceptical and credulous conclusions of an argument. It also provides a proof theory based on dialogue trees, similar to Prakken and Sartor's. | {
"cite_N": [
"@cite_20"
],
"mid": [
"2140044962"
],
"abstract": [
"The ability to view extended logic programs as argumentation systems opens the way for the use of this language in formalizing communication among reasoning computing agents in a distributed framework. In this paper we define an a... |
cs0311008 | 2952174649 | Argumentation has proved a useful tool in defining formal semantics for assumption-based reasoning by viewing a proof as a process in which proponents and opponents attack each others arguments by undercuts (attack to an argument's premise) and rebuts (attack to an argument's conclusion). In this paper, we formulate a ... | Defeasible Logic Programming @cite_44 @cite_25 @cite_30 is a formalism very similar to Prakken and Sartor's, based on the first order logic argumentation framework of @cite_1 . It includes logic programming with two kinds of negation, distinction between strict and defeasible rules, and allowing for various criteria fo... | {
"cite_N": [
"@cite_30",
"@cite_41",
"@cite_1",
"@cite_44",
"@cite_19",
"@cite_25"
],
"mid": [
"190056634",
"1968513265",
"2156092566",
"2159569510",
"2170232725",
""
],
"abstract": [
"We present here a knowledge representation language, where defeasible an... |
cs0311008 | 2952174649 | Argumentation has proved a useful tool in defining formal semantics for assumption-based reasoning by viewing a proof as a process in which proponents and opponents attack each others arguments by undercuts (attack to an argument's premise) and rebuts (attack to an argument's conclusion). In this paper, we formulate a ... | A number of authors @cite_23 @cite_18 @cite_15 @cite_27 @cite_37 @cite_45 @cite_14 @cite_20 work on argumentation for negotiating agents. Of these, the approaches of @cite_37 @cite_45 @cite_14 are based on logic programming. The advantage of the logic programming approach for arguing agents is the availability of goal-... | {
"cite_N": [
"@cite_18",
"@cite_37",
"@cite_14",
"@cite_27",
"@cite_45",
"@cite_23",
"@cite_15",
"@cite_20"
],
"mid": [
"1509700916",
"",
"",
"2111427732",
"2077144412",
"2095587681",
"1556421367",
"2140044962"
],
"abstract": [
"The need for... |
cs0310016 | 1673079227 | By recording every state change in the run of a program, it is possible to present the programmer every bit of information that might be desired. Essentially, it becomes possible to debug the program by going backwards in time,'' vastly simplifying the process of debugging. An implementation of this idea, the Omniscien... | HERCULE @cite_9 is a tool which can record and replay distributed events, in particular, window events and appearence. It does for windows much of what ODB does for programs, and provides much of the functionality that the ODB lacks. | {
"cite_N": [
"@cite_9"
],
"mid": [
"1566707746"
],
"abstract": [
"This paper presents HERCULE, an approach to non-invasively tracking end-user application activity in a distributed, component-based system. Such tracking can support the visualisation of user and application activity, system auditi... |
cs0310020 | 2119104528 | A simple mathematical definition of the 4-port model for pure Prolog is given. The model combines the intuition of ports with a compact representation of execution state. Forward and backward derivation steps are possible. The model satisfies a modularity claim, making it suitable for formal reasoning. | In contrast to the few specifications of the Byrd box, there are many more general models of pure (or even full) Prolog execution. Due to space limitations we mention here only some models, directly relevant to , and for a more comprehensive discussion see @cite_1 . Comparable to our work are the stack-based approaches... | {
"cite_N": [
"@cite_10",
"@cite_1",
"@cite_3"
],
"mid": [
"158887749",
"2058402932",
"2013417779"
],
"abstract": [
"",
"Abstract The coincidence between the model-theoretic and the procedural semantics of SLD-resolution does not carry over to a Prolog system that also implemen... |
cs0309030 | 1519115557 | ABSTRACTThis paper introduces an automatic debuggingframework that relies on model–based reasoning techniquesto locate faults in programs. In particular, model–based diagnosis, together with an abstract interpretationbased conflict detection mechanism is used to derive diagnoses, which correspond to possible faults in p... | In Program Slicing @cite_15 @cite_4 , statements that cannot influence the value of a variable at a given program point are eliminated by considering the dependencies between the statements. Backward reasoning from output values, as in our approach, is not possible. Similar ideas were successfully utilized in a MBD too... | {
"cite_N": [
"@cite_15",
"@cite_29",
"@cite_4",
"@cite_8"
],
"mid": [
"1575308494",
"1986146602",
"",
"2080412071"
],
"abstract": [
"A program slice consists of the parts of a program that (potentially) affect the values computed at some point of interest. Such a point of ... |
cs0309030 | 1519115557 | ABSTRACTThis paper introduces an automatic debuggingframework that relies on model–based reasoning techniquesto locate faults in programs. In particular, model–based diagnosis, together with an abstract interpretationbased conflict detection mechanism is used to derive diagnoses, which correspond to possible faults in p... | @cite_41 @cite_22 use probability measurements to guide diagnosis. The program debugging process is divided into two steps. In the first one, program parts that may cause a discrepancy are computed by tracing the incorrect output back to the inputs and collecting the involved statements. In a second step, a belief netw... | {
"cite_N": [
"@cite_41",
"@cite_22"
],
"mid": [
"1596732274",
"1968814228"
],
"abstract": [
"We describe the integration of logical and uncertain reasoning methods to identify the likely source and location of software problems. To date, software engineers have had few tools for identifyi... |
cs0309030 | 1519115557 | ABSTRACTThis paper introduces an automatic debuggingframework that relies on model–based reasoning techniquesto locate faults in programs. In particular, model–based diagnosis, together with an abstract interpretationbased conflict detection mechanism is used to derive diagnoses, which correspond to possible faults in p... | Jackson @cite_35 introduces a framework to detect faults in programs that manifest through changed dependencies between the input and the output variables of a program. The approach detects differences between the dependencies computed for a program and the dependencies specified by the user. It is able to detect certa... | {
"cite_N": [
"@cite_35"
],
"mid": [
"2073241739"
],
"abstract": [
"Aspect is a static analysis technique for detecting bugs in imperative programs, consisting of an annotation language and a checking tool. Like a type declaration, an Aspect annotation of a procedure is a kind of declarative, part... |
cs0309030 | 1519115557 | ABSTRACTThis paper introduces an automatic debuggingframework that relies on model–based reasoning techniquesto locate faults in programs. In particular, model–based diagnosis, together with an abstract interpretationbased conflict detection mechanism is used to derive diagnoses, which correspond to possible faults in p... | @cite_16 apply similar ideas to knowledge base maintenance, exploiting hierarchical information to speed up the diagnostic process and to reduce the number of diagnoses. | {
"cite_N": [
"@cite_16"
],
"mid": [
"199096196"
],
"abstract": [
"Debugging, validation, and maintenance of configurator knowledge bases are important tasks for the successful deployment of product configuration systems, due to frequent changes (e.g., new component types, new regulations) in the ... |
cs0309030 | 1519115557 | ABSTRACTThis paper introduces an automatic debuggingframework that relies on model–based reasoning techniquesto locate faults in programs. In particular, model–based diagnosis, together with an abstract interpretationbased conflict detection mechanism is used to derive diagnoses, which correspond to possible faults in p... | Abstract Interpretation to analyze programs was first introduced by @cite_0 , and later extended by @cite_25 @cite_23 to include assertions for abstract debugging. Their approach aims at analyzing every possible execution of a program, which makes is suitable to detect errors even in the case where no test cases are av... | {
"cite_N": [
"@cite_0",
"@cite_27",
"@cite_25",
"@cite_23"
],
"mid": [
"2043100293",
"1984342415",
"2165069483",
"149979760"
],
"abstract": [
"A program denotes computations in some universe of objects. Abstract interpretation of programs consists in using that denotation ... |
cs0309030 | 1519115557 | ABSTRACTThis paper introduces an automatic debuggingframework that relies on model–based reasoning techniquesto locate faults in programs. In particular, model–based diagnosis, together with an abstract interpretationbased conflict detection mechanism is used to derive diagnoses, which correspond to possible faults in p... | Recently, model checking approaches have been extended to attempt fault localization in counterexample traces. @cite_40 extended a model checking algorithm that is able to pinpoint transitions in traces responsible for a faulty behavior. @cite_39 presents another approach, which explores the neighborhood of counterexam... | {
"cite_N": [
"@cite_40",
"@cite_39"
],
"mid": [
"2158870716",
"1511405608"
],
"abstract": [
"There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom of an error. As a res... |
cs0309031 | 1638678101 | Many programmers have had to deal with an overwritten variable resulting for example from an aliasing problem. The culprit is obviously the last write-access to that memory location before the manifestation of the bug. The usual technique for removing such bugs starts with the debugger by (1) finding the last write and... | Boothe @cite_18 made a C debugger with reverse execution capability using a step counter which counts the number of step executions and re-execution from the beginning of debuggees. The capability could be also implemented with our timestamp counter and re-execution. The difference comes from the purpose of each projec... | {
"cite_N": [
"@cite_18"
],
"mid": [
"1969550081"
],
"abstract": [
"This paper discusses our research into algorithms for creating anefficient bidirectional debugger in which all traditional forward movement commands can be performed with equal ease in the reverse direction. We expect that adding ... |
cs0309031 | 1638678101 | Many programmers have had to deal with an overwritten variable resulting for example from an aliasing problem. The culprit is obviously the last write-access to that memory location before the manifestation of the bug. The usual technique for removing such bugs starts with the debugger by (1) finding the last write and... | @cite_17 , Moher @cite_8 and @cite_15 save complete memory history of process to achieve fully random accessibility to program states. Their systems have to deal with large log''. Our system, however, saves only a pair of line number and value of timestamp to obtain the same capability by assuming the determinism of de... | {
"cite_N": [
"@cite_8",
"@cite_15",
"@cite_17"
],
"mid": [
"2153838924",
"2060071172",
"2082498963"
],
"abstract": [
"The author introduces PROVIDE, a source-level process visualization and debugging environment currently under development at the University of Illinois at Chicago.... |
cs0309031 | 1638678101 | Many programmers have had to deal with an overwritten variable resulting for example from an aliasing problem. The culprit is obviously the last write-access to that memory location before the manifestation of the bug. The usual technique for removing such bugs starts with the debugger by (1) finding the last write and... | Ducass ' e @cite_26 allows the programmer to control the execution not by source statement orientation, but by event orientation such as assignments, function calls, loops, and so on. Users write Prolog-like forms to designate breakpoints which have complex conditions. This mechanism is complementary to our system and ... | {
"cite_N": [
"@cite_26"
],
"mid": [
"1985444680"
],
"abstract": [
"Presents Coca, an automated debugger for C, where the breakpoint mechanism is based on events related to language constructs. Events have semantics, whereas the source lines used by most debuggers do not have any. A trace is a seq... |
cs0309031 | 1638678101 | Many programmers have had to deal with an overwritten variable resulting for example from an aliasing problem. The culprit is obviously the last write-access to that memory location before the manifestation of the bug. The usual technique for removing such bugs starts with the debugger by (1) finding the last write and... | @cite_1 @cite_10 developed a event-based instrumentation tool, CCI, which inserts instrumentation codes into C source codes. The converted codes have platform independence. The execution slowdown, however, is 2.09 times in the case of laplace.c and 5.85 times in the case of life.c @cite_10 . In order to achieve positio... | {
"cite_N": [
"@cite_10",
"@cite_1"
],
"mid": [
"2243384985",
"2096537660"
],
"abstract": [
"The Alamo monitor architecture reduces the difficulty of writing dynamic analysis tools such as special-purpose profilers, bug-detectors, and visualizations.",
"Automatic software instrumentati... |
cs0309031 | 1638678101 | Many programmers have had to deal with an overwritten variable resulting for example from an aliasing problem. The culprit is obviously the last write-access to that memory location before the manifestation of the bug. The usual technique for removing such bugs starts with the debugger by (1) finding the last write and... | @cite_3 made EEL, which is a library for building tools to analyze and modify an executable program. Using EEL, we could implement the insertion of codes to maintain timestamp in executable code level. The solution, however, is dependent on a specified platform, so we chose the intermediate code level and modified GCC. | {
"cite_N": [
"@cite_3"
],
"mid": [
"2040183246"
],
"abstract": [
"EEL (Executable Editing Library) is a library for building tools to analyze and modify an executable (compiled) program. The systems and languages communities have built many tools for error detection, fault isolation, architecture... |
cs0309037 | 2158179037 | This paper presents a novel technique for the automatic type identification of arbitrary memory objects from a memory dump. Our motivating application is debugging memory corruption problems in optimized, production systems — a problem domain largely unserved by extant methodologies. We describe our algorithm as applic... | The problem of debugging memory corruption problems in production was explicitly identified by Patil and Fischer in @cite_2 , in which they describe using idle processors to absorb their technique's substantial performance impact. Unfortunately, this is not practical in a general-purpose system: idle processors cannot ... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2056452385"
],
"abstract": [
"Efficient Run-time Monitoring Using Shadow Processing Harish Patil* and Charles Fischer University of Wisconsin —Madison** Abstract General purpose multiprocessors are becoming increasingly common. We propose using pairs of process... |
cs0309037 | 2158179037 | This paper presents a novel technique for the automatic type identification of arbitrary memory objects from a memory dump. Our motivating application is debugging memory corruption problems in optimized, production systems — a problem domain largely unserved by extant methodologies. We describe our algorithm as applic... | Some memory allocators have addressed debugging problems in production by allowing their behavior to be dynamically changed to provide greater debugging support @cite_13 . This allows optimal allocators to be deployed into production, while still allowing their debugging features to be later enabled should problems ari... | {
"cite_N": [
"@cite_13"
],
"mid": [
"1746694335"
],
"abstract": [
"This paper presents a comprehensive design overview of the SunOS 5.4 kernel memory allocator. This allocator is based on a set of object-caching primitives that reduce the cost of allocating complex objects by retaining their stat... |
cs0309037 | 2158179037 | This paper presents a novel technique for the automatic type identification of arbitrary memory objects from a memory dump. Our motivating application is debugging memory corruption problems in optimized, production systems — a problem domain largely unserved by extant methodologies. We describe our algorithm as applic... | If memory corruption cannot be acceptably prevented in production code, then the focus must shift to debugging the corruption postmortem. While the notion of postmortem debugging has existed since the earliest dawn of debugging @cite_5 , there seems to have been very little work on postmortem debugging of memory corrup... | {
"cite_N": [
"@cite_5",
"@cite_10"
],
"mid": [
"2020874122",
"2044423461"
],
"abstract": [
"This paper describes methods developed at the Cambridge University Mathematical Laboratory for the speedy diagnosis of mistakes in programmes for an automatic high-speed digital computer. The aim o... |
cs0309037 | 2158179037 | This paper presents a novel technique for the automatic type identification of arbitrary memory objects from a memory dump. Our motivating application is debugging memory corruption problems in optimized, production systems — a problem domain largely unserved by extant methodologies. We describe our algorithm as applic... | The only nod to postmortem debugging of memory corruption seems to come from memory allocators such as the slab allocator @cite_13 used by the Solaris kernel. This allocator can optionally log information with each allocation and deallocation; in the event of failure, these logs can be used to determine the subsystem a... | {
"cite_N": [
"@cite_13"
],
"mid": [
"1746694335"
],
"abstract": [
"This paper presents a comprehensive design overview of the SunOS 5.4 kernel memory allocator. This allocator is based on a set of object-caching primitives that reduce the cost of allocating complex objects by retaining their stat... |
cs0309055 | 1495757250 | In this paper, we propose a mathematical framework for automated bug localization. This framework can be briefly summarized as follows. A program execution can be represented as a rooted acyclic directed graph. We define an execution snapshot by a cut-set on the graph. A program state can be regarded as a conjunction o... | * Shapiro's algorithmic debugging was invented for prolog programs @cite_2 . Fig. shows our interpretation of his work. From our viewpoint, it uses a proof tree as an execution graph. (Attention: This interpretation differs from a normal proof tree. Our interpretation is based on a line graph A line graph can be get by... | {
"cite_N": [
"@cite_0",
"@cite_6",
"@cite_2"
],
"mid": [
"2044672898",
"2134080718",
"1514468887"
],
"abstract": [
"Algorithmic Debugging is a theory of debugging that uses queries on the compositional semantics of a program in order to localize bugs. It uses the following princip... |
cs0308007 | 2950479998 | The past years have seen widening efforts at increasing Prolog's declarativeness and expressiveness. Tabling has proved to be a viable technique to efficiently overcome SLD's susceptibility to infinite loops and redundant subcomputations. Our research demonstrates that implicit or-parallelism is a natural fit for logic... | A first proposal on how to exploit implicit parallelism in tabling systems was Freire's @cite_53 . In this model, each tabled subgoal is computed independently in a single computational thread, a . Each generator thread is associated with a unique tabled subgoal and it is responsible for fully exploiting its search tre... | {
"cite_N": [
"@cite_53"
],
"mid": [
"1608806855"
],
"abstract": [
"This paper addresses general issues involved in parallelizing tabled evaluations by introducing a model of shared-memory parallelism which we call table-parallelism, and by comparing it to traditional models of parallelizing SLD. ... |
cs0308007 | 2950479998 | The past years have seen widening efforts at increasing Prolog's declarativeness and expressiveness. Tabling has proved to be a viable technique to efficiently overcome SLD's susceptibility to infinite loops and redundant subcomputations. Our research demonstrates that implicit or-parallelism is a natural fit for logic... | There have been other proposals for concurrent tabling but in a distributed memory context. Hu @cite_46 was the first to formulate a method for distributed tabled evaluation termed . This method matches subgoals with processors in a similar way to Freire's approach. Each processor gets a single subgoal and it is respon... | {
"cite_N": [
"@cite_46"
],
"mid": [
"2495949634"
],
"abstract": [
"SLG resolution, a type of tabled resolution and a technique of logic programming (LP), has polynomial data complexity for ground Datalog queries with negation, making it suitable for deductive database (DDB). It evaluates non-stra... |
cs0308015 | 2109841503 | OpenPGP, an IETF Proposed Standard based on PGP application, has its own Public Key Infrastructure (PKI) architecture which is different from the one based on X.509, another standard from ITU. This paper describes the OpenPGP PKI; the historical perspective as well as its current use. The current OpenPGP PKI issues inc... | A web of trust'' used in PGP is referred in several researches including the peer-to-peer authentication @cite_9 , trust computation @cite_7 @cite_14 , and privacy enhanced technology @cite_6 . However, there are few description on PGP keyserver. It might be because PGP keyserver mechanism is too simple. It is not a CA... | {
"cite_N": [
"@cite_14",
"@cite_7",
"@cite_9",
"@cite_6",
"@cite_20"
],
"mid": [
"1850823044",
"1585665690",
"1586036900",
"1494178662",
""
],
"abstract": [
"Most currently deployed public key infrastructures (PKIs) are hierarchically oriented and rely on a central... |
cs0308015 | 2109841503 | OpenPGP, an IETF Proposed Standard based on PGP application, has its own Public Key Infrastructure (PKI) architecture which is different from the one based on X.509, another standard from ITU. This paper describes the OpenPGP PKI; the historical perspective as well as its current use. The current OpenPGP PKI issues inc... | OpenPGP PKI itself can be described as the superset of PKI @cite_27 , however, combining OpenPGP PKI with other authentication system is challenging work in both theoretical and operational field. Formal study of trust relationship of PKI started in the late 1990s @cite_7 @cite_14 and GnuPG development version in Decem... | {
"cite_N": [
"@cite_27",
"@cite_14",
"@cite_7"
],
"mid": [
"",
"1850823044",
"1585665690"
],
"abstract": [
"",
"Most currently deployed public key infrastructures (PKIs) are hierarchically oriented and rely on a centralized design. Hierarchical PKIs may be appropriate solution... |
cs0308044 | 2950013766 | A new method of hierarchical clustering of graph vertexes is suggested. In the method, the graph partition is determined with an equivalence relation satisfying a recursive definition stating that vertexes are equivalent if the vertexes they point to (or vertexes pointing to them) are equivalent. Iterative application ... | In this subsection, we demonstrate that above equivalence relation @math is a natural development of the recursive algorithms PageRank @cite_5 , HITS @cite_12 , and SimRank @cite_3 , which became lately quite popular among the network miners. | {
"cite_N": [
"@cite_5",
"@cite_3",
"@cite_12"
],
"mid": [
"1854214752",
"",
"2138621811"
],
"abstract": [
"The importance of a Web page is an inherently subjective matter, which depends on the readers interests, knowledge and attitudes. But there is still much that can be said obj... |
cs0307073 | 1636672680 | We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails through the graph of foreign key dependencies. It differs from previous efforts in the algorithms used, in the presentation mechanism and in the use ... | DBXplorer @cite_3 was developed by Microsoft Research, and like BANKS and Mragyati, it uses join trees to compute an SQL statement to access the data. The algorithm to compute these differs, as does the implementation, which was developed for Microsoft's IIS and SQL Server, the others being implemented in Java. DbSurfe... | {
"cite_N": [
"@cite_3"
],
"mid": [
"2121350579"
],
"abstract": [
"Internet search engines have popularized the keyword-based search paradigm. While traditional database management systems offer powerful query languages, they do not allow keyword-based search. In this paper, we discuss DBXplorer, ... |
cs0307073 | 1636672680 | We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails through the graph of foreign key dependencies. It differs from previous efforts in the algorithms used, in the presentation mechanism and in the use ... | DISCOVER is the latest offering and shares many similarities to Mragyati, BANKS and DbXplorer, but uses a greedy algorithm to discover the @cite_17 . It also takes greater advantage of the database's internal keyword search facilities by using Oracle's Context cartridge for the text indexing. | {
"cite_N": [
"@cite_17"
],
"mid": [
"2098388305"
],
"abstract": [
"DISCOVER operates on relational databases and facilitates information discovery on them by allowing its user to issue keyword queries without any knowledge of the database schema or of SQL. DISCOVER returns qualified joining netwo... |
cs0307073 | 1636672680 | We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails through the graph of foreign key dependencies. It differs from previous efforts in the algorithms used, in the presentation mechanism and in the use ... | have also introduced a system for keyword search @cite_40 . Their system works by finding results for queries of the form @math near @math (e.g. find movie near travolta cage). Two sets of entries are found - and the contents of the first set are returned based upon their proximity to members of the second set. In comp... | {
"cite_N": [
"@cite_40"
],
"mid": [
"1671881141"
],
"abstract": [
"An information retrieval (IR) engine can rank documents based on textual proximity of keywords within each document. In this paper we apply this notion to search across an entire database for objects that are \"near\" other releva... |
cs0307073 | 1636672680 | We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails through the graph of foreign key dependencies. It differs from previous efforts in the algorithms used, in the presentation mechanism and in the use ... | The join discovery problem is related to the problem tackled by the @cite_18 @cite_11 . The idea underlying the universal relation model is to allow querying the database soley through its attributes without explicitly specifying the join paths. The expressive querying power of such a system is essentially that of a un... | {
"cite_N": [
"@cite_19",
"@cite_18",
"@cite_11"
],
"mid": [
"2146899290",
"2162621793",
""
],
"abstract": [
"The representative instance is proposed as a representation of the data stored in a database whose relations are not the projections of a universal instance. Database schem... |
quant-ph0307150 | 2110240249 | The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine and continues to be of enormous benefit in the classical theory of computation. We propose that quantum comput... | Ideas stemming from linear logic have been used previously by Abramsky in the study of classical reversible computation @cite_44 . | {
"cite_N": [
"@cite_44"
],
"mid": [
"2015392385"
],
"abstract": [
"Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focusse... |
quant-ph0307150 | 2110240249 | The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine and continues to be of enormous benefit in the classical theory of computation. We propose that quantum comput... | One of the earlier attempts at formulating a language for quantum computation was Greg Baker's Qgol @cite_23 . Its implementation (which remained incomplete) used so-called uniqueness types (similar but not identical to our linear variables) for quantum objects @cite_36 . The language is not universal for quantum compu... | {
"cite_N": [
"@cite_36",
"@cite_23"
],
"mid": [
"1555216982",
"1484366641"
],
"abstract": [
"In this paper we describe a Curry-like type system for graphs and extend it with uniqueness information to indicate that certain objects are only ‘locally accessible’. The correctness of type assi... |
quant-ph0307150 | 2110240249 | The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine and continues to be of enormous benefit in the classical theory of computation. We propose that quantum comput... | Another imperative language, based on C++, is the Q language developed by Bettelli, Calarco and Serafini @cite_7 . As in the case of QCL, no formal calculus is provided. A simulator is also available. | {
"cite_N": [
"@cite_7"
],
"mid": [
"2121369607"
],
"abstract": [
"It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mi... |
quant-ph0307150 | 2110240249 | The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine and continues to be of enormous benefit in the classical theory of computation. We propose that quantum comput... | A more theoretical approach is taken by Selinger in his description of the functional language QPL @cite_26 . This language has both a graphical and a textual representation. A formal semantics is provided. | {
"cite_N": [
"@cite_26"
],
"mid": [
"1999626800"
],
"abstract": [
"We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines... |
quant-ph0307150 | 2110240249 | The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine and continues to be of enormous benefit in the classical theory of computation. We propose that quantum comput... | The imperative language qGCL, developed by Sanders and Zuliani @cite_63 , is based on Dijkstra's guarded command language. It has a formal semantics and proof system. | {
"cite_N": [
"@cite_63"
],
"mid": [
"2123328018"
],
"abstract": [
"The rapid progress of computer technology has been accompanied by a corresponding evolution of software development, from hardwired components and binary machine code to high level programming languages, which allowed to master th... |
quant-ph0307150 | 2110240249 | The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine and continues to be of enormous benefit in the classical theory of computation. We propose that quantum comput... | A previous attempt to construct a lambda calculus for quantum computation is described by Maymin in @cite_27 . However, his calculus appears to be strictly stronger than the quantum Turing machine @cite_19 . It seems to go beyond quantum mechanics in that it does not appear to have a unitary and reversible operational ... | {
"cite_N": [
"@cite_19",
"@cite_27"
],
"mid": [
"1668464107",
"1676498955"
],
"abstract": [
"We show that the lambda-q calculus can efficiently simulate quantum Turing machines by showing how the lambda-q calculus can efficiently simulate a class of quantum cellular automaton that are equ... |
quant-ph0307150 | 2110240249 | The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine and continues to be of enormous benefit in the classical theory of computation. We propose that quantum comput... | A seminar by Wehr @cite_41 suggests that linear logic may be useful in constructing a calculus for quantum computation within the mathematical framework of Chu spaces. However, the author stops short of developing such a calculus. | {
"cite_N": [
"@cite_41"
],
"mid": [
"2006290558"
],
"abstract": [
"Recently a great deal of attention has been focused on quantum computation following a sequence of results [Bernstein and Vazirani, in Proc. 25th Annual ACM Symposium Theory Comput., 1993, pp. 11--20, SIAM J. Comput., 26 (1997), p... |
quant-ph0307150 | 2110240249 | The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine and continues to be of enormous benefit in the classical theory of computation. We propose that quantum comput... | Abramsky and Coecke describe a realization of a model of multiplicative linear logic via the quantum processes of entangling and de-entangling by means of typed projectors. They briefly discuss how these processes can be represented as terms of an affine lambda calculus @cite_15 . | {
"cite_N": [
"@cite_15"
],
"mid": [
"1958788572"
],
"abstract": [
"Abstract Within the Geometry of Interaction (GoI) paradigm, we present a setting that enables qualitative differences between classical and quantum processes to be explored. The key construction is the physical interpretation real... |
cs0306044 | 2952425141 | We define a measure of competitive performance for distributed algorithms based on throughput, the number of tasks that an algorithm can carry out in a fixed amount of work. This new measure complements the latency measure of , which measures how quickly an algorithm can finish tasks that start at specified times. The ... | In addition, there is a long history of interest in optimality of a distributed algorithm given certain conditions, such as a particular pattern of failures @cite_23 @cite_26 @cite_11 @cite_35 @cite_27 @cite_33 , or a particular pattern of message delivery @cite_1 @cite_42 @cite_3 . In a sense, work on optimality envis... | {
"cite_N": [
"@cite_35",
"@cite_26",
"@cite_33",
"@cite_42",
"@cite_1",
"@cite_3",
"@cite_27",
"@cite_23",
"@cite_11"
],
"mid": [
"2092431596",
"2091004544",
"2078564399",
"1963734157",
"1600854295",
"",
"2054383044",
"2058777482",
""
],
... |
cs0306048 | 1675778287 | Dataset storage, exchange, and access play a critical role in scientific applications. For such purposes netCDF serves as a portable and efficient file format and programming interface, which is popular in numerous scientific application domains. However, the original interface does not provide an efficient mechanism f... | MPI-IO is a parallel I O interface specified in the MPI-2 standard. It is implemented and used on a wide range of platforms. The most popular implementation, ROMIO @cite_13 is implemented portably on top of an abstract I O device layer @cite_1 @cite_22 that enables portability to new underlying I O systems. One of the ... | {
"cite_N": [
"@cite_18",
"@cite_22",
"@cite_1",
"@cite_2",
"@cite_13",
"@cite_20",
"@cite_11"
],
"mid": [
"2082416889",
"2104486653",
"2111925167",
"2174300520",
"2567936601",
"2108155100",
"2083200599"
],
"abstract": [
"A number of applications on ... |
cs0305010 | 1668544585 | Numerous systems for dissemination, retrieval, and archiving of documents have been developed in the past. Those systems often focus on one of these aspects and are hard to extend and combine. Typically, the transmission protocols, query and filtering languages are fixed as well as the interfaces to other systems. We r... | @cite_12 is a push-model publish subscribe system for alerting within a wide-area network. It offers scalability by distributing filters over servers within the network and saving bandwidth by filtering close to the event sources and bundling similar subscriptions. Siena is modular and offers sophisticated filtering me... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2131975004"
],
"abstract": [
"The components of a loosely coupled system are typically designed to operate by generating and responding to asynchronous events. An event notification service is an application-independent infrastructure that supports the constru... |
math0304100 | 2115080784 | The Shub-Smale Tau Conjecture is a hypothesis relating the number of integral roots of a polynomial f in one variable and the Straight-Line Program (SLP) complexity of f. A consequence of the truth of this conjecture is that, for the Blum-Shub-Smale model over the complex numbers, P differs from NP. We prove two weak v... | That the @math -conjecture is still open is a testament to the fact that we know far less about the complexity measures @math and @math than we should. For example, there is still no more elegant method known to compute @math for a fixed polynomial than brute force enumeration. Also, the computability of additive compl... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2032345729"
],
"abstract": [
"We design an algorithm for computing the generalized (algebraic circuits with root extracting; cf. Pippenger [J. Comput. System Sci., 22 (1981), pp. 454--470], Ja'Ja' [Proc. 22nd IEEE FOCS, 1981, pp. 95--100], Grigoriev, Singer, a... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.