Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Noro, Masayuki"'
Autor:
Aoki, Satoshi, Noro, Masayuki
Publikováno v:
Alg. Stat. 14 (2023) 167-179
Use of polynomial indicator functions to enumerate fractional factorial designs with given properties is first introduced by Fontana, Pistone and Rogantin (2000) for two-level factors, and generalized by Aoki (2019) for multi-level factors. In this p
Externí odkaz:
http://arxiv.org/abs/2209.14477
Signature-based algorithm under non-compatible term orders and its application to change of ordering
Autor:
Noro, Masayuki
Publikováno v:
In Journal of Computational Algebra December 2024 12
Autor:
Aoki, Satoshi, Noro, Masayuki
A polynomial indicator function of designs is first introduced by Fontana {\it et al}. (2000) for two-level cases. They give the structure of the indicator functions, especially the relation to the orthogonality of designs. These results are generali
Externí odkaz:
http://arxiv.org/abs/2109.14777
Autor:
Sei, Tomonari, Takayama, Nobuki, Takemura, Akimichi, Nakayama, Hiromasa, Nishiyama, Kenta, Noro, Masayuki, Ohara, Katsuyoshi
Publikováno v:
Advances in Applied Mathematics 47 (2011) 639-658
We give a new algorithm to find local maximum and minimum of a holonomic function and apply it for the Fisher-Bingham integral on the sphere $S^n$, which is used in the directional statistics. The method utilizes the theory and algorithms of holonomi
Externí odkaz:
http://arxiv.org/abs/1005.5273
Autor:
NORO, MASAYUKI
Publikováno v:
数理解析研究所講究録. 2224:1-9
The compatibility of a term ordering in a polynomial ring R = K[X] and a module term ordering in Rm is a sufficient condition of the termination of the signature based algorithm. Experiments show that a combination of non-compatible term orderings ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::1c0c0183d13695fb88bb692c60b55853
http://hdl.handle.net/2433/279666
http://hdl.handle.net/2433/279666
Autor:
NORO, MASAYUKI, YOKOYAMA, KAZUHIRO
Publikováno v:
数理解析研究所講究録. 2185:139-148
Faugère [1] presented the F₅ algorithm for efficiently computing Gröbner bases but the proof of its termination and correctness was incomplete and since then many efforts have been devoted to verify them. As a result many variants of the F₅ alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::cf6fef1037503b99250e9cb33a930c46
http://hdl.handle.net/2433/264924
http://hdl.handle.net/2433/264924
Autor:
Nakayama, Hiromasa, Nishiyama, Kenta, Noro, Masayuki, Ohara, Katsuyoshi, Sei, Tomonari, Takayama, Nobuki, Takemura, Akimichi
Publikováno v:
In Advances in Applied Mathematics 2011 47(3):639-658
Autor:
NORO, MASAYUKI
Publikováno v:
数理解析研究所講究録. 2138:12-20
The first implementation of Grabner basis computation in Risa/Asir started in 1993. The Shimoyama-Yokoyama algorithm for primary decomposition of ideals was implemented by using it in 1996. In 2003 a completely new package for Grabner basis computati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::d9de6a82fa3316722b934afed2168530
http://hdl.handle.net/2433/254878
http://hdl.handle.net/2433/254878
Autor:
Aoki, Satoshi, Noro, Masayuki
Publikováno v:
Japanese Journal of Statistics & Data Science; Jul2022, Vol. 5 Issue 1, p165-179, 15p
Autor:
Yokoyama, Kazuhiro, Noro, Masayuki
Publikováno v:
数理解析研究所講究録. 1955:146-157
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::8818284c812c9f7bafee9ca0bafa88f4
http://hdl.handle.net/2433/224033
http://hdl.handle.net/2433/224033