Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
MSS |
2013-01-22 10:45 |
Osaka |
Osaka Int. Convention Center |
An application of arbitration-based multicriteria games to a water resource problem Hiromi Tsubotani, Takafumi Kanazawa, Toshimitsu Ushio (Osaka Univ.) MSS2012-45 |
Because of the great importance of water for daily life and industrial activities, a water resource development often ca... [more] |
MSS2012-45 pp.1-4 |
MSS |
2013-01-22 11:10 |
Osaka |
Osaka Int. Convention Center |
A game-theoretic analysis of electronic commerce
-- on the effect of customer reviews -- Akihiro Yoshida, Chiaki Sakama (Wakayama Univ.) MSS2012-46 |
In electronic commerce, online customer reviews play an important role for users in making purchase decisions and select... [more] |
MSS2012-46 pp.5-9 |
MSS |
2013-01-22 11:35 |
Osaka |
Osaka Int. Convention Center |
Path Prediction using a Path Planning Method under the Lack of Observed Data Situation Megumi Sawada, Atsuo Ozaki, Shusuke Watanabe (Mitsubishi Electric) MSS2012-47 |
When observed data of the aircraft is the lack during the radar tracking, Path Prediction is generally made on the assum... [more] |
MSS2012-47 pp.11-15 |
MSS |
2013-01-22 14:25 |
Osaka |
Osaka Int. Convention Center |
On Polynomial Time Checking on Reachability in Sound Extended Free-Choice Workflow Nets Daiki Kano, Shingo Yamaguchi (Yamaguchi Univ.) MSS2012-48 |
There are two aspects of a workflow: definition and instance.
In this paper, we tackle verification of correctness of w... [more] |
MSS2012-48 pp.17-21 |
MSS |
2013-01-22 14:50 |
Osaka |
Osaka Int. Convention Center |
On Analysis on Reachability to Unsafe Markings in Free Choice Workflow Nets Yuki Murakami, Ichiro Toyoshima, Shingo Yamaguchi (Yamaguchi Univ.) MSS2012-49 |
In the Free Choice Workflow net, the marking always reach to non-safety marking means that the workflow's instance can... [more] |
MSS2012-49 pp.23-26 |
MSS |
2013-01-22 15:15 |
Osaka |
Osaka Int. Convention Center |
An Algorithm of Finding Dependent Subnets for Retention-Free Petri Nets Tadataka Matsumoto, Qi-Wei Ge, Hiroshi Matsuno (Yamaguchi Univ.) MSS2012-50 |
In this paper, we examine a dependency relationship among transitions in the
retention-free Petri net model of a signal... [more] |
MSS2012-50 pp.27-32 |
MSS |
2013-01-22 15:50 |
Osaka |
Osaka Int. Convention Center |
[Invited Talk]
Design and Performance Analysis of Algorithms for Petri Nets Toshimasa Watanabe (Hiroshima Univ.) MSS2012-51 |
[more] |
MSS2012-51 pp.33-38 |
MSS |
2013-01-23 10:40 |
Osaka |
Osaka Int. Convention Center |
Observability Analysis of Discrete Event Systems Modeled by Concurrent Synchronous Products Longjiang Wang, Shigemasa Takai (Osaka Univ.) MSS2012-52 |
In this paper, we study supervisory control of concurrent discrete event systems under the assumption that both the plan... [more] |
MSS2012-52 pp.39-44 |
MSS |
2013-01-23 11:05 |
Osaka |
Osaka Int. Convention Center |
Self-Triggered Optimal Control of Linear Systems Focusing on Prediction Horizon One Koichi Kobayashi, Kunihiko Hiraishi (JAIST) MSS2012-53 |
Self-triggered control is a control method that the control input and the sampling period are computed simultaneously in... [more] |
MSS2012-53 pp.45-48 |
MSS |
2013-01-23 11:30 |
Osaka |
Osaka Int. Convention Center |
Effectiveness of Group Control of 2 Shaft Elevator for Peak Power Cut and Service Performance Kentaro Nakayama, Koji Takahashi (Tokyo tech) MSS2012-54 |
[more] |
MSS2012-54 pp.49-54 |
MSS |
2013-01-23 11:55 |
Osaka |
Osaka Int. Convention Center |
A study on stability of stable marriage problem with multicriteria preference list Hideki Kinjo (Okinawa Univ.), Morikazu Nakamura (Univ. of the Ryukyus.) MSS2012-55 |
In the stable matching problem, we are given a set of men and women, and each member's preference list that orders membe... [more] |
MSS2012-55 pp.55-60 |
MSS |
2013-01-23 15:20 |
Osaka |
Osaka Int. Convention Center |
A Proposal of Similarity Evaluation for Ordered Trees
-- Application to Similarity Verification of C Language Programs -- Huricha Bao, Mitsuru Nakata, Qi-Wei Ge (Yamaguchi Univ.) MSS2012-56 |
In this paper,we deal with evaluation method of similarity of two given ordered trees. A similarity computation techniqu... [more] |
MSS2012-56 pp.61-64 |
MSS |
2013-01-23 15:45 |
Osaka |
Osaka Int. Convention Center |
Proposal of Algorithm to Finding Determiner Set for Graphs Kurumi Kouchi, Mitsuru Nakata, Qi-Wei Ge (Yamaguchi Univ) MSS2012-57 |
Given with a graph $G$ and its isomorphic graph $G'$, there may have multiple one-to-one correspondences between the ver... [more] |
MSS2012-57 pp.65-70 |
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 |