Zobrazeno 1 - 10
of 371
pro vyhledávání: '"Nishida, Yuki"'
Typestate systems are notoriously complex as they require sophisticated machinery for tracking aliasing. We propose a new, transition-oriented foundation for typestate in the setting of impure functional programming. Our approach relies on ordered ty
Externí odkaz:
http://arxiv.org/abs/2408.14031
The max-plus algebra $\mathbb{R}\cup \{-\infty \}$ is defined in terms of a combination of the following two operations: addition, $a \oplus b := \max(a,b)$, and multiplication, $a \otimes b := a + b$. In this study, we propose a new method to charac
Externí odkaz:
http://arxiv.org/abs/2402.07358
Autor:
Nishida, Yuki
Max-plus algebra is a semiring with addition $a\oplus b = \max(a,b)$ and multiplication $a\otimes b = a+b$. It is applied in cases, such as combinatorial optimization and discrete event systems. We consider the power of max-plus square matrices, whic
Externí odkaz:
http://arxiv.org/abs/2311.03844
Publikováno v:
In Appetite 1 September 2024 200
Autor:
Nishida, Yuki
0048
甲第22675号
情博第728号
新制||情||125(附属図書館)
学位規則第4条第1項該当
Doctor of Informatics
Kyoto University
DFAM
甲第22675号
情博第728号
新制||情||125(附属図書館)
学位規則第4条第1項該当
Doctor of Informatics
Kyoto University
DFAM
Externí odkaz:
http://hdl.handle.net/2433/253520
The max-plus algebra $\mathbb{R}\cup \{-\infty \}$ is a semiring with the two operations: addition $a \oplus b := \max(a,b)$ and multiplication $a \otimes b := a + b$. Roots of the characteristic polynomial of a max-plus matrix are called algebraic e
Externí odkaz:
http://arxiv.org/abs/2110.00285
Autor:
Nishida, Yuki, Saito, Hiromasa, Chen, Ran, Kawata, Akira, Furuse, Jun, Suenaga, Kohei, Igarashi, Atsushi
A smart contract is a program executed on a blockchain, based on which many cryptocurrencies are implemented, and is being used for automating transactions. Due to the large amount of money that smart contracts deal with, there is a surging demand fo
Externí odkaz:
http://arxiv.org/abs/2108.12971
Autor:
Nishida, Yuki, Igarashi, Atsushi
Recently, we have proposed coordinated choices, which are nondeterministic choices equipped with names. The main characteristic of coordinated choices is that they synchronize nondeterministic decision among choices of the same name. The motivation o
Externí odkaz:
http://arxiv.org/abs/2004.14084
Publikováno v:
Journal of Cellular Automata, 15: 207-222, 2020
Elementary fuzzy Cellular Automata (CA) are known as continuous counterpart of elementary CA, which are 2-state CA, via the polynomial representation of local rules. In this paper, we first develop a new fuzzification methodology for $q$-state CA. It
Externí odkaz:
http://arxiv.org/abs/2002.02653