研究者詳細 - 横平　徳美

論文 - 横平　徳美

分割表示 149 件中 121 - 140 件目／全件表示 >>

Minimum Test Set for Locally Exhaustive Testing of Combinational Circuits with Five Outputs 査読

Proc. Third Asian Test Symposium (ATS ''94) pp.280-285 1994年11月

う回ルーチングを行う分散形交換ネットワークの性能評価査読

横平徳美, 滝広眞利, 井上尚子, 岡本卓爾

電子情報通信学会論文誌 Vol.J77-B-I, No.3, pp.132-140 1994年3月

多出力組合せ論理回路の局所全数テストのための最小テスト集合の生成－M系列発生器とEXORゲートを用いて－査読

道西博行, 横平徳美, 岡本卓爾

電子情報通信学会論文誌 Vol.J77-D-I, No.2, pp.233-241 1994年2月

複数クラスのトラヒックをもつパケット交換ネットワ-クの設計アルゴリズム－End-to-End遅延を考慮した容量・優先度・フロ-割当て－

菅野正嗣,高科宏光,横平徳美,岡本卓爾

電子情報通信学会論文誌 Vol.J76-B-I, No.12, pp.922-932 1993年12月

Proof that Akers'' Algorithm for Locally Exhaustive Testing Gives Minimum Test Sets of Combinational Circuits with up to Four Outputs. 査読

Proceedings of the Second Asian Test Symposium pp.14-19 1993年11月

Minimum Test Set for Locally Exhaustive Testing of Multiple Output Combinational Circuits 査読

Hiroyuki Michinishi, Tokumi Yokohira, Takuji Okamoto

The Transactions of the IEICE Vol.E76-D, No.7, pp.791-799 1993年7月

Minimum Verification Test Set for Combinational Circuits 査読

Proc. First Asian Test Symposium (ATS ''92) pp.14-19 1992年11月

Effect of timeout retransmissions on end‐to‐end delay in packet switching networks 査読

Hiroshi Inai, Tokumi Yokohira, Masayuki Murata, Hideo Miyahara

Electronics and Communications in Japan (Part I: Communications) 75 ( 7 ) 13 - 21 1992年

掲載種別：研究論文（学術雑誌）

An end‐to‐end error recovery scheme is a promising way to obtain low end‐to‐end delays in packet switching networks. However, a too‐short timeout interval may cause unnecessary packet retransmissions even when a packet is transmitted successfully to the receiver. On the other hand, a longer timeout interval may introduce large end‐to‐end delay when a packet is actually lost. Thus, it becomes important to determine an appropriate timeout period in the scheme. This paper analyzes a tandem queueing network system with blocking due to finite capacity in intermediate nodes and investigates the effect of the timeout period on the end‐to‐end delay performance. It is found that there exists the timeout period minimizing the mean packet transmission delay in the end‐to‐end error recovery scheme. The delay performance between end‐to‐end and link‐by‐link error recovery schemes also is compared and it is found that the delay performances of these schemes are influenced significantly by the node‐to‐node delay. Copyright © 1992 Wiley Periodicals, Inc., A Wiley Company

DOI： 10.1002/ecja.4410750702

Scopus

researchmap

Simulation of Knee Joint Motions in Spastic and Rigid Patients 査読

Proceedings of the XIIIth International Congress on Biomechanics pp.273-275 1991年12月

Fault Tolerant Packet-Switched Network Design and Its Sensitivity 査読

IEEE TRANSACTIONS ON RELIABILITY 40 ( 4 ) 452 - 460 1991年11月

プロセッサ制御回路におけるシ-ケンサのテスト集合生成法査読

的場和男, 横平徳美, 杉山裕二, 岡本卓爾

電子情報通信学会論文誌 Vol.J74-D-I, No.10, pp.739-748 1991年10月

ペンドラムテストにおける膝関節運動の生成機序査読

軸屋和明, 岡本卓爾, 横平徳美, 明石謙

電子情報通信学会論文誌 J74-D-II, No.9, pp.1289-1300 1991年9月

Performance evaluation of layered communication protocol 査読

Hiroshi Inai, Tokumi Yokohira, Masayuki Murata, Hideo Miyahara

Electronics and Communications in Japan (Part I: Communications) 74 ( 4 ) 13 - 25 1991年4月

掲載種別：研究論文（学術雑誌）

This paper proposes a queueing network model for the layered communication protocol and its approximate analysis method. The performance of the layered communication protocol is evaluated by using the proposed model and analysis. First, the queueing network model is constructed for the connection‐oriented and connectionless data transmissions between peer layers. In each queueing network model, the transmission delay in the lower layer protocol is represented by an infinite‐servor queue. The performance model for the layered communication protocol is constructed by piling up each model. Then an approximate analysis is presented for each queueing network model. Based on the relation to be satisfied by the packet transmission delay in each layer and the throughput between adjacent layers, an approximate analysis of the whole model can be executed iteratively. In numerical examples, the validity of the approximate analysis for the model is shown. The effects of window size, the time‐out period, and receiver buffer size on the transmission delay are discussed. Copyright © 1991 Wiley Periodicals, Inc., A Wiley Company

DOI： 10.1002/ecja.4410740402

Scopus

researchmap

パケット交換網における伝送遅延による再送を考慮に入れた性能評価査読

稲井寛, 横平徳美, 村田正幸, 宮原秀夫

電子情報通信学会論文誌 Vol.J74-B-1, No.4, pp.275-282 1991年4月

Decentralized priority encoder and its applications 査読

Toshiyuki Maeda, Yoichiro Sato, Tokumi Yokohira, Takuji Okamoto

Systems and Computers in Japan 22 ( 10 ) 9 - 17 1991年

記述言語：英語掲載種別：研究論文（学術雑誌）

This paper contains the realization of the decentralized priority encoder (DPE) and presents two application examples. DPE is constructed by placing a module for each device issuing a request and by connecting the outputs from the modules using wired‐OR. Each module has the function to modify the priority dynamically. The request signal from the corresponding device is connected to the input of the module. When the priority of the module M issuing the request is higher than those of any other modules issuing requests, M produces the priority of its request as a binary code on the bus. A data selector can be constructed using DPE, since the data with the highest priority can be selected from a set of data with priorities. This data selector is suited especially to the data selector for image data in the enhanced multiwindow system. Using DPE as the priority comparator, a decentralized independent‐request arbiter with priority is obtained. Copyright © 1991 Wiley Periodicals, Inc., A Wiley Company

DOI： 10.1002/scj.4690221002

Scopus

researchmap

Capacity assignment algorithm for packet‐switching network with unreliable links 査読

Tokumi Yokohira, Masashi Sugano, Takeshi Nishida, Hideo Miyahara

Electronics and Communications in Japan (Part I: Communications) 74 ( 9 ) 13 - 20 1991年

記述言語：英語掲載種別：研究論文（学術雑誌）

In this paper, a link capacity assignment algorithm for a packet switched communication network is presented. This algorithm, called max‐delay‐link algorithm, prevents sharp performance degradation in a network even in case of link failures. An optimal link capacity assignment can be obtained with respect to link cost minimization, subject to the constraint that the average packet network transmission delay does not exceed a predetermined value. Robust networks against failures can be designed by assigning large capacities to links where overflow traffic and packet delay are expected to increase in case of a failure. Several numerical examples also are shown to examine the effectiveness of the algorithm in comparison with the conventional capacity assignment algorithm where link failures are not taken into account. Copyright © 1991 Wiley Periodicals, Inc., A Wiley Company

DOI： 10.1002/ecja.4410740902

Scopus

researchmap

パケット交換ネットワ-クにおける回線障害を考慮した容量割当て法査読

横平徳美,菅野正嗣,西田竹志,宮原秀夫

電子情報通信学会論文誌 Vol.J73-B-1, No.10, pp.744-750 1990年10月

Test Set for a Multibit Shifter Constructed with Multiplexers 査読

The Transactions of the IEICE Vol.E73, No.8, pp.1301-1309 1990年8月

分散制御形プライオリティエンコ-ダとその応用査読

前田敏行,佐藤洋一郎,横平徳美,岡本卓爾

電子情報通信学会論文誌 Vol.J73-D-I, No.6, pp.545-552 1990年6月

階層型通信プロトコルの性能評価査読

稲井寛, 横平徳美, 村田正幸, 宮原秀夫

電子情報通信学会論文誌 Vol.J73-B-I, No.5, pp.505-515 1990年5月

　前のページ - 次のページ　

<横平 徳美>

論文 - 横平 徳美

<横平　徳美>

論文 - 横平　徳美