| 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 # | |
| PRMU, IBISML, IPSJ-CVIM [detail] | 2023-03-03 10:05 |
Hokkaido | Future University Hakodate (Primary: On-site, Secondary: Online) |
High Accuracy Alignment of 3D Point Clouds Obtained from Multiple View Point Images for Automatic Wire Harness Placement Environments Erika Hata, Eiji Fukuzawa, Jun Ohya (Waseda Univ.)  PRMU2022-103 IBISML2022-110 |
In automatic wire harness routing environments, we are exploring methods for generating 3D maps with high accuracies by ... [more] | PRMU2022-103 IBISML2022-110 pp.232-237 |
| PN | 2021-03-02 14:55 |
Online | Online | Routing Control Method considering Traffic Consditons in Software Defind Elastic Optical Network Sora Yoshiyama, Ken-ichi Baba (Kogakuin Univ) PN2020-58 |
Elastic optical networks are attracting attention as a technology to efficiently accommodate the ever-increasing Intern... [more] |
PN2020-58 pp.92-97 |
| CAS, MSS, IPSJ-AL [detail] | 2019-11-29 10:10 |
Fukuoka | Approximation Algorithms for Minimum Cost Data Gathering Using Self-Coding Daiki Nakamichi, Hiroyuki Miyamoto, Tamio Ishii, Toshinori Yamada (Saitama Univ.) CAS2019-56 MSS2019-35 |
This paper considers the minimum energy-consumption data gathering problem using self-coding on wireless sensor networks... [more] | CAS2019-56 MSS2019-35 pp.79-84 |
|
| PN | 2019-08-27 09:30 |
Hokkaido | Kanpo-No-Yado Otaru | A Study of Virtualized Elastic Regenerator Placement Method in Translucent Elastic Optical Networks Yu Asano, Takahiro Kodama, Masahiko Jinno (Kagawa Univ.) PN2019-17 |
Virtualized elastic regenerative (VER) consists of multiple sub-regenerators and functions as a virtual regenerative rep... [more] | PN2019-17 pp.43-50 |
| IA, SITE, IPSJ-IOT [detail] | 2019-03-08 15:00 |
Tokushima | Grand XIV Naruto | Detouring Skip Graph: A Structured Overlay Utilizing Detour Routes Takeshi Kaneko, Ryohei Banno, Yusuke Aoki, Kazuyuki Shudo (Tokyo Tech) SITE2018-86 IA2018-78 |
Skip Graph, one of the structured overlays, constructs its own structure based on membership vectors assigned to every n... [more] | SITE2018-86 IA2018-78 pp.343-350 |
| IN | 2019-01-21 15:35 |
Aichi | WINC AICHI | An Energy-harvesting-aware Routing Algorithm Considering Residual Capacity of Batteries for WSN Zihao Zhang, Shigetomo Kimura (Univ. of Tsukuba) IN2018-77 |
In a wireless sensor network, a large number of sensor nodes equipped with calculation, sensing, and wirelesscommunicati... [more] | IN2018-77 pp.31-36 |
| COMP | 2018-10-26 13:45 |
Kyoto | Kyoto University | Kento Masuda, Shinji Imahori (Chuo Univ.), Yasuhiro Ohara (NTT Communications) COMP2018-25 |
The number and scale of DDoS attacks are increasing by DDoS attacks agencies and IoT devices. DDoS mitigation is one of ... [more] | COMP2018-25 pp.33-39 |
| IA | 2018-09-04 14:40 |
Hokkaido | Hokkaido Univ. Conference Hall | Reducing Average Path Lengths of Range Queries on Skip Graphs Ryohei Banno, Kazuyuki Shudo (Tokyo Tech) IA2018-27 |
Structured overlay networks are useful techniques to enable a large number of nodes to discover each other in an autonom... [more] | IA2018-27 pp.69-76 |
| SCE | 2018-08-09 14:40 |
Aichi | Toyohashi University of Technology | Design of Adiabatic Quantum-Flux-Parametron Integrated Circuits Using an Automated Placement Tool Based on Genetic Algorithms Tomoyuki Tanaka, Christopher Ayala, XU Qiuyun, Ro Saito, Nobuyuki Yoshikawa (Yokohama National Univ.) SCE2018-16 |
Adiabatic Quantum Flux Parametron (AQFP) circuits are known as high-energy-efficiency circuits. They operate at 5 to 10 ... [more] | SCE2018-16 pp.53-57 |
| NS, IN (Joint) |
2018-03-02 13:30 |
Miyazaki | Phoenix Seagaia Resort | MPR Selection and Routing Methods Using Link Disconnection Prediction in OLSR Protocol Wataru Nagata, Akira Toyozaki, Masaki Hanada (Tokyo Univ. of Information Sciences), Hidehiro Kanemitsu (Waseda Univ.), Yasuo Nagai (Tokyo Univ. of Information Sciences) IN2017-134 |
OLSR is one of well-known proactive protocols for MANETs. OLSR may cause the reduction of network performance because ... [more] |
IN2017-134 pp.267-272 |
| CQ (2nd) |
2018-01-20 12:50 |
Tokyo | Nishiwaseda Campus, Waseda Univ. | [Poster Presentation]
Load Balancing Routing Inspired by True Slime Mold for Ad Hoc Networks Hiroshi Katada, Takumi Miyoshi (SIT) |
Biomimetics or bio-inspired methods that apply and model the living phenomena in various fields have been attracting att... [more] | |
| PN | 2017-11-15 13:35 |
Tokyo | Kogakuin Univ. | Comparing greedy-type algorithms for RSA problems of anycasting in elastic networks Yasutaka MIyagawa, Yosuke Watanabe, Maiko Shigeno (Univ. Tsukuba), Kiyo Ishii (AIST), Atsuko Takefusa (NII), Akiko Yoshise (Univ. Tsukuba) PN2017-28 |
The routing and spectrum allocation (RSA) problems need to be solved when we transmit some demands in an elastic optical... [more] | PN2017-28 pp.1-8 |
| PN | 2017-08-28 11:05 |
Hokkaido | Toya Kanko Hotel | Survivable Grouped Routing Optical Networks Hiroshi Hasegawa, Yojiro Mori, Ken-ichi Sato (Nagoya Univ.) PN2017-16 |
Performance comparisons between dedicated/shared path protected coarse granular routing optical networks are presented. ... [more] | PN2017-16 pp.13-18 |
| IT, SIP, RCS | 2017-01-19 13:55 |
Osaka | Osaka City Univ. | Proposal of Data-Gathering Sensor Tree Creation Algorithm Optimized in Tree Lifetime and Algorithm Speed in WSN Hiroshi Matsuura (NTT) IT2016-62 SIP2016-100 RCS2016-252 |
Data gatherings that forward sensor data through sensor nodes on a sensor tree up to its root node are widely used in wi... [more] | IT2016-62 SIP2016-100 RCS2016-252 pp.93-98 |
| IN | 2017-01-20 11:25 |
Aichi | Routing Algorithms Based On Speed Difference and Distance Difference between Vehicles for Persistent Connection on VANET Takaaki Haga, Shigetomo Kimura (Univ. of Tsukuba) IN2016-96 |
VANETs (Vehicular Ad-hoc Networks) are created by vehicles with wireless communication. When some vehicles communicate w... [more] | IN2016-96 pp.67-72 |
|
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2015-12-02 17:10 |
Nagasaki | Nagasaki Kinro Fukushi Kaikan | Effective Routing Pattern Generation with an Optimum Tertiary Routing Algorithm for Self-Aligned Quadruple Patterning Takeshi Ihara, Atsushi Takahashi (Tokyo Tech) VLD2015-53 DC2015-49 |
Self-Aligned Quadruple Patterning (SAQP) is an important manufacturing technique for sub 14 nm technology node. Althou... [more] |
VLD2015-53 DC2015-49 pp.93-98 |
| 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 |
| RECONF, CPSY, VLD, IPSJ-SLDM [detail] | 2015-01-30 11:10 |
Kanagawa | Hiyoshi Campus, Keio University | The proposal of the convex area maze router on LSI design automation Yohei Horino, Jun Hirayama, Yukiko Ohishi, Toshiyuki Tsutsumi (Meiji Univ.) VLD2014-138 CPSY2014-147 RECONF2014-71 |
We developed the convex area maze router that extends the channel intersection maze router as a high-speed routing algor... [more] | VLD2014-138 CPSY2014-147 RECONF2014-71 pp.163-168 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2014-11-26 15:35 |
Oita | B-ConPlaza | A Method for Total Length and Length Difference Reduction for Set-Pair Routing Yuta Nakatani, Atsushi Takahashi (Titech) VLD2014-87 DC2014-41 |
Set pair routing problem in which connection requirements are given between a pair of terminals is a routing problem on... [more] |
VLD2014-87 DC2014-41 pp.111-116 |
| NS | 2014-10-16 14:20 |
Shimane | Matsue Terrsa | [Poster Presentation]
Performance Evaluation of Multiple Routing Configurations with Necessary Link Deviation Algorithms for Low Energy Consumption Takayuki Hatanaka, Takuji Tachibana (Univ. of Fukui) NS2014-110 |
Recently, a fast failure recovery is an important issue in communication networks because a lot of users utilize communi... [more] | NS2014-110 pp.45-48 |
[Return to Top Page]