| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Mathematical Systems Science and its Applications (MSS) (Searched in: 2010)
Search Results: Keywords 'from:2010-11-18 to:2010-11-18'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| MSS, CAS | 2010-11-18 10:30 |
Osaka | Kansai Univ. | On Soundness Verification for Workflow Nets with Inhibitor Arcs Yuki Shinohara, Shingo Yamaguchi (Yamaguchi Univ.)  CAS2010-65 CST2010-38 |
There may be a precedence order among activities in a workflow.Such a workflow can be modeled as a workflow net with inh... [more] | CAS2010-65 CST2010-38 pp.1-5 |
| MSS, CAS | 2010-11-18 10:55 |
Osaka | Kansai Univ. | A Probability-based State Space Analysis of Petri Nets Eleazar Jimenez Serrano (Kyushu Univ.) CAS2010-66 CST2010-39 |
We present a partial exploration metaheuristic method of state spaces derived from Petri nets for the analysis of reacha... [more] | CAS2010-66 CST2010-39 pp.7-12 |
| 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 |
| MSS, CAS | 2010-11-18 13:00 |
Osaka | Kansai Univ. | On the Complexity of Three-Dimensional Orthogonal Face Routing Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2010-68 CST2010-41 |
The 3-D switchbox routing is a fundamental problem on the physical design of 3-D integrated circuits. The 3-D channel is... [more] | CAS2010-68 CST2010-41 pp.19-24 |
| MSS, CAS | 2010-11-18 13:25 |
Osaka | Kansai Univ. | The simplest and smallest network on which the Ford-Fulkerson maximum flow procedure may fail to terminate Toshihiko Takahashi (Niigata Univ.) CAS2010-69 CST2010-42 |
[more] | CAS2010-69 CST2010-42 pp.25-30 |
| MSS, CAS | 2010-11-18 13:50 |
Osaka | Kansai Univ. | Quasi-Equiripple Design of FIR Filters by Updating Weighting Function Shosuke Kitamura, Kenji Suyama (Tokyo Denki Univ.) CAS2010-70 CST2010-43 |
In this paper, we propose a quasi-equiripple design method for complex approximation of FIR filters. In general, a min-m... [more] | CAS2010-70 CST2010-43 pp.31-36 |
| MSS, CAS | 2010-11-18 14:30 |
Osaka | Kansai Univ. | An improvement of correction for lens distortion in information retrieval from printed image by using cellular phones with cameras Hiroshi Kudo, Takafumi Shono, Mitsuji Muneyasu, Yoshiko Hanada (Kansai Univ.) CAS2010-71 CST2010-44 |
The information retrieval from the printed image by using a cellular phone attracts much attention. In this paper, we pr... [more] | CAS2010-71 CST2010-44 pp.37-40 |
| MSS, CAS | 2010-11-18 14:55 |
Osaka | Kansai Univ. | On Transforming UML Communication Diagrams to UML State Machine Diagrams by Deleting T-T Bridges Yasuwo Hasegawa, Toshiyuki Miyamoto (Osaka Univ.) CAS2010-72 CST2010-45 |
Service Oriented Architecture(SOA) is an architecture style to build up a information system composing a set of system c... [more] | CAS2010-72 CST2010-45 pp.41-46 |
| MSS, CAS | 2010-11-18 15:30 |
Osaka | Kansai Univ. | Design of CSD Coefficients FIR Filters using PSO with Perturbation Takashi Konakahara, Kenji Suyama (Tokyo Denki Univ.) CAS2010-73 CST2010-46 |
In this paper, we present a design method for CSD coefficient FIR filters using the PSO(Particle Swarm Optimization). ... [more] |
CAS2010-73 CST2010-46 pp.47-52 |
| MSS, CAS | 2010-11-18 15:55 |
Osaka | Kansai Univ. | Design of IIR Filters by Allocating Poles and Zeros using PSO Takuya Matsumoto, Kenji Suyama (Tokyo Denki Univ.) CAS2010-74 CST2010-47 |
In this paper, a stable IIR(Infinite Impulse Response) filter design method with a specified maximum pole radius using t... [more] | CAS2010-74 CST2010-47 pp.53-58 |
| MSS, CAS | 2010-11-18 16:20 |
Osaka | Kansai Univ. | Brayton-Moser equations with application to FitzHugh-Nagumo models Naotake Yoshida, Hiroaki Yoshimura (Waseda Univ.) CAS2010-75 CST2010-48 |
We first study interconnection and Brayton-Moser equations for circuits, which are well-known as fundamental equations i... [more] | CAS2010-75 CST2010-48 pp.59-62 |
| MSS, CAS | 2010-11-18 17:00 |
Osaka | Kansai Univ. | [Invited Talk]
An Approach to Module Placement: Sequence Pair and its Expansion Mineo Kaneko (JAIST) CAS2010-76 CST2010-49 |
[more] | CAS2010-76 CST2010-49 p.63 |
| MSS, CAS | 2010-11-19 10:00 |
Osaka | Kansai Univ. | A switching method of distances for keystroke dynamics Yoshihiro Kaneko, Yuji Kinpara, Yuta Shiomi (Gifu Univ.) CAS2010-77 CST2010-50 |
Keystroke dynamics-based user authentication research has been done for decades and been positioned as one of inexpensiv... [more] | CAS2010-77 CST2010-50 pp.65-70 |
| MSS, CAS | 2010-11-19 10:25 |
Osaka | Kansai Univ. | ADE-LIM for the Fast Transient Simulation of Multiconductor Transmission Lines and Its Estimation Hiroki Kurobe, Tadatoshi Sekine, Hideki Asai (Shizuoka Univ.) CAS2010-78 CST2010-51 |
This report describes an application techique of the alternating direction explicit-latency insertion mehod (ADE-LIM) to... [more] | CAS2010-78 CST2010-51 pp.71-76 |
| MSS, CAS | 2010-11-19 10:50 |
Osaka | Kansai Univ. | High-speed Electromagnetic Simulation Based on 3-D HIE-FDTD Method by Using GPU Masaki Unno, Hideki Asai (Shizuoka Univ.) CAS2010-79 CST2010-52 |
[more] | CAS2010-79 CST2010-52 pp.77-82 |
| MSS, CAS | 2010-11-19 15:20 |
Osaka | Kansai Univ. | A Study of a Symbolic Encoding Method for Bounded Model Checking of UML State Machines with Synchronous and Asynchronous Transitions Hayato Niimura, Toshiyuki Miyamoto (Osaka Univ.) CAS2010-80 CST2010-53 |
Recently, Bounded Model Checking has received attention as a SAT-based symbolic model checking technique. The basic idea... [more] | CAS2010-80 CST2010-53 pp.83-88 |
| MSS, CAS | 2010-11-19 15:45 |
Osaka | Kansai Univ. | Task Scheduling based on Degradation of Control Performance by Job Skip in Cyber-physical Systems Tatsuya Yoshimoto, Toshimitsu Ushio (Osaka Univ.) CAS2010-81 CST2010-54 |
In cyber-physical systems, it is an important issue to develop a scheduling method which considers both control performa... [more] | CAS2010-81 CST2010-54 pp.89-94 |
| MSS, CAS | 2010-11-19 16:10 |
Osaka | Kansai Univ. | Braess's Paradox in Graph B^k with Two Sources Shimpei Hamaguchi, Takafumi Kanazawa, Toshimitsu Ushio (Osaka Univ.) CAS2010-82 CST2010-55 |
Selfish routing is a selfish route selection of players in computer networks. Players are assumed to select paths so as ... [more] | CAS2010-82 CST2010-55 pp.95-99 |
| MSS, CAS | 2010-11-19 16:35 |
Osaka | Kansai Univ. | Decentralized Supervisory Control for Timed Discrete Event Systems Masashi Nomura, Shigemasa Takai (Osaka Univ.) CAS2010-83 CST2010-56 |
In the framework of supervisory control of timed discrete event systems (TDESs), a supervisor decides the set of eventst... [more] | CAS2010-83 CST2010-56 pp.101-106 |
[Return to Top Page]