IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 100  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
NLP, MSS 2024-03-14
11:40
Misc. Kikai-Shinko-Kaikan Bldg. Stability and implementation of mixed rule cellular automata
Kazuma Matsushita, Toshimichi Saito (HU)
(To be available after the conference date) [more]
SS 2024-03-07
13:30
Okinawa
(Primary: On-site, Secondary: Online)
Zone-Based Reachability Analysis of Nested Timed Automata
Seiichiro Tachi (Nagoya Univ), Mizuhito Ogawa (JAIST), Shoji Yuen (Nagoya Univ)
(To be available after the conference date) [more]
COMP 2023-03-02
15:15
Tokyo Ochanomizu University When Input Integers are Given in the Unary Numeral Representation -- (Preliminary Report) --
Tomoyuki Yamakami (U of Fukui) COMP2022-37
Many NP-complete problems take integers as part of their input instances. These input integers are given in general in t... [more] COMP2022-37
pp.21-27
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, IPSJ-SE, KBSE [detail] 2022-07-29
13:00
Hokkaido Hokkaido-Jichiro-Kaikan (Sapporo)
(Primary: On-site, Secondary: Online)
Verification of Implementable Timed Automata via Satisfiability Checking
Seiichiro Tachi, Shoji Yuen (Nagoya Univ.) SS2022-9 KBSE2022-19
We present a technique for bounded model-checking the reachability in timed automata with implementability assuming that... [more] SS2022-9 KBSE2022-19
pp.49-54
SC 2022-03-11
10:25
Online EventIn Digital Transformation in IT Education -- E-Learning Application for Automata --
Takumi Nakano, Hiroshi Sunaga (OIT) SC2021-37
The aim of this study is to construct an e-learning application that helps understand how automata work and thereby supp... [more] SC2021-37
pp.17-22
CCS 2021-11-18
13:00
Osaka Osaka Univ.
(Primary: On-site, Secondary: Online)
Making Simple Music from Elementary Cellular Automata
Wataru Kojima, Toshimichi Saito (HU) CCS2021-18
Elementary cellular automata (ECAs) are simple digital dynamical systems in which time, space, and state are all discret... [more] CCS2021-18
pp.7-10
HCS 2021-03-15
13:50
Online Online Rural Life and Study Group Activities -- Importance of Very Low Noise Environment --
Kumon Tokumaru (Writer) HCS2020-71
Under Covid-19 pandemic, Study Group Meetings of IEICE are held on-line. IEICE Members who live in rural area and have d... [more] HCS2020-71
pp.21-26
WBS, IT, ISEC 2021-03-04
11:45
Online Online Streaming Data Compression and Decompression by One-Way Quantum Finite-State Automata, Leading to Quantum Finite-State Deep and Shallow Information (Preliminary Report)
Tomoyuki Yamakami (U of Fukui) IT2020-117 ISEC2020-47 WBS2020-36
The logical depth of a piece of data has served as a complexity measure to
describe the amount of “useful” and "non-ran... [more]
IT2020-117 ISEC2020-47 WBS2020-36
pp.31-36
MBE, NC, NLP, CAS
(Joint) [detail]
2020-10-30
09:25
Online Online Analysis of simple cellular automata for music signal generation
Hotaka Udagawa, Toshimichi Saito (HU) CAS2020-12 NLP2020-33
The elementary cellular automata (ECAs) are a digital dynamical system in which time, space and states are all discrete.... [more] CAS2020-12 NLP2020-33
pp.5-8
COMP 2019-12-13
15:35
Gunma Ikaho Seminar House, Gunma University Reduction of number of signals on controlling reaction systems
Ryutaro Yako, Satoshi Kobayashi (UEC) COMP2019-39
We proposed a mathematical framework in which we can choose arbitrary boolean function to be computed by controlling rea... [more] COMP2019-39
pp.69-76
COMP 2019-12-13
16:25
Gunma Ikaho Seminar House, Gunma University Limited Deterministic Automata and Pumping Lemma
Kosei Yoshida, Tomoyuki Yamakami (U of Fukui) COMP2019-41
This pape, introduced a pumping lemma for languages recognizable by limited deterministic automata. We use this lemma to... [more] COMP2019-41
pp.85-92
DC, SS 2019-10-24
14:30
Kumamoto Kumamoto Univ. Computing Optimal Weight in Weighted Register Automata and Related Decision Problems
Reo Yoshimura (Nagoya Univ.), Yoshiaki Takata (Kochi-tech.), Hiroyuki Seki (Nagoya Univ.) SS2019-16 DC2019-44
Register automaton (RA) is a computational model that can handle data values by adding registers to finite automaton. Re... [more] SS2019-16 DC2019-44
pp.19-24
NLP, CAS 2019-10-22
16:20
Gifu Gifu Univ. Expression ability of time-variant rule elementary cellular automata
Takahiro Ozawa, Toshimichi Saito (HU) CAS2019-36 NLP2019-76
The elementary cellular automata(ECA) is a digital dynamical system in which time, space and states are all discrete. De... [more] CAS2019-36 NLP2019-76
pp.67-70
CCS, NLP 2019-06-07
13:20
Niigata machinaka campus nagaoka Asynchronous Cellular Automata and Reservoir Computing -- Beyond the Edge of Chaos --
Daisuke Uragami (Nihon Univ.), Yulkio-Pegio Gunji (Waseda Univ.) NLP2019-20 CCS2019-3
The asynchronous tuned cellular automaton (AT_ECA) we have proposed has been shown to generate critical spatiotemporal p... [more] NLP2019-20 CCS2019-3
pp.11-14
LOIS 2019-03-07
10:20
Okinawa Miyakojima-shi Central Community Center State Transition Machine As Coordination Message In Everyday Life Errands
Keiko Shimokoriyama, Chihiro Tsutsumi, Ken Nakayama (Tsuda Univ.) LOIS2018-57
When asking others to do some task, the task is described as a document in a natural language. Despite a task usually c... [more] LOIS2018-57
pp.13-18
MSS, SS 2019-01-16
09:00
Okinawa   Optimal Run Problem for Weighted Register Automata
Reo Yoshimura, Hiroyuki Seki (Nagoya Univ.) MSS2018-66 SS2018-37
Register automaton (RA) is a computational model that can handle data values by adding registers to finite automaton. Re... [more] MSS2018-66 SS2018-37
pp.61-66
QIT
(2nd)
2018-11-26
09:50
Tokyo The University of Tokyo Non-Uniform State Complexity of Quantum Finite Automata and Quantum Polynomial-Time Logarithmic-Space Computation with Quantum Advice -- (Preliminary Report) --
Tomoyuki Yamakami (U of Fukui)
The state complexity of a finite(-state) automaton intuitively measures the size of the description of the automaton. Sa... [more]
CCS 2018-11-23
13:00
Hyogo Kobe Univ. [Invited Talk] Error-correction in neuro-inspired spike signaling
Ferdinand Peper (NICT) CCS2018-42
Inspired by the spike-based signaling between neurons, we introduce impulse-based signaling for wireless communication, ... [more] CCS2018-42
pp.51-56
CCS 2018-11-23
14:05
Hyogo Kobe Univ. Dynamics analysis and application of cellular automata with time-variant rules
Takahiro Ozawa, Toshimichi Saito (HU) CCS2018-43
The cellular automata are digital dynamical systems in which time, space, states are all discrete. Depending on a rule, ... [more] CCS2018-43
pp.57-60
 Results 1 - 20 of 100  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan