I present a method for quickly performing multiple nonparametric two-sample permutation tests on continuous data in SAS, even when one sample is large. I maximize statistical power (within the context of a crude Monte Carlo approach) by “oversampling” – drawing more permutation samples than desired, deleting duplicates, and then selecting the desired number of samples from the remainder. I dete...

Voxel-based lesion-symptom mapping (VLSM) is an important method for basic and translational human neuroscience research. VLSM leverages modern neuroimaging analysis techniques to build on the classic approach of examining the relationship between location of brain damage and cognitive deficits. Testing an association between deficit severity and lesion status in each voxel involves very many i...

Permutation codes have recently garnered substantial research interest due to their potential in various applications including cloud storage systems, genome resequencing and flash memories. In this paper, we study the theoretical bounds and constructions of permutation codes in the generalized Cayley metric. The generalized Cayley metric captures the number of generalized transposition errors ...

Compressed Sensing (CS) is a novel sampling paradigm that tries to take data-compression concepts down to the sampling layer of a sensory system. It states that discrete compressible signals are recoverable from sub-sampled data, when the data vector is acquired by a special linear transform of the original discrete signal vector. Distributed sampling problems especially in Wireless Sensor Netw...

We consider the function m[k](q) that counts the number of cycle permutations of a finite field Fq of fixed length k such that their permutation polynomial has the smallest possible degree. We prove the upper–bound m[k](q) ≤ (k−1)!(q(q−1))/k for char(Fq) > e(k−3)/e and the lower–bound m[k](q) ≥ φ(k)(q(q−1))/k for q ≡ 1 (mod k). This is done by establishing a connection with the Fq–solutions of ...

‎In this work‎, ‎a regular polygon with $n$ sides is described by a periodic (circular) sequence with period $n$‎. ‎Each element of the sequence represents a vertex of the polygon‎. ‎Each symmetry of the polygon is the rotation of the polygon around the center-point and/or flipping around a symmetry axis‎. ‎Here each symmetry is considered as a system that takes an input circular sequence and g...

The size of a Reduced Ordered Binary Decision Diagram (ROBDD) is directly influenced by the variables ordering technique used to build the ROBDD. Therefore various variables ordering techniques have been proposed to minimize the size of BDDs. Unfortunately there is no unique method that can be used to obtain the least number of nodes for all BDDs. In this paper we propose two new methods based ...

This paper presents an improved parallel hash-based join algorithm on a hypercube computer in the presence of double skew. We describe a load balancing technique to evenly distribute both join relations across all processors in order to deal with double skew eeectively. Moreover, we propose a permutation join method which reduces main memory requirement for the local join operation in the previ...

Frequency domain blind source separation has the great advantage that the complicated convolution in time domain becomes multiple efficient multiplications in frequency domain. However, the inherent ambiguity of permutation of ICA becomes an important problem that the separated signals at different frequencies may be permuted in order. Mapping the separated signal at each frequency to a target ...

A recent paper by Eklund et al. (2012) showed that up to 70% false positive results may occur when analyzing functional magnetic resonance imaging (fMRI) data using the statistical parametric mapping (SPM) software, which may mainly be caused by insufficient compensation for the temporal correlation between successive scans. Here, we show that a blockwise permutation method can be an effective ...