A new blind restoration method applying Real-coded genetic algorithm (RcGA) will be proposed, and this method will be proven valid for the blurred image restoration with unidentified degradation in the experiments. In this restoration method, the degraded and blurred image is going to get restricted to the images possible to be expressed in the point spread function (PSF), then the restoration filter for this degraded image, which is also the 2-dimentional inverse filter, will be searched among several points applying RcGA. The method will enable to seek efficiently among vast solution space consists of numeral coefficient filters. And perceiving the essential features of the spectrum in the frequency space, an evaluation function will be proposed. Also, it will be proposed to apply the Rolling-ball transform succeeding an appropriate Gaussian degrade function against the dual degraded image with blur convoluting impulse noise. By above stated features of this restoration method, it will enable to restore the degraded image closer to the original within a practical processing time. Computer simulations verify this method for image restoration problem when the factors causing image distortions are not identified.

Since any suggestion to regional services are not described in Kerberos, authentication between regions can be performed via PKINIT (Public Key Cryptography for Initial Authentication) presented by IETF (Internet Engineering Task Force) CAT working group. In this paper, an efficient Kerberos authentication mechanism associated with X.509 and Domain Name system (DNS) is presented by employing the two distinct key management systems - asymmetric and symmetric methods. A new protocol is better than the authentication mechanism proposed by IETF CAT Working group in terms of communication complexity.

The Belousov-Zhabotinsky (BZ) reaction provides us important clues in controlling 2D phase-lagged stable synchronous patterns in an excitable medium. Because of the difficulty in computing reaction-diffusion systems in large systems using conventional digital processors, we here propose a cellular-automaton (CA) circuit that emulates the BZ reaction. In the circuit, a two-dimensional array of parallel processing cells is responsible for fast emulation, and its operation rate is independent of the system size. The operations of the proposed CA circuit were demonstrated by using a simulation program with integrated circuit emphasis (SPICE).

Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is the inability to deforest programs using accumulating parameters. We show how certain kinds of intermediate lists produced by accumulating parameters can be deforested. In this paper we introduce an accumulative variant of foldr, called rdlof, and show the composition of functions defined by foldr and rdlof. As a simplified instance of foldr and rdlof, we then examine dmap, an accumulative extension of map, and give the corresponding fusion rules. While the associated composition rules cannot capture all deforestation problems, they can handle accumulator fusion of fold- and map-style functions in a simple manner. The rules for accumulator fusion presented here can also be viewed as a restricted composition scheme for attribute grammars, which in turn may help us to bridge the gap between the attribute and functional worlds.

In this letter, we introduce a two-state turbo-TCM scheme based on the concatenated tree codes. The proposed scheme can achieve near capacity performance yet has considerably lower decoding complexity compared with other existing turbo-TCM codes.

There are several attempts to generate chaotic binary sequences by using one-dimensional maps. From the standpoint of engineering applications, it is necessary to evaluate statistical properties of sample sequences of finite length. In this paper we attempt to evaluate the statistics of chaotic binary sequences of finite length. The large deviation theory for dynamical systems is useful for investigating this problem.

In loudspeaker-based 3D audio systems, there are some acoustic crosstalk cancellation methods to enlarge the 'sweet spot' around a fixed listener position. However, these methods have common defect that most of them can be applied only to the specific narrow frequency band. In this letter, we propose the more robust acoustic crosstalk cancellation method so that we can cancel the crosstalk signal in far wider frequency band and enlarge 'sweet spot. ' For this goal, we apply a sum and difference filter to the conventional three loudspeaker-based 3D audio system.

This paper investigates the behavior of one-dimensional discrete-time binary cellular neural networks with both the A- and B-templates and gives the necessary and sufficient conditions for the above network to be stable for unspecified fixed boundaries.

Cellular Neural Networks (CNNs) have been developed as a high-speed parallel signal-processing platform. In this paper, a generalized two-layer cellular neural network model is proposed for image processing, in which two templates are introduced between the two layers. We found from the simulations that the two-layer CNNs efficiently behave compared to the single-layer CNNs for the many applications of image processing. For examples, simulation problems such as linearly non-separable task--logic XOR, center point detection and object separation, etc. can be efficiently solved with the two-layer CNNs. The stability problems of the two-layer CNNs with symmetric and/or special coupling templates are also discussed based on the Lyapunov function technique. Its equilibrium points are found from the trajectories in a phase plane, whose results agree with those from simulations.

A DS-CDMA mobile communication system accommodating multi-class users is considered. The number of supportable users depends on the distributions of data rate and required communication quality among users. Simple expressions for the reverse link capacity with transmit power control, antenna diversity, and rake combining, are derived for a single-cell system and a multi-cell system.

In this letter, we investigate the blind channel estimation in MIMO-OFDM systems based on the second-order statistics of the channel outputs only. We exploit the cyclostationarity induced by OFDM with cyclic prefix, establish the sufficient identifiability conditions, and develop a subspace algorithm. Finally, we demonstrate the validity of the algorithm by computer simulations.

Let us introduce n ( 2) 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(0) Xi-1, (i=1,2,,n 0), such that fi(Xi-1(0)) Xi(0). Moreover, let us introduce n set-valued mappings Fi : Xi-1 Xi (Xi)(the family of all non-empty closed compact subsets of Xi), (i=1,2,,n 0). Here, we have a fixed point theorem on the successively recurrent system of set-valued mapping equations: xi Fi(xi-1, fi(xi-1)), (i=1,2,,n 0). This theorem can be applied immediately to analysis of the availability of system of circular networks of channels undergone by uncertain fluctuations and to evaluation of the tolerability of behaviors of those systems. In this paper, mathematical situation and detailed proof are discussed, about this theorem.

Location management is crucial for mobile systems. A mobile must be located whenever a connection is established. Thus, mobile systems must cope with frequent location updates and queries. In addition to the HLR/VLR scheme in IS-41 and GSM, the feasibility of reducing the network load caused by locating mobile users has received considerable attention. One user location algorithm called "Pointer Forwarding with Single HLR," was proposed to reduce location update cost. Thereafter, the distributed HLR scheme was proposed to prevent HLR from becoming a signal bottleneck in the signaling network. This approach eliminates the cost of updating multiple HLRs, vastly reducing the database access delay, but also introduces long pointer chain traverse that may cause large location tracking costs and long call delivery times/costs. This study proposes a efficient location tracking strategy, named, "Fast Pointer Forwarding Strategy with Distributed HLR. " This strategy ensures that the pointer chain length never exceeds one. In fact, this strategy provides an upper bound on location tracking time. Its performance is numerically analyzed. Results in this study demonstrate that our strategy can considerably reduce the complexity of implementation and the call delivery time/cost.

This paper presents a new operation and maintenance system for PON (Passive Optical Network) subscriber loops and an assessment of its feasibility through experiments. This system adopts a broadband continuous wave light source as a testing signal and a fiber grating filter as a reflective component. The fiber grating filter is inserted somewhere in each subscriber loop for reflection of the testing signal. Our results show that the proposed system operates well for the purposes of quick decision of loop state and easy testing for PON subscriber loops.

Scattering of a plane wave obliquely incident on a meteor trail is studied using the full wave treatment by treating the trail as a stratified column which has Gaussian radial electron distribution. Due to the coupling of the fields, the coupled equations have to be solved simultaneously. They are treated in matrix form, so the uncoupled and the coupled components can be distinguished. Based on the oblique scattering geometry, the effects of the variation of the communication range and the trail orientation are investigated. In the case of the variation of the communication range, results are in accordance with the approximate models but they are in contrast in the case of the variation of the trail orientation. Calculated waveforms are compared with the experimental echo shapes. It is found that they are in good agreement with each other. Furthermore, a duration comparison indicates that the electron line densities of most of the received signals are in the transition region.

In this work we study the performance of a distributed GA that incorporates in its core parallel cooperative-competitive genetic operators. A series of controlled experiments are conducted using various large and difficult 0/1 multiple knapsack problems to test the robustness of the distributed GA. Simulation results verify that the proposed distributed GA compared with a canonical distributed GA significantly gains in search speed and convergence reliability with less communication cost for migration.

This paper describes a hybrid force-directed self-organizing neural network approach to printed circuit board (PCB) placement with consideration of electromagnetic compatibility (EMC). In most of the conventional PCB automatic placement algorithms, the only factor considered in the objective function is minimized total net length. However, for today's high speed and high density PCB, EMC compliance cannot be met by such single objective. To tackle this problem, the presented algorithm takes EMC into consideration, besides component overlap and minimized total net length. These factors are optimized by means of an adapted self-organizing map. Comparison of simulated placement results as well as actual measurements with commercial softwares confirms the effectiveness of the proposed method.

This paper assesses the performance of the handoff algorithm based on distance and RSSI measurements in a multi-cellular environment by computer simulation. The algorithm performs a handoff if handoff initiation conditions, handoff possible conditions, and handoff selective conditions are met. The performance criteria are based on the average number of handoffs, the crossover points and the average number of outages. Numerical results are presented to demonstrate the feasibility of the algorithm. The performance of the distance-assisted handoff algorithm is compared with that of a conventional algorithm that utilizes signal strength alone. Overall, the distance-assisted algorithm exhibits higher performance in average number of handoffs and the crossover points, yet exhibits a higher number of outages on average than the conventional algorithm.

We have experimentally observed the dynamics of laser outputs in a microchip laser with frequency-modulated feedback light. We have observed rich dynamics that can be interpreted as three types of dynamics at different frequencies: (1) periodic bursts at twice of the frequency of the modulation of the external mirror, (2) chaotic pulsations at the relaxation oscillation frequency, and (3) clusters at the instantaneous Doppler-shifted frequency. We have confirmed these rich dynamics by using numerical simulations.

In this paper, we focus on an image encryption scheme based on a truncated Baker transformation. The truncated Baker transformation globally preserves the original dynamics of Baker transformation but incorporates a random local rotation operator between two neighbor elements in the mapping domain in order to keep a finite precision. It generates binary sequences (the dynamics of elements) which have statistically good features on ergodicity, mixing and chaotic properties. The image encryption scheme extended from the truncated Baker transformation efficiently shuffles the input gray level image satisfying fundamental conditions on confusion and diffusion required for image encryption schemes. However, this scheme uses many binary sequences and thus needs to keep a large volume of secret keys. In order to solve this problem we introduce Peano space-filling curve in this scheme, which remarkably reduce the key size and mapping iterations without deteriorating good shuffling properties attained by this scheme.