Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
MSS, SS |
2025-01-12 10:50 |
Kagoshima |
|
The existence of constrained secure equilibrium in multi-player game Hiroki Mizuno, Rindo Nakanishi (Nagoya Univ..), Hiroyuki Seki (Nagoya Univ) |
[more] |
|
DC, SS |
2024-10-17 14:55 |
Shizuoka |
|
Verification with Common Knowledge of Rationality for Graph Games Rindo Nakanishi (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2024-17 DC2024-45 |
Realizability asks whether there exists a program satisfying its specification. In this problem, we assume that each age... [more] |
SS2024-17 DC2024-45 pp.16-21 |
KBSE, SS, IPSJ-SE [detail] |
2024-07-26 15:00 |
Hokkaido |
(Primary: On-site, Secondary: Online) |
A Spatio-Temporal Data Protection Method Considering Trade-offs between Privacy and Service Quality Yuki Wakita, Hiroyuki Seki (Nagoya U.) SS2024-8 KBSE2024-14 |
This research aims at a spatio-temporal data protection method that considers
a better trade-off between privacy prote... [more] |
SS2024-8 KBSE2024-14 pp.43-48 |
SR |
2024-05-20 14:50 |
Kagoshima |
Yokacenter (Kagoshima) (Primary: On-site, Secondary: Online) |
[Invited Talk]
Device development for millimeter wave Radio Unit (RU) Jun Kobayashi, Toshihiro Shimura, Yoji Ohashi, Atsushi Honda, Yoichi Kawano, Toshihide Suzuki, Hiroyuki Seki (Fujitsu Ltd.) SR2024-6 |
The communication traffic is expected to continue increasing due to the spread of mobile terminals such as smartphones, ... [more] |
SR2024-6 p.28 |
SS, MSS |
2024-01-18 10:00 |
Ishikawa |
(Primary: On-site, Secondary: Online) |
Rational synthesis based on multiplayer games with registers Yuto Sakao, Hiroyuki Seki (Nagoya Univ.) MSS2023-61 SS2023-40 |
The realizability problem is to decide whether there is a system that meets a given specification. The synthesis problem... [more] |
MSS2023-61 SS2023-40 pp.52-57 |
SS, MSS |
2024-01-18 14:40 |
Ishikawa |
(Primary: On-site, Secondary: Online) |
Decidability of the existence of a doomsday equilibrium in stochastic Buchi games Hiroki Mizuno, Rindo Nakanishi, Hiroyuki Seki (Nagoya Univ.) MSS2023-68 SS2023-47 |
We consider a multi-player nonzero-sum stochastic game played on a finite directed graph with Büchi objective. A doomsda... [more] |
MSS2023-68 SS2023-47 pp.93-98 |
SS, DC |
2023-10-12 10:00 |
Nagano |
(Primary: On-site, Secondary: Online) |
A game-theoretic approach to indistinguishability of winning objectives as user privacy Rindo Nakanishi (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2023-27 DC2023-33 |
We propose a new game-theoretic framework for studying the privacy protection of a user
who interactively uses a softwa... [more] |
SS2023-27 DC2023-33 pp.32-37 |
SS |
2023-03-15 09:55 |
Okinawa |
(Primary: On-site, Secondary: Online) |
Regularity Preservation Property of Data Tree Rewrite Systems
-- A Subclass Decomposable into Monadic Normal Form -- Yuto Sakao, Hiroyuki Seki (Nagoya Univ.) SS2022-62 |
Let $T$ be a transformation over a class $mathcal{L}$ of languages. If for any regular language $L in mathcal{L}$, $T^*(... [more] |
SS2022-62 pp.91-96 |
DC, SS |
2022-10-25 10:50 |
Fukushima |
(Primary: On-site, Secondary: Online) |
SS2022-23 DC2022-29 |
Synthesis problems with multiple environments that behave rationally have been studied based on multiplayer non-zero-sum... [more] |
SS2022-23 DC2022-29 pp.10-15 |
DC, SS |
2022-10-25 11:15 |
Fukushima |
(Primary: On-site, Secondary: Online) |
SS2022-24 DC2022-30 |
Nominal set plays a central role in a group-theoretic extension of finite automata to those over an infinite set of data... [more] |
SS2022-24 DC2022-30 pp.16-21 |
SS |
2022-03-07 13:15 |
Online |
Online |
SS2021-46 |
[more] |
SS2021-46 pp.25-30 |
COMP |
2022-03-06 10:00 |
Online |
Online |
An Ambiguity Hierarchy of Weighted Context-free Grammars Yusuke Inoue, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) COMP2021-31 |
Weighted context-free grammar (WCFG) is a quantitative extension of context-free grammar (CFG). It is known that unambig... [more] |
COMP2021-31 pp.1-7 |
DE, IPSJ-DBS |
2021-12-27 10:50 |
Online |
(Primary: Online, Secondary: On-site) |
Tree decomposition compression using tree grammar and query processing based on answer set programming Kazuyuki Kojima, Hiroyuki Seki (Nagoya Univ.) DE2021-16 |
Tree decomposition of a graph is an effective approach to solving problems for large graphs while the decomposition itse... [more] |
DE2021-16 pp.7-12 |
SS, DC |
2021-10-19 15:25 |
Online |
Online |
A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Register Automata Akira Onishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2021-17 DC2021-22 |
Register automaton (abbreviated as RA) is an extension of finite automaton by adding
registers storing data values. RA ... [more] |
SS2021-17 DC2021-22 pp.23-28 |
PRMU |
2021-08-26 10:00 |
Online |
Online |
Unsupervised non-rigid alignment for multiple noisy images Takanori Asanomi, Kazuya Nishimura, Heon Song, Junya Hayashida (Kyushu Univ.), Hiroyuki Sekiguchi (Kyoto Univ.), Takayuki Yagi (Luxonus), Imari Sato (NII), Ryoma Bise (Kyushu Univ.) PRMU2021-7 |
We propose a deep non-rigid alignment network that can simultaneously perform non-rigid alignment and noise decompositio... [more] |
PRMU2021-7 pp.1-6 |
SS |
2021-03-03 10:00 |
Online |
Online |
Weighted Multiple Context-free Grammars and their Properties Yusuke Inoue, Hiroyuki Seki (Nagoya Univ.) SS2020-28 |
Multiple context-free grammar (MCFG) is an extension of context-free grammar that generates tuples of strings. MCFG has ... [more] |
SS2020-28 pp.1-6 |
SS |
2021-03-03 10:25 |
Online |
Online |
A Subclass of LTL with the Freeze Quantifier Translatable into Register Automata Akira Onishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2020-29 |
Register automaton (abbreviated as RA) is an extension of finite automaton by adding
registers storing data values. RA ... [more] |
SS2020-29 pp.7-12 |
MSS, SS |
2021-01-27 15:25 |
Online |
Online |
Pumping Lemmas for Languages Expressed by Computational Models with Registers Rindo Nakanishi, Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) MSS2020-41 SS2020-26 |
Register automaton (RA), register context-free grammar (RCFG), and register tree automaton (RTA) are computational model... [more] |
MSS2020-41 SS2020-26 pp.72-77 |
DC, SS |
2020-10-19 13:25 |
Online |
Online |
LTL Model Checking for Register Pushdown Systems Ryoma Senda (Nagoya Univ.), Yoshiaki Takata (KUT), Hiroyuki Seki (Nagoya Univ.) SS2020-6 DC2020-23 |
A pushdown system (PDS) is known as an abstract model of recursive programs.
For PDS, model checking methods have been ... [more] |
SS2020-6 DC2020-23 pp.7-12 |
DE, IPSJ-DBS, IPSJ-IFAT |
2020-09-05 15:10 |
Online |
Online |
Graph compression using tree decomposition and tree grammar and direct evaluation of compressed data Kazuyuki Kojima, Hiroyuki Seki (Nagoya Univ.) DE2020-13 |
[more] |
DE2020-13 pp.1-6 |