Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Orthogonal_array> ?p ?o. }
Showing items 1 to 17 of
17
with 100 items per page.
- Orthogonal_array abstract "In mathematics, in the area of combinatorial designs, an orthogonal array is a "table" (array) whose entries come from a fixed finite set of symbols (typically, {1,2,...,n}), arranged in such a way that there is an integer t so that for every selection of t columns of the table, all ordered t-tuples of the symbols, formed by taking the entries in each row restricted to these columns, appear the same number of times. The number t is called the strength of the orthogonal array. Here is a simple example of an orthogonal array with symbol set {1,2}:Notice that the four ordered pairs (2-tuples) formed by the rows restricted to the first and third columns, namely (1,1), (2,1), (1,2) and (2,2) are all the possible ordered pairs of the two element set and each appears exactly once. The second and third columns would give, (1,1), (2,1), (2,2) and (1,2); again, all possible ordered pairs each appearing once. The same statement would hold had the first and second columns been used. This is thus an orthogonal array of strength two.Orthogonal arrays generalize the idea of mutually orthogonal latin squares in a tabular form. These arrays have many connections to other combinatorial designs and have applications in the statistical design of experiments, coding theory, cryptography and various types of software testing.".
- Orthogonal_array wikiPageExternalLink fac_details_sect23.htm.
- Orthogonal_array wikiPageExternalLink pri3323.htm.
- Orthogonal_array wikiPageID "17887653".
- Orthogonal_array wikiPageRevisionID "604225403".
- Orthogonal_array hasPhotoCollection Orthogonal_array.
- Orthogonal_array subject Category:Combinatorics.
- Orthogonal_array subject Category:Design_of_experiments.
- Orthogonal_array subject Category:Design_theory.
- Orthogonal_array subject Category:Latin_squares.
- Orthogonal_array comment "In mathematics, in the area of combinatorial designs, an orthogonal array is a "table" (array) whose entries come from a fixed finite set of symbols (typically, {1,2,...,n}), arranged in such a way that there is an integer t so that for every selection of t columns of the table, all ordered t-tuples of the symbols, formed by taking the entries in each row restricted to these columns, appear the same number of times. The number t is called the strength of the orthogonal array.".
- Orthogonal_array label "Orthogonal array".
- Orthogonal_array sameAs m.043sbn1.
- Orthogonal_array sameAs Q7104526.
- Orthogonal_array sameAs Q7104526.
- Orthogonal_array wasDerivedFrom Orthogonal_array?oldid=604225403.
- Orthogonal_array isPrimaryTopicOf Orthogonal_array.