| Title | Delay Time Estimation for Petri Net Models of Signaling Pathways Based on Experimental Data |
| Author | *Yoshimasa Miwa, Kanji Hioka (Yamaguchi University, Japan), Chen Li (University of Tokyo, Japan), Hiroshi Matsuno (Yamaguchi University, Japan), Satoru Miyano (University of Tokyo, Japan) |
| Page | pp. 297 - 300 |
| Keyword | signaling pathway, Petri net, delay time estimation, simulation |
| Abstract | In this paper, we propose a delay time estimation algorithm for Petri net models of signaling pathways based on experimental data.
Firstly, we model signaling pathways (we use the example of ErbB4 receptor signaling pathway) with discrete Petri nets.
Then, we propose a delay time estimation algorithm for Petri net models with experimental data,
and assign estimated delay times to a model to be run on the simulation tool Cell Illustrator 3.0.
Finally, we verify the simulation result by comparing with the experimental data and evaluate the performance of the estimation algorithm. |
| Title | Edge Coloring Problem of Graph Theory Considering Interference on Network Coding |
| Author | *Hiroshi Tamura (Niigata Institute of Technology, Japan), Masakazu Sengoku (Niigata University, Japan), Shoji Shinoda (Chuo University, Japan) |
| Page | pp. 301 - 304 |
| Keyword | Multihop wireless network, network coding, edge coloring, graph theory |
| Abstract | Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message from a terminal and send it to the other terminal. If a terminal can not communicate the other terminal that sends data directly, some terminals relay the data. Network coding is a new architecture for wireless network and various applications using this architecture are expected. In this paper, we expand the previous coloring problem and propose a new coloring problem including the architecture. |
| Title | A Method of Generating Feature Graph for Handwritten Character Recognition of Japanese Historical Documents |
| Author | *Masaki Hayashi (Graduate School of Education, Yamaguchi University, Japan), Shuichi Nishida (Graduate School of Education, Yamaguchi University, Japan), Mitsuru Nakata, Qi-Wei Ge, Makoto Yoshimura (Yamaguchi University, Japan) |
| Page | pp. 305 - 308 |
| Keyword | feature graph, Handwritten Character Recognition, clustring, curve vertices |
| Abstract | In this paper, we propose a method of generating feature graphs for recognition of handwritten characters in Japanese historical documents. The feature graph represents structure of a handwritten character. In our method, the feature graph is generated as follows: (1) a rough graph is generated by thinning, clustering and other processes; (2) connections between vertices are retrieved with edge trace; (3) the curve vertices, which express curved strokes of a character, are added into the graph; (4) relative locations between vertices are calculated. |
| Title | On Verification and Application of Behavioral Inheritance for Parallel Synchronized Interworkflows |
| Author | Shingo Yamaguchi, *Tetsushi Narui, Qi-Wei Ge, Minoru Tanaka (Yamaguchi University, Japan) |
| Page | pp. 309 - 312 |
| Keyword | interworkflow, WF-net, branching bisimirality, behavioral inheritance |
| Abstract | Behavioral inheritance guarantees that interworkflow can be substituted for workflow. Nevertheless it may happen that the behavior is not inherited. Behavioral inheritance can be verified by comparing the reachability graphs of the WF-nets representing interworkflow and workflow. However this verification method is limited to small interworkflows due to the complexity of the state-space explosion. we propose a condition to verify behavioral inheritance of Parallel synchronized interworkflows. |
| Title | A Linear Time Algorithm for Tri-connectivity Augmentation of Bi-connected Graphs with Upper Bounds on Vertex-Degree Increase |
| Author | *Toshiya Mashima (Hiroshima International University, Japan), Satoshi Taoka, Toshimasa Watanabe (Hiroshima University, Japan) |
| Page | pp. 313 - 316 |
| Keyword | graph, algorithm, connectivity, augmentation problem, degree constraints |
| Abstract | The $3$-vertex-connectivity augmentation problem of a graph with degree constraints, $3$VCA-DC, is defined as follows: ``Given an undirected graph $G=(V,E)$, and an upper bound $b(v)\in Z^+\cup\{\infty\}$ on vertex-degree increase for each $v\in V$, find a smallest set $E'$ of edges such that $(V,E\cup E')$ is 3-vertex-connected and such that vertex-degree increase of each $v\in V$ by the addition of $E'$ to $G$ is at most $b(v)$, where $Z^+$ is the set of nonnegative integers.''In this paper we show that checking the existence of a feasible solution and finding an optimum solution to $3$VCA-DC for any bi-connected graph $G$ can be done in $O(|V|+|E|)$ time. |