Results 1 - 10 of 102

Multidimensional Analysis of Rankings Permutations

by Via Ponte Don Melillo
"... In this paper we illustrate an original approach to factorial analysis of rankings data. The proposed technique is based on the decomposition of the Spearman’s rank correlation matrix defined on a whole set of permutation. The properties of such correlation matrix will be discussed. The complete set ..."
Abstract - Add to MetaCart
In this paper we illustrate an original approach to factorial analysis of rankings data. The proposed technique is based on the decomposition of the Spearman’s rank correlation matrix defined on a whole set of permutation. The properties of such correlation matrix will be discussed. The complete

Separable d-permutations and guillotine partitions

by Andrei Asinowski, Toufik Mansour , 803
"... We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations and guillotine partitions of a box. In particular, a bijection ..."
Abstract - Add to MetaCart
We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula and explicit formula. We find a connection between multidimensional permutations and guillotine partitions of a box. In particular, a

Enumeration of Factorizable Multi-Dimensional Permutations

by Hao Zhang, Daniel Gildea
"... A d-dimensional permutation is a sequence of d + 1 permutations with the leading element being the identity permutation. It can be viewed as an alignment structure across d+1 sequences, or visualized as the result of permuting n hypercubes of (d+1) dimensions. We study the hierarchical decomposition ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
A d-dimensional permutation is a sequence of d + 1 permutations with the leading element being the identity permutation. It can be viewed as an alignment structure across d+1 sequences, or visualized as the result of permuting n hypercubes of (d+1) dimensions. We study the hierarchical

Heterogeneity � Outliers � Multidimensional scaling � Principal components � Permutation

by Yuanyuan Shen, Zhe Liu, Jurg Ott , 2010
"... Background/Aims: In human case-control association studies, population heterogeneity is often present and can lead to increased false-positive results. Various methods have been proposed and are in current use to remedy this situation. Methods: We assume that heterogeneity is due to a relatively sma ..."
Abstract - Add to MetaCart
small number of individuals whose allele frequencies differ from those of the remainder of the sample. For this situation, we propose a new method of handling heterogeneity by removing outliers in a controlled manner. In a coordinate system of the c largest principal components in multidimensional

c Birkhauser Verlag, Basel, 2010 Annals of Combinatorics Separable d-Permutations and Guillotine Partitions

by Andrei Asinowski, A. Asinowski, T. Mansour , 2008
"... AMS Subject Classication: 05A05, 05A15, 05C30 Abstract. We characterize separable multidimensional permutations in terms of forbidden pat-terns and enumerate them by means of generating function, recursive formula, and explicit for-mula. We nd a connection between multidimensional permutations and g ..."
Abstract - Add to MetaCart
AMS Subject Classication: 05A05, 05A15, 05C30 Abstract. We characterize separable multidimensional permutations in terms of forbidden pat-terns and enumerate them by means of generating function, recursive formula, and explicit for-mula. We nd a connection between multidimensional permutations

University of Alberta Parallel Sampling and Reconstruction with Permutation in Multidimensional Compressed Sensing

by Hao Fang, Omid Taheri, Lijie Huang, Maoling Wang, Qian Wang, Chunyan Wu, Yuan Yuan
"... The advent of compressed sensing provides a new way to sample and compress signals. In this thesis, a parallel compressed sensing architecture is proposed, which samples a twodimensional reshaped multidimensional signal column by column using the same sensing matrix. Compared to architectures that s ..."
Abstract - Add to MetaCart
The advent of compressed sensing provides a new way to sample and compress signals. In this thesis, a parallel compressed sensing architecture is proposed, which samples a twodimensional reshaped multidimensional signal column by column using the same sensing matrix. Compared to architectures

On multi-dimensional patterns

by Sergey Kitaev, Jakayla R. Robbins , 2008
"... We generalize the concept of pattern occurrence in permutations, words or matrices to that in n-dimensional objects, which are basically sets of (n + 1)-tuples. In the case n = 3, we give a possible interpretation of such patterns in terms of bipartite graphs. For zero-box patterns we study vanishin ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
We generalize the concept of pattern occurrence in permutations, words or matrices to that in n-dimensional objects, which are basically sets of (n + 1)-tuples. In the case n = 3, we give a possible interpretation of such patterns in terms of bipartite graphs. For zero-box patterns we study

On multi-dimensional patterns

by unknown authors , 2004
"... Abstract We generalize the concept of pattern occurrence in permutations, words or matrices to pattern occurrence in n-dimensional objects, which are basically sets of (n+1)-tuples. In the case n = 3, we give a possible interpretation of such patterns in terms of bipartite graphs. For zerobox patter ..."
Abstract - Add to MetaCart
Abstract We generalize the concept of pattern occurrence in permutations, words or matrices to pattern occurrence in n-dimensional objects, which are basically sets of (n+1)-tuples. In the case n = 3, we give a possible interpretation of such patterns in terms of bipartite graphs. For zerobox

Key-Words:- Tensor Product – WHT – Multidimensional Transforms – Modular Structures – Recursive Formulations – Permutation Matrices

by Ayman Elnaggar, Mokhtar Aboelaze
"... Abstract:- This paper presents a new recursive formulation for Walsh-Hadamard Transform (WHT) that allows the generation of higher order (longer size) multidimensional (m-d) WHT architectures from m2 lower order (shorter sizes) WHT architectures. Our methodology is based on manipulating tensor produ ..."
Abstract - Add to MetaCart
Abstract:- This paper presents a new recursive formulation for Walsh-Hadamard Transform (WHT) that allows the generation of higher order (longer size) multidimensional (m-d) WHT architectures from m2 lower order (shorter sizes) WHT architectures. Our methodology is based on manipulating tensor

Multidimensional Golden Means

by Peter G. Anderson - Proc. 1992 Conf. on Fibonacci Numbers & Their Applications , 1993
"... We investigate a geometric construction which yields periodic continued fractions and generalize it to higher dimensions. The simplest of these constructions yields a number which we call a two (or higher) dimensional golden mean, since it appears as a limit of ratios of a generalized Fibonacci sequ ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Carlo integration and image processing. In [2] we exploit the two-dimensional example to derive pixel permutations in order to produce computer graphics images rapidly. 1 1D: Probing the Line The golden mean, ø , can be represented as: p 5 \Gamma 1 2 = lim n!1 Fn\Gamma1 Fn = 1 1 + 1 1+ 1 1+ 1 1
Results 1 - 10 of 102