Zobrazeno 1 - 10
of 2 141
pro vyhledávání: '"TANAKA, Masato"'
We prove the solvability and nilpotency of Kac--Paljutkin's finite quantum group and Sekine quantum groups and we classify the solvable series of Kac--Paljutkin's finite quantum group via Cohen--Westreich's Burnside theorem. Some semisimple quasitria
Externí odkaz:
http://arxiv.org/abs/2402.00706
Autor:
Kobayashi, Hiroki, Nomura, Katsuya, Zhou, Yuqing, Tanaka, Masato, Kawamoto, Atsushi, Nomura, Tsuyoshi
Publikováno v:
Structural and Multidisciplinary Optimization 67, 151 (2024)
This paper proposes a level set-based method for optimizing shell structures with large design changes in shape and topology. Conventional shell optimization methods, whether parametric or nonparametric, often only allow limited design changes in sha
Externí odkaz:
http://arxiv.org/abs/2401.13868
Autor:
Tanaka, Masato
We construct a proper generating functional $L$ on a Podle\'{s} sphere and we show that $1$-cocycle arising from $L$ coincides with the one in our previous work. We also show that our 1-cocycle is purely non Gaussian and that the full `group' $C^{\as
Externí odkaz:
http://arxiv.org/abs/2312.08836
Autor:
Kobayashi, Hiroki, Gholami, Farzad, Montgomery, S. Macrae, Tanaka, Masato, Yue, Liang, Yuhn, Changyoung, Sato, Yuki, Kawamoto, Atsushi, Qi, H. Jerry, Nomura, Tsuyoshi
Publikováno v:
Sci. Adv. 10, eadn6129 (2024)
Locomotive soft robots (SoRos) have gained prominence due to their adaptability. Traditional locomotive SoRo design is based on limb structures inspired by biological organisms and requires human intervention. Evolutionary robotics, designed using ev
Externí odkaz:
http://arxiv.org/abs/2310.10985
Autor:
Tanaka, Masato
We define $1$-cocycles on coideal $*$-subalgebras of CQG Hopf $\ast$-algebras and consider the condition for $1$-cocycles to extend to $1$-cocycles on Drinfeld double coideals. We construct a $1$-cocycle on a Podle\'{s} sphere, which extends to a $1$
Externí odkaz:
http://arxiv.org/abs/2305.10048
Autor:
Miyamoto, Akiyoshi1 (AUTHOR) akkun@kzd.biglobe.ne.jp, Tanaka, Masato1 (AUTHOR) angeloscarpaz@gmail.com, Flores, Angel Oscar Paz1 (AUTHOR) ydwnss@yu.ac.kr, Yu, Dongwoo1 (AUTHOR) drmukuljain@gnail.com, Jain, Mukul1 (AUTHOR) heng.christian@gmail.com, Heng, Christan1 (AUTHOR) t.komatsubara1982@gmail.com, Komatsubara, Tadashi1 (AUTHOR) araoyc@gmail.com, Arataki, Shinya1 (AUTHOR), Oda, Yoshiaki2 (AUTHOR) odaaaaaaamn@yahoo.co.jp, Shinohara, Kensuke2 (AUTHOR) joker1011ks@yahoo.co.jp, Uotani, Koji2 (AUTHOR) coji.uo@gmail.com
Publikováno v:
Diagnostics (2075-4418). Dec2024, Vol. 14 Issue 23, p2715. 10p.
Autor:
Heydar, Ahmed Majid1,2 (AUTHOR) dr.a.heydr@gmail.com, Tanaka, Masato1 (AUTHOR) tanakam@md.okayama-u.ac.jp, Prabhu, Shrinivas P.1 (AUTHOR) t.komatsubara1982@gmail.com, Komatsubara, Tadashi1 (AUTHOR) araoyo@gmail.com, Arataki, Shinya1 (AUTHOR) m11099sy@jichi.ac.jp, Yashiro, Shogo1 (AUTHOR) akihiro198326@gmail.com, Kanamaru, Akihiro1 (AUTHOR) sooseizi0402@yahoo.co.jp, Nanba, Kazumasa1 (AUTHOR) xianghf@qdu.edu.cn, Xiang, Hongfei1 (AUTHOR) huynkimhieumd@gmail.com, Hieu, Huynh Kim1 (AUTHOR)
Publikováno v:
Journal of Clinical Medicine. Aug2024, Vol. 13 Issue 16, p4663. 22p.
Autor:
Tanaka, Masato, Matsui, Tomomi
A circle graph is a graph in which the adjacency of vertices can be represented as the intersection of chords of a circle. The problem of calculating the chromatic number is known to be NP-complete, even on circle graphs. In this paper, we propose a
Externí odkaz:
http://arxiv.org/abs/2102.00691
Autor:
Tanaka, Masato, Matsui, Tomomi
Publikováno v:
Mathematical Social Sciences, Volume 115, 2022, Pages 47-51
In this paper, we propose a pseudo polynomial size LP formulation for finding a payoff vector in the least core of a weighted voting game. The numbers of variables and constraints in our formulation are both bounded by $\mbox{O}(n W_+)$, where $n$ is
Externí odkaz:
http://arxiv.org/abs/2101.11180
Publikováno v:
Games 2022, 13(3), 44
This paper addresses Monte Carlo algorithms for calculating the Shapley-Shubik power index in weighted majority games. First, we analyze a naive Monte Carlo algorithm and discuss the required number of samples. We then propose an efficient Monte Carl
Externí odkaz:
http://arxiv.org/abs/2101.02841