查詢結果分析
來源資料
頁籤選單縮合
題 名 | 窮舉搜尋具有可攜帶性之32位元二階質數乘餘法亂數產生器=An Exhaustive Analysis for Portability of Multiplicative Congruential Random Number Generators of Order Two with Prime Modulus for 32-Bit Machines |
---|---|
作 者 | 翁振益; 黃旭男; | 書刊名 | 技術學刊 |
卷 期 | 14:3 1999.09[民88.09] |
頁 次 | 頁431-436 |
分類號 | 440.11 |
關鍵詞 | 亂數產生器; 可攜帶性; 效率; 理論測試; Random number generator; Portability; Efficiency; Theoretical test; |
語 文 | 中文(Chinese) |
中文摘要 | 研究中針對符合近似因數分解法的32位元二階質數乘餘法亂數產生器最大質數 做窮舉搜尋,分別採用理論與經驗測試檢定343.6億組的乘數(a□•a□),結果只有10組 乘數通過全部的檢定。這些亂數產生器的執行效率比之前研究,平均快3.27倍左右,且透 過簡單步驟即可達到可攜帶性,除此之外,其週期高達2□,符合隨機性、重覆性及齊次 性,是一理想的亂數產生器。 |
英文摘要 | This paper presents the results of an exhaustive search to find portable multipliers for the multiplicative congruential random number Generators of order two with the largest prime modulus in 32-bit machines. Both theoretical and empirical tests were conducted extensively to test among, the 34.36 billion sets of multipliers (a□,a□). 10 sets pass all the tests. The Generators devised in this paper are 3.27 times faster than those recommended in some previous studies and they can attain portability by means of simple processes. In addition, these Generators attain a maximal period of 2/□, randomness, repeatability and homogeneity, required for practical simulation use. |
本系統中英文摘要資訊取自各篇刊載內容。