Frequency spectra of arc pulses in the gaseous phase arc of the surge are compared breaking Ag contacts with the inductive load less than 770µH.

In this paper, we consider the performance of QPSK systems using complex transversal filters with additional decision-feedback (DF) taps, in the presence of colored noise and single continuous wave (CW) interference. Both one-sided and two-sided transversal filters with DF are considered. The general analytic expressions for the optimum tap weights and minimum mean square errors are obtained. We calculate the output signal-to-noise ratio of the filters and compare the theoretical results with the computer simulated results. The relations between the spectrum of the colored noise as well as CW interference and the corresponding frequency response of the DF filters are considered. We also consider the transient behavior of the adaptive DF filters. It is shown that the DF filters can suppress not only CW interference but also colored noise and that the two-sided transversal filter with DF has best performance in the presence of the colored noise and CW interference, while the one-sided transversal filter with DF is preferred when the white Gaussian noise and CW interference are included in the system. It is also shown that the frequency response of the DF filters is changed according to the spectrum distribution of the colored noise and CW interference in order to suppress them more effectively. The simulated results are in good agreement with the theoretical results.

The concept of a contragredient mapping is introduced to analyze linear circuits. It enables us to apply Thévenis's theorem successively to each usual two-port with the simplest calculation.

A method of applying the fast Fourier transform (FFT) algorithm to Filon quadrature is presented. The quadrature formula can be reduced to a linear combination of two vectors to each of which the ordinary FFT algorithm is ready to be applied. An expression for the truncation error of Filon quadrature is then derived to examine the numerical errors of the formula. The experimental results showed that error terms of up to O(h⁷), where h is the length of subintervals for Filon numerical integration, are required to explain the numerical errors observed in the spectral analysis of the response of a single-pole system to a periodic rectangular wave.

This paper proves several theorems on probabilistic cryptosystems. From these theorems it follows directly that a probabilistic cryptosystem proposed by the authors, whose security is based upon the (supposed) infeasibility of γ^th-Residuosity Problem, is polynomially secure. Techniques developed in the paper are of independent interest.

The mode analysis of an open-boundary Cerenkov laser is developed in the collective regime. The Cerenkov laser under consideration is composed of a magnetically-confined relativistic electron beam and a dielectric-loaded conducting plane. The electron beam and the dielectric are assumed to be arbitrary in thickness, with an arbitrary spacing allowed between them. For the Cerenkov laser specified above, the following results are obtained. First, an electromagnetic wave mode is coupled with an infinite number of space charge wave modes. In the general case, an electromagnetic wave mode is coupled collectively with space charge wave modes. On the other hand, in the special case where the coupling occurs near the Cerenkov threshold, an electromagnetic wave mode is coupled separately with each of space change wave modes. Second, the characteristics of the growing wave for a magnetically-confined beam are similar to those for an ion-neutralized beam, except that the magnitude of the spatial growth rate becomes somewhat smaller for the former than for the latter.

Upon the close examination of some typical papers treating E-Plane Symmetrical T-junctions, we derive peculiar equivalent circuits of the T-junctions in terms of the direct sum representation of the three-port. We show that the circuit elements can be determined by use of the Weissfloch nodal-shift method and that the circuits give an unified description and some new physical meanings of Lewin's equivalent circuit. Allanson-Cooper-Cowling's one, and others. Then we also give an analytical derivation of the direct sum in terms of a system of integral equations rearranged in a hybrid matrix whose determinant is nearly equal to zero for a tee. This property of the hybrid matrix allows the number of independent parameters to be reduced by one in a good approximation. Further the stationary values of the variational equations equivalent to the integral equations straightforwardly give the circuits elements.

Recently, a real-time communication such as digitizing and packetizing voice, video, and fax has become one of the most important services in large computer networks. However, it is hard to support the real-time communication when a failure occurs in large networks. In this paper, management of a real-time large computer network is discussed concerning the link failure. A reliable cluster-based routing algorithm is proposed. The algorithm, which is an application of a cluster based network management, can keep the real-time communication in case of a link failure. By incorporating both the clusters and the multiple routing modes, the algorithm provides not only a short disconnecting time but also small communication overhead of recovery processing. These advantages of the algorithm are shown by the analysis of average message delay based on Kleinrock's model.

A new photometric method, which can reconstruct 3-D space coordinate (i.e.Z-distribution) of an object from one image under a point light source illumination, is proposed. The object is continuous convex with the perfectly diffused surface and the known uniform reflectance. To get the Z-distribution by solving the illuminating equation basing on the inverse square law for illuminance, an iterative algorithm has been developed. The tangent plane of the brightest surface element is firstly determined. The objective Z-distribution is finally obtained by iterating processes of calculating the Z-distribution treating the gradient distribution as constant. At each iteration step, the Z-distribution for the next step is determined from the present Z-distribution and the calculated Z-distribution which satisfies the illuminating equation, and the gradient distribution for the next step is calculated geometrically from the determined Z-distribution basing on the continuity of the surface. The usefulness of this method has been demonstrated by computer simulations.

Global stability of equilibrium states is investigated for a continuous-time model of neural networks and a discrete-time one. Three classes of globally stable networks are introduced. One class called weakly coupled networks is shown to be globally asymptotically stable, i.e. every trajectory eventually converges to a unique equilibrium point. The other two classes of which one is called gradient networks and the other is called type K monotone networks are guaranteed to be completely stable, i.e. any trajectory eventually converges to one of equilibrium states. These stability properties are preserved under introduction of any synaptic transmission delay. In addition monotone sensitivity is discussed for weakly coupled cooperative networks and type K monotone networks.