Adam KURIASKI Takeshi AGUI Hiroshi NAGAHASHI
A method of motion segmentation in RGB image sequences is presented in details. The method is based on moving object modeling by a six-variate Gaussian distribution and a hidden Markov random field (MRF) framework. It is an extended and improved version of our previous work. Based on mathematical principles the energy expression of MRF is modified. Moreover, an initialization procedure for the first frame of the sequence is introduced. Both modifications result in new interesting features. The first involves a rather simple parameter estimation which has to be performed before the use of the method. Now, the values of Maximum Likelihood (ML) estimators of the parameters can be used without any user's modifications. The last allows one to avoid finding manually the localization mask of moving object in the first frame. Experimental results showing the usefulness of the method are also included.
A mechanism of an integrated switching system architecture where PS, CS, and ATM switching functions are integrated based on a hierarchical memory system concept is discussed. A packet buffering control mechanism, and practical random time-slot assignment mechanism for CS traffic, which are composed of multiple bearer rate data traffic are then described. The feasibility of the random time-slot assignment mechanism is also confirmed by a practical experimental system using VLSI technology, particularly, content addressable memory (CAM) technology. The required queuing delay between the nodes for the corresponding call set up procedure is also shown and its application is clarified. For practical digital networks that provide various types of data communications including voice, data, and video services, it is highly desirable to evaluate the transmission efficiency of integrating packet switching (PS) type non-real time traffic and circuit switching (CS) type real time traffic. Transmission line utilization improvement is expected when the random time-slot assignment and the movable boundary scheme on a TDM (Time Division Multiplexing) data frame are adopted. The corresponding control procedure by signaling between switching nodes is also examined.
Yoshio KARASAWA Tomonori KURODA Hisato IWAI
A very simple but general scheme has been developed to calculate burst error occurrences due to cycle slip in clock recovery on frequency-selective Nakagami-Rice fading channels. The scheme, which we call the "Equivalent Transmission-Path Model," plays a role in connecting "wave propagation" with "digital transmission characteristics" in a general manner. First computer simulations assuming various types of delay profiles identify the "key parameters in Nakagami-Rice fading" that principally dominate the occurrence of cycle slips. Following this a simple method is developed to calculate the occurrence frequency of cycle slips utilizing the nature of the key parameters. Then, the accuracy of the scheme is confirmed through comparison between calculated values and simulation results. Finally, based on the scheme, calculated results on cycleslip occurrences are presented in line-of-sight fading environments.
Kazunori UCHIDA Kohji SHIOTSUKI Takeaki NODA
This paper is concerned with a point-oriented finite volume time domain (FVTD) method in the Cartesian coordinate system and its application to the analysis of electro-magnetic wave propagation in a bended waveguide as well as radiation from and receiving by a horn antenna with a flange of arbitrary angle. The perfectly matched layer (PML) is used for the absorbing boundary conditions (ABC's). The boundary conditions for a perfect conductor not well suited to the Cartesian coordinate system are also proposed. According to this algorithm, the boundary conditions are satisfied in an average fashion at the conductor surface without changing the computational scheme. In this sense, numerical computations based on the present method are simple but flexible. Numerical results show good convergence.
Yuji AWANO Yoshiki SAKUMA Yoshihiro SUGIYAMA Takashi SEKIGUCHI Shunichi MUTO Naoki YOKOYAMA
This paper discusses our newly developed technology for making GaAs/InGaAs/GaAs Tetrahedral-Shaped Recess (TSR) quantum dots. The heterostructures were grown by low-pressure MOVPE in tetrahedral-shaped recesses created on a (111) B oriented GaAs substrate using anisotropic chemical etching. We examined these structures by using cathodoluminescence (CL) measurements, and observed lower energy emissions from the bottoms of, and higher energy emissions from the walls of the TSRs. This suggests carrier confinement at the bottoms with the lowest potential energy. We carried out microanlaysis of the structures by using TEM and EDX, and found an In-rich region that had grown vertically from the bottom of the TSR with a (111)B-like bond configuration. We also measured a smaller diamagnetic shift of the lower energy photoluminecscence (PL) peak in the structure. Based on these results, we have concluded that the quantum dots are formed at the bottoms of TSRs, mainly because of the dependence of InAs composition on the local crystalline structure in this system. We also studied the lateral distribution and vertical alignment of TSR quantum dots by CL and PL measurements respectively. The advantages of TSR quantum dot technology can be summarized as follows: (i) better control in dot positioning in the lateral direction, (ii) realization of dot sizes exceeding limitations posed by lithography, (iii) high uniformity of dot size, and (iv) vertical alignment of quantum dots.
The resistive-fuse network for early vision was studied using circuit simulation to clarify the potential of implementation with resonant tunneling diodes (RTDs). To over-come the fundamental problem of the RTD network, i.e., the RTDs cannot perform simulated annealing (SA), pseudo SAs were proposed. These methods are based on the time-variation of the input signal strength, and are found to be effective in restoring images. A resistive-fuse network is shown to be one of the most promising applications of RTDs.
Noboru TAKAGI Kyoichi NAKASHIMA Masao MUKAIDONO
The paper deals with Kleenean functions defined as fuzzy logic functions with constants. Kleenean functions provide a means of handling conditions of indeterminate truth value (ambiguous states) which ordinary classical logic (binary logic) cannot cope with. This paper clarifies a necessary and sufficient condition for a function to be a Kleenean function. The condition is provided with a set of two conditions, and it will be shown that they are independent of each other.
Hironori OKII Takashi UOZUMI Koichi ONO Yasunori FUJISAWA
This paper describes a new region segmentation method which is detectable carcinoma regions from hematoxylin and eosin (HE)-stained breast tumor images using collective behaviors of artificial organisms. In this model, the movement characteristics of artificial organisms are controlled by the gene, and the adaptive behavior of artificial organisms in the environment, carcinoma regions or not, is evaluated by the texture features.
A multiple classifier system can be a powerful solution for robust pattern recognition. It is expected that the appropriate combination of multiple classifiers may reduce errors, provide robustness, and achieve higher performance. In this paper, high performance Chinese syllable recognition is presented using combinations of multiple classifiers. Chinese syllable recognition is divided into base syllable recognition (disregarding the tones) and recognition of 4 tones. For base syllable recognition, we used a combination of two multisegment vector quantization (MSVQ) classifiers based on different features (instantaneous and transitional features of speech). For tone recognition, vector quantization (VQ) classifier was first used, and was comparable to multilayer perceptron (MLP) classifier. To get robust or better performance, a combination of distortion-based classifier (VQ) and discriminant-based classifier (MLP) is proposed. The evaluations have been carried out using standard syllable database CRDB in China, and experimental results have shown that combination of multiple classifiers with different features or different methodologies can improve recognition performance. Recognition accuracy for base syllable, tone, and tonal syllable is 96.79%, 99.82% and 96.24% respectively. Since these results were evaluated on a standard database, they can be used as a benchmark that allows direct comparison against other approaches.
Toshinori SATO Hiroshige FUJII Seigo SUZUKI
A new prediction method for the effective address is presented. This method works with the buffer named the address prediction buffer, and allows the data cache to be accessed speculatively. As a consequence of the trend toward increasing clock frequency, the internal cache is no longer able to fill the speed gap between the processor and the external memory, and the data cache latency degrades the processor performance. In order to hide this latency, the prediction method is proposed. By this method, the load address is predicted, and the data is fetched earlier than the memory access stage. In the case that the prediction is correct, the latency is hidden. Even if the prediction is incorrect, the performance is not degraded by any miss penalties. We have found that the prediction accuracy is 81.9% on average, and thus the performance is improved by 6.6% on average and a maximum of 12.1% for the integer programs.
Noriyuki TANIDA Takashi YOKOMORI
A subclass of context-free languages, called pure context-free languages, which is generated by context-free grammar with only one type of symbol (i.e., terminals and nonterminals are not distinguished), is introduced and the problem of identifying from positive data a restricted class of monogenic pure context-free languages (mono-PCF languages, in short) is investigated. The class of mono-PCF languages is incomparable to the class of regular languages. In this paper we show that the class of mono-PCF languages is polynomial time identifiable from positive data. That is, there is an algorithm that, given a mono-PCF language L, identifies from positive data, a grammar generating L, called a monogenic pure context-free grammar (mono-PCF grammar, in short) satisfying the property that the time for updating a conjecture is bounded by O(N3), where N is the sum of lengths of all positive data provided. This is in contrast with another result in this paper that the class of PCF languages is not identifiable in the limit from positive data.
Naoshi UCHIHIRA Shinichi HONIDEN
This paper concerns a Petri-net-based model for describing reactive and concurrent systems. Although many high-level Petri nets have been proposed, they are insufficiently practical to describe reactive and concurrent systems in the detail modeling, design and implementation phases. They are mainly intended to describe concurrent systems in the rough modeling phase and lack in several important features (e.g., concurrent tasks, task communication/synchronization, I/O interface, task scheduling) which the most actual implementations of reactive and concurrent systems have. Therefore it is impossible to simulate and analyze the systems accurately without explicitly modeling these features. On the other hand, programming languages based on Petri nets are deeply dependent on their execution environments and not sophisticated as modeling and specification languages. This paper proposes MENDEL net which is a high-level Petri net extended by incorporating concurrent tasks, task communication/synchronization, I/O interface, and task scheduling in a sophisticated manner. MENDEL nets are a wide-spectrum modeling language, that is, they are suitable for not only modeling but also designing and implementing reactive and concurrent systems.
Toshitsugu SAKAMOTO Yasunobu NAKAMURA Kazuo NAKAMURA
We study individual carrier traps in a GaAs/AlxGa1-xAs heterostructure by observing random telegraph signals. A narrow channel, which is formed in a split gate device, is shifted by independently controlling the voltage applied to each part of the split gate. RTSs can be observed only when the traps are close to the channel and the energy levels of the traps are within a few kBT of the Fermi level. This type of measurement reveals the locations and the energy distributions of the traps. We also discuss the situation in which two trap levels are at the Fermi level simultaneously. In this condition the two RTSs do not occur at the same time, but they do interact with each other. This implies that there is an electrostatic interaction between the two trappings.
Yutaka OHNO Shigeru KISHIMOTO Takashi MIZUTANI Koichi MAEZAWA
We analyzed the operation speed of the resonant tunneling logic gate, MOBILE, using a simple equivalent circuit model and varying parameters of I-V characteristics and capacitance of RTTs(resonant tunneling transistors). The switching time for large peak-to-valley(P/V)current ratios is smaller at small Vbmax(maximum bias voltage), but larger at large Vbmax than that for small P/V ratios in the case of present I-V characteristics with flat valley current. It is also demonstrated that the MOBILE operation fails if the bias voltage rises too fast, when the capacitance of the load and the driver is different due to the displacement current through the capacitance. These behaviors can be explained by considering the potential diagrams of the circuit.
A hardware algorithm for modular division is proposed. It is based on the extended Euclidean algorithm (EEA). The procedure for finding the multiplicative inverse in EEA is modified so that it calculates the quotient. Modular division is carried out through iteration of simple operations, such as shifts and additions. A redundant binary representation is employed so that additions are performed without carry propagation. An n-bit modular division is carried out in O(n) clock cycles. The length of each clock cycle is constant independent of n. A modular divider based on the algorithm has a bit-slice structure and is suitable for VLSI implementation.
A three-terminal quantum device utilizing photon-assisted tunneling in a multilayer structure is proposed and analyzed in terms of its high frequency amplification characteristics. The operation principle of this device includes photonassisted tunneling at the input, formation of a propagating charge wave due to the beat of tunneling electrons and its acceleration, and radiation of electromagnetic waves at the output. Analysis of these operations, discussion of similarities and dissimilarities to classical klystrons, and estimation of the power gain and its frequency dependence are given. A simple example demonstrates that amplification up to the terahertz frequency range is possible using this device.
Qun JIN Yoneo YANO Yoshio SUGASAWA
We develop a new class of stochastic Petri net: non-regenerative stochastic Petri net (NRSPN), which allows the firing time of its transitions with arbitrary distributions, and can automatically generate a bounded reachability graph that is equivalent to a generalization of the Markov renewal process in which some of the states may not constitute regeneration points. Thus, it can model and analyze behavior of a system whose states include some non-regeneration points. We show how to model a system by the NRSPN, and how to obtain numerical solutions for the NRSPN model. The probabilistic behavior of the modeled system can be clarified with the reliability measures such as the steady-state probability, the expected numbers of visits to each state per unit time, availability, unavailability and mean time between system failure. Finally, to demonstrate the modeling ability and analysis power of the NRSPN model, we present an example for a fault-tolerant system using the NRSPN and give numerical results for specific distributions.
Analog computation is a processing method that solves problems utilizing an analogy of a physical system to the problem. As it is based on actual physical effects and not on symbolic operations, it is therefore a promising architecture for quantum processors. This paper presents an idea for relating quantum structures with analog computation. As an instance, a method is proposed for solving an NP-complete (nondeterminis-tic polynomial time complete) problem, the three-color-map problem, by using a quantum-cell circuit. The computing process is parallel and instantaneous, so making it possible to obtain the solution in a short time regardless of the size of the problem.
Kevin Jing CHEN Koichi MAEZAWA Takao WAHO Masafumi YAMAMOTO
This paper presents the device technology for monolithic integration of InP-based resonant tunneling diodes (RTDs) and high electron mobility transistors (HEMTs). The potential of this technology for applications in quantum functional devices and circuits is demonstrated in two integration schemes in which RTDs and FETs are integrated either in Parallel or in series. Based on the parallel integration scheme, we demonstrate an integrated device which exhibits negative differential resistance and modulated peak current. This integrated device forms the foundation of a new category of functional circuits featuring clocked supply voltage. Based on the series integration scheme, resonant-tunneling high electron mobility transistors (RTHEMTs) with novel current-voltage characteristics and useful circuit applications are demonstrated. The high-frequency characteristics of RTHEMTs are also reported.
Isao NAKANISHI Yoshio ITOH Yutaka FUKUI
For reduction of computational complexity in the IA algorithm, the thinned-out IA algorithm in which only one step size is updated every iteration is proposed and is complementarily switched with the HA algorithm according to the convergence. The switching is determined by using the gradient of the error signal power. These are investigated through the computer simulations.