Gotowe bibliografie tematyczne / Permutations

Spis treści

  1. Artykuły w czasopismach
  2. Rozprawy doktorskie
  3. Książki
  4. Części książek
  5. Streszczenia konferencji
  6. Raporty organizacyjne

Gotowa bibliografia na temat „Permutations”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 25 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Permutations”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Permutations"

1

Malyshev, Fedor M. "Realization of even permutations of even degree by products of four involutions without fixed points." Discrete Mathematics and Applications 34, no. 5 (2024): 263–76. http://dx.doi.org/10.1515/dma-2024-0023.

Pełny tekst źródła
Streszczenie:
Abstract We consider representations of an arbitrary permutation π of degree 2n, n ⩾ 3, by products of the so-called (2 n )-permutations (any cycle of such a permutation has length 2). We show that any even permutation is represented by the product of four (2 n )-permutations. Products of three (2 n )-permutations cannot represent all even permutations. Any odd permutation is realized (for odd n) by a product of five (2 n )-permutations.
Style APA, Harvard, Vancouver, ISO itp.
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 (2014): 13–22. http://dx.doi.org/10.2478/tmmp-2014-0002.

Pełny tekst źródła
Streszczenie:
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 ℕ ha
Style APA, Harvard, Vancouver, ISO itp.
3

Savchuk, M., та M. Burlaka. "Encoding and classification of permutations bу special conversion with estimates of class power". Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics and Mathematics, № 2 (2019): 36–43. http://dx.doi.org/10.17721/1812-5409.2019/2.3.

Pełny tekst źródła
Streszczenie:
Scientific articles investigating properties and estimates of the number of so-called complete permutations are surveyed and analyzed. The paper introduces a special S-transform on the set of permutations and determines the permutation properties according to this transform. Classification and coding of permutations by equivalence classes according to their properties with respect to S-transformation is proposed. This classification and permutation properties, in particular, generalize known results for complete permutations regarding determining certain cryptographic properties of substitutio
Style APA, Harvard, Vancouver, ISO itp.
4

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

Pełny tekst źródła
Streszczenie:
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 w
Style APA, Harvard, Vancouver, ISO itp.
5

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
6

Senashov, Vasily S., Konstantin A. Filippov, and Anatoly K. Shlepkin. "Regular permutations and their applications in crystallography." E3S Web of Conferences 525 (2024): 04002. http://dx.doi.org/10.1051/e3sconf/202452504002.

Pełny tekst źródła
Streszczenie:
The representation of a group G in the form of regular permutations is widely used for studying the structure of finite groups, in particular, parameters like the group density function. This is related to the increased potential of computer technologies for conducting calculations. The work addresses the problem of calculation regular permutations with restrictions on the structure of the degree and order of permutations. The considered regular permutations have the same nontrivial order, which divides the degree of the permutation. Examples of the application of permutation groups in crystal
Style APA, Harvard, Vancouver, ISO itp.
7

Gao, Alice L. L., Sergey Kitaev, Wolfgang Steiner, and Philip B. Zhang. "On a Greedy Algorithm to Construct Universal Cycles for Permutations." International Journal of Foundations of Computer Science 30, no. 01 (2019): 61–72. http://dx.doi.org/10.1142/s0129054119400033.

Pełny tekst źródła
Streszczenie:
A universal cycle for permutations of length [Formula: see text] is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length [Formula: see text], and containing all permutations of length [Formula: see text] as factors. It is well known that universal cycles for permutations of length [Formula: see text] exist. However, all known ways to construct such cycles are rather complicated. For example, in the original paper establishing the existence of the universal cycles, constructing such a cycle involves finding an Eulerian cycle in a certain gra
Style APA, Harvard, Vancouver, ISO itp.
8

Just, Matthew, and Hua Wang. "Note on packing patterns in colored permutations." Online Journal of Analytic Combinatorics, no. 11 (December 31, 2016): 1–9. https://doi.org/10.61091/ojac-1104.

Pełny tekst źródła
Streszczenie:
Packing patterns in permutations concerns finding the permutation with the maximum number of a prescribed pattern. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation containing the maximum number of a layered pattern among all permutations of length n. Consequently the packing density for all but two (up to equivalence) patterns up to length 4 can be obtained. In this note we consider the analogous question for colored patterns and permutations. By introducing the concept of “colored blocks” we characterize the optimal permutations w
Style APA, Harvard, Vancouver, ISO itp.
9

ZHOU, YINGCHUN, and MURAD S. TAQQU. "APPLYING BUCKET RANDOM PERMUTATIONS TO STATIONARY SEQUENCES WITH LONG-RANGE DEPENDENCE." Fractals 15, no. 02 (2007): 105–26. http://dx.doi.org/10.1142/s0218348x07003526.

Pełny tekst źródła
Streszczenie:
Bucket random permutations (shuffling) are used to modify the dependence structure of a time series, and this may destroy long-range dependence, when it is present. Three types of bucket permutations are considered here: external, internal and two-level permutations. It is commonly believed that (1) an external random permutation destroys the long-range dependence and keeps the short-range dependence, (2) an internal permutation destroys the short-range dependence and keeps the long-range dependence, and (3) a two-level permutation distorts the medium-range dependence while keeping both the lo
Style APA, Harvard, Vancouver, ISO itp.
10

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Permutations"

1

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

Pełny tekst źródła
Streszczenie:
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 t
Style APA, Harvard, Vancouver, ISO itp.
2

Ku, Cheng Yeaw. "Intersecting families of permutations and partial permutations." Thesis, Queen Mary, University of London, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416959.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Steingrímsson, Einar. "Permutations statistics of indexed and poset permutations." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/35952.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

West, Julian 1964. "Permutations with forbidden subsequences, and, stack-sortable permutations." Thesis, Massachusetts Institute of Technology, 1990. http://hdl.handle.net/1721.1/13641.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Cooper, Joshua N. "Quasirandom permutations /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2003. http://wwwlib.umi.com/cr/ucsd/fullcit?p3091341.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

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

Pełny tekst źródła
Streszczenie:
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 qua
Style APA, Harvard, Vancouver, ISO itp.
7

Boberg, Jonas. "Counting Double-Descents and Double-Inversions in Permutations." Thesis, Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-54431.

Pełny tekst źródła
Streszczenie:
In this paper, new variations of some well-known permutation statistics are introduced and studied. Firstly, a double-descent of a permutation π is defined as a position i where πi ≥ 2πi+1. By proofs by induction and direct proofs, recursive and explicit expressions for the number of n-permutations with k double-descents are presented. Also, an expression for the total number of double-descents in all n-permutations is presented. Secondly, a double-inversion of a permutation π is defined as a pair (πi,πj) where i<j but πi ≥ 2πj. The total number of double-inversions in all n-permutations is
Style APA, Harvard, Vancouver, ISO itp.
8

Maazoun, Mickaël. "Permutons limites universels de permutations aléatoires à motifs exclus." Thesis, Lyon, 2020. http://www.theses.fr/2020LYSEN064.

Pełny tekst źródła
Streszczenie:
Les permutations à motifs exclus sont un thème important de la combinatoire énumérative et leur étude probabiliste un sujet récent en pleine expansion, notamment l'étude de la limite d'échelle, au sens des permutons, du diagramme d'une permutation aléatoire uniforme dont la taille tent vers l'infini dans une classe définie par exclusion de motifs. Le cas des permutations séparables a été étudié par Bassino, Bouvel, Féray, Gerin et Pierrot, qui ont démontré la convergence vers un objet aléatoire, permuton séparable Brownien. Nous fournissons une construction explicite à partir de processus stoc
Style APA, Harvard, Vancouver, ISO itp.
9

Bogaerts, Mathieu. "Codes et tableaux de permutations, construction, énumération et automorphismes." Doctoral thesis, Universite Libre de Bruxelles, 2009. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210302.

Pełny tekst źródła
Streszczenie:
<p>Un code de permutations G(n,d) un sous-ensemble C de Sym(n) tel que la distance de Hamming D entre deux éléments de C est supérieure ou égale à d. Dans cette thèse, le groupe des isométries de (Sym(n),D) est déterminé et il est prouvé que ces isométries sont des automorphismes du schéma d'association induit sur Sym(n) par ses classes de conjugaison. Ceci mène, par programmation linéaire, à de nouveaux majorants de la taille maximale des G(n,d) pour n et d fixés et n compris entre 11 et 13. Des algorithmes de génération avec rejet d'objets isomorphes sont développés. Pour classer les G(n,d)
Style APA, Harvard, Vancouver, ISO itp.
10

Dansie, B. R. "The analysis of permutations /." Title page, contents and abstract only, 1988. http://web4.library.adelaide.edu.au/theses/09PH/09phd191.pdf.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Permutations"

1

Passman, Donald S. Permutation groups. Dover Publications, Inc., 2012.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Tidhar, Lavie. Cloud permutations. PS Publishing, 2010.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Maughn, James. The Arakaki permutations. Black Radish Books, 2011.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Strauss, Anselm L. Continual permutations of action. AldineTransaction, 2008.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Camina, A. R. Linear groups and permutations. Pitman Advanced Publishing Program, 1985.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Pfahl, John. Permutations on the picturesque. Robert B. Menschel Photography Gallery, Schine Student Center, Syracuse University, 1997.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Pfahl, John. Permutations on the picturesque. Robert B. Menschel Photography Gallery, Schine Student Center, Syracuse University, 1997.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Strauss, Anselm L. Continual permutations of action. AldineTransaction, 2008.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Camina, A. R. Linear groups and permutations. Pitman, 1985.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Kitaev, Sergey. Patterns in Permutations and Words. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17333-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Permutations"

1

Petersen, T. Kyle. "Permutations." In Inquiry-Based Enumerative Combinatorics. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-18308-0_2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Sane, Sharad S. "Permutations." In Texts and Readings in Mathematics. Hindustan Book Agency, 2013. http://dx.doi.org/10.1007/978-93-86279-55-2_3.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Armstrong, M. A. "Permutations." In Undergraduate Texts in Mathematics. Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4757-4034-9_6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Blyth, T. S., and E. F. Robertson. "Permutations." In Sets and Mappings. Springer Netherlands, 1986. http://dx.doi.org/10.1007/978-94-015-7713-7_5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Tapp, Kristopher. "Permutations." In Symmetry. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-0299-2_6.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Loehr, Nicholas A. "Permutations." In Advanced Linear Algebra, 2nd ed. Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003484561-2.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Effinger, Gove, and Gary L. Mullen. "Permutations." In An Elementary Transition to Abstract Mathematics. CRC Press, 2019. http://dx.doi.org/10.1201/9780429324819-10.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Johnson, Tom, and Franck Jedrzejewski. "Permutations." In Looking at Numbers. Springer Basel, 2013. http://dx.doi.org/10.1007/978-3-0348-0554-4_1.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Kerber, Adalbert. "Permutations." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/978-3-662-11167-3_9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Caulton, Adam. "Permutations." In The Routledge Companion to Philosophy of Physics. Routledge, 2021. http://dx.doi.org/10.4324/9781315623818-54.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Permutations"

1

Mohamed, Mimoun, Valentin Emiya, and Caroline Chaux. "Learning Permutations in Monarch Factorization." In ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2025. https://doi.org/10.1109/icassp49660.2025.10889798.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Chen, Chi-Fang, Jordan Docter, Michelle Xu, Adam Bouland, Fernando G. S. L. Brandão, and Patrick Hayden. "Efficient Unitary Designs from Random Sums and Permutations." In 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2024. http://dx.doi.org/10.1109/focs61266.2024.00037.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

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.

Pełny tekst źródła
Streszczenie:
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 sort
Style APA, Harvard, Vancouver, ISO itp.
4

Ryabov, Vladimir Gennadievich. "On number of substitutions of vector space over finite field with affine approximations with given accuracy." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-88.

Pełny tekst źródła
Streszczenie:
Nonlinear mapping of a vector space over a finite field in vector space over the same field and, in particular, the non-linearity the permutation space is defined in terms of the Hamming distance to sets of affine mappings. For permutations of an n-dimensional vector space over a field of q elements, an upper bound for the number permutations with non-linearity, not higher than a given value r, where 0 ≤ r &lt; q&lt;sup&gt;n&lt;/sup&gt; - q&lt;sup&gt;n-1&lt;/sup&gt;, and for r &lt; (q&lt;sup&gt;n&lt;/sup&gt; - q&lt;sup&gt;n-1&lt;/sup&gt;)/2, the exact the value of the specified number, which a
Style APA, Harvard, Vancouver, ISO itp.
5

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.

Pełny tekst źródła
Streszczenie:
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 ma
Style APA, Harvard, Vancouver, ISO itp.
6

Skala, Matthew. "Counting distance permutations." In 2008 IEEE 24th International Conference on Data Engineeing workshop (ICDE Workshop 2008). IEEE, 2008. http://dx.doi.org/10.1109/icdew.2008.4498346.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Chen, Yiling, Lance Fortnow, Evdokia Nikolova, and David M. Pennock. "Betting on permutations." In the 8th ACM conference. ACM Press, 2007. http://dx.doi.org/10.1145/1250910.1250957.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Skala, Matthew. "Counting Distance Permutations." In 2008 First International Workshop on Similarity Search and Applications (SISAP). IEEE, 2008. http://dx.doi.org/10.1109/sisap.2008.15.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Domsa, Ovidiu, and Nicolae Bold. "GENERATOR OF VARIANTS OF TESTS USING THE SAME QUESTIONS." In eLSE 2016. Carol I National Defence University Publishing House, 2016. http://dx.doi.org/10.12753/2066-026x-16-174.

Pełny tekst źródła
Streszczenie:
To obtain the expected results in the academic environment, various mechanisms for presenting the information in a form as much as attractive were made. This thing implied the development of complex means which involves the usage of technical and software support as varied as possible. Another important component related to learning validation is the assessment component. In this moment, a variety of assessment mechanisms exists, from the classical ones which use detailed requirements and answers to those which use templates with simple or more complex questions and answers. In the assessment
Style APA, Harvard, Vancouver, ISO itp.
10

Moraga, Claudio. "Permutations under Spectral Transforms." In 2008 38th International Symposium on Multiple Valued Logic (ismvl 2008). IEEE, 2008. http://dx.doi.org/10.1109/ismvl.2008.16.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Permutations"

1

Tovar, Benjamin, Luigi Freda, and Steven M. LaValle. Learning Combinatorial Map Information from Permutations of Landmarks. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada536930.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Horan, Victoria. Overlap Cycles for Permutations: Necessary and Sufficient Conditions. Defense Technical Information Center, 2013. http://dx.doi.org/10.21236/ada623587.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Tavare, Simon. International Conference on Random Mappings, Partitions and Permutations Held in Los Angeles, California on 3-6 January 1992. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada257259.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Alexander-Morrison, G. M. Experimental attempt to achieve microstructure variations through temperature/time permutations for a nonwrought powder metallurgy uranium-6 niobium alloy. Office of Scientific and Technical Information (OSTI), 1985. http://dx.doi.org/10.2172/5791338.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Ray, Jason, James Kinnebrew, Ramsay Bell, and Martin Schultz. Sensitivity of simulated flaw-height estimates to phased array scan parameters. Engineer Research and Development Center (U.S.), 2023. http://dx.doi.org/10.21079/11681/47403.

Pełny tekst źródła
Streszczenie:
Phased array ultrasonic testing (PAUT) is a nondestructive testing (NDT) technique for detecting and sizing flaws in welds. Estimates of flaw size are sensitive to a variety of PAUT scan parameters. In this study, estimates of flaw height are simulated using computer software. The sensitivity of these estimates to selected PAUT scan parameters is analyzed to identify those that have the greatest influence on estimates of flaw height. Understanding how varying different parameters within a phased array instrument affects the accuracy of flaw-height estimates helps to validate PAUT scan procedur
Style APA, Harvard, Vancouver, ISO itp.
6

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Permutations” dla poszczególnych typów źródeł:
Artykuły w czasopismach Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii