Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
MSS, CAS |
2007-11-29 13:00 |
Niigata |
Niigata University |
Control-invariance of sampled-data control hybrid systems Yoshiyuki Tsuchie, Toshimitsu Ushio (Osaka Univ.) CAS2007-67 CST2007-18 |
We consider a hybrid system controlled by a sampled-data state feedback
controller whose input can be updated at every... [more] |
CAS2007-67 CST2007-18 pp.1-6 |
MSS, CAS |
2007-11-29 13:25 |
Niigata |
Niigata University |
A Heuristic Algorithm to Compute Parallel Degree of Well-Structured Workflow Nets by Considering Longest Path Yuji Kaneko, Shingo Yamaguchi, Qi-Wei Ge, Minoru Tanaka (Yamaguchi Univ.) CAS2007-68 CST2007-19 |
In this paper, we propose a heuristic algorithm to compute parallel degree, PARAdeg, of a well-structured WF-net by cons... [more] |
CAS2007-68 CST2007-19 pp.7-10 |
MSS, CAS |
2007-11-29 13:50 |
Niigata |
Niigata University |
Optimal Scheduling of Soft Real-time Computing Systems Using Language Measure Yuri Murata, Toshimitsu Ushio (Osaka Univ.) CAS2007-69 CST2007-20 |
In soft real-time systems, if a task completes after its deadline, its utility degrades gradually as its completion is d... [more] |
CAS2007-69 CST2007-20 pp.11-16 |
MSS, CAS |
2007-11-29 14:30 |
Niigata |
Niigata University |
Theoretical Analysis of Path Quality in Multi-Hop Wireless Networks Yusuke Morioka, Kazuyuki Miyakita, Keisuke Nakano, Masakazu Sengoku (Niigata Univ.), Shoji Shinoda (Chuo Univ.) CAS2007-70 CST2007-21 |
In multi-hop wireless networks, the source and destination nodes usually have some candidate paths between them, and the... [more] |
CAS2007-70 CST2007-21 pp.17-22 |
MSS, CAS |
2007-11-29 14:55 |
Niigata |
Niigata University |
On the Permutation Routing in All-Optical Caterpillar Networks Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2007-71 CST2007-22 |
We consider the optical routing for permutation requests in a WDM all-optical tree network. We show that the optical rou... [more] |
CAS2007-71 CST2007-22 pp.23-27 |
MSS, CAS |
2007-11-29 15:20 |
Niigata |
Niigata University |
A Proposal of Directional Interpolation for Digital Halftone Printing Akira Iijima, Hisakazu Kikuchi, Shogo Muramatsu (Niigata Univ.) CAS2007-72 CST2007-23 |
Bilevel halftones are used for printing color digital images. The interpolation of color pixel values prior to digital h... [more] |
CAS2007-72 CST2007-23 pp.29-34 |
MSS, CAS |
2007-11-29 16:00 |
Niigata |
Niigata University |
[Invited Talk]
Geographical Information Systems and Natural Disaster around Niigata Prefecture Hiromitsu Yamagishi (Niigata Univ.) |
[more] |
|
MSS, CAS |
2007-11-30 09:30 |
Niigata |
Niigata University |
On Implementation of Secret Sharing Distributed Database System using Multi Agent Nets Shota Minakami, Toshiyuki Miyamoto, Sadatoshi Kumagai (Osaka Univ) CAS2007-73 CST2007-24 |
In recent years, need for distributed database system has increased
due to growing amount and types of data.
Reliabi... [more] |
CAS2007-73 CST2007-24 pp.1-6 |
MSS, CAS |
2007-11-30 09:55 |
Niigata |
Niigata University |
Network coding and related edge coloring problems in graph theory Hiroshi Tamura (Niigata Inst. Tech.), Masakazu Sengoku (Niigata Univ.), Shoji Shinoda (Chuo Univ.) CAS2007-74 CST2007-25 |
Network coding is a new technology in information network. The network coding allows the routers to mix the information ... [more] |
CAS2007-74 CST2007-25 pp.7-11 |
MSS, CAS |
2007-11-30 10:20 |
Niigata |
Niigata University |
CST Solution Competition 2007
-- Detail of Evaluation Tool -- Toshiyuki Miyamoto (Osaka Univ.), Shingo Yamaguchi (Yamaguchi Univ.) CAS2007-75 CST2007-26 |
The CST Solution Competition 2007 gives student teams
a problem of controlling a multi-car elevator (MCE).
Each studen... [more] |
CAS2007-75 CST2007-26 pp.13-18 |
MSS, CAS |
2007-11-30 11:00 |
Niigata |
Niigata University |
[Fellow Memorial Lecture]
Study of the Graph Theory with Applications to Circuits and Systems Shuichi Ueno (TIT) CAS2007-76 CST2007-27 |
The author has been engaged in research with a number of co-researchers on the graph theory with applications to electri... [more] |
CAS2007-76 CST2007-27 p.19 |
MSS, CAS |
2007-11-30 13:00 |
Niigata |
Niigata University |
Cooperative Searching on Parallel Particle Swarm Optimization Koyo Namihira, Morikazu Nakamura (Univ. of the Ryukyus) CAS2007-77 CST2007-28 |
This paper proposes a cooperative processing in parallel Particle Swarm Optimization (PSO). The proposed technique is ba... [more] |
CAS2007-77 CST2007-28 pp.21-26 |
MSS, CAS |
2007-11-30 13:25 |
Niigata |
Niigata University |
An Algebraic Approach to Rechability Problems of P/T Petri Nets Tadashi Matsumoto, Masahiro Osogami (Fukui Univ. of Tech.), Seiichiro Moro (Fukui Univ.) CAS2007-78 CST2007-29 |
P/T Petri nets are one of useful models for discrete event systems.
In this paper, an algebraic approach to reachabili... [more] |
CAS2007-78 CST2007-29 pp.27-30 |
MSS, CAS |
2007-11-30 13:50 |
Niigata |
Niigata University |
A Heuristic Algorithm AADO for Minimizing Initial Markings of Petri Nets Satoru Ochiiwa, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2007-79 CST2007-30 |
[more] |
CAS2007-79 CST2007-30 pp.31-36 |
MSS, CAS |
2007-11-30 14:30 |
Niigata |
Niigata University |
Code System for Rectangular Packing in 2D Torus Space Takayuki Shibata, Mineo Kaneko (JAIST) CAS2007-80 CST2007-31 |
We encounter rectangular packing in 2D Torus space in VLSI layout where the same set of components is placed repeatedly ... [more] |
CAS2007-80 CST2007-31 pp.37-42 |
MSS, CAS |
2007-11-30 14:55 |
Niigata |
Niigata University |
Design of Non-separable Orthogonal Symmetric Wavelets with a Lattice Structure Shogo Muramatsu, Atsuyuki Adachi, Hisakazu Kikuchi (Niigata Univ.) CAS2007-81 CST2007-32 |
In this work, a design method of two-dimensional (2-D) orthogonal
symmetric wavelets is proposed by using a lattice st... [more] |
CAS2007-81 CST2007-32 pp.43-48 |
MSS, CAS |
2007-11-30 15:20 |
Niigata |
Niigata University |
A Generation Method of Pseudo-random Binary Sequence with Correlation in Only One of Code Intervals Takuya Amekawa, Kouichi Ohnuma (Tohoku Gakuin Univ.) CAS2007-82 CST2007-33 |
A generation method of pseudo-random binary sequence with correlation at only one of code intervals in a polarity range ... [more] |
CAS2007-82 CST2007-33 pp.49-54 |
MSS, CAS |
2007-11-30 15:45 |
Niigata |
Niigata University |
Finding a longest common subsequence of two twistable sequences Youhei Inoue, Toshihiko Takahashi (Niigata Univ.) CAS2007-83 CST2007-34 |
Finding a longest common subsequence (LCS) for two given sequences is called the LCS problem, which is classic and solve... [more] |
CAS2007-83 CST2007-34 pp.55-58 |