Zobrazeno 1 - 10
of 329
pro vyhledávání: '"Morita Kenichi"'
Autor:
Morita, Kenichi1 km@hiroshima-u.ac.jp
Publikováno v:
Computer Science Journal of Moldova. 2024, Vol. 32 Issue 3, p425-445. 21p.
Skeleton-based two-person interaction recognition has been gaining increasing attention as advancements are made in pose estimation and graph convolutional networks. Although the accuracy has been gradually improving, the increasing computational com
Externí odkaz:
http://arxiv.org/abs/2207.12648
Publikováno v:
Handbook of Unconventional Computing, Volume 2: Implementations, chapter 9, pp. 271-288, (2021)
We demonstrate a discrete implementation of a wave-based majority gate in a chaotic Life-like cellular automaton. The gate functions via controlling of patterns' propagation into stationary channels. The gate presented is realisable in many living an
Externí odkaz:
http://arxiv.org/abs/2110.06013
Publikováno v:
Journal of Cellular Automata, 13(4), 325--346, 2018
An elementary cellular automaton with memory is a chain of finite state machines (cells) updating their state simultaneously and by the same rule. Each cell updates its current state depending on current states of its immediate neighbours and a certa
Externí odkaz:
http://arxiv.org/abs/1803.05496
Autor:
Morita, Kenichi
Publikováno v:
EPTCS 128, 2013, pp. 3-14
Reversible computing is a paradigm of computation that reflects physical reversibility, one of the fundamental microscopic laws of Nature. In this survey, we discuss topics on reversible logic elements with memory (RLEM), which can be used to build r
Externí odkaz:
http://arxiv.org/abs/1309.1264
Autor:
Morita, Kenichi
Publikováno v:
EPTCS 90, 2012, pp. 142-150
We study one-dimensional reversible and number-conserving cellular automata (RNCCA) that have both properties of reversibility and number-conservation. In the case of 2-neighbor RNCCA, Garc\'ia-Ramos proved that every RNCCA shows trivial behavior in
Externí odkaz:
http://arxiv.org/abs/1208.2760
Publikováno v:
Game of Life Cellular Automata. Springer, 2010, pp. 547-572
We study a Life-like cellular automaton rule $B2/S2345$ where a cell in state `0' takes state `1' if it has exactly two neighbors in state `1' and the cell remains in the state `1' if it has between two and five neighbors in state `1.' This automaton
Externí odkaz:
http://arxiv.org/abs/1106.3046
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.
Autor:
Nakajima, Takuma, Yageta, Mika, Shiotsu, Kohhei, Morita, Kenichi, Suzuki, Mitsuhiro, Tomooka, Yasuhiro, Oda, Kinichiro
Publikováno v:
Proceedings of the National Academy of Sciences of the United States of America, 1998 Sep 01. 95(18), 10590-10595.
Externí odkaz:
https://www.jstor.org/stable/45935
Autor:
Morita, Kenichi1 (AUTHOR) km@hiroshima-u.ac.jp
Publikováno v:
Acta Informatica. Aug2021, Vol. 58 Issue 4, p377-396. 20p.