| 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 # | |
| ICM | 2022-07-08 09:30 |
Hokkaido | Tokachi Plaza (Primary: On-site, Secondary: Online) |
Eulerian cycle-based design of packet loss measurement routes to detect lossy links Yuichi Sano, Masahiro Shibata, Masato Tsuru (Kyutech)  ICM2022-16 |
For network optimization and high-availability based on SDN, it is required to monitor the state and quality of every li... [more] | ICM2022-16 pp.30-35 |
| COMP | 2021-03-08 16:30 |
Online | Online | On the Existence of 4-regular Uniquely Hamiltonian Graphs Ryota Sakamoto (UEC Tokyo) COMP2020-36 |
In 1946, Smith showed that a Hamiltonian cubic graph contains at least three Hamiltonian cycles. Then, a lot of research... [more] | COMP2020-36 pp.46-50 |
| COMP | 2019-12-13 17:00 |
Gunma | Ikaho Seminar House, Gunma University | COMP2019-42 |
Motivated by adjacency in perfect matching polytopes, we study the shortest reconfiguration problem of perfect matchings... [more] | COMP2019-42 pp.93-100 |
| CAS, MSS, IPSJ-AL [detail] | 2019-11-29 09:45 |
Fukuoka | Exact Algorithm for Sorting Rules in Firewall Ryosuke Fumiiwa, Toshinori Yamada (Saitama Univ.) CAS2019-55 MSS2019-34 |
Given a firewall policy(a sequence of packet rules), the sorting problem of rules in a firewall is to sort the rules in ... [more] | CAS2019-55 MSS2019-34 pp.73-78 |
|
| COMP | 2018-12-12 16:15 |
Miyagi | Tohoku University | Self-stabilizing exploration of a graph by a mobile agent Yuki Hara, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2018-39 |
The rotor-router is a self-stabilizing algorithm for graph exploration by a mobile agent, that is, it eventually allows,... [more] | COMP2018-39 pp.47-54 |
| CAS, SIP, MSS, VLD | 2018-06-15 10:25 |
Hokkaido | Hokkaido Univ. (Frontier Research in Applied Sciences Build.) | Edge Taxation Method of Selfish Routing Games Based on Network Structure Yoshiiki Matsui, Takafumi Kanazawa (Osaka Univ.) CAS2018-22 VLD2018-25 SIP2018-42 MSS2018-22 |
A selfish routing is a model of selfish players in networks. Each player tries to select a path that minimizes his trave... [more] | CAS2018-22 VLD2018-25 SIP2018-42 MSS2018-22 pp.115-118 |
| COMP | 2016-09-06 16:20 |
Toyama | Toyama Prefectural University | Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs Kenjiro Takazawa (Hosei Univ.) COMP2016-22 |
We introduce a new framework of restricted 2-matchings close to Hamilton cycles. For an undirected graph (V,E) and a fa... [more] | COMP2016-22 pp.53-60 |
| EA | 2015-07-03 15:20 |
Tokyo | The Univ. of Electro-Communications, 80th Anniversary Memorial Hall | A study on level diagram necessary for verification of stable operation of hands-free communication system Kensaku Fujii (Kodaway Lab.), Mitsuji Muneyasu (Kansai Univ.) EA2015-8 |
(To be available after the conference date) [more] | EA2015-8 pp.39-44 |
| EA | 2015-07-03 15:50 |
Tokyo | The Univ. of Electro-Communications, 80th Anniversary Memorial Hall | An adaptive algorithm for acoustic echo canceler adjusting insertion loss to echo path change and double talk. Kensaku Fujii (Kodaway Lab.), Takuya Sawada, Takuto Yoshioka (Univ. of Hyogo), Mitsuji Muneyasu (Kansai Univ.) EA2015-9 |
(To be available after the conference date) [more] | EA2015-9 pp.45-50 |
| VLD | 2015-03-02 14:15 |
Okinawa | Okinawa Seinen Kaikan | Zero-weighted Cycle Finding Method for Exchanging Pin Pair on Set-Pair Rouitng Yuta Nakatani, Atsushi Takahashi (Tokyo Tech) VLD2014-156 |
Set pair routing problem has connection requirements which are given between a pair of terminals. In set pair routing pr... [more] | VLD2014-156 pp.19-24 |
| NLP, CAS | 2014-10-16 14:35 |
Ehime | Ehime University | The Relation Between Cycles and Propagation Phenomenon Based on Ego Network Analysis Tomoharu Sakamoto, Norihito Toyota, Fumiho Ogura (Hokkaido Information Univ.) CAS2014-62 NLP2014-56 |
The relation between cycles and a propagation phenomenon on a network has not been yet elucidated well so far. We propo... [more] |
CAS2014-62 NLP2014-56 pp.57-62 |
| COMP | 2013-10-18 11:15 |
Aichi | Nagoya Institute of Technology | The Hamiltonian cycle problem on distance-hereditary graph Takanori Jimbo, Tomio Hirata (Nagoya Univ.) COMP2013-33 |
(To be available after the conference date) [more] | COMP2013-33 pp.9-12 |
| COMP | 2013-03-18 14:35 |
Gifu | Gifu University | Comparative evaluation of two constructions of Hamiltonian circuits for generating picturesque mazes with illusory images Fuhito Yanagitani, Akihiro Uejima (Osaka Electro-Comm. Univ.) COMP2012-58 |
This report proposes a new type of maze generation as a generalization of the {\it picturesque maze generation problem},... [more] | COMP2012-58 pp.39-46 |
| COMP, IPSJ-AL | 2011-09-06 11:15 |
Hokkaido | Hakodate City Central Library | On A DAG Constructing Self-stabilizing Protocol for GeoCast in MANET Koichi Ito, Yoshiaki Katayama, Koichi Wada, Naohisa Takahashi (Nitech) COMP2011-23 |
Geocasting is a mechanism to deliver messages of interest to all hosts within a given geographical region. GeoTORA is on... [more] | COMP2011-23 pp.23-30 |
| MSS, CAS, VLD, SIP | 2011-06-30 11:30 |
Okinawa | Okinawa-Ken-Seinen-Kaikan | A Relocation Planning Method for Railway Cars in Final Assembly Shop Yoichi Nagao, Shinichi Nakano, Akifumi Hoshino, Yasushi Kaneta (KHI), Toshiyuki Kita, Masakazu Okamoto (Kawasaki Technology) CAS2011-8 VLD2011-15 SIP2011-37 MSS2011-8 |
The authors have examined a method that makes a movement plan for relocation of the railway cars in preparation for the ... [more] | CAS2011-8 VLD2011-15 SIP2011-37 MSS2011-8 pp.43-48 |
| COMP | 2009-09-14 11:15 |
Tottori | Tottori University of Environmental Studies | Recognition of a Spanning Tree of DAGs by Tree Automata Akio Fujiyoshi (Ibaraki Univ.) COMP2009-26 |
In this article, we define that a DAG is accepted by a tree automaton if the DAG has a spanning tree accepted by the tre... [more] | COMP2009-26 pp.9-12 |
| IT | 2009-05-29 14:15 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Constructing prefix-free codes for finite-state noiseless channels Takuya Koyama, Ken-ichi Iwata (Univ. of Fukui) IT2009-1 |
We consider a problem to build good prefix-free codes for stationary memoryless sources over finite-state noiseless chan... [more] | IT2009-1 pp.1-6 |
| COMP | 2009-05-26 14:50 |
Saitama | Saitama Univ. | A Model of Forming a Simple Cycle in the Same Level of a Complete K-ary Tree Minimizing Total Path Length Kiyoshi Sawada (Univ. of Marketing and Distribution Sci.) COMP2009-15 |
This study proposes a model of adding edges of forming a simple cycle in the same level $N$ of a complete $K$-ary tree o... [more] | COMP2009-15 pp.39-43 |
| VLD, CPSY, RECONF, DC, IPSJ-SLDM, IPSJ-ARC (Joint) [detail] |
2007-11-20 10:55 |
Fukuoka | Kitakyushu International Conference Center | An optimization of thru trees for test generation based on acyclical testability Kohsuke Morinaga, Nobuya Oka, Yuki Yoshikawa, Hideyuki Ichihara, Tomoo Inoue (Hiroshima City Univ.) VLD2007-72 DC2007-27 |
The class of acyclic sequential circuits is $\tau^2$-bounded, i.e., acyclic sequential circuits are practically easily t... [more] | VLD2007-72 DC2007-27 pp.13-18 |
| VLD, CPSY, RECONF, IPSJ-SLDM | 2007-01-18 11:25 |
Tokyo | Keio Univ. Hiyoshi Campus | Model Checking of Cycle Accurate Hardware Behavior Models with Instantaneous Communication Hirohisa Fujita, Masahiko Hamada, Tadaaki Tanimoto, Akio Nakata, Teruo Higashino (Osaka Univ.) |
Wiring delay imposes a limitation on increase of clock frequency. Therefore, instantaneous communications consuming ... [more] |
VLD2006-98 CPSY2006-69 RECONF2006-69 pp.25-30 |
[Return to Top Page]