Zobrazeno 1 - 10
of 3 398
pro vyhledávání: '"Muroya A"'
Autor:
Muroya Akiko
Publikováno v:
Open Linguistics, Vol 9, Iss 1, Pp 679-86 (2023)
This article reports on an empirical study investigating what makes Japanese learners of English as a foreign language (EFL) unwilling to speak English, regardless of their learning period, proficiency level, and location of the communication. The cu
Externí odkaz:
https://doaj.org/article/18e1321343634325b88cf1c358c2bc4a
Algorithms for partition refinement are actively studied for a variety of systems, often with the optimisation called Hopcroft's trick. However, the low-level description of those algorithms in the literature often obscures the essence of Hopcroft's
Externí odkaz:
http://arxiv.org/abs/2307.15261
Autor:
Ota, K., Shimozawa, M., Muroya, T., Miyamoto, T., Hosoi, S., Nakamura, A., Homma, Y., Honda, F., Aoki, D., Izawa, K.
We have performed precise Hall measurements for the ferrotoroidic candidate material UNi4B. Below Neel temperature TN ~ 20 K (corresponding to the ferrotoroidic transition temperature), a Hall voltage becomes finite even at zero field and changes pro
Externí odkaz:
http://arxiv.org/abs/2205.05555
Publikováno v:
In Science of Computer Programming February 2025 240
Autor:
Phomvisith, Ouanh1 (AUTHOR) ouanh80@gmail.com, Muroya, Susumu2 (AUTHOR) muros@vet.kagoshima-u.ac.jp, Otomaru, Konosuke3 (AUTHOR) otomaru@vet.kagoshima-u.ac.jp, Oshima, Kazunaga4 (AUTHOR) tenpoint@affrc.go.jp, Oshima, Ichiro2 (AUTHOR) oshima@agri.kagoshima-u.ac.jp, Nishino, Daichi5 (AUTHOR) 0214daichi@gmail.com, Haginouchi, Taketo1 (AUTHOR) haginouchi.taketo.b5@elms.hokudai.ac.jp, Gotoh, Takafumi1 (AUTHOR) gotoh@fsc.hokudai.ac.jp
Publikováno v:
International Journal of Molecular Sciences. Sep2024, Vol. 25 Issue 17, p9242. 27p.
Autor:
Okamoto, Kazumasa1,2 (AUTHOR) kazu@sanken.osaka-u.ac.jp, Muroya, Yusa1 (AUTHOR), Kozawa, Takahiro1 (AUTHOR)
Publikováno v:
Scientific Reports. 7/20/2024, Vol. 14 Issue 1, p1-9. 9p.
We show that the algorithmic complexity of any classical algorithm written in a Turing-complete programming language polynomially bounds the number of quantum bits that are required to run and even symbolically execute the algorithm on a quantum comp
Externí odkaz:
http://arxiv.org/abs/2111.12063
Publikováno v:
In Waste Management 15 September 2024 186:271-279
Autor:
Tabassum, Safia, Katsumura, Yosuke, Muroya, Yusa, Khan, Hasan M., Khan, Abdul Naeem, Sultana, Sabiha, Hata, Kuniki
Publikováno v:
In Radiation Physics and Chemistry May 2024 218
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.