aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
cs0603115 | 1539159366 | The Graphic Processing Unit (GPU) has evolved into a powerful and flexible processor. The latest graphic processors provide fully programmable vertex and pixel processing units that support vector operations up to single floating-point precision. This computational power is now being used for general-purpose computatio... | Others libraries represent multiprecision numbers as the unevaluated sum of several double-precision FP numbers such as Briggs' double-double @cite_18 , Bailey's quad-doubles @cite_5 and Daumas' floating-point expansions @cite_0 . This representation format is based on the IEEE-754 features that lead to simple algorith... | {
"cite_N": [
"@cite_0",
"@cite_5",
"@cite_18"
],
"mid": [
"2163593765",
"2104380208",
""
],
"abstract": [
"In modern computers, the floating point unit is the part of the processor delivering the highest computing power and getting most attention from the design team. Performance ... |
cs0603115 | 1539159366 | The Graphic Processing Unit (GPU) has evolved into a powerful and flexible processor. The latest graphic processors provide fully programmable vertex and pixel processing units that support vector operations up to single floating-point precision. This computational power is now being used for general-purpose computatio... | For example, Strzodka @cite_14 proposed a 16-bit fixed-point representation and operation out of the 8-bit fixed-point format. In his work, two 8-bit numbers were used to emulate 16-bit. The author claimed that operators in his representation format were only $50 | {
"cite_N": [
"@cite_14"
],
"mid": [
"69766967"
],
"abstract": [
"There is a growing demand for high precision texture formats fed by the increasing number of textures per pixel and multi-pass algorithms in dynamic texturing and visualization. Therefore support for wider data formats in graphics h... |
quant-ph0601097 | 1545991018 | In this note we consider optimised circuits for implementing Shor's quantum factoring algorithm. First I give a circuit for which none of the about 2n qubits need to be initialised (though we still have to make the usual 2n measurements later on). Then I show how the modular additions in the algorithm can be carried ou... | Also I understand that John Watrous @cite_4 has been using uniform superpositions of subgroups (and cosets) in his work on quantum algorithms for solvable groups. Thus he also used coset superpositions to represent elements of the factor group (and probably also to carry out factor group operations on them). In our cas... | {
"cite_N": [
"@cite_4"
],
"mid": [
"1967088292"
],
"abstract": [
"In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and ... |
cs0601044 | 2950161596 | Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited number of samples. This paper is an investigation on two methods to improve generalization in GP-based learning: 1) the selection of the best... | Some GP learning applications @cite_11 @cite_2 @cite_18 have made use of a three data sets methodology, but without making a thorough analysis of its effects. Panait and Luke @cite_25 conducted some experiments on different approaches to increase the robustness of the solutions generated by GP, using a three data sets ... | {
"cite_N": [
"@cite_18",
"@cite_4",
"@cite_21",
"@cite_2",
"@cite_25",
"@cite_11"
],
"mid": [
"",
"2027433115",
"2133454221",
"1593492645",
"1828504193",
""
],
"abstract": [
"",
"In genetic programming (GP), learning problems can be classified broadly i... |
cs0601044 | 2950161596 | Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited number of samples. This paper is an investigation on two methods to improve generalization in GP-based learning: 1) the selection of the best... | Because of the bloat phenomenon, typical in GP, parsimony pressure has been more widely studied @cite_19 @cite_12 @cite_15 @cite_23 . In particular, several papers @cite_5 @cite_22 @cite_1 have produced interesting results around the idea of using a parsimony pressure to increase the generalization capability of GP-evo... | {
"cite_N": [
"@cite_22",
"@cite_1",
"@cite_19",
"@cite_23",
"@cite_5",
"@cite_15",
"@cite_13",
"@cite_12",
"@cite_17"
],
"mid": [
"2155582960",
"2139470281",
"1591505907",
"",
"1592596255",
"83216595",
"1951785234",
"1500215390",
"1761022139... |
cs0601051 | 1489954224 | This technical note describes a monotone and continuous fixpoint operator to compute the answer sets of programs with aggregates. The fixpoint operator relies on the notion of aggregate solution. Under certain conditions, this operator behaves identically to the three-valued immediate consequence operator @math for agg... | This notion of unfolding derives from the work on unfolding of intensional sets @cite_8 , and has been independently described in @cite_5 . | {
"cite_N": [
"@cite_5",
"@cite_8"
],
"mid": [
"80590317",
"2027993053"
],
"abstract": [
"Dept. of Computer Science, K.U.LeuvenCelestijnenlaan 200A, B-3001 Heverlee, BelgiumE-mail: pelov,marcd,maurice @cs.kuleuven.ac.beAbstract. We define a translation of aggregate programs to normal lo-gic... |
cs0601051 | 1489954224 | This technical note describes a monotone and continuous fixpoint operator to compute the answer sets of programs with aggregates. The fixpoint operator relies on the notion of aggregate solution. Under certain conditions, this operator behaves identically to the three-valued immediate consequence operator @math for agg... | The work of @cite_5 @cite_2 @cite_11 contains an elegant generalization of several semantics of logic programs to logic programs with aggregates. The key idea in this work is the use of approximation theory in defining several semantics for logic programs with aggregates (e.g., two-valued semantics, ultimate three-valu... | {
"cite_N": [
"@cite_5",
"@cite_11",
"@cite_2"
],
"mid": [
"80590317",
"1520574003",
"125332145"
],
"abstract": [
"Dept. of Computer Science, K.U.LeuvenCelestijnenlaan 200A, B-3001 Heverlee, BelgiumE-mail: pelov,marcd,maurice @cs.kuleuven.ac.beAbstract. We define a translation of ag... |
cs0601051 | 1489954224 | This technical note describes a monotone and continuous fixpoint operator to compute the answer sets of programs with aggregates. The fixpoint operator relies on the notion of aggregate solution. Under certain conditions, this operator behaves identically to the three-valued immediate consequence operator @math for agg... | For the sake of completeness, we will review the translation of @cite_5 , presented using the notation of our paper. Given a ground logic program with aggregates @math , @math denotes the ground normal logic program obtained after the translation. The process begins with the translation of each aggregate atom @math of ... | {
"cite_N": [
"@cite_5"
],
"mid": [
"80590317"
],
"abstract": [
"Dept. of Computer Science, K.U.LeuvenCelestijnenlaan 200A, B-3001 Heverlee, BelgiumE-mail: pelov,marcd,maurice @cs.kuleuven.ac.beAbstract. We define a translation of aggregate programs to normal lo-gic programs which preserves the set... |
cs0601051 | 1489954224 | This technical note describes a monotone and continuous fixpoint operator to compute the answer sets of programs with aggregates. The fixpoint operator relies on the notion of aggregate solution. Under certain conditions, this operator behaves identically to the three-valued immediate consequence operator @math for agg... | In @cite_5 , it is shown that answer sets of @math coincide with the of @math (defined by the operator @math ). This, together with the above lemma and Theorem , allows us to conclude the following theorem. | {
"cite_N": [
"@cite_5"
],
"mid": [
"80590317"
],
"abstract": [
"Dept. of Computer Science, K.U.LeuvenCelestijnenlaan 200A, B-3001 Heverlee, BelgiumE-mail: pelov,marcd,maurice @cs.kuleuven.ac.beAbstract. We define a translation of aggregate programs to normal lo-gic programs which preserves the set... |
cs0601068 | 1628238937 | In this paper, we present a system called Checkbochs, a machine simulator that checks rules about its guest operating system and applications at the hardware level. The properties to be checked can be implemented as plugins' in the Checkbochs simulator. Some of the properties that were checked using Checkbochs include ... | Static compile-time analysis with programmer written compiler-extensions was used to catch around 500 bugs in the linux kernel @cite_6 , @cite_3 . Using static data flow analysis and domain specific knowledge, many bugs were found in the heavily audited kernel. Ways have also been suggested to automatically detect anom... | {
"cite_N": [
"@cite_3",
"@cite_6",
"@cite_2"
],
"mid": [
"1600965014",
"2066859698",
"2043811931"
],
"abstract": [
"This paper shows how system-specific static analysis can find security errors that violate rules such as \"integers from untrusted sources must be sanitized before u... |
cs0601068 | 1628238937 | In this paper, we present a system called Checkbochs, a machine simulator that checks rules about its guest operating system and applications at the hardware level. The properties to be checked can be implemented as plugins' in the Checkbochs simulator. Some of the properties that were checked using Checkbochs include ... | Recently, model checking was used to find serious file system errors @cite_8 . Using an abstract model and intelligent reduction of the state space, they could check for errors which would have required an exponential number of search paths through traditional testing. Model checking can check for deeper semantic bugs ... | {
"cite_N": [
"@cite_8"
],
"mid": [
"2124877509"
],
"abstract": [
"This article shows how to use model checking to find serious errors in file systems. Model checking is a formal verification technique tuned for finding corner-case errors by comprehensively exploring the state spaces defined by a ... |
cs0601068 | 1628238937 | In this paper, we present a system called Checkbochs, a machine simulator that checks rules about its guest operating system and applications at the hardware level. The properties to be checked can be implemented as plugins' in the Checkbochs simulator. Some of the properties that were checked using Checkbochs include ... | Shadow machine simulation has been previously used to perform taint analysis to determine the data lifetime of sensitive data @cite_0 . This work reported a startling observation that sensitive data like passwords and credit card numbers may reside in computer's memory and disk long after the user has logged out. Such ... | {
"cite_N": [
"@cite_0"
],
"mid": [
"1499241274"
],
"abstract": [
"Strictly limiting the lifetime (i.e. propagation and duration of exposure) of sensitive data (e.g. passwords) is an important and well accepted practice in secure software development. Unfortunately, there are no current methods av... |
cs0601068 | 1628238937 | In this paper, we present a system called Checkbochs, a machine simulator that checks rules about its guest operating system and applications at the hardware level. The properties to be checked can be implemented as plugins' in the Checkbochs simulator. Some of the properties that were checked using Checkbochs include ... | Recently, @cite_11 used taint-analysis on untrusted data to check for security violations such as buffer overflows and formatstring attacks in applications. By implementing a valgrind skin, they were able to restrict the overhead of their taint-analysis tool to 10-25x. Considering that the computation power is relative... | {
"cite_N": [
"@cite_11"
],
"mid": [
"2102970979"
],
"abstract": [
"Software vulnerabilities have had a devastating effect on the Internet. Worms such as CodeRed and Slammer can compromise hundreds of thousands of hosts within hours or even minutes, and cause millions of dollars of damage [26, 43]... |
cs0601073 | 1535620672 | In this work we develop a new theory to analyse the process of routing in large-scale ad-hoc wireless networks. We use a path integral formulation to examine the properties of the paths generated by different routing strategies in these kinds of networks. Using this theoretical framework, we calculate the statistical d... | The distribution of distances between source and destination nodes has been calculated before @cite_8 @cite_6 . Both cited approaches are dependent on a two-dimensional geometry which is justifiable up to some extent. In this work we opt for a three-dimensional formulation of the problem in order not to restrict the to... | {
"cite_N": [
"@cite_6",
"@cite_8"
],
"mid": [
"2161981474",
"2156192134"
],
"abstract": [
"In this paper we study the lengths of the routes in ad hoc networks. We propose a simplified theoretical model having as objective to estimate the path length for the routing protocols that are usin... |
cs0601073 | 1535620672 | In this work we develop a new theory to analyse the process of routing in large-scale ad-hoc wireless networks. We use a path integral formulation to examine the properties of the paths generated by different routing strategies in these kinds of networks. Using this theoretical framework, we calculate the statistical d... | The analysis of the routing problem dependent on a length scale that characterizes the awareness of the distributed routing protocol of its environment is not original and has been used before in the work by Melodia @cite_0 . The authors of this work introduce a phenomenological quantity called Knowledge Range" represe... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2126003739"
],
"abstract": [
"Since ad hoc and sensor networks can be composed of a very large number of devices, the scalability of network protocols is a major design concern. Furthermore, network protocols must be designed to prolong the battery lifetime of ... |
cs0601073 | 1535620672 | In this work we develop a new theory to analyse the process of routing in large-scale ad-hoc wireless networks. We use a path integral formulation to examine the properties of the paths generated by different routing strategies in these kinds of networks. Using this theoretical framework, we calculate the statistical d... | The use of random walks as an effective (or unique) strategy for routing in Large-Scale Ad-Hoc Networks has been suggested in some works @cite_1 @cite_13 . In these works, the common drive to use this strategy is the logical conclusion that effective distributed routing in a large-scale network is unfeasible as it woul... | {
"cite_N": [
"@cite_13",
"@cite_9",
"@cite_1"
],
"mid": [
"1561598073",
"2112169033",
"2120361596"
],
"abstract": [
"The task of moving data (i.e., the routing problem) in large-scale sensor networks has to contend with several obstacles, including severe power constraints at each... |
cs0601089 | 1912679131 | This paper addresses the problem of distributed learning under communication constraints, motivated by distributed signal processing in wireless sensor networks and data mining with distributed databases. After formalizing a general model for distributed learning, an algorithm for collaboratively training regularized k... | Distributed learning has been addressed in a variety of other works. Reference @cite_6 considered a PAC-like model for learning with many individually trained hypotheses in a distribution-specific learning framework. Reference @cite_14 considered the classical model for decentralized detection @cite_12 in a nonparametr... | {
"cite_N": [
"@cite_14",
"@cite_7",
"@cite_1",
"@cite_6",
"@cite_0",
"@cite_2",
"@cite_12"
],
"mid": [
"2101982583",
"",
"2165004589",
"2063289366",
"2061177108",
"2169958062",
"1525038591"
],
"abstract": [
"We consider the problem of decentralized ... |
cs0601089 | 1912679131 | This paper addresses the problem of distributed learning under communication constraints, motivated by distributed signal processing in wireless sensor networks and data mining with distributed databases. After formalizing a general model for distributed learning, an algorithm for collaboratively training regularized k... | Ongoing research in the machine learning community seeks to design statistically sound learning algorithms that scale to large data sets (e.g., @cite_10 and references therein). One approach is to decompose the database into smaller chunks", and subsequently parallelize the learning process by assigning distinct proces... | {
"cite_N": [
"@cite_10"
],
"mid": [
"2135106139"
],
"abstract": [
"Very high dimensional learning systems become theoretically possible when training examples are abundant. The computing cost then becomes the limiting factor. Any efficient learning algorithm should at least take a brief look at e... |
cs0601089 | 1912679131 | This paper addresses the problem of distributed learning under communication constraints, motivated by distributed signal processing in wireless sensor networks and data mining with distributed databases. After formalizing a general model for distributed learning, an algorithm for collaboratively training regularized k... | A related area of research lies in the study of ensemble methods in machine learning; examples of these techniques include bagging, boosting, and mixtures of experts (e.g., @cite_13 and others). Typically, the focus of these works is on the statistical and algorithmic advantages of learning with an ensemble and not on ... | {
"cite_N": [
"@cite_13"
],
"mid": [
"1988790447"
],
"abstract": [
"In the first part of the paper we consider the problem of dynamically apportioning resources among a set of options in a worst-case on-line framework. The model we study can be interpreted as a broad, abstract extension of the wel... |
cs0601089 | 1912679131 | This paper addresses the problem of distributed learning under communication constraints, motivated by distributed signal processing in wireless sensor networks and data mining with distributed databases. After formalizing a general model for distributed learning, an algorithm for collaboratively training regularized k... | The research presented here generalizes the model and algorithm discussed in @cite_15 , which focused exclusively on the WSN application. Distinctions between the current and former work are discussed in more detail below. | {
"cite_N": [
"@cite_15"
],
"mid": [
"1834302797"
],
"abstract": [
"Wireless sensor networks (WSNs) have attracted considerable attention in recent years and motivate a host of new challenges for distributed signal processing. The problem of distributed or decentralized estimation has often been c... |
cs0601127 | 2159112912 | The access graph model for paging, defined by (, 1991) and studied in (, 1992) has a number of troubling aspects. The access graph has to be known in advance to the paging algorithm and the memory required to represent the access graph itself may be very large. We present a truly online strongly competitive paging algo... | Borodin al @cite_8 also consider deterministic uniform paging algorithms. They prove the existence of an optimal paging algorithm in PSPACE( @math ). They give a natural uniform paging algorithm, called , and prove that obtains a competitive ratio no worse than @math times the asymptotic competitive ratio for the graph... | {
"cite_N": [
"@cite_6",
"@cite_8"
],
"mid": [
"2073713788",
"2069162168"
],
"abstract": [
"What is the best paging algorithm if one has partial information about the possible sequences of page requests? We give a partial answer to this question by presenting the analysis of strongly compe... |
cs0601127 | 2159112912 | The access graph model for paging, defined by (, 1991) and studied in (, 1992) has a number of troubling aspects. The access graph has to be known in advance to the paging algorithm and the memory required to represent the access graph itself may be very large. We present a truly online strongly competitive paging algo... | Fiat and Rosen @cite_11 present an access graph based heuristic that is truly online and makes use of a (weighted) dynamic access graph. In this sense we emulate their concept. While the Fiat and Rosen algorithm is experimentally interesting in that it seems to beat , it is certainly not strongly competitive, and is kn... | {
"cite_N": [
"@cite_11"
],
"mid": [
"2068714069"
],
"abstract": [
"In this paper we devise new paging heuristics motivated by the access graph model of paging. Unlike the access graph model and the related Markov paging model our heuristics are truly on-line in that we do not assume any prior kno... |
quant-ph0512258 | 2951669051 | We propose various new techniques in quantum information theory, including a de Finetti style representation theorem for finite symmetric quantum states. As an application, we give a proof for the security of quantum key distribution which applies to arbitrary protocols. | One of the most popular proof techniques was proposed by Shor and Preskill @cite_37 , based on ideas of Lo and Chau @cite_66 . It uses a connection between key distribution and entanglement purification @cite_55 entanglement purification pointed out by Ekert @cite_15 (see also @cite_13 ). The proof technique of Shor an... | {
"cite_N": [
"@cite_37",
"@cite_55",
"@cite_3",
"@cite_56",
"@cite_15",
"@cite_13",
"@cite_66"
],
"mid": [
"2071764857",
"",
"",
"2165923712",
"2051051926",
"1997124098",
"1970006170"
],
"abstract": [
"We prove that the 1984 protocol of Bennett and ... |
quant-ph0512258 | 2951669051 | We propose various new techniques in quantum information theory, including a de Finetti style representation theorem for finite symmetric quantum states. As an application, we give a proof for the security of quantum key distribution which applies to arbitrary protocols. | @cite_54 , we have presented a general method for proving the security of QKD which does not rely on entanglement purification. Instead, it is based on a result on the security of privacy amplification in the context of quantum adversaries @cite_30 @cite_52 privacy amplification . Later, this method has been extended a... | {
"cite_N": [
"@cite_30",
"@cite_67",
"@cite_54",
"@cite_52",
"@cite_44"
],
"mid": [
"2119098193",
"2079729767",
"",
"2114805880",
"1980534149"
],
"abstract": [
"We address the question whether quantum memory is more powerful than classical memory. In particular, we... |
quant-ph0512258 | 2951669051 | We propose various new techniques in quantum information theory, including a de Finetti style representation theorem for finite symmetric quantum states. As an application, we give a proof for the security of quantum key distribution which applies to arbitrary protocols. | Our new approach for proving the security of QKD has already found various applications. For example, it is used for the analysis of protocols based on continuous systems continuous variable QKD as well as to improve the analysis of known (practical) protocols practical implementation exploiting the fact that an advers... | {
"cite_N": [
"@cite_41",
"@cite_38",
"@cite_4"
],
"mid": [
"",
"2062768305",
"2953325427"
],
"abstract": [
"",
"We present here an information theoretic study of Gaussian collective attacks on the continuous variable key distribution protocols based on Gaussian modulation of c... |
cs0512060 | 2950348024 | We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations and we use this information to find a safe path for the user through the sensor field. Traditional distributed navigation algorithms rely upon fl... | Navigating a sensor field in the presence of danger zones is a problem which is similar to path planning in the presence of obstacles. There are two obvious ways one can approach this problem: a greedy geographic scheme similar to GPSR routing @cite_13 and exhaustive search. In a geographic scheme, one would greedily m... | {
"cite_N": [
"@cite_13"
],
"mid": [
"2101963262"
],
"abstract": [
"We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions. GPSR makes greedy for... |
cs0512060 | 2950348024 | We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations and we use this information to find a safe path for the user through the sensor field. Traditional distributed navigation algorithms rely upon fl... | The concept of minimum exposure path were introduced by Meguerdichian et. al. @cite_6 . Veltri et. al. @cite_8 has given heuristics to distributedly compute minimal and maximal exposure paths in sensor networks. Path planning in the context of sensor networks was addressed by Li et. al. @cite_3 where they consider the ... | {
"cite_N": [
"@cite_4",
"@cite_8",
"@cite_3",
"@cite_6",
"@cite_2",
"@cite_5"
],
"mid": [
"180909918",
"2167477163",
"2039252979",
"1991523989",
"2022390945",
"1659568777"
],
"abstract": [
"",
"Sensor networks not only have the potential to change the w... |
cs0512069 | 1646304050 | Backup or preservation of websites is often not considered until after a catastrophic event has occurred. In the face of complete website loss, “lazy” webmasters or concerned third parties may be able to recover some of their website from the Internet Archive. Other pages may also be salvaged from commercial search eng... | In regards to archiving websites, organizations like the Internet Archive and national libraries are currently engaged in archiving the external (or client's) view of selected websites @cite_26 and improving that process by building better web crawlers and tools @cite_7 . Systems have been developed to ensure long-term... | {
"cite_N": [
"@cite_36",
"@cite_26",
"@cite_7"
],
"mid": [
"2088429233",
"179202249",
"2072475455"
],
"abstract": [
"LOCKSS (Lots Of Copies Keep Stuff Safe) is a tool designed for libraries to use to ensure their community's continued access to web-published scientific journals. L... |
cs0512069 | 1646304050 | Backup or preservation of websites is often not considered until after a catastrophic event has occurred. In the face of complete website loss, “lazy” webmasters or concerned third parties may be able to recover some of their website from the Internet Archive. Other pages may also be salvaged from commercial search eng... | Numerous systems have been built to archive individual websites and web pages. InfoMonitor archives the server-side components (e.g., CGI scripts and datafiles) and filesystem of a web server @cite_34 . It requires an administrator to configure the system and a separate server with adequate disk space to hold the archi... | {
"cite_N": [
"@cite_27",
"@cite_34",
"@cite_21",
"@cite_16"
],
"mid": [
"2117044215",
"2024882820",
"2005783315",
"2091712605"
],
"abstract": [
"This paper presents a transaction-time HTTP server, called TTApache that supports document versioning. A document often consists... |
cs0512069 | 1646304050 | Backup or preservation of websites is often not considered until after a catastrophic event has occurred. In the face of complete website loss, “lazy” webmasters or concerned third parties may be able to recover some of their website from the Internet Archive. Other pages may also be salvaged from commercial search eng... | Estimates of SE coverage of the indexable Web have been performed most recently in @cite_19 , but no measurement of SE cache sizes or types of files stored in the SE caches has been performed. We are also unaware of any research that documents the crawling and caching behavior of commercial SEs. | {
"cite_N": [
"@cite_19"
],
"mid": [
"2080676333"
],
"abstract": [
"In this short paper we estimate the size of the public indexable web at 11.5 billion pages. We also estimate the overlap and the index size of Google, MSN, Ask Teoma and Yahoo!"
]
} |
cs0511008 | 1770382502 | A basic calculus is presented for stochastic service guarantee analysis in communication networks. Central to the calculus are two definitions, maximum-(virtual)-backlog-centric (m.b.c) stochastic arrival curve and stochastic service curve, which respectively generalize arrival curve and service curve in the determinis... | Table summarizes the properties that are provided by the combination of a traffic model, chosen from t.a.c, v.b.c and m.b.c stochastic arrival curves, and a server model, chosen from weak stochastic service curve and stochastic service curve, without any additional constraints on the traffic model or the server model. ... | {
"cite_N": [
"@cite_18",
"@cite_14",
"@cite_4",
"@cite_7",
"@cite_28",
"@cite_21",
"@cite_1",
"@cite_32",
"@cite_17",
"@cite_5",
"@cite_12",
"@cite_11"
],
"mid": [
"1987582408",
"2142917009",
"2022940918",
"95741843",
"",
"1600548747",
"... |
cs0511008 | 1770382502 | A basic calculus is presented for stochastic service guarantee analysis in communication networks. Central to the calculus are two definitions, maximum-(virtual)-backlog-centric (m.b.c) stochastic arrival curve and stochastic service curve, which respectively generalize arrival curve and service curve in the determinis... | One type uses a sequence of random variables to stochastically bound the arrival process @cite_34 or the service process @cite_38 . Similar properties as (P.1), (P.3), (P.4) and (P.5) have been studied @cite_34 @cite_38 . These studies generally need the independence assumption. Under this type of traffic and service m... | {
"cite_N": [
"@cite_38",
"@cite_34"
],
"mid": [
"2062706778",
"1985431233"
],
"abstract": [
"Networks that support multiple services through \"link-sharing\" must address the fundamental conflicting requirement between isolation among service classes to satisfy each class' quality of serv... |
cs0511008 | 1770382502 | A basic calculus is presented for stochastic service guarantee analysis in communication networks. Central to the calculus are two definitions, maximum-(virtual)-backlog-centric (m.b.c) stochastic arrival curve and stochastic service curve, which respectively generalize arrival curve and service curve in the determinis... | Another type is built upon moments or moment generating functions. This type was initially used for traffic @cite_10 @cite_8 and has also been extended to service @cite_20 @cite_15 . Independence assumption is generally required between arrival and service processes. Extensive study has been conducted for deriving the ... | {
"cite_N": [
"@cite_8",
"@cite_24",
"@cite_15",
"@cite_10",
"@cite_20"
],
"mid": [
"2090888999",
"2112919802",
"2115632051",
"2111764355",
"1978905175"
],
"abstract": [
"A crucial problem for the efficient design and management of integrated services networks is ho... |
cs0511043 | 2952861886 | We present Poseidon, a new anomaly based intrusion detection system. Poseidon is payload-based, and presents a two-tier architecture: the first stage consists of a Self-Organizing Map, while the second one is a modified PAYL system. Our benchmarks on the 1999 DARPA data set show a higher detection rate and lower number... | Cannady @cite_32 proposes a SOM-based IDS in which network packets are first classified according to nine features and then presented to the neural network. Attack traffic is generated using a security audit tool. The author extends this work in Cannady @cite_29 @cite_14 . | {
"cite_N": [
"@cite_29",
"@cite_14",
"@cite_32"
],
"mid": [
"2411715191",
"32779056",
"1674877186"
],
"abstract": [
"",
"The timely and accurate detection of computer and network system intrusions has always been an elusive goal for system administrators and information securi... |
cs0511043 | 2952861886 | We present Poseidon, a new anomaly based intrusion detection system. Poseidon is payload-based, and presents a two-tier architecture: the first stage consists of a Self-Organizing Map, while the second one is a modified PAYL system. Our benchmarks on the 1999 DARPA data set show a higher detection rate and lower number... | Zanero @cite_18 presents a two-tier payload-based system that combines a self-organizing map with a modified version of SmartSifter @cite_6 . While this architecture is similar to POSEIDON, a full comparison is not possible because the benchmarks in @cite_18 concern only the FTP service an no details are given about ex... | {
"cite_N": [
"@cite_19",
"@cite_18",
"@cite_6"
],
"mid": [
"1982304603",
"",
"2045064676"
],
"abstract": [
"With the continuous evolution of the types of attacks against computer networks, traditional intrusion detection systems, based on pattern matching and static signatures, ar... |
cs0511102 | 2122887675 | Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call... | Some work concerning routing in DTNs has been performed with scheduled contacts, such as the paper by @cite_28 that tries to improve the connectivity of an isolated village to the internet based on knowledge of when a low-earth orbiting relay satellite and a motor bike might be available to make the necessary connectio... | {
"cite_N": [
"@cite_28",
"@cite_18",
"@cite_26"
],
"mid": [
"2162076967",
"2082199994",
"2097625638"
],
"abstract": [
"We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose d... |
cs0510090 | 1553225280 | To definite and compute differential invariants, like curvatures, for triangular meshes (or polyhedral surfaces) is a key problem in CAGD and the computer vision. The Gaussian curvature and the mean curvature are determined by the differential of the Gauss map of the underlying surface. The Gauss map assigns to each po... | Flynn and Jain @cite_9 (1989) used a suitable sphere passing through four vertices to estimate curvatures. Meek and Walton @cite_2 (2000) examined several methods and compared them with the discretization and interpolation method. Gatzke and Grim @cite_3 (2003) systematically analyzed the results of computation of curv... | {
"cite_N": [
"@cite_7",
"@cite_9",
"@cite_3",
"@cite_2",
"@cite_5"
],
"mid": [
"",
"2104776149",
"2165995633",
"2107059366",
"1626653188"
],
"abstract": [
"",
"An empirical study of the accuracy of five different curvature estimation techniques, using synthetic... |
physics0510151 | 1969383134 | The knowledge of real-life traffic patterns is crucial for a good understanding and analysis of transportation systems. These data are quite rare. In this paper we propose an algorithm for extracting both the real physical topology and the network of traffic flows from timetables of public mass transportation systems. ... | Another class of networks that can be constructed with the help of timetables are airport networks @cite_17 @cite_35 @cite_30 @cite_27 . There, the nodes are the airports, and edges are the flight connections. The weight of an edge reflects the traffic on this connection, which can be approximated by the number of flig... | {
"cite_N": [
"@cite_30",
"@cite_35",
"@cite_27",
"@cite_17"
],
"mid": [
"2116173498",
"2100776472",
"2130476447",
"2149055390"
],
"abstract": [
"We study networks that connect points in geographic space, such as transportation networks and the Internet. We find that there ... |
cs0510065 | 1619974530 | This paper describes a new protocol for authentication in ad-hoc networks. The protocol has been designed to meet specialized requirements of ad-hoc networks, such as lack of direct communication between nodes or requirements for revocable anonymity. At the same time, a ad-hoc authentication protocol must be resistant ... | Most systems that provide anonymity are not interested in allowing to trace the user under any circumstances. , proxy servers, have not been designed to provide accountability. For mobile ad hoc networks, approaches exists that provide unconditional anonymity, again without any accountability @cite_0 . | {
"cite_N": [
"@cite_0"
],
"mid": [
"2139284310"
],
"abstract": [
"A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of other intermediate nodes to establish communication ... |
cs0510065 | 1619974530 | This paper describes a new protocol for authentication in ad-hoc networks. The protocol has been designed to meet specialized requirements of ad-hoc networks, such as lack of direct communication between nodes or requirements for revocable anonymity. At the same time, a ad-hoc authentication protocol must be resistant ... | An area that requires both anonymity and accountability is agent systems ( @cite_19 ). Most of the security architectures for those systems do not provide any anonymity, e.g., @cite_1 , @cite_4 , @cite_13 . | {
"cite_N": [
"@cite_13",
"@cite_19",
"@cite_1",
"@cite_4"
],
"mid": [
"1855767844",
"118562019",
"1482916605",
"2071198236"
],
"abstract": [
"Mobile agents have recently started being deployed in large-scale distributed systems. However, this new technology brings some sec... |
cs0510065 | 1619974530 | This paper describes a new protocol for authentication in ad-hoc networks. The protocol has been designed to meet specialized requirements of ad-hoc networks, such as lack of direct communication between nodes or requirements for revocable anonymity. At the same time, a ad-hoc authentication protocol must be resistant ... | A different scheme that preserves anonymity is proposed in @cite_3 . The scheme is based on a credential system and offers an optional anonymity revocation. Its main idea is based on oblivious protocols, encryption circuits and the RSA assumption. | {
"cite_N": [
"@cite_3"
],
"mid": [
"2165210192"
],
"abstract": [
"A credential system is a system in which users can obtain credentials from organizations and demonstrate possession of these credentials. Such a system is anonymous when transactions carried out by the same user cannot be linked. A... |
math0509333 | 2020416768 | A particular case of initial data for the two-dimensional Euler equations is studied numerically. The results show that the Godunov method does not always converge to the physical solution, at least not on feasible grids. Moreover, they suggest that entropy solutions (in the weak entropy inequality sense) are not well ... | For multidimensional scalar ( @math ) conservation laws with arbitrary @math , @cite_5 (generalizing earlier work) shows that a global EEF solution exists, is unique, satisfies the VV condition as well, and is stable under @math perturbations of the initial data. | {
"cite_N": [
"@cite_5"
],
"mid": [
"1992812527"
],
"abstract": [
"In this paper we construct a theory of generalized solutions in the large of Cauchy's problem for the equations in the class of bounded measurable functions. We define the generalized solution and prove existence, uniqueness and st... |
math0509333 | 2020416768 | A particular case of initial data for the two-dimensional Euler equations is studied numerically. The results show that the Godunov method does not always converge to the physical solution, at least not on feasible grids. Moreover, they suggest that entropy solutions (in the weak entropy inequality sense) are not well ... | @cite_26 proposes the EEF condition for scalar conservation laws ( @math ), proves that it is implied by the VV condition under some circumstances and notes that there is a large set of convex entropies. Apparently independently, @cite_5 obtained analogous results for systems. @cite_32 contains the first use of the ter... | {
"cite_N": [
"@cite_5",
"@cite_26",
"@cite_32"
],
"mid": [
"1992812527",
"",
"205360716"
],
"abstract": [
"In this paper we construct a theory of generalized solutions in the large of Cauchy's problem for the equations in the class of bounded measurable functions. We define the ge... |
math0509333 | 2020416768 | A particular case of initial data for the two-dimensional Euler equations is studied numerically. The results show that the Godunov method does not always converge to the physical solution, at least not on feasible grids. Moreover, they suggest that entropy solutions (in the weak entropy inequality sense) are not well ... | (TODO: mention that @cite_28 fig 30 p. 296 is our example if the wedge is replaced by stagnation air; see p. 345 Fig 69. Quote: All these and other mathematically possible flow patterns with a singular center Z are at our disposal for interpreting experimental evidence. Which, if any, of these possibilities occurs unde... | {
"cite_N": [
"@cite_28"
],
"mid": [
"1532515344"
],
"abstract": [
"Keywords: ecoulement : compressible ; ecoulement : supersonique ; onde de : choc Reference Record created on 2005-11-18, modified on 2016-08-08"
]
} |
physics0509217 | 2164680115 | We present a model for the diffusion of management fads and other technologies which lack clear objective evidence about their merits. The choices made by non-Bayesian adopters reflect both their own evaluations and the social in°uence of their peers. We show, both analytically and computationally, that the dynamics le... | In this paper we propose a model that is consistent with all of Camerer's observations and so is an alternative to canonical herding models. Thus our agents exhibit normatively desirable and empirically plausible monotonicity properties: in particular, the more the social cues favor innovation A over B, the more likely... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2167951823"
],
"abstract": [
"■ Abstract Sociologists often model social processes as interactions among variables. We review an alternative approach that models social life as interactions among adaptive agents who influence one another in response to the inf... |
cs0509024 | 2951388382 | In this paper, we present a framework for the semantics and the computation of aggregates in the context of logic programming. In our study, an aggregate can be an arbitrary interpreted second order predicate or function. We define extensions of the Kripke-Kleene, the well-founded and the stable semantics for aggregate... | A more elaborate definition of a stable semantics was given by @cite_29 for programs with weight constraints and implemented by the well-known smodels system. In our language, weight constraints correspond to aggregate atoms build with the @math and @math aggregate relations. An extensive comparison between the @math -... | {
"cite_N": [
"@cite_29",
"@cite_15",
"@cite_8"
],
"mid": [
"2011124182",
"342706626",
""
],
"abstract": [
"A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constr... |
cs0509024 | 2951388382 | In this paper, we present a framework for the semantics and the computation of aggregates in the context of logic programming. In our study, an aggregate can be an arbitrary interpreted second order predicate or function. We define extensions of the Kripke-Kleene, the well-founded and the stable semantics for aggregate... | A novel feature of the language of weight constraints was that it allows weight constraints to be present also in the head of the rules. This approach have been further developed in different directions. One line of research was to consider different variations and extensions of weight constraints like abstract constra... | {
"cite_N": [
"@cite_20",
"@cite_10",
"@cite_23"
],
"mid": [
"1540263588",
"1638553575",
"1854994931"
],
"abstract": [
"We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the for... |
cs0509024 | 2951388382 | In this paper, we present a framework for the semantics and the computation of aggregates in the context of logic programming. In our study, an aggregate can be an arbitrary interpreted second order predicate or function. We define extensions of the Kripke-Kleene, the well-founded and the stable semantics for aggregate... | Another proposal for a stable semantics of disjunctive logic programs extended with aggregates was given in @cite_27 . In the sequel we investigate in more detail the relationship with this semantics to the family of @math -stable semantics defined earlier. First, we recall the definitions of the stable semantics of @c... | {
"cite_N": [
"@cite_27"
],
"mid": [
"2105869173"
],
"abstract": [
"The addition of aggregates has been one of the most relevant enhancements to the language of answer set programming (ASP). They strengthen the modeling power of ASP, in terms of concise problem representations. While many importan... |
cs0509065 | 2952811798 | For generalized Reed-Solomon codes, it has been proved GuruswamiVa05 that the problem of determining if a received word is a deep hole is co-NP-complete. The reduction relies on the fact that the evaluation set of the code can be exponential in the length of the code -- a property that practical codes do not usually po... | The pursuit of efficient decoding algorithms for Reed-Solomon codes has yielded intriguing results. If the radius of a Hamming ball centered at some received word is less than half the minimum distance, there can be at most one codeword in the Hamming ball. Finding this codeword is called unambiguous decoding . It can ... | {
"cite_N": [
"@cite_6"
],
"mid": [
"1871606885"
],
"abstract": [
"Error correction for polynomial block codes is achieved without prior evaluation of power sum symmetric functions. The received word R (z) is reduced mod G (z), the generator of the code and a function F (z) of error locator polyno... |
cs0509065 | 2952811798 | For generalized Reed-Solomon codes, it has been proved GuruswamiVa05 that the problem of determining if a received word is a deep hole is co-NP-complete. The reduction relies on the fact that the evaluation set of the code can be exponential in the length of the code -- a property that practical codes do not usually po... | The question on decodability of Reed-Solomon codes has attracted attention recently, due to recent discoveries on the relationship between decoding Reed-Solomon codes and some number theoretical problems. Allowing exponential alphabets, Guruswami and Vardy proved that the maximum likelihood decoding is NP-complete. The... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2130539706"
],
"abstract": [
"For an error-correcting code and a distance bound, the list decoding problem is to compute all the codewords within a given distance to a received message. The bounded distance decoding problem is to find one codeword if there is a... |
cs0508009 | 1688492802 | We conduct the most comprehensive study of WLAN traces to date. Measurements collected from four major university campuses are analyzed with the aim of developing fundamental understanding of realistic user behavior in wireless networks. Both individual user and inter-node (group) behaviors are investigated and two cla... | Influenced by the gaining popularity of wireless LANs in recent years, there are increasing interests on studying usage of wireless LANs. Several previous works @cite_8 , @cite_15 , @cite_5 have provided extensive study on wireless network usage statistics and made their traces available to the research community. Our ... | {
"cite_N": [
"@cite_5",
"@cite_15",
"@cite_8"
],
"mid": [
"1975804880",
"2002169759",
"2160494326"
],
"abstract": [
"Wireless Local Area Networks (WLANs) are now commonplace on many academic and corporate campuses. As \"Wi-Fi\" technology becomes ubiquitous, it is increasingly imp... |
cs0508009 | 1688492802 | We conduct the most comprehensive study of WLAN traces to date. Measurements collected from four major university campuses are analyzed with the aim of developing fundamental understanding of realistic user behavior in wireless networks. Both individual user and inter-node (group) behaviors are investigated and two cla... | With these traces available, more recent research works focus on modeling user behaviors in wireless LANs. In @cite_11 the authors propose models to describe traffic flows generated by wireless LAN users, which is a different focus to this paper. In the first part of this paper we focus more on identifying metrics that... | {
"cite_N": [
"@cite_8",
"@cite_3",
"@cite_11"
],
"mid": [
"2160494326",
"2127484926",
"2133436197"
],
"abstract": [
"Wireless local-area networks are becoming increasingly popular. They are commonplace on university campuses and inside corporations, and they have started to appear... |
cs0508009 | 1688492802 | We conduct the most comprehensive study of WLAN traces to date. Measurements collected from four major university campuses are analyzed with the aim of developing fundamental understanding of realistic user behavior in wireless networks. Both individual user and inter-node (group) behaviors are investigated and two cla... | Recent research works on protocol design in wireless networks usually utilize synthetic, random mobility models for performance evaluation @cite_9 , such as random waypoint model or random walk model. MNs in such synthetic models are always on and homogeneous in their behavior. Both of these characteristics are not obs... | {
"cite_N": [
"@cite_9"
],
"mid": [
"2148135143"
],
"abstract": [
"In the performance evaluation of a protocol for an ad hoc network, the protocol should be tested under realistic conditions including, but not limited to, a sensible transmission range, limited buffer space for the storage of messa... |
cs0508132 | 2950600983 | We present a declarative language, PP, for the high-level specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allows users to elegantly express non-trivial, multi-dimensional preferences and priorities over such preferences. The semantics of PP allows the... | The work presented in this paper is the natural continuation of the work we presented in @cite_33 , where we rely on prioritized default theories to express limited classes of preferences between trajectories---a strict subset of the preferences covered in this paper. This work is also influenced by other works on expl... | {
"cite_N": [
"@cite_37",
"@cite_33",
"@cite_50",
"@cite_15"
],
"mid": [
"1997420616",
"2020138862",
"2141088850",
"2154595228"
],
"abstract": [
"Planning for extended goals in non-deterministic domains is one of the most significant and challenging planning problems. In sp... |
cs0508132 | 2950600983 | We present a declarative language, PP, for the high-level specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allows users to elegantly express non-trivial, multi-dimensional preferences and priorities over such preferences. The semantics of PP allows the... | introduced a framework for planning with action costs using logic programming @cite_3 . The focus of their proposal is to express certain classes of quantitative preferences. Each action is assigned an integer cost, and plans with the minimal cost are considered to be optimal. Costs can be either static or relative to ... | {
"cite_N": [
"@cite_3"
],
"mid": [
"1633032608"
],
"abstract": [
"Recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language κc, which extends the declarative planning language κ by act... |
cs0508132 | 2950600983 | We present a declarative language, PP, for the high-level specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allows users to elegantly express non-trivial, multi-dimensional preferences and priorities over such preferences. The semantics of PP allows the... | Considerable effort has been invested in introducing preferences in logic programming. In @cite_27 preferences are expressed at the level of atoms and used for parsing disambiguation in logic grammars. Rule-level preferences have been used in various proposals for selection of preferred answer sets in answer set progra... | {
"cite_N": [
"@cite_18",
"@cite_26",
"@cite_36",
"@cite_28",
"@cite_27",
"@cite_23",
"@cite_47"
],
"mid": [
"2174235632",
"2011124182",
"",
"1563821244",
"1986318362",
"2124627636",
"2106614716"
],
"abstract": [
"We introduce a methodology and frame... |
math0506336 | 2952239370 | The rearrangement inequalities of Hardy-Littlewood and Riesz say that certain integrals involving products of two or three functions increase under symmetric decreasing rearrangement. It is known that these inequalities extend to integrands of the form F(u_1,..., u_m) where F is supermodular; in particular, they hold w... | More than thirty years later, Crowe-Zweibel-Rosenbloom proved Eq. ) for @math on @math @cite_36 . They expressed a given continuous supermodular function @math on @math that vanishes on the boundary as the distribution function of a Borel measure @math , @math layer-cake representation | {
"cite_N": [
"@cite_36"
],
"mid": [
"2053053770"
],
"abstract": [
"Let ƒ, g be measurable non-negative functions on R, and let , ḡ be their equimeasurable symmetric decreasing rearrangements. Let F: R × R → R be continuous and suppose that the associated rectangle function defined by F(R) = F(a, ... |
math0506336 | 2952239370 | The rearrangement inequalities of Hardy-Littlewood and Riesz say that certain integrals involving products of two or three functions increase under symmetric decreasing rearrangement. It is known that these inequalities extend to integrands of the form F(u_1,..., u_m) where F is supermodular; in particular, they hold w... | Carlier viewed maximizing the left hand side of Eq. ) for a given right hand side as an optimal transportation problem where the distribution functions of @math define mass distributions @math on @math , the joint distribution defines a transportation plan, and the functional represents the cost after multiplying by a ... | {
"cite_N": [
"@cite_35"
],
"mid": [
"2183160839"
],
"abstract": [
"We prove existence, uniqueness, duality results and give a characterization of optimal measure-preserving maps for a class of optimal transportation problems with several marginals with compact support in R under the requirement t... |
math0506336 | 2952239370 | The rearrangement inequalities of Hardy-Littlewood and Riesz say that certain integrals involving products of two or three functions increase under symmetric decreasing rearrangement. It is known that these inequalities extend to integrands of the form F(u_1,..., u_m) where F is supermodular; in particular, they hold w... | The Riesz inequality in Eq. ) is non-trivial even when @math is just a product of two functions. Ahlfors introduced two-point rearrangements to treat this case on @math @cite_22 , Baernstein-Taylor proved the corresponding result on @math @cite_19 , and Beckner noted that the proof remains valid on @math and @math @cit... | {
"cite_N": [
"@cite_26",
"@cite_22",
"@cite_8",
"@cite_9",
"@cite_21",
"@cite_32",
"@cite_0",
"@cite_19",
"@cite_5",
"@cite_15",
"@cite_13",
"@cite_25"
],
"mid": [
"1659004305",
"1515452785",
"2085996269",
"",
"1999441752",
"",
"19884935... |
cs0506002 | 1589766768 | study a collection of heterogeneous XML databases maintain- ing similar and related information, exchanging data via a peer to peer overlay network. In this setting, a mediated global schema is unrealistic. Yet, users applications wish to query the d atabases via one peer using its schema. We have recently developed He... | Schema-matching systems Automated techniques for schema matching (e.g. CUPID @cite_1 , @cite_17 @cite_13 ) are able to output elementary schema-level associations by exploiting linguistic features, context-dependent type matching, similarity functions etc. These associations could constitute the input of our rule infer... | {
"cite_N": [
"@cite_13",
"@cite_1",
"@cite_17"
],
"mid": [
"",
"2139135093",
"2008896880"
],
"abstract": [
"",
"Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate a... |
cs0506002 | 1589766768 | study a collection of heterogeneous XML databases maintain- ing similar and related information, exchanging data via a peer to peer overlay network. In this setting, a mediated global schema is unrealistic. Yet, users applications wish to query the d atabases via one peer using its schema. We have recently developed He... | P2P systems with non-conventional lookups Popular P2P networks, e.g. Kazaa, Gnutella, advertise simple lookup queries on file names. The idea of building full-fledged P2P DBMS is being considered in many works. Internet-scale database queries and functionalities @cite_19 as well as approximate range queries in P2P @cit... | {
"cite_N": [
"@cite_30",
"@cite_19",
"@cite_18",
"@cite_21"
],
"mid": [
"2099849300",
"1558940048",
"2145290781",
"2120176307"
],
"abstract": [
"We present the design and evaluation of PeerDB, a peer-to-peer (P2P) distributed data sharing system. PeerDB distinguishes itsel... |
cs0506095 | 2950169286 | Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never stop. On the other hand, they generate cyclic influences, which are disallowed in Bayesian networks. Therefore, in existing PLP approaches lo... | Third, most importantly PKB has no mechanism for handling cyclic influences. In PKB, cyclic influences are defined to be inconsistent (see Definition 9 of the paper @cite_10 ) and thus are excluded (PKB excludes cyclic influences by requiring its programs be acyclic). In BKB, however, cyclic influences are interpreted ... | {
"cite_N": [
"@cite_10"
],
"mid": [
"2000805332"
],
"abstract": [
"We define a language for representing context-sensitive probabilistic knowledge. A knowledge base consists of a set of universally quantified probability sentences that include context constraints, which allow inference to be focu... |
cs0505011 | 1644495374 | As computers become more ubiquitous, traditional two-dimensional interfaces must be replaced with interfaces based on a three-dimensional metaphor. However, these interfaces must still be as simple and functional as their two-dimensional predecessors. This paper introduces SWiM, a new interface for moving application w... | Moving application windows among various displays has been the focus of research in multiple ubiquitous computing environments. In i-Land, a room with an interactive electronic wall (DynaWall), computer-enhanced chairs, and an interactive table, three methods were introduced for moving application windows on the DynaWa... | {
"cite_N": [
"@cite_3",
"@cite_6"
],
"mid": [
"1530394184",
"2094982166"
],
"abstract": [
"Publisher Summary This chapter presents an overview of usability inspection methods. Usability inspection is the generic name for a set of methods based on having evaluators inspect or examine usabi... |
cs0505011 | 1644495374 | As computers become more ubiquitous, traditional two-dimensional interfaces must be replaced with interfaces based on a three-dimensional metaphor. However, these interfaces must still be as simple and functional as their two-dimensional predecessors. This paper introduces SWiM, a new interface for moving application w... | In Stanford's iRoom, the PointRight system allows users to use a single mouse and keyboard to control multiple dis -plays. @cite_0 Changing displays is accomplished by simply moving the cursor off the edge of a screen. Currently, iRoom does not move applications across displays, but this mouse technique could be extend... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2006563349"
],
"abstract": [
"We describe the design of and experience with PointRight, a peer-to-peer pointer and keyboard redirection system that operates in multi-machine, multi-user environments. PointRight employs a geometric model for redirecting input ac... |
cs0505011 | 1644495374 | As computers become more ubiquitous, traditional two-dimensional interfaces must be replaced with interfaces based on a three-dimensional metaphor. However, these interfaces must still be as simple and functional as their two-dimensional predecessors. This paper introduces SWiM, a new interface for moving application w... | Another approach for manipulating objects (text, icons and files) on a digital whiteboard is Pick-and-Drop''. @cite_1 Using Pick-and-Drop, the user can move an object by selecting it on a screen with a stylus (a small animation is provided where the object is lifted and a shadow of the object appears) then placing it o... | {
"cite_N": [
"@cite_1"
],
"mid": [
"2108715885"
],
"abstract": [
"This paper proposes a new field of user interfaces called multi-computer direct manipulation and presents a penbased direct manipulation technique that can be used for data transfer between different computers as well as within the... |
cs0504099 | 1836465448 | The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver is greater than a fixed threshold. In reality, the mapping from SINR to packet su... | Throughout this paper, we refer to the work of Gupta and Kumar on the capacity of random ad hoc networks @cite_4 . In this work, the authors assume a simplified link layer model in which each packet reception is successful if the receiver has an SINR of at least @math . The authors assume that each packet is decoded at... | {
"cite_N": [
"@cite_4"
],
"mid": [
"2137775453"
],
"abstract": [
"When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput spl lambda (n) obtainable by each node for a randomly chosen destination is... |
cs0504099 | 1836465448 | The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver is greater than a fixed threshold. In reality, the mapping from SINR to packet su... | In @cite_9 , the authors discuss the limitations of the work in @cite_4 , by taking a network information theoretic approach. The authors discuss how several co-operative strategies such as interference cancellation, network coding, etc. could be used to improve the throughput. However these tools cannot be exploited f... | {
"cite_N": [
"@cite_9",
"@cite_4"
],
"mid": [
"2162180430",
"2137775453"
],
"abstract": [
"How much information can be carried over a wireless network with a multiplicity of nodes, and how should the nodes cooperate to transfer information? To study these questions, we formulate a model o... |
cs0504099 | 1836465448 | The problem of determining asymptotic bounds on the capacity of a random ad hoc network is considered. Previous approaches assumed a threshold-based link layer model in which a packet transmission is successful if the SINR at the receiver is greater than a fixed threshold. In reality, the mapping from SINR to packet su... | However, just as in @cite_4 , all the above mentioned works assume that over each link a certain non-zero rate can be achieved. They do not take into account the fact that in reality, such a rate is achieved with a probability of bit error arbitrarily close (but not equal) to one . Once the coding and modulation scheme... | {
"cite_N": [
"@cite_4"
],
"mid": [
"2137775453"
],
"abstract": [
"When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput spl lambda (n) obtainable by each node for a randomly chosen destination is... |
cs0504045 | 2952143109 | Internet worms have become a widespread threat to system and network operations. In order to fight them more efficiently, it is necessary to analyze newly discovered worms and attack patterns. This paper shows how techniques based on Kolmogorov Complexity can help in the analysis of internet worms and network traffic. ... | Evans and Barnett @cite_10 compare the complexity of legal FTP traffic to the complexity of attacks against FTP servers. To achieve this they analyzed the headers of legal and illegal FTP traffic. For this they gathered several hundred bytes of good and bad traffic and compressed it using compress. Our approach differs... | {
"cite_N": [
"@cite_10"
],
"mid": [
"1531318324"
],
"abstract": [
"The problem of network security is approached from the point of view of Kolmogorov complexity (see Evans. S, et al, Proc. DARPA Inf. Survivability Conf. & Exposition II, vol 2. p.322-33, 2001). The principle of conservation of com... |
cs0504045 | 2952143109 | Internet worms have become a widespread threat to system and network operations. In order to fight them more efficiently, it is necessary to analyze newly discovered worms and attack patterns. This paper shows how techniques based on Kolmogorov Complexity can help in the analysis of internet worms and network traffic. ... | Kulkarni, Evans and Barnett @cite_7 also try to track down denial of service attacks using Kolmogorov complexity. They now estimate the Kolmogorov complexity by computing an estimate of the entropy of 1's contained in the packet. They then track the complexity over time using the method of a complexity differential. Fo... | {
"cite_N": [
"@cite_7"
],
"mid": [
"2005406777"
],
"abstract": [
"This paper describes an approach to detecting distributed denial of service (DDoS) attacks that is based on fundamentals of Information Theory, specifically Kolmogorov Complexity. A theorem derived using principles of Kolmogorov Co... |
cs0504063 | 2950442545 | In this paper we compare the performance characteristics of our selection based learning algorithm for Web crawlers with the characteristics of the reinforcement learning algorithm. The task of the crawlers is to find new information on the Web. The selection algorithm, called weblog update, modifies the starting URL l... | Menczer @cite_30 describes some disadvantages of current Web search engines on the dynamic Web, e.g., the low ratio of fresh or relevant documents. He proposes to complement the search engines with intelligent crawlers, or web mining agents to overcome those disadvantages. Search engines take static snapshots of the We... | {
"cite_N": [
"@cite_30"
],
"mid": [
"2001834587"
],
"abstract": [
"While search engines have become the major decision support tools for the Internet, there is a growing disparity between the image of the World Wide Web stored in search engine repositories and the actual dynamic, distributed natu... |
cs0504063 | 2950442545 | In this paper we compare the performance characteristics of our selection based learning algorithm for Web crawlers with the characteristics of the reinforcement learning algorithm. The task of the crawlers is to find new information on the Web. The selection algorithm, called weblog update, modifies the starting URL l... | Risvik and Michelsen @cite_0 mention that because of the exponential growth of the Web there is an ever increasing need for more intelligent, (topic-)specific algorithms for crawling, like focused crawling and document classification. With these algorithms crawlers and search engines can operate more efficiently in a t... | {
"cite_N": [
"@cite_0"
],
"mid": [
"2046862025"
],
"abstract": [
"Abstract In this paper we study several dimensions of Web dynamics in the context of large-scale Internet search engines. Both growth and update dynamics clearly represent big challenges for search engines. We show how the problems... |
cs0504063 | 2950442545 | In this paper we compare the performance characteristics of our selection based learning algorithm for Web crawlers with the characteristics of the reinforcement learning algorithm. The task of the crawlers is to find new information on the Web. The selection algorithm, called weblog update, modifies the starting URL l... | Menczer @cite_30 also introduces a recency metric which is 1 if all of the documents are recent (i.e., not changed after the last download) and goes to 0 as downloaded documents are getting more and more obsolete. Trivially immediately after a few minutes run of an online crawler the value of this metric will be 1, whi... | {
"cite_N": [
"@cite_30"
],
"mid": [
"2001834587"
],
"abstract": [
"While search engines have become the major decision support tools for the Internet, there is a growing disparity between the image of the World Wide Web stored in search engine repositories and the actual dynamic, distributed natu... |
cs0504063 | 2950442545 | In this paper we compare the performance characteristics of our selection based learning algorithm for Web crawlers with the characteristics of the reinforcement learning algorithm. The task of the crawlers is to find new information on the Web. The selection algorithm, called weblog update, modifies the starting URL l... | @cite_31 present a mathematical crawler model in which the number of obsolete pages can be minimized with a nonlinear equation system. They solved the nonlinear equations with different parameter settings on realistic model data. Their model uses different buckets for documents having different change rates therefore d... | {
"cite_N": [
"@cite_31"
],
"mid": [
"2018928332"
],
"abstract": [
"This paper outlines the design of a web crawler implemented for IBM Almaden's WebFountain project and describes an optimization model for controlling the crawl strategy. This crawler is scalable and incremental. The model makes no... |
cs0504063 | 2950442545 | In this paper we compare the performance characteristics of our selection based learning algorithm for Web crawlers with the characteristics of the reinforcement learning algorithm. The task of the crawlers is to find new information on the Web. The selection algorithm, called weblog update, modifies the starting URL l... | by solving the nonlinear equations the content of web pages can not be taken into consideration. The model can not be extended easily to (topic-)specific crawlers, which would be highly advantageous on the exponentially growing web @cite_9 , @cite_0 , @cite_30 . the rapidly changing documents (like on news sites) are n... | {
"cite_N": [
"@cite_0",
"@cite_9",
"@cite_30"
],
"mid": [
"2046862025",
"",
"2001834587"
],
"abstract": [
"Abstract In this paper we study several dimensions of Web dynamics in the context of large-scale Internet search engines. Both growth and update dynamics clearly represent bi... |
cs0504101 | 2493383280 | We identify a new class of hard 3-SAT instances, namely a random 3-SAT problems having exactly one solution and as few clauses as possible. It is numerically shown that the running time of complete methods as well as of local search algorithms for such problems is larger than for random instances around the phase trans... | Most of the studies of random 3-SAT ensemble have been concerned with the computational cost at a constant @math as a function of the ratio @math , where the characteristic phase transition-like curve is observed. This is in a way surprising because for the computational complexity (and also for practical applications)... | {
"cite_N": [
"@cite_41",
"@cite_5",
"@cite_14"
],
"mid": [
"",
"2155218845",
"1561608403"
],
"abstract": [
"",
"Abstract Determining whether a propositional theory is satisfiable is a prototypical example of an NP-complete problem. Further, a large number of problems that occu... |
cs0504101 | 2493383280 | We identify a new class of hard 3-SAT instances, namely a random 3-SAT problems having exactly one solution and as few clauses as possible. It is numerically shown that the running time of complete methods as well as of local search algorithms for such problems is larger than for random instances around the phase trans... | There has been numerical evidence @cite_29 @cite_30 @cite_11 that below @math short instances of 3-SAT as well as of graph coloring @cite_51 can be hard. With respect to the formula size an interesting rigorous result is @cite_48 @cite_21 that an ordered DPLL algorithm needs an exponential time @math to find a resoluti... | {
"cite_N": [
"@cite_30",
"@cite_48",
"@cite_29",
"@cite_21",
"@cite_51",
"@cite_11"
],
"mid": [
"2137154807",
"2088616860",
"",
"2126420408",
"2002627038",
""
],
"abstract": [
"We present a detailed experimental investigation of the easy-hard-easy phase tra... |
cs0503011 | 2949386080 | In-degree, PageRank, number of visits and other measures of Web page popularity significantly influence the ranking of search results by modern search engines. The assumption is that popularity is closely correlated with quality, a more elusive concept that is difficult to measure directly. Unfortunately, the correlati... | The exploration exploitation tradeoff that arises in our context is akin to problems studied in the field of reinforcement learning @cite_20 . However, direct application of reinforcement learning algorithms appears prohibitively expensive at Web scales. | {
"cite_N": [
"@cite_20"
],
"mid": [
"2107726111"
],
"abstract": [
"This paper surveys the field of reinforcement learning from a computer-science perspective. It is written to be accessible to researchers familiar with machine learning. Both the historical basis of the field and a broad selection... |
cs0503047 | 2098985161 | We consider the capacity problem for wireless networks. Networks are modeled as random unit-disk graphs, and the capacity problem is formulated as one of finding the maximum value of a multicommodity flow. In this paper, we develop a proof technique based on which we are able to obtain a tight characterization of the s... | This work is primarily motivated by our struggle to understand the results of Gupta and Kumar on the capacity of wireless networks @cite_19 . And the main idea behind our approach is simple: the transport capacity problem posed in @cite_19 , in the context of random networks, is essentially a throughput stability probl... | {
"cite_N": [
"@cite_19"
],
"mid": [
"2137775453"
],
"abstract": [
"When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput spl lambda (n) obtainable by each node for a randomly chosen destination i... |
cs0503047 | 2098985161 | We consider the capacity problem for wireless networks. Networks are modeled as random unit-disk graphs, and the capacity problem is formulated as one of finding the maximum value of a multicommodity flow. In this paper, we develop a proof technique based on which we are able to obtain a tight characterization of the s... | As mentioned before, @cite_19 sparked significant interest in these problems. Follow up results from the same group were reported in @cite_10 @cite_29 . Some information theoretic bounds for large-area networks were obtained in @cite_30 . When nodes are allowed to move, assuming transmission delays proportional to the ... | {
"cite_N": [
"@cite_30",
"@cite_26",
"@cite_22",
"@cite_29",
"@cite_9",
"@cite_1",
"@cite_32",
"@cite_3",
"@cite_0",
"@cite_19",
"@cite_2",
"@cite_15",
"@cite_34",
"@cite_10"
],
"mid": [
"2110225498",
"",
"2165510626",
"",
"2131992719",
... |
cs0503061 | 2949324727 | We introduce the use, monitoring, and enforcement of integrity constraints in trust management-style authorization systems. We consider what portions of the policy state must be monitored to detect violations of integrity constraints. Then we address the fact that not all participants in a trust management system can b... | In , we listed several papers presenting various trust management systems. None of these incorporates a notion of integrity constrains. The work in trust management that is most closely related is @cite_13 . As we discussed at the beginning of , that work is complimentary to ours. It studies the problem of determining,... | {
"cite_N": [
"@cite_13"
],
"mid": [
"2043144080"
],
"abstract": [
"Trust management is a form of distributed access control that allows one principal to delegate some access decisions to other principals. While the use of delegation greatly enhances flexibility and scalability, it may also reduce... |
cs0502003 | 1709954365 | We consider the simulation of wireless sensor networks (WSN) using a new approach. We present Shawn, an open-source discrete-event simulator that has considerable differences to all other existing simulators. Shawn is very powerful in simulating large scale networks with an abstract point of view. It is, to the best of... | The TinyOS mote simulator'' simulates TinyOS @cite_16 motes at the bit level and is hence a platform-specific simulator emulator. It directly compiles code written for TinyOS to an executable file that can be run on standard PC equipment. Using this technique, developers can test their implementation without having to ... | {
"cite_N": [
"@cite_16",
"@cite_13",
"@cite_3"
],
"mid": [
"1971903460",
"",
"2110936068"
],
"abstract": [
"We present nesC, a programming language for networked embedded systems that represent a new design space for application developers. An example of a networked embedded syste... |
cs0502025 | 2950320586 | The software approach to developing Digital Signal Processing (DSP) applications brings some great features such as flexibility, re-usability of resources and easy upgrading of applications. However, it requires long and tedious tests and verification phases because of the increasing complexity of the software. This im... | @cite_3 proposed to dynamically select a suitable partitioning according to the property to be proved, avoiding exponential explosion of the analysis caused by in-depth detailed partitioning. | {
"cite_N": [
"@cite_3"
],
"mid": [
"1582451030"
],
"abstract": [
"We apply linear relation analysis [CH78, HPR97] to the verification of declarative synchronous programs [Hal98]. In this approach, state partitioning plays an important role: on one hand the precision of the results highly depends ... |
cs0502056 | 2949328284 | The field of digital libraries (DLs) coalesced in 1994: the first digital library conferences were held that year, awareness of the World Wide Web was accelerating, and the National Science Foundation awarded @math AuthorRank$ as an indicator of the impact of an individual author in the network. The results are validat... | Social network analysis is based on the premise that the relationships between social actors can be described by a graph. The graph's nodes represent social actors and the graph's edges connect pairs of nodes and thus represent social interactions. This representation allows researchers to apply graph theory @cite_12 t... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2061901927"
],
"abstract": [
"Part I. Introduction: Networks, Relations, and Structure: 1. Relations and networks in the social and behavioral sciences 2. Social network data: collection and application Part II. Mathematical Representations of Social Networks:... |
cs0502056 | 2949328284 | The field of digital libraries (DLs) coalesced in 1994: the first digital library conferences were held that year, awareness of the World Wide Web was accelerating, and the National Science Foundation awarded @math AuthorRank$ as an indicator of the impact of an individual author in the network. The results are validat... | An early example of a co-authorship network is the Erd " o s Number Project, in which the smallest number of co-authorship links between any individual mathematician and the Hungarian mathematician Erd " o s are calculated @cite_23 . (A mathematician's Erd " o s Number'' is analogous to an actor's Bacon Number''.) Newm... | {
"cite_N": [
"@cite_14",
"@cite_4",
"@cite_33",
"@cite_9",
"@cite_3",
"@cite_6",
"@cite_19",
"@cite_27",
"@cite_23",
"@cite_5",
"@cite_17"
],
"mid": [
"1974087593",
"2060460295",
"",
"2068557399",
"1671906456",
"2155969378",
"2025572017",
... |
cs0502088 | 2950691337 | In [Hitzler and Wendt 2002, 2005], a new methodology has been proposed which allows to derive uniform characterizations of different declarative semantics for logic programs with negation. One result from this work is that the well-founded semantics can formally be understood as a stratified version of the Fitting (or ... | Loyer, Spyratos and Stamate, in @cite_11 , presented a parametrized approach to different semantics. It allows to substitute the preference for falsehood by preference for truth in the stable and well-founded semantics, but uses entirely different means than presented here. Its purpose is also different --- while we fo... | {
"cite_N": [
"@cite_11"
],
"mid": [
"2141863299"
],
"abstract": [
"The different semantics that can be assigned to a logic program correspond to different assumptions made concerning the atoms that are rule heads and whose logical values cannot be inferred from the rules. For example, the well fo... |
cs0501006 | 2949144408 | The paper considers various formalisms based on Automata, Temporal Logic and Regular Expressions for specifying queries over sequences. Unlike traditional binary semantics, the paper presents a similarity based semantics for thse formalisms. More specifically, a distance measure in the range [0,1] is associated with a ... | There have been various formalisms for representing uncertainty (see @cite_21 ) such as probability measures, Dempster-Shafer belief functions, plausibility measures, etc. Our similarity measures for temporal logics and automata can possibly be categorized under plausibility measures and they are quite different from p... | {
"cite_N": [
"@cite_21",
"@cite_25"
],
"mid": [
"1526328753",
"1982800675"
],
"abstract": [
"In order to deal with uncertainty intelligently, we need to be able to represent it and reason about it. In this book, Joseph Halpern examines formal ways of representing uncertainty and considers... |
cs0501006 | 2949144408 | The paper considers various formalisms based on Automata, Temporal Logic and Regular Expressions for specifying queries over sequences. Unlike traditional binary semantics, the paper presents a similarity based semantics for thse formalisms. More specifically, a distance measure in the range [0,1] is associated with a ... | Since the appearance of a preliminary version of this paper @cite_19 , other non-probabilistic quantitative versions of temporal logic have been proposed in @cite_23 @cite_13 . Both these works consider infinite computations and branching time temporal logics. The similarity measure they give, for the linear time fragm... | {
"cite_N": [
"@cite_19",
"@cite_13",
"@cite_23"
],
"mid": [
"1712909018",
"",
"2109187338"
],
"abstract": [
"Similarity based retrieval is of major importance for querying sequence databases. We consider formalisms based on automata, temporal logics and regular expressions for que... |
cs0412007 | 2140668275 | 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 destination, has been argued to introduce uncontrolled sampling biases that might produce statistical properties of... | In this section, we shortly review some recent works devoted to the sampling of graphs by shortest path probing procedures. @cite_20 have shown that biases can seriously affect the estimation of degree distributions. In particular, power-law like distributions can be observed for subgraphs of Erd "os-R 'enyi random gra... | {
"cite_N": [
"@cite_23",
"@cite_20"
],
"mid": [
"1693225151",
"2107648668"
],
"abstract": [
"Despite great effort spent measuring topological features of large networks like the Internet, it was recently argued that sampling based on taking paths through the network (e.g., traceroutes) in... |
cs0412007 | 2140668275 | 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 destination, has been argued to introduce uncontrolled sampling biases that might produce statistical properties of... | In a slightly different context, Petermann and De Los Rios have studied a traceroute -like procedure on various examples of scale-free graphs @cite_10 , 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 f... | {
"cite_N": [
"@cite_27",
"@cite_10"
],
"mid": [
"1479935453",
"2964134979"
],
"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... |
cond-mat0412368 | 2949195487 | Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expensive. We propose here a measure of similarities between vertices based on random walks which has several important advantages: it captures w... | In the current situation, one can process graphs with up to a few hundreds of thousands vertices using the method in @cite_17 . All other algorithms have more limited performances (they generally cannot manage more than some thousands of vertices). | {
"cite_N": [
"@cite_17"
],
"mid": [
"2047940964"
],
"abstract": [
"The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsuitable for very large networks because of their comput... |
cs0412021 | 2950884425 | A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion of consistency. Bounds consistency is the method of choice for building propaga... | reworded Lhomme @cite_15 defines which formalizes bounds propagation for both integer and real constraints. He proposes an efficient propagation algorithm implementing arc B-consistency with complexity analysis and experimental results. However, his study focuses on constraints defined by numeric relations (i.e. numeri... | {
"cite_N": [
"@cite_15"
],
"mid": [
"1548650523"
],
"abstract": [
"Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the consistency techniques that have been developed fo... |
cs0412021 | 2950884425 | A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion of consistency. Bounds consistency is the method of choice for building propaga... | Maher @cite_9 introduces the notion of propagation completeness together with a general framework to unify a wide range of consistency. These include hull consistency of real constraints and consistency of integer constraints. Propagation completeness aims to capture the timeliness property of propagation. | {
"cite_N": [
"@cite_9"
],
"mid": [
"1594857028"
],
"abstract": [
"We develop a framework for addressing correctness and timeliness-of-propagation issues for reactive constraints - global constraints or user-defined constraints that are implemented through constraint propagation. The notion of pro... |
cs0412021 | 2950884425 | A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagation is performed by propagators implementing a certain notion of consistency. Bounds consistency is the method of choice for building propaga... | The application of bounds consistency is not limited to integer and real constraints. Bounds consistency has been formalized for solving set constraints @cite_13 , and more recently, multiset constraints @cite_12 . | {
"cite_N": [
"@cite_13",
"@cite_12"
],
"mid": [
"2085716817",
"1500096329"
],
"abstract": [
"Local consistency techniques have been introduced in logic programming in order to extend the application domain of logic programming languages. The existing languages based on these techniques co... |
cs0412041 | 1670256845 | An efficient and flexible engine for computing fixed points is critical for many practical applications. In this paper, we firstly present a goal-directed fixed point computation strategy in the logic programming paradigm. The strategy adopts a tabled resolution (or memorized resolution) to mimic the efficient semi-nai... | The huge implementation effort needed for implementing OLDT and SLG can be avoided by choosing alternative methods for tabled resolutions that maintain a single computation tree similar to traditional SLD resolution, rather than maintaining a forest of SLD trees . SLDT resolution @cite_23 @cite_9 was the first attempt ... | {
"cite_N": [
"@cite_9",
"@cite_1",
"@cite_22",
"@cite_23"
],
"mid": [
"2096979400",
"2042416159",
"2155945137",
"2080716125"
],
"abstract": [
"Delaying-based tabling mechanisms, such as the one adopted in XSB, are non-linear in the sense that the computation state of delay... |
cs0412042 | 2952981805 | In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied con... | Constraint satisfaction problems (CSPs) have always played a central role in this direction of research, since the CSP framework contains many natural computational problems, for example, from graph theory and propositional logic. Moreover, certain CSPs were used to build foundations for the theory of complexity for op... | {
"cite_N": [
"@cite_15",
"@cite_13",
"@cite_8"
],
"mid": [
"",
"2038225707",
"1999032440"
],
"abstract": [
"",
"We define a natural variant of NP, MAX NP, and also a subclass called MAX SNP. These are classes of optimization problems, and in fact contain several natural, well-... |
cs0412042 | 2952981805 | In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied con... | Note that throughout the paper the values 0 and 1 taken by any predicate will be considered, rather unusually, as integers, not as Boolean values, and addition will always denote the addition of integers. It easy to check that, in the Boolean case, our problem coincides with the Max CSP problem considered in @cite_18 @... | {
"cite_N": [
"@cite_18",
"@cite_21",
"@cite_2"
],
"mid": [
"",
"1571873445",
"2068190866"
],
"abstract": [
"",
"Preface 1. Introduction 2. Complexity Classes 3. Boolean Constraint Satisfaction Problems 4. Characterizations of Constraint Functions 5. Implementation of Functions... |
cs0412042 | 2952981805 | In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied con... | The Max-CSP framework has been well-studied in the Boolean case. Many fundamental results have been obtained, concerning both complexity classifications and approximation properties (see, e.g., @cite_18 @cite_21 @cite_8 @cite_3 @cite_2 @cite_26 ). In the non-Boolean case, a number of results have been obtained that con... | {
"cite_N": [
"@cite_18",
"@cite_26",
"@cite_8",
"@cite_21",
"@cite_1",
"@cite_3",
"@cite_0",
"@cite_2",
"@cite_5",
"@cite_10"
],
"mid": [
"",
"1967935161",
"1999032440",
"1571873445",
"",
"2028733517",
"2097646889",
"2068190866",
"208435... |
cs0412042 | 2952981805 | In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied con... | For the Boolean case, Problem was solved in @cite_18 @cite_21 @cite_2 . It appears that a Boolean @math also exhibits a dichotomy in that it either is solvable exactly in polynomial time or else does not admit a PTAS (polynomial-time approximation scheme) unless = . These papers also describe the boundary between the t... | {
"cite_N": [
"@cite_18",
"@cite_21",
"@cite_2"
],
"mid": [
"",
"1571873445",
"2068190866"
],
"abstract": [
"",
"Preface 1. Introduction 2. Complexity Classes 3. Boolean Constraint Satisfaction Problems 4. Characterizations of Constraint Functions 5. Implementation of Functions... |
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 this section we discuss some related work. In @cite_18 , Roscoe identifies two ways of specifying protocol security goals: firstly, using specifications, and secondly using specifications. An extensional specification describes the intended service provided by the protocol in terms of behavioural equivalence @cite_8... | {
"cite_N": [
"@cite_18",
"@cite_7",
"@cite_8",
"@cite_6",
"@cite_0",
"@cite_2",
"@cite_5",
"@cite_13",
"@cite_17"
],
"mid": [
"",
"1991354622",
"",
"2078142047",
"2110423379",
"2105237010",
"2104130981",
"",
""
],
"abstract": [
"",
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.