Ken HIGUCHI Etsuji TOMITA Mitsuo WAKATSUKI
A deterministic pushdown automaton (dpda) having just one stack symbol is called a deterministic restricted one-counter automaton (droca). When it accepts by empty stack, it is called strict. A deterministic one-counter automaton (doca) is a dpda having only one stack symbol, with the exception of a bottom-of-stack marker. The class of languages accepted by strict droca's is a subclass of the class of languages accepted by doca's. Valiant has proved the decidability of the equivalence problem for doca's and the undecidability of the inclusion problem for doca's. Hence the decidablity of the equivalence problem for strict droca's is obvious. In this paper, we present a new direct branching algorithm for checking the inclusion for a pair of languages accepted by strict droca's. Then we show that the worst-case time complexity of our algorithm is polynomial with respect to these automata.
Let L{0,1}* be a language and let λL : {0,1}*
Throughout the paper, the nearest-neighbour (NN) interconnection of switches within a multistage interconnection network (MIN) is analysed. Three main results are obtained: (1) The switch preserving transformation of a 2-D MIN into the 1-D MIN (and vice versa) (2) The rearrangeability of the MIN and (3) The number of stages (NS) for the rearrangeable nonblocking interconnection. The analysis is extended to any dimension of the interconnected data set. The topological equivalence between 1-D MINs with NN interconnections (NN-MINs) and 1-D cellular arrays is shown.
Masafumi SAITO Shigeki MORIYAMA Shunji NAKAHARA Kenichi TSUCHIDA
OFDM (Orthogonal Frequency Division Multiplexing) is a useful digital modulation method for terrestrial digital broadcasting systems, both for digital TV broadcasting and digital audio broadcasting. OFDM is a kind of multicarrier modulation and shows excellent performance especially in multipath environments and in mobile reception. Other advantages are its resistance to interference signals and its suitability for digital signal processing. When each carrier of the OFDM signal is modulated with DQPSK, we call it DQPSK-OFDM. DQPSK-OFDM is a basic OFDM system, which is especially suitable for mobile reception. This paper describes how a DQPSK-OFDM system works and shows several experimental and simulation results. The experimental results mainly concern the performance of the DQPSK-OFDM system relative to various disturbances such as multipath (ghost) signals, nonlinearity of the channel, and interference from analog signals. The transmission characteristics of DQPSK-OFDM are investigated and the basic criteria for the system design of DQPSK-OFDM are discussed.
Yitong ZHANG Kazuo SHIGETA Eiji SHIMIZU
A new approach of data clustering which is capable of detecting linked or crossed clusters, is proposed. In conventional clustering approaches, it is a hard work to separate linked or crossed clusters if the cluster prototypes are difficult to be represented by a mathematical formula. In this paper, we extract the force information from data points using the concept of psychological potential field, and utilize the information to measure the similarity between data points. Through several experiments, the force shows its effectiveness in diiscriminating different clusters even if they are linked or corssed.
Hirotaka IGARASHI Yoshiaki KAKUDA Tohru KIKUNO
Responsive protocols are communication protocols which ensure timely and reliable recovery when error events occur. Protocol synthesis for design of responsive protocols is to derive a protocol specification based on a service specification. In the previous methods, if the service specification includes simultaneous transmission of primitives from a high layer to a low layer through different service access points, then the derived protocol specification includes protocol errors of unspecified reception caused by message collisions. Also, they only includes a recovery function such as retransmission of messages. This is not enough for recovery from abnormal states due to coordination loss. This paper extends a class of derived protocol specifications to include message collisions which usually occur in real communication protocols. Furthermore, this paper proposes a new method for synthesis of a responsive protocal specification derived from a service specification such that the derived protocol specification is free from protocol erros of unspecified receptions caused by message collisions and includes two recovery functions: message retransmission and checkpoint restart functions.
Let U denote a set comprising elements called "keys." The goal of the nearest point problem is to search quickly for a key among some keys x1 , xn that is the nearest to a reference key x under a partial order relation defined as (x, y) (x, z) for x, y, zU if d(x, y)d(x, z) given a wide-sense distance measure d. This article proposes a method of rearranging x1 , xn into a binary perfectly-balanced tree for solving quickly the nearest point problems. Further, computational performances of the proposed method are evaluated experimentally.
Kiyomichi ARAKI Toshihiko HASHIMOTO
In this paper, we attempt the comparison of the image/signal restoration between Projection Filter, which is regarded as one of the linear optimal filters, and the non-linear filter based on MEM. From the simulation, we show the advantage of MEM restoration filter in restoring noisy degraded images.
Tatsuya YAMAZAKI Mehdi N.SHIRAZI Hideki NODA
An adaptive restoration algorithm is developed for binary images degraded nonadditively with flip noises. The true image is assumed to be a realization of a Markov Random Field (MRF) and the nonadditive flip noises are assumed to be statistically independent and asymmetric. Using the Expectation and Maximization (EM) method and approximating the Baum's auxiliary function, the degraded image is restored iteratively. The algorithm is implemented as follows. First, the unknown parameters and the true image are guessed or estimated roughly. Second, using the true image estimate, the Baum's auxiliary function is approximated and then the noise and MRF parameters are reestimated. To reestimate the MRF parameters the Maximum Pseudo-likelihood (MPL) method is used. Third, using the Iterated Conditional Modes (ICM) method, the true image is reestimated. The second and third steps are carried out iteratively until by some ad hoc criterion a critical point of EM algorithm is approximated. A number of simulation examples are presented which show the effectiveness of the algorithm and the parameter estimation procedures.
Hiroshi KONDO Yoshinobu MAKINO Hidetoshi HIRAI
A new image restoration filter based upon a physical model of an image degradation is constructed. By means of this filter, signal dependent noise and blur can be suppressed. In particular, image degradation noise can be modeled in generalized form. Noise suppression and deblurring are performed separately. This filter has additional applications when used in conjunction with the degradation model, such as real photographic images and photoelectronic images. Simulation results show that this filter gives a superior performance in restoring an image degraded by signal dependent noise and blur.
Hideki SAKAUCHI Yasuyo OKANOUE Satoshi HASEGAWA
This paper proposes design schemes which obtain an efficient spare-channel assignment against single and double link failures for a self-healing network. Spare-channel design problems can be formulated as a linear-programming (LP) problem when variables are assumed to be continuous. For the problem, the proposed algorithm effectively solves a sub-set of whole constraints by making use of a maximum-flow algorithm in an iterative manner. It is shown that the maximum number of iteration times is limited by the number of links in the network. Moreover, the relation between the design function and the self-healing function is discussed. It is also shown that the cooperation of the two functions can realize more effective control in large scale networks.
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.