AbstractCombinatorial designs provide an interesting source of optimization problems. Among them, permutation codes are particularly given their applications in powerline communications, flash memories, and block ciphers. This paper addresses the design by evolutionary algorithms (EA) developing iterative approach. Starting from a single random permutation, new permutations satisfying minimum d...

The current study focuses on the problem of determining investment attrаctiveness of countries by means of monitoring regional stock markets. The method of using the permutation entropy as a model of investment attractiveness estimation is suggested. We have calculated the permutation entropy for the time series of stock markets of countries for the period from 2005 to 2018. The countries with ...

We develop a general framework to prove Krafttype inequalities for prefix-free permutation codes for source coding with various notions of permutation code and prefix. We also show that the McMillan-type converse theorem in most of these cases does not hold, and give a general form of a counterexample. Our approach is more general and works for other structures besides permutation codes. The cl...

This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That representation allows us to answer adjacency queries in O(1) time. The approach is based on a fully dynamic modular decomposition algorithm for permutation graphs that works in O(n) time per edge and vertex modification. We...

This paper deals with the amount of disorder that is left in a permutation after one of its elements has been selected with quickselect with or without median-of-three pivoting. Five measures of disorder are considered: inversions, cycles of length less than or equal to some m, cycles of any length, expected cycle length, and the distance to the identity permutation. “Grand averages” for each m...

Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, JHAE, that is provably secure in the ideal permutation model. The scheme does not require the in...

Linkage analysis in multivariate or longitudinal context presents both statistical and computational challenges. The permutation test can be used to avoid some of the statistical challenges, but it substantially adds to the computational burden. Utilizing the distributional dependencies between p (defined as the proportion of alleles at a locus that are identical by descent (IBD) for a pairs of...

BACKGROUND AND PURPOSE Developing improved methods for analysis of the modified Rankin Scale (mRS) remains a critical issue for the stroke research community. A recently proposed permutation-based approach is assumption-free and easily interpretable but computationally intensive and does not provide confidence intervals to quantify the precision of the effect size estimate. We aimed to develop ...

We propose a new approach to commutative watermarkingencryption (CWE). A permutation cipher is used to encrypt the multimedia data, which leaves the global statistics of the multimedia data intact. Therefore, any non-localized watermarking scheme that depends only on global statistics of the multimedia data can be combined with the permutation cipher to form a CWE scheme. We demonstrate this ap...

This paper presents a new statistical surface analysis framework that aims to accurately and efficiently localize regionally specific shape changes between groups of 3D surfaces. With unknown distribution and small sample size of the data, existing shape morphometry analysis involves testing thousands of hypotheses for statistically significant effects through permutation. In this work, we deve...