The average cost of Duval's algorithm for generating all Lyndon words up to a given length in lexicographic order is proved to be asymptotically equal to (q + 1)=(q ? 1), where q is the size of the underlying alphabet. In particular, the average cost is independent of the length of the words generated. A precise evaluation of the constants is also given.

A k color n bead necklace is an equivalence class of k ary n tuples under rotation In this paper we analyze an algorithm due to Fredricksen Kessler and Maiorana FKM to show that necklaces can be generated in constant amortized time We also present a new approach to generating necklaces which we conjecture can also be implemented in constant amortized time The FKM algorithm generates a list of n...

We present a CAT (constant amortized time) algorithm for generating those partitions of n that are in the ice pile model IPMk(n), a generalization of the sand pile model SPM(n). More precisely, for any fixed integer k, we show that the negative lexicographic ordering naturally identifies a tree structure on the lattice IPMk(n): this lets us design an algorithm which generates all the ice piles ...

Duplication of image regions is a common method for manipulating original images using typical software like Adobe Photoshop. In this study, we propose a wavelet based feature representation scheme for detecting duplicated regions in images. This technique works by first applying multi-resolution wavelet decomposition to small fixed-sized image blocks. Normalized wavelet coefficients are then s...

This paper discusses the lexicographical concept of lexical functions (Mel'~uk and Zolkovsky, 1984) and their potential exploitation in the development of a machine translation lexicon designed to handle collocations. We show how lexical functions can be thought to reflect cross-linguistic meaning concepts for collocational structures and their translational equivalents, and therefore suggest t...

In this paper a new technique is presented which allows for the transformation of any extensional constraint network to an equivalent network which is in globally solved form with respect to a certain given variable ordering. This guarantees that all solutions can be found with backtracking without encountering “dead-ends.” The resulting network corresponds to a reduced Gröbner basis with respe...

In this paper we propose a hybrid algorithm for the set covering problem (SCP), which combines L-class enumeration, genetic algorithm (GA) and Lagrangean heuristic. The lexicographical enumeration of L-classes in the linear relaxation of SCP ensures optimality of the resulting solution. Both heuristics are used for obtaining the initial approximate solution. The linear subproblems in L-class en...

We use a lexicographical preference order on the problem space to combine solution synthesis with conflict learning. Given two preferred solutions of two subproblems, we can either combine them to a solution of the whole problem or learn a ‘fat’ conflict which cuts off a whole subtree. The approach makes conflict learning more pervasive for Constraint Programming as it well exploits efficient s...

In this article is presented a tool for labeling bilingual parallel corpora and aligning texts using heuristics based on word frequency, position and lexicographical similarity (using Edit Distance). Bilingual corpora annotation is a very laborious task but essential at the time of developing knowledge bases for the accomplishment of automatic translations between different languages. This tool...

We study a class of finite strategic games with the property that every deviation of a coalition of players that is profitable to each of its members strictly decreases the lexicographical order of a certain function defined on the set of strategy profiles. We call this property the lexicographical improvement property (LIP) and show that, in finite games, it is equivalent to the existence of a...