### Une Table d’Association d’Intervalles

"... ABSTRACT. This article describes an efficient persistent mergeable data structure for mapping intervals to values. We call this data structure rangemap. We provide an example of application where the need for such a data structure arises (abstract interpretation of programs with pointer casts). We d ..."

Abstract
- Add to MetaCart

(Show Context)
ABSTRACT. This article describes an efficient persistent mergeable data structure for mapping intervals to values. We call this data structure rangemap. We provide an example of application where the need for such a data structure arises (abstract interpretation of programs with pointer casts). We detail different solutions we have considered and dismissed before reaching the solution of rangemaps. We show how they solve the initial problem. We then describe their implementation and, as a conclusion, mention further work we would like to do. RÉSUMÉ. Cet article décrit une structure de données représentant efficacement des tables d’associations persistantes indexées par des intervalles, ayant la propriété supplémentaire d’être fusionnable. Nous nommons (en anglais) rangemap cette structure de données. Nous donnons un exemple de circonstances dans lesquelles se rencontre le besoin d’associer de cette façon des valeurs à des intervalles (analyse par interprétation abstraite de programmes comportant des conversions de pointeurs). Nous détaillons différentes solutions envisagées puis écartées avant d’arriver à la solution des rangemaps. Nous montrons ensuite comment ceux-ci résolvent le problème initial. Enfin, nous décrivons leur implémentation avant d’évoquer les travaux en cours et futurs que nous nous proposons de mener à ce sujet.

### Scalable I/O Event Handling for GHC Bryan O’Sullivan Serpentine

"... We have developed a new, portable I/O event manager for the Glasgow Haskell Compiler (GHC) that scales to the needs of modern server applications. Our new code is transparently available to existing Haskell applications. Performance at lower concurrency levels is comparable with the existing impleme ..."

Abstract
- Add to MetaCart

(Show Context)
We have developed a new, portable I/O event manager for the Glasgow Haskell Compiler (GHC) that scales to the needs of modern server applications. Our new code is transparently available to existing Haskell applications. Performance at lower concurrency levels is comparable with the existing implementation. We support millions of concurrent network connections, with millions of active timeouts, from a single multithreaded program, levels far beyond those achievable with the current I/O manager. In addition, we provide a public API to developers who need to create event-driven network applications. Categories and Subject Descriptors D.3.2 [Programming Languages]: Language Classifications—Applicative (functional) languages;

### Rapid Multi-Robot Exploration with Topometric Maps

"... Abstract — Multi-robot map building has advanced to the point where high quality occupancy grid data may be collected by multiple robots collaborating with only intermittent connectivity. However, the tasking of these agents to most efficiently build the map is a problem that has seen less attention ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract — Multi-robot map building has advanced to the point where high quality occupancy grid data may be collected by multiple robots collaborating with only intermittent connectivity. However, the tasking of these agents to most efficiently build the map is a problem that has seen less attention. Unfamiliar, highly cluttered environments can confound exploration strategies that rely solely on occupancy grid frontier identification or even semantic classification methods keyed on geometric features. To reason about partial maps of novel, highly cluttered locations, hypotheses about significant structure in the disposition of free space may be used to guide exploration task assignment. A parsing of map data into places with semantic significance to the exploration task provides a foundation from which one may infer an efficient exploration strategy. (a) (b)

### The performance of Haskell CONTAINERS package

"... In this paper, we perform a thorough performance analysis of the CONTAINERS package, a de facto standard Haskell containers library, comparing it to the most of existing alternatives. We then significantly improve its performance, making it comparable to the best implementations available. Additiona ..."

Abstract
- Add to MetaCart

(Show Context)
In this paper, we perform a thorough performance analysis of the CONTAINERS package, a de facto standard Haskell containers library, comparing it to the most of existing alternatives. We then significantly improve its performance, making it comparable to the best implementations available. Additionally, we describe a new persistent data structure based on hashing, which offers the best performance out of available data structures containing Strings and ByteStrings.

### ABSTRACT Fast Construction of Overlay Networks

"... An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly through an underlying network, but each participating node initially has pointers to only a handful of other participants. ..."

Abstract
- Add to MetaCart

(Show Context)
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly through an underlying network, but each participating node initially has pointers to only a handful of other participants. The output of the mechanism is a linked list of all participants sorted by their identifiers, which can be used as a foundation for building various linear overlay networks such as Chord or skip graphs. Assuming the initial pointer graph is weakly-connected with maximum degree d and the length of a node identifier is W, the mechanism constructs a binary search tree of nodes of depth O(W) in expected O(W log n) time using expected O((d+W)nlog n) messages of size O(W) each. Furthermore, the algorithm has low contention: at any time there are only O(d) undelivered messages for any given recipient. A lower bound of Ω(d + log n) is given for the running time of any procedure in a related synchronous model that yields a sorted list from a degree-d weakly-connected graph of n nodes. We conjecture that this lower bound is tight and could be attained by further improvements to our algorithms. Categories and Subject Descriptors

### Data Reduction and Exact Algorithms for Clique

"... To cover the edges of a graph with a minimum number of cliques is an NP-hard problem with many applications. We develop for this problem efficient and effective polynomial-time data reduction rules that, combined with a search tree algorithm, allow for exact problem solutions in competitive time. Th ..."

Abstract
- Add to MetaCart

(Show Context)
To cover the edges of a graph with a minimum number of cliques is an NP-hard problem with many applications. We develop for this problem efficient and effective polynomial-time data reduction rules that, combined with a search tree algorithm, allow for exact problem solutions in competitive time. This is confirmed by experiments with real-world and synthetic data. Moreover, we prove the fixed-parameter tractability of covering edges by cliques.

### unknown title

"... Abstract Cffml is a tool that turns a so-called "binding specification " into an Objective Caml compilation unit. A binding specification resembles an algebraic data type declaration, but also includes information about names and binding. Cffml is meant to help writers of interpret ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract Cffml is a tool that turns a so-called &quot;binding specification &quot; into an Objective Caml compilation unit. A binding specification resembles an algebraic data type declaration, but also includes information about names and binding. Cffml is meant to help writers of interpreters, compilers, or other programs-that-manipulate-programs deal with ff-conversion in a safe and concise style. This paper presents an overview of Cffml's binding specification language and of the code that Cffml produces.

### unknown title

"... Abstract Hash-consing is a technique to share values that are structurallyequal. Beyond the obvious advantage of saving memory blocks, hash-consing may also be used to speed up fundamental operationsand data structures by several orders of magnitude when sharing is maximal. This paper introduces an ..."

Abstract
- Add to MetaCart

(Show Context)
Abstract Hash-consing is a technique to share values that are structurallyequal. Beyond the obvious advantage of saving memory blocks, hash-consing may also be used to speed up fundamental operationsand data structures by several orders of magnitude when sharing is maximal. This paper introduces an OCAML hash-consing librarythat encapsulates hash-consed terms in an abstract datatype, thus safely ensuring maximal sharing. This library is also parameterizedby an equality that allows the user to identify terms according to an arbitrary equivalence relation. Categories and Subject Descriptors D.2.3 [Software engineer-ing]: Coding Tools and Techniques

### Abstract An

"... Cαml is a tool that turns a so-called “binding specification ” into an Objective Caml compilation unit. A binding specification resembles an algebraic data type declaration, but also includes information about names and binding. Cαml is meant to help writers of interpreters, compilers, or other prog ..."

Abstract
- Add to MetaCart

(Show Context)
Cαml is a tool that turns a so-called “binding specification ” into an Objective Caml compilation unit. A binding specification resembles an algebraic data type declaration, but also includes information about names and binding. Cαml is meant to help writers of interpreters, compilers, or other programs-that-manipulate-programs deal with α-conversion in a safe and concise style. This paper presents an overview of Cαml’s binding specification language and of the code that Cαml produces. Key words: Metaprogramming, variable binding, α-conversion 1