The blind separation problem of analog modulated radio signals and their DOA (Direction Of Arrival) estimation problem are considered. These problems are very important in radio surveillance. Based on the idea of Carlos and Takada [1], the following two methods are proposed for an Independent Component Analysis (ICA) based radio surveillance system. The first method is concerned with the improvement of DOA estimation accuracy after signal separation by ICA. Another method treats separation and DOA estimation in multipath environment. The effectiveness of the proposed methods is proved by computer simulation.

This paper highlights some of our recent research efforts in designing and evaluating life-like characters that are capable of entertaining affective and social communication with human users. The key novelty of our approach is the use of human physiological information: first, as a method to evaluate the effect of life-like character behavior on a moment-to-moment basis, and second, as an input modality for a new generation of interface agents that we call 'physiologically perceptive' life-like characters. By exploiting the stream of primarily involuntary human responses, such as autonomic nervous system activity or eye movements, those characters are expected to respond to users' affective and social needs in a truly sensitive, and hence effective, friendly, and beneficial way.

The presence of the complex scaling behavior in network traffic makes accurate traffic prediction a challenging task. Some conventional prediction tools such as the recursive least square method are not appropriate for network traffic prediction. In this paper we propose a timescale decomposition approach to real time traffic prediction. The raw traffic data is first decomposed into multiple timescales using the à trous Haar wavelet transform. The wavelet coefficients and the scaling coefficients at each scale are predicted independently using the ARIMA model. The predicted wavelet coefficients and scaling coefficient are then combined to give the predicted traffic value. This timescale decomposition approach can better capture the correlation structure of the traffic caused by different network mechanisms, which may not be obvious when examining the raw data directly. The proposed prediction algorithm is applied to real network traffic. It is shown that the proposed algorithm outperforms traffic prediction algorithms in the literature and gives more accurate results.

The problem of aggregating different stochastic process into a unique one that must be characterized based on the statistical knowledge of its components is a key point in the modeling of many complex phenomena such as the merging of traffic flows at network nodes. Depending on the physical intuition on the interaction between the processes, many different aggregation policies can be devised, from averaging to taking the maximum in each time slot. We here address flows averaging and maximum since they are very common modeling options. Then we give a set of axioms defining a general aggregation operator and, based on some advanced results of functional analysis, we investigate how the decay of correlation of the original processes affect the decay of correlation (and thus the self-similar features) of the aggregated process.

Seasonal ARIMA model is a good traffic model capable of capturing the behavior of a network traffic stream. In this paper, we give a general expression of seasonal ARIMA models with two periodicities and provide procedures to model and to predict traffic using seasonal ARIMA models. The experiments conducted in our feasibility study showed that seasonal ARIMA models can be used to model and predict actual wireless traffic such as GSM traffic in China.

This paper proposes a Generalized Traffic Engineering Protocol (GTEP). GTEP is a protocol that permits communication between a Path Computation Element (PCE) and a Generalized Multi-Protocol Label Switching (GMPLS) controller (CNTL). The latter is hosted by each GMPLS node; it handles GMPLS and MPLS protocols such as routing and signaling protocols as well as controlling the GMPLS node host. The PCE provides multi-layer traffic engineering; it calculates Label Switched Path (LSP) routes and judges whether a new lower-layer LSP should be established. GTEP functions are implemented in both the PCE and GMPLS router. We demonstrate a multi-layer traffic engineering experiment conducted with GTEP.

A new expression for cell/packet loss probability in an ATM and packet switched queue system with a finite buffer is presented. Cell and packet loss analysis is based on the new concept of a "buffer overflow cluster" and the overflow probability for a queue with an infinite buffer. This approach holds for a wide variety of long-range dependent traffic sources typical of wide-area networks, as well as Internet and other communication traffics. The method is verified by simulations of two long-range dependent traffic scenarios: fractional Gaussian noise and multifractal wavelet model traffic with a beta marginal distribution.

In this paper, a design alternative for guaranteeing short-term QoS in the E-PON (Ethernet-Passive Optical Network) OLT (Optical Line Terminal) node is studied. A scheduling algorithm called Short-term QoS Deficit Round Robin (SQ-DRR) is proposed to guarantee tunable deterministic QoS constraints for multimedia applications over E-PON. The major appealing aspect of the scheduler is that it guarantees delay constraint for short-term aggregate burst traffic violating pre-contracted descriptors at the same time without loosing long-term fairness. We then evaluate the scheduler performance with and without admission control scheme under non-stationary long-range dependence (LRD) traffic. The simulation results indicate that the SQ-DRR performs well in dynamic burst traffic conditions.

To guarantee QoS for multicast transmission, admission control for multicast sessions is expected. Probe-based multicast admission control (PBMAC) scheme is a scalable and simple approach. However, PBMAC suffers from the subsequent request problem which can significantly reduce the maximum number of multicast sessions that a network can admit. In this letter, we describe the subsequent request problem and propose an enhanced PBMAC scheme to solve this problem. The enhanced scheme makes use of complementary probing and remarking which require only minor modification to the original scheme. By using a fluid-based analytical model, we are able to prove that the enhanced scheme can always admit a higher number of multicast sessions. Furthermore, we present validation of the analytical model using packet based simulation.

Animation video is becoming very popular with the availability of low cost computing resources. The cell animation is a popular method, used for producing animation video. In order to efficiently encode these videos, conventional video codecs, such as AutoDesk Animation Pro FLC, Intel Indeo 5, and MPEG-4 can be used to achieve high compression. However, when cell animation videos are compressed at very low bit rate by these traditional codecs, objectionable artifacts, e.g., false color, blurred contours, and blocking artifact, are severely occurred. In this paper, we propose an efficient compression method for cell animation images. The proposed method employs hybrid coding scheme which includes intraframe and interframe coding modes. The intraframe mode consists of color quantization, adaptive differential pulse code modulation, forward classification, and Golomb-Rice coding. The interframe coding consists of block-based techniques and exploits the characteristics of motion. Simulation results show that the proposed method provides superior performance over AutoDesk Animation Pro FLC, MPEG-1, Intel Indeo 5, and MPEG-4 standards.

In this paper, we propose an adaptive compensation algorithm to compensate cell delay variation (CDV) occurring during ATM/TDMA transition in a satellite ATM network. The proposed CDV compensation algorithm uses two types of additional information: cell position information (Cp)--indicating the number of cells (N) arriving within a control unit time (Tc) and positions of cells at a given time--and the number of cells in bursts--to take into account the characteristics of localized bursts. To evaluate the performance of the proposed algorithm, we performed a computer simulation based on an OPNET environment, using the Markov modulated Poisson process (MMPP) traffic model and assessed its effectiveness from varied standpoints. The results of the performance testing indicate that the proposed algorithm, while requiring significantly less additional information than previous CDV compensation algorithms, is able to more efficiently compensate CDV in localized burst traffic than the previous ones.

The shared time division multiplexing (shared-TDD) scheme has been proposed to accommodate asymmetric communications between uplink and downlink. The accommodation of connection-less services in Shared-TDD systems causes a difficulty of TDD boundary control. This paper proposes a TDD boundary control (resource assignment) scheme, which can optimize a position of the TDD boundary based on the ratio of uplink to downlink traffic in code division multiple access (CDMA)/shared-TDD systems with connection-less services. The proposed scheme controls the TDD boundary based on the estimated uplink and downlink traffic. Computer simulations show that the proposed scheme effectively controls the radio resource, and thus improves total system throughput performance.

This paper proposes a partial order reduction algorithm for timed trace theoretic verification in order to detect both safety failures and timing failures of timed circuits efficiently. This algorithm is based on the framework of timed trace theoretic verification according to the original untimed trace theory. Consequently, its conformance checking supports hierarchical structure when verifying timed circuits. Experimenting with the STARI and DME circuits, the proposed approach shows its effectiveness.

Radio resource is the bottleneck for current multimedia wireless networks. Intelligent traffic control strategies can be enforced to optimize resource allocation so as to enhance network performance. In this study, dynamic control scheme for non-real-time traffic and autonomic control schemes for multimedia traffic are proposed to guarantee the required quality of service (QoS) in the inference-dominated high-speed wireless environment. Both handoff priority and terminal mobility are also taken into consideration. The performance of the state-dependent multidimensional birth-death process is derived by the efficient matrix-analytic methods (MAMs). Compared with the previous results, this paper shows that the proposed control methods can be used for both real-time and non-real-time multimedia traffic in order to meet the required performance without degrading the quality of multimedia services. These results are also important for the design of evolving multimedia wireless systems as well as network optimization.

In QoS routing, load balancing routing algorithm for long-lived traffic can be used efficiently to minimize the number of routing update, control traffic overhead and computational overhead which mainly come from network traffic fluctuation. The congestion problem from short-lived traffic is however difficult to handle. A simple and robust algorithm is needed for short-lived traffic to reduce the traffic loss probability. In the paper, we proposed a new hybrid routing schemes for short-lived traffic and long-lived traffic. An alternate routing algorithm is applied for the short-lived traffic when congestion occurs. We restricted the number of additional hops in the path to minimize the negative effect of alternate routing algorithm. The proposed algorithm reduces packet loss probability from 0.6% to 1.7% under various link utilizations. We also compare our proposed algorithms with and without crank-back.

In this study, a cascade open-short-thru (COST) de-embedding procedure is proposed for the first time for on-wafer device characterization in the RF/microwave frequency regime. This technique utilizes the "open" and "short" dummy structures to de-embed the probe-pad parasitics of a device-under-test (DUT). Furthermore, to accurately estimate the input/output interconnect parasitics, including the resistive, inductive, capacitive, and conductive components, the "thru" dummy device has been characterized after probe-pad de-embedding. With the combination of transmission-line theory and cascade-configuration concept, this method can efficiently generate the scalable and repeatable interconnect parameters to completely eliminate the redundant parasitics of the active/passive DUTs of various device sizes and interconnect dimensions. Consequently, this method is very suitable for the on-wafer automatic measurement.

In this paper we consider algorithms for the logical topology design and traffic grooming problem in WDM networks with router interface constraints as well as optical constraints. The optical constraints include restricted transmission range due to optical impairments as well as limits on the number of available wavelengths. We formulate this problem as an integer linear program which is NP-complete. We then introduce heuristic algorithms which use a graphical modeling tool called the Virtual Neighbor Graph and add lightpaths sequentially. The best performing heuristic uses a so-called Resource Efficiency Factor to determine the order in which paths are provisioned for the traffic demands. By giving priority to demands that can be routed over paths that make efficient use of network resources, it is able to achieve good performance both in terms of weighted hop count and network throughput. For finding optimal multi-hop paths sequentially, we introduce interface constraint shortest path problem and solve it using minimum weight perfect matching.

Hydrogenated germanium films were fabricated in the thickness range of 7-98 nm on SiO2 at 150 by an rf glow discharge decomposition of 0.25% GeH4 diluted with H2, and the nucleation and growth of Ge nanocrystallites were measured from topographic and current images simultaneously taken by a conductive AFM probe after Cr contact formation on films so prepared. We have demonstrated that current images show fine grains in comparison with topographic images and the lateral evolution of the Ge grains with progressive film growth. The contrast in current images can be interpreted in terms of the difference in electron concentration between nanocrystalline grains and their boundaries.

This paper proposes a new method of estimating real-time traffic matrices that only incurs small errors in estimation. A traffic matrix represents flows of traffic in a network. It is an essential tool for capacity planning and traffic engineering. However, the high costs involved in measurement make it difficult to assemble an accurate traffic matrix. It is therefore important to estimate a traffic matrix using limited information that only incurs small errors. Existing approaches have used IP-related information to reduce the estimation errors and computational complexity. In contrast, our method, called spike flow measurement (SFM) reduces errors and complexity by focusing on spikes. A spike is transient excessive usage of a communications link. Spikes are easily monitored through an SNMP framework. This reduces the measurement costs compared to that of other approaches. SFM identifies spike flows from traffic byte counts by detecting pairs of incoming and outgoing spikes in a network. A matrix is then constructed from collected spike flows as an approximation of the real traffic matrix. Our experimental evaluation reveals that the average error in estimation is 28%, which is sufficiently small for the method to be applied to a wide range of network nodes, including Ethernet switches and IP routers.

Broadband fixed wireless access (BFWA) systems with multi-hop mesh topologies have attracted considerable attention as a promising technology for next generation, high quality, high capacity, and high density access infrastructures. The primary advantages of mesh network topologies are an improvement of capacity by means of traffic engineering throughout the networks. This paper discusses an adaptive traffic load balancing method that maximizes the capacity for the mesh BFWA networks. Taking into account the variation of network conditions such as traffic demand distributions and qualities of wireless links, the adaptive traffic load balancing method attempts to equalize the utilization of capacity for each wireless link. To avoid deteriorating the performance of TCP communications, the proposed method implements flow-based traffic load balancing. Performance of the proposed adaptive traffic load balancing method is demonstrated and validated using the experimental mesh network environments with wired networks with up to sixteen nodes that emulates the variation of the wireless link capacity.