| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| NS, IN (Joint) |
2024-03-01 11:35 |
Okinawa | Okinawa Convention Center | Application of a Deep Reinforcement Learning Algorithm to Virtual Machine Migration Control in Multi-Stage Information Processing Systems Yuki Kojitani (Okayama Univ.), Kazutoshi Nakane (Nagoya Univ.), Yuya Tarutani (Okayama Univ.), Celimuge Wu (UEC), Yusheng Ji (NII), Tokumi Yokohira (Okayama Univ.), Tutomu Murase (Nagoya Univ.), Yukinobu Fukushima (Okayama Univ.)  IN2023-87 |
This paper tackles a virtual machine (VM) migration control problem to maximize the progress (accuracy) of information p... [more] | IN2023-87 pp.130-135 |
| NLP, MSS | 2023-03-17 11:40 |
Nagasaki | (Primary: On-site, Secondary: Online) |
On the Existence of Deterministic Supervisors for Bisimilarity Control of Nondeterministic Discrete Event Systems Shigemasa Takai (Osaka Univ.) MSS2022-99 NLP2022-144 |
In this paper, we consider the bisimilarity control problem for the system and the specification modeled by nondetermin... [more] |
MSS2022-99 NLP2022-144 pp.174-177 |
| SS, MSS | 2022-01-11 13:15 |
Nagasaki | Nagasakiken-Kensetsu-Sogo-Kaikan Bldg. (Primary: On-site, Secondary: Online) |
Bisimilarity Control of Timed Nondeterministic Discrete Event Systems under Event and State Observations Mouheeb Aous, Shigemasa Takai (Osaka Univ.) MSS2021-35 SS2021-22 |
In this paper, we address the problem of supervisory control for plants and specifications modeled as timed nondetermini... [more] | MSS2021-35 SS2021-22 pp.23-28 |
| NC, MBE (Joint) |
2021-03-04 16:50 |
Online | Online | A3C with Deterministic Policy Gradient Yu Takahagi, Yukari Yamauchi (Nihon Univ.) NC2020-63 |
Mnih et al. proposed a learning method called Asynchronous Advantage Actor-Critic (A3C). This method explores asynchrono... [more] | NC2020-63 pp.117-120 |
| IT | 2020-12-03 11:00 |
Online | Online | On certain deterministic sensing matrices and the Erdo"s-Falconer distance problem in finite fields Shohei Satake (Kumamoto Univ.) IT2020-49 |
One of challenging problems in compressed sensing is to construct deterministic matrices with restricted isometry proper... [more] | IT2020-49 pp.140-143 |
| COMP, IPSJ-AL | 2020-09-02 11:30 |
Online | Online | What Restrictions Naturally Allow Well-Known NP-Complete Problems to Yield NL-Completeness and the Linear Space Hypothesis? Tomoyuki Yamakami (U of Fukui) COMP2020-10 |
Many practical combinatorial problems have been shown to be NP-complete or NP-hard. To cope with further real-life situa... [more] | COMP2020-10 pp.33-40 |
| COMP, IPSJ-AL | 2020-05-09 16:15 |
Online | Online | Gathering for mobile agents with a strong team in weakly Byzantine environments Jion Hirose, Masashi Tsuchida (NAIST), Junya Nakamura (TUT), Fukuhito Ooshita, Michiko Inoue (NAIST) COMP2020-2 |
We study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The t... [more] | COMP2020-2 pp.9-16 |
| 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 |
| MSS, SS | 2019-01-15 12:40 |
Okinawa | Similarity Control of Nondeterministic Discrete Event Systems under Partial Observation Jinglun Li, Shigemasa Takai (Osaka Univ.) MSS2018-57 SS2018-28 |
In this paper, we consider a similarity control problem for discrete event systems modeled as nondeterministic automata ... [more] | MSS2018-57 SS2018-28 pp.19-23 |
|
| CAS, SIP, MSS, VLD | 2018-06-15 10:05 |
Hokkaido | Hokkaido Univ. (Frontier Research in Applied Sciences Build.) | Bisimilarity Control of Partially Observed Nondeterministic Discrete Event Systems with Deterministic Specifications Yuki Nakago, Shigemasa Takai (Osaka Univ.) CAS2018-21 VLD2018-24 SIP2018-41 MSS2018-21 |
For nondeterministic discrete event systems with deterministic control specifications, necessary and sufficient condi... [more] |
CAS2018-21 VLD2018-24 SIP2018-41 MSS2018-21 pp.111-114 |
| MSS, NLP (Joint) |
2018-03-14 13:00 |
Osaka | Maximally Permissive Nonblocking Supervisors for Similarity Control of Nondeterministic Discrete Event Systems Jinglun LI, Shigemasa Takai (Osaka Univ.) MSS2017-91 |
In this paper, we consider a similarity control problem for discrete event systems modeled as nondeterministic automata.... [more] | MSS2017-91 pp.73-76 |
|
| MBE, NC, NLP (Joint) |
2018-01-27 10:20 |
Fukuoka | Kyushu Institute of Technology | Nonlinear map model optimization method Kenya Jin'no (NIT) NLP2017-95 |
In this article, we propose a nonlinear map-model optimization (abbr. NMO) method. The NMO consists of some particle who... [more] | NLP2017-95 pp.51-54 |
| SIP, IT, RCS | 2018-01-22 13:55 |
Kagawa | Sunport Hall Takamatsu | Deterministic Interleaver Design for Turbo Codes Bohulu Kwame Ackah, Chenggao Han (UEC) IT2017-69 SIP2017-77 RCS2017-283 |
Deterministic interleavers are preferred in the constructing of turbo codes due to the ability to peform interleaving a... [more] |
IT2017-69 SIP2017-77 RCS2017-283 pp.85-90 |
| SS, MSS | 2018-01-19 14:40 |
Hiroshima | Decentralized Similarity Control of Nondeterministic Discrete Event Systems using Observers Itsuki Okubo, Shigemasa Takai (Osaka Univ.) MSS2017-70 SS2017-57 |
In this paper, we consider a similarity control problem when both the nondeterministic discrete event system and its spe... [more] | MSS2017-70 SS2017-57 pp.133-138 |
|
| ICD, CPSY, CAS | 2017-12-14 09:30 |
Okinawa | Art Hotel Ishigakijima | Chip-Package-Board Interactive PUF Based on Chaos Oscillation Masanori Takahashi, Kohei Matsuda, Makoto Nagata, Noriyuki Miura (Kobe Univ.) CAS2017-63 ICD2017-51 CPSY2017-60 |
This paper presents a new concept of PUF based on a chaotic behavior. Chaos is essentially not a random phenomenon but a... [more] | CAS2017-63 ICD2017-51 CPSY2017-60 pp.1-2 |
| NLP | 2017-11-05 13:10 |
Miyagi | Research Institute of Electrical Communication Tohoku University | Analysis of solution search procedure of particle swarm optimization Seinosuke Ishikawa, Kenya Jin'no (NIT) NLP2017-65 |
In order to clarify the solution search procedure of the particle swarm optimization, we have proposed a deterministic p... [more] | NLP2017-65 pp.1-6 |
| RECONF, CPSY, DC, IPSJ-ARC (Joint) [detail] |
2017-05-24 10:15 |
Hokkaido | Noboribetsu-Onsen Dai-ichi-Takimoto-Kan | Deterministic Path Delay Measurement Using Short Cycle Test Pattern for Aging Detection Kentaro Kato, Umi Mori (NIT) CPSY2017-12 DC2017-12 |
hort cycle test pattern can sensitize target paths deterministically and periodically in short interval. It is useful to... [more] | CPSY2017-12 DC2017-12 pp.69-74 |
| PRMU, IE, MI, SIP | 2016-05-20 11:40 |
Aichi | Automatic classification mesurement method of blood cells by Deterministic Lateral Displacement Takuto Maeda, Masanori Hayase, Shin Aoki, Naoyuki Aikawa (Tokyo University of Science) SIP2016-25 IE2016-25 PRMU2016-25 MI2016-25 |
(To be available after the conference date) [more] | SIP2016-25 IE2016-25 PRMU2016-25 MI2016-25 pp.135-138 |
|
| ICSS, IPSJ-SPT | 2016-03-03 16:30 |
Kyoto | Academic Center for Computing and Media Studies, Kyoto University | Privacy-preserving Log Analysis with Deterministic Encryption Yuji Furuta, Naoto Yanai (Osaka Univ.), Masashi Karasaki (NTT-neomeit), Katsuhiko Eguchi (NTT Neomeit), Yasunori Ishihara, Toru Fujiwara (Osaka Univ.) ICSS2015-54 |
Recently, an increase of attacks via a network is remarkable, and the observation and the analysis of log information is... [more] | ICSS2015-54 pp.41-46 |
| NC, NLP (Joint) |
2016-01-29 09:55 |
Fukuoka | Kyushu Institute of Technology | Investigation on coupling parameters in deterministic PSO networks Tomoyuki Sasaki, Hidehiro Nakano, Arata Miyauchi, Akira Taguchi (Tokyo City Univ.) NLP2015-136 |
PSO networks (PSONs) which is networking PSO are one of the multi swarm techniques. In PSONs, since each sub-swarm group... [more] | NLP2015-136 pp.57-62 |
[Return to Top Page]