Recently, dielectric lens antennas are paid attentions in ITS applications. Many lens shape designing methods were already developed. And electrical performances were estimated through a ray tracing method. Here, arbitral lens shapes were expressed by a system of power series. In the case of ray tracing, time-consuming three-coordinate root-finder programs were needed to find intersection points of rays on the lens surfaces. In order to calculate complicated structures such as zoned lenses and complicated rays such as multiple reflections between lens surfaces, simple ray tracing methods are requested. In this paper, a simple ray tracing method that utilizes directly designed discrete points of lens surfaces is developed. In this method, a refracted ray is automatically determined for a given incident ray. As for an intersecting point of a lens surface for an outgoing ray, the nearest point to the refracted vector is found out by employing a simple searching procedure. This method is time-saving compared to the previous three-coordinate root-finding program. Through calculated results of focal points and radiation patterns in wide angle beam steering, effectiveness of a developed method is ensured. Application of the developed ray tracing method of complicated multiple reflections are studied. Reflecting points are found out speedily by the same searching procedure. A calculated example of doubly reflected rays is obtained. Through comparing calculated and measured results of wide angle radiation patterns, effectiveness of a developed method is ensured.

In this study, nonlinear wave phenomena related to transmissions and reflections of the phase-inversion waves around a discontinuity of a coupled system consisting of two kinds of arrays of van der Pol oscillators are investigated. By computer simulations, behavior of the phase-inversion waves around the discontinuity in the coupled system is classified into eight types. Further, the mechanisms of the transmission and the reflection of a phase-inversion wave at the discontinuity are explained. Circuit experiments confirm the simulated results.

This paper deals with the problem of multiple object tracking with the condensation algorithm, applied to tracking of soccer players. To solve the problem of failures in tracking multiple players under overlapping, we introduce occlusion alarm probability, which attracts or repels particles based on their posterior distribution of previous time step. Real experiments showed a robust performance.

Scattering of the two dimensional electromagnetic waves is studied by the infinite sequences of zeros arising on the complex plane, which just correspond to the null points of the far field pattern given as a function of the azimuthal angle θ. The convergent sequences of zeros around the point of infinity are evaluated when the scattering objects are assumed to be N-polygonal cylinders. Every edge condition can be satisfied if the locations of zeros are determined appropriately. The parameters, which allow us to calculate the exact positions of zeros, are given by the asymptotic analysis. It is also shown that there are N-directions of convergence, which tend to infinity. An illustrative example is presented.

We study the statistical multiplexing performance of self-similar traffic. We consider that input streams have different QoS (Quality of Service) requirements such as loss and delay jitter. By applying the FBM (fractal Brownian motion) model, we present methods of estimating the effective bandwidth of aggregated traffic. We performed simulations to evaluate the QoS performances and the bandwidths required to satisfy them. The comparison between the estimation and the simulation confirms that the estimation could give rough data of the effective bandwidth. Finally, we analyze the bandwidth gain with priority multiplexing against non-prioritized multiplexing and suggest how to get better performance with the right configuration of QoS parameters.

In this letter, we analyze blocking probabilities for prioritized multi-classes in optical burst switching (OBS) networks. The blocking probability of each traffic class can be analytically evaluated by means of class aggregation and iteration method. The analytic results are validated with results garnered from simulation tests.

In this paper, we propose the Synchronized Mobile Multicast (SMM) scheme for the real-time multimedia service to achieve three most important characteristics that the traditional Home Subscription (HS) and Remote Subscription (RS) mobile schemes cannot support. First, the SMM scheme supports the scalable one-to-many and many-to-many synchronized multimedia multicast on mobile IP networks to achieves seamless playback of continuous media streams even when both the mobile sender and receivers handoff simultaneously. Second, it analyzes the minimal buffer requirements of the mobile sender, the core router, the foreign agents and the mobile receivers in the multicast tree and formulates the initial playback delay within a handoff Guarantee Region (GR). Further, combined with the fine granularity scalability (FGS) encoding approach in the MPEG-4 standard, the SMM scheme achieves superior multimedia QoS guarantees and unlimited numbers of handoffs of the mobile sender and receivers only at the cost of degraded video quality for a short period after handoff with minimal extra bandwidth.

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).

We propose a new end-to-end transport protocol called Multi-path Transmission Control Protocol (M/TCP) and its two robust acknowledgement (ACK) schemes. Our protocol is designed as an alternative TCP option to improve reliability and performance of the Internet. The M/TCP sender simultaneously transmits data via multiple controlled paths to the receiver. Our protocol requires no modification in IP layer. Two M/TCP endpoints establish multiple paths between them by subscribing to multiple ISPs. The two robust ACK schemes proposed in this paper aim at improving M/TCP performance over the Internet with high packet loss in ACK channels. Performances between our protocol and TCP Reno are compared in terms of throughput and fairness by using ns2 simulator. Simulation results indicate that M/TCP achieves higher throughput than TCP Reno in situation of random drop and burst traffic with small buffer size. When there is network congestion on reverse path, M/TCP with the proposed robust ACK schemes performs better than M/TCP with the conventional immediate ACK scheme.

This paper presents novel algorithms for image restoration by state sharing methods with the stochastic model. For inferring the original image, in the first approach, a degraded image with gray scale transforms into binary images. Each binary image is independently inferred according to the statistical fluctuation of stochastic model. The inferred images are returned to a gray-scale image. Furthermore the restored image is constructed from the average of the plural inferred images. In the second approach, the binary state is extended to a multi-state, that is, the degraded image with Q state is transformed into n images with τ state and image restoration is performed. The restoration procedure is described as follows. The degraded image with Q state is prepared and is transformed into n images with τ state. The n images with τ state are independently inferred by the stochastic model and are returned to one image. Moreover the restored image is constructed from the average of the plural inferred images. Finally, the properties of the present approaches are described and the validity of them is confirmed through numerical experiments.

The purpose of this research is to show that the stress during the VDT task could be evaluated using the chaotic features for the focal accommodation system and the pupil area. The result of this experiment shows that the fractal dimension for the pupil area can be used to evaluate the stress during the VDT task. Moreover, it is shown that the chaotic property in the fixed target measurement is higher than that in the linear control and step control measurements. However, the first Lyapunov exponent hardly changed over time for all of three accommodation measurements.

In a severe frequency-selective fading channel, the bit error rate (BER) performance of orthogonal multicode DS-CDMA is severely degraded since the orthogonality property of spreading codes is partially lost. The frequency-selectivity of a fading channel can be exploited by using frequency-domain equalization to improve the BER performance. Further performance improvement can be obtained by using transmit diversity. In this paper, joint transmit diversity and frequency-domain equalization is presented for the reception of orthogonal multicode DS-CDMA signals in a frequency-selective fading channel. As for transmit diversity, delay transmit diversity (DTD) and frequency-domain space-time transmit diversity (STTD) are considered. The achievable BER performance of multicode DS-CDMA in a frequency-selective Rayleigh fading channel is evaluated by computer simulation. It is shown that the frequency-domain STTD significantly improves the BER performance irrespective of the degree of the channel frequency-selectivity while DTD is useful only for a weak frequency-selective channel.

Integrating Multi Protocol Label Switching (MPLS) and Mobile IP (MIP) protocols is a challenge to support Quality of Services (QoS) as well as mobility. Existing approaches may suffer from (1) high blocking rate and handover delay due to the path re-establishment, and (2) twice MPLS label PUSH and POP procedures due to the triangle routing. In this paper, we propose a novel approach to integrating MPLS and MIP. The proposed approach maintains an efficient QoS path and solves the above drawbacks. We also design a path extension procedure to reduce blocking probability and a path optimization procedure to maintain the shortest transmission path under delay constraints with the lowest cost. The simulation results show that the proposed approach reduces handover delay, connection dropping rate, and data loss rate comparing to the original MIPs over MPLS. Furthermore, we can also tune the system performance using an extension counter for the trade-off between management cost and data transmission delay.

This paper presents a mobility management scheme that combines host-based routing (HBR) with prefix routing to achieve balanced loading of network nodes in a distributed hierarchically arranged mobile IPv6 access network. This allows the higher-level nodes to be less loaded than in pure host based routing schemes, where the root node presents a capacity bottleneck to the system. As a result, this scheme achieves good savings in memory by reducing host-specific caches, and thus enhances network scalability. A direct consequence of reduced database entry is reduced processing latencies at the nodes, which reduces delay and improves on network performance. Our hybrid HBR scheme performs better than the pure HBR schemes in memory conservation and increased network capacity.

This paper deals with an on-line identification method based on a radial basis function (RBF) network model for continuous-time nonlinear systems. The nonlinear term of the objective system is represented by the RBF network. In order to track the time-varying system parameters and nonlinear term, the recursive least-squares (RLS) method is combined in a bootstrap manner with the genetic algorithm (GA). The centers of the RBF are coded into binary bit strings and searched by the GA, while the system parameters of the linear terms and the weighting parameters of the RBF are updated by the RLS method. Numerical experiments are carried out to demonstrate the effectiveness of the proposed method.

This paper deals with the chaoticity and fractality analysis of price time series for artificial stock market generated by the multi-agent systems based on the co-evolutionary Genetic Programming (GP). By simulation studies, if the system parameters and the system construction are appropriately chosen, the system shows very monotonic behaviors or sometime chaotic time series. Therefore, it is necessary to show the relationship between the realizability (reproducibility) of the system and the system parameters. This paper describe the relation between the chaoticity of an artificial stock price and system parameters. We also show the condition for the fractality of a stock price. Although the Chaos and the Fractal are the signal which can be obtained from the system which is generally different, we show that those can be obtained from a single system. Cognitive behaviors of agents are modeled by using the GP to introduce social learning as well as individual learning. Assuming five types of agents, in which rational agents prefer forecast models (equations) or production rules to support their decision making, and irrational agents select decisions at random like a speculator. Rational agents usually use their own knowledge base, but some of them utilize their public (common) knowledge base to improve trading decisions. By assuming that agents with random behavior are excluded and each agent uses the forecast model or production rule with most highest fitness, those assumptions are derived a kind of chaoticity from stock price. It is also seen that the stock price becomes fractal time series if we utilize original framework for the multi-agent system and relax the restriction of systems for chaoticity.

This paper presents a technique for the variation of hysteresis band in delta-sigma modulation. A sinusoidal, and a random hystersis band are combined to achieve an optimal performance in terms of constant switching frequency and the harmonic spikes. The sinusoidal hysteresis band technique produces a constant switching frequency while the random hysteresis band suppresses the harmonic spikes. The effects of various variations of hysteresis band on the harmonic spectrum characteristic were described. The technique is experimented in a single-phase inverter and the harmonic peaks and the distortion of output voltage were used to measure the performance of the proposed technique.

The hardware implementation of a neural network model using stochastic logic has been able to integrate numerous neuron units on a chip. However, the limitation of applications occurred since the stochastic neurosystem could execute only discrete-time dynamics. We have contrived a neuron model with continuous-time dynamics by using stochastic calculations. In this paper, we propose the circuit design of a new neuron circuit, and show the fabricated neurochip comprising 64 neurons with experimental results. Furthermore, a new asynchronous updating method and a new activation function circuit are proposed. These improvements enhance the performance of the neurochip greatly.

Single electron devices are ultra low power and extremely small devices, and suitable for implementation of large scale integrated circuits. Artificial neural networks (ANNs), which require a large number of transistors for being to be applied to practical use, is one of the possible applications of single electron devices. In order to simplify a single electron circuit configuration, we apply stochastic logic in which various complex operations can be done with basic logic gates. We design basic subcircuits of a single electron stochastic neural network, and confirm that backgate bias control and a redundant configuration are necessary for a feedback loop configuration by computer simulation based on Monte Carlo method. The proposed single electron circuit is well-suited for hardware implementation of a stochastic neural network because we can save circuit area and power consumption by using a single electron random number generator (RNG) instead of a conventional complementary metal oxide semiconductor (CMOS) RNG.

A directional audible sound can be generated by amplitude-modulated (AM) into ultrasound wave from a parametric array. To synthesize audio signals produced by the self-demodulation effect of the AM sound wave, a quasi-linear analytical solution, which describes the nonlinear wave propagation, is developed for fast numerical evaluation. The radiated sound field is expressed as the superposition of Gaussian Beams. Numerical results are presented for a rectangular parametric loudspeaker, which are in good agreement with the experimental data published previously.