We report relations between invariant manifolds of saddle orbits (Lyapunov family) around a saddle-center equilibrium point and lowest periodic orbits on the two degree of freedom swing equation system. The system consists of two generators operating onto an infinite bus. In this system, a stable equilibrium point represents the normal operation state, and to understand its basin structure is important in connection with practical situations. The Lyapunov families appear under conservative conditions and their invariant manifolds constitute separatrices between trapped and divergent motions. These separatrices continuously deform and become basin boundaries, if changing the system to dissipative one, so that to investigate those manifolds is meaningful. While, in the field of two degree of freedom motions, systems with saddle loops to a saddle-center are well studied, and existence of transverse homoclinic structure of separatrix manifolds is reported. However our investigating system has no such loops. It is interesting what separatrix structure exists without trivial saddle loops. In this report, we focus on above invariant manifolds and lowest periodic orbits which are foliated for the Hamiltonian level.

We propose a new method to construct a four parameter family of quantum-mechanical point interactions in one dimension, which is known as all possible self-adjoint extensions of the symmetric operator T=-Δ C0(R \{0}). It is achieved in the small distance limit of equally spaced three neighboring Dirac's δ potentials. The strength for each δ is appropriately renormalized according to the distance and it diverges, in general, in the small distance limit. The validity of our method is ensured by numerical calculations. In general cases except for usual δ, the wave function discontinuity appears around the interaction and one can observe such a tendency even at a finite distance level.

We investigate bifurcations of burst oscillations with rectangular waveform observed in a modified Bonhöffer-van der Pol equation, which is considered as a circuit model for neurons of a feeding rhythm generator. In particular, we clarify a mechanism of properties in a one-parameter graph on the period of oscillations, showing a staircase with hysteresis jumps, by studying a successive bifurcation process including a chain of homoclinic bifurcations. The occurrence of homoclinic bifurcations is confirmed by using the linking number of limit cycles related with the stable manifold through an equilibrium.

This paper develops an algorithm based on the Modular Approach to solve singly constrained separable discrete optimization problems (Nonlinear Knapsack Problems). The Modular Approach uses fathoming and integration techniques repeatedly. The fathoming reduces the decision space of variables. The integration reduces the number of variables in the problem by combining several variables into one variable. Computational experiments for "hard" test problems with up to 1000 variables are provided. Each variable has up to 1000 integer values.

A typical user is concerned only with the quality of service of a network on an end-to-end basis. Therefore, how end-to-end requirements are mapped into the local switching node requirements and maximum network utilization is a function of network internal design. In this paper, we address the problem of QOS allocation. We derived an optimal QOS allocation policy and decided the maximum utilization bound in a deterministic traffic model. We adopted the worst case delay bound as the end-to-end and local QOS requirement. With (σ, ρ) traffic model, we derived a formula for delay bound and the number of connections. We found that with the delay bound as the QOS metric, there is a significant difference in the performance of allocation policies. We also developed an evaluation strategy to analyze allocation policies. The numerical results for two simple network topologies: tandem network model and uneven traffic load model, compare the equal allocation policy with the optimal allocation policy and show the correctness and efficiency of QOS allocation policy.

For the reduction of the jitter originated from the cell losses in ATM network when CBR traffic is transferred on AAL5, we propose that the receiver maintain a timer whose expiration time is proportional to the cell time of the source traffic plus the standard deviation of the 1-point CDV of the received ATM cells. Moreover, to enhance the granularity of the error or loss detection mechanism in the AAL5 PDUs, we also modified the AAL5 PDU trailer fields so that each cell comprising the AAL5 PDU has a sequence number field. The simulation results show that the peak-to-peak PDV of the AAL5 PDU by the proposed method is less than 69.4% to that by AAL5. Moreover, the AAL5 user receives the same or more error-free transport packets in the proposed algorithm than those in the ITU-T AAL5 for the same network simulation environment.

This paper proposes applications of a code-division multiplexing technique to VLSI systems free from interconnection problems. We employ a pseudo-random orthogonal m-sequence carrier as a multiplexable information carrier to achieve efficient data transmission. Using orthogonal property of m-sequences, we can multiplex several computational activities into a single circuit, and execute in parallel using multiplexed data transmission with reduced interconnection. Also, randomness of m-sequences offers the high tolerance to interference (jamming), and suppression of dynamic range of signals while maintaining a sufficient signal-to-noise ratio (SNR). We demonstrate application examples of multiplex computing circuits, neural networks, and spread-spectrum image processing to show the advantages.

A novel analog-computation system using quantum-dot spin glass is proposed. Analog computation is a processing method that solves a mathematical problem by applying an analogy of a physical system to the problem. A 2D array of quantum dots is constructed by mixing two-dot (antiferromagnetic interaction) and three-dot (ferromagnetic interaction) systems. The simulation results show that the array shows spin-glass-like behavior. We then mapped two combinatorial optimization problems onto the quantum-dot spin glasses, and found their optimal solutions. The results demonstrate that quantum-dot spin glass can perform analog computation and solve a complex mathematical problem.

Current computing systems are too slow for information processing because of the huge number of procedural steps required. A decrease in the number of calculation steps is essential for real-time information processing. We have developed two kinds of novel architectures for automatic elimination of redundant calculation steps. The first architecture employs the new digit-serial algorithm which eliminates redundant lower digit calculations according to the most-significant-digit-first (MSD-first) digit-serial calculation scheme. Basic components based on this architecture, which employ the redundant number system to limit carry propagation, have been developed. The MSD-first sequential vector quantization processor (VQP) is 3.7 times faster than ordinary digital systems as the result of eliminating redundant lower-bit calculation. The second architecture realizes a decrease in the number of complex calculation steps by excluding useless data before executing the complex calculations according to the characterized value of the data. About 90% of Manhattan-distance (MD) calculations in VQP are excluded by estimating the MD from the average distance.

The aim of this contribution is to take a further step in the study of the impact of chaos-based techniques on classical DS-CDMA systems. The problem addressed here is the sequence phase acquisition and tracking which is needed to synchronize the spreading and despreading sequences of each link. An acquisition mechanism is considered and analyzed in depth to identify analytical expressions of suitable system performance parameters, namely outage probability, link startup delay and expected time to service. Special chaotic maps are considered to show that the choice of spreading sequences can be optimized to accelerate and improve the spreading codes acquisition phase.

The current-voltage characteristics of a single electron transistor (SET) in the resonant transport mode are investigated. In the future when SET devices are applied to integrated electronics, the quantum effect will seriously modify their characteristics in ultra-small geometry. The current will be dominated by the resonant transport through narrow energy levels in the dot. The simple case of a two-level system is analyzed and the transport mechanism is clarified. The transport property at low temperatures (higher than the Kondo temperature) in the low tunneling rate limit is discussed, and a current map where current values are classified in the gate bias-drain bias plane is provided. It was shown that the dynamic aspect of electron flow seriously influences the current value.

In digital modulation for mobile radio telephone services frequency modulation with continuous phase with small modulation indices (MSK/GMSK) is sometimes used. Extension of the synchronization subsystems' pulling band in a coherent receiver and reducing synchronization delay is important for the mobile communication. At this moment there are only two possible synchronization schemes for the coherent MSK/GMSK receiver: Costas and de Buda's. This paper presents a new method (a possible alternative to both of them) where the frequency discriminator with decoupled carrier and bit synchronizing subsystem are combined to handle the task. For comparison, this paper also describes performances of the Costas carrier recovery scheme, which is widely employed for MSK/GMSK coherent demodulation. Discrimination and fluctuation characteristics for frequency, phase, and symbol delay synchronization subsystems are shown and the BER degradation from the conventional Costas scheme is calculated. This paper demonstrates with simulation results that the proposed scheme improves RF carrier acquisition performances, and at the same time, for large signal-to-noise ratios (SNR's) provides similar or better tracking performances than the Costas one. While limited to higher SNR ratios, the proposed synchronization scheme is suitable for many applications and can be implemented with simpler circuitry, well suited to integrated circuit implementation.

The concept of a schedulable region (SR) was introduced to characterize the capacity of a multiplexer and provide a separation between call-level and cell-level phenomena. In this paper, we present a framework and algorithm for real-time estimation of the schedulable region. A major problem associated with online estimation is that the objects of measurement are not fixed in the presence of call arrivals and departures. The invariance property is exploited to carry out measurements in the presence of call arrivals and departures. By virtue of it, the equivalent bandwidth could be defined on the condition of the number of each traffic class call in progress. Another important thing we consider here is that the search algorithm to estimate the effective bandwidth should be chosen depending on the arrival statistics and QOS constraints. The algorithms presented here have been implemented on an ATM switch.

This paper presents two competitive learning methods with the objective of avoiding the initial dependency of weight (reference) vectors. The first is termed the refractory and competitive learning algorithm. The algorithm has a refractory period: Once the cell has fired, a winner unit corresponding to the cell is not selected until a certain amount of time has passed. Thus, a specific unit does not become a winner in the early stage of processing. The second is termed the creative and competitive learning algorithm. The algorithm is presented as follows: First, only one output unit is prepared at the initial stage, and a weight vector according to the unit is updated under the competitive learning. Next, output units are created sequentially to a prespecified number based on the criterion of the partition error, and competitive learning is carried out until the ternimation condition is satisfied. Finally, we discuss algorithms which have little dependence on the initial values and compare them with the proposed algorithms. Experimental results are presented in order to show that the proposed methods are effective in the case of average distortion.

This paper presents an approach to the blind identification of multichannel communication systems by using partial knowledge of the channel. The received signal is first processed by a filter constructed by the known component of the channel and then a blind identification algorithm based on the second-order statistics is applied to the filtered signal. It is shown that, if the unknown component satisfies the identifiability condition, the channel can be identified even though the channel does not satisfy the identifiability condition. Simulation results are presented to show the performance of the proposed approach. A comparison to the existing approaches is also presented.

In some applications, such as the echo cancellation problem of satellite-linked communication channels, there occurs a problem of estimation of a long impulse response, which consists of a long flat delay and a short dispersive response region. In this paper, it is shown that the use of the adaptive algorithm based on the frequency domain sampling theorem enables efficient identification of the long impulse response. The use of the proposed technique can lead to the reduction of both the number of adaptive weights and the complexity of flat delay estimation.

The problem of transient scattering caused by abrupt extinction of a terminative conducting screen in a waveguide is considered. First, a boundary-value problem is formulated to describe the transient phenomena, the problem in which the boundary condition depends on time. Then, application of the Fourier transformation with respect to time derives a Wiener-Hopf-type equation, which is solved by a commonly known decomposition procedure. The transient fields are obtained through the deformation of the integration path for the inverse transformation and the results are represented in terms of the incomplete Lipschitz-Hankel integrals. Numerical examples showing typical transient phenomena are attached.

This paper proposes adaptive line enhancers with new coefficient update algorithms on the basis of least-square-error criteria. Adaptive algorithms by least-squares are known to converge faster than stochastic-gradient ones. However they have high computational complexity due to matrix inversion. To avoid matrix inversion the proposed algorithms adapt only one coefficient to detect one sinusoid. Both FIR and IIR types of adaptive algorithm are presented, and the techniques to reduce the influence of additive noise is described in this paper. The proposed adaptive line enhancers have simple structures and show excellent convergence characteristics. While the convergence of gradient-based algorithms largely depend on their stepsize parameters, the proposed ones are free from them.

WDM transmission experiments over cascaded sections of optical links including wavelength converting 2R-transponders have been carried out in a loop testbed. Using dispersion compensated links and simple direct modulated transponder lasers, up to 11 cascaded crossconnects and 1750 km trunk lines have been bridged with 2.5 Gbit/s NRZ signals. The limitations are given mainly due to the accumulated jitter as it is shown by numerical simulations. The results indicate, that 2R-transponders are a useful approach to a flexible WDM network design using bitrate-transparent wavelength conversion.

In this paper, we propose a new structure of blind equalizer and its cost function. The proposed cost function is a quadratic form and has the unique solution. In addition, the proposed scheme can employ iterative algorithms which achieve less computational complexity and can be easily realized in real time processing. In order to verify the effectiveness of the proposed schemes, several computer simulations including a 64-QAM signal equalization have been shown.