Tatsuya TANIAI Azuchi MIKI Takashi KOJIMA Iwao SASASE Shinsaku MORI
In this paper, restricted overflow strategy is proposed as a novel channel access strategy for the queueable hierarchical channel structure, which has been proposed as one of "Wideband-ISDN" channel structures. In this policy, overflow from higher bit rate channels to lower bit rate channels is partly restricted by the number of waiting customers in the higher channel's buffer. Therefore, thresholds, which restrict overflow, are considered on the buffer. First, we present the system model with two types of services and restricted overflow strategy. Next, we provide a queueing analysis of this strategy. After that, some numerical results of both conventional overflow strategy and restricted overflow strategy are presented, and we compare the average holding times under these strategies. Finally, we show that, if we choose appropriate thresholds, the average holding time of higher level traffic is improved.
Based on the Fornasini-Marchesini second model, an efficient algorithm is developed to derive the characteristic polynomial and the inverse of the system matrix from the state-space parameters. As a result, the external description of the Fornasini-Marchesini second model is clarified. A technique for designing 2-D recursive digital filters in the frequency domain is then presented by using the Fornasini-Marchesini second model. The resulting filter approximates both magnitude and group delay specifications and its stability is always guaranteed. Finally, three design examples are given to illustrate the utility of the proposed technique.
Emi KATO Shoichiro YAMASAKI Hiroshi KOBAYASHI
There has been much interest in building corporate private communication networks. This aim requires a method that optimizes the economical aspect of network configurations. The authors propose a network design method supported by knowledge-base. This method is used to design a cost-effective corporate communication network, using leased lines. The knowledge-base description depends on the production rule. The network configuration is improved by introducing expert knowledge, after designing the network by a conventional algorithm. Design results show the advantages of the proposed method.
Masayuki KAWAMATA Takehiko KAGOSHIMA Tatsuo HIGUCHI
This paper proposes an efficient design method of three-dimensional (3-D) recursive digital filters for video signal processing via decomposition of magnitude specifications. A given magnitude specification of a 3-D digital filter is decomposed into specifications of 1-D digital filters with three different (horizontal, vertical, and temporal) directions. This decomposition can reduce design problems of 3-D digital filters to design problems of 1-D digital filters, which can be designed with ease by conventional methods. Consequently, design of 3-D digital filters can be efficiently performed without complicated tests for stability and large amount of computations. In order to process video signal in real time, the 1-D digital filters with temporal direction must be causal, which is not the case in horizontal and vertical directions. Since the proposed method can approximate negative magnitude specifications obtained by the decomposition with causal 1-D R filters, the 1-D digital filters with temporal direction can be causal. Therefore the 3-D digital filters designed by the proposed method is suitable for real time video signal processing. The designed 3-D digital filters have a parallel separable structure having high parallelism, regularity and modularity, and thus is suitable for high-speed VLSI implementation.
The motion of particles in low-pressure chemical vapor deposition (LPCVD) (0.4 Torr) equipment has been investigated by a numerical simulation. The effects of wafer orientation, electrostatic forces, and thermophoresis were evaluated. Horizontal surface-down processing and vertical processing can reduce particulate contamination remarkably compared with horizontal surface-up processing. Static electricity control is essential. Weakly charged wafers (several V to several 10 V) can significantly increase submicron particle deposition. In the absence of electrical forces, thermophoresis prevents deposition of particles in the size range 0.03 µmDp0.6 µm, when the temperature difference between the wafer surface and the gas inlet temperature exceeds 100. Deposition of particles smaller than 0.03 µm still occurs by diffusion.
Yoshihiro KANEKO Reiko TASHIRO Shoji SHINODA Kazuo HORIUCHI
An arborescence-net N is a directed connected communication network with arborescence structure. Some information to be distributed through N is supposed to have been written in a file and the written file is denoted by J, where the file means an abstract concept of information carrier. In this letter, we consider a problem of distributing copies of J through N from the root vertex to every vertex, where the cost of transmitting a copy of J through each arc, the cost of making a copy of J at each vertex and the number of copies of J needed at each vertex in N are defined. Definig a file transfer on N, we give a method for designing an optimal file transfer by which we mean a file transfer whose total cost of transmitting and making copies of J is minimum on N.
Hiroshi NOHIRA Yoshinari TAMURA Hiroki OGAWA Takeo HATTORI
The initial stages of SiO2/Si interface formation on a Si(111) surface were investigated at 300 in dry oxygen with a pressure of 133 Pa. It was found that the SiO2/Si interfacial transition layer is formed in three steps characterized by three different oxidation rates.
Hiroki ARIMURA Takeshi SHINOHARA Setsuko OTSUKI
In this paper, we consider the polynomial time inferability from positive data for unions of two tree pattern languages. A tree pattern is a structured pattern known as a term in logic programming, and a tree pattern language is the set of all ground instances of a tree pattern. We present a polynomial time algorithm to find a minimal union of two tree pattern languages containing given examples. Our algorithm can be considered as a natural extension of Plotkin's least generalization algorithm, which finds a minimal single tree pattern language. By using this algorithm, we can realize a consistent and conservative polynomial time inference machine that identifies unions of two tree pattern languages from positive data in the limit.
As part of Hitachi's development of clean semiconductor processing equipment, the Fluids Modeling Group of the Mechanical Engineering Research Laboratory is developing a computer model, CONTAMINATE, for simulating contamination of wafers in chemical vapor deposition (CVD) systems. CONTAMINATE is based on a 2D implementation of the SIMPLER algorithm for simulating convection/diffusion transport processes. The new model includes modules for simulating fluid flow, heat transfer, chemical reactions, and gas-phase formation and deposition of clusters and particles. CONTAMINATE outputs property fields and estimates of various film quality indices. Using CONTAMINATE we simulated a SiH4: O2: N2 gas mixture at 300 K flowing over a wafer heated to 700 K. System pressures were varied from 1-100 torr and SiH4 pressures from 0.1 to 10 torr. Deposition characteristics are in qualitative agreement with actual systems and are summarized as follows: (1) No particles larger than 0.1µm deposited for any of the conditions tested. (2) Film damage occurred above 10 torr, but no damage occurred below 10 torr. (3) Increasing SiH4 pressure at constant system pressure eliminated particle deposition because particles grew large enought that thermophoresis blocked particle diffusion. (4) Conformal deposition of featured surfaces was achieved only at 1 torr. (5) Film thickness variation over the diameter of the wafer was 15% at 100 torr, 3% at 10 torr, and 1% at 1 torr.
A pattern is a finite string of constant symbols and variable symbols. The language of a pattern is the set of all strings obtained by substituting any nonnull constant string for each variable symbol in the pattern. The class of pattern languages was introduced by Angluin in 1979 as a concrete class which is inferable from positive data. In this paper, we consider the decision problem whether for given two patterns there is a containment relation between their languages, which was posed by Angluin and its decidability remains open. We give some sufficient conditions to make this problem decidable. We also introduce the notions of generalizations and minimal generalizations common to a set of patterns. We characterize the above open problem using the minimal generalization.
Jun YAMAGATA Masayuki MIYAZAWA Iwamasa NISHIKADO Takafumi SAITO
Over the past few years, the drive towards optimization and globalization of business activities has mandated the integration of various services, an increase in system scale, and the networking of a variety of systems. These requirements can only be satisfied by the introduction of systems that are able to accommodate and control multiple media and integrate LANs and PBXs synergistically. This paper proposes an architecture for next generation private networks called ANS (Areal Networking System) that is targeted at achieving flexible customization in an effort to meet a wide variety of user requirements as well as the ability to efficiently handle multimedia services. Based upon the clarification of various requirements on the ANS architecture, this paper defines two models for the ANS architecture. These models introduce modular building blocks in hierarchical structures that facilitate the custom design of networks. The key technologies for the ANS architecture are also discussed; for example, schemes for logically networking control functions by using virtual connections and a way to implement the LAN function.
Hiroshi TAKAHASHI Nobukage IUCHI Yuzo TAKAMATSU
The single fault model is invalid in many cases. However, it is very difficult to generate tests for all multiple faults since an m-line circuit may have 3m --1 multiple faults. In this paper, we describe a method for generating tests for combinational circuits with multiple stuck-at faults. An input vector is a test for a fault on a target line, if it find the target line to be fault-free in the presence of undetected or undetectable lines. The test is called a robust test for fault on a target line. It is shown that the sensitizing input-pair for a completely single sensitized path can be a robust test-pair. The method described here consists of two procedures. We label these as SINGLE_SEN" procedure and DECISION" procedure. SINGLE_SEN generates a single sensitized path including a target line on it by using a PODEM-like method which uses a new seven-valued calculus. DECISION determines by utilizing the method proposed by H. Cox and J. Rajski whether the single sensitizing input-pair generated by the SINGLE_SEN is a robust test-pair. By using these two procedures the described method generates robust test-pairs for the combinational circuit with multiple stuck-at faults. Finally, we demonstrate by experimental results on the ISCAS85 benchmark circuits that SINGLE_SEN is effective for an algorithmic multiple fault test generation for circuits not including many XOR gates.
Masayuki KAWAMATA Yasushi IWATA Tatsuo HIGUCHI
This paper designs and evaluates highly parallel VLSI processors for real time 2-D state-space digital filters using hierarchical behavioral description language and synthesizer. The architecture of the 2-D state-space digital filtering system is a linear systolic array of homogeneous VLSI processors, each of which consists of eight processing elements (PEs) executing 1-D state-space digital filtering with multi-input and multi-output. Hierarchical behavioral description language and synthesizer are adopted to design and evaluate PE's and the VLSI processors. One 16 bit fixed-point PE executing a (4, 4)-th order 2-D state-space digital filtering is described on the basis of distributed arithmetic in about 1,200 steps by the description language and is composed of 15 K gates in terms of 2 input NAND gate. One VLSI processor which is a cascade connection of eight PEs is composed of 129 K gates and can be integrated into one 1515 [mm2] VLSI chip using 1 µm CMOS standard cell. The 2-D state-space digital filtering system composed of 128 VLSI processors at 25 MHz clock can execute a 1,0241,024 image in 1.47 [msec] and thus can be applied to real-time conventional video signal processing.
Yasuhisa HAYASHI Satoshi KONDO Nobuyuki TAKASU Akio OGIHARA Shojiro YONEDA
This study proposes a new training method for hidden Markov model with separate vector quantization (SVQ-HMM) in speech recognition. The proposed method uses the correlation of two different kinds of features: cepstrum and delta-cepstrum. The correlation is used to decrease the number of reestimation for two features thus the total computation time for training models decreases. The proposed method is applied to Japanese language isolated dgit recognition.
Haruyuki HARADA Mitsuru TANAKA Takashi TAKENAKA
This letter discusses the quality improvement of reconstructed images in diffraction tomography. An efficient iterative procedure based on the modified Newton-Kantorovich method and the Gerchberg-Papoulis algorithm is presented. The simulated results demonstrate the property of high-quality reconstruction even for cases where the first-order Born approximation fails.
Yoshihiko HAMAMOTO Taiho KANAOKA Shingo TOMITA
In general, a two-dimensional display is defined by two orthogonal unit vectors. In developing the display, discriminant analysis has a shortcoming that the extracted axes are not orthogonal in general. First, in order to overcome the shortcoming, we propose discriminant analysis which provides an orthonormal system in the transformed space. The transformation preserves the discriminatory ability in terms of the Fisher criterion. Second, we present a necessary and sufficient condition that discriminant analysis in the original space provides an orthonormal system. Finally, we investigate the relationship between orthogonal discriminant analysis and the Karhunen-Loeve expansion in the original space.
Tatsuhiro YASAKA Masaru TAKAKURA Kenichi SAWARA Shigeo UENAGA Hiroshi YASUTAKE Seiichi MIYAZAKI Masataka HIROSE
Hydrogen termination of HF-treated Si surfaces and the oxidation kinetics have been studied by x-ray photoelectron spectroscopy (XPS) and Fourier Transform Infrared Spectroscopy (FT-IR) Attenuated Total Reflection (ATR). The oxidation of hydrogen-terminated Si in air or in pure water proceeds parallel to the surface presumably from step edges, resulting in the layer-by-layer oxidation. The oxide gryowth rate on an Si(100) surface is faster than (110) and (111) when the wafer is stored in pure water. This is interpreted in terms of the steric hindrance against molecular oxygen penetration throughth the (110) and (111) surfaces where the atom void size is equal to or smaller than O2 molecule. The oxide growth rate in pure water for heavily doped n-type Si is significantly high compared to that of heavily doped p-type Si. This is explained by the conduction electron tunneling from Si to absorbed O2 molecule to form the O2- state. O2- ions easily decompose and induce the surface electric field, enhancing the oxidation rate. It is found that the oxidation of heavily doped n-type Si in pure water is effectively suppressed by adding a small amount (1003600 ppm) of HCl.
O Han KANG Soo Young YOON Hyun Soo YOON Jung Wan CHO
The main objective of this paper is to propose a new top-down subcube allocation scheme which has complete subcube recognition capability with quick response time. The proposed subcube allocation scheme, called Heuristic Subcube Allocation (HSA) strategy, is based on a heuristic and undirected graph, called Subcube (SC)-graph, whose vertices represent the free subcubes, and edge represents inter-relationships between free subcubes. It helps to reduce the response time and internal/external fragmentation. When a new subcube is released, the higher dimension subcube is generated by the cycle detection in the SC-graph, and the heuristic is used to reduce the allocation time and to maintain the dimension of the free subcube as high as possible. It is theoretically shown that the HSA strategy is not only statically optimal but also it has a complete subcube recognition capability in a dynamic environment. Extensive simulation results show that the HSA strategy improves the performance and significantly reduces the response time compared to the previously proposed schemes.
In the approximate learning model introduced by Valiant, it has been shown by Blumer et al. that an Occam algorithm is immediately a PAC-learning algorithm. An Occam algorithm is a polynomial time algorithm that produces, for any sequence of examples, a simple hypothesis consistent with the examples. So an Occam algorithm is thought of as a procedure that compresses information in the examples. Weakening the compressing ability of Occam algorithms, a notion of weak Occam algorithms is introduced and the relationship between weak Occam algorithms and PAC-learning algorithms is investigated. It is shown that although a weak Occam algorithm is immediately a (probably) consistent PAC-learning algorithm, the converse does not hold. On the other hand, we show how to construct a weak Occam algorithm from a PAC-learning algorithm under some natural conditions. This result implies the equivalence between the existence of a weak Occam algorithm and that of a PAC-learning algorithm. Since the weak Occam algorithms constructed from PAC-learning algorithms are deterministic, our result improves a result of Board and Pitt's that the existence of a PAC-learning algorithm is equivalent to that of a randomized Occam algorithm.
Yuichi KAJI Ryuichi NAKANISHI Hiroyuki SEKI Tadao KASAMI
Parallel multiple context-free grammars (pmcfg's) and multiple context-free grammars (mcfg's) were introduced as extensions of context-free grammars to describe the syntax of natural languages. Pmcfg's and mcfg's deal with tuples of strings, and it has been shown that the universal recognition problem for mcfg's is EXP-POLY time-complete where the universal recognition problem is the problem to decide whether G generates w for a given grammar G and string w. In this paper, the universal recognition problems for the class of pmcfg's and for the subclass of pmcfg's with the information-lossless condition are shown to be EXP-POLY time-complete and PSPACE-complete, respectively. It is also shown that the problems for pmcfg's and for mcfg's with a bounded dimension are both -complete and those for pmcfg's and for mcfg's with a bounded degree are both -complete. As a corollary, the problem for modified head grammars introduced by Vijay-Shanker, et al. to define the syntax of natural languages is shown to be in deterministic polynomial time.