A new adaptive algorithm is proposed by introducing some modifications to the recursive least squares (RLS) algorithm. Except for the noise variance, the proposed algorithm does not require any statistics or knowledge of the desired signal, thus, it is suitable for adaptive filtering for channel estimation in code division multiple access (CDMA) systems in cases where the standard RLS approach cannot be used. A theoretical analysis demonstrates the convergence of the proposed algorithm, and simulation results for CDMA channel estimation show that the proposed algorithm outperforms existing channel estimation schemes.

The proportionate normalized least mean square algorithm (PNLMS) greatly improves the convergence of the sparse impulse response. It exploits the shape of the impulse response to decide the proportionate step gain for each coefficient. This is not always suitable. Actually, the proportionate step gain should be determined according to the difference between the current estimate of the coefficient and its optimal value. Based on this idea, an approach is proposed to determine the proportionate step gain. The proposed approach can improve the convergence of proportionate adaptive algorithms after a fast initial period. It even behaves well for the non-sparse impulse response. Simulations verify the effectiveness of the proposed approach.

In this paper, we propose a novel Web service composition framework which dynamically accommodates various failure recovery requirements. In the proposed framework called Adaptive Failure-handling Framework (AdaFF), failure-handling submodules are prepared during the design of a composite service, and some of them are systematically selected and automatically combined with the composite Web service at service instantiation in accordance with the requirement of individual users. In contrast, existing frameworks cannot adapt the failure-handling behaviors to user's requirements. AdaFF rapidly delivers a composite service supporting the requirement-matched failure handling without manual development, and contributes to a flexible composite Web service design in that service architects never care about failure handling or variable requirements of users. For proof of concept, we implement a prototype system of the AdaFF, which automatically generates a composite service instance with Web Services Business Process Execution Language (WS-BPEL) according to the users' requirement specified in XML format and executes the generated instance on the ActiveBPEL engine.

With the progress of ubiquitous technology, ubiquitous learning presents new opportunities to learners. Situations of a learner can be grasped through analyzing the learner's actions collected by sensors, RF-IDs, or cameras in order to provide support at proper time, proper place, and proper situation. Training for acquiring skills and enhancing physical abilities through exercise and experience in the real world is an important domain in u-learning. A training program may last for several days and has one or more training units (exercises) for a day. A learner's performance in a unit is considered as short term state. The performance in a series of units may change with patterns: progress, plateau, and decline. Long term state in a series of units is accumulatively computed based on short term states. In a learning/training program, it is necessary to apply different support strategies to adapt to different states of the learner. Adaptation in learning support is significant, because a learner loses his/her interests easily without adaptation. Systems with the adaptive support usually provide stimulators to a learner, and a learner can have a great motivation in learning at beginning. However, when the stimulators reach some levels, the learner may lose his/her motivation, because the long term state of the learner changes dynamically, which means a progress state may change to a plateau state or a decline state. In different long term learning states, different types of stimulators are needed. However, the stimulators and advice provided by the existing systems are monotonic without changeable support strategies. We propose a mutual adaptive support. The mutual adaptation means each of the system and the learner has their own states. On one hand, the system tries to change its state to adapt to the learner's state for providing adaptive support. On the other hand, the learner can change its performance following the advice given based on the state of the system. We create a ubiquitous pet (u-pet) as a metaphor of our system. A u-pet is always with the learner and encourage the leaner to start training at proper time and to do training smoothly. The u-pet can perform actions with the learner in training, change its own attributes based on the learner's attributes, and adjust its own learning rate by a learning function. The u-pet grasps the state of the learner and adopts different training support strategies to the learner's training based on the learner's short and long term states.

The effect of wavefront compensation in beam transmission is estimated for ground to satellite laser communications. A numerical analysis is performed using the combination of the isoplanatic angle, the atmospheric coherence length and the point-ahead angle to find the aperture size of the beam transmission with which the wavefront compensation effect appears most strongly.

This paper presents an integer discrete cosine transform (IntDCT) with only dyadic values such as k/2n (k, n∈ in N). Although some conventional IntDCTs have been proposed, they are not suitable for lossless-to-lossy image coding in low-bit-word-length (coefficients) due to the degradation of the frequency decomposition performance in the system. First, the proposed M-channel lossless Walsh-Hadamard transform (LWHT) can be constructed by only (log2M)-bit-word-length and has structural regularity. Then, our 8-channel IntDCT via LWHT keeps good coding performance even if low-bit-word-length is used because LWHT, which is main part of IntDCT, can be implemented by only 3-bit-word-length. Finally, the validity of our method is proved by showing the results of lossless-to-lossy image coding in low-bit-word-length.

The establishment of inter-domain traffic engineered paths is a requisite to accomplishing an end-to-end bandwidth guarantee and end-to-end resource optimization. Though the inter-domain paths must be reliable, it is difficult to compute suitable backup inter-domain paths in advance when the traffic engineering information is not disclosed outside of each domain. This means that the inter-domain path computation must satisfy the severe requirement of path establishment delay, since all inter-domain paths traversing the links in failure need to be computed after the failure occurs. Though several inter-domain path computation schemes have been proposed, their relative characteristics remain unknown. First, this paper classifies the conventional inter-domain path computation schemes into two types, i.e. end-to-end and per-domain schemes, and compares their performances under various traffic loads. Based on results of the comparisons, this paper proposes an adaptive inter-domain path computation scheme that can satisfy the severe requirement of the path establishment delay. In this scheme, the domain sequence from the source node to the destination node is divided into multiple sub-domain sequences according to the traffic load in each domain. The end-to-end path computation scheme is applied to the sub-domain sequences under heavy traffic loads, while the per-domain path computation scheme is applied to those under normal traffic loads. The simulation results show that the proposed scheme can adaptively satisfy the requirement for the path establishment delay while it maintains the optimality of path computation, even if the traffic load applied to each domain changes.

Introducing adaptive online data compression at network-internal nodes is considered for alleviating traffic congestion on the network. In this paper, we assume that advanced relay nodes, which possess both a relay function (network resource) and a processing function (computational and storage resources), are placed inside the network, and we propose an adaptive online lossless packet compression scheme utilized at these nodes. This scheme selectively compresses a packet according to its waiting time in the queue during congestion. Through preliminary investigation using actual traffic datasets, we investigate the compression ratio and processing time of packet-by-packet compression in actual network environments. Then, by means of computer simulations, we show that the proposed scheme reduces the packet delay time and discard rate and investigate factors necessary in achieving efficient packet relay.

In this paper, we address the on-demand end-to-end optical network construction problem for grid applications in new generation large-scale multi-domain wavelength switched optical networks (WSON). According to users' requests for high-performance distributed computing, groups of dedicated end-to-end lightpaths among geographically distributed grid resources can be established dynamically forming multiple-lightpath optical networks for grid applications, namely, optical grid network (OGN). To facilitate the automated OGN construction, we introduce an optical grid network infrastructure providing an integrated and self-contained OGN service to grid users with totally distributed control. In this infrastructure, for easy construction, especially in a large-scale multi-domain WSON environment, we propose an overlay approach to construct OGNs in a peer-to-peer fashion, which conceals the communication architecture of the underlying heterogeneous optical networks. In particular, we propose an adaptive construction mechanism that can develop the OGN flexibly by adapting to the dynamically changed optical network circumstance. To enable users to take the advantage of the end-to-end lightpaths of WSON directly, a wavelength-oriented end-host configuration scheme is proposed. Experimental results on a developed prototype and an optical-fibre test-bed network successfully validate the proposal.

The current Internet is not capable of meeting the future communication requirements of society, i.e., reliable connectivity in a ubiquitous networking environment. The shortcomings of the Internet are due to the lack of support for mobility, multihoming, security and heterogeneous network layer protocols in the original design. Therefore, to provide ubiquitous networking facilities to the society for future innovation, we have to redesign the future Internet, which we call the New Generation Network. In this paper, we present the Heterogeneity Inclusion and Mobility Adaptation through Locator ID Separation (HIMALIS) architecture for the New Generation Network. The HIMALIS architecture includes a new naming scheme for generating host names and IDs. It also includes a logical control network to store and distribute bindings between host names, IDs, locators and other information useful for providing support for network operation and control. The architecture uses such information to manage network dynamism (i.e., mobility, multihoming) and heterogeneity in network layer protocols. We verify the basic functions of the architecture by implementing and testing them using a testbed system.

This paper proposes a new overlay transmission system for wireless LAN with RTS/CTS exchange. Conventional timing synchronization schemes may fail in the presence of inter-system interference, because they have not been designed for overlay transmission. In the proposed system, a transmitter estimates the transmission timing of the next wireless LAN DATA frame, and then sends its DATA frame at almost the same time as the estimated transmission timing to easily establish timing synchronization at the receiver. Moreover, we employ a tapped delay line adaptive array antenna at both transmitter and receiver to effectively suppress interference due to overlay transmission in a rich multipath propagation environment. The frame error rate performances of the proposed system and the IEEE 802.11a wireless LAN are evaluated through computer simulations that assume an exponentially decaying 8-path non-line-of-sight fading channel and include a timing synchronization process. Simulation results demonstrate that the proposed system can achieve overlay transmission while avoiding interference in a rich multipath propagation environment.

The Hough transform is known to be an effective technique for target detection and track initiation in search radars. However, most papers have focused on the simplistic applications of this technique which consider a 2-D data space for the Hough transform. In this paper, a new method based on xthe Hough transform is introduced for detecting targets in a 3-D data space. The data space is constructed from returned surveillance radar signal using the range and bearing information of several successive scans. This information is mapped into a 3-D x-y-t Cartesian data space. Targets are modeled with four parameters in this data space. The proposed 3-D Hough detector is then used to detect the existent targets in the 3-D surveillance space by mapping the returned signal of the radar from the data space to the parameter space. This detector, which is constructed of two detection stages, integrates the returned data of each target non-coherently along its 3-D trajectory in one parameter space cell related to this target. Hence, the detection performance will improve. The effectiveness of the new 3-D Hough detector is demonstrated through deriving the detection statistics analytically and comparing the results with those of several comprehensive simulations. The performance improvement of this detector is shown by comparing its detection range with the conventional detector. The proposed detector is also evaluated with real radar data and its efficiency is confirmed.

We provide an efficient transmission scheme which embeds a pilot signal in the data signal for channel state information (CSI) based on the configuration of a multiple-input multiple-output (MIMO) system using space-time block coding (STBC) with an adaptive array (AA). A computer simulation and analysis show that the proposed scheme, which combines the advantage of an Alamouti-like STBC scheme and the pilot-based AA, can suppress the irreducible error due to random FM noise. The proposed scheme using a pilot minimizes the decoding delay, and is highly robust against fast fading. We show that the proposed scheme can significantly increase the data transmission rate by using the transmitter diversity based on STBC, and the accuracy of the proposed technique is exemplified by a computer simulation.

Disturbance attenuation for a class of time-delay systems is performed by a combined simple adaptive control (SAC) with a new configuration of disturbance observer (DOB). The nominal system results from the Pade approximation, which is in the form of a non-minimum phase LTI system. For the implementation of SAC and DOB, two parallel feedforward compensators (PFC) are designed with the inverses of PD- and PID-controller, respectively. Simulation results show the effectiveness of the proposed controller to compensate the disturbance response and uncertain delay time.

We analyze the performance of an adaptive communication scheme in which by employing limited feedback, the source will decide to transmit signal to the destination either by the direct link or by the direct and relaying links. Specifically, by using the instantaneous SNR as the metric, if the S-D link is better, the source will transmit to destination directly. Otherwise, the two-phase transmission mode will be triggered in which source cooperates with the relay or transmits twice within two time slots based on the quality of the received signal at the relay. Initially, the spectral efficiency is derived by calculating the probabilities of direct transmission and two-phase transmission mode. Subsequently, the BER performance for the adaptive cooperation schemes is analyzed by considering the BER routines of two events: the source transmits the signal alone or cooperates with the relay. Also, the optimum power allocation is studied based on the BER result. Finally, Monte-Carlo simulation results are presented to confirm the performance enhancement offered by the proposed scheme.

Traditional wavelet-based speech enhancement algorithms are ineffective in the presence of highly non-stationary noise because of the difficulties in the accurate estimation of the local noise spectrum. In this paper, a simple method of noise estimation employing the use of a voice activity detector is proposed. We can improve the output of a wavelet-based speech enhancement algorithm in the presence of random noise bursts according to the results of VAD decision. The noisy speech is first preprocessed using bark-scale wavelet packet decomposition ( BSWPD ) to convert a noisy signal into wavelet coefficients (WCs). It is found that the VAD using bark-scale spectral entropy, called as BS-Entropy, parameter is superior to other energy-based approach especially in variable noise-level. The wavelet coefficient threshold (WCT) of each subband is then temporally adjusted according to the result of VAD approach. In a speech-dominated frame, the speech is categorized into either a voiced frame or an unvoiced frame. A voiced frame possesses a strong tone-like spectrum in lower subbands, so that the WCs of lower-band must be reserved. On the contrary, the WCT tends to increase in lower-band if the speech is categorized as unvoiced. In a noise-dominated frame, the background noise can be almost completely removed by increasing the WCT. The objective and subjective experimental results are then used to evaluate the proposed system. The experiments show that this algorithm is valid on various noise conditions, especially for color noise and non-stationary noise conditions.

Multi-user multiple input multiple output (MU-MIMO) systems have attracted much attention as a technology that enhances the total system capacity by generating a virtual MIMO channel between a base station and multiple terminal stations. Extensive evaluations are still needed because there are many more system parameters in MU-MIMO than in single user (SU)-MIMO and the MU-MIMO performance in actual environments is still not well understood. This paper describes the features and effectiveness of a 1616 MU-MIMO testbed in an actual indoor environment. Moreover, we propose a simple adaptive modulation scheme for MU-MIMO-OFDM transmission that employs a bit interleaver in the frequency and space domains. We evaluate the frequency efficiency by obtaining the bit error rate of this testbed in an actual indoor environment. We show that 1644-user MU-MIMO transmission using the proposed modulation scheme achieves the frequency utilization of 870 Mbps and 1 Gbps (respective SNRs: 31 and 36 dB) with a 20-MHz bandwidth.

We propose the multi-domain adaptive learning that enables us to find a point meeting possibly time-varying specifications simultaneously in multiple domains, e.g. space, time, frequency, etc. The novel concept is based on the idea of feasibility splitting -- dealing with feasibility in each individual domain. We show that the adaptive projected subgradient method (Yamada, 2003) realizes the multi-domain adaptive learning by employing (i) a projected gradient operator with respect to a ‘fixed’ proximity function reflecting the time-invariant specifications and (ii) a subgradient projection with respect to ‘time-varying’ objective functions reflecting the time-varying specifications. The resulting algorithm is suitable for real-time implementation, because it requires no more than metric projections onto closed convex sets each of which accommodates the specification in each domain. A convergence analysis and numerical examples are presented.

We propose the network on demand concept to yield the optical access network system that well handles the diversity in user demands and support technologies such as module and devices configuration. In this proposal, the network accommodation equipment, such as OLT needed for each service, is installed ‘virtually' using WDM, and the physical rate can adapt to the user-demanded service rate by using the WDM parallel transmission technique. It well handles the diversity in user demands/services and lowers system power consumption.

A secret image transmission scheme based on vector quantization (VQ) and a secret codebook is proposed in this article. The goal of this scheme is to transmit a set of good-quality images secretly via another high-quality cover image with the same image size. In order to reduce the data size of secret images, the images are encoded by an adaptive codebook. To guarantee the visual quality of secret images, the adaptive codebook applied at the transmitter is transmitted to the receiver secretly as well. Moreover, to enhance the security of the proposed scheme and to compact the data size of the codebook, the adaptive codebook is encoded based on VQ using another codebook generated from the cover image. Experiments show impressive results.