corpus_id
stringlengths 7
12
| paper_id
stringlengths 9
16
| title
stringlengths 1
261
| abstract
stringlengths 70
4.02k
| source
stringclasses 1
value | bibtex
stringlengths 208
20.9k
| citation_key
stringlengths 6
100
|
|---|---|---|---|---|---|---|
arxiv-676001 | cs/9712101 | When Gravity Fails: Local Search Topology | <|reference_start|>When Gravity Fails: Local Search Topology: Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called plateau moves, dominate the time spent in local search. We analyze and characterize plateaus for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e., global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.<|reference_end|> | arxiv | @article{frank1997when,
title={When Gravity Fails: Local Search Topology},
author={J. Frank, P. Cheeseman, J. Stutz},
journal={Journal of Artificial Intelligence Research, Vol 7, (1997),
249-281},
year={1997},
archivePrefix={arXiv},
eprint={cs/9712101},
primaryClass={cs.AI}
} | frank1997when |
arxiv-676002 | cs/9712102 | Bidirectional Heuristic Search Reconsidered | <|reference_start|>Bidirectional Heuristic Search Reconsidered: The assessment of bidirectional heuristic search has been incorrect since it was first published more than a quarter of a century ago. For quite a long time, this search strategy did not achieve the expected results, and there was a major misunderstanding about the reasons behind it. Although there is still wide-spread belief that bidirectional heuristic search is afflicted by the problem of search frontiers passing each other, we demonstrate that this conjecture is wrong. Based on this finding, we present both a new generic approach to bidirectional heuristic search and a new approach to dynamically improving heuristic values that is feasible in bidirectional search only. These approaches are put into perspective with both the traditional and more recently proposed approaches in order to facilitate a better overall understanding. Empirical results of experiments with our new approaches show that bidirectional heuristic search can be performed very efficiently and also with limited memory. These results suggest that bidirectional heuristic search appears to be better for solving certain difficult problems than corresponding unidirectional search. This provides some evidence for the usefulness of a search strategy that was long neglected. In summary, we show that bidirectional heuristic search is viable and consequently propose that it be reconsidered.<|reference_end|> | arxiv | @article{kaindl1997bidirectional,
title={Bidirectional Heuristic Search Reconsidered},
author={H. Kaindl, G. Kainz},
journal={Journal of Artificial Intelligence Research, Vol 7, (1997),
283-317},
year={1997},
archivePrefix={arXiv},
eprint={cs/9712102},
primaryClass={cs.AI}
} | kaindl1997bidirectional |
arxiv-676003 | cs/9801101 | Incremental Recompilation of Knowledge | <|reference_start|>Incremental Recompilation of Knowledge: Approximating a general formula from above and below by Horn formulas (its Horn envelope and Horn core, respectively) was proposed by Selman and Kautz (1991, 1996) as a form of ``knowledge compilation,'' supporting rapid approximate reasoning; on the negative side, this scheme is static in that it supports no updates, and has certain complexity drawbacks pointed out by Kavvadias, Papadimitriou and Sideri (1993). On the other hand, the many frameworks and schemes proposed in the literature for theory update and revision are plagued by serious complexity-theoretic impediments, even in the Horn case, as was pointed out by Eiter and Gottlob (1992), and is further demonstrated in the present paper. More fundamentally, these schemes are not inductive, in that they may lose in a single update any positive properties of the represented sets of formulas (small size, Horn structure, etc.). In this paper we propose a new scheme, incremental recompilation, which combines Horn approximation and model-based updates; this scheme is inductive and very efficient, free of the problems facing its constituents. A set of formulas is represented by an upper and lower Horn approximation. To update, we replace the upper Horn formula by the Horn envelope of its minimum-change update, and similarly the lower one by the Horn core of its update; the key fact which enables this scheme is that Horn envelopes and cores are easy to compute when the underlying formula is the result of a minimum-change update of a Horn formula by a clause. We conjecture that efficient algorithms are possible for more complex updates.<|reference_end|> | arxiv | @article{gogic1998incremental,
title={Incremental Recompilation of Knowledge},
author={G. Gogic, C. H. Papadimitriou, M. Sideri},
journal={Journal of Artificial Intelligence Research, Vol 8, (1998), 23-37},
year={1998},
archivePrefix={arXiv},
eprint={cs/9801101},
primaryClass={cs.AI}
} | gogic1998incremental |
arxiv-676004 | cs/9801102 | Monotonicity and Persistence in Preferential Logics | <|reference_start|>Monotonicity and Persistence in Preferential Logics: An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be safely added to the premises without destroying any of the consequences: we say they respect monotonicity. Also, there may be formulae that, when they are a consequence, can not be invalidated when adding any formula to the premises: we call them conservative. We study these two classes of formulae for preferential logics, and show that they are closely linked to the formulae whose truth-value is preserved along the (preferential) ordering. We will consider some preferential logics for illustration, and prove syntactic characterization results for them. The results in this paper may improve the efficiency of theorem provers for preferential logics.<|reference_end|> | arxiv | @article{engelfriet1998monotonicity,
title={Monotonicity and Persistence in Preferential Logics},
author={J. Engelfriet},
journal={Journal of Artificial Intelligence Research, Vol 8, (1998), 1-21},
year={1998},
archivePrefix={arXiv},
eprint={cs/9801102},
primaryClass={cs.AI}
} | engelfriet1998monotonicity |
arxiv-676005 | cs/9801103 | Linear probing and graphs | <|reference_start|>Linear probing and graphs: Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connected graphs in 1977, and Kreweras related the inversions of trees to the so-called ``parking problem'' in 1980. A~combination of these three results leads to a surprisingly simple analysis of the behavior of hashing by linear probing, including higher moments of the cost of successful search.<|reference_end|> | arxiv | @article{knuth1998linear,
title={Linear probing and graphs},
author={Donald E. Knuth},
journal={Algorithmica 22 (1998), no. 4, 561--568},
year={1998},
number={Knuth migration 11/2004},
archivePrefix={arXiv},
eprint={cs/9801103},
primaryClass={cs.DS}
} | knuth1998linear |
arxiv-676006 | cs/9803101 | Synthesizing Customized Planners from Specifications | <|reference_start|>Synthesizing Customized Planners from Specifications: Existing plan synthesis approaches in artificial intelligence fall into two categories -- domain independent and domain dependent. The domain independent approaches are applicable across a variety of domains, but may not be very efficient in any one given domain. The domain dependent approaches need to be (re)designed for each domain separately, but can be very efficient in the domain for which they are designed. One enticing alternative to these approaches is to automatically synthesize domain independent planners given the knowledge about the domain and the theory of planning. In this paper, we investigate the feasibility of using existing automated software synthesis tools to support such synthesis. Specifically, we describe an architecture called CLAY in which the Kestrel Interactive Development System (KIDS) is used to derive a domain-customized planner through a semi-automatic combination of a declarative theory of planning, and the declarative control knowledge specific to a given domain, to semi-automatically combine them to derive domain-customized planners. We discuss what it means to write a declarative theory of planning and control knowledge for KIDS, and illustrate our approach by generating a class of domain-specific planners using state space refinements. Our experiments show that the synthesized planners can outperform classical refinement planners (implemented as instantiations of UCP, Kambhampati & Srivastava, 1995), using the same control knowledge. We will contrast the costs and benefits of the synthesis approach with conventional methods for customizing domain independent planners.<|reference_end|> | arxiv | @article{srivastava1998synthesizing,
title={Synthesizing Customized Planners from Specifications},
author={B. Srivastava, S. Kambhampati},
journal={Journal of Artificial Intelligence Research, Vol 8, (1998), 93-128},
year={1998},
archivePrefix={arXiv},
eprint={cs/9803101},
primaryClass={cs.AI}
} | srivastava1998synthesizing |
arxiv-676007 | cs/9803102 | Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets | <|reference_start|>Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets: This paper introduces new algorithms and data structures for quick counting for machine learning datasets. We focus on the counting task of constructing contingency tables, but our approach is also applicable to counting the number of records in a dataset that match conjunctive queries. Subject to certain assumptions, the costs of these operations can be shown to be independent of the number of records in the dataset and loglinear in the number of non-zero entries in the contingency table. We provide a very sparse data structure, the ADtree, to minimize memory use. We provide analytical worst-case bounds for this structure for several models of data distribution. We empirically demonstrate that tractably-sized data structures can be produced for large real-world datasets by (a) using a sparse tree structure that never allocates memory for counts of zero, (b) never allocating memory for counts that can be deduced from other counts, and (c) not bothering to expand the tree fully near its leaves. We show how the ADtree can be used to accelerate Bayes net structure finding algorithms, rule learning algorithms, and feature selection algorithms, and we provide a number of empirical results comparing ADtree methods against traditional direct counting approaches. We also discuss the possible uses of ADtrees in other machine learning methods, and discuss the merits of ADtrees in comparison with alternative representations such as kd-trees, R-trees and Frequent Sets.<|reference_end|> | arxiv | @article{moore1998cached,
title={Cached Sufficient Statistics for Efficient Machine Learning with Large
Datasets},
author={A. Moore, M. S. Lee},
journal={Journal of Artificial Intelligence Research, Vol 8, (1998), 67-91},
year={1998},
archivePrefix={arXiv},
eprint={cs/9803102},
primaryClass={cs.AI}
} | moore1998cached |
arxiv-676008 | cs/9803103 | Tractability of Theory Patching | <|reference_start|>Tractability of Theory Patching: In this paper we consider the problem of `theory patching', in which we are given a domain theory, some of whose components are indicated to be possibly flawed, and a set of labeled training examples for the domain concept. The theory patching problem is to revise only the indicated components of the theory, such that the resulting theory correctly classifies all the training examples. Theory patching is thus a type of theory revision in which revisions are made to individual components of the theory. Our concern in this paper is to determine for which classes of logical domain theories the theory patching problem is tractable. We consider both propositional and first-order domain theories, and show that the theory patching problem is equivalent to that of determining what information contained in a theory is `stable' regardless of what revisions might be performed to the theory. We show that determining stability is tractable if the input theory satisfies two conditions: that revisions to each theory component have monotonic effects on the classification of examples, and that theory components act independently in the classification of examples in the theory. We also show how the concepts introduced can be used to determine the soundness and completeness of particular theory patching algorithms.<|reference_end|> | arxiv | @article{argamon-engelson1998tractability,
title={Tractability of Theory Patching},
author={S. Argamon-Engelson, M. Koppel},
journal={Journal of Artificial Intelligence Research, Vol 8, (1998), 39-65},
year={1998},
archivePrefix={arXiv},
eprint={cs/9803103},
primaryClass={cs.AI}
} | argamon-engelson1998tractability |
arxiv-676009 | cs/9805101 | Integrative Windowing | <|reference_start|>Integrative Windowing: In this paper we re-investigate windowing for rule learning algorithms. We show that, contrary to previous results for decision tree learning, windowing can in fact achieve significant run-time gains in noise-free domains and explain the different behavior of rule learning algorithms by the fact that they learn each rule independently. The main contribution of this paper is integrative windowing, a new type of algorithm that further exploits this property by integrating good rules into the final theory right after they have been discovered. Thus it avoids re-learning these rules in subsequent iterations of the windowing process. Experimental evidence in a variety of noise-free domains shows that integrative windowing can in fact achieve substantial run-time gains. Furthermore, we discuss the problem of noise in windowing and present an algorithm that is able to achieve run-time gains in a set of experiments in a simple domain with artificial noise.<|reference_end|> | arxiv | @article{fürnkranz1998integrative,
title={Integrative Windowing},
author={J. F"urnkranz},
journal={Journal of Artificial Intelligence Research, Vol 8, (1998),
129-164},
year={1998},
doi={10.1613/jair.487},
archivePrefix={arXiv},
eprint={cs/9805101},
primaryClass={cs.AI}
} | fürnkranz1998integrative |
arxiv-676010 | cs/9806101 | Model-Based Diagnosis using Structured System Descriptions | <|reference_start|>Model-Based Diagnosis using Structured System Descriptions: This paper presents a comprehensive approach for model-based diagnosis which includes proposals for characterizing and computing preferred diagnoses, assuming that the system description is augmented with a system structure (a directed graph explicating the interconnections between system components). Specifically, we first introduce the notion of a consequence, which is a syntactically unconstrained propositional sentence that characterizes all consistency-based diagnoses and show that standard characterizations of diagnoses, such as minimal conflicts, correspond to syntactic variations on a consequence. Second, we propose a new syntactic variation on the consequence known as negation normal form (NNF) and discuss its merits compared to standard variations. Third, we introduce a basic algorithm for computing consequences in NNF given a structured system description. We show that if the system structure does not contain cycles, then there is always a linear-size consequence in NNF which can be computed in linear time. For arbitrary system structures, we show a precise connection between the complexity of computing consequences and the topology of the underlying system structure. Finally, we present an algorithm that enumerates the preferred diagnoses characterized by a consequence. The algorithm is shown to take linear time in the size of the consequence if the preference criterion satisfies some general conditions.<|reference_end|> | arxiv | @article{darwiche1998model-based,
title={Model-Based Diagnosis using Structured System Descriptions},
author={A. Darwiche},
journal={Journal of Artificial Intelligence Research, Vol 8, (1998),
165-222},
year={1998},
archivePrefix={arXiv},
eprint={cs/9806101},
primaryClass={cs.AI}
} | darwiche1998model-based |
arxiv-676011 | cs/9806102 | A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle | <|reference_start|>A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle: One of the most common mechanisms used for speeding up problem solvers is macro-learning. Macros are sequences of basic operators acquired during problem solving. Macros are used by the problem solver as if they were basic operators. The major problem that macro-learning presents is the vast number of macros that are available for acquisition. Macros increase the branching factor of the search space and can severely degrade problem-solving efficiency. To make macro learning useful, a program must be selective in acquiring and utilizing macros. This paper describes a general method for selective acquisition of macros. Solvable training problems are generated in increasing order of difficulty. The only macros acquired are those that take the problem solver out of a local minimum to a better state. The utility of the method is demonstrated in several domains, including the domain of NxN sliding-tile puzzles. After learning on small puzzles, the system is able to efficiently solve puzzles of any size.<|reference_end|> | arxiv | @article{finkelstein1998a,
title={A Selective Macro-learning Algorithm and its Application to the NxN
Sliding-Tile Puzzle},
author={L. Finkelstein, S. Markovitch},
journal={Journal of Artificial Intelligence Research, Vol 8, (1998),
223-263},
year={1998},
archivePrefix={arXiv},
eprint={cs/9806102},
primaryClass={cs.AI}
} | finkelstein1998a |
arxiv-676012 | cs/9808001 | Chess Pure Strategies are Probably Chaotic | <|reference_start|>Chess Pure Strategies are Probably Chaotic: It is odd that chess grandmasters often disagree in their analysis of positions, sometimes even of simple ones, and that a grandmaster can hold his own against an powerful analytic machine such as Deep Blue. The fact that there must exist pure winning strategies for chess is used to construct a control strategy function. It is then shown that chess strategy is equivalent to an autonomous system of differential equations, and conjectured that the system is chaotic. If true the conjecture would explain the forenamed peculiarities and would also imply that there cannot exist a static evaluator for chess.<|reference_end|> | arxiv | @article{chaves1998chess,
title={Chess Pure Strategies are Probably Chaotic},
author={M. Chaves},
journal={arXiv preprint arXiv:cs/9808001},
year={1998},
archivePrefix={arXiv},
eprint={cs/9808001},
primaryClass={cs.CC cs.AI}
} | chaves1998chess |
arxiv-676013 | cs/9808002 | Downward Collapse from a Weaker Hypothesis | <|reference_start|>Downward Collapse from a Weaker Hypothesis: Hemaspaandra et al. proved that, for $m > 0$ and $0 < i < k - 1$: if $\Sigma_i^p \BoldfaceDelta DIFF_m(\Sigma_k^p)$ is closed under complementation, then $DIFF_m(\Sigma_k^p) = coDIFF_m(\Sigma_k^p)$. This sharply asymmetric result fails to apply to the case in which the hypothesis is weakened by allowing the $\Sigma_i^p$ to be replaced by any class in its difference hierarchy. We so extend the result by proving that, for $s,m > 0$ and $0 < i < k - 1$: if $DIFF_s(\Sigma_i^p) \BoldfaceDelta DIFF_m(\Sigma_k^p)$ is closed under complementation, then $DIFF_m(\Sigma_k^p) = coDIFF_m(\Sigma_k^p)$.<|reference_end|> | arxiv | @article{hemaspaandra1998downward,
title={Downward Collapse from a Weaker Hypothesis},
author={Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel},
journal={arXiv preprint arXiv:cs/9808002},
year={1998},
number={see UR-CS-TR-98-681},
archivePrefix={arXiv},
eprint={cs/9808002},
primaryClass={cs.CC}
} | hemaspaandra1998downward |
arxiv-676014 | cs/9808003 | Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function | <|reference_start|>Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function: Rabi and Sherman [RS97] presented novel digital signature and unauthenticated secret-key agreement protocols, developed by themselves and by Rivest and Sherman. These protocols use ``strong,'' total, commutative (in the case of multi-party secret-key agreement), associative one-way functions as their key building blocks. Though Rabi and Sherman did prove that associative one-way functions exist if $\p \neq \np$, they left as an open question whether any natural complexity-theoretic assumption is sufficient to ensure the existence of ``strong,'' total, commutative, associative one-way functions. In this paper, we prove that if $\p \neq \np$ then ``strong,'' total, commutative, associative one-way functions exist.<|reference_end|> | arxiv | @article{hemaspaandra1998creating,
title={Creating Strong Total Commutative Associative Complexity-Theoretic
One-Way Functions from Any Complexity-Theoretic One-Way Function},
author={Lane A. Hemaspaandra and Joerg Rothe},
journal={arXiv preprint arXiv:cs/9808003},
year={1998},
number={see UR-CS-TR-98-688},
archivePrefix={arXiv},
eprint={cs/9808003},
primaryClass={cs.CC cs.CR}
} | hemaspaandra1998creating |
arxiv-676015 | cs/9808004 | Differentiated End-to-End Internet Services using a Weighted Proportional Fair Sharing TCP | <|reference_start|>Differentiated End-to-End Internet Services using a Weighted Proportional Fair Sharing TCP: In this document we study the application of weighted proportional fairness to data flows in the Internet. We let the users set the weights of their connections in order to maximise the utility they get from the network. When combined with a pricing scheme where connections are billed by weight and time, such a system is known to maximise the total utility of the network. Our study case is a national Web cache server connected to long distance links. We propose two ways of weighting TCP connections by manipulating some parameters of the protocol and present results from simulations and prototypes. We finally discuss how proportional fairness could be used to implement an Internet with differentiated services.<|reference_end|> | arxiv | @article{crowcroft1998differentiated,
title={Differentiated End-to-End Internet Services using a Weighted
Proportional Fair Sharing TCP},
author={Jon Crowcroft and Philippe Oechslin},
journal={arXiv preprint arXiv:cs/9808004},
year={1998},
archivePrefix={arXiv},
eprint={cs/9808004},
primaryClass={cs.NI cs.PF}
} | crowcroft1998differentiated |
arxiv-676016 | cs/9808005 | First-Order Conditional Logic Revisited | <|reference_start|>First-Order Conditional Logic Revisited: Conditional logics play an important role in recent attempts to formulate theories of default reasoning. This paper investigates first-order conditional logic. We show that, as for first-order probabilistic logic, it is important not to confound statistical conditionals over the domain (such as ``most birds fly''), and subjective conditionals over possible worlds (such as ``I believe that Tweety is unlikely to fly''). We then address the issue of ascribing semantics to first-order conditional logic. As in the propositional case, there are many possible semantics. To study the problem in a coherent way, we use plausibility structures. These provide us with a general framework in which many of the standard approaches can be embedded. We show that while these standard approaches are all the same at the propositional level, they are significantly different in the context of a first-order language. Furthermore, we show that plausibilities provide the most natural extension of conditional logic to the first-order case: We provide a sound and complete axiomatization that contains only the KLM properties and standard axioms of first-order modal logic. We show that most of the other approaches have additional properties, which result in an inappropriate treatment of an infinitary version of the lottery paradox.<|reference_end|> | arxiv | @article{friedman1998first-order,
title={First-Order Conditional Logic Revisited},
author={Nir Friedman, Joseph Y. Halpern, and Daphne Koller},
journal={arXiv preprint arXiv:cs/9808005},
year={1998},
archivePrefix={arXiv},
eprint={cs/9808005},
primaryClass={cs.AI cs.LO}
} | friedman1998first-order |
arxiv-676017 | cs/9808006 | Set-Theoretic Completeness for Epistemic and Conditional Logic | <|reference_start|>Set-Theoretic Completeness for Epistemic and Conditional Logic: The standard approach to logic in the literature in philosophy and mathematics, which has also been adopted in computer science, is to define a language (the syntax), an appropriate class of models together with an interpretation of formulas in the language (the semantics), a collection of axioms and rules of inference characterizing reasoning (the proof theory), and then relate the proof theory to the semantics via soundness and completeness results. Here we consider an approach that is more common in the economics literature, which works purely at the semantic, set-theoretic level. We provide set-theoretic completeness results for a number of epistemic and conditional logics, and contrast the expressive power of the syntactic and set-theoretic approaches<|reference_end|> | arxiv | @article{halpern1998set-theoretic,
title={Set-Theoretic Completeness for Epistemic and Conditional Logic},
author={Joseph Y. Halpern},
journal={Annals of Mathematics and Artificial Intelligence, vol. 26, 1999,
pp. 1-27},
year={1998},
archivePrefix={arXiv},
eprint={cs/9808006},
primaryClass={cs.AI cs.LO}
} | halpern1998set-theoretic |
arxiv-676018 | cs/9808007 | Plausibility Measures and Default Reasoning | <|reference_start|>Plausibility Measures and Default Reasoning: We introduce a new approach to modeling uncertainty based on plausibility measures. This approach is easily seen to generalize other approaches to modeling uncertainty, such as probability measures, belief functions, and possibility measures. We focus on one application of plausibility measures in this paper: default reasoning. In recent years, a number of different semantics for defaults have been proposed, such as preferential structures, $\epsilon$-semantics, possibilistic structures, and $\kappa$-rankings, that have been shown to be characterized by the same set of axioms, known as the KLM properties. While this was viewed as a surprise, we show here that it is almost inevitable. In the framework of plausibility measures, we can give a necessary condition for the KLM axioms to be sound, and an additional condition necessary and sufficient to ensure that the KLM axioms are complete. This additional condition is so weak that it is almost always met whenever the axioms are sound. In particular, it is easily seen to hold for all the proposals made in the literature.<|reference_end|> | arxiv | @article{friedman1998plausibility,
title={Plausibility Measures and Default Reasoning},
author={Nir Friedman and Joseph Y. Halpern},
journal={arXiv preprint arXiv:cs/9808007},
year={1998},
archivePrefix={arXiv},
eprint={cs/9808007},
primaryClass={cs.AI cs.LO}
} | friedman1998plausibility |
arxiv-676019 | cs/9808008 | Computational Geometry Column 34 | <|reference_start|>Computational Geometry Column 34: Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are listed.<|reference_end|> | arxiv | @article{agarwal1998computational,
title={Computational Geometry Column 34},
author={Pankaj K. Agarwal and Joseph O'Rourke},
journal={SIGACT News, 29(3) (Issue 108) 27-32, Sept. 1998},
year={1998},
archivePrefix={arXiv},
eprint={cs/9808008},
primaryClass={cs.CG}
} | agarwal1998computational |
arxiv-676020 | cs/9808101 | The Computational Complexity of Probabilistic Planning | <|reference_start|>The Computational Complexity of Probabilistic Planning: We examine the computational complexity of testing and finding small plans in probabilistic planning domains with both flat and propositional representations. The complexity of plan evaluation and existence varies with the plan type sought; we examine totally ordered plans, acyclic plans, and looping plans, and partially ordered plans under three natural definitions of plan value. We show that problems of interest are complete for a variety of complexity classes: PL, P, NP, co-NP, PP, NP^PP, co-NP^PP, and PSPACE. In the process of proving that certain planning problems are complete for NP^PP, we introduce a new basic NP^PP-complete problem, E-MAJSAT, which generalizes the standard Boolean satisfiability problem to computations involving probabilistic quantities; our results suggest that the development of good heuristics for E-MAJSAT could be important for the creation of efficient algorithms for a wide variety of problems.<|reference_end|> | arxiv | @article{littman1998the,
title={The Computational Complexity of Probabilistic Planning},
author={M. L. Littman, J. Goldsmith, M. Mundhenk},
journal={Journal of Artificial Intelligence Research, Vol 9, (1998), 1-36},
year={1998},
archivePrefix={arXiv},
eprint={cs/9808101},
primaryClass={cs.AI}
} | littman1998the |
arxiv-676021 | cs/9809001 | Immunity and Simplicity for Exact Counting and Other Counting Classes | <|reference_start|>Immunity and Simplicity for Exact Counting and Other Counting Classes: Ko [RAIRO 24, 1990] and Bruschi [TCS 102, 1992] showed that in some relativized world, PSPACE (in fact, ParityP) contains a set that is immune to the polynomial hierarchy (PH). In this paper, we study and settle the question of (relativized) separations with immunity for PH and the counting classes PP, C_{=}P, and ParityP in all possible pairwise combinations. Our main result is that there is an oracle A relative to which C_{=}P contains a set that is immune to BPP^{ParityP}. In particular, this C_{=}P^A set is immune to PH^{A} and ParityP^{A}. Strengthening results of Tor\'{a}n [J.ACM 38, 1991] and Green [IPL 37, 1991], we also show that, in suitable relativizations, NP contains a C_{=}P-immune set, and ParityP contains a PP^{PH}-immune set. This implies the existence of a C_{=}P^{B}-simple set for some oracle B, which extends results of Balc\'{a}zar et al. [SIAM J.Comp. 14, 1985; RAIRO 22, 1988] and provides the first example of a simple set in a class not known to be contained in PH. Our proof technique requires a circuit lower bound for ``exact counting'' that is derived from Razborov's [Mat. Zametki 41, 1987] lower bound for majority.<|reference_end|> | arxiv | @article{rothe1998immunity,
title={Immunity and Simplicity for Exact Counting and Other Counting Classes},
author={Joerg Rothe},
journal={arXiv preprint arXiv:cs/9809001},
year={1998},
number={University of Rochester Technical Report TR-98-679},
archivePrefix={arXiv},
eprint={cs/9809001},
primaryClass={cs.CC}
} | rothe1998immunity |
arxiv-676022 | cs/9809002 | Tally NP Sets and Easy Census Functions | <|reference_start|>Tally NP Sets and Easy Census Functions: We study the question of whether every P set has an easy (i.e., polynomial-time computable) census function. We characterize this question in terms of unlikely collapses of language and function classes such as the containment of #P_1 in FP, where #P_1 is the class of functions that count the witnesses for tally NP sets. We prove that every #P_{1}^{PH} function can be computed in FP^{#P_{1}^{#P_{1}}}. Consequently, every P set has an easy census function if and only if every set in the polynomial hierarchy does. We show that the assumption of #P_1 being contained in FP implies P = BPP and that PH is contained in MOD_{k}P for each k \geq 2, which provides further evidence that not all sets in P have an easy census function. We also relate a set's property of having an easy census function to other well-studied properties of sets, such as rankability and scalability (the closure of the rankable sets under P-isomorphisms). Finally, we prove that it is no more likely that the census function of any set in P can be approximated (more precisely, can be n^{\alpha}-enumerated in time n^{\beta} for fixed \alpha and \beta) than that it can be precisely computed in polynomial time.<|reference_end|> | arxiv | @article{goldsmith1998tally,
title={Tally NP Sets and Easy Census Functions},
author={Judy Goldsmith, Mitsunori Ogihara, Joerg Rothe},
journal={arXiv preprint arXiv:cs/9809002},
year={1998},
number={University of Rochester Technical Report TR-98-684},
archivePrefix={arXiv},
eprint={cs/9809002},
primaryClass={cs.CC}
} | goldsmith1998tally |
arxiv-676023 | cs/9809003 | Common knowledge revisited | <|reference_start|>Common knowledge revisited: We consider the common-knowledge paradox raised by Halpern and Moses: common knowledge is necessary for agreement and coordination, but common knowledge is unattainable in the real world because of temporal imprecision. We discuss two solutions to this paradox: (1) modeling the world with a coarser granularity, and (2) relaxing the requirements for coordination.<|reference_end|> | arxiv | @article{fagin1998common,
title={Common knowledge revisited},
author={R. Fagin, J. Y. Halpern, Y. Moses, and M. Vardi},
journal={arXiv preprint arXiv:cs/9809003},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809003},
primaryClass={cs.LO cs.DC}
} | fagin1998common |
arxiv-676024 | cs/9809004 | Performance / Price Sort | <|reference_start|>Performance / Price Sort: NTsort is an external sort on WindowsNT 5.0. It has minimal functionality but excellent price performance. In particular, running on mail-order hardware it can sort 1.5 GB for a penny. For commercially available sorts, Postman Sort from Robert Ramey Software Development has elapsed time performance comparable to NTsort, while using less processor time. It can sort 1.27 GB for a penny (12.7 million records.) These sorts set new price-performance records. This paper documents this and proposes that the PennySort benchmark be revised to Performance/Price sort: a simple GB/$ sort metric based on a two-pass external sort.<|reference_end|> | arxiv | @article{gray1998performance,
title={Performance / Price Sort},
author={Jim Gray, Joshua Coates, Chris Nyberg},
journal={arXiv preprint arXiv:cs/9809004},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809004},
primaryClass={cs.DB cs.PF}
} | gray1998performance |
arxiv-676025 | cs/9809005 | The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb | <|reference_start|>The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb: Simple economic and performance arguments suggest appropriate lifetimes for main memory pages and suggest optimal page sizes. The fundamental tradeoffs are the prices and bandwidths of RAMs and disks. The analysis indicates that with today's technology, five minutes is a good lifetime for randomly accessed pages, one minute is a good lifetime for two-pass sequentially accessed pages, and 16 KB is a good size for index pages. These rules-of-thumb change in predictable ways as technology ratios change. They also motivate the importance of the new Kaps, Maps, Scans, and $/Kaps, $/Maps, $/TBscan metrics.<|reference_end|> | arxiv | @article{gray1998the,
title={The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules
of Thumb},
author={Jim Gray, Goetz Graefe},
journal={ACM SIGMOD Record 26(4): 63-68 (1997)},
year={1998},
number={MSR-TR-97-33},
archivePrefix={arXiv},
eprint={cs/9809005},
primaryClass={cs.DB}
} | gray1998the |
arxiv-676026 | cs/9809006 | The Design and Architecture of the Microsoft Cluster Service -- A Practical Approach to High-Availability and Scalability | <|reference_start|>The Design and Architecture of the Microsoft Cluster Service -- A Practical Approach to High-Availability and Scalability: Microsoft Cluster Service (MSCS) extends the Win-dows NT operating system to support high-availability services. The goal is to offer an execution environment where off-the-shelf server applications can continue to operate, even in the presence of node failures. Later ver-sions of MSCS will provide scalability via a node and application management system that allows applications to scale to hundreds of nodes. This paper provides a de-tailed description of the MSCS architecture and the de-sign decisions that have driven the implementation of the service. The paper also describes how some major appli-cations use the MSCS features, and describes features added to make it easier to implement and manage fault-tolerant applications on MSCS.<|reference_end|> | arxiv | @article{vogels1998the,
title={The Design and Architecture of the Microsoft Cluster Service -- A
Practical Approach to High-Availability and Scalability},
author={Werner Vogels, Dan Dumitriu, Ken Birman, Rod Gamache, Mike Massa, Rob
Short, John Vert, Joe Barrera},
journal={Proceedings of FTCS'98, June 23-25, 1998 in Munich, Germany},
year={1998},
number={Microsoft Research MSR-TR-98-16},
archivePrefix={arXiv},
eprint={cs/9809006},
primaryClass={cs.OS cs.DC}
} | vogels1998the |
arxiv-676027 | cs/9809007 | Locally Served Network Computers | <|reference_start|>Locally Served Network Computers: NCs are the natural evolution of PCs, ubiquitous computers everywhere. The current vision of NCs requires two improbable developments: (1) inexpensive high-bandwidth WAN links to the Internet, and (2) inexpensive centralized servers. The large NC bandwidth requirements will force each home or office to have a local server LAN attached to the NCs. These servers will be much less expensive to purchase and manage than a centralized solution. Centralized staff are expensive and unresponsive.<|reference_end|> | arxiv | @article{gray1998locally,
title={Locally Served Network Computers},
author={Jim Gray},
journal={Middleware Spectra, 11.2, 1997},
year={1998},
number={MSR-TR-95-55},
archivePrefix={arXiv},
eprint={cs/9809007},
primaryClass={cs.AR cs.DC}
} | gray1998locally |
arxiv-676028 | cs/9809008 | Comparing the expressive power of the Synchronous and the Asynchronous pi-calculus | <|reference_start|>Comparing the expressive power of the Synchronous and the Asynchronous pi-calculus: The Asynchronous pi-calculus, as recently proposed by Boudol and, independently, by Honda and Tokoro, is a subset of the pi-calculus which contains no explicit operators for choice and output-prefixing. The communication mechanism of this calculus, however, is powerful enough to simulate output-prefixing, as shown by Boudol, and input-guarded choice, as shown recently by Nestmann and Pierce. A natural question arises, then, whether or not it is possible to embed in it the full pi-calculus. We show that this is not possible, i.e. there does not exist any uniform, parallel-preserving, translation from the pi-calculus into the asynchronous pi-calculus, up to any ``reasonable'' notion of equivalence. This result is based on the incapablity of the asynchronous pi-calculus of breaking certain symmetries possibly present in the initial communication graph. By similar arguments, we prove a separation result between the pi-calculus and CCS.<|reference_end|> | arxiv | @article{palamidessi1998comparing,
title={Comparing the expressive power of the Synchronous and the Asynchronous
pi-calculus},
author={Catuscia Palamidessi},
journal={Proc. of the 24th ACM Symposium on Principles of Programming
Languages (POPL), pages 256--265, ACM, 1997},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809008},
primaryClass={cs.PL cs.LO}
} | palamidessi1998comparing |
arxiv-676029 | cs/9809009 | Developing numerical libraries in Java | <|reference_start|>Developing numerical libraries in Java: The rapid and widespread adoption of Java has created a demand for reliable and reusable mathematical software components to support the growing number of compute-intensive applications now under development, particularly in science and engineering. In this paper we address practical issues of the Java language and environment which have an effect on numerical library design and development. Benchmarks which illustrate the current levels of performance of key numerical kernels on a variety of Java platforms are presented. Finally, a strategy for the development of a fundamental numerical toolkit for Java is proposed and its current status is described.<|reference_end|> | arxiv | @article{boisvert1998developing,
title={Developing numerical libraries in Java},
author={Ronald F. Boisvert, Jack J. Dongarra, Roldan Pozo, Karin Remington and
G. W. Stewart},
journal={arXiv preprint arXiv:cs/9809009},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809009},
primaryClass={cs.MS}
} | boisvert1998developing |
arxiv-676030 | cs/9809010 | The Revolution Yet to Happen | <|reference_start|>The Revolution Yet to Happen: All information about physical objects including humans, buildings, processes, and organizations will be online. This trend is both desirable and inevitable. Cyberspace will provide the basis for wonderful new ways to inform, entertain, and educate people. The information and the corresponding systems will streamline commerce, but will also provide new levels of personal service, health care, and automation. The most significant benefit will be a breakthrough in our ability to remotely communicate with one another using all our senses. The ACM and the transistor were born in 1947. At that time the stored program computer was a revolutionary idea and the transistor was just a curiosity. Both ideas evolved rapidly. By the mid 1960s integrated circuits appeared -- allowing mass fabrication of transistors on silicon substrates. This allowed low-cost mass-produced computers. These technologies enabled extraordinary increases in processing speed and memory coupled with extraordinary price declines. The only form of processing and memory more easily, cheaply, and rapidly fabricated is the human brain. Peter Cohrane (1996) estimates the brain to have a processing power of around 1000 million-million operations per second, (one Petaops) and a memory of 10 Terabytes. If current trends continue, computers could have these capabilities by 2047. Such computers could be 'on body' personal assistants able to recall everything one reads, hears, and sees.<|reference_end|> | arxiv | @article{bell1998the,
title={The Revolution Yet to Happen},
author={C. Gordon Bell, Jim Gray},
journal={arXiv preprint arXiv:cs/9809010},
year={1998},
number={Microsoft Technical report: MSR-TR-98-45},
archivePrefix={arXiv},
eprint={cs/9809010},
primaryClass={cs.GL}
} | bell1998the |
arxiv-676031 | cs/9809011 | Microsoft TerraServer | <|reference_start|>Microsoft TerraServer: The Microsoft TerraServer stores aerial and satellite images of the earth in a SQL Server Database served to the public via the Internet. It is the world's largest atlas, combining five terabytes of image data from the United States Geodetic Survey, Sovinformsputnik, and Encarta Virtual Globe. Internet browsers provide intuitive spatial and gazetteer interfaces to the data. The TerraServer is also an E-Commerce application. Users can buy the right to use the imagery using Microsoft Site Servers managed by the USGS and Aerial Images. This paper describes the TerraServer's design and implementation.<|reference_end|> | arxiv | @article{barclay1998microsoft,
title={Microsoft TerraServer},
author={Tom Barclay, Robert Eberl, Jim Gray, John Nordlinger, Guru
Raghavendran, Don Slutz, Greg Smith, Phil Smoot, John Hoffman, Natt Robb III,
Hedy Rossmeissl, Beth Duff, George Lee, Theresa Mathesmier, Randall Sunne},
journal={arXiv preprint arXiv:cs/9809011},
year={1998},
number={Microsoft MSR-TR-98-17},
archivePrefix={arXiv},
eprint={cs/9809011},
primaryClass={cs.DB cs.DL}
} | barclay1998microsoft |
arxiv-676032 | cs/9809012 | A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem | <|reference_start|>A Fully Polynomial Randomized Approximation Scheme for the All Terminal Network Reliability Problem: The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability.<|reference_end|> | arxiv | @article{karger1998a,
title={A Fully Polynomial Randomized Approximation Scheme for the All Terminal
Network Reliability Problem},
author={David R. Karger},
journal={arXiv preprint arXiv:cs/9809012},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809012},
primaryClass={cs.DS}
} | karger1998a |
arxiv-676033 | cs/9809013 | Reasoning about Noisy Sensors and Effectors in the Situation Calculus | <|reference_start|>Reasoning about Noisy Sensors and Effectors in the Situation Calculus: Agents interacting with an incompletely known world need to be able to reason about the effects of their actions, and to gain further information about that world they need to use sensors of some sort. Unfortunately, both the effects of actions and the information returned from sensors are subject to error. To cope with such uncertainties, the agent can maintain probabilistic beliefs about the state of the world. With probabilistic beliefs the agent will be able to quantify the likelihood of the various outcomes of its actions and is better able to utilize the information gathered from its error-prone actions and sensors. In this paper, we present a model in which we can reason about an agent's probabilistic degrees of belief and the manner in which these beliefs change as various actions are executed. We build on a general logical theory of action developed by Reiter and others, formalized in the situation calculus. We propose a simple axiomatization that captures an agent's state of belief and the manner in which these beliefs change when actions are executed. Our model displays a number of intuitively reasonable properties.<|reference_end|> | arxiv | @article{bacchus1998reasoning,
title={Reasoning about Noisy Sensors and Effectors in the Situation Calculus},
author={Fahiem Bacchus, Joseph Y. Halpern, Hector J. Levesque},
journal={arXiv preprint arXiv:cs/9809013},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809013},
primaryClass={cs.AI cs.LO}
} | bacchus1998reasoning |
arxiv-676034 | cs/9809014 | Uniform Provability in Classical Logic | <|reference_start|>Uniform Provability in Classical Logic: Uniform proofs are sequent calculus proofs with the following characteristic: the last step in the derivation of a complex formula at any stage in the proof is always the introduction of the top-level logical symbol of that formula. We investigate the relevance of this uniform proof notion to structuring proof search in classical logic. A logical language in whose context provability is equivalent to uniform provability admits of a goal-directed proof procedure that interprets logical symbols as search directives whose meanings are given by the corresponding inference rules. While this uniform provability property does not hold directly of classical logic, we show that it holds of a fragment of it that only excludes essentially positive occurrences of universal quantifiers under a modest, sound, modification to the set of assumptions: the addition to them of the negation of the formula being proved. We further note that all uses of the added formula can be factored into certain derived rules. The resulting proof system and the uniform provability property that holds of it are used to outline a proof procedure for classical logic. An interesting aspect of this proof procedure is that it incorporates within it previously proposed mechanisms for dealing with disjunctive information in assumptions and for handling hypotheticals. Our analysis sheds light on the relationship between these mechanisms and the notion of uniform proofs.<|reference_end|> | arxiv | @article{nadathur1998uniform,
title={Uniform Provability in Classical Logic},
author={Gopalan Nadathur},
journal={Journal of Logic and Computation, Vol 8, No 96-15, pp 209-229,
1998},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809014},
primaryClass={cs.LO}
} | nadathur1998uniform |
arxiv-676035 | cs/9809015 | Correspondences between Classical, Intuitionistic and Uniform Provability | <|reference_start|>Correspondences between Classical, Intuitionistic and Uniform Provability: Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform provability, a restriction of intuitionistic provability that embodies a special form of goal-directedness. We determine, first, the circumstances in which the former relations imply the latter. Using this result, we identify the richest versions of the so-called abstract logic programming languages in classical and intuitionistic logic. We then study the reduction of classical and, derivatively, intuitionistic provability to uniform provability via the addition to the assumption set of the negation of the formula to be proved. Our focus here is on understanding the situations in which this reduction is achieved. However, our discussions indicate the structure of a proof procedure based on the reduction, a matter also considered explicitly elsewhere.<|reference_end|> | arxiv | @article{nadathur1998correspondences,
title={Correspondences between Classical, Intuitionistic and Uniform
Provability},
author={Gopalan Nadathur},
journal={arXiv preprint arXiv:cs/9809015},
year={1998},
number={University of Chicago, CS Dept, TR-97-12},
archivePrefix={arXiv},
eprint={cs/9809015},
primaryClass={cs.LO}
} | nadathur1998correspondences |
arxiv-676036 | cs/9809016 | Scoping Constructs in Logic Programming: Implementation Problems and their Solution | <|reference_start|>Scoping Constructs in Logic Programming: Implementation Problems and their Solution: The inclusion of universal quantification and a form of implication in goals in logic programming is considered. These additions provide a logical basis for scoping but they also raise new implementation problems. When universal and existential quantifiers are permitted to appear in mixed order in goals, the devices of logic variables and unification that are employed in solving existential goals must be modified to ensure that constraints arising out of the order of quantification are respected. Suitable modifications that are based on attaching numerical tags to constants and variables and on using these tags in unification are described. The resulting devices are amenable to an efficient implementation and can, in fact, be assimilated easily into the usual machinery of the Warren Abstract Machine (WAM). The provision of implications in goals results in the possibility of program clauses being added to the program for the purpose of solving specific subgoals. A naive scheme based on asserting and retracting program clauses does not suffice for implementing such additions for two reasons. First, it is necessary to also support the resurrection of an earlier existing program in the face of backtracking. Second, the possibility for implication goals to be surrounded by quantifiers requires a consideration of the parameterization of program clauses by bindings for their free variables. Devices for supporting these additional requirements are described as also is the integration of these devices into the WAM. Further extensions to the machine are outlined for handling higher-order additions to the language. The ideas presented here are relevant to the implementation of the higher-order logic programming language lambda Prolog.<|reference_end|> | arxiv | @article{nadathur1998scoping,
title={Scoping Constructs in Logic Programming: Implementation Problems and
their Solution},
author={Gopalan Nadathur, Bharat Jayaraman and Keehang Kwon},
journal={Journal of Logic Programming, 25(2)-119:161, 1995},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809016},
primaryClass={cs.PL}
} | nadathur1998scoping |
arxiv-676037 | cs/9809017 | The Complexity of Planar Counting Problems | <|reference_start|>The Complexity of Planar Counting Problems: We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat, Minimum Vertex Cover, Minimum Dominating Set, Minimum Feedback Vertex Set, X3C, Partition Into Triangles, and Clique Cover.} \end{romannum} We also prove the {\sf NP}-completeness of the {\sc Ambiguous Satisfiability} problems \cite{Sa80} and the {\sf D$^P$}-completeness (with respect to random polynomial reducibility) of the unique satisfiability problems \cite{VV85} associated with several of the above problems, when restricted to planar instances. Previously, very few {\sf #P}-hardness results, no {\sf NP}-hardness results, and no {\sf D$^P$}-completeness results were known for counting problems, ambiguous satisfiability problems and unique satisfiability problems, respectively, when restricted to planar instances. Assuming {\sf P $\neq $ NP}, one corollary of the above results is There are no $\epsilon$-approximation algorithms for the problems of maximizing or minimizing a linear objective function subject to a planar system of linear inequality constraints over the integers.<|reference_end|> | arxiv | @article{hunt1998the,
title={The Complexity of Planar Counting Problems},
author={Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, Richard
E. Stearns},
journal={arXiv preprint arXiv:cs/9809017},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809017},
primaryClass={cs.CC cs.DM}
} | hunt1998the |
arxiv-676038 | cs/9809018 | Influencing Software Usage | <|reference_start|>Influencing Software Usage: Technology designers often strive to design systems that are flexible enough to be used in a wide range of situations. Software engineers, in particular, are trained to seek general solutions to problems. General solutions can be used not only to address the problem at hand, but also to address a wide range of problems that the designers may not have even anticipated. Sometimes designers wish to provide general solutions, while encouraging certain uses of their technology and discouraging or precluding others. They may attempt to influence the use of technology by ``hard-wiring'' it so that it only can be used in certain ways, licensing it so that those who use it are legally obligated to use it in certain ways, issuing guidelines for how it should be used, or providing resources that make it easier to use the technology as the designers intended than to use it in any other way. This paper examines several cases where designers have attempted to influence the use of technology through one of these mechanisms. Such cases include key recovery encryption, Pegasus Mail, Platform for Internet Content Selection (PICS) Guidelines, Java, Platform for Privacy Preferences Project (P3P) Implementation Guide, Apple's style guidelines, and Microsoft Foundation Classes. In some of these cases, the designers sought to influence the use of technology for competitive reasons or in order to promote standardization or interoperability. However, in other cases designers were motivated by policy-related goals such as protecting privacy or free speech. As new technologies are introduced with the express purpose of advancing policy-related goals (for example, PICS and P3P), it is especially important to understand the roles designers might play in influencing the use of technology.<|reference_end|> | arxiv | @article{cranor1998influencing,
title={Influencing Software Usage},
author={Lorrie Faith Cranor and Rebecca N. Wright},
journal={arXiv preprint arXiv:cs/9809018},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809018},
primaryClass={cs.CY}
} | cranor1998influencing |
arxiv-676039 | cs/9809019 | Distributed Computation as Hierarchy | <|reference_start|>Distributed Computation as Hierarchy: This paper presents a new distributed computational model of distributed systems called the phase web that extends V. Pratt's orthocurrence relation from 1986. The model uses mutual-exclusion to express sequence, and a new kind of hierarchy to replace event sequences, posets, and pomsets. The model explicitly connects computation to a discrete Clifford algebra that is in turn extended into homology and co-homology, wherein the recursive nature of objects and boundaries becomes apparent and itself subject to hierarchical recursion. Topsy, a programming environment embodying the phase web, is available from www.cs.auc.dk/topsy.<|reference_end|> | arxiv | @article{manthey1998distributed,
title={Distributed Computation as Hierarchy},
author={Michael Manthey},
journal={arXiv preprint arXiv:cs/9809019},
year={1998},
number={Aalborg University, Computer Science Dept. R-98-5005},
archivePrefix={arXiv},
eprint={cs/9809019},
primaryClass={cs.DC cs.NE}
} | manthey1998distributed |
arxiv-676040 | cs/9809020 | Linear Segmentation and Segment Significance | <|reference_start|>Linear Segmentation and Segment Significance: We present a new method for discovering a segmental discourse structure of a document while categorizing segment function. We demonstrate how retrieval of noun phrases and pronominal forms, along with a zero-sum weighting scheme, determines topicalized segmentation. Futhermore, we use term distribution to aid in identifying the role that the segment performs in the document. Finally, we present results of evaluation in terms of precision and recall which surpass earlier approaches.<|reference_end|> | arxiv | @article{kan1998linear,
title={Linear Segmentation and Segment Significance},
author={Min-Yen Kan, Judith L. Klavans, Kathleen R. McKeown},
journal={Proceedings of 6th International Workshop of Very Large Corpora
(WVLC-6), Montreal, Quebec, Canada: Aug. 1998. pp. 197-205},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809020},
primaryClass={cs.CL}
} | kan1998linear |
arxiv-676041 | cs/9809021 | Producing NLP-based On-line Contentware | <|reference_start|>Producing NLP-based On-line Contentware: For its internal needs as well as for commercial purposes, CDC Group has produced several NLP-based on-line contentware applications for years. The development process of such applications is subject to numerous constraints such as quality of service, integration of new advances in NLP, direct reactions from users, continuous versioning, short delivery deadlines and cost control. Following this industrial and commercial experience, malleability of the applications, their openness towards foreign components, efficiency of applications and their ease of exploitation have appeared to be key points. In this paper, we describe TalLab, a powerful architecture for on-line contentware which fulfils these requirements.<|reference_end|> | arxiv | @article{wolinski1998producing,
title={Producing NLP-based On-line Contentware},
author={Francis Wolinski, Frantz Vichot, Olivier Gremont (Informatique
CDC/DTA, Arcueil, France)},
journal={Natural Language Processing & Industrial Applications, Moncton,
NB, Canada, Aug. 1998},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809021},
primaryClass={cs.CL cs.AR}
} | wolinski1998producing |
arxiv-676042 | cs/9809022 | Modelling Users, Intentions, and Structure in Spoken Dialog | <|reference_start|>Modelling Users, Intentions, and Structure in Spoken Dialog: We outline how utterances in dialogs can be interpreted using a partial first order logic. We exploit the capability of this logic to talk about the truth status of formulae to define a notion of coherence between utterances and explain how this coherence relation can serve for the construction of AND/OR trees that represent the segmentation of the dialog. In a BDI model we formalize basic assumptions about dialog and cooperative behaviour of participants. These assumptions provide a basis for inferring speech acts from coherence relations between utterances and attitudes of dialog participants. Speech acts prove to be useful for determining dialog segments defined on the notion of completing expectations of dialog participants. Finally, we sketch how explicit segmentation signalled by cue phrases and performatives is covered by our dialog model.<|reference_end|> | arxiv | @article{ludwig1998modelling,
title={Modelling Users, Intentions, and Structure in Spoken Dialog},
author={Bernd Ludwig, Guenther Goerz, Heinrich Niemann},
journal={arXiv preprint arXiv:cs/9809022},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809022},
primaryClass={cs.CL}
} | ludwig1998modelling |
arxiv-676043 | cs/9809023 | Similarity-Based Queries for Time Series Data | <|reference_start|>Similarity-Based Queries for Time Series Data: We study a set of linear transformations on the Fourier series representation of a sequence that can be used as the basis for similarity queries on time-series data. We show that our set of transformations is rich enough to formulate operations such as moving average and time warping. We present a query processing algorithm that uses the underlying R-tree index of a multidimensional data set to answer similarity queries efficiently. Our experiments show that the performance of this algorithm is competitive to that of processing ordinary (exact match) queries using the index, and much faster than sequential scanning. We relate our transformations to the general framework for similarity queries of Jagadish et al.<|reference_end|> | arxiv | @article{rafiei1998similarity-based,
title={Similarity-Based Queries for Time Series Data},
author={Davood Rafiei and Alberto Mendelzon},
journal={In Proceedings of the ACM SIGMOD Intl. Conf. on Management of
Data, pages 13-24, Tucson, Arizona, May 1997},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809023},
primaryClass={cs.DB}
} | rafiei1998similarity-based |
arxiv-676044 | cs/9809024 | A Lexicalized Tree Adjoining Grammar for English | <|reference_start|>A Lexicalized Tree Adjoining Grammar for English: This document describes a sizable grammar of English written in the TAG formalism and implemented for use with the XTAG system. This report and the grammar described herein supersedes the TAG grammar described in an earlier 1995 XTAG technical report. The English grammar described in this report is based on the TAG formalism which has been extended to include lexicalization, and unification-based feature structures. The range of syntactic phenomena that can be handled is large and includes auxiliaries (including inversion), copula, raising and small clause constructions, topicalization, relative clauses, infinitives, gerunds, passives, adjuncts, it-clefts, wh-clefts, PRO constructions, noun-noun modifications, extraposition, determiner sequences, genitives, negation, noun-verb contractions, sentential adjuncts and imperatives. This technical report corresponds to the XTAG Release 8/31/98. The XTAG grammar is continuously updated with the addition of new analyses and modification of old ones, and an online version of this report can be found at the XTAG web page at http://www.cis.upenn.edu/~xtag/<|reference_end|> | arxiv | @article{xtag research group1998a,
title={A Lexicalized Tree Adjoining Grammar for English},
author={XTAG Research Group (University of Pennsylvania)},
journal={arXiv preprint arXiv:cs/9809024},
year={1998},
number={IRCS Tech Report 98-18, ftp://ftp.cis.upenn.edu/pub/ircs/tr/98-18/},
archivePrefix={arXiv},
eprint={cs/9809024},
primaryClass={cs.CL}
} | xtag research group1998a |
arxiv-676045 | cs/9809025 | Novelty and Social Search in the World Wide Web | <|reference_start|>Novelty and Social Search in the World Wide Web: The World Wide Web is fast becoming a source of information for a large part of the world's population. Because of its sheer size and complexity users often resort to recommendations from others to decide which sites to visit. We present a dynamical theory of recommendations which predicts site visits by users of the World Wide Web. We show that it leads to a universal power law for the number of users that visit given sites over periods of time, with an exponent related to the rate at which users discover new sites on their own. An extensive empirical study of user behavior in the Web that we conducted confirms the existence of this law of influence while yielding bounds on the rate of novelty encountered by users.<|reference_end|> | arxiv | @article{huberman1998novelty,
title={Novelty and Social Search in the World Wide Web},
author={Bernardo A. Huberman and Lada A. Adamic},
journal={arXiv preprint arXiv:cs/9809025},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809025},
primaryClass={cs.MA cs.DL}
} | huberman1998novelty |
arxiv-676046 | cs/9809026 | Prefix Probabilities from Stochastic Tree Adjoining Grammars | <|reference_start|>Prefix Probabilities from Stochastic Tree Adjoining Grammars: Language models for speech recognition typically use a probability model of the form Pr(a_n | a_1, a_2, ..., a_{n-1}). Stochastic grammars, on the other hand, are typically used to assign structure to utterances. A language model of the above form is constructed from such grammars by computing the prefix probability Sum_{w in Sigma*} Pr(a_1 ... a_n w), where w represents all possible terminations of the prefix a_1 ... a_n. The main result in this paper is an algorithm to compute such prefix probabilities given a stochastic Tree Adjoining Grammar (TAG). The algorithm achieves the required computation in O(n^6) time. The probability of subderivations that do not derive any words in the prefix, but contribute structurally to its derivation, are precomputed to achieve termination. This algorithm enables existing corpus-based estimation techniques for stochastic TAGs to be used for language modelling.<|reference_end|> | arxiv | @article{nederhof1998prefix,
title={Prefix Probabilities from Stochastic Tree Adjoining Grammars},
author={Mark-Jan Nederhof (DFKI), Anoop Sarkar (UPenn) and Giorgio Satta
(UPadova)},
journal={In Proceedings of COLING-ACL '98 (Montreal)},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809026},
primaryClass={cs.CL}
} | nederhof1998prefix |
arxiv-676047 | cs/9809027 | Conditions on Consistency of Probabilistic Tree Adjoining Grammars | <|reference_start|>Conditions on Consistency of Probabilistic Tree Adjoining Grammars: Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting point for the study of such cross-derivational properties is the notion of _consistency_. The probability model defined by a probabilistic grammar is said to be _consistent_ if the probabilities assigned to all the strings in the language sum to one. From the literature on probabilistic context-free grammars (CFGs), we know precisely the conditions which ensure that consistency is true for a given CFG. This paper derives the conditions under which a given probabilistic Tree Adjoining Grammar (TAG) can be shown to be consistent. It gives a simple algorithm for checking consistency and gives the formal justification for its correctness. The conditions derived here can be used to ensure that probability models that use TAGs can be checked for _deficiency_ (i.e. whether any probability mass is assigned to strings that cannot be generated).<|reference_end|> | arxiv | @article{sarkar1998conditions,
title={Conditions on Consistency of Probabilistic Tree Adjoining Grammars},
author={Anoop Sarkar (University of Pennsylvania)},
journal={In Proceedings of COLING-ACL '98 (Montreal)},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809027},
primaryClass={cs.CL}
} | sarkar1998conditions |
arxiv-676048 | cs/9809028 | Separating Dependency from Constituency in a Tree Rewriting System | <|reference_start|>Separating Dependency from Constituency in a Tree Rewriting System: In this paper we present a new tree-rewriting formalism called Link-Sharing Tree Adjoining Grammar (LSTAG) which is a variant of synchronous TAGs. Using LSTAG we define an approach towards coordination where linguistic dependency is distinguished from the notion of constituency. Such an approach towards coordination that explicitly distinguishes dependencies from constituency gives a better formal understanding of its representation when compared to previous approaches that use tree-rewriting systems which conflate the two issues.<|reference_end|> | arxiv | @article{sarkar1998separating,
title={Separating Dependency from Constituency in a Tree Rewriting System},
author={Anoop Sarkar (University of Pennsylvania)},
journal={In Proceedings of the Fifth Meeting on Mathematics of Language,
Saarbruecken, August 1997},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809028},
primaryClass={cs.CL}
} | sarkar1998separating |
arxiv-676049 | cs/9809029 | Incremental Parser Generation for Tree Adjoining Grammars | <|reference_start|>Incremental Parser Generation for Tree Adjoining Grammars: This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the input grammar by updating the parser generated so far. In this paper, a lazy generation of LR-type parsers for TALs is defined in which parse tables are created by need while parsing. We then describe an incremental parser generator for TALs which responds to modification of the input grammar by updating parse tables built so far.<|reference_end|> | arxiv | @article{sarkar1998incremental,
title={Incremental Parser Generation for Tree Adjoining Grammars},
author={Anoop Sarkar (University of Pennsylvania)},
journal={Longer version of paper in Proceedings of the 34th Meeting of the
ACL, Student Session. Santa Cruz, June 1996},
year={1998},
doi={10.1063/1.1594535},
archivePrefix={arXiv},
eprint={cs/9809029},
primaryClass={cs.CL}
} | sarkar1998incremental |
arxiv-676050 | cs/9809030 | Fast, Approximate Synthesis of Fractional Gaussian Noise for Generating Self-Similar Network Traffic | <|reference_start|>Fast, Approximate Synthesis of Fractional Gaussian Noise for Generating Self-Similar Network Traffic: Recent network traffic studies argue that network arrival processes are much more faithfully modeled using statistically self-similar processes instead of traditional Poisson processes [LTWW94,PF95]. One difficulty in dealing with self-similar models is how to efficiently synthesize traces (sample paths) corresponding to self-similar traffic. We present a fast Fourier transform method for synthesizing approximate self-similar sample paths for one type of self-similar process, Fractional Gaussian Noise, and assess its performance and validity. We find that the method is as fast or faster than existing methods and appears to generate close approximations to true self-similar sample paths. We also discuss issues in using such synthesized sample paths for simulating network traffic, and how an approximation used by our method can dramatically speed up evaluation of Whittle's estimator for H, the Hurst parameter giving the strength of long-range dependence present in a self-similar time series.<|reference_end|> | arxiv | @article{paxson1998fast,,
title={Fast, Approximate Synthesis of Fractional Gaussian Noise for Generating
Self-Similar Network Traffic},
author={Vern Paxson (Network Research Group, Lawrence Berkeley National
Laboratory)},
journal={Computer Communication Review 27(5) (1997) 5-18},
year={1998},
number={LBL-36750/UC-405},
archivePrefix={arXiv},
eprint={cs/9809030},
primaryClass={cs.NI}
} | paxson1998fast, |
arxiv-676051 | cs/9809031 | Security amplification by composition: The case of doubly-iterated, ideal ciphers | <|reference_start|>Security amplification by composition: The case of doubly-iterated, ideal ciphers: We investigate, in the Shannon model, the security of constructions corresponding to double and (two-key) triple DES. That is, we consider F_{k1}(F_{k2}(.)) and F_{k1}(F_{k2}^{-1}(F_{k1}(.))) with the component functions being ideal ciphers. This models the resistance of these constructions to ``generic'' attacks like meet in the middle attacks. We obtain the first proof that composition actually increases the security of these constructions in some meaningful sense. We compute a bound on the probability of breaking the double cipher as a function of the number of computations of the base cipher made, and the number of examples of the composed cipher seen, and show that the success probability is the square of that for a single key cipher. The same bound holds for the two-key triple cipher. The first bound is tight and shows that meet in the middle is the best possible generic attack against the double cipher.<|reference_end|> | arxiv | @article{aiello1998security,
title={Security amplification by composition: The case of doubly-iterated,
ideal ciphers},
author={William Aiello, Mihir Bellare, Giovanni Di Crescenzo and Ramarathnam
Venkatesan},
journal={arXiv preprint arXiv:cs/9809031},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809031},
primaryClass={cs.CR}
} | aiello1998security |
arxiv-676052 | cs/9809032 | Stable models and an alternative logic programming paradigm | <|reference_start|>Stable models and an alternative logic programming paradigm: In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate that inherent features of stable model semantics naturally lead to a logic programming system that offers an interesting alternative to more traditional logic programming styles of Horn logic programming, stratified logic programming and logic programming with well-founded semantics. The proposed approach is based on the interpretation of program clauses as constraints. In this setting programs do not describe a single intended model, but a family of stable models. These stable models encode solutions to the constraint satisfaction problem described by the program. Our approach imposes restrictions on the syntax of logic programs. In particular, function symbols are eliminated from the language. We argue that the resulting logic programming system is well-attuned to problems in the class NP, has a well-defined domain of applications, and an emerging methodology of programming. We point out that what makes the whole approach viable is recent progress in implementations of algorithms to compute stable models of propositional logic programs.<|reference_end|> | arxiv | @article{marek1998stable,
title={Stable models and an alternative logic programming paradigm},
author={Victor W. Marek, Miroslaw Truszczynski},
journal={The Logic Programming Paradigm, K.R. Apt, V.W. Marek, M.
Truszczynski, D.S. Warren (eds.), pp. 375-398. Springer-Verlag, 1999},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809032},
primaryClass={cs.LO cs.AI}
} | marek1998stable |
arxiv-676053 | cs/9809033 | Efficient Retrieval of Similar Time Sequences Using DFT | <|reference_start|>Efficient Retrieval of Similar Time Sequences Using DFT: We propose an improvement of the known DFT-based indexing technique for fast retrieval of similar time sequences. We use the last few Fourier coefficients in the distance computation without storing them in the index since every coefficient at the end is the complex conjugate of a coefficient at the beginning and as strong as its counterpart. We show analytically that this observation can accelerate the search time of the index by more than a factor of two. This result was confirmed by our experiments, which were carried out on real stock prices and synthetic data.<|reference_end|> | arxiv | @article{rafiei1998efficient,
title={Efficient Retrieval of Similar Time Sequences Using DFT},
author={Davood Rafiei and Alberto Mendelzon},
journal={Proceedings of 5th Intl. Conf. on Foundations of Data
Organizations and Algorithms (FODO '98), November 1998, Kobe, Japan},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809033},
primaryClass={cs.DB}
} | rafiei1998efficient |
arxiv-676054 | cs/9809034 | Semantics and Conversations for an Agent Communication Language | <|reference_start|>Semantics and Conversations for an Agent Communication Language: We address the issues of semantics and conversations for agent communication languages and the Knowledge Query Manipulation Language (KQML) in particular. Based on ideas from speech act theory, we present a semantic description for KQML that associates ``cognitive'' states of the agent with the use of the language's primitives (performatives). We have used this approach to describe the semantics for the whole set of reserved KQML performatives. Building on the semantics, we devise the conversation policies, i.e., a formal description of how KQML performatives may be combined into KQML exchanges (conversations), using a Definite Clause Grammar. Our research offers methods for a speech act theory-based semantic description of a language of communication acts and for the specification of the protocols associated with these acts. Languages of communication acts address the issue of communication among software applications at a level of abstraction that is useful to the emerging software agents paradigm.<|reference_end|> | arxiv | @article{labrou1998semantics,
title={Semantics and Conversations for an Agent Communication Language},
author={Yannis Labrou and Tim Finin},
journal={Proceedings of the Fifteenth International Joint Conference on
Artificial Intelligence (IJCAI-97) August, 1997},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809034},
primaryClass={cs.MA cs.AI}
} | labrou1998semantics |
arxiv-676055 | cs/9809035 | Separation-Sensitive Collision Detection for Convex Objects | <|reference_start|>Separation-Sensitive Collision Detection for Convex Objects: We develop a class of new kinetic data structures for collision detection between moving convex polytopes; the performance of these structures is sensitive to the separation of the polytopes during their motion. For two convex polygons in the plane, let $D$ be the maximum diameter of the polygons, and let $s$ be the minimum distance between them during their motion. Our separation certificate changes $O(\log(D/s))$ times when the relative motion of the two polygons is a translation along a straight line or convex curve, $O(\sqrt{D/s})$ for translation along an algebraic trajectory, and $O(D/s)$ for algebraic rigid motion (translation and rotation). Each certificate update is performed in $O(\log(D/s))$ time. Variants of these data structures are also shown that exhibit \emph{hysteresis}---after a separation certificate fails, the new certificate cannot fail again until the objects have moved by some constant fraction of their current separation. We can then bound the number of events by the combinatorial size of a certain cover of the motion path by balls.<|reference_end|> | arxiv | @article{erickson1998separation-sensitive,
title={Separation-Sensitive Collision Detection for Convex Objects},
author={Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi, Li Zhang},
journal={arXiv preprint arXiv:cs/9809035},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809035},
primaryClass={cs.CG cs.GR}
} | erickson1998separation-sensitive |
arxiv-676056 | cs/9809036 | Document Archiving, Replication and Migration Container for Mobile Web Users | <|reference_start|>Document Archiving, Replication and Migration Container for Mobile Web Users: With the increasing use of mobile workstations for a wide variety of tasks and associated information needs, and with many variations of available networks, access to data becomes a prime consideration. This paper discusses issues of workstation mobility and proposes a solution wherein the data structures are accessed in an encapsulated form - through the Portable File System (PFS) wrapper. The paper discusses an implementation of the Portable File System, highlighting the architecture and commenting upon performance of an experimental system. Although investigations have been focused upon mobile access of WWW documents, this technique could be applied to any mobile data access situation.<|reference_end|> | arxiv | @article{stanski1998document,
title={Document Archiving, Replication and Migration Container for Mobile Web
Users},
author={P. Stanski, S. Giles and A. Zaslavsky},
journal={Proceedings of the 1998 ACM Symposium on Applied Computing
(SAC98), Feb. 27- March 1, pp. 400-404, ACM, ISBN 0-89791-969-6},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809036},
primaryClass={cs.MA cs.MM}
} | stanski1998document |
arxiv-676057 | cs/9809037 | Regression Depth and Center Points | <|reference_start|>Regression Depth and Center Points: We show that, for any set of n points in d dimensions, there exists a hyperplane with regression depth at least ceiling(n/(d+1)). as had been conjectured by Rousseeuw and Hubert. Dually, for any arrangement of n hyperplanes in d dimensions there exists a point that cannot escape to infinity without crossing at least ceiling(n/(d+1)) hyperplanes. We also apply our approach to related questions on the existence of partitions of the data into subsets such that a common plane has nonzero regression depth in each subset, and to the computational complexity of regression depth problems.<|reference_end|> | arxiv | @article{amenta1998regression,
title={Regression Depth and Center Points},
author={Nina Amenta, Marshall Bern, David Eppstein, Shang-Hua Teng},
journal={Discrete Comput. Geom. 23(3):305-323, 2000},
year={1998},
doi={10.1007/PL00009502},
archivePrefix={arXiv},
eprint={cs/9809037},
primaryClass={cs.CG math.CO}
} | amenta1998regression |
arxiv-676058 | cs/9809038 | Incremental and Decremental Maintenance of Planar Width | <|reference_start|>Incremental and Decremental Maintenance of Planar Width: We present an algorithm for maintaining the width of a planar point set dynamically, as points are inserted or deleted. Our algorithm takes time O(kn^epsilon) per update, where k is the amount of change the update causes in the convex hull, n is the number of points in the set, and epsilon is any arbitrarily small constant. For incremental or decremental update sequences, the amortized time per update is O(n^epsilon).<|reference_end|> | arxiv | @article{eppstein1998incremental,
title={Incremental and Decremental Maintenance of Planar Width},
author={David Eppstein},
journal={J. Algorithms 37(2):570-577, Nov. 2000},
year={1998},
doi={10.1006/jagm.2000.1107},
archivePrefix={arXiv},
eprint={cs/9809038},
primaryClass={cs.CG}
} | eppstein1998incremental |
arxiv-676059 | cs/9809039 | ABR Flow Control for Multipoint Connections | <|reference_start|>ABR Flow Control for Multipoint Connections: Multipoint capabilities are essential for ATM networks to efficiently support many applications, including IP multicasting and overlay applications. The current signaling and routing specifications for ATM define point-to-multipoint capabilities. Multipoint-to-point connection support is also being discussed by the signaling and PNNI groups, and will be defined in the near future for the unspecified bit rate (UBR) service. We examine point-to-multipoint and multipoint-to-point flow control for the available bit rate (ABR) service, as discussed in the traffic management working group.<|reference_end|> | arxiv | @article{fahmy1998abr,
title={ABR Flow Control for Multipoint Connections},
author={Sonia Fahmy, Raj Jain},
journal={arXiv preprint arXiv:cs/9809039},
year={1998},
doi={10.1109/MNET.1998.730745},
archivePrefix={arXiv},
eprint={cs/9809039},
primaryClass={cs.NI}
} | fahmy1998abr |
arxiv-676060 | cs/9809040 | Overload Based Explicit Rate Switch Schemes with MCR Guarantees | <|reference_start|>Overload Based Explicit Rate Switch Schemes with MCR Guarantees: An explicit rate switch scheme monitors the load at each link and gives feedback to the sources. We define the overload factor as the ratio of the input rate to the available capacity. In this paper, we present four overload based ABR switch schemes which provide MCR guarantees. The switch schemes proposed use the overload factor and other quantities to calculate feedback rates. A dynamic queue control mechanism is used to achieve efficient usage of the link, control queues and, achieve constant queuing delay at steady state. The proposed algorithms are studied and compared using several configurations. The configurations were chosen to test the performance of the algorithms in presence of link bottlenecks, source bottlenecks and transient sources. A comparison of the proposed algorithms based on the simulation results is presented.<|reference_end|> | arxiv | @article{vandalore1998overload,
title={Overload Based Explicit Rate Switch Schemes with MCR Guarantees},
author={Bobby Vandalore, Sonia Fahmy, Raj Jain, Rohit Goyal, Mukul Goyal},
journal={arXiv preprint arXiv:cs/9809040},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809040},
primaryClass={cs.NI}
} | vandalore1998overload |
arxiv-676061 | cs/9809041 | Design and Analysis of Queue Control Functions for Explicit Rate Switch Schemes | <|reference_start|>Design and Analysis of Queue Control Functions for Explicit Rate Switch Schemes: The main goals of a switch scheme are high utilization, low queuing delay and fairness. To achieve high utilization the switch scheme can maintain non-zero (small) queues in steady state which can be used if the sources do not have data to send. Queue length (delay) can be controlled if part of the link capacity is used for draining queues in the event of queue build up. In most schemes a simple threshold function is used for queue control. Better control of the queue and hence delay can be achieved by using sophisticated queue control functions. It is very important to design and analyze such queue control functions. We study step, linear, hyperbolic and inverse hyperbolic queue control functions. Analytical explanation and simulation results consistent with analysis are presented. From the study, we conclude that inverse hyperbolic is the best control function and to reduce complexity the linear control function can be used since it performs satisfactorily in most cases.<|reference_end|> | arxiv | @article{vandalore1998design,
title={Design and Analysis of Queue Control Functions for Explicit Rate Switch
Schemes},
author={Bobby Vandalore, Raj Jain, Rohit Goyal, Sonia Fahmy},
journal={arXiv preprint arXiv:cs/9809041},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809041},
primaryClass={cs.NI}
} | vandalore1998design |
arxiv-676062 | cs/9809042 | A Definition of General Weighted Fairness and its Support in Explicit Rate Switch Algorithms | <|reference_start|>A Definition of General Weighted Fairness and its Support in Explicit Rate Switch Algorithms: In this paper we give a general definition of weighted fairness and show how this can achieve various fairness definitions, such as those mentioned in the ATM Forum TM 4.0 Specifications. We discuss how a pricing policy can be mapped to general weighted (GW) fairness. The GW fairness can be achieved by calculating the $ExcessFairshare$ (weighted fairshare of the left over bandwidth) for each VC. We show how a switch algorithm can be modified to support the GW fairness by using the $ExcessFairshare$. We use ERICA+ as an example switch algorithm and show how it can be modified to achieve the general fairness. Simulations results are presented to demonstrate that the modified switch algorithm achieves GW fairness. An analytical proof for convergence of the modified ERICA+ algorithm is given in the appendix.<|reference_end|> | arxiv | @article{vandalore1998a,
title={A Definition of General Weighted Fairness and its Support in Explicit
Rate Switch Algorithms},
author={Bobby Vandalore, Sonia Fahmy, Raj Jain, Rohit Goyal, Mukul Goyal},
journal={arXiv preprint arXiv:cs/9809042},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809042},
primaryClass={cs.NI}
} | vandalore1998a |
arxiv-676063 | cs/9809043 | Worst Case Buffer Requirements For Tcp Over ABR | <|reference_start|>Worst Case Buffer Requirements For Tcp Over ABR: ATM (asynchronous transfer mode) is the technology chosen for the Broadband Integrated Services Digital Network (B-ISDN). The ATM ABR (available bit rate) service can be used to transport ``best-effort'' traffic. In this paper, we extend our earlier work on the buffer requirements problem for TCP over ABR. Here, a worst case scenario is generated such that TCP sources send a burst of data at the time when the sources have large congestion windows and the ACRs (allowed cell rates) for ABR are high. We find that ABR using the ERICA+ switch algorithm can control the maximum queue lengths (hence the buffer requirements) even for the worst case. We present analytical arguments for the expected queue length and simulation results for different number of sources values and parameter values.<|reference_end|> | arxiv | @article{vandalore1998worst,
title={Worst Case Buffer Requirements For Tcp Over ABR},
author={Bobby Vandalore, Shivkumar Kalyanaraman, Raj Jain, Rohit Goyal, Sonia
Fahmy},
journal={arXiv preprint arXiv:cs/9809043},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809043},
primaryClass={cs.NI}
} | vandalore1998worst |
arxiv-676064 | cs/9809045 | Performance of TCP over ABR with Long-Range Dependent VBR Background Traffic over Terrestrial and Satellite ATM networks | <|reference_start|>Performance of TCP over ABR with Long-Range Dependent VBR Background Traffic over Terrestrial and Satellite ATM networks: Compressed video is well known to be self-similar in nature. We model VBR carrying Long-Range Dependent (LRD), multiplexed MPEG-2 video sources. The actual traffic for the model is generated using fast-fourier transform of generate the fractional gaussian noise (FGN) sequence. Our model of compressed video sources bears similarity to an MPEG-2 Transport Stream carrying video, i.e., it is long-range dependent and generates traffic in a piecewise-CBR fashion. We study the effect of such VBR traffic on ABR carrying TCP traffic. The effect of such VBR traffic is that the ABR capacity is highly variant. We find that a switch algorithm like ERICA+ can tolerate this variance in ABR capacity while maintaining high throughput and low delay. We present simulation results for terrestrial and satellite configurations.<|reference_end|> | arxiv | @article{kalyanaraman1998performance,
title={Performance of TCP over ABR with Long-Range Dependent VBR Background
Traffic over Terrestrial and Satellite ATM networks},
author={Shivkumar Kalyanaraman, Bobby Vandalore, Raj Jain, Rohit Goyal, Sonia
Fahmy, Seong-Cheol Kim, Sastri Kota},
journal={arXiv preprint arXiv:cs/9809045},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809045},
primaryClass={cs.NI}
} | kalyanaraman1998performance |
arxiv-676065 | cs/9809046 | Fairness for ABR multipoint-to-point connections | <|reference_start|>Fairness for ABR multipoint-to-point connections: In multipoint-to-point connections, the traffic at the root (destination) is the combination of all traffic originating at the leaves. A crucial concern in the case of multiple senders is how to define fairness within a multicast group and among groups and point-to-point connections. Fairness definition can be complicated since the multipoint connection can have the same identifier (VPI/VCI) on each link, and senders might not be distinguishable in this case. Many rate allocation algorithms implicitly assume that there is only one sender in each VC, which does not hold for multipoint-to-point cases. We give various possibilities for defining fairness for multipoint connections, and show the tradeoffs involved. In addition, we show that ATM bandwidth allocation algorithms need to be adapted to give fair allocations for multipoint-to-point connections.<|reference_end|> | arxiv | @article{fahmy1998fairness,
title={Fairness for ABR multipoint-to-point connections},
author={Sonia Fahmy, Raj Jain, Rohit Goyal, and Bobby Vandalore},
journal={arXiv preprint arXiv:cs/9809046},
year={1998},
doi={10.1117/12.325859},
archivePrefix={arXiv},
eprint={cs/9809046},
primaryClass={cs.NI}
} | fahmy1998fairness |
arxiv-676066 | cs/9809047 | Modeling Traffic Management in ATM Networks with OPNET | <|reference_start|>Modeling Traffic Management in ATM Networks with OPNET: Asynchronous transfer mode (ATM) is the new generation of computer and communication networks that are being deployed throughout the telecommunication industry as well as in campus backbones. ATM technology distinguishes itself from the previous networking protocols in that it has the latest traffic management technology and thus allows guaranteeing delay, throughput, and other performance measures. This in turn, allows users to integrate voice, video, and data on the same network. Available bit rate (ABR) service in ATM has been designed to fairly distribute all unused capacity to data traffic and is specified in the ATM Forum's Traffic Management (TM4.0) standard. This paper will describe the OPNET models that have been developed for ATM and ABR design and analysis.<|reference_end|> | arxiv | @article{goyal1998modeling,
title={Modeling Traffic Management in ATM Networks with OPNET},
author={Rohit Goyal, Raj Jain, Sonia Fahmy, Shobana Narayanaswamy},
journal={arXiv preprint arXiv:cs/9809047},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809047},
primaryClass={cs.NI}
} | goyal1998modeling |
arxiv-676067 | cs/9809048 | laboratories for Data Communications and Computer Networks | <|reference_start|>laboratories for Data Communications and Computer Networks: In this paper we describe a hands-on laboratory oriented instructional package that we have developed for data communications and networking. The package consists of a software tool, together with instructional material for a laboratory based networking curriculum. The software is based on a simulation environment that enables the student to experiment with various networking protocols, on an easy to use graphical user interface (GUI). Data message flows, packet losses, control/routing message flows, virtual circuit setups, link failures, bit errors etc., are some of the features that can be visualized in this environment. The student can also modify the networking components provided, as well as add new components using the C programming language. The instructional material consists of a set of laboratory exercises for flow and error control (HDLC), IEEE 802.3 CSMA/CD protocol, the token ring protocol, interconnecting LANs via bridges, TCP congestion avoidance and control, IP fragmentation and reassembly, ATM PNNI routing and ATM policing. The laboratory exercises have facilitated the development of a networking curriculum based on both the traditional computer networking principles, as well as the new technologies in telecommunication networking. The laboratory environment has been used in the networking curriculum at The Ohio State University, and is being piloted at other universities. The entire package is freely available over the Internet.<|reference_end|> | arxiv | @article{goyal1998laboratories,
title={laboratories for Data Communications and Computer Networks},
author={Rohit Goyal, Steve Lai, Raj Jain, Arian Durresi},
journal={arXiv preprint arXiv:cs/9809048},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809048},
primaryClass={cs.NI}
} | goyal1998laboratories |
arxiv-676068 | cs/9809049 | Aspects of Evolutionary Design by Computers | <|reference_start|>Aspects of Evolutionary Design by Computers: This paper examines the four main types of Evolutionary Design by computers: Evolutionary Design Optimisation, Evolutionary Art, Evolutionary Artificial Life Forms and Creative Evolutionary Design. Definitions for all four areas are provided. A review of current work in each of these areas is given, with examples of the types of applications that have been tackled. The different properties and requirements of each are examined. Descriptions of typical representations and evolutionary algorithms are provided and examples of designs evolved using these techniques are shown. The paper then discusses how the boundaries of these areas are beginning to merge, resulting in four new 'overlapping' types of Evolutionary Design: Integral Evolutionary Design, Artificial Life Based Evolutionary Design, Aesthetic Evolutionary AL and Aesthetic Evolutionary Design. Finally, the last part of the paper discusses some common problems faced by creators of Evolutionary Design systems, including: interdependent elements in designs, epistasis, and constraint handling.<|reference_end|> | arxiv | @article{bentley1998aspects,
title={Aspects of Evolutionary Design by Computers},
author={Peter J Bentley},
journal={arXiv preprint arXiv:cs/9809049},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809049},
primaryClass={cs.NE}
} | bentley1998aspects |
arxiv-676069 | cs/9809050 | A Freely Available Morphological Analyzer, Disambiguator and Context Sensitive Lemmatizer for German | <|reference_start|>A Freely Available Morphological Analyzer, Disambiguator and Context Sensitive Lemmatizer for German: In this paper we present Morphy, an integrated tool for German morphology, part-of-speech tagging and context-sensitive lemmatization. Its large lexicon of more than 320,000 word forms plus its ability to process German compound nouns guarantee a wide morphological coverage. Syntactic ambiguities can be resolved with a standard statistical part-of-speech tagger. By using the output of the tagger, the lemmatizer can determine the correct root even for ambiguous word forms. The complete package is freely available and can be downloaded from the World Wide Web.<|reference_end|> | arxiv | @article{lezius1998a,
title={A Freely Available Morphological Analyzer, Disambiguator and Context
Sensitive Lemmatizer for German},
author={Wolfgang Lezius (University of Paderborn), Reinhard Rapp (University
of Mainz), Manfred Wettler (University of Paderborn)},
journal={Proceedings of the COLING-ACL 1998, pp. 743-748},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809050},
primaryClass={cs.CL}
} | lezius1998a |
arxiv-676070 | cs/9809051 | Spoken Language Dialogue Systems and Components: Best practice in development and evaluation (DISC 24823) - Periodic Progress Report 1: Basic Details of the Action | <|reference_start|>Spoken Language Dialogue Systems and Components: Best practice in development and evaluation (DISC 24823) - Periodic Progress Report 1: Basic Details of the Action: The DISC project aims to (a) build an in-depth understanding of the state-of-the-art in spoken language dialogue systems (SLDSs) and components development and evaluation with the purpose of (b) developing a first best practice methodology in the field. The methodology will be accompanied by (c) a series of development and evaluation support tools. To the limited extent possible within the duration of the project, the draft versions of the methodology and the tools will be (d) tested by SLDS developers from industry and research, and will be (e) packaged to best suit their needs. In the first year of DISC, (a) has been accomplished, and (b) and (c) have started. A proposal to complete the work proposed above by adding 12 months to the 18 months of the present project, has been submitted to Esprit Long-Term Research in March 1998.<|reference_end|> | arxiv | @article{bernsen1998spoken,
title={Spoken Language Dialogue Systems and Components: Best practice in
development and evaluation (DISC 24823) - Periodic Progress Report 1: Basic
Details of the Action},
author={Niels Ole Bernsen and Laila Dybkjaer, eds. (The Natural Interactive
Systems Group, Odense University, Denmark)},
journal={arXiv preprint arXiv:cs/9809051},
year={1998},
number={DISC-D5.1},
archivePrefix={arXiv},
eprint={cs/9809051},
primaryClass={cs.CL cs.SE}
} | bernsen1998spoken |
arxiv-676071 | cs/9809052 | Analysis and Simulation of Delay and Buffer Requirements of satellite-ATM Networks for TCP/IP Traffic | <|reference_start|>Analysis and Simulation of Delay and Buffer Requirements of satellite-ATM Networks for TCP/IP Traffic: In this paper we present a model to study the end-to-end delay performance of a satellite-ATM netowrk. We describe a satellite-ATM network architecture. The architecture presents a trade-off between the on-board switching/processing features and the complexity of the satellite communication systems. The end-to-end delay of a connection passing through a satellite constellation consists of the transmission delay, the uplink and downlink ground terminal-satellite propagation delay, the inter-satellite link delays, the on-board switching, processing and buffering delays. In a broadband satellite network, the propagation and the buffering delays have the most impact on the overall delay. We present an analysis of the propagation and buffering delay components for GEO and LEO systems. We model LEO constellations as satellites evenly spaced in circular orbits around the earth. A simple routing algorithm for LEO systems calculates locally optimal paths for the end-to-end connection. This is used to calculate the end-to-end propagation delays for LEO networks. We present a simulation model to calculate the buffering delay for TCP/IP traffic over ATM ABR and UBR service categories. We apply this model to calculate total end-to-end delays for TCP/IP over satellite-ATM networks.<|reference_end|> | arxiv | @article{goyal1998analysis,
title={Analysis and Simulation of Delay and Buffer Requirements of
satellite-ATM Networks for TCP/IP Traffic},
author={Rohit Goyal, Sastri Kota, Raj Jain, Sonia Fahmy, Bobby Vandalore,
Jerry Kallaus},
journal={arXiv preprint arXiv:cs/9809052},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809052},
primaryClass={cs.NI}
} | goyal1998analysis |
arxiv-676072 | cs/9809053 | Improving the Performance of TCP over the ATM-UBR service | <|reference_start|>Improving the Performance of TCP over the ATM-UBR service: In this paper we study the design issues in improving TCP performance over the ATM UBR service. ATM-UBR switches respond to congestion by dropping cells when their buffers become full. TCP connections running over UBR can experience low throughput and high unfairness. Intelligent switch drop policies and end-system policies can improve the performance of TCP over UBR with limited buffers. We describe the various design options available to the network as well as to the end systems to improve TCP performance over UBR. We study the effects of Early Packet Discard, and two per-VC accounting based buffer management policies. We also study the effects of various TCP end system congestion control policies including slow start and congestion avoidance, fast retransmit and recovery and selective acknowledgments. We present simulation results for various small and large latency configurations with varying buffer sizes and number of sources.<|reference_end|> | arxiv | @article{goyal1998improving,
title={Improving the Performance of TCP over the ATM-UBR service},
author={ohit Goyal, Raj Jain, Shiv Kalyanaraman, Sonia Fahmy, Bobby Vandalore},
journal={arXiv preprint arXiv:cs/9809053},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809053},
primaryClass={cs.NI}
} | goyal1998improving |
arxiv-676073 | cs/9809054 | Design Issues for providing Minimum Rate Guarantees to the ATM Unspecified Bit Rate Service | <|reference_start|>Design Issues for providing Minimum Rate Guarantees to the ATM Unspecified Bit Rate Service: Recent enhancements have been proposed to the ATM Unspecified Bit Rate (UBR) service that guarantee a minimum rate at the frame level to the UBR VCs. These enhancements have been called Guaranteed Frame Rate (GFR). In this paper, we discuss the motivation, design and implementation issues for GFR. We present the design of buffer management and policing mechanisms to implement GFR. We study the effects of policing, per-VC buffer allocation, and per-VC queuing on providing GFR to TCP/IP traffic. We conclude that per-VC scheduling is necessary to provide minimum rate guarantees to TCP traffic. We examine the role of frame tagging in the presence of scheduling and buffer management for providing minumum rate guarantees. The use of GFR to support the Internet Controlled Load Service is also discussed.<|reference_end|> | arxiv | @article{goyal1998design,
title={Design Issues for providing Minimum Rate Guarantees to the ATM
Unspecified Bit Rate Service},
author={Rohit Goyal, Raj Jain, Sonia Fahmy, Bobby Vandalore, Shivkumar
Kalyanaraman},
journal={arXiv preprint arXiv:cs/9809054},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809054},
primaryClass={cs.NI}
} | goyal1998design |
arxiv-676074 | cs/9809055 | Providing Rate Guarantees to TCP over the ATM GFR Service | <|reference_start|>Providing Rate Guarantees to TCP over the ATM GFR Service: The ATM Guaranteed Frame Rate (GFR) service is intended for best effort traffic that can benefit from minimum throughput guarantees. Edge devices connecting LANs to an ATM network can use GFR to transport multiple TCP/IP connections over a single GFR VC.These devices would typically multiplex VCs into a single FIFO queue. It has been shown that in general, FIFO queuing is not sufficient to provide rate guarantees, and per-VC queuing with scheduling is needed. We show that under conditions of low buffer allocation, it is possible to control TCP rates with FIFO queuing and buffer management. We present analysis and simulation results on controlling TCP rates by buffer management. We present a buffer management policy that provides loose rate guarantees to SACK TCP sources when the total buffer allocation is low. We study the performance of this buffer management scheme by simulation.<|reference_end|> | arxiv | @article{goyal1998providing,
title={Providing Rate Guarantees to TCP over the ATM GFR Service},
author={Rohit Goyal, Raj Jain, Sonia Fahmy, Bobby Vandalore},
journal={arXiv preprint arXiv:cs/9809055},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809055},
primaryClass={cs.NI}
} | goyal1998providing |
arxiv-676075 | cs/9809056 | Analysis and Modeling of Traffic in Modern Data Communication Networks | <|reference_start|>Analysis and Modeling of Traffic in Modern Data Communication Networks: In performance analysis and design of communication netword modeling data traffic is important. With introduction of new applications, the characteristics of the data traffic changes. We present a brief review the different models of data traffic and how they have evolved. We present results of data traffic analysis and simulated traffic, which demonstrates that the packet train model fits the traffic at source destination level and long-memory (self-similar) model fits the traffic at the aggregate level.<|reference_end|> | arxiv | @article{babic1998analysis,
title={Analysis and Modeling of Traffic in Modern Data Communication Networks},
author={G. Babic, B. Vandalore, and R. Jain},
journal={arXiv preprint arXiv:cs/9809056},
year={1998},
number={OSU-CISRC-1/98-TR02},
archivePrefix={arXiv},
eprint={cs/9809056},
primaryClass={cs.NI}
} | babic1998analysis |
arxiv-676076 | cs/9809057 | On Determining the Fair Bandwidth Share for ABR Connections in ATM Networks | <|reference_start|>On Determining the Fair Bandwidth Share for ABR Connections in ATM Networks: The ABR service is designed to fairly allocate the bandwidth unused by higher priority services. The network indicates to the ABR sources the rates at which they should transmit to minimize their cell loss. Switches must constantly measure the demand and available capacity, and divide the capacity fairly among the contending connections. In order to compute the fair and efficient allocation for each connection, a switch needs to determine the effective number of active connections. In this paper, we propose a method for determining the number of active connections and the fair bandwidth share for each. We prove the efficiency and fairness of the proposed method analytically, and simulate it by incorporating it into the ERICA switch algorithm.<|reference_end|> | arxiv | @article{fahmy1998on,
title={On Determining the Fair Bandwidth Share for ABR Connections in ATM
Networks},
author={Sonia Fahmy, Raj Jain, Shivkumar Kalyanaraman, Rohit Goyal and Bobby
Vandalore},
journal={arXiv preprint arXiv:cs/9809057},
year={1998},
doi={10.1109/ICC.1998.683072},
archivePrefix={arXiv},
eprint={cs/9809057},
primaryClass={cs.NI}
} | fahmy1998on |
arxiv-676077 | cs/9809058 | The OSU Scheme for Congestion Avoidance in ATM Networks: Lessons Learnt and Extensions | <|reference_start|>The OSU Scheme for Congestion Avoidance in ATM Networks: Lessons Learnt and Extensions: The OSU scheme is a rate-based congestion avoidance scheme for ATM networks using explicit rate indication. This work was one of the first attempts to define explicit rate switch mechanisms and the Resource Management (RM) cell format in Asynchronous Transfer Mode (ATM) networks. The key features of the scheme include explicit rate feedback, congestion avoidance, fair operation while maintaining high utilization, use of input rate as a congestion metric, O(1) complexity. This paper presents an overview of the scheme, presents those features of the scheme that have now become common features of other switch algorithms and discusses three extensions of the scheme.<|reference_end|> | arxiv | @article{jain1998the,
title={The OSU Scheme for Congestion Avoidance in ATM Networks: Lessons Learnt
and Extensions},
author={Raj Jain, Shiv Kalyanaraman and Ram Viswanathan},
journal={arXiv preprint arXiv:cs/9809058},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809058},
primaryClass={cs.NI}
} | jain1998the |
arxiv-676078 | cs/9809059 | The ERICA Switch Algorithm for ABR Traffic Management in ATM Networks | <|reference_start|>The ERICA Switch Algorithm for ABR Traffic Management in ATM Networks: We propose an explicit rate indication scheme for congestion avoidance in ATM networks. In this scheme, the network switches monitor their load on each link, determining a load factor, the available capacity, and the number of currently active virtual channels. This information is used to advise the sources about the rates at which they should transmit. The algorithm is designed to achieve efficiency, fairness, controlled queueing delays, and fast transient response. The algorithm is also robust to measurement errors caused due to variation in ABR demand and capacity. We present performance analysis of the scheme using both analytical arguments and simulation results. The scheme is being implemented by several ATM switch manufacturers.<|reference_end|> | arxiv | @article{kalyanaraman1998the,
title={The ERICA Switch Algorithm for ABR Traffic Management in ATM Networks},
author={Shivkumar Kalyanaraman, Raj Jain, Sonia Fahmy, Rohit Goyal, and Bobby
Vandalore},
journal={arXiv preprint arXiv:cs/9809059},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809059},
primaryClass={cs.NI}
} | kalyanaraman1998the |
arxiv-676079 | cs/9809060 | New Applications of the Incompressibility Method: Part II | <|reference_start|>New Applications of the Incompressibility Method: Part II: The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method.<|reference_end|> | arxiv | @article{buhrman1998new,
title={New Applications of the Incompressibility Method: Part II},
author={Harry Buhrman (CWI), Tao Jiang (McMaster U.), Ming Li (U of Waterloo),
Paul Vitanyi (CWI and U of Amsterdam)},
journal={arXiv preprint arXiv:cs/9809060},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809060},
primaryClass={cs.CC cs.DM}
} | buhrman1998new |
arxiv-676080 | cs/9809061 | New Applications of the Incompressibility Method: Part I | <|reference_start|>New Applications of the Incompressibility Method: Part I: The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method.<|reference_end|> | arxiv | @article{jiang1998new,
title={New Applications of the Incompressibility Method: Part I},
author={Tao Jiang (McMaster U.), Ming Li (U of Waterloo), Paul Vitanyi (CWI
and U of Amsterdam)},
journal={arXiv preprint arXiv:cs/9809061},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809061},
primaryClass={cs.CC cs.DM}
} | jiang1998new |
arxiv-676081 | cs/9809062 | Satellite ATM Network Architectural Considerations and TCP/IP Performance | <|reference_start|>Satellite ATM Network Architectural Considerations and TCP/IP Performance: In this paper, we have provided a summary of the design options in Satellite-ATM technology. A satellite ATM network consists of a space segment of satellites connected by inter-satellite crosslinks, and a ground segment of the various ATM networks. A satellite-ATM interface module connects the satellite network to the ATM networks and performs various call and control functions. A network control center performs various network management and resource allocation functions. Several issues such as the ATM service model, media access protocols, and traffic management issues must be considered when designing a satellite ATM network to effectively transport Internet traffic. We have presented the buffer requirements for TCP/IP traffic over ATM-UBR for satellite latencies. Our results are based on TCP with selective acknowledgments and a per-VC buffer management policy at the switches. A buffer size of about 0.5 * RTT to 1 * RTT is sufficient to provide over 98% throughput to infinite TCP traffic for long latency networks and a large number of sources. This buffer requirement is independent of the number of sources. The fairness is high for a large numbers of sources because of the per-VC buffer management performed at the switches and the nature of TCP traffic.<|reference_end|> | arxiv | @article{kota1998satellite,
title={Satellite ATM Network Architectural Considerations and TCP/IP
Performance},
author={Sastri Kota, Rohit Goyal, Raj Jain},
journal={arXiv preprint arXiv:cs/9809062},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809062},
primaryClass={cs.NI}
} | kota1998satellite |
arxiv-676082 | cs/9809063 | Performance of Bursty World Wide Web (WWW) Sources over ABR | <|reference_start|>Performance of Bursty World Wide Web (WWW) Sources over ABR: We model World Wide Web (WWW) servers and clients running over an ATM network using the ABR (available bit rate) service. The WWW servers are modeled using a variant of the SPECweb96 benchmark, while the WWW clients are based on a model by Mah. The traffic generated by this application is typically bursty, i.e., it has active and idle periods in transmission. A timeout occurs after given amount of idle period. During idle period the underlying TCP congestion windows remain open until a timeout expires. These open windows may be used to send data in a burst when the application becomes active again. This raises the possibility of large switch queues if the source rates are not controlled by ABR. We study this problem and show that ABR scales well with a large number of bursty TCP sources in the system.<|reference_end|> | arxiv | @article{vandalore1998performance,
title={Performance of Bursty World Wide Web (WWW) Sources over ABR},
author={Bobby Vandalore, Shivkumar Kalyanaraman, Raj Jain, Rohit Goyal, Sonia
Fahmy, Seong-Cheol Kim},
journal={arXiv preprint arXiv:cs/9809063},
year={1998},
doi={10.1117/12.325884},
archivePrefix={arXiv},
eprint={cs/9809063},
primaryClass={cs.NI}
} | vandalore1998performance |
arxiv-676083 | cs/9809064 | Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems | <|reference_start|>Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems: We study the efficient approximability of basic graph and logic problems in the literature when instances are specified hierarchically as in \cite{Le89} or are specified by 1-dimensional finite narrow periodic specifications as in \cite{Wa93}. We show that, for most of the problems $\Pi$ considered when specified using {\bf k-level-restricted} hierarchical specifications or $k$-narrow periodic specifications the following holds: \item Let $\rho$ be any performance guarantee of a polynomial time approximation algorithm for $\Pi$, when instances are specified using standard specifications. Then $\forall \epsilon > 0$, $ \Pi$ has a polynomial time approximation algorithm with performance guarantee $(1 + \epsilon) \rho$. \item $\Pi$ has a polynomial time approximation scheme when restricted to planar instances. \end{romannum} These are the first polynomial time approximation schemes for PSPACE-hard hierarchically or periodically specified problems. Since several of the problems considered are PSPACE-hard, our results provide the first examples of natural PSPACE-hard optimization problems that have polynomial time approximation schemes. This answers an open question in Condon et. al. \cite{CF+93}.<|reference_end|> | arxiv | @article{marathe1998approximation,
title={Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically
Specified Problems},
author={Madhav V. Marathe, Harry B. Hunt III, Richard E. Stearns, Venkatesh
Radhakrishnan},
journal={SIAM J. Computing, Vol. 27, No 5, Oct. 1998, pp. 1237--1261},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809064},
primaryClass={cs.CC cs.DS}
} | marathe1998approximation |
arxiv-676084 | cs/9809065 | Feedback Consolidation Algorithms for ABR Point-to-Multipoint Connections in ATM Networks | <|reference_start|>Feedback Consolidation Algorithms for ABR Point-to-Multipoint Connections in ATM Networks: ABR traffic management for point-to-multipoint connections controls the source rate to the minimum rate supported by all the branches of the multicast tree. A number of algorithms have been developed for extending ABR congestion avoidance algorithms to perform feedback consolidation at the branch points. This paper discusses various design options and implementation alternatives for the consolidation algorithms, and proposes a number of new algorithms. The performance of the proposed algorithms and the previous algorithms is compared under a variety of conditions. Results indicate that the algorithms we propose eliminate the consolidation noise (caused if the feedback is returned before all branches respond), while exhibiting a fast transient response.<|reference_end|> | arxiv | @article{fahmy1998feedback,
title={Feedback Consolidation Algorithms for ABR Point-to-Multipoint
Connections in ATM Networks},
author={Sonia Fahmy, Raj Jain, Rohit Goyal, Bobby Vandalore, Shivkumar
Kalyanaraman, Sastri Kota, and Pradeep Samudra},
journal={arXiv preprint arXiv:cs/9809065},
year={1998},
doi={10.1109/INFCOM.1998.662910},
archivePrefix={arXiv},
eprint={cs/9809065},
primaryClass={cs.NI}
} | fahmy1998feedback |
arxiv-676085 | cs/9809066 | TCP Selective Acknowledgments and UBR Drop Policies to Improve ATM-UBR Performance over Terrestrial and Satellite Networks | <|reference_start|>TCP Selective Acknowledgments and UBR Drop Policies to Improve ATM-UBR Performance over Terrestrial and Satellite Networks: We study the performance of Selective Acknowledgments with TCP over the ATM-UBR service category. We examine various UBR drop policies, TCP mechanisms and network configurations to recommend optimal parameters for TCP over UBR. We discuss various TCP congestion control mechanisms compare their performance for LAN and WAN networks. We describe the effect of satellite delays on TCP performance over UBR and present simulation results for LAN, WAN and satellite networks. SACK TCP improves the performance of TCP over UBR, especially for large delay networks. Intelligent drop policies at the switches are an important factor for good performance in local area networks.<|reference_end|> | arxiv | @article{goyal1998tcp,
title={TCP Selective Acknowledgments and UBR Drop Policies to Improve ATM-UBR
Performance over Terrestrial and Satellite Networks},
author={Rohit Goyal, Raj Jain, Shivkumar Kalyanaraman, Sonia Fahmy, Bobby
Vandalore, Sastri Kota},
journal={arXiv preprint arXiv:cs/9809066},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809066},
primaryClass={cs.NI}
} | goyal1998tcp |
arxiv-676086 | cs/9809067 | A Survey of Protocols and Open Issues in ATM Multipoint Communication | <|reference_start|>A Survey of Protocols and Open Issues in ATM Multipoint Communication: Asynchronous transfer mode (ATM) networks must define multicast capabilities in order to efficiently support numerous applications, such as video conferencing and distributed applications, in addition to LAN emulation (LANE) and Internet protocol (IP) multicasting. Several problems and issues arise in ATM multicasting, such as signaling, routing, connection admission control, and traffic management problems. IP integrated services over ATM poses further challenges to ATM multicasting. Scalability and simplicity are the two main concerns for ATM multicasting. This paper provides a survey of the current work on multicasting problems in general, and ATM multicasting in particular. A number of proposed schemes is examined, such as the schemes MARS, MCS, SEAM, SMART, RSVP, and various multipoint traffic management and transport-layer schemes. The paper also indicates a number of key open issues that remain unresolved.<|reference_end|> | arxiv | @article{fahmy1998a,
title={A Survey of Protocols and Open Issues in ATM Multipoint Communication},
author={Sonia Fahmy, Raj Jain, Shivkumar Kalyanaraman, Rohit Goyal, Bobby
Vandalore and Xiangrong Cai},
journal={arXiv preprint arXiv:cs/9809067},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809067},
primaryClass={cs.NI}
} | fahmy1998a |
arxiv-676087 | cs/9809068 | Performance Testing Effort at the ATM Forum: An Overview | <|reference_start|>Performance Testing Effort at the ATM Forum: An Overview: The testing group at ATM Forum is working on developing a specification for performance testing of ATM switches and networks. The emphasis is on the user perceived frame-level performance. This paper explains what is different about this new effort and gives its status.<|reference_end|> | arxiv | @article{jain1998performance,
title={Performance Testing Effort at the ATM Forum: An Overview},
author={Raj Jain and Gojko Babic},
journal={arXiv preprint arXiv:cs/9809068},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809068},
primaryClass={cs.NI}
} | jain1998performance |
arxiv-676088 | cs/9809069 | Design Considerations for the Virtual Source/Virtual Destination (VS/VD) Feature in the ABR Service of ATM Networks | <|reference_start|>Design Considerations for the Virtual Source/Virtual Destination (VS/VD) Feature in the ABR Service of ATM Networks: The Available Bit Rate (ABR) service in ATM networks has been specified to allow fair and efficient support of data applications over ATM utilizing capacity left over after servicing higher priority classes. One of the architectural features in the ABR specification [tm4] is the Virtual Source/Virtual Destination (VS/VD) option. This option allows a switch to divide an end-to-end ABR connection into separately controlled ABR segments by acting like a destination on one segment, and like a source on the other. The coupling in the VS/VD switch between the two ABR control segments is implementation specific. In this paper, we model a VS/VD ATM switch and study the issues in designing coupling between ABR segments. We identify a number of implementation options for the coupling. A good choice significantly improves the stability and transient performance of the system and reduces the buffer requirements at the switches.<|reference_end|> | arxiv | @article{kalyanaraman1998design,
title={Design Considerations for the Virtual Source/Virtual Destination (VS/VD)
Feature in the ABR Service of ATM Networks},
author={Shiv Kalyanaraman, Raj Jain, Jianping Jiang, Rohit Goyal, Sonia Fahmy
and Pradeep Samudra},
journal={arXiv preprint arXiv:cs/9809069},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809069},
primaryClass={cs.NI}
} | kalyanaraman1998design |
arxiv-676089 | cs/9809070 | Use-it or Lose-it Policies for the Available Bit Rate (ABR) Service in ATM Networks | <|reference_start|>Use-it or Lose-it Policies for the Available Bit Rate (ABR) Service in ATM Networks: The Available Bit Rate (ABR) service has been developed to support 21st century data applications over Asynchronous Transfer Mode (ATM). The ABR service uses a closed-loop rate-based traffic management framework where the network divides left-over bandwidth among contending sources. The ATM Forum traffic management group also incorporated open-loop control capabilities to make the ABR service robust to temporary network failures and source inactivity. An important problem addressed was whether rate allocations of sources should be taken away if sources do not use them. The proposed solutions, popularly known as the Use-It-or-Lose-It (UILI) policies, have had significant impact on the ABR service capabilities. In this paper we discuss the design, development, and the final shape of these policies and their impact on the ABR service. We compare the various alternatives through a performance evaluation.<|reference_end|> | arxiv | @article{kalyanaraman1998use-it,
title={Use-it or Lose-it Policies for the Available Bit Rate (ABR) Service in
ATM Networks},
author={Shivkumar Kalyanaraman, Raj Jain, Rohit Goyal, Sonia Fahmy, and
Seong-Cheol Kim},
journal={arXiv preprint arXiv:cs/9809070},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809070},
primaryClass={cs.NI}
} | kalyanaraman1998use-it |
arxiv-676090 | cs/9809071 | UBR+: Improving Performance of TCP over ATM-UBR service | <|reference_start|>UBR+: Improving Performance of TCP over ATM-UBR service: ATM-UBR switches respond to congestion by dropping cells when their buffers become full. TCP connections running over UBR experience low throughput and high unfairness. For 100% TCP throughput each switch needs buffers equal to the sum of the window sizes of all the TCP connections. Intelligent drop policies can improve the performance of TCP over UBR with limited buffers. The UBR+ service proposes enhancements to UBR for intelligent drop. Early Packet Discard improves throughput but does not attempt to improve fairness. Selective packet drop based on per-connection buffer occupancy improves fairness. The Fair Buffer Allocation scheme further improves both throughput and fairness.<|reference_end|> | arxiv | @article{goyal1998ubr+:,
title={UBR+: Improving Performance of TCP over ATM-UBR service},
author={Rohit Goyal, Raj Jain, Shiv Kalyanaraman, Sonia Fahmy and Seong-Cheol
Kim},
journal={arXiv preprint arXiv:cs/9809071},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809071},
primaryClass={cs.NI}
} | goyal1998ubr+: |
arxiv-676091 | cs/9809072 | Performance of TCP over ABR on ATM backbone and with various VBR traffic patterns | <|reference_start|>Performance of TCP over ABR on ATM backbone and with various VBR traffic patterns: We extend our earlier studies of buffer requirements of TCP over ABR in two directions. First, we study the performance of TCP over ABR in an ATM backbone. On the backbone, the TCP queues are at the edge router and not inside the ATM network. The router requires buffer equal to the sum of the receiver window sizes of the participating TCP connections. Second, we introduce various patterns of VBR background traffic. The VBR background introduces variance in the ABR capacity and the TCP traffic introduces variance in the ABR demand. Some simple switch schemes are unable to keep up with the combined effect of highly varying demands and highly varying ABR capacity. We present our experiences with refining the ERICA+ switch scheme to handle these conditions.<|reference_end|> | arxiv | @article{kalyanaraman1998performance,
title={Performance of TCP over ABR on ATM backbone and with various VBR traffic
patterns},
author={Shiv Kalyanaraman, Raj Jain, Sonia Fahmy, Rohit Goyal, Jianping Jiang
and Seong-Cheol Kim},
journal={arXiv preprint arXiv:cs/9809072},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809072},
primaryClass={cs.NI}
} | kalyanaraman1998performance |
arxiv-676092 | cs/9809073 | Performance and Buffering Requirements of Internet Protocols over ATM ABR and UBR Services | <|reference_start|>Performance and Buffering Requirements of Internet Protocols over ATM ABR and UBR Services: The Asynchronous Transfer Mode (ATM) networks are quickly being adopted as backbones over various parts of the Internet. This paper analyzes the performance of TCP/IP protocols over ATM network's Available Bit Rate (ABR) and Unspecified Bit Rate (UBR) services. It is shown that ABR pushes congestion to the edges of the ATM network while UBR leaves it inside the ATM portion.<|reference_end|> | arxiv | @article{kalyanaraman1998performance,
title={Performance and Buffering Requirements of Internet Protocols over ATM
ABR and UBR Services},
author={Shiv Kalyanaraman, Raj Jain, Sonia Fahmy, Rohit Goyal and Seong-Cheol
Kim},
journal={arXiv preprint arXiv:cs/9809073},
year={1998},
doi={10.1109/35.685383},
archivePrefix={arXiv},
eprint={cs/9809073},
primaryClass={cs.NI}
} | kalyanaraman1998performance |
arxiv-676093 | cs/9809074 | Performance of TCP/IP Using ATM ABR and UBR Services over Satellite Networks | <|reference_start|>Performance of TCP/IP Using ATM ABR and UBR Services over Satellite Networks: We study the buffering requirements for zero cell loss for TCP/IP over satellite links using the available bit rate (ABR) and unspecified bit rate (UBR) services of asynchronous transfer mode (ATM) networks. For the ABR service, we explore the effect of feedback delay (a factor which depends upon the position of the bottleneck), the switch scheme used, and background variable bit rate (VBR) traffic. It is shown that the buffer requirement for TCP over ABR is independent of the number of TCP sources, but depends on the aforementioned factors. For the UBR service, we show that the buffer requirement is the sum of the TCP receiver window sizes. We substantiate our arguments with simulation results.<|reference_end|> | arxiv | @article{kalyanaraman1998performance,
title={Performance of TCP/IP Using ATM ABR and UBR Services over Satellite
Networks},
author={Shiv Kalyanaraman, Raj Jain, Rohit Goyal, Sonia Fahmy and Seong-Cheol
Kim},
journal={arXiv preprint arXiv:cs/9809074},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809074},
primaryClass={cs.NI}
} | kalyanaraman1998performance |
arxiv-676094 | cs/9809075 | On Source Rules for ABR Service on ATM Networks with Satellite Links | <|reference_start|>On Source Rules for ABR Service on ATM Networks with Satellite Links: During the design of ABR traffic management at the ATM Forum, we performed several analyses to ensure that the ABR service will operate efficiently over satellite links. In the cases where the performance was unacceptable, we suggested modifications to the traffic management specifications. This paper describes one such issue related to the count of missing resource management cells (Crm) parameter of the ABR source behavior. The analysis presented here led to the changes which are now part of the ATM traffic management (TM 4.0) specification. In particular, the size of the transient buffer exposure (TBE) parameter was set to 24 bits, and no size was enforced for the Crm parameter. This simple change improved the throughput over OC-3 satellite links from 45 Mbps to 140 Mbps.<|reference_end|> | arxiv | @article{fahmy1998on,
title={On Source Rules for ABR Service on ATM Networks with Satellite Links},
author={Sonia Fahmy, Raj Jain, Shivkumar Kalyanaraman, Rohit Goyal, and Fang
Lu},
journal={arXiv preprint arXiv:cs/9809075},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809075},
primaryClass={cs.NI}
} | fahmy1998on |
arxiv-676095 | cs/9809076 | A Survey of Congestion Control Techniques and Data Link Protocols in Satellite Networks | <|reference_start|>A Survey of Congestion Control Techniques and Data Link Protocols in Satellite Networks: Satellite communication systems are the means of realizing a global broadband integrated services digital network. Due to the statistical nature of the integrated services traffic, the resulting rate fluctuations and burstiness render congestion control a complicated, yet indispensable function. The long propagation delay of the earth-satellite link further imposes severe demands and constraints on the congestion control schemes, as well as the media access control techniques and retransmission protocols that can be employed in a satellite network. The problems in designing satellite network protocols, as well as some of the solutions proposed to tackle these problems, will be the primary focus of this survey.<|reference_end|> | arxiv | @article{fahmy1998a,
title={A Survey of Congestion Control Techniques and Data Link Protocols in
Satellite Networks},
author={Sonia Fahmy, Raj Jain, Fang Lu, and Shivkumar Kalyanaraman},
journal={arXiv preprint arXiv:cs/9809076},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809076},
primaryClass={cs.NI}
} | fahmy1998a |
arxiv-676096 | cs/9809077 | Source Behavior for ATM ABR Traffic Management: An Explanation | <|reference_start|>Source Behavior for ATM ABR Traffic Management: An Explanation: The Available Bit Rate (ABR) service has been developed to support data applications over Asynchronous Transfer Mode (ATM) networks. The network continuously monitors its traffic and provides feedback to the source end systems. This paper explains the rules that the sources have to follow to achieve a fair and efficient allocation of network resources.<|reference_end|> | arxiv | @article{jain1998source,
title={Source Behavior for ATM ABR Traffic Management: An Explanation},
author={Raj Jain, Shiv Kalyanaraman, Sonia Fahmy, Rohit Goyal, S. Kim},
journal={arXiv preprint arXiv:cs/9809077},
year={1998},
doi={10.1109/35.544194},
archivePrefix={arXiv},
eprint={cs/9809077},
primaryClass={cs.NI}
} | jain1998source |
arxiv-676097 | cs/9809078 | Buffer Requirements For TCP/IP Over ABR | <|reference_start|>Buffer Requirements For TCP/IP Over ABR: We study the buffering requirements for zero cell loss for TCP over ABR. We show that the maximum buffers required at the switch is proportional to the maximum round trip time (RTT) of all VCs through the link. The number of round-trips depends upon the the switch algorithm used. With our ERICA [erica-final] switch algorithm, we find that the buffering required is independent of the number of TCP sources. We substantiate our arguments with simulation results.<|reference_end|> | arxiv | @article{kalyanaraman1998buffer,
title={Buffer Requirements For TCP/IP Over ABR},
author={Shiv Kalyanaraman, Raj Jain, Sonia Fahmy, and Rohit Goyal},
journal={arXiv preprint arXiv:cs/9809078},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809078},
primaryClass={cs.NI}
} | kalyanaraman1998buffer |
arxiv-676098 | cs/9809079 | Potential Networking Applications of Global Positioning Systems (GPS) | <|reference_start|>Potential Networking Applications of Global Positioning Systems (GPS): The main goal of this study was to survey current applications of GPS to distributed systems and networks. Detailed lists of GPS products, current applications, addresses of manufacturers, and sources for further information are included in this report.<|reference_end|> | arxiv | @article{dommety1998potential,
title={Potential Networking Applications of Global Positioning Systems (GPS)},
author={G. Dommety and Raj Jain},
journal={arXiv preprint arXiv:cs/9809079},
year={1998},
number={TR-24, April 1996},
archivePrefix={arXiv},
eprint={cs/9809079},
primaryClass={cs.NI}
} | dommety1998potential |
arxiv-676099 | cs/9809080 | The OSU Scheme for Congestion Avoidance in ATM networks Using Explicit Rate Indication | <|reference_start|>The OSU Scheme for Congestion Avoidance in ATM networks Using Explicit Rate Indication: An explicit rate indication scheme for congestion avoidance in computer and telecommunication networks is proposed. The sources monitor their load and provide the information periodically to the switches. The switches, in turn, compute the load level and ask the sources to adjust their rates up or down. The scheme achieves high link utilization, fair allocation of rates among contending sources and provides quick convergence. A backward congestion notification option is also provided. The conditions under which this option is useful are indicated.<|reference_end|> | arxiv | @article{jain1998the,
title={The OSU Scheme for Congestion Avoidance in ATM networks Using Explicit
Rate Indication},
author={Raj Jain, Shiv Kalyanaraman, Ram Viswanathan},
journal={arXiv preprint arXiv:cs/9809080},
year={1998},
archivePrefix={arXiv},
eprint={cs/9809080},
primaryClass={cs.NI}
} | jain1998the |
arxiv-676100 | cs/9809081 | Optimal Point Placement for Mesh Smoothing | <|reference_start|>Optimal Point Placement for Mesh Smoothing: We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using generalized linear programming. We also give efficient algorithms for some mesh smoothing problems that do not fit into the generalized linear programming paradigm.<|reference_end|> | arxiv | @article{amenta1998optimal,
title={Optimal Point Placement for Mesh Smoothing},
author={Nina Amenta, Marshall Bern, David Eppstein},
journal={J. Algorithms 30 (1999) 302-322},
year={1998},
doi={10.1006/jagm.1998.0984},
archivePrefix={arXiv},
eprint={cs/9809081},
primaryClass={cs.CG}
} | amenta1998optimal |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.