| 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 # | |
| CPM | 2015-08-11 10:20 |
Aomori | Study of the Ce: YIG Thin Film Growth by Using Contact Epitaxy Method for Integrated Optical Isolator Satoru Noge (NIT, Numazu College), Masato Seido, Masayuki Takeda, Katsumi Nakatsuhara (KAIT)  CPM2015-42 |
[more] | CPM2015-42 pp.57-60 |
|
| EMM, IT | 2015-05-22 10:00 |
Kyoto | Kyoto International Community House | On the Computational Complexity of Information Flow Problem with Hierarchy Constraint Yuki Takeda, Yuichi Kaji, Minoru Ito (NAIST) IT2015-11 EMM2015-11 |
An information flow problem discusses how to distribute information over a complicated network. It is known that the te... [more] | IT2015-11 EMM2015-11 pp.57-62 |
| COMP | 2014-12-05 13:00 |
Kumamoto | Sojo University | [Invited Talk]
A new characterization of maximal repetitions by Lyndon trees Hideo Bannai (Kyushu Univ.), Tomohiro I (TU Dortmund), Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta (Kyushu Univ.) COMP2014-35 |
A run is a maximal periodic sub-interval of a string, that is at least as long as twice its smallest period. Runs are im... [more] | COMP2014-35 p.21 |
| AI | 2014-11-29 14:40 |
Fukuoka | Massive Open Online Courses as Places for Collective Ideation Toshiyuki Takeda (Kwansei Gakuin Univ), Katsusuke Shigeta (Hokkaido Univ.), Hideki Mori (Osaka Univ.) AI2014-31 |
MOOC (Massive Open Online Course) , not only makes a big effect on higher education, by preparing the appropriate knowle... [more] | AI2014-31 pp.33-38 |
|
| OME, OPE | 2014-11-21 17:30 |
Tokyo | An optical tunable add-drop multiplexer featuring ferroelectric liquid crystal and an improvement of wavelength characteristics by using weighted grating structures Yoshiki Hayama, Katsumi Nakatsuhara, Masayuki Takeda (Kanagawa Inst. Technol.), Akifumi Kato (AIST) OME2014-58 OPE2014-138 |
We proposed and fabricated a tunable add-drop multiplexer in a silicon waveguide Mach-Zehnder interferometer that has sa... [more] | OME2014-58 OPE2014-138 pp.59-64 |
|
| IN, NV (Joint) |
2013-07-19 16:05 |
Hokkaido | Hokkaido Univ. Faculty of Eng. Academic Lounge 3 | Proposal of Multi-path Connection Method for Wide Area Layer 2 Networks Kazuaki Akashi, Akiyuki Takeda (NTT) IN2013-56 |
We study a multi-path connection method to prevent loop failure and duplication transfer for interconnecting Wide Area L... [more] | IN2013-56 pp.119-124 |
| MI | 2012-01-20 15:05 |
Okinawa | Cryogen-free 3T-MRI system for human brain research using Bi-2223 high-temperature superconducting tapes Shin-ichi Urayama (Kyoto Univ.), Osamu Ozaki (Kobe Steel), Hitoshi Kitaguchi (NIMS), Kazuyuki Takeda (Kyoto Univ.), Iwao Nakajima (Takashima), Naoki Ohnishi (AstroStage), Michael Poole (UQ), Ken-ichi Sato (SEI), Hidenao Fukuyama (Kyoto Univ.) MI2011-153 |
The demand for the exhaustible natural resource helium is increasing rapidly, with 20% of global production used as the ... [more] | MI2011-153 pp.419-424 |
|
| COMP | 2011-05-11 13:00 |
Nagano | Shinshu Univ. | A String Pattern Matching Algorithm for Non-Linear Collage Systems Junichi Yamamoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2011-12 |
A non-linear text is a directed graph where each vertex is labeled with a string. In this paper, we propose a \emph{non... [more] |
COMP2011-12 pp.1-7 |
| COMP | 2011-05-11 13:35 |
Nagano | Shinshu Univ. | Algorithms for Computing Longest Common Substring/Subsequence on Non-Linear Texts Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2011-13 |
A non-linear text is a directed graph where each vertex is labeled with a string. In this paper, we define Longest comm... [more] |
COMP2011-13 pp.9-16 |
| ICM | 2011-03-11 17:30 |
Okinawa | Miyakojima Marine Terminal | Identifying the Anomalous Traffic Using unsupervised learning of Traffic Distribution Hiroshi Yoshida, Haruo Oishi, Akiyuki Takeda, Hideaki Harada (NTT) ICM2010-75 |
DDoS (Distributed Denial of Service) attacks cause serious damage for services. For a early recovery against attacks, qu... [more] | ICM2010-75 pp.121-126 |
| IN, NS (Joint) |
2011-03-03 10:50 |
Okinawa | Okinawa Convention Center | A Load Balancing Method with Detour Setting Algorithm in VP-OBS Networks Ryosuke Takahashi, Yuki Takeda (Kansai Univ.), Young Bok Choi (Tongmyong Univ.), Hiromi Okada (Kansai Univ.) IN2010-150 |
The resource of backbone networks is insufficient because of increasing of the internet traffic. We focus on VP-OBS (Vir... [more] | IN2010-150 pp.37-42 |
| IBISML | 2010-11-04 15:00 |
Tokyo | IIS, Univ. of Tokyo | [Poster Presentation]
Learning Evaluation Functions for Shogi Using SVM-based Bipartite Ranking Learning Daiki Suehiro, Kohei Hatano, Hideo Bannai, Eiji Takimoto, Masayuki Takeda (Kyushu Univ.) IBISML2010-74 |
Recently, automatic optimization of parameters by applying machine learning methods has become a mainstream approach for... [more] | IBISML2010-74 pp.113-118 |
| COMP | 2010-09-29 13:30 |
Niigata | Nagaoka Univ. of Tech. | Counting and Verifying Maximal Palindromes Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2010-27 |
A palindrome is a symmetric string that reads the same forward and backward. Let $\pals(w)$ denote the set of maximal pa... [more] | COMP2010-27 pp.25-30 |
| EA | 2008-11-21 13:30 |
Oita | A Design of Uni-Directional Array-Microphone System using Pressure-Gradient Microphone Kiyoshi Nishikawa, Hiroyuki Takeda (Kanazawa Univ.) EA2008-96 |
This paper prsents a method for designing uni-directional bloadside array-microphone of all digital constitution using d... [more] | EA2008-96 pp.69-74 |
|
| COMP | 2008-06-16 11:00 |
Ishikawa | JAIST | A Context Tree Weighting Algorithm with an Adaptive Window Tomohiro I, Kohei Hatano, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2008-17 |
The Context Tree Weighting Method (CTW) is one of the most effective algorithm in the area of universal data compression... [more] | COMP2008-17 pp.15-22 |
| COMP | 2008-06-16 11:35 |
Ishikawa | JAIST | Efficient XPath Tree Pattern Matching Algorithm over XML Data Stream Kazuhito Hagio, Takashi Ohgami, Masayuki Takeda (Kyushu Univ.) COMP2008-18 |
XPath is a language for specifying the selection of element nodes within XML documents. The essential part of XPath is ... [more] |
COMP2008-18 pp.23-30 |
| OME, EID | 2008-03-03 13:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Ultraviolet Light Emitting Organic Devices with high efficiency and short emission wavelength Yuuki Mizuno, Shigeyuki Takeda, Akiyoshi Mikami (K.I.T.) EID2007-103 OME2007-85 |
We have investigated on an electrical and optical design of the low molecular type ultra-violet light emitting organic d... [more] | EID2007-103 OME2007-85 pp.5-8 |
| DE | 2007-07-02 15:45 |
Miyagi | Akiu hot springs (Sendai) | Fast and Lightweight Filtering of Streaming XML Documents Using Incrementally Constructed Path-trie Kazuhito Hagio, Shuichi Mitarai (Kyushu Univ.), Akira Ishino (Tohoku Univ.), Masayuki Takeda (Kyushu Univ.) DE2007-33 |
In this paper, we present a streaming XML document filter named DXAXEN which is based on incremental construction of pat... [more] | DE2007-33 pp.67-72 |
| AI | 2007-05-31 13:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | [Invited Talk]
String data compression, pattern matching, and pattern discovery Masayuki Takeda (Kyushu Univ.) AI2007-5 |
The compressed pattern matching (CPM, in short) problem is, given a compressed string data, to perform a string pattern ... [more] | AI2007-5 p.25 |
| COMP | 2007-04-26 16:25 |
Kyoto | Katsura Campus, Kyoto University | Suffix Array Based Computation of Substring Equivalence Classes Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2007-9 |
This paper considers enumerating substring equivalence classes introduced by Blumer et al. They used the equivalence cl... [more] |
COMP2007-9 pp.63-70 |
[Return to Top Page]