Jiaxin WU Bing LI Li ZHAO Xinzhou XU
Maaki SAKAI Kanon HOKAZONO Yoshiko HANADA
Xuecheng SUN Zheming LU
Yuanhe WANG Chao ZHANG
Jinfeng CHONG Niu JIANG Zepeng ZHUO Weiyu ZHANG
Xiangrun LI Qiyu SHENG Guangda ZHOU Jialong WEI Yanmin SHI Zhen ZHAO Yongwei LI Xingfeng LI Yang LIU
Meiting XUE Wenqi WU Jinfeng LUO Yixuan ZHANG Bei ZHAO
Rong WANG Changjun YU Zhe LYU Aijun LIU
Huijuan ZHOU Zepeng ZHUO Guolong CHEN
Feifei YAN Pinhui KE Zuling CHANG
Manabu HAGIWARA
Ziqin FENG Hong WAN Guan GUI
Sungryul LEE
Feng WANG Xiangyu WEN Lisheng LI Yan WEN Shidong ZHANG Yang LIU
Yanjun LI Jinjie GAO Haibin KAN Jie PENG Lijing ZHENG Changhui CHEN
Ho-Lim CHOI
Feng WEN Haixin HUANG Xiangyang YIN Junguang MA Xiaojie HU
Shi BAO Xiaoyan SONG Xufei ZHUANG Min LU Gao LE
Chen ZHONG Chegnyu WU Xiangyang LI Ao ZHAN Zhengqiang WANG
Izumi TSUNOKUNI Gen SATO Yusuke IKEDA Yasuhiro OIKAWA
Feng LIU Helin WANG Conggai LI Yanli XU
Hongtian ZHAO Hua YANG Shibao ZHENG
Kento TSUJI Tetsu IWATA
Yueying LOU Qichun WANG
Menglong WU Jianwen ZHANG Yongfa XIE Yongchao SHI Tianao YAO
Jiao DU Ziwei ZHAO Shaojing FU Longjiang QU Chao LI
Yun JIANG Huiyang LIU Xiaopeng JIAO Ji WANG Qiaoqiao XIA
Qi QI Liuyi MENG Ming XU Bing BAI
Nihad A. A. ELHAG Liang LIU Ping WEI Hongshu LIAO Lin GAO
Dong Jae LEE Deukjo HONG Jaechul SUNG Seokhie HONG
Tetsuya ARAKI Shin-ichi NAKANO
Shoichi HIROSE Hidenori KUWAKADO
Yumeng ZHANG
Jun-Feng Liu Yuan Feng Zeng-Hui Li Jing-Wei Tang
Keita EMURA Kaisei KAJITA Go OHTAKE
Xiuping PENG Yinna LIU Hongbin LIN
Yang XIAO Zhongyuan ZHOU Mingjie SHENG Qi ZHOU
Kazuyuki MIURA
Yusaku HIRAI Toshimasa MATSUOKA Takatsugu KAMATA Sadahiro TANI Takao ONOYE
Ryuta TAMURA Yuichi TAKANO Ryuhei MIYASHIRO
Nobuyuki TAKEUCHI Kosei SAKAMOTO Takuro SHIRAYA Takanori ISOBE
Shion UTSUMI Kosei SAKAMOTO Takanori ISOBE
You GAO Ming-Yue XIE Gang WANG Lin-Zhi SHEN
Zhimin SHAO Chunxiu LIU Cong WANG Longtan LI Yimin LIU Zaiyan ZHOU
Xiaolong ZHENG Bangjie LI Daqiao ZHANG Di YAO Xuguang YANG
Takahiro IINUMA Yudai EBATO Sou NOBUKAWA Nobuhiko WAGATSUMA Keiichiro INAGAKI Hirotaka DOHO Teruya YAMANISHI Haruhiko NISHIMURA
Takeru INOUE Norihito YASUDA Hidetomo NABESHIMA Masaaki NISHINO Shuhei DENZUMI Shin-ichi MINATO
Zhan SHI
Hakan BERCAG Osman KUKRER Aykut HOCANIN
Ryoto Koizumi Xiaoyan Wang Masahiro Umehira Ran Sun Shigeki Takeda
Hiroya Hachiyama Takamichi Nakamoto
Chuzo IWAMOTO Takeru TOKUNAGA
Changhui CHEN Haibin KAN Jie PENG Li WANG
Pingping JI Lingge JIANG Chen HE Di HE Zhuxian LIAN
Ho-Lim CHOI
Akira KITAYAMA Goichi ONO Hiroaki ITO
Koji NUIDA Tomoko ADACHI
Yingcai WAN Lijin FANG
Yuta MINAMIKAWA Kazumasa SHINAGAWA
Sota MORIYAMA Koichi ICHIGE Yuichi HORI Masayuki TACHI
Sendren Sheng-Dong XU Albertus Andrie CHRISTIAN Chien-Peng HO Shun-Long WENG
Zhikui DUAN Xinmei YU Yi DING
Hongbo LI Aijun LIU Qiang YANG Zhe LYU Di YAO
Yi XIONG Senanayake THILAK Yu YONEZAWA Jun IMAOKA Masayoshi YAMAMOTO
Feng LIU Qian XI Yanli XU
Yuling LI Aihuang GUO
Mamoru SHIBATA Ryutaroh MATSUMOTO
Haiyang LIU Xiaopeng JIAO Lianrong MA
Ruixiao LI Hayato YAMANA
Riaz-ul-haque MIAN Tomoki NAKAMURA Masuo KAJIYAMA Makoto EIKI Michihiro SHINTANI
Kundan LAL DAS Munehisa SEKIKAWA Tadashi TSUBONE Naohiko INABA Hideaki OKAZAKI
Tetsushi YUGE Masaharu DEHARE Shigeru YANAGI
A lattice system in this paper is a system whose components are ordered like the elements of (m, n) matrix. A representative example of a lattice system is a connected-(r, s)-out-of-(m, n):F lattice system which is treated as a model of supervision system. It fails if and only if all components in an (r, s) sub lattice fail. We modify the lattice system so as to include a maintenance action and a restriction on the number of failed components. Then, this paper presents availability and MTBF of the repairable system, and reliability when the system stocks spare parts on hand to ensure the specified reliability level.
We deal here with diagnosis for failures of series/parallel structure system. The conventionals have assumed that the system failure is caused by a single minimal cut set (MCS). The purposes of this paper are to propose a new diagnosis method to identify all MCSs by utilizing the series/parallel structure and repair information without requiring an excessive number of inspections. Moreover, by applying our method to several types of series/parallel structure system, and to system having some kinds of probability distributions, desirable system for our method are persuaded. We evaluate not just the number of inspections but also the cost of diagnosis, and show the condition under which our method is effective.
Tadashi DOHI Yoshifumi YATSUNAMI Yasuhiko NISHIO Shunji OSAKI
In this paper, we develop an effective smoothing technique to estimate the optimal software release schedule which minimizes the total software cost. The optimal software release problem is essentially reduced to a statistical estimation problem for the software failure rate, but the resulting estimator based on both the fault-detection time data observed in testing phase and its estimate in future is discontinuous and does not always function well for determining the optimal release schedule. We estimate the smoothed software failure rate using the usual quadratic programming approach and generate the optimal software release schedule with higher accuracy.
Tadashi DOHI Kouji NOMURA Naoto KAIO Shunji OSAKI
This paper considers two simulation models for simple unreliable file systems with checkpointing and rollback recovery. In Model 1, the checkpoint is generated at a pre-specified time and the information on the main memory since the last checkpoint is back-uped in a secondary medium. On the other hand, in Model 2, the checkpointing is executed at the time when the number of transactions completed for processing is achieved at a pre-determined level. However, it is difficult to treat such models analytically without employing any approximation method, if queueing effects related with arrival and processing of transactions can not be ignored. We apply the generalized stochastic Petri net (GSPN) to represent the stochastic behaviour of systems under two checkpointing schemes. Throughout GSPN simulation, we evaluate quantitatively the maintainability of checkpoint models under consideration and examine the dependence of model parameters in the optimal checkpoint policies and their associated system availabilities.
Wei LONG Yoshinobu SATO Hua ZHANG
The Monte Carlo simulation is applied to fault tree analyses of the sequential failure logic. In order to make the validity of the technique clear, case studies for estimation of the statistically expected numbers of system failures during (0, t] are conducted for two types of systems using the multiple integration method as well as the Monte Carlo simulation. Results from these two methods are compared. This validates the Monte Carlo simulation in solving the sequential failure logic with respectably small deviation rates for those cases.
Qun JIN Richard F. VIDALE Yoshio SUGASAWA
We determine the optimum time TOPT to order a spare part for a system before the part in operation has failed. TOPT is a function of the part's failure-time distribution, the lead (delivery) time of the part, its inventory cost, and the cost of downtime while waiting delivery. The probabilities of the system's up and down states are obtained from a non-regenerative stochastic Petri net. TOPT is found by minimizing E[cost], the expected cost of inventory and downtime. Three cases are compared: 1) Exponential order and lead times, 2) Deterministic order time and exponential lead time, and 3) Deterministic order and lead times. In Case 1, it is shown analytically that, depending on the ratio of inventory to downtime costs, the optimum policy is one of three: order a spare part immediately at t = 0, wait until the part in operation fails, or order before failure at TOPT > 0. Numerical examples illustrate the three cases.
Saad ALKHATEIB Tieling ZHANG Michio HORIGOME
There are two distinct types of maintenance action, namely preventive one and corrective one. Preventive maintenance is performed at regular intervals and can contribute significantly towards the increase of reliability and availability. It must be scheduled carefully in order that the availability is maximized through optimizing regular interval. On the other hand, corrective maintenance is performed when the system fails, and so the occurrence of corrective maintenance action is a random variable that cannot be predicted beforehand. From these considerations, it is clear that time is the most important factor in maintainability, and therefore, we classify maintenance data into two groups, that is, scheduled maintenance data and unscheduled maintenance one. Next, based on these classified data, we propose the new availability model which modifies Policy II proposed by R. Barlow and L. Hunter. Finally, we show the usefulness of the new model proposed here by applying these theoretical results to real data of some power plant.
In this paper, we construct a software availability model considering the number of restoration actions. We correlate the failure and restoration characteristics of the software system with the cumulative number of corrected faults. Furthermore, we consider an imperfect debugging environment where the detected faults are not always corrected and removed from the system. The time-dependent behavior of the system alternating between up and down states is described by a Markov process. From this model, we can derive quantitative measures for software availability assessment considering the number of restoration actions. Finally, we show numerical examples of software availability analysis.
Abnormal IDDQ (Quiescent VDD supply current) indicates the existence of physical damage in a circuit. Using this phenomenon, a CAD-based fault diagnosis technology has been developed to analyze the manufacturing yield of logic LSI. This method to detect the fatal defect fragments in several abnormalities identified with wafer inspection apparatus includes a way to separate various leakage faults, and to define the diagnosis area encircling the abnormal portions. The proposed technique progressively narrows the faulty area by using logic simulation to extract the logic states of the diagnosis area, and by locating test vectors related to abnormal IDDQ. The fundamental diagnosis way employs the comparative operation of each circuit element to determine whether the same logic state with abnormal IDDQ exists in normal logic state or not.
Nobuhiro SHIMOYAMA Katsuyuki MACHIDA Masakazu SHIMAYA Hideo AKIYA Hakaru KYURAGI
This paper presents the effect of stress on device degradation in metal-oxide-semiconductor field-effect transistors (MOSFETs) due to stud bumping. Stud bumping above the MOSFET region generates interface traps at the Si/SiO2 interface and results in the degradation of transconductance in N-channel MOSFETs. The interface traps are apparently eliminated by both nitrogen and hydrogen annealing. However, the hot-carrier immunity after hydrogen annealing is one order of magnitude stronger than that after nitrogen annealing. This effect is explained by the termination of dangling bonds with hydrogen atoms.
The purpose of this note is to carry out study on a 3-out-of-4:G warm standby system with nonidentical components. By using Markov model, the general form solution of stationary availability of the system is obtained. Examples are given to illustrate the solutions of transient and stationary availability of such system.
The present paper modifies the algorithm to estimate harmful event frequencies and examines the definition of modes of operation in IEC 61508. As far as the continuous mode concerns, the calculated results coincide with those obtained based on the standard. However, for the intermediate region of medium demand frequencies and/or medium demand durations, the standard gives much higher harmful event frequencies than the real values. In order to avoid this difficulty, a new definition of modes of operation and a shortcut method for allocation of SILs are presented.
Hiroshi SARUWATARI Shoji KAJITA Kazuya TAKEDA Fumitada ITAKURA
This paper describes an improved complementary beamforming microphone array based on the new noise adaptation algorithm. Complementary beamforming is based on two types of beamformers designed to obtain complementary directivity patterns with respect to each other. In this system, during a pause in the target speech, two directivity patterns of the beamformers are adapted to the noise directions of arrival so that the expectation values of each noise power spectrum are minimized in the array output. Using this technique, we can realize the directional nulls for each noise even when the number of sound sources exceeds that of microphones. To evaluate the effectiveness, speech enhancement experiments and speech recognition experiments are performed based on computer simulations with a two-element array and three sound sources under various noise conditions. In comparison with the conventional adaptive beamformer and the conventional spectral subtraction method cascaded with the adaptive beamformer, it is shown that (1) the proposed array improves the signal-to-noise ratio (SNR) of degraded speech by more than 6 dB when the interfering noise is two speakers with the input SNR of below 0 dB, (2) the proposed array improves the SNR by about 2 dB when the interfering noise is bubble noise, and (3) an improvement in the recognition rate of more than 18% is obtained when the interfering noise is two speakers or two overlapped signals of some speakers under the condition that the input SNR is 10 dB.
Shohei YANO Haruhide HOKARI Shoji SHIMADA
Out-of-head sound localization achieved via binaural earphones is indispensable for a virtual sound system. It is necessary to measure the two transfer functions of each subject, Spatial Sound Transfer Function (SSTF) and Ear Canal Transfer Function (ECTF), for achieving sound localization. It is well known that the quality of sound localization may be poor if the individual transfer functions are not accurately reproduced. This is because each subject has his/her own transfer functions. It is very important to clarify which function includes more individual information, SSTF or ECTF, in order to implement a simpler model. Therefore, we introduce the quantity of "Personal differences" for investigating the subject's transfer functions included in SSTF and ECTF. We measure the transfer functions SSTF and ECTF of 60 subjects in a soundproofed room, and analysis of the data using Principal Component Analysis (PCA) and three subjective assessment tests. This study finds that ECTF differs more widely from person to person than SSTF.
James OKELLO Shin'ichi ARITA Yoshio ITOH Yutaka FUKUI Masaki KOBAYASHI
In this paper we present an analysis based on the indirect Lyapunov criteria, that is used to study the convergence of an infinite impulse response (IIR) adaptive digital filter (ADF) based on estimation of the allpass system. The analysis is then extended to investigate the necessity of directly estimating the transfer level of the unknown system. We consider two cases of modeling the ADF. In the first system, the allpass section of the ADF estimates only the real poles of the unknown system while in the second system, both real and complex poles the allpass section are estimated. From the analysis and computer simulation, we realize that the poles of the ADF converge selectively to the poles of the unknown system, depending on the sign of the step size of adaptation. Using these results we proposed a new method to control the convergence of the poles the IIR ADF based on estimation of the allpass system.
Hidehiro NAKANO Toshimichi SAITO Kunihiko MITSUBORI
This paper studies mutually coupled integrate-and-fire type chaotic oscillators. The coupling is realized by impulsive switchings and the system exhibits various synchronous and asynchronous phenomena. We give a basic classification of the chaos synchronization phenomena and their breakdown patterns. The stability of the synchronous states can be confirmed using the piecewise exact solutions, and the basic mechanism of the phenomena can be elucidated by a simple geometric consideration. The typical phenomena are confirmed in the laboratory.
Young-doo CHOI In-Cheol PARK Chong-Min KYUNG
This paper presents a heuristic algorithm called CLASSIC for the minimization of the control memory width in microprogrammed processors or the instruction memory width of application-specific VLIW (Very Long Instruction Word) processors. CLASSIC results in nearly optimal solutions with the time complexity of O(n2), where n denotes the number of microoperations. In this paper, we also propose the so-called incompleteness relations which are exploited for the minimization of the control memory width. Experiments using various examples have shown that CLASSIC always achieves smaller microprogram widths compared to the earlier techniques based on the maximal compatibility class or the minimal AND/OR set. The results show that CLASSIC can reduce the control memory width by 34.2% on average compared with a heuristic compatibility class algorithm.
In this paper we shall put forward a novel circularly connected synergetic neural network extending the previously studied auto-correlation or cross-correlation dynamics so as to realise a group memory retrieval. The present model is substantially based on a top-down approach of the dynamic rule of an analog neural network in the similar manner to the conventional synergetic dynamics early proposed by Haken. It will be proved that a complete association can be assured up to the same number of the embedded patterns as the minimal number of neurons of the linked synergetic neural networks. In addition, one finds that a searching process of a couple of embedded patterns can be also realised by means of controlling attraction parameters as was previously reported in the autoassociative synergetic models.
Ryutaroh MATSUMOTO Shinji MIURA
We show how to apply the Feng-Rao decoding algorithm and the Feng-Rao bound for the Ω-construction of algebraic geometry codes to the L-construction. Then we give examples in which the L-construction gives better linear codes than the Ω-construction in certain range of parameters on the same curve.