Designable task allocation systems which consist of identical agents using stochastic automata are suggested. From the viewpoint of the group response and the individual behavior, the performances of a simple model and an improved one are compared numerically. Robots experiments are performed to compare between the two models.

Internet engineering task force (IETF) has proposed hierarchical mobile IPv6 (HMIPv6) in order to reduce a frequent location registration of a mobile node in mobile IPv6 (MIPv6). All traffics toward a mobile node must be transmitted through a MAP in HMIPv6. This brings unnecessary packet latency because of the increased processing cost of packet at the MAP. At this point, the processing cost of packet at the MAP is influenced by the packet arrival rate for a mobile node, cell mobility rate and the number of mobile nodes in MAP domain. In this paper, we analyze the MAP's performance considering the above elements. For this, we compare total cost of HMIPv6 with total cost of MIPv6 as MAP's capability after we define Markov chain model for performance analysis. Also, we define network's total profit as total cost of MIPv6 minus total cost of HMIPv6. Then, we can find optimal capability of MAP such that total profit has maximum value. Also, we use the blocking probability by the MAP's capability as performance estimation element. As a conclusion, we can observe both HMIPv6's performance by the MAP's capability and optimal capability of the MAP, and blocking probability form a relationship of trade off between them.

Recently, lattice reduction aided (LRA) detectors have been introduced into Vertical Bell-Labs Layered Space-Time (V-BLAST) systems to obtain nearly optimal bit error rate (BER) performance for only small additional complexity. In this paper, the layer error characteristics of LRA-V-BLAST detectors are investigated and compared with those of conventional V-BLAST ones. Two important conclusions are drawn for the LRA-V-BLAST detectors. First, the variation of their mean square error (MSE) within each detection iteration is not as large as in conventional V-BLAST detectors. Second, thanks to lattice reduction there exists an inherent sub-optimal detection order from the last to the first layer. These conclusions allow LRA-V-BLAST detectors to avoid optimal ordering to further reduce the complexity. LRA-V-BLAST detectors without optimal ordering are shown to obtain almost the same BER performance of LRA-V-BLAST detector with optimal ordering.

The present paper introduces a new construction of a class of binary periodic sequence set having a zero-correlation zone (hereinafter binary ZCA sequence set). The cross-correlation function and the side-lobe of the auto-correlation function of the proposed sequence set is zero for the phase shifts within the zero-correlation zone. The present paper shows that such a construction generates a binary ZCA sequence set by using a cyclic difference set and a collection of mutually orthogonal complementary sets.

The pseudo-transient method is discussed in this paper as one of practical methods to find DC operating points of nonlinear circuits when the Newton-Raphson method fails. The mathematical description for this method is presented and an effective pseudo-transient algorithm utilizing compound pseudo-elements is proposed. Numerical examples are demonstrated to prove that our algorithm is able to avoid the oscillation problems effectively and also improve the simulation efficiency.

Providing multimedia services with a quality-of-service guarantee in mobile wireless networks presents more challenges due to user's mobility and limited bandwidth resource. In order to provide seamless multimedia services in the next-generation wireless networks, efficient call admission control algorithm must be developed. A novel borrowing-based call admission control policy is proposed in this paper as a solution to support quality-of-service guarantees in the mobile multimedia wireless networks. Based on the existing network conditions, the proposed scheme makes an adaptive decision for bandwidth allocation and call admission by employing attribute-measurement mechanism, dynamic time interval reservation strategy, and service-based borrowing strategy in each base station. We use the dynamically adaptive approaches to reduce the connection-blocking probability and connection-dropping probability, and to increase the bandwidth utilization, while the quality-of-service guarantees can be maintained at a comfortable level for mobile multimedia wireless networks. Extensive simulation results show that our proposed scheme outperforms the previously proposed scheme in terms of connection-blocking probability, connection-dropping probability, and bandwidth utilization, while providing highly satisfying degree of quality-of-service in mobile communication systems.

We have researched high dimensional parity-check (HDPC) codes that give good performance over a channel that has a very high error rate. HDPC code has a little coding overhead because of its simple structure. It has hard-in, maximum detected bit flipping (MDBF) decoding that has reasonable decoding performance and computational cost. In this paper, we propose a modified algorithm for MDBF decoding and compare the proposed MDBF decoding with conventional hard-in decoding.

Gastric cancer is a great part of the cancer occurrence and the mortality from cancer in Korea, and the early detection of gastric cancer is very important in the treatment and convalescence. This paper, for the early detection of gastric cancer, proposes the analysis system of an endoscopic image of the stomach, which detects abnormal regions by using the change of color in the image and by providing the surface tissue information to the detector. While advanced inflammation or cancer may be easily detected, early inflammation or cancer is difficult to detect and requires more attention to be detected. This paper, at first, converts an endoscopic image to an image of the IHb (Index of Hemoglobin) model and removes noises incurred by illumination and, automatically detects the regions suspected as cancer and provides the related information to the detector, or provides the surface tissue information for the regions appointed by the detector. This paper does not intend to provide the final diagnosis of abnormal regions detected as gastric cancer, but it intends to provide a supplementary mean to reduce the load and mistaken diagnosis of the detector, by automatically detecting the abnormal regions not easily detected by the human eye and this provides additional information for diagnosis. The experiments using practical endoscopic images for performance evaluation showed that the proposed system is effective in the analysis of endoscopic images of the stomach.

In a typical OFDM system, a time domain equalizer (TEQ) can be used in order to reduce the channel length, allowing for shortening of the Cyclic Prefix (CP). In this paper, a novel TEQ method is proposed for OFDM systems, which can reduce implementation complexity without sacrificing performance. Furthermore, the length of the proposed TEQ may be arbitrary. For time-varying channels, an adaptive method is also developed to track the variation of the optimum TEQ coefficients rather than recomputing inversion of the channel matrix.

Frequency-modulated clock signals are widely used in personal computers to reduce the amplitude of the clock harmonic noise, as measured using an electromagnetic interference (EMI) test receiver. However, the power of the clock harmonics is not decreased with this technique called spread spectrum clocking (SSC). Hence, the impact of the harmonics of a frequency-modulated clock on the bit error rate (BER) and packet error rate (PER) of a Bluetooth system is theoretically analyzed. In addition, theoretical analysis covers the effectiveness of a frequency hopping spread spectrum (FH-SS) scheme and forward error correction (FEC) in mitigating the degradation in the BER and PER caused by clock harmonic interference. The results indicate that the BER and PER strongly depend on the modulating frequency and maximum frequency deviation of the clock harmonic. They also indicate that radiated clock harmonics may considerably degrade the BER and PER when a Bluetooth receiver is very close to a personal computer. Frequency modulating the clock harmonics slightly reduces the BER while it negligibly reduces the PER.

A hardware algorithm for integer division is proposed. It is based on the radix-2 non-restoring division algorithm. Fast computation is achieved by the use of the radix-2 signed-digit (SD2) representation. The algorithm does not require normalization of the divisor, and hence, does not require an area-consuming leading-one (or zero) detection nor shifts of variable-amount. Combinational (unfolded) implementation of the algorithm yields a regularly structured array divider, and sequential implementation yields compact dividers.

This paper deals with the Optimum Communication Spanning Tree Problem (OCST) which is well known as an NP-hard problem. For solving the problem, we uses an evolutionary approach. This paper presents a new effective tree encoding and proposes a tree construction routine (TCR) to generate a tree from the encoding. The basic principle is to break a cycle. We also propose a new crossover operator that focuses on the inheritance of parental information and the use of network information. Consequently, we confirm that the proposed algorithm is superior to other algorithms applied to the OCST problem or other tree problems. Moreover, our method can find a better solution than the solution which was previously known as the best solution. In addition, we analyzed the locality and diversity property of encoding and observed that the proposed method has high locality and at the same time it preserves population diversity for many generations. Finally, we conclude that these properties are the main reasons why the proposed method outperforms the other encodings.

This letter proposes an efficient method to find the optimum subfield code, which minimizes the visual artifacts on the motion pictures of the plasma display panel (PDP). Existing codes were constructed to reduce dynamic false contour (DFC) only, and they are fixed codes used for every image. In contrast, the proposed method aims to minimize the total artifacts by DFC and halftone noise (HN), and it finds the best code for a given image, dynamically. First, this letter presents the novel models to estimate the effect of DFC and HN for given codewords and a given image. Then, it presents an efficient method that finds the optimum code for a given image using the well-known shortest-path algorithm. Experimental results, using 459 HDTV images, illustrated that the proposed approach improved the average PSNR by 0.713 dB and 7.004 dB in DFC and HN, respectively, when compared with Gravity Centre Code [1].

In this paper, we give an algorithm for the node-to-set disjoint paths problem in a transposition graph. The algorithm is of polynomial order of n for an n-transposition graph. It is based on recursion and divided into two cases according to the distribution of destination nodes. The maximum length of each path and the time complexity of the algorithm are estimated theoretically to be O(n7) and 3n - 5, respectively, and the average performance is evaluated based on computer experiments.

Assume that G(D) is a k0n0 canonical generator matrix. Let G(L)(D) be the generator matrix obtained by integrating L consecutive trellis-modules associated with G(D). We also consider a modified version of G(L)(D) using a column permutation. Then take notice of the corresponding minimal trellis-module T(L). In this paper, we show that there is a case where the minimum number of states over all levels in T(L) is less than the minimum attained for the minimal trellis-module associated with G(D). In this case, combining with a shifted sectionalization of the trellis, we can construct a trellis-module with further reduced number of states. We actually present such an example. We also clarify the mechanism of state-space reduction. That is, we show that trellis-module integration combined with an appropriate column permutation and a shifted sectionalization of the trellis is equivalent to shifting some particular bits of the original code bits by L time units.

The multi-step prediction model based on partial least squares (PLS) is established to predict short-term load series with high embedding dimension in this paper, which refrains from cumulative error with local single-step linear model, and can cope with the multi-collinearity in the reconstructed phase space. In the model, PLS is used to model the dynamic evolution between the phase points and the corresponding future points. With research on the PLS theory, the model algorithm is put forward. Finally, the actual load series are used to test this model, and the results show that the model plays well in chaotic time series prediction, even if the embedding dimension is selected a big value.

If the signal is not Gaussian, then the power spectral density (PSD) approach is insufficient to analyze signals and we resort to estimate the higher order spectra of the signal. However, estimation of the higher order spectra is even more time consuming, for example, the complexity of trispectrum is O(N 4). This problem becomes even more serious when short time Fourier transform (STFT) is computed - computation of the trispectrum is required after every shift of the window. In this paper, a method to recursively compute trispectrum has been presented and it is shown that the computational complexity, for a window size of N, is reduced to be O(N 3) and is the same as the space complexity.

In most research work for sensor network routings, perfect aggregation has been assumed. Such an assumption might limit the application of the wireless sensor networks. We address the impact of aggregation efficiency on energy consumption in the context of GIT routing. Our questions are how the most efficient aggregation point changes according to aggregation efficiency and the extent to which energy consumption can decrease compared to the original GIT routing and opportunistic routing. To answer these questions, we analyze a two-source model, which yields results that lend insight into the impact of aggregation efficiency. Based on analytical results, we propose an improved GIT: "aggregation efficiency-aware GIT," or AGIT. We also consider a suppression scheme for exploratory messages: "hop exploratory." Our simulation results show that the AGIT routing saves the energy consumption of the data transmission compared to the original GIT routing and opportunistic routing.

For point-to-point mobile visual communications, layered video has been utilized to adapt to time-varying channel capacity over noisy environments. From the perspective of the HVS (Human Visual System), it is necessary to minimize the loss of visual quality by specifically maintaining the throughput of visually important regions, objects and so on. Utilizing the prioritized bitstreams generated according to each layer, the throughput can be improved for given channel statistics. In this paper, we define the transmission gain and measure the improved performance when the throughput of ROI (Regions Of Interest) is increased relative to visually unimportant regions over a capacity limited mobile channel.

The proposed zero-current switching switched-capacitor (ZCS SC) DC-DC converter is an innovative bi-directional power flow control conversion scheme. A zero-current switching switched-capacitor step-up/step-down bi-directional converter is presented that can improve the current stress problem during bi-directional power flow control processing. It can provide a high voltage conversion ratio of n/ (n-mode/-mode) using four power MOSFET main switches, a set of switched-capacitors and a small resonant inductor. Simulation and experimental results are carried out to verify the concept and performance of the proposed quadruple-mode/quarter-mode bi-directional DC-DC converter.