Modulo-2 addition (or exclusive-OR) is one of fundamental operations for binary variables. In this paper, we discuss statistical properties of sequences obtained by modulo-2 addition of two binary sequences. Firstly, we theoretically evaluate statistics of sequences obtained by modulo-2 addition of two general binary random variables. Secondly, we consider statistics of modulo-2 added chaotic binary sequences generated by a class of one-dimensional chaotic maps. Furthermore, we consider synthesis of an aperiodic binary sequence and a periodic one by modulo-2 addition with the purpose of generating aperiodic sequences with good statistical properties. We also perform computer experiments about such sequences.

Let us introduce n ( 2) nonlinear mappings fi (i = 1,2,,n) defined on complete linear metric spaces (Xi-1,ρ) (i = 1,2,,n), respectively, and let fi:Xi-1 Xi be completely continuous on bounded convex closed subsets Xi-1, (i = 1,2,,n 0), such that fi() . Moreover, let us introduce n fuzzy-set-valued nonlinear mappings Fi:Xi-1Xi {a family of all non-empty closed compact fuzzy subsets of Xi}. Here, by introducing arbitrary constant βi (0,1], for every integer i (i = 1,2,,n 0), separately, we have a fixed point theorem on the recurrent system of βi -level fuzzy-set-valued mapping equations: xi Fiβi(xi-1, fi(xi-1)), (i = 1,2,,n 0), where the fuzzy set Fi is characterized by a membership function µFi(xi):Xi [0,1], and the βi -level set Fiβi of the fuzzy set Fi is defined as Fiβi {ξi Xi |µFi (ξi) βi}, for any constant βi (0,1]. This theorem can be applied immediately to discussion for characteristics of ring nonlinear network systems disturbed by undesirable uncertain fluctuations and to extremely fine estimation of available behaviors of those disturbed systems. In this paper, its mathematical situation and proof are discussed, in detail.

This paper discusses stability boundaries in an electric power system with dc transmission based on a differential-algebraic equation (DAE) system. The DAE system is derived to analyze transient stability of the ac/dc power system: the differential equation represents the dynamics of the generator and the dc transmission, and the algebraic equation the active and reactive power relationship between the ac system and the dc transmission. In this paper complete characterization of stability boundaries of stable equilibrium points in the DAE system is derived based on an energy function for the associated singularly perturbed (SP) system. The obtained result completely describes global structures of the stability boundaries in solution space of the DAE system. In addition the characterization is confirmed via several numerical results with a stability boundary.

Learning algorithms for Vector Quantization (VQ) are categorized into two types: batch learning and incremental learning. Incremental learning is more useful than batch learning, because, unlike batch learning, incremental learning can be performed either on-line or off-line. In this paper, we develop effective incremental learning methods by using Stochastic Relaxation (SR) techniques, which have been developed for batch learning. It has been shown that, for batch learning, the SR techniques can provide good global optimization without greatly increasing the computational cost. We empirically investigates the effective implementation of SR for incremental learning. Specifically, we consider five types of SR methods: ISR1, ISR2, ISR3, WSR1 and WSR2. ISRs and WSRs add noise input and weight vectors, respectively. The difference among them is when the perturbed input or weight vectors are used in learning. These SR methods are applied to three types of incremental learning: K-means, Neural-Gas (NG) and Kohonen's Self-Organizing Mapping (SOM). We evaluate comprehensively these combinations in terms of accuracy and computation time. Our simulation results show that K-means with ISR3 is the most comprehensively effective among these combinations and is superior to the conventional NG method known as an excellent method.

Novel high-frequency asymptotic solutions for the scattered fields by a dielectric circular cylinder with a radius of curvature sufficiently larger than the wavelength are presented in this paper. We shall derive the modified UTD (uniform Geometrical Theory of Diffraction) solution, which is applicable in the transition regions near the geometrical boundaries produced by the incident ray on the dielectric cylinder from the tangential direction. Also derived are the uniform geometrical ray solutions applicable near the geometrical boundaries and near the caustics produced by the ray family reflected on the internal concave boundary of the dielectric cylinder. The validity and the utility of the uniform solutions are confirmed by comparing with the exact solution obtained from the eigenfuction expansion.

In this paper, we present the interlaced fast Fourier transform (FFT) method to parallelize the adaptive integral method (AIM) algorithm for the radar cross-section (RCS) computation of large scattering objects in free space. It is noted that the function obtained after convolution is smoother as compared to the original functions. Utilizing this concept, it is possible to interlace the grid current and charge sources in AIM and compute the potentials on each set of interlaced grid independently using FFT. Since the potentials on each interlaced grid are smooth functions in space, we can then interpolate the potentials to every other nodes on the original grid. The final solution of the potentials on the original grid is obtained by summing the total contributions of all the computed and interpolated potentials from every individual interlaced grid. Since the potentials of each interlaced grid can be computed independently without much communication overheads between the processes, such an algorithm is suitable for parallelizing the AIM solver to run on distributed parallel computer clusters. It is shown that the overall computation complexity of the newly proposed interlaced FFT scheme is still of O(N log N).

High frequency (HF) diffraction is known as local phenomena, and only parts of the scatterer contribute to the field such as the edge, corner and specular reflection point etc. Many HF diffraction techniques such as Geometrical Theory of Diffraction (GTD), Uniform Theory of Diffraction (UTD) and Physical Theory of Diffraction (PTD) utilize these assumptions explicitly. Physical Optics (PO), on the other hand, expresses the diffraction in terms of radiation integral or the sum total of contributions from all the illuminated parts of scatterers, while the PO currents are locally defined at the point of integration. This paper presents PO-based visualization of the scattering and diffraction phenomena and tries to provide the intuitive understanding of local property of HF diffraction as well as the relations between PO and the ray techniques such as GTD, UTD etc. A weighting named "eye function" is introduced in PO radiation integrals to take into account of local cancellation between rapidly oscillating contributions from adjacent currents; this extracts important areas of current distribution, whose location moves not only with the source but also with the observation point. PO visualization illustrates both local property of HF scattering and defects associated with ray techniques. Furthermore, careful examination of visualized image reminds us of the error factor in PO as applied for curved surfaces, named fictitious penetrating rays. They have been scarcely recognized if not for visualization, though they disturb the geometrical shadow behind the opaque scatterer and can be the leading error factors of PO in shadow regions. Finally, visualization is extended to slot antennas with finite ground planes by hybrid use of modified edge representation (MER) to assess the significance of edge diffraction.

In this paper, the magnetic field properties around household appliances are investigated with the single coil model and equivalent source model, which are used as main source models in the European standard EN50366 (CENELEC). The accuracy of the field properties is conducted for the coil model (defined in the EN50366), by comparing with the results of the equivalent source model, which allow the reproduction of the complicated inhomogeneous magnetic field around the appliance with full generality (i.e. supports three dimensional vector fields).

In wireless environment, TCP suffers from significant performance degradation due to bit errors on wireless link and handovers because it responds to all packet losses by invoking congestion control even though packet losses are not related to congestion. Several schemes have been proposed to improve the performance degradation due to each cause. They have been evaluated in a specific network environment where either bit errors or handover occurs, i.e. they do not occur at the same time. In this paper, we reveal the packet recovery mismatch problem in an environment where both of bit errors and handover can cause the performance degradation. We pick up one scenario that TCP traffic is transmitted in the situation that ARQ (Automatic Repeat reQuest) and packet forwarding are implemented together. They are proposed to reduce the influence of bit errors and handover respectively and are natural approaches from the viewpoint of protocol layering. Computer simulation shows that in that scenario both techniques cannot perform efficiently due to interaction of each other. We also propose two buffer control approaches to resolve the packet recovery mismatch problem in our scenario according to applicability of cross-layer operation between layer 2 and layer 3.

With the explosive growth of the Internet system, demands for broadband communication networks have rapidly increased to provide high quality network services. For this purpose, the IEEE 802.6 MAC standard protocol defines the distributed-queue dual bus (DQDB) for metropolitan area networks (MANs). The isochronous channel reuse problem (ICRP) has been studied for efficient use of DQDB by finding proper channel assignments to incoming connection requests. In this paper, we first define the generalized isochronous channel reuse problem (GICRP) as a generalization of ICRP, to afford demands of simultaneously satisfying plural connection requests such as for multicast applications, where certain sets of connection requests must be assigned channels simultaneously. We prove the NP-completeness of its decision problem. Then, we propose a minimum dead space (MDS) algorithm as a heuristic approach to GICRP. The extensive simulation results show that with shorter computation time, our MDS algorithm can always find better channel assignments reducing the waiting time for packet transmissions than the best existing algorithm for conventional ICRP.

Plastic ferrules for single-mode (SM) MU-type simplified receptacles are fabricated with a precise injection-molding technique using a liquid crystalline polymer (LCP). The fabricated plastic ferrules exhibit an eccentricity of < 0.6 µm and outer diameter variation of 1 µm. MU-type simplified plugs incorporating the plastic ferrules have an average insertion loss of 0.13 dB and a return loss of > 46 dB. The plastic ferrules exhibit good resistance in 500-cycle mating tests, and in vibration and impact tests as well. The initial optical characteristics are maintained during a temperature and humidity cycling test and a heat-cycling test.

In uplink multicarrier code division multiple access (MC-CDMA), the inter-code interference (ICI) caused by the independent and frequency-selective fading channel of each user and the inter-carrier interference caused by the asynchronous reception of each user's OFDM symbols result in multiple access interference (MAI). This paper evaluates the ICI in frequency-selective Rayleigh fading channels for uplink MC-CDMA. We derive theoretical expressions for the desired-to-undesired signal power ratio (DUR) as a quantitative representation of ICI, and validate them by comparison with computer simulations using a Walsh-Hadamard (WH) code. Based on the analytical results, we obtain the optimum spreading sequence that minimizes the ICI (in short, maximizes the multiplexing performance); this sequence appears to be orthogonal. Three equalization combining methods are examined; equal gain combining (EGC), orthogonality restoring combining (ORC), and maximum ratio combining (MRC).

In this paper, we propose a design method of filters by successive projection (SP) method using multiple extreme frequency points based on Fritz John's theorem. In conventional SP method, only one extreme frequency point at which the deviation from the given specification is maximized is used in the update of the filter coefficients. Therefore, enormous amount of iteration numbers are necessary for research the solution which satisfies the given specification. In the proposed method, the updating coefficient using multiple extreme frequency points is possible by Fritz John's theorem. As a result, the solution converges less iteration number than the conventional SP method.

This paper proposes a learning classifier based on Support Vector Domain Description (SVDD) for two-class problem. First, by the description of the training samples from one class, a sphere boundary containing these samples is obtained; then, this boundary is used to classify the test samples. In addition, instead of the traditional quadratic programming, multiplicative updates is used to solve the Lagrange multiplier in optimizing the solution of the sphere boundary. The experiment on CBCL face database illustrates the effectiveness of this learning algorithm in comparison with Support Vector Machine (SVM) and Sequential Minimal Optimization (SMO).

The issue of guaranteeing Quality of Services (QoS) in a network has emerged in recent years. The Proportional Delay Differentiated Model has been presented to provide the predictable and controllable queueing delay differentiation for different classes of connections. However, most related works have focused on providing this model for a wired network. This study proposes a novel scheduler to provide proportional delay differentiation in a wireless network that includes a multi-state link. This scheduler, Look-ahead Waiting-Time Priority (LWTP), offers proportional delay differentiation and a low queueing delay, by adapting to the location-dependent capacity of the wireless link and solving the head-of-line (HOL) blocking problem. The simulation results demonstrate that the LWTP scheduler actually achieves delay ratios much closer to the target delay proportion between classes and yields smaller queueing delays than past schedulers.

Common-mode (CM) current on a feed cable attached to printed circuit board (PCB), which is one of main source of undesired electromagnetic radiation problem, is investigated by experimental and finite-difference time-domain (FDTD) modeling. In this paper, frequency responses of CM current on PCB and feed cable are modeled and analyzed as an electromagnetic interference (EMI) antenna, which depends on the configuration of PCB with a wire cable. Several different configurations are prepared to demonstrate the effect of PCB dimension on resonance frequencies of CM current. In the results, EMI antenna in the frequency band around the first resonance frequency was comprised of the ground plane and cable. In order to explain the frequency response of CM current, two EMI antenna models are proposed and demonstrated. EMI antenna is comprised of the ground plane and cable, and the other EMI antenna is comprised of the trace on the ground plane. It is suggested that the result is one of basic consideration for the ground plane with cable that have high EMI problem and resonance frequency of CM current.

The conventional algorithms in the echo canceling system have drawback when they are faced with double-talk condition in noisy environment. Since the double-talk and noise signal are exist, then the error signal is contaminated to estimate the gradient correctly. In this paper, we define a new class of adaptive algorithm for tap adaptations, based on the correlation function processing. The computer simulation results show that the Correlation LMS (CLMS) and the Extended CLMS (ECLMS) algorithms have better performance than conventional LMS algorithm. In order to implement the ECLMS algorithm, the Frequency domain Extended CLMS (FECLMS) algorithm is proposed to reduce the computational complexity. However the convergence speed is not sufficient. In order to improve the convergence speed, the Wavelet domain Extended CLMS (WECLMS) algorithm is proposed. The computer simulation results support the theoretical findings and verify the robustness of the proposed WECLMS algorithm in the double-talk situation.

This paper discusses the orbital motion and elevation properties of a quasi-zenith satellite system using circular orbits. The satellites are deployed on inclined geosynchronous orbits with identical sub-satellite loci on earth. The satellites trace the locus at even intervals. This satellite system can provide mobile satellite communications and navigation services at very high elevations to middle-latitude regions. In general, the orbital parameters of the satellite system are determined by numerical simulation to maximize the minimum elevation angle in areas where satellite services are to be provided. However, an understanding of the properties of the orbit and consequent elevation properties are important for efficient constellation design. This paper formulates the orbital motion of inclined geosynchronous circular orbits, including the relative motion to the rotating earth. Although elliptical orbit constellations are also possible and can gain higher elevation, only circular orbits, which can be accurately formulated without using an analytically unsolvable Kepler's equation, are discussed in this paper. Elevation properties are evaluated using the geocentric angle between the sub-satellite point and an arbitrary point in the intended service area. This angle is a typical parameter that can be derived as a single-valued function of the elevation at a specific point. Optimum orbital parameters for an intended service area can be easily estimated without numerical simulation using the results of the evaluation described in this paper. These results can also be used to infer whether a circular-orbit constellation is applicable to an intended service area.

Arrival of the packet data is acknowledged by detecting the preambles of the received bursty packets. To increase system throughput and reduce transmission latency, a simple and robust signal detection algorithm is required. Furthermore, the threshold for signal detection must be set adaptively for different channel conditions. In this paper, we design and compare three signal detection algorithms for bursty packet systems.

By modelling the quantization error as additive white noise in the transform domain, Wiener filter is used to reduce quantization noise for DCT coded images in DCT domain. Instead of deriving the spectrum of the transform coefficient, a DPCM loop is used to whiten the quantized DCT coefficients. The DPCM loop predicts the mean for each coefficient. By subtracting the mean, the quantized DCT coefficient is converted into the sum of prediction error and quantization noise. After the DPCM loop, the prediction error can be assumed uncorrelated to make the design of the subsequent Wiener filter easy. The Wiener filter is applied to remove the quantization noise to restore the prediction error. The original coefficient is reconstructed by adding the DPCM predicted mean with the restored prediction error. To increase the prediction accuracy, the decimated DCT coefficients in each subband are interpolated from the overlapped blocks.