IEICE transactions on information and systems

• 

  Año 1997, Vol. 80, Número 1

  • Three-mode failure model for reliability analysis of distributed programs

    Tatsuhiro Tsuchiya, Yoshiaki Kakuda, Tohru Kikuno

    págs. 3-9

    

  • Commit-order oriented validation scheme for transaction scheduling in mobile distributed database systems: COOV

    Youngkon Lee, Songchun Moon

    págs. 10-14

    

  • Quad-processor redundancy for a RISC-based fault tolerant computer

    Shinichiro Yamaguchi, Tetsuaki Nakamikawa, Naoto Miyazaki

    págs. 15-20

    

  • A learning algorithm for fault tolerant feedforward neural networks

    Nait Charif Hammadi, Hideo Ito

    págs. 21-27

    

  • A method of multiple fault diagnosis in sequential circuits by sensitizing sequence pairs

    Nobuhiro Yanagida, Hiroshi Takahashi, Yuzo Takamatsu

    págs. 28-37

    

  • A fault simulation method for crosstalk faults in synchronous sequential circuits

    Noriyoshi Itazaki, Yasutaka Idomoto, Kozo Kinoshita

    págs. 38-43

    

  • Dependable bus arbitration by alternating competition with checkers

    Kazuo Tokito, Takashi Matsubara, Yoshiaki Koga

    págs. 44-50

    

  • A new verification framework of object-oriented design specification for small scale software

    Eun Mi Kim, Shinji Kusumoto, Tohru Kikuno

    págs. 51-56

    

  • Formal verification of totally self-checking properties of combionational circuits

    Kazuo Kawakubo, Koji Tanaka, Hiromi Hiraishi

    págs. 57-62

    

  • An automatic algorthm for removing uninterested regions in image signals

    Masamune Satoh, Tohru Ikeguchi, Takeshi Matozaki

    págs. 63-71

    

  • Solving combinatorial optimization problems using the oscillatory neural network

    Yoshiaki Watanabe, Keiichi Yoshino, Tetsuro Kkakeshita

    págs. 72-77

    

  • Learning curves in learning with noise - An empirical study -

    Hanzhonh Gu, Haruhisa Takahashi

    págs. 78-85

    

  • On multi-inkdot two-way alternating turing machines and pushdown automata with sublogarithmic space and constant leaf-size

    Jianliang Xu, Katsushi Inoue, Yue Wang

    págs. 86-90

    

  • The complexity of threshold circuits for parity functions

    Shao Chin Sung, Tetsuro Nishino

    págs. 91-93

    

  • High-fair bus arbiter for multiprocessors

    Chiung San Lee

    págs. 94-97

    

  • Address addition and decoding without carry propagation

    Yung Hei Lee, Seung Ho Hwang

    págs. 98-100

    

  • Similar key search files based on hashing

    Sheng ta Yang, Eiichi Tanaka

    págs. 101-105