A number of fields, including genome rearrangements and interconnection network design, are concerned with sorting permutations in “as few moves as possible”, using a given set of allowed operations. These often act on just one or two segments of the permutation, e.g. by reversing one segment or exchanging two segments. The cycle graph of the permutation to sort is a fundamental tool in the the...

A major challenge in statistical machine translation is mitigating the word order differences between source and target strings. While reordering and lexical translation choices are often conducted in tandem, source string permutation prior to translation is attractive for studying reordering using hierarchical and syntactic structure. This work contributes an approach for learning source strin...

For a (standard) Young tableau T on [k], say that a tableau T ′ on [n] contains T as a subtableau if the cells of T ′ containing the elements of [k] are arranged as in T . McKay, Morse, and Wilf recently introduced the idea of quasirandom permutations and used this to find the limiting probability (as n → ∞) that a tableau on [n] contains a given tableau on [k] as a subtableau. Stanley then use...

In this paper, we use the exact model (or dynamical system approach) to describe the standard evolutionary algorithm (EA) as a discrete dynamical system for dynamic optimization problems (DOPs). Based on this dynamical system model, we analyse the properties of the XOR DOP Generator, which has been widely used by researchers to create DOPs from any binary encoded problem. DOPs generated by this...

The paper considers the necessity conditions for the existence of many-one destination graphs in multi-link hypercubes. It is shown that many-one modular destination graphs for minimum routing exist for dimensions five and six in the two-link hypercube, and also for dimension seven in the three-link hypercube. The combination of two many-one modular graphs forms a new modular graph for invarian...

The recent popularity of genetic algorithms (GA’s) and their application to a wide range of problems is a result of their ease of implementation and flexibility. Evolutionary techniques are often applied to optimization and related search problems where the fitness of a possible result is easily established. Although many landscapes are searched quickly, there are those, such as permutation lan...

This paper investigates an approach to the permutation flowshop scheduling problem based on Tabu Search with an additional memory structure called a ‘pruning pattern list’. The pruning pattern list approach allows a better use of the critical block information. A solution of the flowshop scheduling problem is represented by a permutation of job numbers. A pruning pattern is generated from a sol...

In this paper, a novel approach to solve the permutation indeterminacy in the separation of convolved mixtures in frequency domain is proposed. A fixed-point algorithm in complex domain is used to separate the signals in each frequency bin. These are obtained applying a Short Time Fourier Transform on a set of fixed frames. To solve the ambiguity of the amplitude dilation, a simple method is pr...

In recent years, digital watermarking has become a popular technique for hiding information in digital images to help protect against copyright infringement. In this paper we develop a high quality and robust watermarking algorithm that combines the advantages of block-based permutation with that of neighboring coefficient embedding. The proposed approach uses the relationship between the coeff...

The number of contiguous voxels activated in a brain image can differ between groups or conditions even though the amplitude of activation does not markedly differ. Existing techniques test for differences in amplitude given that extent (number of contiguous voxels) exceeds some threshold. We present a technique that tests for differences in extent of activation given that amplitude of activati...