This paper describes cellular spaces (or cellular automata) with capabilities of parallel self-reproduction and of parallel universal simulation of other cellular spaces. It is shown that there is a 1-dimensional cellular space U, called a parallel universal simulator, that can simulate any given 1-dimensional cellular space S in the sense that if an initial configuration of U has a coded information of both the local function and an initial configuration of S, then U has the same computation result that S has and the computation time of U is proportional to that of S. Two models of nontrivial parallel self-reproduction are also shown. One model is based on "state-exchange" method, and the other is based on a fixed point program of the parallel universal simulator.

Some kind of practical problems such as security verification of cryptographic protocols can be described as a problem to accomplish a given purpose by using limited operations and limited materials only. To model such problems in a natural way, unification problems under constrained substitutions have been proposed. This paper is a collection of results on the decidability and the computational complexity of a syntactic unification problem under constrained substitutions. A number of decidable, undecidable, tractable and intractable results of the problem are presented. Since a unification problem under constrained substitutions can be regarded as an order-sorted unification problem with term declarations such that the number of sorts is only one, the results presented in this paper also indicate how the intractability of order-sorted unification problems is reduced by restecting the number of sorts to one.

The problem of non-preemptive scheduling of real-time periodic tasks with specified release times on a uniprocessor system is known as NP-hard problem. In this paper we propose a new non-preemptive scheduling algorithm and a new static scheduling strategy which use the repetitiveness and the predictability of periodic tasks in order to improve schedulabilities of real-time periodic tasks with specified release times. The proposed scheduling algorithm schedules periodic tasks by using the heuristic that precalculates if the scheduling of the selected task leads to the case that a task misses a deadline when tasks are scheduled by the non-preemptive EDF algorithm. If so, it defers the scheduling of the selected task to avoid the precalculated deadline-missing. Otherwise, it schedules the selected task in the same way as the non-preemptive EDF algorithm. Our scheduling algorithm can always find a feasible schedule for the set of periodic tasks with specified release times which is schedulable by the non-preemptive EDF algorithm. Our static sheduling strategy transforms the problem of non-preemptive scheduling for periodic tasks with specified release times into one with same release times for all tasks. It suggests dividing the given problem into two subproblems, making a non-preemptive scheduling algorithm to find two feasible subschedules for the two subproblems in the forward or backward scheduling within specific time intervals, and then combining the two feasible subschedules into a complete feasible schedule for the given problem. We present the release times as a function of periods for the efficient problem division. Finally, we show improvements of schedulabilities of our scheduling algorithm and scheduling strategy by simulation results.

Using object-oriented techniques, one can build software that models the real world more closely. In objectoriented analysis and design, two types of closely interrelated models have been built which specify the static structure and the dynamic behavior of objects. Much work based on those models deals with how to use inheritance to support reuse and easy extension more precisely. In this paper, we are concerned with the dynamic aspects of objects, and define a behavior inheritance relationship between a class and its subclass. We present a set of derivation operations based on the incremental design of the behavior model. The operations preserve the behavior inheritance relationship between classes. The result makes a theoretical base for making new classes by reusing the existing classes in objectoriented system development.

In this paper we describe a method, which allows the likelihood normalization technique, widely used for speaker verification, to be implemented in a text-independent speaker identification system. The essence of this method is to apply likelihood normalization at frame level instead of, as it is usually done, at utterance level. Every frame of the test utterance is inputed to all the reference models in parallel. In this procedure, for each frame, likelihoods from all the models are available, hence they can be normalized at every frame. A special kind of likelihood normalization, called Weighting Models Rank, is also experimented. We have implemented these techniques in speaker identification system based on VQ-distortion codebooks or Gaussian Mixture Models. Evaluation results showed that the frame level likelihood normalization technique gives higher speaker identification rates than the standard accumulated likelihood approach.

The defects in the cold rolled strips have textural characteristics, which are nonuniform due to its irregularities and deformities in geometrical appearance. In order to handle the textural characteristics of images with defects, this paper proposes a surface inspection method based on textural feature extraction using the wavelet transform. The wavelet transform is employed to extract local features from textural images with defects both in the frequency and in the spatial domain. To extract features effectively, an adaptive wavelet packet scheme is developed, in which the optimum number of features are produced automatically through subband coding gain. The energies for all subbands of the optimal quadtree of the adaptive wavelet packet algorithm and four entropy features in the level one LL subband, which correspond to the local features in the spatial domain, are extracted. A neural network is used to classify the defects of these features. Experiments with real image data show good training and generalization performances of the proposed method.

The supervisory control theory of discrete event dynamic systems was proposed in the framework of automata and formal languages. The concept of decentralized supervisory control was developed for the local supervisor S_i whose concurrent operation results in the closed-loop language L (S_i/G) equal to that of global supervisor, L (S/G). In this letter we extend this concept by considering the problem of optinal combination of decentralized with centralized control in case pure decentralized control happens to be inadequate. We introduce the concept of locally controllable complementary tuple and present an analytical framework for nonhomogeneous decentralized supervisory control systems.

ATM networks are proposed by CCITT as the solution for the future B-ISDN. In ATM networks, the cells are transmitted between user and network without flow control, therefore, a policing mechanism (PM) is needed to check that the source traffic doesn't exceed the negotiated parameters. The sources supported by ATM networks have a bursty nature. The control of the mean cell rate of the bursty sources is intended to increase the network utilization. The conventional PMs can't efficiently monitor the mean cell rate of bursty sources, therefore new PMs are needed. In this letter, we propose a fuzzy policing mechanism (FPM). The performance evaluation via simulations shows that the FPM efficiently controls the mean cell rate of the packet voice source. The selectivity characteristics of the FPM approach the ideal characteristic required for a PM.