Two method to predict targets which a user is about to point with a mouse on the basis of the trajectory of the mouse cursor were proposed. The effects of the interval between targets, the position of targets, the sampling interval and the number of sampling on the pointing time and the prediction accuracy were investigated. In both methods, the distance between targets had little effects on the pointing time. The prediction accuracy was found to be affected by the position of targets. In both prediction methods, the angle between the cursor movement vector and the vector which connects the current cursor position and the center of each target is calculated every st. As for Prediction Method1 that regards the target which correspond to the minimum angle continuously 5 times as the candidate target, the optimal condition of the sampling interval was found to be 0.06 sec or 0.08 sec. Concerning Prediction Method2 that calculates the angle n times and determines the minimum cumulative value as the candidate, the optimal condition of the number of sampling was 8.

This paper proposes and investigates a tap selectable Viterbi equalizer for mobile radio communications. When the multipath channel is modeled by a tapped delay line only, the taps which may seriously affect the data sequence estimation are selected and used to calculate the trellis metric in the Viterbi algorithm. The proposed equalization algorithm can reduce the number of path metric calculations and the number of path selections in the Viterbi algorithm. Moreover, we propose an extended equalizer which has antenna diversity. This equalizer calculates the path metric using the antenna outputs and results of channel estimators. Computer simulation is used to evaluate the BER performance of the proposed equalizer in a multipath radio channel.

A fast pitch search algorithm using the skipping technique is proposed to reduce the computation time in CELP vocoder. Based on the characteristics of the correlation function of speech signal, the proposed algorithm skips over certain ranges in the full pitch search range in a simple way. Though the search range is reduced, high speech quality can be maintained since those lags having high correlation values are not skipped over and are used for search by closed-loop analysis. To improve the efficiency of the proposed method, we develop three variants of the skipping technique. The experimental results show that the proposed and the modified algorithm can reduce the computation time in the pitch search considerably, over 60% reduction compared with the traditional full search method.

In this paper, electromagnetic scattering by infinite double two-dimensional periodic array of resistive upper and lower elements is considered. The electric field equations are solved by using the moment method in the spectral domain. Some numerical results are shown and frequency selective properties are discussed.

The magnetic properties and the structure of electroless-deposited NiFeB films were investigated in comparison with those of electrodeposited NiFe films. The electroless-deposited NiFeB film with 27at% Fe content had the lowest coercivity, H, as low as 0.5 Oe with a saturation magnetic flux density, Bs, of 1.0 T. The saturation magnetostriction, λ, and the uniaxial magnetic anisotropy, Hk, were 5.010-6 and 10 Oe, respectively, which were larger than those of the conventional, electrodeposited permalloy film. The permeability of as-deposited Ni70Fe27B3 film was 1000 at 1 MHz. In order to improve the permeability, the film was heated at 200 in a magnetic field applied in the hard-axis direction to decrease the Hk value, and the permeability became 2000 at 1 MHz. The crystal structure and grain size of NiFeB and NiFe films were investigated by XRD, THEED and TEM. Both films with low Hc had an fcc structure; the grain size of the NiFeB film was smaller than 10 nm, while that of the NiFe film was larger, approximately 20 nm. The results suggested that the electroless-deposited NiFeB film had a larger magnetic anisotropy than the electrodeposited NiFe film. Moreover, the films with Hc less than 10 Oe ded not show clear difference between their TEM bright images and THEED patterns.

In this paper, a pushdown automaton, with an infinite set of states as a partially ordered set (poset), is formulated, and its control problem of whether a given configuration can be transferred to another is discussed. For the controllability to be decidable, we take a condition the poset satisfies, that is, a condition that there are only finite number of states under the partial ordering between two given states. The control problem is decidable in polynomial time on condition the length of each pushed stack string is bounded by a constant in a given pushdown automaton. The motivation of considering the control problem comes up from the stack structure in implementing the SLD resolution deductions, in which the leftmost atom in each goal is selected and unified with some procedure name (that is, some head) of a definite clause, with the effect of the procedure name being replaced by the procedure bodies and unifications. Thus, the control problem is applied to describe the SLD resolution deductions of finite steps, by constructing a pushdown automaton model for a set of definite clauses, in which leftmost selection of atom in each goal forms a stack structure and substitutions affecting goals are interpreted as states. When constructing a pushdown automaton model for an SLD resolution deduction, algebraic properties of the idempotent substitution set, which are used in unifications, are examined and utilized. The quotient set of the idempotent substitution set per renamings is adopted to present the automaton model.

Simplification of the Viterbi algorithm and the error rate performance are presented for a partial response maximum-likelihood (PRML) system employing the PR(1, 1) system as a PR system for (1, 7) run-length limited (RLL) code. The minimum run-length of 1's or O's in the output sequence of the precoder for (1, 7) RLL code is limited to 2. Two kinds of simplified Viterbi algorithms using this run-length constraint are proposed. One algorithm requires the path memory length of only two in the Viterbi detector. The Viterbi detector based on the other algorithm is equivalent to the simple PR(1, 1) system followed by a threshold detector. The bit-error rates of PRML systems with Viterbi detectors based on these algorithms are obtained by computer simulation and their performance is compared with that of conventional PRML systems for (1, 7) RLL code. It is shown that the proposed PRML system exhibits better performance than conventional PRML systems at high recording density.

In this paper, we discuss an abstraction method for Petri nets based on an equivalence of firing sequences of a specified subnet or a specified subset of transitions. Specifically, a method is presented to generate an equivalent net which preserves firing sequences of a specified subnet or a specified subset of transitions. The abstraction can be applied to an efficient behavioral analysis of concurrent systems constructed by composition of modules such as communication networks and Flexible Manufacturing Systems (FMS).

I have examined factors for implementing a high-speed, low-power-consumption thermal head. In conventional thermal heads, a heat insulation layer is provided between the heating resistor and the radiator. I found it desirable to implement fast operation and low power consumption to lower the thermal conductivity of the heat insulation layer and to thin the heat insulation layer. I also found there is an optimum heat characteristic to the thickness of one heat insulation layer. I assumed polyimide as a material for the heat insulation layer which could materialize the hypothesis, and studied necessary items based on the thermal calculation. I manufactured a trial thermal head on the basis of this result and confirmed that our assumptions were correct. In addition, to confirm that the assumption is also ultimately correct, I fabricated a trial thermal head only consisting of a heating resistor and without a protective coat and a heat insulation layer. I confirmed that the structure with only the heating resistor exhibited excellent heat response and consumed less power necessary for heating.

The disturbance-rejection problem is to find a feedback control law for linear control systems such that the influence of disturbances is completely rejected from the output. In 1970 Wonham and Morse first studied this problem in the framework of the so-called geometric approach. On the other hand, in 1985 Ghosh studied parameter insensitive disturbance-rejection problems with state feedback and with dynamic compensator. In this paper we study the parameter insensitive disturbance-rejection problem with static incomplete-state feedback for linear multivariable systems in the framework of the geometric approach from the mathematical point of view. Necessary conditions and/or sufficient conditions for this problem to be solvable are presented. Finally an illustrative example is presented.

In order to provide a fuzzy system with learning function, numerous studies are being carried out to combine fuzzy systems and neural networks. The self-tuning methods using the descent method have been proposed. The constructive and the destructive methods are more powerful than other methods using neural networks (or descent method). On the other hand the destructive method is superior in the number of rules and inference error and inferior in learning speed to the constructive method. In this paper, we propose a new learning method combining the constructive and the destructive methods. The method is superior in the number of rules, inference error and learning speed to the destructive method. However, it is inferior in learning speed to the constructive method. Therefore, in order to improve learning speed of the proposed method, simplified learning methods are proposed. Some numerical examples are given to show the validity of the proposed methods.

The main purpose of this paper is to give a new representation method of the convergence characteristics of the LMS algorithm using tap-input vectors. The described representation method is an extended version of the interpretation method based on the orthogonal projection. Using this new representation, we can express the convergence characteristics in terms of tap-input vectors instead of the eigenvalues of the input signal. From this representation, we consider a general method for improving the convergence speed.

We present a framework for the unsupervised segmentation of time series. It applies to non-stationary signals originating from different dynamical systems which alternate in time, a phenomenon which appears in many natural systems. In our approach, predictors compete for data points of a given time series. We combine competition and evolutionary inertia to a learning rule. Under this learning rule the system evolves such that the predictors, which finally survive, unambiguously identify the underlying processes. The segmentation achieved by this method is very precise and transients are included, a fact, which makes our approach promising for future applications.

In practical applications of the artificial boundary surfaces, such as corrugation and strips on a grounded dielectric slab, the surfaces have finite sizes. The diffraction fields from anisotropic surface of this kind can not be calculated using conventional diffraction coefficients. In this paper, uniform diffraction coefficients for the strips on a grounded dielectric slab are given in the sense of physical optics, as functions of incident angle, polarization and structural parameters of the surface. Firstly, the incident plane wave is decomposed into the two special polarization directions. Then uniform diffraction coefficients originally derived for isotropic surfaces with arbitrary impedance can be applied for each polarization component. Finally, expressions for the diffraction coefficients from the anisotropic surface are given as the sum of those for two polarization components. The validity of the diffraction coefficients is verified theoretically and experimentally.

This paper proposes a new algorithm called the fast Projection algorithm, which reduces the computational complexity of the Projection algorithm from (p+1)L+O(p3) to 2L+20p (where L is the length of the estimation filter and p is the projection order.) This algorithm has properties that lie between those of NLMS and RLS, i.e. less computational complexity than RLS but much faster convergence than NLMS for input signals like speech. The reduction of computation consists of two parts. One concerns calculating the pre-filtering vector which originally took O(p3) operations. Our new algorithm computes the pre-filtering vector recursively with about 15p operations. The other reduction is accomplished by introducing an approximation vector of the estimation filter. Experimental results for speech input show that the convergence speed of the Projection algorithm approaches that of RLS as the projection order increases with only a slight extra calculation complexity beyond that of NLMS, which indicates the efficiency of the proposed fast Projection algorithm.

In this paper, the diffusion parameter-values in the K+-ion diffused waveguides made by diluted KNO3 with NaNO3 in the soda-lime glass, which are determined from measured values of the effective index, are presented together with a simple method for the determination. The surface-index changes are measured for the waveguides by KNO3 melts with 75%-, 50%- and 30%-dilutions (weight ratio), and for comparison purpose, also by the pure KNO3, and the dependence of the index-profile on the dilution of KNO3 in the ion-source melt is shown. Change of the two-dimensional index profile in the diffused channel waveguide with the KNO3-dilution is also shown, which is calculated with the measured diffusion parameters.

Cellular Neural Networks (CNNs) are nonlinear dynamic array processors with mainly local interconnections. In most of the applications, the local interconnection pattern, called cloning template, is translation invariant. In this paper, an optimal ring-coding method for rotation invariant description of given set of objects, is introduced. The design methodology of the templates based on the ring-codes and the synthesis of CNN analogic algorithms to detect standing and moving objects in a rotationally invariant way, discussed in detail. It is shown that the algorithms can be implemented using the CNN Universal Machine, the recently invented analogic visual microprocessor. The estimated time performance and the parallel detecting capability is emphasized, the limitations are also thoroughly investigated.

This paper proposes a new multistage switch architecture for large-scale multicast ATM switching. The proposed architecture uses routing schemes both at the connection level and the cell level. This results in the reduction of the memory capacity required in the trunk number translators of the copy network modules. If Connection Splitting algorithm is used, a nonblocking switch can be constructed under the same nonblocking condition as that of point-to-point Clos network. It is shown that the memory requirements in the new switching network are less than the previous architectures.

We present that event-transition diagrams are useful to analyze event concurrent response visually. Event-transition diagrams are dual for state-transition diagrams in graph theory. As an example of an usage of an event-transition diagram, a simple model of a railroad crossing is presented.

Active net is a deformable model which utilizes the network analogy of a physical region. In the model, the region of a target is detected by minimizing the energy defined for the sample points of the model. The region of the target is extracted using fixed network topology in the orginally proposed algorithm. In this paper, we introduce the network reconfiguration mechanisms such as tearing and division to realize multiple objects detection and complex object detecion. The introduced algorithm dynamically unlinks the arcs of the network when their strain value exceeds predefined threshold level. In the method, we propose a new image energy which improves the position sensitivity of edges without increasing computation cost. Experimental results for images taken by video camera show the validity of our approach.