Diploma Thesis from the year 2012 in the subject Mathematics - Stochastics, grade: 2, Klagenfurt University (Institut für Statistik), language: English, abstract: 7 is definately not a random number. In fact, we would probably say that the sequence 7, 2, 13, 9, 5, 8, ... is random. Within mathematics a sequence of random numbers should not display a pattern or show any form of regularity. Sequences of random numbers are generated by an algorithm that determines a succeeding number using one or more given numbers. Numbers yielded by an algorithm are called pseudo-random numbers which can be denoted mathematically. Multidimensional equidistribution and a large period are important properties required from a sequence in order to acknowledge it as random numbers. The algorithms to produce random numbers can be roughly grouped into two families - congruential generators and generators based on feedback shift registers (FSR). We will focus on the latter family. An FSR-based generator can be described by a characteristic polynomial which has to be primitive in order to ensure the best quality with respect to randomness. Often sparse polynomials are used to reduce computing costs. The algorithms used produce random sequences that might have some deficiencies. However, the quality of randomness can be improved by several measurements; as are modifying the feedback, filtering the output sequences or combining two or more generators.
"synopsis" may belong to another edition of this title.
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9783668014572
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. Neuware -Diploma Thesis from the year 2012 in the subject Mathematics - Stochastics, grade: 2, Klagenfurt University (Institut für Statistik), language: English, abstract: 7 is definately not a random number. In fact, we would probably say that the sequence 7, 2, 13, 9, 5, 8, . is random. Within mathematics a sequence of random numbers should not display a pattern or show any form of regularity. Sequences of random numbers are generated by an algorithm that determines a succeeding number using one or more givennumbers. Numbers yielded by an algorithm are called pseudo-random numbers which can be denoted mathematically. Multidimensional equidistribution and a large period are important properties required from a sequence in order to acknowledge it as random numbers. The algorithms to produce random numbers can be roughly grouped into two families- congruential generators and generators based on feedback shift registers (FSR). We will focus on the latter family. An FSR-based generator can be described by a characteristicpolynomial which has to be primitive in order to ensure the best quality with respect to randomness. Often sparse polynomials are used to reduce computing costs. The algorithms used produce random sequences that might have some deficiencies. However, the quality of randomness can be improved by several measurements; as are modifying the feedback, filtering the output sequences or combining two or more generators. 132 pp. Englisch. Seller Inventory # 9783668014572
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 134. Seller Inventory # 388974383
Quantity: 4 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Diploma Thesis from the year 2012 in the subject Mathematics - Stochastics, grade: 2, Klagenfurt University (Institut für Statistik), language: English, abstract: 7 is definately not a random number. In fact, we would probably say that the sequence 7, 2, 13, 9, 5, 8, . is random. Within mathematics a sequence of random numbers should not display a pattern or show any form of regularity. Sequences of random numbers are generated by an algorithm that determines a succeeding number using one or more givennumbers. Numbers yielded by an algorithm are called pseudo-random numbers which can be denoted mathematically. Multidimensional equidistribution and a large period are important properties required from a sequence in order to acknowledge it as random numbers. The algorithms to produce random numbers can be roughly grouped into two families- congruential generators and generators based on feedback shift registers (FSR). We will focus on the latter family. An FSR-based generator can be described by a characteristicpolynomial which has to be primitive in order to ensure the best quality with respect to randomness. Often sparse polynomials are used to reduce computing costs. The algorithms used produce random sequences that might have some deficiencies. However, the quality of randomness can be improved by several measurements; as are modifying the feedback, filtering the output sequences or combining two or more generators. Seller Inventory # 9783668014572
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Random Numbers. Sequences Based On Linear Feedback | Christian Mößlacher | Taschenbuch | 132 S. | Englisch | 2015 | GRIN Verlag | EAN 9783668014572 | Verantwortliche Person für die EU: GRIN Publishing GmbH, Waltherstr. 23, 80337 München, info[at]grin[dot]com | Anbieter: preigu. Seller Inventory # 104252898
Seller: Mispah books, Redhill, SURRE, United Kingdom
Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA79636680145746
Quantity: 1 available