Permutation tests are useful for drawing inferences from imaging data because of their flexibility and ability to capture features of the brain under minimal assumptions. However, most implementations of permutation tests ignore important confounding covariates. To employ covariate control in a nonparametric setting we have developed a Markov chain Monte Carlo (MCMC) algorithm for conditional p...

This paper proposes a new approach for image encryption using a combination of different permutation techniques. The main idea behind the present work is that an image can be viewed as an arrangement of bits, pixels and blocks. The intelligible information present in an image is due to the correlations among the bits, pixels and blocks in a given arrangement. This perceivable information can be...

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.

Recently, permutation based indexes have attracted interest in the area of similarity search. The basic idea of permutation based indexes is that data objects are represented as appropriately generated permutations of a set of pivots (or reference objects). Similarity queries are executed by searching for data objects whose permutation representation is similar to that of the query, following t...

Article history: Received 23 January 2010 Received in revised form 23 April 2010 Accepted 26 April 2010 Available online 26 April 2010 During the past two decades, there have been increasing interests on permutation flow shop with different types of objective functions such as minimizing the makespan, the weighted mean flow-time etc. The permutation flow shop is formulated as a mixed integer pr...

In this paper, we cryptanalyze two knapsack cryptosystems. The first one is proposed by Hwang et al [4], which is based on a new permutation algorithm named Permutation Combination Algorithm. We show that this permutation algorithm is useless to the security of the cryptosystem. Because of the special super increasing structure, we can break this cryptosystem use the method provided by Shamir a...

This paper presents a mathematical programming model for optimal pavement rehabilitation planning. The model maximized the rehabilitation area through a newly developed permutation algorithm, based on the procedures outlined in the harmony search (HS) algorithm. Additionally, the proposed algorithm was based on an optimal solution method for the problem of multilocation rehabilitation activitie...

Linkage disequilibrium (LD) between tightly linked loci provides fine mapping information of disease-predisposing allelic variants. The most common method of LD analysis involves unrelated cases and controls. We have previously proposed model-free and permutation tests for diseases with unknown mode of inheritance that can be applied to several highly polymorphic loci. However, performing such ...

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.