| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| MSS |
2005-01-27
10:00 |
Tokyo |
Univ. of Electro-Communications |
A New Proposal of Petri Net Based Formulation for Analyzing Signaling Pathways
Chen Li, Shunichi Suzuki, Qi-Wei Ge, Mitsuru Nakata, Hiroshi Matsuno (Yamaguchi Univ.), Satoru Miyano (Univ. of Tokyo) |
In this research, we propose a new method for formulating and analyzing a signaling pathway with a focus on enzymes by a... [more] |
CST2004-39
pp.1-6 |
| MSS |
2005-01-27
10:25 |
Tokyo |
Univ. of Electro-Communications |
On Computation of PARAdeg of Data-Flow Program Nets with SWITCH-nodes
Tatsuya Watanabe, Shingo Yamaguchi, Qi-Wei Ge, Minoru Tanaka (Yamaguchi Univ.) |
[more] |
CST2004-40
pp.7-12 |
| MSS |
2005-01-27
10:50 |
Tokyo |
Univ. of Electro-Communications |
Specification Verification by Conversion of each SDL Process Instance into Petri Nets
Haruo Hasegawa (Oki Electric), Seiichiro Moro (Fukui Univ.), Tadashi Matsumoto (Fukui Univ. of Technology) |
A specification of terminal is represented as a type of process, and actual behavior of each terminal is as each instanc... [more] |
CST2004-41
pp.13-18 |
| MSS |
2005-01-27
11:15 |
Tokyo |
Univ. of Electro-Communications |
Linear Programming-based Computation of Petri Net Invariants with Supports Containing Specified Places
Atsushi Iriboshi, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) |
A $P$-invariant of a Petri net $ N = (P,T,E,\alpha,\beta) $ is a
$|P|$-dimensional vector $Y$ with $Y^{tr}\cdot A = \ba... [more] |
CST2004-42
pp.19-24 |
| MSS |
2005-01-27
13:00 |
Tokyo |
Univ. of Electro-Communications |
A basic study of genetic network estimation with Bayesian network
Kimi So, Takeo Okazaki (Univ. of the Ryukyus) |
[more] |
CST2004-43
pp.25-29 |
| MSS |
2005-01-27
13:25 |
Tokyo |
Univ. of Electro-Communications |
A Parallel Computing System on Data Grid Environment using Process Migration
Tsuguhiro Kondo, Hirotsugu Kakugawa (Hiroshima Univ.) |
In the data grid technology, technique of the parallel processing with many computing nodes is used to achieve efficient... [more] |
CST2004-44
pp.31-36 |
| MSS |
2005-01-27
13:50 |
Tokyo |
Univ. of Electro-Communications |
On Computation of Worst Change Time for Flush, Abort, SCO Dynamic Changes of State Machine Workflow Nets
Katsuaki Miyauchi, Shingo Yamaguchi, Qi-Wei Ge, Minoru Tanaka (Yamaguchi Univ.) |
This paper discusses computation of worst change time for Flush, Abort, Synthetic Cut-Over (SCO) dynamic change of state... [more] |
CST2004-45
pp.37-42 |
| MSS |
2005-01-27
14:15 |
Tokyo |
Univ. of Electro-Communications |
Decentralized Supervisory Control Using Dynamic Default Control
Shigemasa Takai (Kyoto Inst. of Tech.), Toshimitsu Ushio (Osaka Univ.) |
The conventional decentralized supervisory control architectures for discrete event systems assume that default control ... [more] |
CST2004-46
pp.43-48 |
| MSS |
2005-01-27
14:50 |
Tokyo |
Univ. of Electro-Communications |
Distributed DataBase System using Secret Sharing Sheme
Yasuhiro Morita, Toshiyuki Miyamoto, Sadatoshi Kumagai (Osaka Univ) |
[more] |
CST2004-47
pp.49-54 |
| MSS |
2005-01-27
15:15 |
Tokyo |
Univ. of Electro-Communications |
An Evolutionary Tree-base Method for Multiple Alignment Problems
Chihiro Miyazato, Morikazu Nakamura (Ryukyu Univ.), Yumiko Nakajima (Univ. of the Ryukyus) |
In the recent bio-science, the post genome research, to investigate the functions of genomes, has been focused. The mult... [more] |
CST2004-48
pp.55-59 |
| MSS |
2005-01-27
15:40 |
Tokyo |
Univ. of Electro-Communications |
A I Clusteringethod based on Multiple Quasi-Minimum Spanning Trees
Daisuke Kagawa, Morikazu Nakamura (Ryukyu Univ.), Yumiko Nakajima (Univ. of the Ryukyus) |
This paper proposes a clustering method based on multiple quasi-minimal spanning trees to obtain good quality clusters f... [more] |
CST2004-49
pp.61-65 |
| MSS |
2005-01-27
16:05 |
Tokyo |
Univ. of Electro-Communications |
Improving Computation of Legal Firing Sequences of Petri Nets based on Behavioral Deadlock Avoidance
Yasutoshi Yoshimoto, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) |
The paper proposes heuristic algorithms RADEQk and RADEQk_Ri for
the Maximum Legal Firing Sequence problem of Petri ne... [more] |
CST2004-50
pp.67-72 |