This paper describes two competitive learning algorithms from the viewpoint of deleting mechanisms of weight (reference) vectors. The techniques are termed the adaptivity and sensitivity deletions participated in the criteria of partition error and distortion error, respectively. Experimental results show the effectiveness of the proposed approaches in the average distortion.

The power coupling coefficients between cores of waveguide systems with random geometrical imperfections along the fiber axis are determined by comparing numerical solutions of the coupled mode equations with numerical solutions of the coupled power equations and the dependence of the power coupling coefficient on the correlation length with respect to the propagation constants of modes is clarified. When the correlation length D is small the power coupling coefficient is proportional to κ 2 D where κ is the mean mode coupling coefficient and is independent of the fluctuation of the propagation constants. For sufficiently large D the power coupling coefficient dc decreases in proportion to D-1 with increasing D and when D , dc 0. Then the dependence of the power coupling coefficient on the mode coupling coefficient and the fluctuation of the propagation constants δ β is expressed as a function of a single variable κ /δ β .

The finite volume time domain (FVTD) method is applied to electromagnetic wave scattering from random rough dielectric surfaces. In order to gain a better understanding of physics of backscattering of microwave from rough surface, this paper treats both horizontal and vertical polarizations especially at low- grazing angle. The results are compared with those obtained by the Integral equation method and the small perturbation method as well as with the experimental data. We have shown that the present method yields a reasonable solution even at LGA. It should be noted that the number of sampling points per wavelength for a rough surface problem should be increased when more accurate numerical results are required, which fact makes the computer simulation impossible at LGA for a stable result. However, when the extrapolation is used for calculating the scattered field, an accurate result can be estimated. If we want to obtain the ratio of backscattering between the horizontal and vertical polarization, we do not need the large number of sampling points.

The micro positioning systems using magnetic suspension technique, which is one of precision actuating method, have been suggested. Utilizing the various potentials such as the exclusion of a mechanical friction, they are being applied broadly to multi degrees of freedom (d.o.f) system requesting high accuracy or hybrid system requesting to be controlled position and force simultaneously. This paper presents the entire development procedure of a novel six d.o.f micro positioning system using mag-netic levitation, with a repulsive force mechanism covering the all d.o.f. First, the interactions between magnetic elements are modeled and the system design flow by an optimal location of the elements is given. A kinematic relationship between the measuring instruments and the levitated object is derived, and dynamic characteristics are identified by the narrow gap principles. And the main issues for control are discussed.

In this paper, we propose fast bitmap search algorithms to reduce the computational complexity of transform-based vector quantization (VQ) techniques, which achieve better quality in reconstructed images than the ordinary VQ. By removing the unlikely codewords in each step, the bitmap search method, which starts from the most significant bitmap then the successive significant ones, can save more than 90% computation of the ordinary transformed VQ. By applying to the singular value decomposition (SVD) VQ as an example, theoretical analyses and simulation results show that the proposed bitmap search methods dramatically reduce the computation and achieve invisible distortion in the reconstructed images.

Another high performance simulated annealing is proposed which we call widely stepping simulated annealing (WSSA). It flies from a starting high temperature to a finishing low temperature staying at only twenty or so temperatures to approach thermal equilibriums. We survey the phase transition in simulated annealing process and estimate the major cost variation (dEc) at the critical temperature. The WSSA uses a function (H(t)) that represents the probability for a hill-climbing with the dEc of cost increase to be accepted in Metropolis' Monte Carlo simulation at temperature t. We have applied the first version of WSSA to one dimensional transistor placement optimizations for several industrial standard cells, and compared its performance with simulated annealing with a geometrically scheduled cooling. The solutions by the WSSA are as good as, and sometimes much better than, the solutions by the simulated annealing, while the time consumption by the WSSA is properly under one 30th of that by the simulated annealing.

We present a result on the robust stabilization of uncertain nonlinear systems via applying feedback linearization. The allowable size of uncertainty is derived for stability. Based on that, we propose a technique that allows us to handle nonlinear systems which are not input-state linearizable. The usefulness of the technique is illustrated by numerical examples.

The classified side-match vector quantizer, CSMVQ, has already been presented for low-bit-rate image encoding. It exploits a block classifier to decide which class the input vector belongs to using the variances of the upper and left codewords. However, this block classifier doesn't take the variance of the current input vector itself into account. This letter presents a new CSMVQ in which a two-level block classifier is used to classify input vectors and two different master codebooks are used for generating the state codebook according to the variance of the input vector. Experimental results prove the effectiveness of the proposed CSMVQ.

A Generalized Hypercube Network (GHNet) with shared channels which requires only one fixed-wavelength transmitter and r(m-1) fixed-wavelength receivers per node is proposed. The proposed network topology reduces not only the number of transmitters per node but also the number of WDM channels required to service the same number of nodes compared with the GHNet with dedicated channels by sharing the available WDM channels, while it maintains the same channel efficiency as the GHNet with dedicated channels. The proposed network topology may be preferred in a situation where the number of available WDM channels and the cost of the transmitter may cause a major restriction on the lightwave network construction. For performance analysis, the network capacity and the mean queueing delay for the proposed network topology are obtained. Also, the performance measures of the proposed GHNet with shared channels are compared with those of the ShuffleNet with shared channels.

Numerous scientific and engineering fields extensively utilize optimization techniques for finding appropriate parameter values of models. Various optimization methods are available for practical use. The optimization algorithms are classified primarily due to the rates of convergence. Unfortunately, it is often the case in practice that the particular optimization method with specified convergence rates performs substantially differently on diverse optimization tasks. Theoretical classification of convergence rates then lacks its relevance in the context of the practical optimization. It is therefore desirable to formulate a novel classification framework relevant to the theoretical concept of convergence rates as well as to the practical optimization. This article introduces such classification framework. The proposed classification framework enables specification of optimization techniques and optimization tasks. It also underlies its inherent relationship to the convergence rates. Novel classification framework is applied to categorizing the tasks of optimizing polynomials and the problem of training multilayer perceptron neural networks.

This letter proposes a modified synchronous acquisition method using code-orthogonalizing filters (COFs) in an asynchronous direct sequence (DS) / CDMA. Improvements on the average acquisition time for several conditions are shown.

Despite their attractive properties, networked virtual environments (net-VEs) are notoriously difficult to design, implement and test due to the concurrency, real-time and networking features in these systems. The current practice for net-VE design is basically trial and error, empirical, and totally lacks formal methods. This paper proposes to apply a Petri net formal modeling technique to a net-VE: NICE (Narrative Immersive Constructionist/Collaborative Environment), predict the net-VE performance based on simulation, and improve the net-VE performance. NICE is essentially a network of collaborative virtual reality systems called CAVE-(CAVE Automatic Virtual Environment). First, we present extended fuzzy-timing Petri net models of both CAVE and NICE. Then, by using these models and Design/CPN as the simulation tool, we have conducted various simulations to study real-time behavior, network effects and performance (latencies and jitters) of NICE. Our simulation results are consistent with experimental data.

While a standard Kalman filter (or α-β filter) is commonly used for target tracking, it is well known that the filter performance is often degraded when the target heavily maneuvers. The usual way to accommodate maneuver is to adaptively adjust the filter gain. Our aim is to reduce the tracking error during substantial maneuvering using a combination of non-traditional "intelligent" algorithms. In particular, we propose an effective gain control using fuzzy rule followed by position error compensation via neural network. A Monte-Carlo simulation is performed for various target paths of representative maneuvers employing the proposed algorithm. The results of the simulation indicate a significant improvement over conventional methods in terms of stability, accuracy, and computational load.

We consider a discrete event system controlled by a decentralized supervisor consisting of n local supervisors. Given a nonempty and closed language as the upper bound specification, we consider a problem to synthesize a reliable decentralized supervisor such that the closed-loop behavior is still legal under possible failures of any less than or equal to n-k (1 k n) local supervisors. We synthesize two such reliable decentralized supervisors. One is synthesized based on a suitably defined normal sublanguage. The other is the fully decentralized supervisor induced by a suitably defined centralized supervisor. We then show that the generated languages under the control actions of these two decentralized supervisors are incomparable.

A new method of sequential control has been developed in order to increase the productivity and flexibility of production systems. This advanced sequential control (ASC) method is proposed for sequential control systems based on the autonomous decentralized system (ADS) architecture. The ADS defines the system software and message formats and makes it easy to expand the number of devices and software modules. The ASC method increases productivity because it minimizes the processing and adjustment times of production lines by adjusting the starting times of production processes automatically. Experimental evaluation results of the ASC method showed that it increases the productivity of production systems. It is also applied to an actual production system and the results are reported.

A distributed system is said to be self-stabilizing if it converges to some legitimate state from an arbitrary state in a finite number of steps. The number of steps required for convergence is usually referred to as the stabilization time, and its reduction is one of the main performance issues in the design of self-stabilizing systems. In this paper, we propose an automated method for computing the stabilization time. The method uses Boolean functions to represent the state space in order to assuage the state explosion problem, and computes the stabilization time by manipulating the Boolean functions. To demonstrate the usefulness of the method, we apply it to the analysis of existing self-stabilizing algorithms. The results show that the method can perform stabilization time analysis very fast, even when an underlying state space is very huge.

An algorithm for finding the optimal sectionalization for sectionalized trellises with respect to distinct optimality criterions was presented by Lafourcade and Vardy. In this paper, for linear block codes, we give a direct method for finding the optimal sectionalization when the optimality criterion is chosen as the total number |E| of the edges, the expansion index |E|-|V|+1, or the quantity 2|E|-|V|+1, only using the dimensions of the past and future sub-codes. A more concrete method for determining the optimal sectionalization is given for the Reed-Muller codes with the natural lexicographic coordinate ordering.

In this paper, a novel chaos circuit with long working-life is proposed. The proposed circuit consists of NMOS-coupled discrete-time chaotic cell circuits. By employing chaos synchronization phenomenon, the proposed circuit can achieve long working-life. Since the proposed circuit is less susceptible to breakdown, the rate of the acceptable product for chaos IC can be improved. Furthermore, thanks to the coupling by using NMOSFET's, the loss of the connection line between chaotic cell circuits can be controlled electronically. Therefore, the proposed system designed by using switched-current (SI) techniques is useful as an experimental tool to analyze chaos synchronization phenomena. The validity of the proposed circuits is confirmed by computer simulations and experiments.

In synchronous CDMA system, the orthogonal spreading sequences are employed to reduce the multiple access interference. However, as the frequency selectivity of the propagation channel strengthens, the orthogonality among different users tends to diminish because of increasing inter-path interference. In this paper, various binary and nonbinary orthogonal sequences are discussed. In order to maintain the orthogonality among different users, a new concept of generalized orthogonality is defined and the corresponding sequences are presented, including binary, quadriphase and nonbinary code sequences. Based on a simplified synchronous CDMA system model, the related system performance is also analyzed and compared for different orthogonal and generalized orthogonal spreading sequences. Our analytical and simulation results show that the generalized orthogonal code sequences are indeed more robust in the multipath propagation channels, compared with the traditional orthogonal code sequences.

First order line seach optimization techniques gained essential practical importance over second order optimization techniques due to their computational simplicity and low memory requirements. The computational excess of second order methods becomes unbearable for large optimization tasks. The only applicable optimization techniques in such cases are variations of first order approaches. This article presents one such variation of first order line search optimization technique. The presented algorithm has substantially simplified a line search subproblem into a single step calculation of the appropriate value of step length. This remarkably simplifies the implementation and computational complexity of the line search subproblem and yet does not harm the stability of the method. The algorithm is theoretically proven convergent, with superlinear convergence rates, and exactly classified within the formerly proposed classification framework for first order optimization. Performance of the proposed algorithm is practically evaluated on five data sets and compared to the relevant standard first order optimization technique. The results indicate superior performance of the presented algorithm over the standard first order method.