Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 8 of 8 for “"partial permutation"”.
-
PERMUTATION DECODING OF CODES FROM GRAPHS AND DESIGNS
Permutation decoding is a technique, developed by Jessie McWilliams in 1960's. It involves finding a set of automorphisms of the code, called a PD-set. If such a set exists and if the generator matrix of the code is in standard form then a simple algorithm using this set can be followed to correct …
-
Pseudovarieties of inverse monoids
… that the set of all rooted inverse graphs (partial permutation graphs) over X is in one-to-one correspondence with the set of all closed inverse submonoids of the free inverse monoid FIM(X). In this dissertation we consider applications of inverse automata to the study of groups and inverse …
-
On neural networks with equivariance or invariance property
… guidelines for designing neural networks with partial equivariance/invariance. To further investigate the characteristics of generalized convolutional neural networks, we then analyze the multiple equivariance case. The result shows the connection between model parameter sharing and equivariant …
-
Dynamical and topological tools for (modern) music analysis
… of counterpoint as a multivariate time series of partial permutation matrices, whose observations are characterised by a degree of complexity. After providing both a static and a dynamic representation of counterpoint, voice leadings are reinterpreted as a special class of partial singular braids …
-
On Partial Permutations and Alternating Sign Matrices: Bijections and Polytopes
Motivated by the study of chained permutations and alternating sign matrices, we investigate partial permutations and alternating sign matrices. We give a length generating function for partial permutations and show bijections relating certain subsets to decorated permutations and set partitions. …
-
Symmetric rearrangeable networks and algorithms
… designed for Benes networks implement a permutation of all inputs to find the routing tags for the requested inputoutput pairs, I proposed a new algorithm that can work for partial permutations. If the network load is defined as ρ, the mean number of active inputs in a partial permutation …
-
Robust motion segmentation with subspace constraints
… frames. We formulate this problem in terms of Partial Permutation Matrices (PPMs) and aim to match feature descriptors while simultaneously encouraging point trajectories to satisfy subspace constraints. This lets us handle outliers in both point locations and feature appearance. The resulting …