This paper studies the local Poisson property of aggregated IP traffic. First, it describes the scenario where IP traffic presents a Poisson-like characteristic within some limited range of time scales when packets from independent traffic streams are aggregated. Each of the independent traffic streams corresponds to a series of correlated IP packets such as those of a transport connection. Since the Poisson-like characteristic is observed only within some limited range of time scales, we call this characteristic the local Poisson property. The limited range of time scales of the local Poisson property can be estimated from a network configuration and characteristics of transport connections. Second, based on these observations, we seek the possibility to apply an ordinary Poisson process to evaluation of the packet loss probability in IP networks. The analytical investigation, where IP traffic is modeled by a superposition of independent branching Poisson processes that presents the local Poisson property, suggests that the packet loss probability can be estimated by a finite-buffer queue with a Poisson process when the buffer size is within a certain range. The investigation is verified by simulations. These findings expand the applicability of conventional Poisson-based approaches to IP network design issues.

We propose an auto-mesh generation algorithm for 3-Dimensional elliptic model on acoustic analysis of the vocal tract. We mesh the vocal tract and compute the vocal tract transfer function (VTTF) using Finite Element Method (FEM). We show there is little difference between the VTTF using our algorithm and that of the manual mesh, especially for vowel /a/. We show that the number of nodes is depended on the shape of the cross section of the vocal tract. Furthermore we compute the VTTF of the vocal tract with variable shape continuously.

Recently, diverse multimedia applications with stringent multiple Quality of Service (QoS) requirements have been increasing. In particular, multicast communication has become more popular because of its availability and for efficient use of network resources. Most multicasts are point-to-multipoint, in which a source delivers data to multiple designated recipients, such as for video or audio distribution. In the near future, multipoint-to-multipoint communication services, including multimedia collaborations such as video conferencing and distant-learning, will be developed. However, when a conventional multicast routing algorithm is applied to a multipoint-to-multipoint communication service, it might result in excessive traffic concentration on some links. Therefore, we propose a new multipoint-to-multipoint routing method. It utilizes the Fallback+ algorithm to perform multicast routing for the purpose of satisfying multiple QoS requirements and alleviating traffic concentrations. Simulation experiments show that our method improves traffic load balance and achieves efficient use of network resources.

A pilot needs operational information about wind over sea as well as wave height to provide safety of hydroplane landing on water. Near-surface wind speed and direction can be obtained with an airborne microwave scatterometer, a radar designed for measuring the scatter characteristics of a surface. Mostly narrow-beam antennas are applied for such wind measurement. Unfortunately, a microwave narrow-beam antenna has considerable size that hampers its placement on flying apparatus. In this connection, a possibility to apply a conventional airborne radar altimeter as a scatterometer with a nadir-looking wide-beam antenna in conjunction with simultaneous range Doppler discrimination techniques for recovering the wind vector over sea at low speed of flight is discussed, and measuring algorithms of sea surface wind speed and direction are proposed. The principle considered and algorithms proposed in the paper can be used for creation an airborne radar system for operational measurement of the sea roughness characteristics and for safe landing of a hydroplane on water.

Mobile location can be achieved by using the time-of-arrival (TOA) and angle-of-arrival (AOA) measurements. In this Letter, we analyze the location accuracy of an TOA-AOA hybrid algorithm with a single base station in the line-of-sight scenario. The performance of the algorithm is contrasted with the Cramer-Rao lower bound and Federal Communications Commission Emergency 911 requirements.

A novel periodic element for the sandwich photonic bandgap (PBG) structure named as H-shape element is presented in this paper. Sandwich PBG structure is a kind of PBG structure whose periodic lattice is buried in the midmost of the substrate. There's no requirement to drill or suspend the substrate. The new H-shape element is made of a central block connected with a long and narrow block on either side, and possesses a quite deep forbidden gap, whose width and depth can be tuned by varying the dimension of the central block. Theoretical results, as confirmed experimentally, indicate that the maximum insertion loss in the stopband is up to 80 dB. This sandwich microstrip structure can be constructed using conventional printed-circuit-board fabrication processes and integrated with other microwave components in a multilayered circuit. An improved notch filter with chirped central blocks is presented. The length of the filter is reduced by 16.7%, and the fractional bandwidth is increased by 8.1% compared with that of a conventional sandwich microstrip notch filter on the same substrate. The experimental results agree well with the finite difference time domain (FDTD) simulations.

In this paper, a joint adaptive interference canceller (AIC) and maximum likelihood (ML) decoder scheme is proposed for a space-time coded DS-CDMA system with the difference between arrival times from transmit antennas. As the arrival time difference causes not only ISI and MAI, but also inter-antenna interference, performance degradation in the space-time coded DS-CDMA system is more severe than that of a regular DS-CDMA system with single transmit antenna. To mitigate the effect of the interference during space-time decoding, a joint algorithm for the proposed scheme merges adaptation process of the AIC into a ML decoding algorithm. Performance of the proposed scheme is evaluated for QPSK space-time trellis codes with two transmit antennas. It is shown that the proposed scheme achieves better performance than the conventional ML decoding scheme.

We present a design and implementation of a QoS control mechanism in an Adaptive Multimedia Communication System (AMCS) using multiagent-based computing technology. In this paper, we first define functional requirements for AMCS. Subsequently we describe the design and implementation of AMCS with a knowledge-based multiagent framework to fulfill the functional requirements. Moreover we evaluate the adaptability of the prototype systems of AMCS with the operational situations observed in its experiments. From the result of the experiments, we conclude that the multiagent-based design and implementation is reasonable for construction of AMCS.

In this letter, we take advantage of both types of Interactive and Batch services by considering a hybrid multimedia-on-demand (MOD) system which provides both services. Also, we propose two serving methods with an incentive charging scheme to optimize the coexistence of both services. Numerical results show that the proposed hybrid system outperforms both individual systems. In particular, the system provider receives more revenue by serving more users concurrently, while the users have a better viewing experience due to higher availability of contents.

A computed torque controller for a dynamic model of nonholonomic mobile robots with bounded external disturbance is proposed to treat the adaptive tracking control problem using the separated design method. A velocity controller is first designed for the kinematic steering system to make the tracking error approaching to zero asympotically. Then, a computed torque controller is designed such that the true mobile robot velocity converges to the desired velocity controller. In each step, the controllers are designed independently, and this will simplify the design of controllers. A novel stability analysis involving the estimation of some differential inequalities is also given to guarantee the stability of the closed-loop system. Moreover, the regulation problem and the tracking problem will be treated using the proposed controller. In particular, the mobile robots can globally follow any path such as a straight-line, a circle and the path approaching to the origin. Furthermore, the problems of back-into-garage parking and the parallel parking problem can also be solved using the proposed controller. Some interesting simulation results are given to illustrate the effectiveness of the proposed tracking control law.

Binary and ternary 5-bit programmable dispersion matrix, based on fiber Bragg reflectors, is built to control a two-channel receive/transmit beamformer at 1550 nm. RF phase measurements for the 32/31 delay configurations are presented. The programmable dispersion matrix is fully demonstrated and characterized for RF signals from 0.2 to 1 GHz.

This paper proposes a real-time scheduling mechanism for web server that finds a way to solve so-called priority inversion problem between tasks handling real-time web requests with higher priorities and tasks with lower priorities like HTML requests. The priority inversion problem of web server stems from operating two independent schedulers, web scheduler and kernel scheduler, without exchanging scheduling information or considering the requirement of each other. In the proposed mechanism, two schedulers are integrated in a kernel and the integrated scheduler schedules real-time web tasks and other application tasks together based on their priorities. Since the unified scheduler sees all tasks simultaneously in system, it can schedule the tasks with their absolute priorities and reduce the execution delay caused by the priority inversion. The proposed mechanism provides web server with a better chance to efficiently serve real-time web requests. The feasibility and performance of the proposed mechanism are empirically shown on an embedded system.

The complexities of many previous scheduling algorithms for IRIS tasks are too high to apply them to practical systems handling many tasks. The high complexities stem from the fact that the algorithms perform scheduling on all tasks in a system, producing an optimal solution. As a way to reduce the complexity of scheduling, we propose a heuristic on-line scheduling algorithm that schedules the IRIS tasks only in a scheduling window, producing a sub-optimal solution. A scheduling window contains W important tasks determined by a selection policy. The performance of the proposed algorithm is verified by simulation.

User authentication is necessary on the Internet and in mobile communications to protect the legal user's rights. One-time password authentication methods change the verifier every time by sending the present verifier along with the next verifier. However, such methods risk impersonation attacks because those protocols use two verifiers every session. The OSPA (Optimal Strong-Password Authentication) method is a one-time password method which prevents stolen-verifier problems, replay attacks, and denial of service attacks. In this letter, we devise an impersonation attack on the OSPA method and discuss how to break down the OSPA method.

In provisioning packet data service on wireless cellular networks, a scheme of altering connection status between mobile and base stations appeared with an effort to utilize resource during idle periods. A critical issue in such scheme of sojourn and transition on the connection states is to determine a maximum time to sojourn at each state. An excessive sojourn time leads to resource invasion by inactive stations, while a high cost of re-establishing connection components is imposed by an insufficient sojourn. Thus, the maximum sojourn times must be optimized in consideration of the two conflicting arguments. In this paper, we consider a generic scheme of connection status transitions and formulate a decision problem to determine maximum sojourn times by introducing a loss function which reflects the cost of connection re-establishment as well as the loss induced by inefficient resource usage. From the decision problem, we derive an optimal value for maximum sojourn time, identified as Bayes rule, by observing the delay time of last packet to have posterior information about the length of upcoming idle period. From the analytical results, we show the Bayes sojourn time is trivial under a constraint on loss coefficients when packet arrivals follow a Poisson process.

Adaptive Battery Conservation Management (ABCM), an effective form of power conservation for mobile terminals in an always-connected environment, was proposed and evaluated in a previous published work. The ABCM method employs three states: active, dormant, and the Battery Saving Mode (BSM). The BSM is defined as a battery-saving state; in the BSM, the mobile terminal saves power by intermittently receiving paging notifications via a paging channel between the packet bursts of a session. Two control parameters, the sleep-timer and paging interval, are set up according to packet class and are the keys to the performance of a system with this method. In real-time communications, a long sleep-timer and short paging interval are selected to minimize buffering delay. In non-real-time communications, on the other hand, a short sleep-timer and long paging interval are chosen to reduce power consumption by the mobile terminal. Our previous evaluation showed that the method is effective as a means for power conservation in non-real-time communications. In real-time communications, on the other hand, the ABCM method provides shorter buffering delays and the same battery-conservation performance as the conventional method. To further improve the ABCM method's performance, we now propose an enhanced ABCM method that employs multiple BSM sub-modes, each of which has a different paging interval. As dormant periods become longer, the mobile terminal makes transition to successive sub-modes, each of which has a longer interval than the previous one. In this paper, we evaluate the battery conservation effect of the ABCM method through theoretical analysis and computer simulation. Numerical evaluation indicates that the ABCM method will be suitable for the broadband multimedia packet-radio systems of the future.

In this paper, to enhance the power efficiency a new simple space-time coding scheme is devised with application to the OFDM based Wireless LAN system. The basic idea is from the receiver's point of view and is referred to as Virtual Constellation Mapping (VCM). We designed a new combination of the channel coding (Turbo Code) along with multiple transmit antennas (Two antennas) to achieve transmit diversity and space division multiplexing transmission. Computer simulation results showed that with the same transmission data rate, our proposed scheme can achieve better bit error rate (BER) compared with the conventional space-time trellis coded OFDM scheme in high Doppler fading channels.

A field trial, within a suburban macro-cell environment, of a space-time (ST) equalizer for TDMA mobile communication systems is described. The ST equalizer was a cascade connection of two array processors for a four-antenna array and a two-branch-metric-combining maximum-likelihood sequence estimation (MLSE) that was designed to obtain full space- and path-diversity gains from first-arrival and one-symbol-delayed signals while suppressing excessively long-delayed inter-symbol interference (ISI). The radio frequency was 3.35 GHz, the transmission rate was 4.096 Mb/s, and the modulation was QPSK. The long-delayed ISI reduction and the space-path diversity effect of the ST equalizer was validated by Eb/N0 vs. bit-error-rate (BER) curves with respect to delay spread and antenna spacing as compared with the case of an array processor alone being used.

This paper discusses formal modeling and performance evaluation for a type of dynamic change of workflow, called Migrate. Workflow means the flow of work and is designed to process similar instances, called cases. Companies need to continuously refine their current workflow in order to adapt them to various requirements. The change of a current workflow is called dynamic change of the workflow. Before changing a workflow, there exist cases in the workflow. If these cases are ignored or fall into deadlock, the changed workflow would become inconsistent. Since Ellis et al. proposed three change types, Flush, Abort, and Synthetic Cut-Over that keep consistency of workflows in 1995, various change types have been proposed, in which there is a promising change type called Migrate that is proposed by Sadiq et al. Sadiq et al. proposed the concept of Migrate, but did not give a formal model of Migrate. Meanwhile, we have proposed a measure, called change time, in order to evaluate dynamic change of workflows, and used this measure to evaluate the performance on change time for Ellis et al. 's three change types. However, the performance evaluation on change time for Migrate has not been done. In this paper, we first give a Petri-nets-based model of Migrate. Then we present a method of computing change time based on the net model. Finally, we apply the method to 270 examples and show the comparison results between Migrate and Ellis et al. 's three change types.

Arc duration of silver contacts was measured with fixed short gap under the condition of different constant gaps and different constant currents, which are close to the minimum arc current of the contact material. The results indicated that the arc occurred even at the current less than the minimum arc current. The arc duration varies in different operations at the same testing condition and it distributes exponentially in the time range up to 100 microseconds. The time constant τ and the extinction rate λ of the distribution were calculated, and related to the arc current. It was assured by silver electrode arc that, even below the so-called minimum arc current, arc ignition may occur but, in this case, the arc duration is momentary, and, as the arc current decreases, the arc extinction rate becomes large.