| 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 # | |
| R | 2023-07-28 15:55 |
Hokkaido | (Primary: On-site, Secondary: Online) |
Proposal for Obtaining Quisu-Optimal Arrangement of the 3-dimensional-consecutive-(r_1,r_2,r_3)-out-of-(n_1,n_2,n_3):F system Tomoaki Akiba (CIT)  R2023-17 |
In this study, we consider the component assignment problem of the 3-dimensional-consecutive-(r_1,r_2,r_3)-out-of- (n_1,... [more] | R2023-17 pp.39-44 |
| R | 2023-05-27 15:25 |
Aichi | Aichi University (Primary: On-site, Secondary: Online) |
Iterated local search for the component assignment problem of connected-(1,2)-or-(2,1)-out-of-(m,n):F lattice systems Taishin Nakamura (Tokai Univ.) R2023-5 |
In this study, we propose an Iterated Local Search (ILS) method for solving the component assignment problem of the conn... [more] | R2023-5 pp.21-26 |
| R | 2023-03-10 16:15 |
Hiroshima | (Primary: On-site, Secondary: Online) |
Proposal for Obtaining Optimal Arrangement of the 3-dimensional-consecutive-(r1,r2,r3)-out-of-(n1,n2,n3):F system Tomoaki Akiba (Chiba IT) R2022-55 |
In this study, we consider the component assignment problem of the 3-dimensional-consecutive-(r_1,r_2,r_3)-out-of- (n_1,... [more] | R2022-55 pp.41-46 |
| MW | 2023-03-02 15:35 |
Tottori | Tottori Univ. (Primary: On-site, Secondary: Online) |
[Special Talk]
5.8-GHz band high efficiency 1-W rectenna with short stub connected dipole antenna Naoki Sakai, Keisuke Noguchi, Kenji Itoh (Kanazawa IT) MW2022-167 |
This paper presents a 5.8 GHz band 1W rectenna with a short stub connected dipole antenna. The short stub connected dipo... [more] | MW2022-167 pp.60-65 |
| R | 2019-05-24 15:20 |
Aichi | Aichi Institute of Technology, Motoyama Campus | Efficient method for computing the reliability of the toroidal connected-(r,s)-out-of-(m,n):F lattice system Taishin Nakamura, Hisashi Yamamoto (Tokyo Met. Univ.), Tomoaki Akiba (Chiba Inst. of Tech.) R2019-6 |
This paper focuses on a toroidal connected-(r,s)-out-of-(m,n):F lattice system. The components in this system are deploy... [more] | R2019-6 pp.29-34 |
| R | 2018-07-27 14:50 |
Hokkaido | Proposal of algorithm for optimal arrangement in connected-(r,s)-out-of-(m,n):F lattice system Taishin Nakamura, Hisashi Yamamoto (Tokyo Met. Univ.), Takashi Shinzato (Tamagawa Univ.) R2018-13 |
One of the most significant problems in reliability theory is an optimal arrangement problem on the assumption that comp... [more] | R2018-13 pp.13-18 |
|
| LOIS | 2015-03-06 15:20 |
Okinawa | Method for Estimating the Shape of Contact Area between a Calligraphy Brush and Paper by Image Analysis Naoko Ito, Tatsuya Aoyagi (Tsuda College) LOIS2014-91 |
It is difficult to write calligraphic characters with a conventional digital input device like a stylus or a tablet, bec... [more] | LOIS2014-91 pp.173-178 |
|
| NS, IN (Joint) |
2015-03-03 15:10 |
Okinawa | Okinawa Convention Center | Efficient information sharing among distributed controllers of OpenFlow network with bi-connectivity Junichi Nagano, Norihiko Shinomiya (Soka Univ.) NS2014-259 |
Control planes of Software Defined Networking have faced a scalability issue because they have been widely applied for l... [more] | NS2014-259 pp.481-486 |
| PRMU, CNR | 2015-02-19 16:20 |
Miyagi | [Poster Presentation]
Character Detection With Stroke Width Features From Scene Image Yasushi Oshima, Tomo Miyazaki, Yoshihiro Sugaya, Shinichiro Omachi (Tohoku Univ.) PRMU2014-133 CNR2014-48 |
We perform the character detection from the scene image. In this paper, character regions are extracted as connected com... [more] | PRMU2014-133 CNR2014-48 pp.99-100 |
|
| R | 2014-08-01 14:55 |
Hokkaido | Smile Hotel Hakodate | Algorithm for obtaining optimal arrangement of connected-(r,s)-out-of-(m,n):F system in the case of m=r and s=2. Toru Omura, Hisashi Yamamoto (TMU), Tomoaki Akiba (CIT), Xiao Xiao (TMU) R2014-17 |
In this study, we consider as a types of 2-dimensional consecutive-k-out-of-n:F system, there are connected-(r, s)-out-o... [more] | R2014-17 pp.19-24 |
| ITS, IE, ITE-AIT, ITE-HI, ITE-ME [detail] | 2014-02-17 11:00 |
Hokkaido | Hokkaido Univ. | Extraction of Character Regions from Color Scene Images with Complex Background Yousuke Iwami, Ryusuke Nakamae, Junji Maeda (Muroran Inst. of Tech.) ITS2013-35 IE2013-100 |
The purpose of this research is to extract the character regions from color scene images with complex background such as... [more] | ITS2013-35 IE2013-100 pp.31-36 |
| R | 2013-05-17 15:30 |
Hiroshima | [Invited Talk]
Maintenance of Linear Connected-(r, s)-out-of-(m, n): F Systems with Periodic Inspection Won Young Yun, Alfonsus Julanto Endharta (Pusan National Univ.) R2013-11 |
The paper considers a linear connected-(r, s)-out-of-(m, n): F lattice system in which components are ordered like the e... [more] | R2013-11 pp.61-65 |
|
| COMP, IPSJ-AL | 2013-05-18 14:25 |
Hokkaido | Otaru University of Commerce | A New Framework for Connected Components Labeling of Binary Images Tetsuo Asano (JAIST), Sergey Bereg (Univ. of Texas at Dallas) COMP2013-16 |
Given a binary image of $n$ pixels, assign integral labels to all pixels so that any background pixel has label $0$ ... [more] |
COMP2013-16 pp.127-134 |
| ITS, IE, ITE-AIT, ITE-HI, ITE-ME [detail] | 2013-02-18 15:00 |
Hokkaido | Hokkaido Univ. | Character Extraction from Color Document Images with Complex Background Hiroyuki Tokuchi, Yousuke Iwami, Junji Maeda (Muroran Inst. of Tech.) ITS2012-30 IE2012-110 |
The purpose of this research is to extract the characters from color document images with complex background such as jou... [more] | ITS2012-30 IE2012-110 pp.65-70 |
| EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] | 2012-07-19 13:05 |
Hokkaido | A data hiding method for binary images based on a pixel block feature and position of connected component Hiroo Iwanaga, Hirohisa Hioki (Kyoto Univ.) ISEC2012-12 SITE2012-8 ICSS2012-14 EMM2012-4 |
Designing high capacity and quality-preserving data hiding methods for binary images is more difficult than for multi-va... [more] | ISEC2012-12 SITE2012-8 ICSS2012-14 EMM2012-4 pp.23-28 |
|
| IN, NS (Joint) |
2011-03-04 09:50 |
Okinawa | Okinawa Convention Center | Examination of CDS Selection Technique for Backbone Network Construction in Triage Network Yuto Toguchi, Hikaru Kobayashi, Hiroki Tamura (Keio Univ.), Hiroshi Shigeno (Keio Univ./JST CREST) NS2010-246 |
Triage network to apply sensor network to triage has been researched in recent years. This network is used to collect bi... [more] | NS2010-246 pp.461-466 |
| RECONF | 2009-09-17 13:25 |
Tochigi | Utsunomiya Univ. | Component Labeling on the FPGA using Few Logic Elements Yasuaki Ito, Koji Nakano (Hiroshima Univ.) RECONF2009-20 |
In this paper, we present a hardware connected component labeling algorithm which is a task that assigns unique IDs to ... [more] |
RECONF2009-20 pp.7-12 |
| COMP | 2007-12-14 10:30 |
Hiroshima | Hiroshima University | Component Labeling for k-Concave Binary Images Using an FPGA Yasuaki Ito, Koji Nakano (Hiroshima Univ.) COMP2007-48 |
Connected component labeling is a task that assigns unique IDs to the connected components of a binary (black and whit... [more] |
COMP2007-48 pp.1-8 |
| COMP | 2006-10-17 09:00 |
Miyagi | Tohoku University | Convex Grid Drawings of Plane Graphs with Rectangular Contours Akira Kamada (Tohoku Univ.), Kazuyuki Miura (Fukushima Univ.), Takao Nishizeki (Tohoku Univ.) |
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and al... [more] | COMP2006-31 pp.1-8 |
| NLP | 2006-05-11 13:45 |
Kumamoto | Kumamoto Univ. | A Sufficient Condition for 1-D CNNs with Antisymmetric Templates to Perform Connected Component Detection Ken Ishitobi, Norikazu Takahashi (Kyushu Univ.), Tetsuo Nishi (Waseda Univ.) |
We consider conditions for one-dimensional cellular neural networks(1-D CNNs) with the antisymmetric template A=[s,p,-s]... [more] | NLP2006-4 pp.15-20 |
[Return to Top Page]