IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

Technical Committee on Mathematical Systems Science and its Applications (MSS)  (Searched in: 2005)

Search Results: Keywords 'from:2005-11-10 to:2005-11-10'

[Go to Official MSS Homepage (Japanese)] 
Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Ascending)
 Results 1 - 20 of 21  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
MSS, CAS 2005-11-10
10:30
Yamaguchi Yamaguchi University Max-Flow Scheduling in High Level Synthesis
Liangwei Ge, Kouhei Isoda, Takeshi Yoshimura (Waseda Univ.)
Scheduling in essence is a process of finding a matching between operations and control steps in the bipartite graph. In... [more] CAS2005-49 CST2005-18
pp.1-6
MSS, CAS 2005-11-10
10:55
Yamaguchi Yamaguchi University An Application of State Feedback Control to Scheduling of Periodic Tasks on Dynamic Reconfigurable Device
Kenji Onogi, Toshimitsu Ushio (Osaka Univ.)
A dynamic reconfigurable device is a device which can change its hardware configuration dynamically in order to achieve ... [more] CAS2005-50 CST2005-19
pp.7-12
MSS, CAS 2005-11-10
11:20
Yamaguchi Yamaguchi University On the Complexity of Fault Testing for Reversible Circuits
Shigeru Ito, Yusuke Ito, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.)
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on a set of wires of a r... [more] CAS2005-51 CST2005-20
pp.13-16
MSS, CAS 2005-11-10
13:00
Yamaguchi Yamaguchi University A Vertical Partitioning Algorithm for the Secret Sharing Distributed Database Management System
Toshiyuki Miyamoto, Yasuhiro Morita, Sadatoshi Kumagai (Osaka Univ.)
Because the amount of data treated by a database system increases,
the necessity of distributed database management sy... [more]
CAS2005-52 CST2005-21
pp.17-22
MSS, CAS 2005-11-10
13:25
Yamaguchi Yamaguchi University Formula Derivation of the Number of Migration Times for Mobile Agent with Retransmission Function and Its Application
Masayuki Sato (Yamaguchi Univ.), Misako Urakami (Oshima N.C.T.), Hiroshi Matsuno (Yamaguchi Univ.)
In recent years, when getting safety information in an emergency and information for navigate vessels in the inland sea,... [more] CAS2005-53 CST2005-22
pp.23-28
MSS, CAS 2005-11-10
13:50
Yamaguchi Yamaguchi University Design Method of Embedded Systems Based on Probabilistic Timed Interface Theoeries
Satoshi Yamane, Tsuneo Arai (Kanazawa Univ.)
Embedded systems, from control systems to home information appliances,
are increasingly deployed in safety-critical si... [more]
CAS2005-54 CST2005-23
pp.29-34
MSS, CAS 2005-11-10
14:35
Yamaguchi Yamaguchi University Relationship calculation on weighted directed graph and its validity examination in ranking system -- Application on Semantic Web --
Shigeki Hino (NTT)
Graph algorithms are increasingly used in the back-end of internet services. However most of them are optimized for some... [more] CAS2005-55 CST2005-24
pp.35-40
MSS, CAS 2005-11-10
15:00
Yamaguchi Yamaguchi University Experiment-based Performance Comparison of Dynamic Shortest Path Algorithms
Takashi Iguchi, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ)
 [more] CAS2005-56 CST2005-25
pp.41-46
MSS, CAS 2005-11-10
15:25
Yamaguchi Yamaguchi University An Algorithm for Determining a Path through a Maze of Rectangles
Toshihiko Takahashi, Jun Kusumi (Niigata Univ.)
Consider motion planning in which a robot travels from a start (X,Y) to the target (0,0) in a plane with randomly placed... [more] CAS2005-57 CST2005-26
pp.47-50
MSS, CAS 2005-11-10
15:50
Yamaguchi Yamaguchi University On the Two-Dimensional Orthogonal Drawing of Series-Parallel Graphs
Satoshi Tayu, Kumiko Nomura, Shuichi Ueno (Tokyo Inst. of Tech.)
It has been known that every planar $4$-graph has a $2$-bend $2$-D orthogonal drawing with the only exception of octahed... [more] CAS2005-58 CST2005-27
pp.51-56
MSS, CAS 2005-11-10
16:15
Yamaguchi Yamaguchi University A Branch and Bound Algorithm for the Minimum Dominating Set Problem and its Hardware Implementation on FPGAs
Kenji Kikuchi, Shin'ichi Wakabayashi (Hiroshima City Univ.)
A branch and bound algorithm for finding a minimum dominating set of a given graph was proposed,and experimental evaluat... [more] CAS2005-59 CST2005-28
pp.57-62
MSS, CAS 2005-11-10
17:00
Yamaguchi Yamaguchi University [Invited Talk] Radio Astronomy Observation Aided with Information Technology
Kenta Fujisawa (Yamaguchi Univ.)
Radio Astronomy was born in a course of research of short-wave telecommunication. It has grown up with the aid of commun... [more] CAS2005-60 CST2005-29
pp.63-66
MSS, CAS 2005-11-11
10:00
Yamaguchi Yamaguchi University Structural Representation of Signaling Pathways by T-invariants
Shunichi Suzuki, Chen Li, Qi-Wei Ge, Mitsuru Nakata, Hiroshi Matsuno (Yamaguchi Univ.), Satoru Miyano (Univ. of Tokyo)
 [more] CAS2005-62 CST2005-31
pp.7-12
MSS, CAS 2005-11-11
10:25
Yamaguchi Yamaguchi University Colored Petri Net based Performance analysis of Flexible Manufacturing System with planned and unplanned Resource Breakdowns
Tauseef Aized, Koji Takahashi, Ichiro Hagiwara (Tokyo Inst. of Technology)
 [more] CAS2005-61 CST2005-30
pp.1-6
MSS, CAS 2005-11-11
10:50
Yamaguchi Yamaguchi University An Experimental Evaluation of Job-Shop Cyclic Time Optimization based on Evolutionary Petri Nets
Koji Hachiman (Okinawa Univ.), Morikazu Nakamura, Hiroki Tome, Shiro Tamaki (Univ. of the Ryukyus)
 [more] CAS2005-63 CST2005-32
pp.13-18
MSS, CAS 2005-11-11
11:30
Yamaguchi Yamaguchi University [Invited Talk] Combinational Algorithms in Functional and Logic Verification Problems -- The world of BDD and SAT solver --
Akira Mukaiyama (NEC)
 [more] CAS2005-64 CST2005-33
pp.19-23
MSS, CAS 2005-11-11
13:30
Yamaguchi Yamaguchi University Net Assignment Algorithm for Ball Grid Array Packages
Takayuki Hiromatsu, Yukiko Kubo, Hiroshi Murata (The University of Kitakyusyu)
As LSI chips become larger and highly integrated, the number of package terminals is also becoming larger. Ball Grid Arr... [more] CAS2005-65 CST2005-34
pp.25-30
MSS, CAS 2005-11-11
13:55
Yamaguchi Yamaguchi University Statistical Properties and Subclasses of Sequence Triple Code Space for Repeated Placements
Mineo Kaneko (JAIST)
 [more] CAS2005-66 CST2005-35
pp.31-36
MSS, CAS 2005-11-11
14:20
Yamaguchi Yamaguchi University Topological conditions for dc-dc converters including a transformer
Tetsuo Nishi (Waseda Univ.), Masato Ogata (Kyushu Sangyo Univ.)
This paper studies on the topological condition for the switchiing converter to work as DC-DC converters and give some n... [more] CAS2005-67 CST2005-36
pp.37-42
MSS, CAS 2005-11-11
14:45
Yamaguchi Yamaguchi University Design of Multiple Constant Multiplication Circuits Considering Hardware Constraints
Yukinobu Kato, Takao Sasaki, Hisamichi Toyoshima (Kanagawa Univ.)
 [more] CAS2005-68 CST2005-37
pp.43-47
 Results 1 - 20 of 21  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan