| 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 # | |
| LOIS, ISEC, SITE | 2015-11-07 09:55 |
Kanagawa | Kanagawa Univ. | Evaluation of the Web System U-MOS for Supporting University Management Operation Satoshi Taoka (Hiroshima Univ.)  ISEC2015-50 SITE2015-37 LOIS2015-44 |
[more] | ISEC2015-50 SITE2015-37 LOIS2015-44 pp.93-97 |
| SS, MSS | 2014-01-30 16:15 |
Aichi | Solvability for The Maximum Legal Firing Sequence Problem of Inhibitor-Arc Petri nets
-- Unweighted/Weighted Conflict-Free Petri nets -- Satoshi Taoka, Satoru Ochiiwa, Toshimasa Watanabe (Hiroshima Univ.) MSS2013-58 SS2013-55 |
[more] | MSS2013-58 SS2013-55 pp.41-45 |
|
| MSS, SS | 2013-03-06 14:50 |
Fukuoka | Shikanoshima | A Support Tool for Understanding Programs and Visualizing Algorithms
-- Creating Flowcharts Based on Hierarchical Graph Drawings -- Rei Takahara, Fumiya Makimori, Masahiro Yamauchi (Kinki Univ.), Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) MSS2012-63 SS2012-63 |
The purpose of this paper is to make a support tool for understanding programs or algorithms written by the programming ... [more] | MSS2012-63 SS2012-63 pp.25-30 |
| CAS | 2013-01-28 13:50 |
Oita | Beppu International Convention Center | On Pairwise Vertex-Disjoint Paths Linking Two Nested Rectangular Boundaries in a Rectilinear Graph Hideto Hanada, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2012-73 |
In a rectilinear graph, a rectangle is fixed in another rectangle. The region bounded by two nested rectangles is $G$.... [more] |
CAS2012-73 pp.41-45 |
| CAS | 2013-01-28 14:10 |
Oita | Beppu International Convention Center | On Improving Order of Element Factoring in Calculating Traffic-Path-Based Reliability of Networks Takeshi Noguchi, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ) CAS2012-74 |
In this study, we focus on a reliability evaluation model N in which communication capacity reflected propertis of real ... [more] | CAS2012-74 pp.47-51 |
| MSS | 2013-01-23 16:10 |
Osaka | Osaka Int. Convention Center | Enhancing Local Search Algorithms for Organizing Conference Programs
-- Generating Initial Solutions and Neighborhood Swapping -- Masahiko Okumoto, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) MSS2012-58 |
Conference programs are required to satisfy wide variety of constraints and, therefore, organizing conference programs ... [more] | MSS2012-58 pp.71-76 |
| CAS, CS, SIP | 2012-03-09 14:45 |
Niigata | The University of Niigata | Performance Comparison of Heuristic Algorithms for the Graph Coloring Problem Yuta Koshin, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2011-145 SIP2011-165 CS2011-137 |
Graph coloring is an assignment of colors to vertices of a given undirected graph G=(V,E) such that any pair of adjacent... [more] | CAS2011-145 SIP2011-165 CS2011-137 pp.213-218 |
| CAS | 2012-01-19 09:25 |
Fukuoka | Kyushu Univ. | Planarity of Graphs Having Subgraphs with Fixed Embedding Constraint Shun Ohno, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2011-86 |
[more] | CAS2011-86 pp.7-12 |
| LOIS | 2011-03-04 16:05 |
Okinawa | Ishigaki IT business support center | A Web-based Questionnaire and its Evaluation of Class-Assessment-by-Students Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) LOIS2010-96 |
[more] | LOIS2010-96 pp.185-190 |
| MSS | 2011-01-21 14:35 |
Yamaguchi | Kaikyo-Messe-Shimonoseki | Enhanced Algorithms for the Marking Construction Problem of Petri Nets based on Improvement of Finding Firing Sequeunces Atsuhito Yoshioka, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2010-78 |
[more] | CST2010-78 pp.103-108 |
| MSS | 2011-01-21 16:00 |
Yamaguchi | Kaikyo-Messe-Shimonoseki | Heuristic Algorithms for the Vertex Capacity Assignment Problem of a Stochastic-flow Network Hideaki Yamato, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2010-82 |
Vertex capacity assignment problem of a stochastic-flow network is defined as follows. “given a stochastic-flow network... [more] |
CST2010-82 pp.127-132 |
| MSS, CAS | 2010-11-18 11:20 |
Osaka | Kansai Univ. | Heuristic Algorithms TPM and TMDLO for Minimizing Initial Markings of Timed Petri Nets Satoru Ochiiwa, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2010-67 CST2010-40 |
[more] | CAS2010-67 CST2010-40 pp.13-18 |
| IE, LOIS, ITE-ME, IEE-CMN [detail] | 2010-09-21 13:30 |
Kochi | Development of the Educational Record System for Graduate School of Biosphere Science, Hiroshima University Hironori Irie, Daisuke Yoshimura, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) LOIS2010-18 IE2010-60 |
Graduate School of Biosphere Science, Hiroshima University obtained "Support Program for Improving Graduate School Educ... [more] |
LOIS2010-18 IE2010-60 pp.1-6 |
|
| MSS, CAS | 2009-11-26 11:10 |
Aichi | Nagoya University | Extending the Legal Firing Sequence Problem of Petri Nets and Making a General-Purpose Scheduler for Web-Based Applications Masanori Nakano, Masahiro Yamauchi (Kinki Univ.), Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) |
[more] | |
| CAS, NLP | 2009-09-24 10:05 |
Hiroshima | Hiroshima Univ. Higashi Senda Campus | Vertex-Deletion-based Enhancement of Heuristic Algorithms for Extracting a Maximum Induced Tree of a Graph Hiroyuki Yoshida, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2009-24 NLP2009-60 |
The problem of extracting a maximum induced tree of a graph (MAXIT) asks for a vertex set of largest cardinality among t... [more] | CAS2009-24 NLP2009-60 pp.1-6 |
| LOIS, IE, ITE-ME, IEE-CMN | 2009-09-25 09:40 |
Hiroshima | Hiroshima Univ. | Development of a Scheduling System for Conference Sessions Moriyuki Hata, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) LOIS2009-28 IE2009-69 |
The term ``Conference'' means an academic meeting in general for presentation and discussion on scientific research/edu... [more] |
LOIS2009-28 IE2009-69 pp.59-64 |
| LOIS | 2009-03-06 15:10 |
Okinawa | Okinawa-seinen-kaikan | A Report on Developing a Meta-Web-System "GECOD"
-- On Authentication, Authorization and Fundamentals of Generated Web Systems -- Tomoya Hamada, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) OIS2008-93 |
There are many works that can be efficiently done by means of Web systems. Collecting various information in questionna... [more] |
OIS2008-93 pp.107-112 |
| LOIS | 2009-03-06 15:40 |
Okinawa | Okinawa-seinen-kaikan | SUMOSYS: A System for Supporting University Management Operation in Collecting/Editing/Displaying Various Information Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) OIS2008-94 |
[more] | OIS2008-94 pp.113-118 |
| CAS, CS, SIP | 2009-03-03 15:00 |
Gifu | Nagaragawa Convention Center | On Solving the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs Yuichiro Taketoshi, Satoru Ochiiwa, Satoshi Taoka (Hiroshima Univ.), Masahiro Yamauchi (Kinki Univ.), Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) CAS2008-140 SIP2008-203 CS2008-114 |
[more] | CAS2008-140 SIP2008-203 CS2008-114 pp.217-222 |
| MSS | 2009-01-29 13:50 |
Kanagawa | Kanagawa Industrial Promotion Center | Enhancing an Algorithm for Finding Legal Firing Sequences of Petri Nets by Means of Controlling Token Supply Flow and Conflicting Transition-based Backtracking Kaigo Hatano, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2008-43 |
The Maximum Legal Firing Sequence problem of Petri nets ( MAX-LFS for short) is defined as follows: ``Given a Petri... [more] |
CST2008-43 pp.11-16 |
[Return to Top Page]