| 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 # | |
| MSS | 2011-01-21 13:35 |
Yamaguchi | Kaikyo-Messe-Shimonoseki | Proposal of an Improved Algorithm for Finding Kernel Set and a New Method Yuki Ikeda, Yasuto Aihara, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.)  CST2010-75 |
In this paper, we propose an improved algorithm for finding kernel set and further propose a new method by using Tree-de... [more] | CST2010-75 pp.87-92 |
| MSS | 2010-08-02 16:20 |
Ishikawa | On Block Division of Task Graph for Multiprocessor Scheduling Lin Chen, Mina Kawabuchi, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.), Hirotoshi Tonou, Takako Okamoto, Atsushi Anabuki (Fujitsu TEN) CST2010-37 |
Block is a connected subgraph of a task graph and is executed with one processor.The execution of a block should be such... [more] | CST2010-37 pp.31-34 |
|
| MSS | 2010-01-22 13:00 |
Aichi | Toyota Central R&D Labs. | Proposal of A Concept Kernel Set and Its Properties for Vertex Mapping of Isomorphic Graphs Miharu Ukita, Yuki Ikeda, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.) CST2009-51 |
In this paper, we propose a new concept {\it kernel set} and describe its properties.A kernel set is the minimum set of ... [more] | CST2009-51 pp.79-84 |
| MSS | 2009-01-29 13:00 |
Kanagawa | Kanagawa Industrial Promotion Center | On Upper and Lower Bounds of Optimal Execution Time of Task Graph by Considering Communication Delays Takashi Otsuka, Masato Nakahara, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.), Yuu Moriyama, Hirotoshi Tonou (Fujitsu TEN Limited) CST2008-41 |
This paper deals with upper and lower bounds of optimal execution time of task graphs that are supposed to be executed i... [more] | CST2008-41 pp.1-4 |
| MSS | 2009-01-29 13:25 |
Kanagawa | Kanagawa Industrial Promotion Center | A Method of Petri Nets and Calculating the Elementary T-invariants for Public-key Cryptography MEPKC Ryo Yamaguchi, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.) CST2008-42 |
This paper aims at automatically generating Petri nets that are used as key generator of public-key cryptography MEPKC. ... [more] | CST2008-42 pp.5-10 |
| MSS | 2009-01-29 16:15 |
Kanagawa | Kanagawa Industrial Promotion Center | An Improved Algorithm to Generate Feature Graphs for Handwritten Character Recognition Masaki Hayashi, Shuichi Nishida, Mariko Kuramochi, Asami Ninomiya, Mitsuru Nakata, Qi-Wei Ge, Makoto Yoshimura (Yamaguchi Univ.) CST2008-48 |
In this paper, we propose an improved algorithm to generate feature graphs for handwritten character recognition. A fe... [more] |
CST2008-48 pp.39-44 |
| CAS, MSS | 2008-11-07 11:00 |
Osaka | Osaka University | GA Based Scheduling Method for Multi-Processor Systems with Communication Delays Masato Nakahara, Takashi Otsuka, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.), Yuu Moriyama, Hirotoshi Tonou (Fujitsu TEN) CAS2008-55 CST2008-33 |
This paper aims at developing a scheduling method for multiprocessor systems with communication time. In this paper, we ... [more] | CAS2008-55 CST2008-33 pp.59-64 |
| CAS, MSS | 2008-11-07 14:55 |
Osaka | Osaka University | An Algorithm to Evaluate Similarity of Feature Graphs for Handwritten Character Recognition Shuichi Nishida, Masaki Hayashi, Mariko Kuramochi, Asami Ninomiya, Mitsuru Nakata, Qi-Wei Ge, Makoto Yoshimura (Yamaguchi Univ.) CAS2008-61 CST2008-39 |
In this paper, we propose an improved algorithm to measure character fitness of feature graphs for handwritten characte... [more] |
CAS2008-61 CST2008-39 pp.95-100 |
| MSS | 2008-06-03 14:55 |
Aichi | Nagoyo University, Noyori Conference Hall | A Matching Algorithm of Feature Graphs for Handwritten Character Recognition Shuichi Nishida, Masaki Hayashi, Mitsuru Nakata, Qi-Wei Ge, Makoto Yoshimura (Yamaguchi Univ.) CST2008-9 |
This paper proposes a matching algorithm of feature graphs for recognizing hand-written characters. A feature graph is a... [more] | CST2008-9 pp.25-30 |
| MSS | 2008-01-28 13:00 |
Tokushima | The University of Tokushima | A Control Alogrithm for Multi-Car Elevators by Considering Moving Range and Direction of Cars Yuki Kuroda, Mitsuru Nakata (Yamaguchi Univ.) CST2007-39 |
Recently, it is required to improve elevator's transportation with the increasing of multistory building. Multi car elev... [more] | CST2007-39 pp.23-26 |
| MSS | 2008-01-29 10:20 |
Tokushima | The University of Tokushima | A Method of Generating and Complicating Petri Nets Used as Key-generator of a public-key cryptgraphy MEPKC Ryosuke Murakami, Ryo Yamaguchi, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ) CST2007-48 |
This paper aims at automatically generating Petri nets that are used as key generator of a public-key cryptography MEP... [more] |
CST2007-48 pp.11-16 |
| MSS | 2008-01-29 11:20 |
Tokushima | The University of Tokushima | A Scheduling Method for Multi-Processor Systems with Communication Delays Takashi Otsuka, Hironori Youhata, Qi-Wei Ge, Mitsuru Nakata (Ymaguchi Univ.), Yuu Moriyama, Hirotoshi Tonou (Fujitsu TEN) CST2007-50 |
This paper aims at designing a scheduling method for multiprocessor systems with communication time. First, we propose a... [more] | CST2007-50 pp.23-28 |
| MSS | 2008-01-29 13:30 |
Tokushima | The University of Tokushima | A Method of Generating Graphs of Character Structures for Japanese Historical Documents Masaki Hayashi, Nami Saitoh, Mitsuru Nakata, Qi-Wei Ge, Makoto Yoshimura (Yamaguchi Univ.) CST2007-52 |
In this paper, we propose a method of generating a feature graph for recognition of handwritten characters in Japanese h... [more] | CST2007-52 pp.35-40 |
| MSS | 2007-08-31 13:50 |
Shimane | Shimane University | On Modeling Handwritten Characters for Identifying Ages of Japanese Historical Documents Based on Graph Theory Ri-Nan Cui, Nami Saitou, Mitsuru Nakata, Qi-Wei Ge, Makoto Yoshimura (Yamaguchi Univ.) CST2007-13 |
There are many Japanese historical documents whose authors and written age are unclear. To clarify these, we have to do... [more] |
CST2007-13 pp.13-18 |
| MSS | 2007-06-29 10:15 |
Okinawa | An algorithm to enumerate all the elementary T-invariants of auto-generated Petri nets Ryo Yamaguchi, Ryosuke Murakami, Mitsuru Nakata, Qi-Wei Ge (Yamaguchi Univ.) CST2007-9 |
In this paper, we propose an algorithm to enumerate all the elementary T-invariants of auto-generated Petri nets that ... [more] |
CST2007-9 pp.15-20 |
|
| MSS | 2007-01-26 13:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A Proposal of Dynamic Multi-processor Scheduling by Considering Critical Path Hironori Youhata, Takashi Otsuka, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.), Hirotoshi Tonou (Fujitsu TEN) |
[more] | CST2006-39 pp.7-12 |
| MSS | 2006-07-26 10:50 |
Kyoto | Kyoto Institute of Technology | Dynamic Scheduling for Multiprocessor Systems with Static Priority Lists Hironori Youhata, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.), Hirotoshi Tonou (Fujitsu TEN) |
[more] | CST2006-12 pp.13-18 |
| MSS | 2006-01-27 10:30 |
Kanagawa | Toshiba Kagaku-Kan | On Generating Key-generators for a Public-key Cryptography - MEPKC Ryosuke Murakami, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.) |
[more] | CST2005-42 pp.19-24 |
| MSS | 2006-01-27 11:00 |
Kanagawa | Toshiba Kagaku-Kan | On Verification of Specification Satisfaction for Software Designed by Module Composition Yuan-Kai Lei, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ,), Hirotoshi Tonou (Fujitsu Ten) |
[more] | CST2005-43 pp.25-30 |
| MSS, CAS | 2005-11-11 10:00 |
Yamaguchi | Yamaguchi University | Structural Representation of Signaling Pathways by T-invariants Shunichi Suzuki, Chen Li, Qi-Wei Ge, Mitsuru Nakata, Hiroshi Matsuno (Yamaguchi Univ.), Satoru Miyano (Univ. of Tokyo) |
[more] | CAS2005-62 CST2005-31 pp.7-12 |
[Return to Top Page]