Updated on 2025/03/27

写真a

 
Haramoto Hiroshi
 
Organization
Institute for Development of Digital Human Resources (IDDHR) Professor
Title
Professor
Contact information
メールアドレス
External link

Degree

  • 博士(理学) ( 広島大学 )

Research Interests

  • Monte Carlo Methods

  • Random Number Generation

Research Areas

  • Natural Science / Applied mathematics and statistics

Education

  • Hiroshima University

    - 2008

      More details

    Country: Japan

    researchmap

Research History

  • Ehime University   Center for Data Science

    2020.4

      More details

  • Ehime University   Faculty of Education

    2011.4 - 2024.9

      More details

  • Kure National College of Technology   Faculty of Natural Sciences

    2008.10 - 2011.3

      More details

  • Hiroshima University

    2008.4 - 2008.9

      More details

Papers

  • Experimental Study on Appropriate Sample Size of Lagged Fibonacci Pseudorandom Number Generators for Stochastic Simulations

    Hiroshi Haramoto, Makoto Matsumoto, Takuji Nishimura

    Frontiers in Artificial Intelligence and Applications   398   20 - 30   2024

     More details

    Publishing type:Research paper (international conference proceedings)  

    Pseudorandom number generators are essential for various stochastic simulations in physics, economics, engineering, etc. In this study, we propose a practical method for estimating appropriate sample sizes for lagged Fibonacci generators, one of the most traditional and widely used pseudorandom number generators. This estimation is based on an analogy with the theoretical one-dimensional random walk. The proposed method is formulated using a weight enumeration polynomial and the MacWilliams identity in coding theory. Generally, a weight enumeration polynomial requires an intractable exhaustive check of the seeds. However, under certain conditions, the MacWilliams identity allows for the direct derivation of the weight enumeration polynomial. To improve efficiency, we employ a heuristic technique to approximate the weight enumeration polynomial by truncating “non-essential” terms motivated by Fourier analysis in signal processing.

    DOI: 10.3233/FAIA241398

    Scopus

    researchmap

  • Unveiling patterns in xorshift128+ pseudorandom number generators Reviewed

    Hiroshi Haramoto, Makoto Matsumoto, Mutsuo Saito

    Journal of Computational and Applied Mathematics   402   2022.3

     More details

    Publishing type:Research paper (scientific journal)  

    Xorshift128+ is a newly proposed pseudorandom number generator (PRNG), which is now the standard PRNG on a number of platforms. We demonstrate that three-dimensional plots of the random points generated by the generator have visible structures: they concentrate on particular planes in the cube. We provide a mathematical analysis of this phenomenon.

    DOI: 10.1016/j.cam.2021.113791

    Scopus

    researchmap

  • Study on upper limit of sample size for a two-level test in NIST SP800-22 Reviewed International journal

    Hiroshi Haramoto

    Japan Journal of Industrial and Applied Mathematics   38 ( 1 )   193 - 209   2021.2

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    NIST SP800-22 is one of the most widely used statistical testing tools for pseudorandom number generators (PRNGs). This tool consists of 15 tests (one-level tests) and two additional tests (two-level tests). Each one-level test provides one or more p-values. The two-level tests measure the uniformity of the obtained p-values for a fixed one-level test. One of the two-level tests categorizes the p-values into ten intervals of equal length, and apply a chi-squared goodness-of-fit test. This two-level test is often more powerful than one-level tests, but sometimes it rejects even good PRNGs when the sample size at the second level is too large, since it detects approximation errors in the computation of p-values. In this paper, we propose a practical upper limit of the sample size in this two-level test, for each of six tests appeared in SP800-22. These upper limits are derived by the chi-squared discrepancy between the distribution of the approximated p-values and the uniform distribution U(0, 1). We also computed a “risky” sample size at the second level for each one-level test. Our experiments show that the two-level test with the proposed upper limit gives appropriate results, while using the risky size often rejects even good PRNGs. We also propose another improvement: to use the exact probability for the ten categories in the computation of goodness-of-fit at the two-level test. This allows us to increase the sample size at the second level, and would make the test more sensitive than the NIST’s recommending usage.

    DOI: 10.1007/s13160-020-00434-y

    Scopus

    researchmap

  • Study on Properties of the Sum of Integer Sequence in "Seiyo Sanpo" Reviewed

    Transactions of mathematical education for colleges and universities   26 ( 1 )   1 - 10   2020.3

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)  

    CiNii Books

    researchmap

  • Checking the quality of approximation of p-values in statistical tests for random number generators by using a three-level test Reviewed

    Haramoto, H., Matsumoto, M.

    Mathematics and Computers in Simulation   161   66 - 75   2019

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    DOI: 10.1016/j.matcom.2018.08.005

    Scopus

    researchmap

  • A Method to Compute an Appropriate Sample Size of a Two-Level Test for the NIST Test Suite Reviewed

    Hiroshi Haramoto, Makoto Matsumoto

    Monte Carlo and quasi-Monte Carlo Methods 2016   283 - 294   2018.8

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • A Non-empirical Test on the Second to the Sixth Least Significant Bits of Pseudorandom Number Generators Reviewed

    Hiroshi Haramoto, Makoto Matsumoto, Takuji Nishimura, Yuki Otsuka

    Springer Proceedings in Mathematics and Statistics   65   417 - 426   2013

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    Lagged Fibonacci generators are widely used random number generators. Some implementations discard the least significant bit of their outputs, because their weight distribution has a strong deviation. But the degree of the improvement is unclear. In this paper, we give a method to compute the weight distribution of the n-th least significant bit of several pseudo random number generators for arbitrary n, generalizing the weight discrepancy test which was possible only for n D 1. The method is based on the MacWilliams identity over Z=2n, and predicts the sample size for which the bit stream fails in a statistical test. These tests are effective to lagged Fibonacci generators such as random() in BSD-C library. For example, we show that the second least significant bit of random() will be rejected if the sample size is of order 104, while the sixth bit will be rejected for the sample size around 107. © Springer-Verlag Berlin Heidelberg 2013.

    DOI: 10.1007/978-3-642-41095-6_19

    Scopus

    researchmap

  • A p-adic algorithm for computing the inverse of integer matrices Reviewed

    H. Haramoto, M. Matsumoto

    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS   225 ( 1 )   320 - 322   2009.3

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:ELSEVIER SCIENCE BV  

    DOI: 10.1016/j.cam.2008.07.044

    Web of Science

    researchmap

  • Automation of Statistical Tests on Randomness to Obtain Clearer Conclusion Reviewed

    Hiroshi Haramoto

    MONTE CARLO AND QUASI-MONTE CARLO METHODS 2008   411 - 421   2009

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:SPRINGER-VERLAG BERLIN  

    DOI: 10.1007/978-3-642-04107-5_26

    Web of Science

    researchmap

  • A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space Reviewed

    Hiroshi Haramoto, Makoto Matsumoto, Pierre L'Ecuyer

    SEQUENCES AND THEIR APPLICATIONS - SETA 2008   5203   290 - +   2008

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:SPRINGER-VERLAG BERLIN  

    DOI: 10.1007/978-3-540-85912-3_26

    Web of Science

    researchmap

  • Efficient jump ahead for F2-linear random number generators Reviewed

    Hiroshi Haramoto, Makoto Matsumoto, Takuji Nishimura, François Panneton, Pierre L'Ecuyer

    INFORMS Journal on Computing   20 ( 3 )   385 - 390   2008

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:INFORMS Inst.for Operations Res.and the Management Sciences  

    The fastest long-period random number generators currently available are based on linear recurrences modulo 2. So far, software that provides multiple disjoint streams and substreams has not been available for these generators because of the lack of efficient jump-ahead facilities. In principle, it suffices to multiply the state (a K-bit vector) by an appropriate k × k binary matrix to find the new state far ahead in the sequence. However, when k is large (e.g., for a generator such as the popular Mersenne twister, for which k = 19,937), this matrix-vector multiplication is slow, and a large amount of memory is required to store the k × k matrix. In this paper, we provide a faster algorithm to jump ahead by a large number of steps in a linear recurrence modulo 2. The method uses much less than the k2 bits of memory required by the matrix method. It is based on polynomial calculus modulo the characteristic polynomial of the recurrence, and uses a sliding window algorithm for the multiplication. © 2008 INFORMS.

    DOI: 10.1287/ijoc.1070.0251

    Web of Science

    Scopus

    researchmap

  • Computing conditional probabilities for $F2$-linear pseudorandom bit generator by splitting Mac-Williams identity Reviewed

    H. Haramoto, M. Matsumoto, T. Nishimura

    International Journal of Pure and Applied Mathematics   38 ( 1 )   29 - 42   2007

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    researchmap

  • Pseudorandom number generation: Impossibility and compromise Reviewed

    Makoto Matsumoto, Mutsuo Saito, Hiroshi Haramoto, Takuji Nishimura

    JOURNAL OF UNIVERSAL COMPUTER SCIENCE   12 ( 6 )   672 - 690   2006

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:GRAZ UNIV TECHNOLGOY, INST INFORMATION SYSTEMS COMPUTER MEDIA-IICM  

    DOI: 10.3217/jucs-012-06-0672

    Web of Science

    researchmap

▼display all

Presentations

  • Experimental Study on Appropriate Sample Size of Lagged Fibonacci Pseudorandom Number Generators for Stochastic Simulations

    Hiroshi HARAMOTO, Makoto MATSUMOTO, Takuji NISHIMURA

    The 10th International Conference on Fuzzy Systems and Data Mining (FSDM 2024)  2024.11 

     More details

    Event date: 2024.11

    Language:English   Presentation type:Oral presentation (general)  

    researchmap

  • An Efficient Jump-Ahead Algorithm for the RANMARS Pseudorandom Number Generator

    The Second Workshop of JMCQMC  2024.9 

     More details

    Event date: 2024.9

    Language:English   Presentation type:Oral presentation (general)  

    researchmap

Research Projects

  • 並列計算環境のための擬似乱数生成と評価の研究

    2022.4 - 2025.3

    日本学術振興会  科学研究費助成事業 基盤研究(C)  基盤研究(C)

    原本 博史

      More details

    Grant amount:\3640000 ( Direct Cost: \2800000 、 Indirect Cost:\840000 )

    researchmap

  • グラフ上の調和解析の視点による整数論の研究

    2019.4 - 2024.3

    日本学術振興会  科学研究費助成事業 基盤研究(C)  基盤研究(C)

    平野 幹, 山崎 義徳, 原本 博史

      More details

    Grant amount:\4550000 ( Direct Cost: \3500000 、 Indirect Cost:\1050000 )

    今年度は、代数的に定義された有限正則グラフに対する明示的調和解析を整数論の観点で考察するための基礎的な考察を昨年度に引き続いて行った。とりわけ、関連する特殊関数に焦点を絞り、その有限型類似物について考察した。
    <BR>
    有限体上の簡約可能群および関連する対称空間に付随する有限正則グラフ上の調和解析を整数論の観点で考察するためには、指数関数や超幾何型関数、ガンマ関数といった、通常の調和解析や整数論に現れる特殊関数の有限型類似物についての理解が不可欠である。これらの特殊関数の有限型類似物はこれまでにも豊富に考察されているが、今年度は有限体上の代数群上の調和解析とその周辺について、とりわけ表現の記述の視点から考察し、理解を深めた。とりわけ、保形形式などの深い研究において見られるように、特定のゲルファント対に関連する球関数を特殊関数として明示的に記述することは、そのゲルファント対から得られる対称空間上の調和解析に基づく整数論的考察において肝要である。有限体上の代数群に対するゲルファント対の研究は非常に多くみられるが、有限特殊関数の詳細な研究とその整数論への応用の観点から整理されたものはあまり多くないように思われる。これらについて散見される事実を整理することにより、本研究課題であるグラフ上の調和解析の視点による整数論の研究に向けた基盤整備を進めているところである。
    <BR>
    今後は、これまでの2年間の研究により得た整数論と関連する有限型特殊関数についての知見をさらに深めると同時に、これらを活用して整数論的視点による有限体上の簡約可能群および関連する対称空間に付随する有限正則グラフ上の調和解析の明示的研究を進める予定である。また、ラマヌジャングラフについての研究にも着手したいと考えている。

    researchmap

  • Applications of algebra and statistics for pseudorandom number generators

    2017.4 - 2021.3

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Young Scientists (B)  Grant-in-Aid for Young Scientists (B)

    Haramoto Hiroshi

      More details

    Grant amount:\3640000 ( Direct Cost: \2800000 、 Indirect Cost:\840000 )

    In this research, using a so called three-level test, we modify several statistical tests in NIST SP800-22 by the National Institute of Standards and Technology (NIST) and TestU01 by L'Ecuyer and Simard. We also improve upper limits of sample size at the second level for nine tests in 15 tests in NIST SP800-22 with the chi-squared discrepancy of the exact distribution of p-values from the uniform distribution.
    Xorshift128+ is a newly proposed pseudorandom number generator, which is now the standard one on a number of platforms. We demonstrate that three-dimensional plots of the random points generated by the generator have visible struc- tures: they concentrate on particular planes in the cube. We provide a mathematical analysis of this phenomenon.

    researchmap

  • Handing over Wasan and Sangaku as a teaching material for geometry to the next generation

    2017.4 - 2020.3

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (C)  Grant-in-Aid for Scientific Research (C)

    Hirata Koichi

      More details

    Grant amount:\3120000 ( Direct Cost: \2400000 、 Indirect Cost:\720000 )

    The words "Wasan" and "Sangaku" were added to the commentary to the curriculum guidelines. As a result, opportunities to take up Wasan in class are increasing. However, it has not yet spread to the younger generation of teachers.
    In this study, we have developed teaching materials that provide the basic knowledge necessary for teaching Wasan for students of the Faculty of Education, and we placed it in geometry education curriculum. We also developed it as teaching materials for in-service teacher training. Thus, we aim to bring out students' interest in mathematics and the history of mathematics as well as science and technology by effectively incorporating Wasan into their lessons.

    researchmap

  • Research on number theory in vew of finite symmetric spaces and the associated graph spectrum

    2016.4 - 2019.3

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Challenging Exploratory Research  Grant-in-Aid for Challenging Exploratory Research

    HIRANO Miki

      More details

    Grant amount:\3510000 ( Direct Cost: \2700000 、 Indirect Cost:\810000 )

    We have developed a study of spectral distribution problems of Cayley graphs in view of Number Theory. In particular, we give a result on boundary problem of Ramanujancy for some families of Cayley graphs on non-commutative finite groups, which is similar to the case of a family of circulant graphs. Our results suggest an interesting (unknown) relation between theory of graph spectrum and analytic number theory.

    researchmap

  • Improvement of pseudorandom number generators from viewpoint of algebra and statistics

    2010.4 - 2014.3

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Young Scientists (B)  Grant-in-Aid for Young Scientists (B)

    HARAMOTO Hiroshi

      More details

    Grant amount:\3770000 ( Direct Cost: \2900000 、 Indirect Cost:\870000 )

    (1) We proposes an adaptive modification of statistical tests, in particular TestU01. This procedure automatically increases the sample size, and tests the PRNG again. It stops when the p-value falls in a clearly rejectable range. (2) We have implemented the codes of the jumping-ahead for MT19937 and WELL19937, in C and C++ languages. These are distributed from a homepage. (3) we report a method to compute the weight distribution of the second to the sixth lowest bits of several PRNGs by using MacWilliams identity.

    researchmap

▼display all