aid stringlengths 9 15 | mid stringlengths 7 10 | abstract stringlengths 78 2.56k | related_work stringlengths 92 1.77k | ref_abstract dict |
|---|---|---|---|---|
1906.00850 | 2947982151 | Interest in smart cities is rapidly rising due to the global rise in urbanization and the wide-scale instrumentation of modern cities. Due to the considerable infrastructural cost of setting up smart cities and smart communities, researchers are exploring the use of existing vehicles on the roads as "message ferries" f... | @cite_1 , authors state that existing network infrastructure in smart cities can not sustain the traffic generated by sensors. To overcome this problem, an investment in telecommunication infrastructure is required. However, authors proposed to exploit buses in a Delay Tolerant Network (DTN) to transfer data in smart c... | {
"cite_N": [
"@cite_5",
"@cite_1"
],
"mid": [
"2782962104",
"2607377528"
],
"abstract": [
"During large-scale disasters, such as the Great East Japan Earthquake in 2011 or Kumamoto huge Earthquake in 2016, many regions were isolated from critical information exchanges due to problems with... |
1906.00850 | 2947982151 | Interest in smart cities is rapidly rising due to the global rise in urbanization and the wide-scale instrumentation of modern cities. Due to the considerable infrastructural cost of setting up smart cities and smart communities, researchers are exploring the use of existing vehicles on the roads as "message ferries" f... | @cite_18 conduct a study on using taxi cabs as oblivious data mules for data collection and delivery in smart cities. They have no guarantee on data communications since they are using taxi cabs without any selection criteria. They use real taxi traces in the city of Rome and divide the city into blocks of size @math m... | {
"cite_N": [
"@cite_18"
],
"mid": [
"2254736503"
],
"abstract": [
"Abstract How to deliver data to, or collect data from the hundreds of thousands of sensors and actuators integrated in “things” spread across virtually every smart city streets (garbage cans, storm drains, advertising panels, etc.... |
1906.00852 | 2947767238 | Conventional application of convolutional neural networks (CNNs) for image classification and recognition is based on the assumption that all target classes are equal(i.e., no hierarchy) and exclusive of one another (i.e., no overlap). CNN-based image classifiers built on this assumption, therefore, cannot take into ac... | It is well known that transferring learned information to a new task as an auxiliary information enables efficient learning of a new task @cite_21 , while providing acquired information from a wider network to a thinner network improves the performance of the thinner network @cite_3 . | {
"cite_N": [
"@cite_21",
"@cite_3"
],
"mid": [
"2165698076",
"1690739335"
],
"abstract": [
"A major assumption in many machine learning and data mining algorithms is that the training and future data must be in the same feature space and have the same distribution. However, in many real-w... |
1906.00852 | 2947767238 | Conventional application of convolutional neural networks (CNNs) for image classification and recognition is based on the assumption that all target classes are equal(i.e., no hierarchy) and exclusive of one another (i.e., no overlap). CNN-based image classifiers built on this assumption, therefore, cannot take into ac... | Auxiliary information from the input data also improves the performance. In the stage-wise learning, coarse to finer images, which are subsampled from the original images, are fed to the network step by step to enhance the learning process @cite_22 . The ROCK architecture introduces an auxiliary block which can perform... | {
"cite_N": [
"@cite_18",
"@cite_22"
],
"mid": [
"2891303672",
"2280728065"
],
"abstract": [
"Multi-Task Learning (MTL) is appealing for deep learning regularization. In this paper, we tackle a specific MTL context denoted as primary MTL, where the ultimate goal is to improve the performan... |
1906.00852 | 2947767238 | Conventional application of convolutional neural networks (CNNs) for image classification and recognition is based on the assumption that all target classes are equal(i.e., no hierarchy) and exclusive of one another (i.e., no overlap). CNN-based image classifiers built on this assumption, therefore, cannot take into ac... | There have been proposed numerous approaches to utilize hierarchical class information as well. connect multi-layer perceptrons (MLPs) and let each MLP sequentially learn a hierarchical class as rear layer takes the output of the preceding layer as its input. insert coarse category component and fine category component... | {
"cite_N": [
"@cite_9"
],
"mid": [
"2905563945"
],
"abstract": [
"The availability of large-scale annotated data and the uneven separability of different data categories have become two major impediments of deep learning for image classification. In this paper, we present a semi-supervised hierar... |
1906.00852 | 2947767238 | Conventional application of convolutional neural networks (CNNs) for image classification and recognition is based on the assumption that all target classes are equal(i.e., no hierarchy) and exclusive of one another (i.e., no overlap). CNN-based image classifiers built on this assumption, therefore, cannot take into ac... | B-CNN learns from coarse features to fine features by calculating loss between superclasses and outputs from the branches of the architecture @cite_2 , where the loss of B-CNN is the weighted sum of all losses over branches. In @cite_4 , an ultrametric tree is proposed based on semantic meaning of all classes to use hi... | {
"cite_N": [
"@cite_4",
"@cite_2"
],
"mid": [
"2753276755",
"2756815061"
],
"abstract": [
"Failing to distinguish between a sheepdog and a skyscraper should be worse and penalized more than failing to distinguish between a sheepdog and a poodle; after all, sheepdogs and poodles are both b... |
1906.00852 | 2947767238 | Conventional application of convolutional neural networks (CNNs) for image classification and recognition is based on the assumption that all target classes are equal(i.e., no hierarchy) and exclusive of one another (i.e., no overlap). CNN-based image classifiers built on this assumption, therefore, cannot take into ac... | Furthermore, auxiliary inputs are used to check logical reasoning in @cite_20 . Auxiliary inputs based on human knowledge are provided to the network to let the network learn logical reasoning. The network verifies the logical information with the auxiliary inputs first and proceeds to the next stage. | {
"cite_N": [
"@cite_20"
],
"mid": [
"2809918697"
],
"abstract": [
"This paper describes a neural network design using auxiliary inputs, namely the indicators, that act as the hints to explain the predicted outcome through logical reasoning, mimicking the human behavior of deductive reasoning. Bes... |
1906.00928 | 2947601766 | We consider the problem of learning a causal graph in the presence of measurement error. This setting is for example common in genomics, where gene expression is corrupted through the measurement process. We develop a provably consistent procedure for estimating the causal structure in a linear Gaussian structural equa... | In the presence of latent variables, identifiability is further weakened (only the so-called PAG is identifiable) and various algorithms have been developed for learning a PAG @cite_13 @cite_22 @cite_4 @cite_19 . However, these algorithms cannot estimate causal relations among the latent variables, which is our problem... | {
"cite_N": [
"@cite_26",
"@cite_4",
"@cite_22",
"@cite_28",
"@cite_21",
"@cite_6",
"@cite_19",
"@cite_23",
"@cite_13"
],
"mid": [
"2260672489",
"",
"2394978111",
"2963254467",
"2137099275",
"2626207843",
"2134652049",
"1505105018",
"21636874... |
1906.00679 | 2947597348 | The holy grail of networking is to create that organize, manage, and drive themselves. Such a vision now seems attainable thanks in large part to the progress in the field of machine learning (ML), which has now already disrupted a number of industries and revolutionized practically all fields of research. But are the ... | With the well-known attacks proposed in the literature @cite_8 , the bar of effort required for launching new attacks has lowered since the same canned attacks can be used by others. Although Sommer and Paxson @cite_14 were probably right in 2010 to downplay the potential of security attacks on ML saying exploiting the... | {
"cite_N": [
"@cite_14",
"@cite_8"
],
"mid": [
"1985987493",
"2773446523"
],
"abstract": [
"In network intrusion detection research, one popular strategy for finding attacks is monitoring a network's activity for anomalies: deviations from profiles of normality previously learned from ben... |
1906.00679 | 2947597348 | The holy grail of networking is to create that organize, manage, and drive themselves. Such a vision now seems attainable thanks in large part to the progress in the field of machine learning (ML), which has now already disrupted a number of industries and revolutionized practically all fields of research. But are the ... | All classification schemes depicted in the taxonomy are directly related to the intent goal of the adversary. Most of the existing adversarial ML attacks are white-box attacks, which are later converted to black-box attacks by exploiting the transferability property of adversarial examples @cite_7 . The transferability... | {
"cite_N": [
"@cite_7",
"@cite_8"
],
"mid": [
"1673923490",
"2773446523"
],
"abstract": [
"Deep neural networks are highly expressive models that have recently achieved state of the art performance on speech and visual recognition tasks. While their expressiveness is the reason they succe... |
1906.00860 | 2947878631 | We prove the linear stability of slowly rotating Kerr black holes as solutions of the Einstein vacuum equation: linearized perturbations of a Kerr metric decay at an inverse polynomial rate to a linearized Kerr metric plus a pure gauge term. We work in a natural wave map DeTurck gauge and show that the pure gauge term ... | In the algebraically more complicated but analytically less degenerate context of cosmological black holes, we recall that S 'a Barreto--Zworski @cite_113 studied the distribution of resonances of SdS black holes; exponential decay of linear scalar waves to constants was proved by Bony--H "afner @cite_36 and Melrose--S... | {
"cite_N": [
"@cite_36",
"@cite_70",
"@cite_28",
"@cite_112",
"@cite_102",
"@cite_113",
"@cite_56",
"@cite_24",
"@cite_116",
"@cite_63",
"@cite_110",
"@cite_31",
"@cite_73",
"@cite_66"
],
"mid": [
"1965595223",
"2018414839",
"",
"1752701691"... |
1906.01009 | 2948602696 | The Mallows model, introduced in the seminal paper of Mallows 1957, is one of the most fundamental ranking distribution over the symmetric group @math . To analyze more complex ranking data, several studies considered the Generalized Mallows model defined by Fligner and Verducci 1986. Despite the significant research i... | There has been a significant volume of research work on algorithmic and learning problems related to our work. In the , a finite set @math of rankings is given, and we want to compute the ranking @math . This problem is known to be NP-hard , but it admits a polynomial-time @math -approximation algorithm problem and a P... | {
"cite_N": [
"@cite_9",
"@cite_10",
"@cite_8"
],
"mid": [
"1584796555",
"2012215691",
"2113815377"
],
"abstract": [
"This paper studies problems of inferring order given noisy information. In these problems there is an unknown order (permutation) @math on @math elements denoted by... |
1906.01009 | 2948602696 | The Mallows model, introduced in the seminal paper of Mallows 1957, is one of the most fundamental ranking distribution over the symmetric group @math . To analyze more complex ranking data, several studies considered the Generalized Mallows model defined by Fligner and Verducci 1986. Despite the significant research i... | @cite_5 considered learning the spread parameter of a Mallows model based on a single sample, assuming that the central ranking is known. He studied the asymptotic behavior of his estimator and proved consistency. We strengthen this result by showing that our parameter estimator, based on single sample, can achieve opt... | {
"cite_N": [
"@cite_5"
],
"mid": [
"1511376624"
],
"abstract": [
"Asymptotics of the normalizing constant is computed for a class of one parameter exponential families on permutations which includes Mallows model with Spearmans's Footrule and Spearman's Rank Correlation Statistic. The MLE, and a ... |
1906.01009 | 2948602696 | The Mallows model, introduced in the seminal paper of Mallows 1957, is one of the most fundamental ranking distribution over the symmetric group @math . To analyze more complex ranking data, several studies considered the Generalized Mallows model defined by Fligner and Verducci 1986. Despite the significant research i... | The parameter estimation of the Generalized Mallows Model has been examined from a practical point of view by @cite_7 but no theoretical guarantees for the sample complexity have been provided. Several ranking models are routinely used in analyzing ranking data , such as Plackett-Luce model , Babington-Smith model and ... | {
"cite_N": [
"@cite_7"
],
"mid": [
"43928053"
],
"abstract": [
"SUMMARY A probability distribution is defined over the r! permutations of r objects in such a way as to incorporate up to r! -1 parameters. Problems of estimation and testing are considered. The results are applied to data on voting ... |
1906.00777 | 2947226932 | Drone base station (DBS) is a promising technique to extend wireless connections for uncovered users of terrestrial radio access networks (RAN). To improve user fairness and network performance, in this paper, we design 3D trajectories of multiple DBSs in the drone assisted radio access networks (DA-RAN) where DBSs fly... | Promoted by the advancements in the flying control and communication technologies, both industry and academia are devoting many efforts to exploit the full potential of DA-RAN @cite_11 . As the foundation for drone communication and DA-RAN research, Al-Hourani . built the D2U pathloss model for DBS according to abundan... | {
"cite_N": [
"@cite_8",
"@cite_23",
"@cite_11"
],
"mid": [
"2758233612",
"2031834036",
"2962691117"
],
"abstract": [
"Operating unmanned aerial vehicle (UAV) over cellular networks would open the barriers of remote navigation and far-flung flying by combining the benefits of UAVs ... |
1906.00777 | 2947226932 | Drone base station (DBS) is a promising technique to extend wireless connections for uncovered users of terrestrial radio access networks (RAN). To improve user fairness and network performance, in this paper, we design 3D trajectories of multiple DBSs in the drone assisted radio access networks (DA-RAN) where DBSs fly... | In most static DBS deployment works, the terrestrial user QoS or network performance is improved through optimizing the hovering position of single or multiple DBSs. For instance, through a clustering based approach, Mozaffari . designed the optimal locations of DBSs that maximize the information collection gain from t... | {
"cite_N": [
"@cite_13",
"@cite_8",
"@cite_28",
"@cite_24",
"@cite_16",
"@cite_10"
],
"mid": [
"2604830243",
"2758233612",
"2558339943",
"2962968784",
"2802614201",
"2963533607"
],
"abstract": [
"In this paper, the efficient deployment and mobility of multi... |
1906.01012 | 2948721154 | Action recognition is so far mainly focusing on the problem of classification of hand selected preclipped actions and reaching impressive results in this field. But with the performance even ceiling on current datasets, it also appears that the next steps in the field will have to go beyond this fully supervised classi... | Action recognition has been a challenging topic for long and a lot of innovative approaches, mainly for the task of action classification @cite_30 @cite_26 @cite_32 , have come up in the research community. But, obviously, we are still far away from the real-world task of learning arbitrary action classes from video da... | {
"cite_N": [
"@cite_30",
"@cite_26",
"@cite_32"
],
"mid": [
"2142194269",
"2105101328",
"2156303437"
],
"abstract": [
"The aim of this paper is to address recognition of natural human actions in diverse and realistic video settings. This challenging but important subject has mostl... |
1906.01012 | 2948721154 | Action recognition is so far mainly focusing on the problem of classification of hand selected preclipped actions and reaching impressive results in this field. But with the performance even ceiling on current datasets, it also appears that the next steps in the field will have to go beyond this fully supervised classi... | Apart from first generation datasets @cite_2 @cite_23 where actors were required to perform certain actions in controlled environment, current datasets such as HMDB @cite_22 , UCF @cite_27 or the recently released Kinetics dataset @cite_24 are mainly acquired from web sources such as YouTube clips or movies with the ai... | {
"cite_N": [
"@cite_22",
"@cite_6",
"@cite_24",
"@cite_27",
"@cite_23",
"@cite_2",
"@cite_15",
"@cite_16",
"@cite_13"
],
"mid": [
"2126579184",
"2019660985",
"2963524571",
"24089286",
"2034328688",
"2010399676",
"",
"2099614498",
""
],
"... |
cs0003054 | 2949339967 | The idle computers on a local area, campus area, or even wide area network represent a significant computational resource---one that is, however, also unreliable, heterogeneous, and opportunistic. This type of resource has been used effectively for embarrassingly parallel problems but not for more tightly coupled probl... | The only fully decentralized, fault-tolerant B &B algorithm for distributed-memory architectures is DIB (Distributed Implementation of Backtracking) @cite_0 . DIB was designed for a wide range of tree-based applications, such as recursive backtrack, branch-and-bound, and alpha-beta pruning. It is a distributed, asynchr... | {
"cite_N": [
"@cite_0"
],
"mid": [
"1984263429"
],
"abstract": [
"DIB is a general-purpose package that allows a wide range of applications such as recursive backtrack, branch and bound, and alpha-beta search to be implemented on a multicomputer. It is very easy to use. The application program ne... |
cs0003008 | 1524644832 | This paper presents a method of computing a revision of a function-free normal logic program. If an added rule is inconsistent with a program, that is, if it leads to a situation such that no stable model exists for a new program, then deletion and addition of rules are performed to avoid inconsistency. We specify a re... | There are many procedures to compute stable models, generalized stable models or abduction. If we use a bottom-up procedure for our translated abductive logic program to compute all the generalized stable models naively, then sets of abducibles to be compared would be larger since abducibles of irrelevant temporary rul... | {
"cite_N": [
"@cite_16"
],
"mid": [
"190622319"
],
"abstract": [
"Abstract We propose an extension of the SLDNF proof procedure for checking integrity constraints in deductive databases. To achieve the effect of the simplification methods investigated by Nicolas [1982], Lloyd, Sonenberg, and Topo... |
cs0003028 | 2953269011 | We describe an approach for compiling preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in which rules are named by unique terms, and in which preferences among rules are given by a set of dedicated atoms. An ordered logic program is transformed into a... | Dealing with preferences on rules seems to necessitate a two-level approach. This in fact is a characteristic of many approaches found in the literature. The majority of these approaches treat preference at the meta-level by defining alternative semantics. @cite_1 proposes a modification of well-founded semantics in wh... | {
"cite_N": [
"@cite_5",
"@cite_1",
"@cite_12"
],
"mid": [
"2124627636",
"1847820984",
"1577410338"
],
"abstract": [
"Abstract In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prio... |
cs0003028 | 2953269011 | We describe an approach for compiling preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in which rules are named by unique terms, and in which preferences among rules are given by a set of dedicated atoms. An ordered logic program is transformed into a... | Brewka and Eiter @cite_5 address static preferences on rules in extended logic programs. They begin with a strict partial order on a set of rules, but define preference with respect to total orders that conform to the original partial order. Preferred answer sets are then selected from among the collection of answer se... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2124627636"
],
"abstract": [
"Abstract In this paper, we address the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs. In such programs an ordering on the program rules... |
cs0003028 | 2953269011 | We describe an approach for compiling preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in which rules are named by unique terms, and in which preferences among rules are given by a set of dedicated atoms. An ordered logic program is transformed into a... | A two-level approach is also found in @cite_7 , where a methodology for directly encoding preferences in logic programs is proposed. The second-order flavour'' of this approach stems from the reification of rules and preferences. For example, a rule ( p r, s, q ) is expressed by the formula ( default (n, p, [r, s], [q]... | {
"cite_N": [
"@cite_7"
],
"mid": [
"1482502297"
],
"abstract": [
"The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a domain independent system of axioms, written as an ex... |
cs0005010 | 2951494809 | An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the semantics and the algorithm to handle new and more expressive types of rules. Emphasis is placed on the use of efficient implementation techniques. In particular, an implementation of lookahead that... | If we look in a broader context, then finding a stable model is a combinatorial search problem. Other forms of combinatorial search problems are propositional satisfiability, constraint satisfaction, constraint logic programming and integer linear programming problems, and some other logic programming problems such as ... | {
"cite_N": [
"@cite_28"
],
"mid": [
"2051790368"
],
"abstract": [
"In this paper a logic-based specification language, called NP-SPEC, is presented. The language is obtained by extending DATALOG through allowing a limited use of some second-order predicates of predefined form. NP-SPEC programs sp... |
cs0005010 | 2951494809 | An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the semantics and the algorithm to handle new and more expressive types of rules. Emphasis is placed on the use of efficient implementation techniques. In particular, an implementation of lookahead that... | From an algorithmic standpoint the progenitor of the @math algorithm is the Davis-Putnam (-Logemann-Loveland) procedure @cite_37 for determining the satisfiability of propositional formulas. This procedure can be seen as a backtracking search procedure that makes assumptions about the truth values of the propositional ... | {
"cite_N": [
"@cite_37"
],
"mid": [
"2057361103"
],
"abstract": [
"The programming of a proof procedure is discussed in connection with trial runs and possible improvements."
]
} |
cs0005010 | 2951494809 | An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the semantics and the algorithm to handle new and more expressive types of rules. Emphasis is placed on the use of efficient implementation techniques. In particular, an implementation of lookahead that... | While the extended rules of this work are novel, there are some analogous constructions in the literature. The choice rule can be seen as a generalization of the disjunctive rule of the possible model semantics @cite_43 . The disjunctive rule of disjunctive logic programs @cite_14 also resembles the choice rule, but th... | {
"cite_N": [
"@cite_43",
"@cite_14"
],
"mid": [
"2050486226",
"2085084839"
],
"abstract": [
"In this paper, we study a new semantics of logic programming and deductive databases. Thepossible model semantics is introduced as a declarative semantics of disjunctive logic programs. The possib... |
math0005204 | 1540167525 | We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic set, (b) the height of the zero-dimensional part of an algebraic set over C, an... | As for more general relations between @math and its analogue over @math , it is easy to see that the decidability of @math implies the decidability of its analogue over @math . Unfortunately, the converse is currently unknown. Via Lagrange's Theorem (that any positive integer can be written as a sum of four squares) on... | {
"cite_N": [
"@cite_12"
],
"mid": [
"2159229515"
],
"abstract": [
"Let ∃n denote the set of all formulas ∃x1…∃xn[P(x1, …,xn) = 0], where P is a polynomial with integer coefficients. We prove a new relation-combining theorem from which it follows that if ∃n is undecidable over N, then ∃2n+2 is und... |
cs0005026 | 1644526253 | A one-time pad (OTP) based cipher to insure both data protection and integrity when mobile code arrives to a remote host is presented. Data protection is required when a mobile agent could retrieve confidential information that would be encrypted in untrusted nodes of the network; in this case, information management c... | Strong foundation is a requirement for future work in the topic of mobile agents @cite_12 . To design semantics and type-safety languages for agents in untrusted networks @cite_14 and supporting permissions languages for specifying distributed processes in dynamically evolving networks, as the languages derived from th... | {
"cite_N": [
"@cite_18",
"@cite_14",
"@cite_12"
],
"mid": [
"2006520458",
"2019545801",
"2061692729"
],
"abstract": [
"We describe a foundational language for specifying dynamically evolving networks of distributed processes, D�. The language is a distributed extension of the �-ca... |
cs0006023 | 2949089885 | We describe a statistical approach for modeling dialogue acts in conversational speech, i.e., speech-act-like units such as Statement, Question, Backchannel, Agreement, Disagreement, and Apology. Our model detects and predicts dialogue acts based on lexical, collocational, and prosodic cues, as well as on the discourse... | Previous research on DA modeling has generally focused on task-oriented dialogue, with three tasks in particular garnering much of the research effort. The Map Task corpus @cite_49 @cite_12 consists of conversations between two speakers with slightly different maps of an imaginary territory. Their task is to help one s... | {
"cite_N": [
"@cite_12",
"@cite_49"
],
"mid": [
"1784630400",
"2118142207"
],
"abstract": [
"The paper describes a resource for the study of spontaneous speech under stress, a corpus of 216 unscripted task-oriented dialogues conducted by normal Canadian adults in the course of a sleep dep... |
cs0006029 | 2952170707 | The advent of multipoint (multicast-based) applications and the growth and complexity of the Internet has complicated network protocol design and evaluation. In this paper, we present a method for automatic synthesis of worst and best case scenarios for multipoint protocol performance evaluation. Our method uses a faul... | There is a large body of literature dealing with verification of protocols. Verification systems typically address well-defined properties --such as safety , liveness , and responsiveness @cite_37 -- and aim to detect violations of these properties. In general, the two main approaches for protocol verification are theo... | {
"cite_N": [
"@cite_35",
"@cite_37",
"@cite_17",
"@cite_2"
],
"mid": [
"2099078002",
"2005307131",
"",
"2034717157"
],
"abstract": [
"Contains a precise and complete description of the computational logic develo by the authors; will serve also as a reference guide to the a... |
cs0006029 | 2952170707 | The advent of multipoint (multicast-based) applications and the growth and complexity of the Internet has complicated network protocol design and evaluation. In this paper, we present a method for automatic synthesis of worst and best case scenarios for multipoint protocol performance evaluation. Our method uses a faul... | There is a good number of publications dealing with conformance testing @cite_19 @cite_23 @cite_22 @cite_5 . However, conformance testing verifies that an implementation (as a black box) adheres to a given specification of the protocol by constructing input output sequences. Conformance testing is useful during the imp... | {
"cite_N": [
"@cite_19",
"@cite_5",
"@cite_22",
"@cite_23"
],
"mid": [
"2073074602",
"1965028135",
"2029755436",
"2326128742"
],
"abstract": [
"Abstract We present simple randomized algorithms for the fault detection problem : Given a specification in the form of a determi... |
cs0006029 | 2952170707 | The advent of multipoint (multicast-based) applications and the growth and complexity of the Internet has complicated network protocol design and evaluation. In this paper, we present a method for automatic synthesis of worst and best case scenarios for multipoint protocol performance evaluation. Our method uses a faul... | Automatic test generation techniques have been used in several fields. VLSI chip testing @cite_12 uses test vector generation to detect target faults. Test vectors may be generated based on circuit and fault models, using the fault-oriented technique, that utilizes implication techniques. These techniques were adopted ... | {
"cite_N": [
"@cite_25",
"@cite_12"
],
"mid": [
"1962021926",
"1554885925"
],
"abstract": [
"We present a new algorithm for automatic test generation for multicast routing. Our algorithm processes a finite state machine (FSM) model of the protocol and uses a mix of forward and backward se... |
cs0007002 | 2949562458 | Many problems in robust control and motion planning can be reduced to either find a sound approximation of the solution space determined by a set of nonlinear inequalities, or to the guaranteed tuning problem'' as defined by Jaulin and Walter, which amounts to finding a value for some tuning parameter such that a set o... | The method presented by @cite_40 is strongly related to the one we present in the following, since they rely on usual interval constraint solving techniques to compute sound boxes for some constraint system. Starting from a seed that is known to belong to the solution space, they enlarge the domain of the variables aro... | {
"cite_N": [
"@cite_40"
],
"mid": [
"1557280638"
],
"abstract": [
"This paper introduces a new framework for extending consistent domains of numeric CSP. The aim is to offer the greatest possible freedom of choice for one variable to the designer of a CAD application. Thus, we provide here an eff... |
cs0007004 | 1931024191 | Despite the effort of many researchers in the area of multi-agent systems (MAS) for designing and programming agents, a few years ago the research community began to take into account that common features among different MAS exists. Based on these common features, several tools have tackled the problem of agent develop... | JAFIMA (Java Framework for Intelligent and Mobile Agents) @cite_12 takes a different approach from the other tools: it is primarily targeted at expert developers who want to develop agents from scratch based on the abstract classes provided, so the programming effort is greater than in the other tools. The weakest poin... | {
"cite_N": [
"@cite_12"
],
"mid": [
"1514474014"
],
"abstract": [
"BUSINESS FRAMEWORKS (M. Fayad). Domain Framework for Sales Promotions (A. Dalebout, et al). A Reflective and Repository-Based Framework (M. Devos & M. Tilman). ARTIFICIAL INTELLIGENCE AND AGENT APPLICATION FRAMEWORKS (M. Fayad). S... |
cs0007004 | 1931024191 | Despite the effort of many researchers in the area of multi-agent systems (MAS) for designing and programming agents, a few years ago the research community began to take into account that common features among different MAS exists. Based on these common features, several tools have tackled the problem of agent develop... | A framework as Brainstorm J is not just a collection of components but also defines a generic design. When programmers use a framework they reuse that design and save time and effort. In addition, because of the bidirectional flow of control frameworks can contain much more functionality than a traditional library rega... | {
"cite_N": [
"@cite_9"
],
"mid": [
"38113107"
],
"abstract": [
"A fuel unit for a hybrid hot-gas generator comprises two consumable constituent parts of different compositions which are separated by a partition which in storage conditions is stable and chemically inert with respect to said two pa... |
cs0010019 | 2949302825 | We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions". The main result of this paper is a negative one: There exist signature and en... | Our definition of correlation-intractability is related to a definition by Okamoto @cite_21 . Using our terminology, Okamoto considers function ensembles for which it is infeasible to form input-output relations with respect to a specific evasive relation [Def. 19] Ok92 (rather than all such relations). He uses the ass... | {
"cite_N": [
"@cite_21"
],
"mid": [
"1554259298"
],
"abstract": [
"This paper presents a three-move interactive identification scheme and proves it to be as secure as the discrete logarithm problem. This provably secure scheme is almost as efficient as the Schnorr identification scheme, while the... |
cs0010019 | 2949302825 | We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions". The main result of this paper is a negative one: There exist signature and en... | First steps in the direction of identifying and studying useful special-purpose properties of the have been taken by Canetti @cite_10 . Specifically, Canetti considered a property called perfect one-wayness'', provided a definition of this property, constructions which possess this property (under some reasonable assum... | {
"cite_N": [
"@cite_28",
"@cite_10",
"@cite_4"
],
"mid": [
"1591954407",
"2139033758",
"122485702"
],
"abstract": [
"We present a new signature scheme which is existentially unforgeable under chosen message attacks, assuming some variant of the RSA conjecture. This scheme is not b... |
cs0010019 | 2949302825 | We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing the random oracle by so called "cryptographic hash functions". The main result of this paper is a negative one: There exist signature and en... | Following the preliminary version of the current work @cite_25 , Hada and Tanaka observed that the existence of even restricted correlation intractable functions (in the non uniform model) would be enough to prove that 3-round auxiliary-input zero-knowledge AM proof systems only exist for languages in BPP @cite_0 . (Re... | {
"cite_N": [
"@cite_0",
"@cite_25",
"@cite_3"
],
"mid": [
"1590334370",
"",
"1987890787"
],
"abstract": [
"Correlation intractable function ensembles were introduced in an attempt to capture the \"unpredictability\" property of a random oracle: It is assumed that if R is a random ... |
cs0011005 | 2952710481 | This paper presents a practical solution for detecting data races in parallel programs. The solution consists of a combination of execution replay (RecPlay) with automatic on-the-fly data race detection. This combination enables us to perform the data race detection on an unaltered execution (almost no probe effect). F... | Although much theoretical work has been done in the field of data race detection @cite_19 @cite_25 @cite_10 @cite_17 few implementations for general systems have been proposed. Tools proposed in the past had limited capabilities: they were targeted at programs using one semaphore @cite_11 , programs using only post wai... | {
"cite_N": [
"@cite_26",
"@cite_22",
"@cite_21",
"@cite_17",
"@cite_24",
"@cite_19",
"@cite_10",
"@cite_25",
"@cite_11"
],
"mid": [
"2168171401",
"32942804",
"",
"",
"2162446957",
"2147506153",
"2170200862",
"2088270410",
""
],
"abstract... |
cs0012007 | 2950755945 | We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explicit declarations of program properties. Strong moding typing and constraint-based analysis are turning to play fundamental roles in debugging ... | Analysis of malfunctioning systems based on their intended logical specification has been studied in the field of artificial intelligence @cite_9 and known as model-based diagnosis, which has some similarities with our work. However, the purpose of model-based diagnosis is to analyze the differences between intended an... | {
"cite_N": [
"@cite_9"
],
"mid": [
"2108309071"
],
"abstract": [
"Suppose one is given a description of a system, together with an observation of the system's behaviour which conflicts with the way the system is meant to behave. The diagnostic problem is to determine those components of the syste... |
cs0012007 | 2950755945 | We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explicit declarations of program properties. Strong moding typing and constraint-based analysis are turning to play fundamental roles in debugging ... | Wand proposed an algorithm for diagnosing non-well-typed functional programs @cite_5 . His approach was to extend the unification algorithm for type reconstruction to record which symbol occurrence imposed which constraint. In contrast, our framework is built outside any underlying framework of constraint solving. It d... | {
"cite_N": [
"@cite_5"
],
"mid": [
"2045313089"
],
"abstract": [
"It is a truism that most bugs are detected only at a great distance from their source. Although polymorphic type-checking systems like those in ML help greatly by detecting potential run-time type errors at compile-time, such syste... |
cs0102023 | 2122926560 | AbstractThis note addresses the input and output of intervals in the sense of intervalarithmetic and interval constraints. The most obvious, and so far most widely usednotation, for intervals has drawbacks that we remedy with a new notation that wepropose to call factored notation. It is more compact and allows one to ... | Hansen @cite_3 , @cite_5 , and Kearfott @cite_1 opt for the straightforward @math notation. Hansen mostly presents bounds with few digits, but for instance on page 178 we find @math demonstrating the problems addressed here. | {
"cite_N": [
"@cite_5",
"@cite_1",
"@cite_3"
],
"mid": [
"186367297",
"2129480103",
"2067648572"
],
"abstract": [
"From the Publisher: This book offers a general discussion on arithmetic and computational reliability, analytical mathematics and verification techniques, algorithms,... |
cs0102023 | 2122926560 | AbstractThis note addresses the input and output of intervals in the sense of intervalarithmetic and interval constraints. The most obvious, and so far most widely usednotation, for intervals has drawbacks that we remedy with a new notation that wepropose to call factored notation. It is more compact and allows one to ... | The standard notation in the Numerica book @cite_2 solves the scanning problem in an interesting way. It uses the idea of the @math notation, but writes instead @math . This variation has the advantage of not introducing new notation. The reason why we still prefer factored notation is clear from the @math example ), w... | {
"cite_N": [
"@cite_2"
],
"mid": [
"2167206762"
],
"abstract": [
"Part 1 Introduction: nonlinear programming local methods global methods Numerica outline. Part 2 A tour of Numerica: getting started generic constraints constants ranges input parameters aggregation operators functions sets unconst... |
cs0102017 | 2950044032 | Parallel jobs are different from sequential jobs and require a different type of process management. We present here a process management system for parallel programs such as those written using MPI. A primary goal of the system, which we call MPD (for multipurpose daemon), is to be scalable. By this we mean that start... | Many systems are intended to manage a collection of computing resources for both single-process and parallel jobs; see the survey by @cite_7 . Typically, these use a daemon that manages individual processes, with emphasis on jobs involving only a single process. Widely used systems include PBS @cite_11 , LSF @cite_0 , ... | {
"cite_N": [
"@cite_4",
"@cite_22",
"@cite_7",
"@cite_8",
"@cite_10",
"@cite_9",
"@cite_1",
"@cite_3",
"@cite_0",
"@cite_19",
"@cite_23",
"@cite_2",
"@cite_13",
"@cite_12",
"@cite_11"
],
"mid": [
"1759783712",
"",
"116504777",
"",
"2... |
cs0103026 | 2953044264 | This paper presents a corpus-based approach to word sense disambiguation where a decision tree assigns a sense to an ambiguous word based on the bigrams that occur nearby. This approach is evaluated using the sense-tagged corpora from the 1998 SENSEVAL word sense disambiguation exercise. It is more accurate than the av... | Bigrams have been used as features for word sense disambiguation, particularly in the form of collocations where the ambiguous word is one component of the bigram (e.g., @cite_10 , @cite_0 , @cite_9 ). While some of the bigrams we identify are collocations that include the word being disambiguated, there is no requirem... | {
"cite_N": [
"@cite_0",
"@cite_9",
"@cite_10"
],
"mid": [
"2949743947",
"2101210369",
""
],
"abstract": [
"In this paper, we present a new approach for word sense disambiguation (WSD) using an exemplar-based learning algorithm. This approach integrates a diverse set of knowledge s... |
cs0103026 | 2953044264 | This paper presents a corpus-based approach to word sense disambiguation where a decision tree assigns a sense to an ambiguous word based on the bigrams that occur nearby. This approach is evaluated using the sense-tagged corpora from the 1998 SENSEVAL word sense disambiguation exercise. It is more accurate than the av... | Decision trees have been used in supervised learning approaches to word sense disambiguation, and have fared well in a number of comparative studies (e.g., @cite_2 , @cite_17 ). In the former they were used with the bag of word feature sets and in the latter they were used with a mixed feature set that included the par... | {
"cite_N": [
"@cite_17",
"@cite_2"
],
"mid": [
"176608537",
"2949482574"
],
"abstract": [
"The Naive Mix is a new supervised learning algorithm that is based on a sequential method for selecting probabilistic models. The usual objective of model selection is to find a single model that ad... |
cs0103026 | 2953044264 | This paper presents a corpus-based approach to word sense disambiguation where a decision tree assigns a sense to an ambiguous word based on the bigrams that occur nearby. This approach is evaluated using the sense-tagged corpora from the 1998 SENSEVAL word sense disambiguation exercise. It is more accurate than the av... | The decision list is a closely related approach that has also been applied to word sense disambiguation (e.g., @cite_6 , @cite_14 , @cite_4 ). Rather than building and traversing a tree to perform disambiguation, a list is employed. In the general case a decision list may suffer from less fragmentation during learning ... | {
"cite_N": [
"@cite_14",
"@cite_4",
"@cite_6"
],
"mid": [
"2952637164",
"1489348810",
""
],
"abstract": [
"Word sense disambiguation algorithms, with few exceptions, have made use of only one lexical knowledge source. We describe a system which performs unrestricted word sense dis... |
cs0105021 | 1678362335 | This paper deals with a problem from discrete-time robust control which requires the solution of constraints over the reals that contain both universal and existential quantifiers. For solving this problem we formulate it as a program in a (fictitious) constraint logic programming language with explicit quantifier nota... | Inversion of functions on sets is done implicitly by every algorithm for solving systems of equations @cite_10 --- in this case the input set just contains one zero vector. It is mentioned explicitly mostly for computing the solution set of systems of inequalities @cite_32 @cite_37 . | {
"cite_N": [
"@cite_37",
"@cite_10",
"@cite_32"
],
"mid": [
"2106750726",
"1483874187",
""
],
"abstract": [
"A new method is presented for characterizing the set of all values of the parameters of a linear time-invariant model that are associated with a stable behavior. A formal R... |
cs0105021 | 1678362335 | This paper deals with a problem from discrete-time robust control which requires the solution of constraints over the reals that contain both universal and existential quantifiers. For solving this problem we formulate it as a program in a (fictitious) constraint logic programming language with explicit quantifier nota... | First-order constraints occur frequently in control, and especially robust control. Up to now they either have been solved by specialized methods @cite_19 @cite_3 @cite_1 or by applying general solvers like QEPCAD @cite_27 . In the first case one is usually restricted to conditions like linearity, and in the second cas... | {
"cite_N": [
"@cite_26",
"@cite_14",
"@cite_1",
"@cite_3",
"@cite_19",
"@cite_27",
"@cite_5",
"@cite_15",
"@cite_13",
"@cite_25",
"@cite_20",
"@cite_17"
],
"mid": [
"2114681281",
"2061749308",
"2124488301",
"1588998206",
"",
"2007074311",
... |
cs0105021 | 1678362335 | This paper deals with a problem from discrete-time robust control which requires the solution of constraints over the reals that contain both universal and existential quantifiers. For solving this problem we formulate it as a program in a (fictitious) constraint logic programming language with explicit quantifier nota... | Apart from the method used in this paper @cite_8 , there there have been several successful attempts at solving special cases of first-order constraints, for example using classical interval techniques @cite_36 @cite_21 or constraint satisfaction @cite_0 , and very often in the context of robust control @cite_2 @cite_3... | {
"cite_N": [
"@cite_30",
"@cite_8",
"@cite_36",
"@cite_28",
"@cite_21",
"@cite_0",
"@cite_2",
"@cite_11"
],
"mid": [
"1988549558",
"1504204411",
"2403711553",
"1972645441",
"1542502870",
"2611367645",
"1596669356",
"68519879"
],
"abstract": [
... |
math0105145 | 2090763901 | We study a class of systems of functional equations closely related to various kinds of integrable statistical and quantum mechanical models. We call them the finite and infinite @math -systems according to the number of functions and equations. The finite Q-systems appear as the thermal equilibrium conditions (the Sut... | ii) The ideal gas with the Haldane statistics and the Sutherland-Wu equation. The series @math has an interpretation of the grand partition function of the ideal gas with the Haldane exclusion statistics @cite_16 . The finite @math -system appeared in @cite_16 as the thermal equilibrium condition for the distribution f... | {
"cite_N": [
"@cite_23",
"@cite_16",
"@cite_1",
"@cite_26"
],
"mid": [
"1995427979",
"2095564275",
"2000277525",
"2013206718"
],
"abstract": [
"Abstract We systematically study the exclusion statistics for quasi-particles for Conformal Field Theory spectra by employing a m... |
math0105145 | 2090763901 | We study a class of systems of functional equations closely related to various kinds of integrable statistical and quantum mechanical models. We call them the finite and infinite @math -systems according to the number of functions and equations. The finite Q-systems appear as the thermal equilibrium conditions (the Sut... | Below we list the related works on Conjectures and -- mostly chronologically. However, the list is by no means complete. The series @math in ) admits a natural @math -analogue called the fermionic formula . This is another fascinating subject, but we do not cover it here. See @cite_23 @cite_7 @cite_6 and reference ther... | {
"cite_N": [
"@cite_34",
"@cite_7",
"@cite_23",
"@cite_6"
],
"mid": [
"2950112875",
"1618024583",
"1995427979",
"2106856555"
],
"abstract": [
"",
"Fermionic formulae originate in the Bethe ansatz in solvable lattice models. They are specific expressions of some q-polyn... |
math0105145 | 2090763901 | We study a class of systems of functional equations closely related to various kinds of integrable statistical and quantum mechanical models. We call them the finite and infinite @math -systems according to the number of functions and equations. The finite Q-systems appear as the thermal equilibrium conditions (the Sut... | 2 @cite_24 . Kerov . proposed and proved the type II formula for @math by the combinatorial method, where the bijection between the Littlewood-Richardson tableaux and the rigged configurations was constructed. | {
"cite_N": [
"@cite_24"
],
"mid": [
"2038912750"
],
"abstract": [
"Techniques developed in the realms of the quantum method of the inverse problem are used to analyze combinatorial problems (Young diagrams and rigged configurations)."
]
} |
math0105145 | 2090763901 | We study a class of systems of functional equations closely related to various kinds of integrable statistical and quantum mechanical models. We call them the finite and infinite @math -systems according to the number of functions and equations. The finite Q-systems appear as the thermal equilibrium conditions (the Sut... | 4 @cite_14 . Ogievetsky and Wiegmann proposed the type III formula of @math for some @math for the exceptional algebras from the reproduction scheme. | {
"cite_N": [
"@cite_14"
],
"mid": [
"2089188442"
],
"abstract": [
"Abstract The factorized S -matrices as well as the eigenvalues of the transfer matrices for symmetrical degrees of fundamental representations of all Lie groups are presented in the form of the Bethe ansatz in terms of roots syste... |
math0105145 | 2090763901 | We study a class of systems of functional equations closely related to various kinds of integrable statistical and quantum mechanical models. We call them the finite and infinite @math -systems according to the number of functions and equations. The finite Q-systems appear as the thermal equilibrium conditions (the Sut... | 8 @cite_22 . Kleber analyzed a combinatorial structure of the type II formula for the simply-laced algebras. In particular, it was proved that the type III formula of @math and the corresponding type II formula are equivalent for @math and @math . | {
"cite_N": [
"@cite_22"
],
"mid": [
"1653379927"
],
"abstract": [
"The invention relates to a negative electrode for an alkaline electrolyte electric cell. The main electrode material is nickel lanthanide and is characterized by the fact that it also includes a mercury compound. It is applicable ... |
math0105145 | 2090763901 | We study a class of systems of functional equations closely related to various kinds of integrable statistical and quantum mechanical models. We call them the finite and infinite @math -systems according to the number of functions and equations. The finite Q-systems appear as the thermal equilibrium conditions (the Sut... | 9 @cite_7 @cite_6 . Hatayama . gave a characterization of the type I formula as the solution of the @math -system which are @math -linear combinations of the @math -characters with the property equivalent to the convergence property ). Using it, the equivalence of the type III formula of @math and the type I formula of... | {
"cite_N": [
"@cite_6",
"@cite_7"
],
"mid": [
"2106856555",
"1618024583"
],
"abstract": [
"We introduce a fermionic formula associated with any quantum affine algebra U q (X N (r) . Guided by the interplay between corner transfer matrix and the Bethe ansatz in solvable lattice models, we ... |
math0105145 | 2090763901 | We study a class of systems of functional equations closely related to various kinds of integrable statistical and quantum mechanical models. We call them the finite and infinite @math -systems according to the number of functions and equations. The finite Q-systems appear as the thermal equilibrium conditions (the Sut... | 10 @cite_13 @cite_10 . The second formula in Conjecture was proposed and proved for @math @cite_13 from the formal completeness of the -type Bethe vectors. The same formula was proposed for @math , and the equivalence to the type I formula was proved @cite_10 . The type I formula is formulated in the form ), and the ch... | {
"cite_N": [
"@cite_10",
"@cite_13",
"@cite_7"
],
"mid": [
"",
"1994934410",
"1618024583"
],
"abstract": [
"",
"The ( U _ q ( s l (2)) ) Bethe equation is studied at q = 0. A linear congruence equation is proposed related to the string solutions. The number of its off-diagonal... |
math0105145 | 2090763901 | We study a class of systems of functional equations closely related to various kinds of integrable statistical and quantum mechanical models. We call them the finite and infinite @math -systems according to the number of functions and equations. The finite Q-systems appear as the thermal equilibrium conditions (the Sut... | 11 @cite_2 . Chari proved the type III formula of @math for @math for any @math for the classical algebras, and for some @math for the exceptional algebras. | {
"cite_N": [
"@cite_2"
],
"mid": [
"1797902674"
],
"abstract": [
"Radiation curable acrylated polyurethane is porduced by (a) producing an isocyanate-terminated intermediate by coreacting an organic diisocyanate with a combination of organic tri tetraol and organic diol, said combination being ch... |
math0105145 | 2090763901 | We study a class of systems of functional equations closely related to various kinds of integrable statistical and quantum mechanical models. We call them the finite and infinite @math -systems according to the number of functions and equations. The finite Q-systems appear as the thermal equilibrium conditions (the Sut... | 12 @cite_18 . Okado constructed bijections between the rigged configurations and the crystals (resp. virtual crystals) corresponding to @math , with @math for @math , for @math and @math (resp. @math ). As a corollary, the type II formula of those @math was proved for @math and @math . | {
"cite_N": [
"@cite_18"
],
"mid": [
"1582992125"
],
"abstract": [
"A device having utility in interfering with a person's desire to hold an object such as a cigarette, cigar or pipe, between his lips, i.e., an anti-smoking device. In the form of a cigarette holder, it includes a generally tubular... |
cs0107014 | 2949367797 | We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations which guarantee that the input output CCP semantics is preserved also when distinguishing deadlocked computations from successful ones and when considering intermediate r... | As mentioned in the introduction, this is one of the few attempts to apply fold unfold techniques in the field of concurrent languages. In fact, in the literature we find only three papers which are relatively closely related to the present one: Ueda and Furukawa UF88 defined transformation systems for the concurrent l... | {
"cite_N": [
"@cite_26",
"@cite_7"
],
"mid": [
"1503973138",
"2163058466"
],
"abstract": [
"Foreword. 1. Modelling Communication. 2. Basic Definitions. 3. Equational laws and Their Application. 4. Strong Bisimulation and Strong Equivalence. 5. Bisimulation and Observation Equivalence. 6. ... |
cs0107014 | 2949367797 | We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations which guarantee that the input output CCP semantics is preserved also when distinguishing deadlocked computations from successful ones and when considering intermediate r... | The transformation system we are proposing builds on the systems defined in the papers above and can be considered an extension of them. Differently from the previous cases, our system is defined for a generic (concurrent) constraint language. Thus, together with some new transformations such as the distribution, the b... | {
"cite_N": [
"@cite_9"
],
"mid": [
"1521956339"
],
"abstract": [
"One of the main aims of this paper is to show that the nature of the communication mechanism of concurrent constraint languages is essentially different from the classical paradigms of CCS, CSP and ACP. We define indeed a compositi... |
cs0107014 | 2949367797 | We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations which guarantee that the input output CCP semantics is preserved also when distinguishing deadlocked computations from successful ones and when considering intermediate r... | As previously mentioned, differently from our case in @cite_9 it is considered a definition of which allows us to remove potentially selectable branches; the consequence is that the resulting transformation system is only (thus not totally) correct. We should mention that in @cite_9 two preliminary assumptions on the s... | {
"cite_N": [
"@cite_9"
],
"mid": [
"1521956339"
],
"abstract": [
"One of the main aims of this paper is to show that the nature of the communication mechanism of concurrent constraint languages is essentially different from the classical paradigms of CCS, CSP and ACP. We define indeed a compositi... |
cs0203030 | 2952475254 | We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of paths for these packets is admissible if no link in the network is overloaded. We present the first on-line routing algorithm that finds a set ... | The problem of choosing routes for a fixed set of packets was studied by Srinivasan and Teo @cite_5 and Bertsimas and Gamarnik @cite_13 . For example, @cite_5 presents an algorithm that minimizes the congestion and dilation of the routes up to a constant factor. This result complemented the paper of Leighton, Maggs and... | {
"cite_N": [
"@cite_1",
"@cite_5",
"@cite_13"
],
"mid": [
"2084427019",
"1986061053",
""
],
"abstract": [
"In this paper, we prove that there exists a schedule for routing any set of packets with edge-simple paths, on any network, inO(c+d) steps, wherec is the congestion of the pa... |
cs0207085 | 1745858282 | In this paper we consider two points of views to the problem of coherent integration of distributed data. First we give a pure model-theoretic analysis of the possible ways to repair' a database. We do so by characterizing the possibilities to recover' consistent data from an inconsistent database in terms of those mod... | Coherent integration and proper representation of amalgamated data is extensively studied in the literature (see, e.g., @cite_40 @cite_36 @cite_2 @cite_19 @cite_27 @cite_21 @cite_37 @cite_10 @cite_12 @cite_6 @cite_33 ). Common approaches for dealing with this task are based on techniques of belief revision @cite_21 , m... | {
"cite_N": [
"@cite_37",
"@cite_18",
"@cite_33",
"@cite_36",
"@cite_21",
"@cite_6",
"@cite_24",
"@cite_19",
"@cite_40",
"@cite_27",
"@cite_23",
"@cite_2",
"@cite_34",
"@cite_10",
"@cite_12",
"@cite_17"
],
"mid": [
"2112965492",
"1551453953",... |
cs0207085 | 1745858282 | In this paper we consider two points of views to the problem of coherent integration of distributed data. First we give a pure model-theoretic analysis of the possible ways to repair' a database. We do so by characterizing the possibilities to recover' consistent data from an inconsistent database in terms of those mod... | The use of three-valued logics is also a well-known technique for maintaining incomplete or inconsistent information; such logics are often used for defining fixpoint semantics of incomplete logic programs @cite_32 @cite_3 , and so in principle they can be applied on integrity constraints in an (extended) clause form @... | {
"cite_N": [
"@cite_7",
"@cite_8",
"@cite_32",
"@cite_3",
"@cite_0",
"@cite_11"
],
"mid": [
"",
"1854613159",
"2003531456",
"1968513265",
"1785931840",
"1489867543"
],
"abstract": [
"",
"When integrating data coming from multiple different sources we ar... |
cs0207085 | 1745858282 | In this paper we consider two points of views to the problem of coherent integration of distributed data. First we give a pure model-theoretic analysis of the possible ways to repair' a database. We do so by characterizing the possibilities to recover' consistent data from an inconsistent database in terms of those mod... | A closely related topic is the problem of giving consistent query answers in inconsistent database @cite_26 @cite_15 @cite_27 . The idea is to answer database queries in a consistent way without computing the repairs of the database. | {
"cite_N": [
"@cite_27",
"@cite_15",
"@cite_26"
],
"mid": [
"",
"35390552",
"2077518845"
],
"abstract": [
"",
"This paper investigates, several methods for coping with inconsistency caused by multiple source information by introducing suitable consequence relations capable of ... |
cs0209023 | 2952481296 | This paper studies the problem of load-balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or avail... | Of the load-balancing algorithms based on load, a very common approach to performing load-balancing is to choose the server with the least reported load from among a set of servers. This approach performs well in a homogeneous system where the task allocation is performed by a single centralized entity (dispatcher) whi... | {
"cite_N": [
"@cite_35",
"@cite_47",
"@cite_28",
"@cite_46",
"@cite_13",
"@cite_25"
],
"mid": [
"1997049009",
"2155859954",
"2022049964",
"2080912525",
"345615294",
"2064823719"
],
"abstract": [
"We consider a queuing system consisting of a finite number of... |
cs0209023 | 2952481296 | This paper studies the problem of load-balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or avail... | Dahlin proposes algorithms @cite_1 . These algorithms take into account the age (staleness) of the load information reported by each of a set of distributed homogeneous servers as well as an estimate of the rate at which new requests arrive at the whole system to determine to which server to allocate a request. | {
"cite_N": [
"@cite_1"
],
"mid": [
"2109440766"
],
"abstract": [
"In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each request to the machine with the apparent lowest load ca... |
cs0209023 | 2952481296 | This paper studies the problem of load-balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or avail... | @cite_16 propose an algorithm, which we call that first randomly selects @math servers. The algorithm then weighs the servers by load information and chooses a server with probability that is inversely proportional to the load reported by that server. When @math , where @math is the total number of servers, the algorit... | {
"cite_N": [
"@cite_16"
],
"mid": [
"2152558834"
],
"abstract": [
"URL, or layer-5, switches can be used to implement locally and globally distributed Web sites. URL switches must be able to exploit knowledge of server load and content (e.g., of reverse caches). Implementing globally distributed ... |
cs0209023 | 2952481296 | This paper studies the problem of load-balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or avail... | Another approach is to to exclude servers that fail some utilization threshold and to choose from the remaining servers. @cite_6 and @cite_47 classify machines as lightly-utilized or heavily-utilized and then choose randomly from the lightly-utilized servers. This work focuses on local-area distributed systems. use thi... | {
"cite_N": [
"@cite_47",
"@cite_6",
"@cite_2"
],
"mid": [
"2155859954",
"2080634500",
"1747723070"
],
"abstract": [
"The problem of judiciously and transparently redistributing the load of the system among its nodes so that overall performance is maximized is discussed. Several ke... |
cs0209023 | 2952481296 | This paper studies the problem of load-balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or avail... | Another well-studied load-balancing cluster approach is to have heavily loaded servers handoff requests they receive to other servers within the cluster that are less loaded or to have lightly loaded servers attempt to get tasks from heavily loaded servers (e.g., @cite_9 @cite_10 ). This can be achieved through techniq... | {
"cite_N": [
"@cite_36",
"@cite_9",
"@cite_32",
"@cite_24",
"@cite_43",
"@cite_31",
"@cite_10"
],
"mid": [
"2151744612",
"2149912409",
"2159285576",
"2143649597",
"",
"",
"2115939782"
],
"abstract": [
"Users of highly popular Web sites may experienc... |
cs0209023 | 2952481296 | This paper studies the problem of load-balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or avail... | A lot of work has looked at balancing load across multi-server homogeneous web sites by leveraging the DNS service used to provide the mapping between a web page's URL and the IP address of a web server serving the URL. Round-robin DNS was proposed, where the DNS system maps requests to web servers in a round-robin fas... | {
"cite_N": [
"@cite_14",
"@cite_22",
"@cite_34"
],
"mid": [
"",
"2037842078",
"2138403394"
],
"abstract": [
"",
"Abstract While the World Wide Web (www) may appear to be intrinsically scalable through the distribution of files across a series of decentralized servers, there ar... |
cs0209023 | 2952481296 | This paper studies the problem of load-balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or avail... | later extend this work to balance load across a set of widely distributed heterogeneous web servers @cite_2 . This work proposes the use of adaptive TTLs, where the TTL for a DNS mapping is set inversely proportional to the domain's local client request rate for the mapping of interest (as reported by the domain's loca... | {
"cite_N": [
"@cite_2"
],
"mid": [
"1747723070"
],
"abstract": [
"With ever increasing Web traffic, a distributed multi server Web site can provide scalability and flexibility to cope with growing client demands. Load balancing algorithms to spread the requests across multiple Web servers are cru... |
cs0209023 | 2952481296 | This paper studies the problem of load-balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information about load or avail... | Lottery scheduling is another technique that, like Max-Cap, uses proportional allocation. This approach has been proposed in the context of resource allocation within an operating system (the Mach microkernel) @cite_23 . Client processes hold tickets that give them access to particular resources in the operating system... | {
"cite_N": [
"@cite_23"
],
"mid": [
"2111087562"
],
"abstract": [
"This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations. Such control is beyond the capa... |
cs0507024 | 1892314125 | This paper presents some experiments in clustering homogeneous XML documents to validate an existing classification or more generally an organisational structure. Our approach integrates techniques for extracting knowledge from docu- ments with unsupervised classification (clustering) of documents. We focus on the feat... | Currently research in classification and clustering methods for XML or semi-structured documents is very active. New document models have been proposed by ( @cite_1 , @cite_7 ) to extend the classical vector model and take into account both the structure and the textual part. It amounts to distinguish words appearing i... | {
"cite_N": [
"@cite_1",
"@cite_7"
],
"mid": [
"2134222424",
"1970881376"
],
"abstract": [
"In this paper, w edescribe a novel text classi er that can e ectiv ely cope with structured documents. We report experiments that compare its performance with that of a wellknown probabilistic class... |
cs0507024 | 1892314125 | This paper presents some experiments in clustering homogeneous XML documents to validate an existing classification or more generally an organisational structure. Our approach integrates techniques for extracting knowledge from docu- ments with unsupervised classification (clustering) of documents. We focus on the feat... | XML document clustering has been used mostly for visualizing large collections of documents, for example @cite_2 cluster AML (Astronomical Markup Language) documents based only on their links. @cite_3 propose a model similar to @cite_1 but adding in- and out-links to the model, and they use it for clustering rather tha... | {
"cite_N": [
"@cite_4",
"@cite_1",
"@cite_3",
"@cite_2"
],
"mid": [
"3603",
"2134222424",
"1575842006",
"2084370216"
],
"abstract": [
"In this paper, we describe a new bitmap indexing technique to cluster XML documents. XML is a new standard for exchanging and representing... |
cs0507024 | 1892314125 | This paper presents some experiments in clustering homogeneous XML documents to validate an existing classification or more generally an organisational structure. Our approach integrates techniques for extracting knowledge from docu- ments with unsupervised classification (clustering) of documents. We focus on the feat... | Another direction is clustering Web documents returned as answers to a query, an alternative to rank lists. @cite_11 propose an original algorithm using a suffix tree structure, that is linear in the size of the collection and incremental, an important feature to support online clustering. | {
"cite_N": [
"@cite_11"
],
"mid": [
"2100958137"
],
"abstract": [
"Users of Web search engines are often forced to sift through the long ordered list of document \"snippets\" returned by the engines. The IR community has explored document clustering as an alternative method of organizing retrieva... |
cs0507024 | 1892314125 | This paper presents some experiments in clustering homogeneous XML documents to validate an existing classification or more generally an organisational structure. Our approach integrates techniques for extracting knowledge from docu- ments with unsupervised classification (clustering) of documents. We focus on the feat... | @cite_5 compare different text feature extractions, and variants of a linear-time clustering algorithm using random seed selection with center adjustment. | {
"cite_N": [
"@cite_5"
],
"mid": [
"2070412788"
],
"abstract": [
"Clustering is a powerful technique for large-scale topic discovery from text. It involves two phases: first, feature extraction maps each document or record to a point in high-dimensional space, then clustering algorithms automatic... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | For routing on a circle, the best-known constructions have @math and @math . Examples include: Chord @cite_15 with distance-function @math , a variant of Chord with bidirectional links'' @cite_4 and distance-function @math , and the hypercube with distance function @math . In this paper, we improve upon all of these co... | {
"cite_N": [
"@cite_15",
"@cite_4"
],
"mid": [
"2118428193",
"2070219632"
],
"abstract": [
"A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that a... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | routing with distance function @math has been studied for Chord @cite_4 , a popular topology for P2P networks. Chord has @math nodes, with out-degree @math per node. The longest route takes @math hops. In terms of @math and @math , the largest-sized Chord network has @math nodes. Moreover, @math and @math cannot be cho... | {
"cite_N": [
"@cite_4"
],
"mid": [
"2070219632"
],
"abstract": [
"We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with edges connecting pairs of nodes that are 2k positions... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | Xu al @cite_16 provide a partial answer to the above question by studying routing with distance function @math over graph topologies. A graph over @math nodes placed in a circle is said to be uniform if the set of clockwise offsets of out-going links is identical for all nodes. Chord is an example of a uniform graph. X... | {
"cite_N": [
"@cite_16"
],
"mid": [
"2031684765"
],
"abstract": [
"We study a fundamental tradeoff issue in designing a distributed hash table (DHT) in peer-to-peer (P2P) networks: the size of the routing table versus the network diameter. Observing that existing DHT schemes have either 1) a rout... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | Cordasco al @cite_19 extend the result of Xu al @cite_16 by showing that routing with distance function @math in a uniform graph over @math nodes satisfies the inequality @math , where @math denotes the out-degree of each node, @math is the length of the longest path, and @math denotes the @math Fibonacci number. It is... | {
"cite_N": [
"@cite_19",
"@cite_16"
],
"mid": [
"1599788664",
"2031684765"
],
"abstract": [
"We propose a family of novel schemes based on Chord retaining all positive aspects that made Chord a popular topology for routing in P2P networks. The schemes, based on the Fibonacci number system... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | The results in @cite_4 @cite_16 @cite_19 leave open the question whether there exists any graph construction that permits routes of length @math with distance function @math and or @math . provides an answer to the problem by constructing a non-uniform graph --- the set of clockwise offsets of out-going links is differ... | {
"cite_N": [
"@cite_19",
"@cite_16",
"@cite_4"
],
"mid": [
"1599788664",
"2031684765",
"2070219632"
],
"abstract": [
"We propose a family of novel schemes based on Chord retaining all positive aspects that made Chord a popular topology for routing in P2P networks. The schemes, bas... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | Kleinberg's construction has found applications in the design of overlay routing networks for Distributed Hash Tables. Symphony @cite_13 is an adaptation of Kleinberg's construction in a single dimension. The idea is to place @math nodes in a virtual circle and to equip each node with @math out-going links. In the resu... | {
"cite_N": [
"@cite_18",
"@cite_13"
],
"mid": [
"1992467531",
"1564854496"
],
"abstract": [
"We consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing approaches to this pr... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | Papillon outperforms all of the above randomized constructions, using degree @math and achieving @math routing. It should be possible to randomize Papillon along similar principles to the Viceroy @cite_14 randomized construction of the butterfly network, though we do not pursue this direction here. | {
"cite_N": [
"@cite_14"
],
"mid": [
"1970564778"
],
"abstract": [
"We propose a family of constant-degree routing networks of logarithmic diameter, with the additional property that the addition or removal of a node to the network requires no global coordination, only a constant number of linkage... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | With @math out-going links per node, several graphs over @math nodes in a circle support routes with @math greedy hops. Deterministic graphs with this property include: (a) the original Chord @cite_15 topology with distance function @math , (b) Chord with edges treated as bidirectional @cite_4 with distance function @m... | {
"cite_N": [
"@cite_18",
"@cite_4",
"@cite_22",
"@cite_2",
"@cite_15",
"@cite_16",
"@cite_13"
],
"mid": [
"1992467531",
"2070219632",
"2049794981",
"2096706512",
"2118428193",
"2031684765",
"1564854496"
],
"abstract": [
"We consider the problem of d... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | The construction demonstrates that we can indeed design networks in which greedy routing along these metrics has asymptotically optimal routing complexity. Our contribution is a family of networks that extends the Butterfly network family, so as to facilitate efficient greedy routing. With @math links per node, greedy ... | {
"cite_N": [
"@cite_18"
],
"mid": [
"1992467531"
],
"abstract": [
"We consider the problem of designing an overlay network and routing mechanism that permits finding resources efficiently in a peer-to-peer system. We argue that many existing approaches to this problem can be modeled as the constr... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | Recent work @cite_9 explores the surprising advantages of with in randomized graphs over @math nodes in a circle. The idea behind is to take neighbor's neighbors into account to make routing decisions. It shows that greedy with achieves @math expected route length in Symphony @cite_13 . For other networks which have @m... | {
"cite_N": [
"@cite_22",
"@cite_8",
"@cite_9",
"@cite_2",
"@cite_13",
"@cite_20"
],
"mid": [
"2049794981",
"1492552531",
"2160405192",
"2096706512",
"1564854496",
""
],
"abstract": [
"Distributed hash table (DHT) systems are an important class of peer-to-pe... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | demonstrates that it is possible to construct a graph in which each node has degree @math and in which 1- has routes of length @math in the worst case, for the metrics @math , @math and @math . Furthermore, for all @math , plain greedy on our network design beats even the results obtained in @cite_9 with @math - lookah... | {
"cite_N": [
"@cite_9"
],
"mid": [
"2160405192"
],
"abstract": [
"Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e. g., randomized hypercubes, randomized Chord, skip-graphs and constructions based upon small-world percolation network... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | Deterministic butterflies have been proposed for DHT routing by Xu al @cite_16 , who subsequently developed their ideas into Ulysses @cite_6 . for distance function @math has structural similarities with Ulysses -- both are butterfly-based networks. The key differences are as follows: (a) Ulysses does not use @math as ... | {
"cite_N": [
"@cite_16",
"@cite_6"
],
"mid": [
"2031684765",
"2049130980"
],
"abstract": [
"We study a fundamental tradeoff issue in designing a distributed hash table (DHT) in peer-to-peer (P2P) networks: the size of the routing table versus the network diameter. Observing that existing ... |
cs0507034 | 2952461782 | We study greedy routing over @math nodes placed in a ring, with the between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over @math... | Viceroy @cite_14 is a butterfly network which routes in @math hops in expectation with @math links per node. Mariposa (see reference @cite_23 or @cite_21 ) improves upon Viceroy by providing routes of length @math in the worst-case, with @math out-going links per node. Viceroy and Mariposa are different from other rand... | {
"cite_N": [
"@cite_14",
"@cite_21",
"@cite_23"
],
"mid": [
"1970564778",
"2142418251",
"69178526"
],
"abstract": [
"We propose a family of constant-degree routing networks of logarithmic diameter, with the additional property that the addition or removal of a node to the network ... |
0706.0580 | 1672346542 | Resources in a cloud can be identified using identifiers based on random numbers. When using a distributed hash table to resolve such identifiers to network locations, the straightforward approach is to store the network location directly in the hash table entry associated with an identifier. When a mobile host contain... | Ballintijn al argue that resource naming should be decoupled from resource identification @cite_7 . Resources are named with human-friendly names, which are based on DNS @cite_9 , while identification is done with object handles, which are globally unique identifiers that need not contain network locations. They use DN... | {
"cite_N": [
"@cite_9",
"@cite_7"
],
"mid": [
"2122269925",
"2096392987"
],
"abstract": [
"The Domain Name System (DNS) provides name service for the DARPA Internet. It is one of the largest name services in operation today, serves a highly diverse community of hosts, users, and networks,... |
0706.0580 | 1672346542 | Resources in a cloud can be identified using identifiers based on random numbers. When using a distributed hash table to resolve such identifiers to network locations, the straightforward approach is to store the network location directly in the hash table entry associated with an identifier. When a mobile host contain... | Walfish al argue for the use of semantic-free references for identifying web documents instead of URLs @cite_8 . The reason is that changes in naming policies or ownership of DNS domain names often result in previous URLs pointing to unrelated or non-existent documents, even when the original documents still exist. Sem... | {
"cite_N": [
"@cite_13",
"@cite_8"
],
"mid": [
"2118428193",
"144112633"
],
"abstract": [
"A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that ad... |
0706.0580 | 1672346542 | Resources in a cloud can be identified using identifiers based on random numbers. When using a distributed hash table to resolve such identifiers to network locations, the straightforward approach is to store the network location directly in the hash table entry associated with an identifier. When a mobile host contain... | Distributed hash tables, also called peer-to-peer structured overlay networks, are distributed systems which map a uniform distribution of identifiers to nodes in the system @cite_3 @cite_13 @cite_20 . Nodes act as peers, with no node having to play a special role, and a distributed hash table can continue operation ev... | {
"cite_N": [
"@cite_3",
"@cite_5",
"@cite_13",
"@cite_12",
"@cite_20"
],
"mid": [
"2160279333",
"2162733677",
"2118428193",
"2143339817",
"2123482462"
],
"abstract": [
"Distributed computer architectures labeled \"peer-to-peer\" are designed for the sharing of comp... |
0706.0580 | 1672346542 | Resources in a cloud can be identified using identifiers based on random numbers. When using a distributed hash table to resolve such identifiers to network locations, the straightforward approach is to store the network location directly in the hash table entry associated with an identifier. When a mobile host contain... | There has also been research on implementing distributed hash tables on top of mobile ad hoc networks @cite_4 @cite_6 . As with Mobile IP @cite_15 and HIP @cite_1 , hosts in mobile ad hoc networks do not change their network address with movement, so there would be no need to update entries in a distributed hash table ... | {
"cite_N": [
"@cite_1",
"@cite_15",
"@cite_4",
"@cite_6"
],
"mid": [
"",
"32990903",
"2123181643",
"2151682391"
],
"abstract": [
"",
"A test device using the \"four square\" principal of testing specimens which permits input of dynamic torque changes and being arranged... |
0706.0430 | 2950884312 | As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network topologies where mixes are placed on the nodes of an unstructured network, such as social networks and scale-free random networks. We explore the effi... | Borisov @cite_11 analyzes anonymous communications over a De Bruijn graph topology overlay network. He analyzes the deBruijn graph topology and comments on their successful mixing capabilities. | {
"cite_N": [
"@cite_11"
],
"mid": [
"2163598416"
],
"abstract": [
"As more of our daily activities are carried out online, it becomes important to develop technologies to protect our online privacy. Anonymity is a key privacy technology, since it serves to hide patterns of communication that can ... |
0706.0523 | 2069748505 | In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software model checkers typically use a weak approximation of the image. This can result in a failure to prove a property, even given an adequate set of ... | The chief alternative to iterative approximation is to produce an exact propositional characterization of the abstract transition relation. For example the method of @cite_3 uses small-domain techniques to translate a first-order transition formula into a propositional one that is equisatisfiable over the state-holding... | {
"cite_N": [
"@cite_3"
],
"mid": [
"1601517679"
],
"abstract": [
"Predicate abstraction is a useful form of abstraction for the verification of transition systems with large or infinite state spaces. One of the main bottlenecks of this approach is the extremely large number of decision procedures... |
0706.0523 | 2069748505 | In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software model checkers typically use a weak approximation of the image. This can result in a failure to prove a property, even given an adequate set of ... | The most closely related method is that of Das and Dill @cite_7 . This method analyzes abstract counterexamples (sequences of predicate states), refining the transition relation approximation in such a way as to rule out infeasible transitions. This method is effective, but has the disadvantage that it uses a specific ... | {
"cite_N": [
"@cite_7"
],
"mid": [
"2134147303"
],
"abstract": [
"Recently, we have improved the efficiency of the predicate abstraction scheme presented by Das, Dill and Park (1999). As a result, the number of validity checks needed to prove the necessary verification condition has been reduced.... |
0706.0523 | 2069748505 | In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, software model checkers typically use a weak approximation of the image. This can result in a failure to prove a property, even given an adequate set of ... | @cite_8 , interpolants are used to choose new predicates to refine a predicate abstraction. Here, we use interpolants to refine an approximation of the abstract transition relation for a given set of predicates. | {
"cite_N": [
"@cite_8"
],
"mid": [
"2151463894"
],
"abstract": [
"The success of model checking for large programs depends crucially on the ability to efficiently construct parsimonious abstractions. A predicate abstraction is parsimonious if at each control location, it specifies only relationsh... |
0706.2434 | 2143252188 | In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson cluster process on the plane. We derive the distributional properties of the interference and pr... | There exists a significant body of literature for networks with Poisson distributed nodes. In @cite_6 the characteristic function of the interference was obtained when there is no fading and the nodes are Poisson distributed. They also provide the probability distribution function of the interference as an infinite ser... | {
"cite_N": [
"@cite_6",
"@cite_2"
],
"mid": [
"2171882038",
"2042164227"
],
"abstract": [
"The authors obtain the optimum transmission ranges to maximize throughput for a direct-sequence spread-spectrum multihop packet radio network. In the analysis, they model the network self-interferen... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.