We consider a ring of n Rayleigh oscillators coupled hybridly. Using the symmetrical property of the system we demonstrate the degeneracy of the Hopf bifurcation of the equilibrium at the origin. The degeneracy implies the exstence and stability of the n-phase oscillation. We discuss some consequences of the perturbation of the symmetry. Then we study the case n = 3. We show the bifurcation diagram of the equilibria and of hte periodic solutions. Especially, we analyze the mechanism for the symmetry breaking bifurcation of the fully symmetric solution. We report and explain the occurrence of both chaotic attractors and repellors and show two types of symmetry recovering crisis they undergo.

Research in very low-bit rate coding has made significant advancements in the past few years. Most recently, the introduction of the MPEG-4 proposal has motivated a wide variety of a approaches aimed at achieving a new level of video compression. In this paper we review progress in VLBV categorized into 3 main areas. (1) Waveform coding, (2) 2D Content-based coding, and (3) Model-based coding. Where appropriate we also described proposals to the MPEG-4 committee in each of these areas.

The Yasuura method is effective for calculating scattering problems by bodies of revolution. However dealing with 3-D scattering problems, we need to solve bigger size dense matrix equations. One of the methods to solve 3-D scattering is to use multipole expansion which accelerate the convergence rate of solutions on the Yasuura method. We introduce arrays of multipoles and obtain rapidly converging solutions. Therefore we can calculate scattering properties over a relatively wide frequency range and clarify scattering properties such as frequency dependence, shape dependence, and polarization dependence of 3-D scattering from perfectly conducting scatterer. In these numerical results, we keep at least 2 significant figures.

There has been an increasing interest in multiple scattering phenomena in recent years. This is primarily due to the discovery of new multiple scattering phenomena and an increasing awareness that a common thread underlies the work of many researchers in such diverse fields as atmospheric optics, ocean acoustics, radio physics, astrophysics, condensed matter physics, plasma physics, geophysics, bioengineering, etc. In addition, waves in random media is one of the most challenging problems to theoreticians. Thus the field of wave propagation and scattering encompasses the most practical as well as the most theoretical questions. The strong interest in this subject is reflected in the launch of a new journal, Waves in Random Media, by the Institute of Physics, United Kingdom in 1991. This paper reviews some of the most recent developments and discoveries in the field of wave propagation and scattering in turbulence and volume and surface scattering. Included are new discoveries of backscattering enhancement and memory effects which may be applicable to tissue optics, ultrasound imaging, ocean acoustics and geophysical remote sensing. Also indicated are recent developments of numerical Monte-Carlo techniques and experimental studies on this subject.

In this paper, scattering problem of the grating coupler is analyzed by the mode-matching method in the sense of least squares for the gaussian light beam incidence. This coupler has a periodic groove structure of finite extent, which is formed on the surface of the core layer of the symmetric thin-film waveguide. In the present method, the approximate scattered fields of each region of the grating coupler are described by the superpositions of the plane waves with band-limited spectra, respectively. These approximate wave functions are determined by the minimization of the mean-square boundary residual. This method results in the simultaneous Fredholm type integral equations of the second kind for these spectra. The first and second order approximate solutions of the integral equations are derived analytically and the coupling efficiency and scattered fields are analyzed on the basis of those solutions. A qualitative and physical consideration for the scattering problem of the grating coupler is presented with the fundamental data derived from approximate solutions in this paper.

The scattering problem of a plane wave by an axially slotted conducting elliptic cylinder in homogeneous medium is investigated. We present an accurate analysis using the modified point matching method, which can reduce the order of the simultaneous equations to be solved at least by a half under the condition of the same accuracy as compared with an usual point matching method. The accuracy of our results is checked by evaluating the relative errors. Numerical results are given for scattered field patterns by a conducting elliptic cylinder with a slot aperture of angle width 120 when the angle of incidence θinO.

It is shown that five optimal and one quasioptimal binary codes with respect to the Griesmer bound can be obtained from cyclic codes over GF(2fm). An [m(2em - 1), em, 2em-1m] code, a [3(22e - 1), 2e, 322e-1] code, a [2(22e - 1), 2, (22e+2 - 4)/3] code, a [3(22e - 1), 2, 22e+1 - 2] code, and a [3(22e - 1), 2(e+1), 322e-1 - 2] code are optimal and a [2(22e - 1), 2(e + 1), 22e - 2] code is quasi-optimal.

The Guaranteed Bandwidth Protocol (GBW) is an access scheme being proposed for implementation of connection oriented services in DQDB networks. Connection oriented services are expected to handle both constant bit rate (CBR) and variable bit rate (VBR) traffic that have delay and jitter constraints. It has been reported that the GBW protocol can provide guaranteed bandwidth and lower delays compared to the ordinary DQDB protocol. However, the intensity of the jitter introduced by this scheme has not been made clear. This paper compares the jitter results for the GBW scheme to those obtained by a new access method called Modified Guaranteed Bandwidth (MOD_GBW) protocol, which is proposed here. It is shown through simulation that MOD_GBW also provides guaranteed bandwidth and that its delay and jitter characteristics are significantly better than those of the GBW protocol. In the simulation model, the DQDB stations are divided into two groups: 1)Real-Time (RT) stations that generate either CBR or VBR real-time traffic; and 2)Data stations that generate memoryless type of traffic. Data stations operate according to the ordinary DQDB protocol only. The main performance measure adopted here for the real-time traffic is the interdeparture time distribution of consecutive segments from an RT-station. We define the variance of this distribution as jitter. This paper also shows the impact of GBW/MOD_GBW on the performance of the data stations by evaluating their throughput and average bus access delay. Finally, we show that the network performance is weakly related to the number of RT-stations under MOD_GBW, but it depends strongly on the overall loading.

The capability of generalization is the most desirable property of a learning system. It is well known that to achieve good generalization, the complexity of the system should match the intrinsic complexity of the problem to be learned. In this work, introduction of fractal connection structure in nonlinear learning systems like multilayer perceptrons as a means of improving its generalization capability in classification problems has been investigated via simulation on sonar data set in underwater target classification problem. It has been found that fractally connected net has better generalization capability compared to the fully connected net and a randomly connected net of same average connectivity for proper choice of fractal dimension which controlls the average connectivity of the net.

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.

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.

Most research on the estimation of direction of arrival (DOA) has been performed based on the assumption that the signal sources are point sources. In some real surroundings, signal source localization can more adequately be accomplished with distributed source models. When the signal sources are distributed over an area, we cannot directly use well-known DOA estimation methods, because these methods are established based on the point source assumption. In this paper, we propose a 3-dimensional distributed signal source model, in which a source is represented by two parameters, the center angle and degree of dispersion. Then, we address the estimation of the elevation and azimuth angles of distributed sources based on the parametric distributed source modeling in the 3-dimensional space.

There are many kinds of transmission lines such as uniform, nonuniform and nonlinear ones terminated by linear and/or nonlinear subnetworks. The nonuniform transmission lines are crucial in integrated circuits and printed circuit boards, because these circuits have complex geometries and layout between the multi layers, and most of the transmission lines possess nonuniform characteristics. On the other hand, the nonlinear transmission line have been focused in the fields of communication and instrumentation. Here, we present a new numerical method for analyzing nonuniform and nonlinear transmission lines with linear and/or nonlinear terminations. The waveforms at any points along the lines are described by the Fourier expansions. The partial differential equations representing the circuit are transformed into a set of ordinary differential equations at each frequency component, where for nonlinear transmission line, the perturbation technique is applied. The method is efficiently applied to weakly nonlinear transmission line. The nonuniform transmission lines terminated by a nonlinear subnetwork are analyzed by hybrid frequency-domain method. The stability for stiff circuit is improved by introducing compensation element. The efficiency of our method is illustrated by some examples.

The reverse link performance of coherent multicode DS-CDMA [4], [5] under multipath Rayleigh fading environments is evaluated by computer simulation. It is demonstrated that the combined use of pilot symbol assisted (PSA)-coherent RAKE, channel coding, antenna diversity, and transmit power control is powerful in lowering the required signal energy per information bit-to-interference plus additive white Gaussian nose (AWGN) power spectrum density ratio (Eb/Io) which is an important parameter in determining the link capacity. It is also demonstrated that with slight performance degradation, high rate data transmission is realized by using multiple orthogonal spreading codes in parallel (orthogonal multicode transmission). Based on the simulated link performance, the reverse link cell capacity and link budget are also evaluated. It is found that parameter η=Io/No plays an important role in controlling the cell capacity and the maximum allowable path loss, where No is the AWGN power spectrum density.

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.

Personal communication systems (PCS) have more signalling traffic than conventional fixed networks and require large-scale databases to manage users' profiles, which are sets of data items, such as the location the user is currently visiting and the user's authentication key, necessary for a PCS user to be provided with PCS services. This paper focuses on inter-network roaming in PCS environments. In designing a PCS supporting roaming service, it is essential to avoid increased signalling traffic and data searching time in the database. We first identify the appropriate domains for three routing schemes-Direction Routing, Redirection Routing, and Look-ahead Routing-from the viewpoints of the number of signals for inter-network roaming and roaming probability. We do this for two kinds of PCS database network architecture, Home Location Register (HLR) and Visitor Location Register (VLR), and show that Look-ahead Routing is the best scheme for the HLR network architecture (considering the number of signals for intra-network and inter-network database access) and that in the VLR network architecture, the decreasing of the roaming probability expands domains for which Redirection Routing is appropriate. We also propose a generic PCS data model that inter-network roaming interfaces can use to search effectively for a user's profile. The data model clarifies the contents of a set of data items which share certain characteristics, data items that the contents compose, and the relationships (data structures) between sets of data items. The model is based on the X. 500 series recommendations, which are applied for an Intelligent Network. We also propose a data structure between sets of data items using the directory information tree and show the ASN. 1 notations of the data model.

Regenerative Pass-transistor Logic (RPL), a modular dual-rail circuit technique for high speed logic design that gives reasonably low power consumption, was developed. The technique can be applied to basic logic gates, full adders, multiplier units, and more complicated arithmetic logics like Conditional Carry Select (CCS) circuit. The magnitude of propagation delay time of RPL is smaller than the conventional CPL(Complementary Pass-transistor Logic), or DPL (Double Pass-transistor Logic). Low power consumption can also be achieved by reduced number of transistors and metal interconnections. Simulation and layout data also proved that RPL is advantageous over existing dual-rail logics while considering speed, power consumption and layout area.

A pilot symbol-assisted coherent multistage interference canceller (PSA-COMSIC) using recursive channel estimation is proposed for DS-CDMA mobile radio cellular systems. In the proposed scheme, since the channel variation due to fading is recursively estimated at each interference canceling stage, the accuracy of channel estimation is successively improved. The bit error rate (BER) performances against average Eb/N0 (signal energy per bit-to-noise power spectral density ratio) and capacity in the isolated cell are investigated by computer simulations. The simulations demonstrate that the capacity using the PSA-COMSIC with recursive channel estimation is about 1.6 times higher than that of the conventional matched filter receiver with channel coding and bit-interleaving in the interference-limited environments.

Cutoff rate of overlapping multi-pulse pulse position modulation (OMPPM) is analyzed in the quantum-limited and the background noise cases. Our results suggest that the derived cutoff rate is higher than conventional one because of the infinite quantization at the demodulator and the definition of the erasure event in conventional analysis.