In this study, some oscillators with different oscillation frequencies, N - 1 oscillators have the same oscillation frequency and only the Nth oscillator has different frequency, coupled by a resistor are investigated. At first we consider nonresonance. By carrying out circuit experiments and computer calculations, we observe that oscillation of the Nth oscillator stops in some range of the frequency ratio and that others are synchronized as if the Nth oscillator does not exist. These phenomena are also analyzed theoretically by using the averaging method. Secondly, we investigate the resonance region where the fiequency ratio is nearly equal to 1. For this region we can observe interesting double-mode oscillation, that is, synchronization of envelopes of the double-mode oscillation and change of oscillation amplitude of the Nth oscillator.

Synchronization and chaos of the oscillator circuit that is composed of two Duffing-Rayleigh oscillators coupled by resistor are investigated. The characteristic feature of this system is that the cubic nonlinear restoring force of each oscillator. The restoring force causes the Neimark-Sacker bifurcation with various synchronizations in the parameter plane. We clarify the bifurcation structure related with this nonlinear phenomenon, and study the chaotic state and its bifurcation process. Especially, we deals with the case that the symmetrical property is broken by changing system parameters.

Chaos shift keying (CSK) is a modulation method in digital communication systems using chaotically modulated signals. This paper proposes novel CSK which utilizes two types of chaotic synchronization called in-phase and anti-phase chaotic synchronization. In this method, binary signals are mapped into two phases of chaotic synchronization, and a transmitter generates a two-phase-shift-keyed chaotic signal. So it will be called chaotic phase shift keying (CPSK) in this paper. This method is simpler than that based on two pairs of different chaotic systems. We also discuss an effect of noise in transmission lines.

In DCT transform coding it is usually necessary to discard some of the ac coefficients obtained after the transform operation for data compression reasons. Although most of the energy is usually compacted in the few coefficients that are transmitted, there are many instances where the discarded coefficients contain significant information. The absence of these coefficients at the decoder can lead to visible degradation of the reconstructed image especially around slow moving objects. We propose a simple but effective method which uses an indirect form of vector quantization to supplement scalar quantization in the transform domain. The distribution pattern of coefficients that fall below a fixed threshold is vector quantized and an index of the pattern chosen from a codebook is transmitted together with two averages; one for the positive coefficients and the other for negative coefficients. In the reconstruction, the average values are used instead of setting the corresponding coefficients to zero. This is tantamount to quantizing the mid range frequency coefficients with 1 bit but the resulting bit-rate is much less. We aim to propose an alternative to using traditional vector quantization which entails computational complexities and large time and memory requirements.

In this paper, an extention for Haddad's method, which is the time-domain stability analysis on scalar nonlinear control systems, to multi-variable nonlinear control systems are proposed, and it is shown that these results are useful for the stability analysis of nonlinear control systems with various types of fuzzy controllers.

This paper treats a new-type power combining system of four oscillators equally coupled to one another through an eight-port hybrid. This system is marked by easy analyzability and adjustability from its symmetrical construction. In addition, a combined power from the four oscillators is distinguishably delivered to an arbitrary port of four output ports, and hence can be switched in four ways. Experimental corroboration is presented also.

This paper proposed a fault localization and supervisory (SV) channel implementation for linear-repeaters (L-Reps) employing optical line amplifiers. In order to successfully introduce L-Reps into a Synchronous Digital Hierarchy (SDH)/Synchronous Optical Network (SONET)-based networks in a smooth, orderly fashion, layering of repeater section and supervisory system design must be taken into consideration. There supervisory techniques, such as linking analog-based and digital-based information, a precedence of digital-based information and an upstream precedence, for locating faulty L-Rep sections are proposed taking into consideration the difference in monitoring capabilities between L-Reps and regenerating-type repeaters (R-Reps). Furthermore, a linear repeater supervisory (LSV) channel configuration for L-Reps is also proposed. Finally, an SV system established in a prototype SDH-based 10-Gbit/s optical transmission system is briefly described.

It is thought that we have generally succeeded in establishing learning algorithms for neural networks, such as the back-propagation algorithm. However two major issues remain to be solved. First, there are possibilities of being trapped at a local minimum in learning. Second, the convergence rate is too slow. Chang and Ghaffar proposed to add a new hidden node, whenever stopping at a local minimum, and restart to train the new net until the error converges to zero. Their method designs newly generated weights so that the new net after introducing a new hidden node has less error than that at the original local minimum. In this paper, we propose a new method that improves their convergence rate. Our proposed method is expected to give a lower system error and a larger error gradient magnitude than their method at a starting point of the new net, which leads to a faster convergence rate. Actually, it is shown through numerical examples that the proposed method gives a much better performance than the conventional Chang and Ghaffar's method.

In this paper, a new explicit transformation method between Bezier and polynomial representation is proposed. An expression is given to approximate (n + 1) Bezier control points by another of (m + 1), and to perform simple and sufficiently good approximation without any additional transformation, such as Chebyshev polynomial. A criterion of reduction is then deduced in order to know if the given number of control points of a Bezier curve is reducible without error on the curve or not. Also an error estimation is given only in terms of control points. This method, unlike previous works, is more transparent because it is given in form of explicit expressions. Finally, we discuss some applications of this method to curve-fitting, order decreasing and increasing number of control points.

A new application of the factorization method is reported for 3-D shape reconstruction from endoscope image sequences. The feasibility of the method is verified with some theoretical considerations and results of extensive experiments. This method was developed by Tomasi and Kanade, and improved by Poelman and Kanade, with the aim of achieving accurate shape reconstruction by using a large number of points and images, and robustly applying well-understood matrix computations. However, the latter stage of the method, called normalization, is not as easily understandable as the use of singular value decomposition in the first stage. In fact, as shown in this report, many choices are possible for this normalization and a variety of results have been obtained depending on the choice. This method is easy to understand, easy to implement, and provides sufficient accuracy when the approximation used for the optical system is reasonable. However, the details of the theoretical basis require further study.

Viterbi decoding is known as a decoding scheme that can realize maximum likelihood decoding. However, it is impossible to continue it without re-synchronization even if only an insertion/deletion error occurs in a channel. In this paper, we show that Levenshtein distance is suitable for the metric of Viterbi decoding in a channel where not only symbol errors but also insertion/deletion errors occur under some conditions and we propose a kind of Viterbi decoding considering insertion/deletion errors.

C1 class smooth interpolation by a fuzzy reasoning for a small data set is proposed. The drafting technique of a human expert is implemented by using a set of fuzzy rules. The effectiveness of the present method is verified by computer simulations and by applications to the practical interpolation problem in a power system.

A method for the recognition of handprinted Thai characters input using an image scanner is presented. We use methods of edge detection and boundary contour tracing algorithms to extract loop structures from input characters. The number of loops and their locations are detected and used as information for rough classification. For fine classification, local feature analysis of Thai characters is presented to discriminate an output character from a group of similar characters. In this paper, four parts of the recognition system are presented: Preprocessing, single-character segmentation, loop structure extraction and character identification. Preprocessing consists of pattern binarization, noise reduction and slant normalization based on geometrical transformation for the forward (backward) slanted word. The method of single-character segmentation is applied during the recognition phase. Each character from an input word including the character line level information is subjected to the processes of edge detection, contour tracing and thinning to detect loop structures and to extract topological properties of strokes. The decision trees are constructed based on the obtained information about loops, end points of strokes and some local characteristics of Thai characters. The proposed system is implemented on a personal computer, and a high recognition rate is obtained for 1000 samples of handprinted Thai words from 20 subjects.

Abstract machine modelling is a technique used frequently in developing the retargetable compilers. By translating the abstract machine operations into target machine instructions, we can construct retargetable compilers. However, such a technique will cause two problems. First, the code produced by the compilers is inefficient. Next, in order to emit the efficient code, the compilation time is too long. In view of these two disadvantages, we apply PO (peephole optimizer) in our retargetable compilers to do code optimization. Peephole optimizer searches for the adjacent instruction candidates in the intermediate code, and then replaces them with equivalent instructions of less cost. Furthermore, the peephole description table consists of simple tree-rewriting rules which are easily retargeted into different machines. At the same time, we have proposed a simple peephole pattern matching algorithm to reduce the peephole pattern matching time. The experiment indicates that the machine code generated by our compiler runs faster than that by GNU c compiler (gcc).

In high-speed digital land mobile radio communication, communication quality is degraded by frequency selective fading that has intersymbol interference. It causes increase of bit error rate (BER). To decrease BER in the channel, this paper proposes a system with combined multilevel coding and adaptive equalization using interleaving. By using interleaving, the proposed system obtains time diversity effect. Furthermore the system realizes a type of decision feedback adaptive equalizer where signal after multilevel decoder is fed back. These features of the system cause decrease of BER. The proposed system is compared with a similar system with a feedback signal before multilevel decoder. The average bit error rate of the proposed system is less than 1/100 with that of the compared system at average Eb/No = 22 [dB] in a case of fading channel with one intersymbol interference.

The p-collection problem is where to locate p sinks in a flow network such that the value of a maximum flow is maximum. In this paper we show complexity results of the p-collection problem. We prove that the decision problem corresponding to the p-collection problem is strongly NP-complete. Although location problems (the p-center problem and the p-median problem) in networks and flow networks with tree structure is solvable in polynomial time, we prove that the decision problem of the p-collection problem in networks with tree structure, is weakly NP-complete. And we show a polynomial time algorithm for the subproblem of the p-collection problem such that the degree sum of vertices with degree3 in a network, is bound to some constant K0.

This paper presents a configuration of circularly polarized annular-ring microstrip antenna (ARMSA) and its design method to obtain high gain and low axial ratio including the analysis of finite ground plane effect using G.T.D. for personal satellite communication use. The ARMSA excited at TM21 mode through co-planar branch-line hybrid coupler for circular polarization produces a conical pattern which has high gain in low elevation angle. The relation of gain and axial ratio versus the dielectric constant of substrate are shown and the existence of the dielectric constant which satisfies two requirements, that is, high gain and low axial ratio are clarified. For car-top application, experimental results in the L-band showed satisfactory characteristics for vehicle antenna.

This paper presents a new blind identification method of nonminimum phase FIR systems and an adaptive blind equalization for PAM/QAM inputs without employing higher-order statistics. They are based on the observation that the absolute mean of a second-order white sequence can measure whether the sequence is higher-order white or not. The proposed methods are new alternatives to many higher-order statistics approaches. Some computer simulations show that the absolute mean is exactly estimated and the proposed methods can overcome the disadvantages of the higher-order statistics approaches.

Introducing a mathematical model of image noise, we formalize the problem of fitting a line to point data as statistical estimation. It is shown that the reliability of the fitted line can be evaluated quantitatively in the form of the covariance matrix of the parameters. We present a numerical scheme called renormalization for computing an optimal fit and at the same time evaluating its reliability. We also present a scheme for visualizing the reliability of the fit by means of the primary deviation pair and derive an analytical expression for the reliability of a line fitted to an edge segment by using an asymptotic approximation. Our method is illustrated by showing simulations and real-image examples.

In CAD and curve-fitting fields, we want to generate such rational cubic Bezier curve which is a unique curve passed given points and convenient to connect other curve segments with C1 connection. However, the method proposed in paper [1] can not meet above objective. in this paper, we propose a new method for generating a unique rational cubic Bezier curve which passed given points. The generated curve is with given tangent vectors at its two end points, and it is convenient to connect other curve segments with C1 connection. Also, some examples of curve generated by this method are given.