This paper is concerned with rank aggregation, which aims to combine multiple input rankings to get a better ranking. A popular approach to rank aggregation is based on probabilistic models on permutations, e.g., the Luce model and the Mallows model. However, these models have their limitations in either poor expressiveness or high computational complexity. To avoid these limitations, in this p...

In this paper an approach to identify delay phenomena from time series is developed. We show that it is possible to perform a reliable time delay identification by using quantifiers derived from information theory, more precisely, permutation entropy and permutation statistical complexity. These quantifiers show clear extrema when the embedding delay τ of the symbolic reconstruction matches the...

A number of fields, including the study of genome rearrangements and the design of interconnection networks, deal with the connected problems of sorting permutations in as few moves as possible, using a given set of allowed operations, or computing the number of moves the sorting process requires, often referred to as the distance of the permutation. These operations often act on just one or tw...

What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensional permutation of order n is an n × n × . . . n = [n]d+1 array of zeros and ones in which every line contains a unique 1 entry. A line here is a set of entries of the form {(x1, . . . , xi−1, y, xi+1, . . . , xd+1)|n ≥...

Let S be a subset of the positive integers, and let σ be a permutation of S. We say that σ is a k-avoiding permutation of S if σ does not contain any k-term AP as a subsequence. Similarly, the set S is said to be k-avoidable if there exists a k-avoiding permutation of S.

the recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. one of these methods is the ‘permutation method’ which has a strong logic in connection with ranking issues, but when the number of alternatives increases, solving problems through th...

Integrative analyses of genomic, epigenomic and transcriptomic features for human and various model organisms have revealed that many such features are nonrandomly distributed in the genome. Significant enrichment (or depletion) of genomic features is anticipated to be biologically important. Detection of genomic regions having enrichment of certain features and estimation of corresponding stat...

the group $2^6{{}^{cdot}} g_2(2)$ is a maximal subgroup of the rudvalis group $ru$ of index 188500 and has order 774144 = $2^{12}.3^3.7$. in this paper, we construct the character table of the group $2^6{{}^{cdot}} g_2(2)$ by using the technique of fischer-clifford matrices.

Mass univariate analysis is a relatively new approach for the study of ERPs/ERFs. It consists of many statistical tests and one of several powerful corrections for multiple comparisons. Multiple comparison corrections differ in their power and permissiveness. Moreover, some methods are not guaranteed to work or may be overly sensitive to uninteresting deviations from the null hypothesis. Here w...