This paper describes a method for solving the permutation problem in blind source separation (BSS) by frequencydomain independent component analysis (FD-ICA). FDICA is a well-known method for BSS of convolutive mixtures. However, FD-ICA has a source permutation problem, where estimated source components can become swapped at different frequencies. Many researchers have suggested methods to solv...

Permutation p-values have been widely used to assess the significance of linkage or association in genetic studies. However, the application in largescale studies is hindered by a heavy computational burden. We propose a geometric interpretation of permutation p-values, and based on this geometric interpretation, we develop an efficient permutation p-value estimation method in the context of re...

Permutation p-values have been widely used to assess the significance of linkage or association in genetic studies. However, the application in largescale studies is hindered by a heavy computational burden. We propose a geometric interpretation of permutation p-values, and based on this geometric interpretation, we develop an efficient permutation p-value estimation method in the context of re...

Biomedical researchers often encounter the large-p-small-n situations-a great number of variables are measured/recorded for only a few subjects. The authors propose a fuzzy permutation method to address the multiple testing problem for small sample size studies. The method introduces fuzziness into standard permutation analysis to produce randomized p-values, which are then converted into q-val...

A permutation with no fixed points is called a derangement.The subset $mathcal{D}$ of a permutation group is derangement if all elements of $mathcal{D}$ are derangement.Let $G$ be a permutation group, a derangementgraph is one with vertex set $G$ and derangement set $mathcal{D}$ as connecting set. In this paper, we determine the spectrum of derangement graphs of order a product of three primes.

This paper describes a method for solving the permutation problem in blind source separation (BSS) by frequencydomain independent component analysis (FD-ICA). FD-ICA is a well-known method for BSS of convolutive mixtures. However, FD-ICA has a source permutation problem, where estimated source components can become swapped at different frequencies. Many researchers have suggested methods to sol...

Introduction Terminology and notation Group Actions and Permutation Characters Method 1 References Finite Groups, Designs and Codes J Moori School of Mathematical Sciences, University of KwaZulu-Natal Pietermaritzburg 3209, South Africa ASI, Opatija, 31 May –11 June 2010 J Moori, ASI 2010, Opatija, Croatia Groups, Designs and Codes Abstract Introduction Terminology and notation Group Actions an...

First, an ordinal representation scheme for permutations is defined. Next, an “unranking” algorithm that can generate a permutation of n items according to its ordinal representation is designed. By using this algorithm, all permutations can be systematically generated in lexicographic order. Finally, a “ranking” algorithm that can convert a permutation to its ordinal representation is designed...

In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...