We introduce a new algorithm to compute up to conjugacy the maximal subgroups of a finite permutation group. Or method uses a “hybrid group” approach; that is, we first compute a large solvable normal subgroup of the given permutation group and then use this to split the computation in various parts. 1991 Mathematics Subject Classification: primary 20B40, 20-04, 20E28; secondary 20B15, 68Q40

In this study, we introduced a new memristive chaotic system with the rich dynamic behavior, and then proposed chaotic-based image encryption scheme which is based on permutation–confusion–substitution structure. our scheme, Hamming distance used to design plain-related initial condition, generated sequences are assigned permutation, diffusion, substitution stages. permutation stage, an effect ...

Permutation distribution clustering is a complexity-based approach to clustering time series. The dissimilarity of time series is formalized as the squared Hellinger distance between the permutation distribution of embedded time series. The resulting distance measure has linear time complexity, is invariant to phase and monotonic transformations, and robust to outliers. A probabilistic interpre...

A permutation class is splittable if it is contained in the merge of two of its proper subclasses. We characterise the unsplittable subclasses of the class of separable permutations both structurally and in terms of their bases.

A complete set of filters Fn for the optimal-depth n-input sorting network problem is such that if there exists an n-input sorting network of depth d then there exists one of the form C ⊕ C′ for some C ∈ Fn. Previous work on the topic presents a method for finding complete set of filters Rn,1 and Rn,2 that consists only of networks of depths one and two respectively, whose outputs are minimal a...

Permutation source codes are a class of structured vector quantizers with a computationally-simple encoding procedure. In this thesis, we provide two extensions that preserve the computational simplicity but yield improved operational rate–distortion performance. In the first approach, the new class of vector quantizers has a codebook comprising several permutation codes as subcodes. Methods fo...

Random forests are a commonly used tool for classification with high-dimensional data as well as for ranking candidate predictors based on the so-called variable importance measures. There are different importance measures for ranking predictor variables, the two most common measures are the Gini importance and the permutation importance. The latter has been found to be more reliable than the G...

The inter-wire spacing in a VLSI chip becomes closer as the VLSI fabrication technology rapidly evolves. Accordingly, it becomes important to minimize crosstalk caused by the coupling capacitance between adjacent wires in the layout design for the fast and safe VLSI circuits. We present a simulated annealing approach based on segment rearrangement to crosstalk minimization in an initially gridd...

We consider the problem of testing each of m null hypotheses with a sequential permutation procedure in which the number of draws from the permutation distribution of each test statistic is a random variable. Each sequential permutation p-value has a null distribution that is nonuniform on a discrete support. We show how to use a collection of such p-values to estimate the number of true null h...