This paper presents a path compression protocol for on-demand ad hoc network routing protocols, which is called dynamic path shortening (DPS). In DPS, active route paths adapt dynamically to node mobility based on the "local" link quality estimation at each own node, without exchanging periodic control packets such as Hello messages. Each node monitors its own local link quality only when receiving packets and estimates whether to enter the "proximity" of the neighbor node to shorten active paths in a distributed manner. Simulation results of DPS in several scenarios of various node mobility and traffic flows reveal that adding DPS to DSR which is the conventional prominent on-demand ad hoc routing protocol significantly reduces the end-to-end packet latency up to 50-percent and also the number of routing packets up to 70-percent over the pure DSR, in heavy traffic cases. We also demonstrate the other simulation results obtained by using our two novel mobility models which generate more realistic node mobility than the standard random waypoint mobility model: Random Orientation Mobility and Random Escape Mobility models. Finally, simple performance experiments using DPS implementation on FreeBSD OS demonstrate that DPS shortens active routes in the order of milliseconds (about 5 ms).

This paper proposes a method of improving demodulation performance for chaotic synchronization based multiplex communications systems. In a conventional system, the number of data demodulated correctly is limited because transmitted chaotic signals interfere with each other. The proposed system uses a generalized inverse of a matrix formed from chaotic signals at the transmitter. Since this completely cancels the interference between chaotic signals, demodulation performance is greatly improved. The proposed system has the following features: A simple correlation receiver suitable for small terminals can be used; The magnitude of the correlator output is constant for binary data transmission; Analog information data can also be transmitted. Two methods to reduce the peak-to-average power ratio of the transmitted signal are presented.

Since a radio channel is shared among terminals in an ad hoc network, packet collisions are frequent. In case of transmitting packets especially using TCP, data and ACK packets are transmitted in opposite directions on the same radio channel. Therefore, frequent collisions are unavoidable, and this seriously degrades TCP throughput. It is possible to transmit to two or more nodes which adjoin from a certain node simultaneously on the radio channel. To reduce the likelihood of packet collisions when an intermediate node transmits both data and ACK packets, these two types of packet can be combined and transmitted at the same time to increase the efficiency of radio channel utilization. In this paper, we propose a new technique to improve TCP performance by combining data and ACK packets. Our proposed technique is applicable to generic ad hoc networks easily. By means of a simulation using networks with various topologies, we have found that throughput can be improved by up to 60% by applying our proposed technique.

The chaotic property of a new open addressing hash function, called exponential hashing, is presented. Our analysis indicates the connection between ergodic theory and hashing. Based on that, concepts from ergodic theory are applied to predict the performance of exponential hashing. Experimental results are presented to verify our theoretic analysis and the prediction.

Analytical derivation of bit error rates for multi-user coherent chaos-shift-keying (CSK) communication systems are presented in this paper. Nearly exact results are obtained by applying the central limit theorem of statistics to sums of independent variables. Based on χ2 distribution approximations, more viable but still very accurate results decrease complexity of the calculations. The χ2 approach is compared with the widely used Gaussian approximation approach to show its superiority in most cases. Bit error performance bounds for the multi-user CSK system from the approach are deduced as further contributions of this paper. The theoretical results obtained are entirely consistent with a range of simulations.

The single path routing protocol, known as the Ad Hoc On-demand Distance Vector, has been widely studied for use in mobile ad hoc networks. AODV requires a new route discovery whenever a path breaks. Such frequent route discoveries cause a delay due to route discovery latency. To avoid such inefficiency, a multipath routing protocol has been proposed that attempts to find link-disjoint paths in a route discovery. However, when there are two or more common intermediate nodes on the path, the protocol can not find a pair of link-disjoint paths even if the paths actually exist. To reduce this route discovery latency, it is necessary to increase the opportunities for finding a pair of link-disjoint paths. In this paper, we focus on AODV and propose an AODV-based new multipath routing protocol for mobile ad hoc networks. The proposed routing protocol uses a new method to find a pair of link-disjoint paths by selecting a route having a small number of common intermediate nodes on its path. Using simulation models, we evaluate the proposed routing protocol and compare it with AODV and the existing multipath routing protocol. Results show that the proposed routing protocol achieves better performance in terms of delay than other protocols because it increases the number of cases where a pair of link-disjoint paths can be established.

In order to produce precise enclosures from a multi-dimensional interval vector, we introduce a sharp interval sub-dividing condition for optimization algorithms. By utilizing interval inclusion properties, we also enhance the sampling of an upper bound for effective use in the interval quadratic method. This has resulted in an improvement in the algorithm for the unconstrained optimization problem by Hansen in 1992.

In 2003, Wu proposed a threshold access control scheme based on smart cards. In this letter, we show that the scheme is vulnerable to various attacks.

This paper addresses the issue of reconfiguring multi-layer neural networks implemented in single or multiple VLSI chips. The ability to adaptively reconfigure network configuration for a given application, considering the presence of faulty neurons, is a very valuable feature in a large scale neural network. In addition, it has become necessary to achieve systems that can automatically reconfigure a network and acquire optimal weights without any help from host computers. However, self-reconfigurable architectures for neural networks have not been studied sufficiently. In this paper, we propose an architecture for a self-reconfigurable multi-layer neural network employing both reconfiguration with spare neurons and weight training by GAs. This proposal offers the combined advantages of low hardware overhead for adding spare neurons and fast weight training time. To show the possibility of self-reconfigurable neural networks, the prototype system has been implemented on a field programmable gate array.

This paper presents a novel blind multiple access interference (MAI) suppression filter in DS/CDMA systems. The filter is adaptively updated by parallel projections onto a series of convex sets. These sets are defined based on the received signal as well as a priori knowledge about the desired user's signature. In order to achieve fast convergence and good performance at steady state, the adaptive projected subgradient method (Yamada et al., 2003) is applied. The proposed scheme also jointly estimates the desired signal amplitude and the filter coefficients based on an approximation of an EM type algorithm, following the original idea proposed by Park and Doherty, 1997. Simulation results highlight the fast convergence behavior and good performance at steady state of the proposed scheme.

A scheme to evaluate the number of users and cell coverage of a WCDMA supporting multi-rate traffic is newly presented through calculation of the realizable Erlang capacity from a derived blocking probability and the path loss from the COST231 Walfisch-Ikegami (WI) model. Based on this analytical scheme, we evaluate the voice-data Erlang capacities at various data rates of 15 kbps to 480 kbps and the relationship between the cell coverage and the number of active users from them. When the value of Eb/Io is low from 4 dB to 3 dB under voice user capacity of 50 Erlang at 8 kbps, the result shows that the data user capacity is increased to 10 Erlang at low rate of 15 kbps and the cell coverage is enlarged to 100 m, and it is also shown that its capacity is increased to 0.2 Erlang at high rate of 480 kbps and its coverage to 50 m.

Inside a connector an interface with low insertion force and contact resistance is required, utilizing low cost materials such as copper alloys surrounded by tin coating. Relating to the application, the operating parameters have a wide range of values of currents, forces and materials. In this paper, we present a new experimental method based on non-intrusive probing of the deflection of the spring terminal with a laser technique. The main feature is that the reflection of the Laser beam onto the spring allows the determination of the contact force of the lamella-spring inside the female part. The technique requires the following insertion parameters during the insertion stroke: contact deflection δ, which allows contact force Fc, insertion force Fi and contact resistance Rc. It was found that the insertion force has a maximum value which decreases to the stable value, and depends on the size and the material of the pin. However contact resistance decreases sharply when first inserting, and tends to stable values on completing the insertion process, which is less sensitive to the pin diameter. Furthermore the final value which is important for the connector characterization is related and discussed. Finally, discrepancies were observed between the experimental and calculated data with simple numerical models. More complex models are in progress, which should improve the convergence of the theoretical approach to experimental results and proceed to the optimization of the connector parameters.

We propose a new method to introduce the Minimum Description Length (MDL) criterion to the automatic generation of non-uniform, context-dependent HMM topologies. Phonetic decision tree clustering is widely used, based on the Maximum Likelihood (ML) criterion, and only creates contextual variations. However, the ML criterion needs to predetermine control parameters, such as the total number of states, empirically for use as stop criteria. Information criteria have been applied to solve this problem for decision tree clustering. However, decision tree clustering cannot create topologies with various state lengths automatically. Therefore, we propose a method that applies the MDL criterion as split and stop criteria to the Successive State Splitting (SSS) algorithm as a means of generating contextual and temporal variations. This proposed method, the MDL-SSS algorithm, can automatically create adequate topologies without such predetermined parameters. Experimental results for travel arrangement dialogs and lecture speech show that the MDL-SSS can automatically stop splitting and obtain more appropriate HMM topologies than the original one.

A single solid-state magnetic sensor can be used to measure a current by sensing the field near the conductor in a non-contact way. In order to improve the accuracy of the measuring system, magnetic sensor arrays have been introduced in the current measurement around the conductor. An analytical algorithm based on Discrete Fourier Transform (DFT) is presented in this paper, which can separate the effects of the field generated by the current under measurement from the interference fields. A general mathematical model of the interference analysis is set up, which can be used for both DC and AC current measurement and has no restriction on the shape and number of the current conductors. Numerical simulations associated with preliminary experimental results confirm the validity of the approach.

In this paper, we propose a resolution enhancement method for estimating direction-of-arrival (DOA) of narrowband incoherent signals incident on a general array. The resolution of DOA algorithm is dependent on the aperture size of antenna array. But it is very impractical to increase the physical size of antenna array in real environment. We propose the method that improves resolution performance by virtually expanding the sensor spacing of original antenna array and then averaging the spatial spectrum of each virtual array which has a different aperture size. Superior resolution capabilities achieved with this method are shown by simulation results in comparison with the standard MUSIC for incoherent signals incident on a uniform circular array.

In this paper, we present a group communication protocol that achieves total ordering message delivery for mobile computing systems with multiple overlapping groups. Our mechanism is an efficient adaptation of the propagation-tree technique to the mobile computing environments. It takes advantages of the capability of stationary mobile support stations to overcome the deficiencies associated with mobile devices. We construct the propagation tree based on the stationary stations, rather than the mobile hosts. As a result, mobile hosts are relieved of the excessive load of forwarding messages and communications on wireless channels are confined to transmitting messages to destination processes. This is important considering that the bandwidth of the wireless channels is limited. Moreover, the proposed protocol employs a mechanism to synchronize transmissions within a wireless cell. This serves to avoid redundant transmissions of a message in a wireless network in an attempt to achieve better utilization of the network bandwidth. Our mechanism relies on a handoff operation to deal with mobility of mobile devices. The handoff procedure ensures a smooth integration of a mobile host into a new cell, while preserving reliability of communication and the total ordering property of message delivery.

We attempt to achieve corporative behavior of autonomous decentralized agents constructed via Q-Learning, which is a type of reinforcement learning. As such, in the present paper, we examine the piano mover's problem including a find-path problem. We propose a multi-agent architecture that has an external agent and internal agents. Internal agents are homogenous and can communicate with each other. The movement of the external agent depends on the composition of the actions of the internal agents. By learning how to move through the internal agents, avoidance of obstacles by the object is expected. We simulate the proposed method in a two-dimensional continuous world. Results obtained in the present investigation reveal the effectiveness of the proposed method.

In this paper, we will propose a robust watermarking system for digital audio sound to protect the copyright of publication and claim of ownership. The proposed watermarking scheme uses the frequency extent between 1 Hz and 20 Hz, which cannot be heard by the unaided human ear, to embed the watermark. Thus, the original audio quality will not be influenced by the watermark. Currently, the techniques of Perceptual Audio Coder contain MPEG-1, -2, -2.5, MPEG-2 AAC, MPEG-4 AAC and Window Media Audio. From experimental results, the proposed watermarking system can resist attacks of previous audio coders and low bit-rate compression. The watermark is extracted with 100% correction after previous encoder attacks. Furthermore, to authenticate the audio signal, the system can quickly extract the watermark without the knowledge of original audio signals.

Cutoff rate of m-ary PPM is derived for an avalanche photodiode (APD) based receiver. The cutoff rate is compared among m=8-256 under the condition of the same total signal energy in 256 slots, where the effects of the timing jitter and atmospheric turbulence are included. Numerical results are shown for the illustrative examples of the cutoff rate.

Automotive fuel pumps are driven by small DC motor. Commutation is carried out in gasoline, and arc voltage and duration are different from that in air. Our laboratory have analyzed commutation phenomenon in gasoline quantitatively and we have considered brush materials. To develop high power motor, we need to examine materials that are less arc abrasion and good sliding condition. In this research, we attend to characteristics of flat carbon commutator. As a result, it is possible to drive longer time, like established cylindrical copper commutator.