A trilingual dictionary Yilumbu–French–English : an ongoing project

In this article, an account is given of the planning of a trilingual dictionary Yilumbu– French–English. The focus is on the target user, the purpose, nature and typology of the planned dictionary. Attention is also paid to some macro- and microstructural issues. For example, all types of lexical items, including multiword lexical items, are given lemma status. Moreover all items are included according to the word tradition and on account of their usage frequency in the corpus. Apart from these aspects, types of dialectal forms as well as the type of special-field lexical items are also discussed. From a microstructural point of view, this article investigates different kinds of data types to be considered for inclusion in complex articles in particular. User-friendliness parameters and innovative access structure procedures also come into play.Cet article rend compte de la planification d'un dictionnaire trilingue yilumbu–français– anglais. Le centre d'intérêt réside au niveau du public cible, l'objectif, la nature et la typologie du dictionnaire proposé. Une attention est aussi accordée à quelques problèmes macro- et microstructurels. Par exemple, tous les types d'items lexicaux, y compris les items lexicaux formés de plusieurs mots, reçoivent le statut de lemme. En outre, tous les termes sont inclus selon la tradition dumot et sur la base de leur fréquence d'emploi dans le corpus. Hormis ces aspects, les types de formes dialectales ainsi que le type d'items lexicaux de spécialité sont également discutés. D'un point de vue microstructurel, cet article explore différents types de données à considérer pour inclusion dans les articles complexes en particulier. Les paramètres de clarté et de lisibilité ainsi que des procédés propre à la structure d'accès sont également pris en compte

Workload Equity in Vehicle Routing Problems: A Survey and Analysis

Over the past two decades, equity aspects have been considered in a growing number of models and methods for vehicle routing problems (VRPs). Equity concerns most often relate to fairly allocating workloads and to balancing the utilization of resources, and many practical applications have been reported in the literature. However, there has been only limited discussion about how workload equity should be modeled in VRPs, and various measures for optimizing such objectives have been proposed and implemented without a critical evaluation of their respective merits and consequences. This article addresses this gap with an analysis of classical and alternative equity functions for biobjective VRP models. In our survey, we review and categorize the existing literature on equitable VRPs. In the analysis, we identify a set of axiomatic properties that an ideal equity measure should satisfy, collect six common measures, and point out important connections between their properties and those of the resulting Pareto-optimal solutions. To gauge the extent of these implications, we also conduct a numerical study on small biobjective VRP instances solvable to optimality. Our study reveals two undesirable consequences when optimizing equity with nonmonotonic functions: Pareto-optimal solutions can consist of non-TSP-optimal tours, and even if all tours are TSP optimal, Pareto-optimal solutions can be workload inconsistent, i.e. composed of tours whose workloads are all equal to or longer than those of other Pareto-optimal solutions. We show that the extent of these phenomena should not be underestimated. The results of our biobjective analysis are valid also for weighted sum, constraint-based, or single-objective models. Based on this analysis, we conclude that monotonic equity functions are more appropriate for certain types of VRP models, and suggest promising avenues for further research.Comment: Accepted Manuscrip

Solving Set Constraint Satisfaction Problems using ROBDDs

In this paper we present a new approach to modeling finite set domain constraint problems using Reduced Ordered Binary Decision Diagrams (ROBDDs). We show that it is possible to construct an efficient set domain propagator which compactly represents many set domains and set constraints using ROBDDs. We demonstrate that the ROBDD-based approach provides unprecedented flexibility in modeling constraint satisfaction problems, leading to performance improvements. We also show that the ROBDD-based modeling approach can be extended to the modeling of integer and multiset constraint problems in a straightforward manner. Since domain propagation is not always practical, we also show how to incorporate less strict consistency notions into the ROBDD framework, such as set bounds, cardinality bounds and lexicographic bounds consistency. Finally, we present experimental results that demonstrate the ROBDD-based solver performs better than various more conventional constraint solvers on several standard set constraint problems

Bounds for DNA codes with constant GC-content

We derive theoretical upper and lower bounds on the maximum size of DNA codes of length n with constant GC-content w and minimum Hamming distance d, both with and without the additional constraint that the minimum Hamming distance between any codeword and the reverse-complement of any codeword be at least d. We also explicitly construct codes that are larger than the best previously-published codes for many choices of the parameters n, d and w.Comment: 13 pages, no figures; a few references added and typos correcte

Sub-Gaussian tail bounds for the width and height of conditioned Galton--Watson trees

We study the height and width of a Galton--Watson tree with offspring distribution B satisfying E(B)=1, 0 < Var(B) < infinity, conditioned on having exactly n nodes. Under this conditioning, we derive sub-Gaussian tail bounds for both the width (largest number of nodes in any level) and height (greatest level containing a node); the bounds are optimal up to constant factors in the exponent. Under the same conditioning, we also derive essentially optimal upper tail bounds for the number of nodes at level k, for 1 <= k <= n.Comment: 15 page