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 20 of 304 for “"permutation"”.
-
PermPAL - Permutation Pattern Avoidance Library
… (e. enumeration) á klösum umraðana (e. permutation classes) sem innihalda ekki mynstur út frá fléttufræðilegum (e. combinatorial) formgerðum (e. structure) sem skilgreind eru af reikniritunum Struct og ATRAP. Framleiðniföll og rakningarformúlur eru notuð til að reikna fjölda umraðana af …
-
Generalizations of permutation source codes
Permutation source codes are a class of structured vector quantizers with a computationally- simple encoding procedure. In this thesis, we provide two extensions that preserve the computational simplicity but yield improved operational rate-distortion performance. In the first approach, the new …
-
Security of substitution-permutation network
… of a block cipher design called substitution-permutation network (SPN). We prove that when S-box is chosen uniformly at random as a permutation, the resulting SPN is a strong pseudorandom permutation even against an adversary having oracle access to that S-box. We then examine some special …
-
Forced permutation patterns and applications to coincidence classification of mesh patterns and enumeration of permutation classes
Þessi ritgerð kynnir hugmyndina um nauðung á umraðanamynstur. Eftir að undirstöðukenningar um nauðungarmynstur hafa verið settar fram eru þessi mynstur notuð í samtilfellisflokkun á möskvamynstrum. Að lokum eru kynntar nýjar aðferðir sem nýta nauðungarmynstur í talningum á umraðanaflokkum. Þessar …
-
On The Growth Of Permutation Classes
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating function of any class whose matrix has dimensions m × 1 …
-
Communication complexity of permutation-invariant functions
… of simple functions, we introduce the class of "permutation-invariant" functions. A partial function f : {0, 1}n x {0, 1}n --> {0, 1, ?} is permutation-invariant if for every bijection [pi]: {1,..., n} --> {1,.. ., n} and every x, y [sum] {0, I}n, it is the case that f (x, y) = f (x[pi], y[pi]). …
-
Automatic discovery of descriptions of permutation statistics
The field of permutation statistics is an established subfield of combinatorics with connections to many other fields, such as genome rearrangements, computer science and physics. The definitions of these statistics can be something simple, like counting the occurrences of a classical pattern in …
-
Bottleneck-based heuristic for permutation flowshop scheduling
… propose and develop a new heuristic for solving permutation flowshop scheduling by considering four-machines and n-jobs (n = 6, 10, 15, 20). Three phases were applied into this study in order to boost the makespan performance of the proposed heuristic. Two phases (bottleneck identification phase …
-
On Transitive Extensions of Finite Permutation Groups
Made available in DSpace on 2014-12-09T22:17:42Z (GMT). No. of bitstreams: 1 6808174.pdf: 1871183 bytes, checksum: 5f59675435855a68e4ea06fada74470d (MD5) Previous issue date: 1967
-
Multiplicity-free permutation representations of the alternating groups
A transitive permutation representation of a finite group G is said to be multiplicity-free if each irreducible constituent of the associated permutation character of G occurs with multiplicity one. If H is a subgroup of G, then G acts naturally on the set of cosets of H. This action is transitive …
-
Single-trace template attacks on permutation-based cryptography
The Template Attack introduced by Chari, Rao, and Rohatgi has been widely used in Side-Channel Attacks on cryptographic algorithms running on microcontrollers. In 2014, Choudary and Kuhn successfully optimized a variant of this technique, based on Linear Discriminant Analysis (LDA), to reconstruct …
-
On evasiveness, permutation embeddings, and mappings on sequences.
Thesis. 1975. Ph.D.--Massachusetts Institute of Technology. Dept. of Mathematics.
-
On Doubly Transitive Permutation Groups of Degree 5q + 1
Made available in DSpace on 2014-12-14T13:09:24Z (GMT). No. of bitstreams: 1 7524280.pdf: 1954955 bytes, checksum: 424d08d81f193980776106ccec7374d1 (MD5) Previous issue date: 1975
-
On Doubly Transitive Permutation Groups of Degree Pq + 1
Made available in DSpace on 2014-12-14T13:09:36Z (GMT). No. of bitstreams: 1 7804122.pdf: 1490839 bytes, checksum: bf0fe5510e2c50d5cb972427eb5c8697 (MD5) Previous issue date: 1977
-
Non-Asymptotic 𝑡-Wise Independence of Substitution-Permutation Networks
… of block ciphers following the Substitution-Permutation Network design to prove resilience against cryptanalytic attacks and show non-asymptotic bounds for two widely-used ciphers. There are two main contributions of this thesis. In the first part of this thesis, we study the pairwise …
Page 1 of 16