Engineering Sciences/NOLTA-Circuits and Systems(Date:1995/11/16)

Presentation
表紙

,  

[Date]1995/11/16
[Paper #]
目次

,  

[Date]1995/11/16
[Paper #]
Development Support in LAN which connect WS to PC

Shuji TAKAHASHI,  Atsushi TSUBURAI,  Wataru TANAKA,  

[Date]1995/11/16
[Paper #]CAS95-73,CST95-11
A Reachable Analysis Method of Concurrent Systems by means of Connected Graph

Yoshihiro UEDA,  Akira TAKURA,  Tadashi OHTA,  

[Date]1995/11/16
[Paper #]CAS95-74,CST95-12
Finding a Minimal Siphon Containing a Specified Place in General Petri Nets

Shinji Tanimoto,  Masahiro Yamauchi,  Toshimasa Watanabe,  

[Date]1995/11/16
[Paper #]CAS95-75,CST95-13
Petri net based qualitative simulation with quantitative information

H. Shibata,  T Ushio,  S Kumagai,  S Kodama,  

[Date]1995/11/16
[Paper #]CAS95-76,CST95-14
Two Necessary and Sufficient Conditions for Reachability on Petri Nets without Any Restrictions : Two Cases in Which Firing Count Vector Is Unknown or Known

Tadashi MATSUMOTO,  

[Date]1995/11/16
[Paper #]CAS95-77,CST95-15
Necessary and Sufficient Conditions for Liveness and Reachability on TCC and SCC Petri Nets

Kiyotaka HANAKAWA,  Tadashi MATSUMOTO,  

[Date]1995/11/16
[Paper #]CAS95-78,CST95-16
On a Transformation from File Transfer to File Scheduling

Yoshihiro KANEKO,  

[Date]1995/11/16
[Paper #]CAS95-79,CST95-17
A simple 3-size Steiner tree algorithm for 4 Euclidean plane points

Tony Cole,  

[Date]1995/11/16
[Paper #]CAS95-80,CST95-18
An optimal algorithm for path location problems on tree networks

Akiyoshi Shioura,  Takeaki Uno,  

[Date]1995/11/16
[Paper #]CAS95-81,CST95-19
The complexity of the Shortest Path Problem under obstructions : the case visited arcs cannot be obstructed

Kazuaki Yamaguchi,  Toshiro Araki,  Toshinobu Kashiwabara,  

[Date]1995/11/16
[Paper #]CAS95-82,CST95-20
A Study of Location Registration with Graph Theory in Mobile Communication Systems

Teruo Horikawa,  Hiroshi Tamura,  Masakazu Sengoku,  Shoji Shinoda,  

[Date]1995/11/16
[Paper #]CAS95-83,CST95-21
The Structure of Flow Networks Realized from Terminal Capacity Matrices

Hiroshi Tamura,  Ryouhei Sato,  Masakazu Sengoku,  Shoji Sinoda,  Takeo Abe,  

[Date]1995/11/16
[Paper #]CAS95-84,CST95-22
Computing the Network Reliability of a Directed Graph via BDDs

Hiroshi Imai,  Kyoko Sekine,  

[Date]1995/11/16
[Paper #]CAS95-85,CST95-23
An Algorithm for the Induced Subgraph Isomorphism Problem of Outerplanar Graphs

Yu Yanfen,  Sumio Masuda,  Eiichi Tanaka,  

[Date]1995/11/16
[Paper #]CAS95-86,CST95-24
Novel Electronically Tunable Current-Mode Biquad without External Passive Elements

Takao Tsukutani,  Masaru Isida,  Sumio Tsuiki,  Yutaka Fukui,  

[Date]1995/11/16
[Paper #]CAS95-87,CST95-25
Realization of Transfer Impedance Function Using CFAs

Masami Higasimura,  Yutaka Fukui,  

[Date]1995/11/16
[Paper #]CAS95-88,CST95-26
Realization of Biquadratic Transfer Function Using CFAs

Masami Higashimura,  Yutaka Fukui,  

[Date]1995/11/16
[Paper #]CAS95-89,CST95-27
A Realization of State Variable Biquadratic Filters : Using Current Conveyors

Kazuhiro NAKAI,  Gaishi YAMAMOTO,  

[Date]1995/11/16
[Paper #]CAS95-90,CST95-28
12>> 1-20hit(21hit)