Relevant bibliographies by topics / Permutation

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Permutation'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Permutation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Permutation"

1

Adamczak, William. "A Note on the Structure of Roller Coaster Permutations." Journal of Mathematics Research 9, no. 3 (May 24, 2017): 75. http://dx.doi.org/10.5539/jmr.v9n3p75.

Full text
Abstract:
In this paper we consider the structure of a special class of permutations known as roller coaster permutations, first introduced by Ahmed & Snevily (2013). A roller coaster permutation is described as, a permutation that maximizes the total switches from ascending to descending, or visa versa, for the permutation as well as all of its subpermutations, simultaneously. This paper looks at the structure of these permutations, particularly the alternating structure, what the entires of these permutations can look like, we then introduce a notion of a condition stronger than alternating that we shall refer to as recursively alternating.
APA, Harvard, Vancouver, ISO, and other styles
2

Wituła, Roman, Edyta Hetmaniok, and Damian Słota. "On Commutation Properties of the Composition Relation of Convergent and Divergent Permutations (Part I)." Tatra Mountains Mathematical Publications 58, no. 1 (March 1, 2014): 13–22. http://dx.doi.org/10.2478/tmmp-2014-0002.

Full text
Abstract:
Abstract In the paper we present the selected properties of composition relation of the convergent and divergent permutations connected with commutation. We note that a permutation on ℕ is called the convergent permutation if for each convergent series ∑an of real terms, the p-rearranged series ∑ap(n) is also convergent. All the other permutations on ℕ are called the divergent permutations. We have proven, among others, that, for many permutations p on ℕ, the family of divergent permutations q on ℕ commuting with p possesses cardinality of the continuum. For example, the permutations p on ℕ having finite order possess this property. On the other hand, an example of a convergent permutation which commutes only with some convergent permutations is also presented.
APA, Harvard, Vancouver, ISO, and other styles
3

Vidybida, Alexander K. "Calculating Permutation Entropy without Permutations." Complexity 2020 (October 22, 2020): 1–9. http://dx.doi.org/10.1155/2020/7163254.

Full text
Abstract:
A method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values, if any, in the embedding vectors; it is exempt from combinatorics; and it delivers the same entropy value as does the permutation method, provided the embedding vectors do not have equal components. In the latter case, this method can be used instead of the permutation one. If embedding vectors have equal components, this method could be more precise in discriminating between similar data sets.
APA, Harvard, Vancouver, ISO, and other styles
4

Steingrı́msson, Einar. "Permutation Statistics of Indexed Permutations." European Journal of Combinatorics 15, no. 2 (March 1994): 187–205. http://dx.doi.org/10.1006/eujc.1994.1021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Miranda, Guilherme Henrique Santos, Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer, and Zanoni Dias. "Approximation Algorithms for Sorting λ-Permutations by λ-Operations." Algorithms 14, no. 6 (June 1, 2021): 175. http://dx.doi.org/10.3390/a14060175.

Full text
Abstract:
Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the smallest number of rearrangements needed to transform one genome into another. By representing genomes as permutations, one of them can be represented as the identity permutation, and, so, we reduce the problem of transforming one permutation into another to the problem of sorting a permutation using the minimum number of rearrangements. This work investigates the problems of sorting permutations using reversals and/or transpositions, with some additional restrictions of biological relevance. Given a value λ, the problem now is how to sort a λ-permutation, which is a permutation whose elements are less than λ positions away from their correct places (regarding the identity), by applying the minimum number of rearrangements. Each λ-rearrangement must have size, at most, λ, and, when applied to a λ-permutation, the result should also be a λ-permutation. We present algorithms with approximation factors of O(λ2), O(λ), and O(1) for the problems of Sorting λ-Permutations by λ-Reversals, by λ-Transpositions, and by both operations.
APA, Harvard, Vancouver, ISO, and other styles
6

Bean, Christian, Émile Nadeau, Jay Pantone, and Henning Ulfarsson. "Using large random permutations to partition permutation classes." Pure Mathematics and Applications 30, no. 1 (June 1, 2022): 31–36. http://dx.doi.org/10.2478/puma-2022-0006.

Full text
Abstract:
Abstract Permutation classes are sets of permutations defined by the absence of certain substructures. In some cases permutation classes can be decomposed as unions of subclasses. We use combinatorial specifications automatically discovered by Combinatorial Exploration: An algorithmic framework for enumeration, Albert et al. 2022, to uniformly generate large random permutations in a permutation class, and apply clustering methods to partition them into interesting subclasses. We seek to automate as much of this process as possible.
APA, Harvard, Vancouver, ISO, and other styles
7

Brualdi, Richard A., and Geir Dahl. "Permutation Matrices, Their Discrete Derivatives and Extremal Properties." Vietnam Journal of Mathematics 48, no. 4 (March 24, 2020): 719–40. http://dx.doi.org/10.1007/s10013-020-00392-5.

Full text
Abstract:
AbstractFor a permutation π, and the corresponding permutation matrix, we introduce the notion of discrete derivative, obtained by taking differences of successive entries in π. We characterize the possible derivatives of permutations, and consider questions for permutations with certain properties satisfied by the derivative. For instance, we consider permutations with distinct derivatives, and the relationship to so-called Costas arrays.
APA, Harvard, Vancouver, ISO, and other styles
8

KRASILENKO, VLADIMIR, NATALIYA YURCHUK, and DIANA NIKITOVICH. "THE APPLICATION OF ISOMORPHIC MATRIX REPRESENTATIONS FOR MODELING THE PROTOCOL FOR THE FORMATION OF SECRET KEYS-PERMUTATIONS OF HUGE SIZES." HERALD OF KHMELNYTSKYI NATIONAL UNIVERSITY 295, no. 2 (May 2021): 78–88. http://dx.doi.org/10.31891/2307-5732-2021-295-2-78-88.

Full text
Abstract:
A The article considers the peculiarities of the application of isomorphic matrix representations for modeling the protocol of matching secret keys-permutations of significant dimension. The situation is considered when for cryptographic transformations of blocks with a length of 256 * 256 bytes, presented in the form of a matrix of a black-and-white image, it is necessary to rearrange all bytes in accordance with the matrix keys. To generate a basic matrix key and the appearance of the components KeyA and KeyB in the format of two black and white images, a software module using engineering mathematical software Mathcad is proposed. Simulations are performed, for example, with sets of fixed matrix representations. The essence of the protocol of coordination of the main matrix of permutations by the parties is considered. Also shown are software modules in Mathcad for accelerated methods that display the procedure of iterative permutations in a permutation matrix isomorphic to the elevation of the permutation matrix to the desired degree with a certain side, corresponding to specific bits of bits or other code representations of selected random numbers. It is demonstrated that the parties receive new permutation matrices after the first step of the protocol, those sent to the other party, and the identical new permutation matrices received by the parties after the second step of the protocol, ie the secret permutation matrix. Similar qualitative cryptographic transformations have been confirmed using the proposed representations of the permutation matrix based on the results of modeling matrix affine-permutation ciphers and multi-step matrix affine-permutation ciphers for different cases when the components of affine transformations are first executed in different sequences. , and then permutation using the permutation matrix, or vice versa. The model experiments performed in the study demonstrated the adequacy of the functioning of the models proposed by the protocol and methods of generating a permutation matrix and demonstrated their advantages.
APA, Harvard, Vancouver, ISO, and other styles
9

Mishin, Dmitry V., Anatoly A. Gladkikh, Vladislav I. Kutuzov, and Aqeel Latif Khudair. "Research of cognitive data processing in radio communication systems with permutation decoding." Physics of Wave Processes and Radio Systems 27, no. 1 (March 29, 2024): 103–12. http://dx.doi.org/10.18469/1810-3189.2024.27.1.103-112.

Full text
Abstract:
Background. The need to use permutation decoding tools in radio communication systems is explained by the increased error correction capabilities of this method. In this case, complex matrix calculations during the search for equivalent codes according to the classical scheme of permutation decoding are replaced by a list of ready-made solutions. These solutions are calculated a priori and entered into the cognitive cards of the decoder processor, which makes the method a convenient tool in the procedure for ensuring information reliability when controlling, for example, unmanned vehicles via radio channels. In fact, matrix calculations on board are replaced by searching the list of cognitive maps for the right solution corresponding in real time to the current permutation of reliable character numerators. However, data processing in the decoder’s cognitive map requires a special description. Aim. The study of methods for identifying permutations of character numerators of code vectors in order to effectively transform them in a system of cognitive maps of a permutation decoder. Methods. The paper reveals the subtle structure of cognitive maps of productive and unproductive permutations of numerators, which allows on a regular basis to obtain an alternative solution for switching to a set of productive permutations when the receiver receives an unproductive permutation, thereby excluding the use of trial and error. Results. The efficiency of the permutation decoder increases due to the implementation of permutations that were originally included in a set of solutions introduced into the cognitive map of unproductive permutations. Conclusion. A family of microcontrollers is proposed to implement the principle of interaction of cognitive maps with a system of alternative solutions.
APA, Harvard, Vancouver, ISO, and other styles
10

WANG, LI-YUAN, and HAI-LIANG WU. "APPLICATIONS OF LERCH’S THEOREM TO PERMUTATIONS OF QUADRATIC RESIDUES." Bulletin of the Australian Mathematical Society 100, no. 3 (July 10, 2019): 362–71. http://dx.doi.org/10.1017/s000497271900073x.

Full text
Abstract:
Let $n$ be a positive integer and $a$ an integer prime to $n$. Multiplication by $a$ induces a permutation over $\mathbb{Z}/n\mathbb{Z}=\{\overline{0},\overline{1},\ldots ,\overline{n-1}\}$. Lerch’s theorem gives the sign of this permutation. We explore some applications of Lerch’s result to permutation problems involving quadratic residues modulo $p$ and confirm some conjectures posed by Sun [‘Quadratic residues and related permutations and identities’, Preprint, 2018, arXiv:1809.07766]. We also study permutations involving arbitrary $k$th power residues modulo $p$ and primitive roots modulo a power of $p$.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Permutation"

1

Cox, Charles. "Infinite permutation groups containing all finitary permutations." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/401538/.

Full text
Abstract:
Groups naturally occu as the symmetries of an object. This is why they appear in so many different areas of mathematics. For example we find class grops in number theory, fundamental groups in topology, and amenable groups in analysis. In this thesis we will use techniques and approaches from various fields in order to study groups. This is a 'three paper' thesis, meaning that the main body of the document is made up of three papers. The first two of these look at permutation groups which contain all permutations with finite support, the first focussing on decision problems and the second on the R? property (which involves counting the number of twisting conjugacy classes in a group). The third works with wreath products C}Z where C is cyclic, and looks to dermine the probability of choosing two elements in a group which commute (known as the degree of commutativity, a topic which has been studied for finite groups intensely but at the time of writing this thesis has only two papers involving infinite groups, one of which is in this thesis).
APA, Harvard, Vancouver, ISO, and other styles
2

Neou, Both Emerite. "Permutation pattern matching." Thesis, Paris Est, 2017. http://www.theses.fr/2017PESC1239/document.

Full text
Abstract:
Cette thèse s'intéresse au problème de la recherche de motif dans les permutations, qui a pour objectif de savoir si un motif apparaît dans un texte, en prenant en compte que le motif et le texte sont des permutations. C'est-à-dire s'il existe des éléments du texte tel que ces éléments sont triés de la même manière et apparaissent dans le même ordre que les éléments du motif. Ce problème est NP complet. Cette thèse expose des cas particuliers de ce problème qui sont solvable en temps polynomial.Pour cela nous étudions le problème en donnant des contraintes sur le texte et/ou le motif. En particulier, le cas où le texte et/ou le motif sont des permutations qui ne contiennent pas les motifs 2413 et 3142 (appelé permutation séparable) et le cas où le texte et/ou le motif sont des permutations qui ne contiennent pas les motifs 213 et 231 sont considérés. Des problèmes dérivés de la recherche de motif et le problème de la recherche de motif bivinculaire sont aussi étudiés
This thesis focuses on permutation pattern matching problem, which askswhether a pattern occurs in a text where both the pattern and text are permutations.In other words, we seek to determine whether there exist elements ofthe text such that they are sorted and appear in the same order as the elementsof the pattern. The problem is NP-complete. This thesis examines particularcases of the problem that are polynomial-time solvable.For this purpose, we study the problem by giving constraints on the permutationstext and/or pattern. In particular, the cases in which the text and/orpattern are permutations in which the patterns 2413 and 3142 do not occur(also known as separable permutations) and in which the text and/or patternare permutations in which the patterns 213 and 231 do not occur (also known aswedge permutations) are also considered. Some problems related to the patternmatching and the permutation pattern matching with bivincular pattern arealso studied
APA, Harvard, Vancouver, ISO, and other styles
3

Cernes, John. "Ends of permutation groups and some centrality properties of permutational wreath products." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339282.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hyatt, Matthew. "Quasisymmetric Functions and Permutation Statistics for Coxeter Groups and Wreath Product Groups." Scholarly Repository, 2011. http://scholarlyrepository.miami.edu/oa_dissertations/609.

Full text
Abstract:
Eulerian quasisymmetric functions were introduced by Shareshian and Wachs in order to obtain a q-analog of Euler's exponential generating function formula for the Eulerian polynomials. They are defined via the symmetric group, and applying the stable and nonstable principal specializations yields formulas for joint distributions of permutation statistics. We consider the wreath product of the cyclic group with the symmetric group, also known as the group of colored permutations. We use this group to introduce colored Eulerian quasisymmetric functions, which are a generalization of Eulerian quasisymmetric functions. We derive a formula for the generating function of these colored Eulerian quasisymmetric functions, which reduces to a formula of Shareshian and Wachs for the Eulerian quasisymmetric functions. We show that applying the stable and nonstable principal specializations yields formulas for joint distributions of colored permutation statistics. The family of colored permutation groups includes the family of symmetric groups and the family of hyperoctahedral groups, also called the type A Coxeter groups and type B Coxeter groups, respectively. By specializing our formulas to these cases, they reduce to the Shareshian-Wachs q-analog of Euler's formula, formulas of Foata and Han, and a new generalization of a formula of Chow and Gessel.
APA, Harvard, Vancouver, ISO, and other styles
5

Urfer, Jean-Marie. "Modules d'endo-p-permutation /." [S.l.] : [s.n.], 2006. http://library.epfl.ch/theses/?nr=3544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kuzucuoglu, M. "Barely transitive permutation groups." Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.233097.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

BREGA, LEONARDO SANTOS. "COMPRESSION USING PERMUTATION CODES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4379@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
Em um sistema de comunicações, procura-se representar a informação gerada de forma eficiente, de modo que a redundância da informação seja reduzida ou idealmente eliminada, com o propósito de armazenamento e/ou transmissão da mesma. Este interesse justifica portanto, o estudo e desenvolvimento de técnicas de compressão que vem sendo realizado ao longo dos anos. Este trabalho de pesquisa investiga o uso de códigos de permutação para codificação de fontes segundo um critério de fidelidade, mais especificamente de fontes sem memória, caracterizadas por uma distribuição uniforme e critério de distorção de erro médio quadrático. Examina-se os códigos de permutação sob a ótica de fontes compostas e a partir desta perspectiva, apresenta-se um esquema de compressão com duplo estágio. Realiza-se então uma análise desse esquema de codificação. Faz-se também uma extensão L- dimensional (L > 1) do esquema de permutação apresentado na literatura. Os resultados obtidos comprovam um melhor desempenho da versão em duas dimensões, quando comparada ao caso unidimensional, sendo esta a principal contribuição do presente trabalho. A partir desses resultados, busca-se a aplicação de um esquema que utiliza códigos de permutação para a compressão de imagens.
In communications systems the information must be represented in an efficient form, in such a way that the redundancy of the information is either reduced or ideally eliminated, with the intention of storage or transmission of the same one. This interest justifies the study and development of compression techniques that have been realized through the years. This research investigates the use of permutation codes for source encoding with a fidelity criterion, more specifically of memoryless uniform sources with mean square error fidelity criterion. We examine the permutation codes under the view of composed sources and from this perspective, a project of double stage source encoder is presented. An analysis of this project of codification is realized then. A L-dimensional extension (L > 1) of permutation codes from previous research is also introduced. The results prove a better performance of the version in two dimensions, when compared with the unidimensional case and this is the main contribution of the present study. From these results, we investigate an application for permutation codes in image compression.
APA, Harvard, Vancouver, ISO, and other styles
8

Diene, Adama. "Structure of Permutation Polynomials." University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1123788311.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lajeunesse, Lisa (Lisa Marie) Carleton University Dissertation Mathematics and Statistics. "Models and permutation groups." Ottawa, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Fawcett, Joanna Bethia. "Bases of primitive permutation groups." Thesis, University of Cambridge, 2013. https://www.repository.cam.ac.uk/handle/1810/252304.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Permutation"

1

Passman, Donald S. Permutation groups. Mineola, N.Y: Dover Publications, Inc., 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mielke, Paul W., and Kenneth J. Berry. Permutation Methods. New York, NY: Springer New York, 2007. http://dx.doi.org/10.1007/978-0-387-69813-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Good, Phillip. Permutation Tests. New York, NY: Springer New York, 2000. http://dx.doi.org/10.1007/978-1-4757-3235-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dixon, John D., and Brian Mortimer. Permutation Groups. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Good, Phillip. Permutation Tests. New York, NY: Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4757-2346-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Linton, Steve, Nik Ruskuc, and Vincent Vatter, eds. Permutation Patterns. Cambridge: Cambridge University Press, 2009. http://dx.doi.org/10.1017/cbo9780511902499.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mielke, Paul W., and Kenneth J. Berry. Permutation Methods. New York, NY: Springer New York, 2001. http://dx.doi.org/10.1007/978-1-4757-3449-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bradbury, Ian Stuart. Permutation tests. Birmingham: University of Birmingham, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Permutation city. New York: HarperPrism, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Brian, Mortimer, ed. Permutation groups. New York: Springer, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Permutation"

1

Weik, Martin H. "permutation." In Computer Science and Communications Dictionary, 1251. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_13852.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dixon, John D., and Brian Mortimer. "The Basic Ideas." In Permutation Groups, 1–32. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Dixon, John D., and Brian Mortimer. "Examples and Constructions." In Permutation Groups, 33–64. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Dixon, John D., and Brian Mortimer. "The Action of a Permutation Group." In Permutation Groups, 65–105. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dixon, John D., and Brian Mortimer. "The Structure of a Primitive Group." In Permutation Groups, 106–42. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dixon, John D., and Brian Mortimer. "Bounds on Orders of Permutation Groups." In Permutation Groups, 143–76. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Dixon, John D., and Brian Mortimer. "The Mathieu Groups and Steiner Systems." In Permutation Groups, 177–209. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dixon, John D., and Brian Mortimer. "Multiply Transitive Groups." In Permutation Groups, 210–54. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dixon, John D., and Brian Mortimer. "The Structure of the Symmetric Groups." In Permutation Groups, 255–73. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dixon, John D., and Brian Mortimer. "Examples and Applications of Infinite Permutation Groups." In Permutation Groups, 274–301. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-0731-3_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Permutation"

1

Galvão, Gustavo Rodrigues, and Zanoni Dias. "Algorithms for Sorting by Reversals or Transpositions, with Application to Genome Rearrangement." In XXIX Concurso de Teses e Dissertações da SBC. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/ctd.2016.9145.

Full text
Abstract:
The problem of finding the minimum sequence of rearrangements that transforms one genome into another is a well-studied problem that finds application in comparative genomics. Representing genomes as permutations, in which genes appear as elements, that problem can be reduced to the combinatorial problem of sorting a permutation using a minimum number of rearrangements. Such combinatorial problem varies according to the types of rearrangements considered. The PhD thesis summarized in this paper presents exact, approximation, and heuristic algorithms for solving variants of the permutation sorting problem involving two types of rearrangements: reversals and transpositions.
APA, Harvard, Vancouver, ISO, and other styles
2

Matyushkin, Igor, and Pavel Rubis. "CELLULAR AUTOMATA ALGORITHMS FOR PSEUDORANDOM NUMBERS GENERATION." In International Forum “Microelectronics – 2020”. Joung Scientists Scholarship “Microelectronics – 2020”. XIII International conference «Silicon – 2020». XII young scientists scholarship for silicon nanostructures and devices physics, material science, process and analysis. LLC MAKS Press, 2020. http://dx.doi.org/10.29003/m1648.silicon-2020/354-357.

Full text
Abstract:
Work describes four permutation algorithms of square matrices based on cyclic rows and columns shifts. This choice of discrete transformation algorithms is justified by the convenience of the cellular automaton (CA) formulation. Output matrices can be considered as pseudo-random sequences of numbers. As a result of numerical calculation, empirical formulas are obtained for the permutation period and the function of the period of a single CA-cell on the order of the matrix n. As a parameter of CA dynamics, we analyze two "mixing metrics" on permutations of the matrix (compared to the initial matrix).
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Lusheng, and David Binet. "Best permutation." In the 2009 International Conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1582379.1582574.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Gurevich, Maxim, and Tamás Sarlós. "Permutation indexing." In the 22nd ACM international conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2505515.2505646.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Alsalem, Shuker, Abu F. Almusawi, and Enoch Suleiman. "On permutation G-part in permutation Q-algebras." In International Conference on Mathematical and Statistical Physics, Computational Science, Education, and Communication (ICMSCE 2022), edited by Lazim Abdullah and Norma bt Alias. SPIE, 2023. http://dx.doi.org/10.1117/12.2674993.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Alsalem, Shuker, Abu Firas Al Musawi, and Enoch Suleiman. "On Permutation Upper and Transitive Permutation BE-Algebras." In 2022 14th International Conference on Mathematics, Actuarial Science, Computer Science and Statistics (MACS). IEEE, 2022. http://dx.doi.org/10.1109/macs56771.2022.10022454.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Haney, Michael W. "Optoelectronic Shuffle-Exchange Network for Multiprocessor Architectures." In Photonic Switching. Washington, D.C.: Optica Publishing Group, 1991. http://dx.doi.org/10.1364/phs.1991.we19.

Full text
Abstract:
The perfect shuffle (PS) [1] is one of the most studied interconnection patterns for multiprocessor architectures. PS links are coupled to arrays of local 2×2 exchange/bypass switches to form shuffle/exchange networks. These networks perform arbitrary permutations of the elements in multistage interconnection networks for applications such as routing and sorting [2,3]. The PS of a 1-D array results by interleaving the elements of the first half of the array with those of the second half, with the first and last elements remaining unchanged in their position. For example, the PS of the 8 element array, {1,2,3,4,5,6,7,8}, is {1,5,2,6,3,7,4,8}. For a processing element (PE) array of size N, a single stage of a shuffle-exchange network contains a PS of size N followed by N/2 exchange/bypass units. Recently the sufficient number of stages required for an arbitrary permutation was proved to be no greater than 31og(N)-3 [4]. Therefore, the total number of active switches required in such permutation networks grows as Nlog(N). Thus, multistage permutation networks are appropriate for applications in which the number of elements is large enough to preclude the use of a crossbar switch, whose complexity would grow as N2.
APA, Harvard, Vancouver, ISO, and other styles
8

Etzel, Joset A. "MVPA Permutation Schemes: Permutation Testing for the Group Level." In 2015 International Workshop on Pattern Recognition in NeuroImaging (PRNI). IEEE, 2015. http://dx.doi.org/10.1109/prni.2015.29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Alsalem, Shuker, Abu Firas Al Musawi, and Enoch Suleiman. "On maximal permutation BH—ideals of Permutation BH—Algebras." In 2022 7th International Conference on Mathematics and Computers in Sciences and Industry (MCSI). IEEE, 2022. http://dx.doi.org/10.1109/mcsi55933.2022.00013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Alsalem, Shuker, Abu Firas Al Musawi, and Enoch Suleiman. "On Permutation B-center and Derived Permutation B-algebras." In 2022 7th International Conference on Mathematics and Computers in Sciences and Industry (MCSI). IEEE, 2022. http://dx.doi.org/10.1109/mcsi55933.2022.00014.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Permutation"

1

FLORIDA STATE UNIV TALLAHASSEE. Scrambled Sobol Sequences via Permutation. Fort Belvoir, VA: Defense Technical Information Center, January 2009. http://dx.doi.org/10.21236/ada510216.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Huang, Jonathan, Carlos Guestrin, and Leonidas Guibas. Inference for Distributions over the Permutation Group. Fort Belvoir, VA: Defense Technical Information Center, May 2008. http://dx.doi.org/10.21236/ada488051.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kilian, Joe, Shlomo Kipnis, and Charles E. Leiserson. The Organization of Permutation Architectures with Bussed Interconnections. Fort Belvoir, VA: Defense Technical Information Center, October 1987. http://dx.doi.org/10.21236/ada208817.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bugni, Federico A., and Joel L. Horowitz. Permutation tests for equality of distributions of functional data. The IFS, March 2018. http://dx.doi.org/10.1920/wp.cem.2018.1818.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Dworkin, Morris J. SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. National Institute of Standards and Technology, July 2015. http://dx.doi.org/10.6028/nist.fips.202.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Goff, James, Charles Sievers, Mitchell Wood, and Aidan Thompson. Permutation-adapted complete and independent basis for atomic cluster expansion descriptors. Office of Scientific and Technical Information (OSTI), August 2022. http://dx.doi.org/10.2172/1879613.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kamat, Vishal, and Ivan A. Canay. Approximate permutation tests and induced order statistics in the regression discontinuity design. Institute for Fiscal Studies, June 2015. http://dx.doi.org/10.1920/wp.cem.2015.2715.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Canay, Ivan A., and Vishal Kamat. Approximate permutation tests and induced order statistics in the regression discontinuity design. IFS, August 2016. http://dx.doi.org/10.1920/wp.cem.2016.3316.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Canay, Ivan A., and Vishal Kamat. Approximate permutation tests and induced order statistics in the regression discontinuity design. The IFS, May 2017. http://dx.doi.org/10.1920/wp.cem.2017.2117.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Данильчук, Г. Б., О. А. Засядько, and В. М. Соловйов. Застосування методів теорії складних систем при оцінці економічної безпеки підприємства. Видавець Вовчок О.Ю., 2017. http://dx.doi.org/10.31812/0564/1260.

Full text
Abstract:
The paper estimated the financial stability of the enterprise «Motor Sich» network measures and using permutation entropy. The analysis and comparison of the weights with integrated measurement of financial security. The conclusions about the possibility of using methods of the theory of complex systems in assessing economic security.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Permutation' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography