We have experimentally observed chaotic oscillation of outputs in a diode-pumped Nd:YAG microchip laser array with an external Talbot mirror. The oscillation of chaotic output is observed at frequencies of sub MHz corresponding to the relaxation oscillation frequencies when the Talbot mirror is slightly tilted from the perfect alignment position with the internal cavity. Chaotic intermittent bursts also appear at frequencies of sub kHz due to longitudinal mode hopping. Synchronization of chaos is observed at these two different time scales. The generation of chaotic oscillations at sub MHz is confirmed by using numerical simulations. It is found that synchronized chaotic oscillations can be observed in the vicinity of the boundary of the injection locking range.

There are so many methods of calculating the cylindrical function Zν(x), but it seems that there is no method of calculating Zν(x) in the region of νx and |ν|»1 with high accuracy. The asymptotic series presented by Watson, et al. are frequently used for the numerical calculation of cylindrical function Zν(x) where νx and |ν|»1. However, the function Bm(εx) included in the m'th term of the asymptotic series is known only for m5. Hence, the asymptotic series can not give sufficiently accurate values of the cylindrical functions. The authors attempt to develop programs for the numerical calculation of the cylindrical functions using this asymptotic series. For this purpose, we must know the function Bm(εx) of arbitrary m. We developed a method of calculating Bm(εx) for arbitrary m, and then succeeded in calculating the cylindrical functions in the region νx with high precision.

A positive integer code EXEb,h,d(b1, h1,d0) is proposed. Its codeword for a positive integer n consists of three kinds of information: (1) how many times the number of n's digits can be subtracted by the terms of a progression including a geometric progression, (2) the rest of the subtractions, and (3) given value of the positive integer n. EXEb,h,d is a non-recursive type code. It is an asymptotically optimal code (for d1) and preserves the lexicographic,length, and number orders (for bh+2). Some examples of EXEb,h,d are also presented. Their codeword lengths are found to be shorter than the Amemiya and Yamamoto code CEk except for small positive integers.

In this paper we show that the neuron filter is effective for relaxing the coefficient sensitiveness of the Hopfield neural network for combinatorial optimization problems. Since the parameters in motion equation have a significant influence on the performance of the neural network, many studies have been carried out to support determining the value of the parameters. However, not a few researchers have determined the value of the parameters experimentally yet. We show that the use of the neuron filter is effective for the parameter tuning, particularly for determining their values experimentally through simulations.

This paper has a dual purpose. First, it proposes a virtual path management model for ATM networks. The model unifies VPC overlay network configuration, VCC routing, and capacity allocation in a single framework. It accommodates multiple end-to-end offered traffics of various QoS requirements and traffic types. Especially, it also supports point-to-multipoint as well as point-to-point connections in a resource-efficient manner. The objective is to minimize the overall network resource cost. To do so, it pursues an optimal trade-off among the gains offered by ATM technology. The application of the proposed model is naturally extended to the multiprotocol label switching framework. Second, it proposes an efficient algorithm to solve the model. The mathematical formulation of such a unifying model typically involves a very large-scale intractable optimization which, treated by a straightforward method, requires excessive computational efforts. In this paper, we show how the computational structure of formulation can be exploited to tailor a solution method providing good solutions in dramatically reduced computational efforts.

This paper proposes a hardware configuration using only single pole dual throw (SPDT) switches to realize the previously proposed automatic calibration method using transmitting signals (ACT) for the adaptive array in TDD communication systems. The proposed configuration obtains the same calibration values as the conventional ACT does while reducing the number of switch branches. The transmission pattern using the proposed calibration method is also presented based on an experimental adaptive array testbed in an actual microcell environment. The experimental results show that the ideal radiation pattern formation is achieved by employing the proposed calibration method in an environment with a moving terminal station and where arriving co-channel interference exists.

In this paper, we are concerned in obtaining multicast trees in packet-switched networks such as ATM nets, when there exist constraints on the packet (cell)-replication capabilities of the individual switching nodes. This problem can be formulated as the Steiner tree problem with degree bounds on the nodes, so we call it the Degree-Constrained Steiner Tree problem (DCST). Four heuristic algorithms are proposed: the first is a combined version of two well-known Steiner tree algorithms, heuristic Naive and the shortest path heuristic (SPH), and the second is a relaxation algorithm based on a mathematical formulation of the DCST, and the last two use a tree reconfiguration scheme based on the concept of 'logical link. ' We experimentally compare our algorithms with the previous ones in three respects; number of solved instances, objective value or tree cost, and computation time. The experimental results show that there are few instances unsolved by our algorithms, and the objective values are mostly within 5% of optimal. Computation times are also acceptable.

An analytic equation was derived for the time jitter of digital NRZ signals due to inter-symbol interference in the PCB transmission lines loaded by DRAM chips which are located in uniform spacing. The inter-symbol interference is caused by a low-pass filtering effect of the loaded transmission line. Good agreements were observed between the equation and measurements with an average error of 17.5%.

Software defined radio (SDR) is receiving much attention as the key technology to realize the next generation wireless communication system. This paper proposes the concept of system diversity on SDR and investigates the effectiveness of system diversity by using a concrete simulation model. System diversity allows the wireless communication system being used to be dynamically changed in addition to the signal processing algorithm or modulation/coding scheme being used. To clarify the validity of system diversity, we examine a system simulation model consisting of three wireless communication systems; algorithms are introduced to show how system diversity can be controlled using the QoS parameters of received signal level, data transmission rate, and channel capacity. The process by which system diversity switching is triggered is elucidated, and a practical example is introduced. Simulation results confirm that system diversity offers higher performance in terms of data throughput and system channel capacity than existing wireless communication systems. Finally, a comprehensive algorithm is described that protects existing single-mode traffic from being degraded by SDR switching.

The present paper describes the finite difference time domain (FDTD) analysis of the light-beam diffraction from two- and three-dimensional (2-D and 3-D) magneto-optical (MO) disk structures. First, we show that the proposed new FDTD formulation is valid for MO disk medium and can avoid the divergence of fields encountered during the conventional FDTD calculations. Second, as the application of the present method to more complicated models, the main- and cross-polarized diffracted fields are numerically calculated for 2-D and 3-D four-layered MO disk models. The phase differences between two kinds of polarized components are shown. The results obtained here indicate that the proposed FDTD formulation can be applied to more complicated MO disk structures.

We show some results concerning the number of solutions of the equation y+Ax=b (yTx=0, y0, x0) which plays a central role in the dc analysis of transistor circuits. In particular, we give sufficient conditions for the equation to possess exactly 2l (ln) solutions, where n is the dimension of the vector x.

In this paper, a simple chaotic circuit using two RC phase shift oscillators and a diode is proposed and analyzed. By using a simpler model of the original circuit, the mechanism of generating chaos is explained and the exact solutions are derived. The exact expression of the Poincare map and its Jacobian matrix make it possible to confirm the generation of chaos using the Lyapunov exponents and to investigate the related bifurcation phenomena.

This paper is concerned with the controller synthesis for feedback systems with saturation based on the LPV system representation. The LPV system representation, combined with use of the detailed structure of saturation nonlinearity, enables us to reduce the conservativeness. In this paper, we develop a new iterative algorithm for designing a linear time-invariant controller which locally stabilizes the nonlinear closed-loop system and achieves the prescribed quadratic control performance. The present design method provides an explicit expression for a guaranteed domain of attraction, and maximizes the estimated region of the plant states for which the stability and the prescribed quadratic performance are satisfied. A numerical example shows the effectiveness of the present design method.

In this paper, we give an algorithm for the node-to-set disjoint paths problem in rotator graphs with its evaluation results. The algorithm is based on recursion and it is divided into cases according to the distribution of destination nodes in classes into which all the nodes in a rotator graph are categorized. The sum of the length of paths obtained and the time complexity of the algorithm are estimated and verified by computer simulation.

In this paper, we propose new approaches to speech enhancement based on soft decision. In order to enhance the statistical reliability in estimating speech activity, we introduce the concept of a global speech absence probability (GSAP). First, we compute the conventional speech absence probability (SAP) and then modify it according to the newly proposed GSAP. The modification is made in such a way that the SAP has the same value of GSAP in the case of speech absence while it is maintained to its original value when the speech is present. Moreover, for improving the performance of the SAP's at voice tails (transition periods from speech to silence), we revise the SAP's using a hang-over scheme based on the hidden Markov model (HMM). In addition, we suggest a robust noise update algorithm in which the noise power is estimated not only in the periods of speech absence but also during speech activity based on soft decision. Also, for improving the SAP determination and noise update routines, we present a new signal to noise ratio (SNR) concept which is called the predicted SNR in this paper. Moreover, we demonstrate that the discrete cosine transform (DCT) enhances the accuracy of the SAP estimation. A number of tests show that the proposed method which is called the speech enhancement based on soft decision (SESD) algorithm yields better performance than the conventional approaches.

The analysis of the radiating properties of a multilayer structure where chirality is introduced is here addressed. Both the effects on the resonant behaviour and on the radiation patterns have been considered for different multilayer structures. The adopted procedure is full wave and leads to the numerical analysis performed via the Methods of Moment in the spectral domain.

Network caches reduce network traffic as well as user response time. When implementing network caches, the object replacement problem is one of the core problems; The problem is to determine which objects should be evicted from a cache when there is insufficient space. This paper first formalizes the problem and gives a simple but sufficient condition for deterministic online algorithms to be competitive. Based on the condition, a general framework to make a non-competitive algorithm competitive is constructed. As an application of the framework, an online algorithm, called Competitive_SIZE, is proposed. Both event-driven and trace-driven simulations show that Competitive_SIZE is better than previously proposed algorithms such as LRU (Least Recently Used).

Multi-domain spoken dialogue systems with high degree of intelligence and domain extensibility have long been desired but difficult to achieve. When the user freely surfs among different topics during the dialogue, it will be very difficult for the system to control the switching of the topics and domains while keeping the dialogue consistent, and decide when and how to take the initiative. This paper presents a distributed agent architecture for multi-domain spoken dialogue systems with high domain extensibility and intelligence. Under this architecture, different spoken dialogue agents (SDA's) handling different domains can be developed independently, and then smoothly cooperate with one another to achieve the user's multiple goals, while a user interface agent (UIA) can access the correct spoken dialogue agent through a domain switching protocol, and carry over the dialogue state and history so as to keep the knowledge processed coherently across different domains.

In this paper we consider a tensor-based approach to the analytical computation of higher-order expectations of quantized trajectories generated by Piecewise Affine Markov (PWAM) maps. We formally derive closed-form expressions for expectations of trajectories generated by three families of maps, referred to as (n,t)-tailed shifts, (n,t)-broken identities and (n,t,π)-mixing permutations. These families produce expectations with asymptotic exponential decay whose detailed profile is controlled by map design. In the (n,t)-tailed shift case expectations are alternating in sign, in the (n,t)-broken identity case they are constant in sign, and the (n,t,π)-mixing permutation case they follow a dumped periodic trend.

This paper introduces a switched-voltage delay cell with differential inputs. It can be used as a building block for a range of analogue functions such as voltage-to-frenquency converter, A/D converter, etc. Applications incorporating the delay cell are presented. The performances are verified by simulations on PSpice.