In this paper, we develop an analytical model to evaluate the performance of optical burst switching (OBS) node with optical-level buffers for retransmission of blocked bursts. First, currently used burst blocking models and modelling of optical buffers at OBS nodes are shown to be inappropriate as a blocking model for retransmission in OBS nodes. Thus, we propose a new blocking model for the burst transmission mechanism with retransmission technique in an optical-level buffered OBS node. From the numerical analysis, we show the performance enhancement by applying optical buffers for retransmission of blocked bursts in terms of burst blocking probability and link utilization.

This paper presents a method of predicting future human driving behavior under the condition that its resultant behavior and past observations are given. The proposed method makes use of a dynamic Bayesian network and the junction tree algorithm for probabilistic inference. The method is applied to behavior prediction for a vehicle assumed to stop at an intersection. Such a predictive system would facilitate warning and assistance to prevent dangerous activities, such as red-light violations, by allowing detection of a deviation from normal behavior.

A combination of horizontal expansion and vertical stacking of optical Banyan (HVOB) is the general architecture for building Banyan-based optical cross-connects (OXCs), and the intrinsic crosstalk problem of optical signals is a major constraint in designing OXCs. In this paper, we analyze the blocking behavior of HVOB networks and develop the lower bound on blocking probability of a HVOB network that is free of first-order crosstalk in switching elements. The proposed lower-bound is significant because it provides network designers an effective tool to estimate the minimum blocking probability they can expect from a HVOB architecture regardless what kind of routing strategy to be adopted. Our lower bound can accurately depict the overall blocking behavior in terms of the minimum blocking probability in a HVOB network, as verified by extensive simulation based on a network simulator with both random routing and packing routing strategies. Surprisingly, the simulated and theoretical results show that our lower bound can be used to efficiently estimate the blocking probability of HVOB networks applying packing strategy. Thus, our analytical model can guide network designers to find the tradeoff among the number of planes (stacked copies), the number of SEs, the number of stages and blocking probability in a HVOB network applying packing strategy.

The performance of a feedback-type adaptive array antenna (AAA) system placed only at a base station (BS) in an FDD/DS-CDMA system remains insufficiently clear. We evaluate the performance of this system by considering the effect of a rake receiver, spacing distance between antennas, the maximum Doppler frequency (fd), and control delay time (Td) on BER performance. In this system, the mobile station (MS) determines optimum weights of antenna elements and sends them back to BS as feedback information. We assume that the optimum weights are not quantized. Thereby, we estimate the performance degradation of 3GPP transmit diversity system, where the feedback information is quantized using a few bits. Computer simulation results show that the rake receiver achieves better BER performance because of the time diversity effect with rake receiver. The AAA with a wide antenna spacing gives high diversity gain for the received signals. For a high value of fd Td, BER performance becomes worse because weighting factors cannot follow the changing speed of channel characteristics. The degradation in performance of a 3GPP system is clarified.

A two-dimensional network for motion detection constructed of simple analog circuits was proposed and designed based on the frog visual system. In the frog visual system, the two-dimensional motion of a moving object can be detected by performing simple information processing in the tectum and thalamus of the frog brain. The measured results of the test chip fabricated by a 1.2 µm complementary metal oxide semiconductor (CMOS) process confirmed the correct operation of the basic circuits in the network. The results obtained with the simulation program with integrated circuit emphasis (SPICE) showed that the proposed network can detect the motion direction and velocity of a moving object. Thus, a chip for two-dimensional motion detection was realized using the proposed network.

This paper presents a simple, yet effective hybrid of the minimum mean square error (MMSE) multi-user detection (MUD) and successive interference cancellation (SIC) for direct-sequence code division multiple access (DS-CDMA) systems. The proposed hybrid MUD first divides the users into groups, with each group consisting of users with a close power level. The SIC is then used to distinguish users among different groups, while the MMSE MUD is used to detect signals within each group. To further improve the performance impaired by the propagation errors, an information reuse scheme is also addressed, which can be used in conjunction with the hybrid MMSE/SIC MUD to adequately cancel the multiple access interferences (MAIs) so as to attain more accurate detections. Furthermore, the asymptotic multiuser efficiency (AME), a measure to characterize the near-far resistance capability, is also conducted to provide further insights into the new detectors. Furnished simulations, in both additive white Gaussian noise (AWGN) channels and slow flat Rayleigh fading channels, show that the performances of the proposed hybrid MMSE/SIC detectors, with or without the decision aided scheme, are superior to that of the SIC and, especially, the one with decision aided is close to that of the MMSE MUD but with substantially lower computational complexity.

A highly collision-resistive RFID system multiplexes communications between thousands of tags and a single reader in combination with time-domain multiplexing code division multiple access (TD-CDMA), CRC error detection, and re-transmission for error recovery. The collision probability due to a random selection of CDMA codes and TDMA channels bounds the number of IDs successfully transmitted to a reader during a limited time frame. However, theoretical analysis showed that the re-transmission greatly reduced the collision probability and that an ID error rate of 2.510-9 could be achieved when 1,000 ID tags responded within a time frame of 400 msec in ideal communication channels. The proposed collision-resistive communication scheme for a thousand multiplexed channels was modeled on a discrete-time digital expression and an FPGA-based emulator was built to evaluate a practical ID error rate under the presence of background noise in communication channels. To achieve simple anti-noise communication in a multiple-response RFID system, as well as unurged re-transmission of ID data, adjusting of correlator thresholds provides a significant improvement to the error rate. Thus, the proposed scheme does not require a reader to request ID transmission to erroneously responding tags. A reader also can lower noise influence by using correlator thresholds, since the scheme multiplexes IDs by CDMA-based communication. The effectiveness of the re-transmission was confirmed experimentally even in noisy channels, and the ID error rate derived from the emulation was 1.910-5. The emulation was useful for deriving an optimum set of RFID system parameters to be used in the design of mixed analog and digital integrated circuits for RFID communication.

As digital television transmission is becoming ubiquitous, a method that can remotely monitor the quality of the final and intermediate pictures is urgently needed. In particular, the case where standards conversion is included in the transmission chain is a serious issue as the input and output cannot simply be compared. This letter proposes a novel method to solve this issue. The combination of skipping fields/pixels and the previously proposed SSSWHT-RR method, using the information of correlation coefficients and variance of the picture, achieves accurate detection of picture failure.

In this paper, we propose a framework for virtual reality, I2-NEXT, which enables users to interact with virtual objects by tangible objects in immersive networked virtual environment. The primary goal of this framework is to support rapid development of immersive and interactive virtual reality systems as well as various types of user interfaces. The proposed framework consists of user interface for interactions, immersive virtual environment, and networking interface. In this framework, we adopt several design patterns to guarantee that either developers or users (artists) can easily implement their VR applications without strong knowledge of VR techniques such as programming, libraries etc. One of the key features of this framework is the presence of the device module which supports a natural user interaction in a virtual environment. For example, the proposed framework provides users with tangible objects so that the users are able to manipulate virtual objects by touching real objects. The proposed framework also supports large scale stereoscopic display through clustering technique. To realize the effectiveness of the proposed framework, we have been developing an application for digital heritage reconstruction. Having been through development of the system, we believe that virtual reality technology is one of the promising technologies which enable users to experience realities in a digital space. Detailed explanations of each component and system architecture are presented.

Our group is exploring interactive multi- and hypermedia, especially applied to virtual and mixed reality multimodal groupware systems. We are researching user interfaces to control source→sink transmissions in synchronous groupware (like teleconferences, chatspaces, virtual concerts, etc.). We have developed two interfaces for privacy visualization of narrowcasting (selection) functions in collaborative virtual environments (CVES): for a workstation WIMP (windows/icon/menu/pointer) GUI (graphical user interface), and for networked mobile devices, 2.5- and 3rd-generation mobile phones. The interfaces are integrated with other CVE clients, interoperating with a heterogeneous multimodal groupware suite, including stereographic panoramic browsers and spatial audio backends & speaker arrays. The narrowcasting operations comprise an idiom for selective attention, presence, and privacy-- an infrastructure for rich conferencing capability.

To support international medical collaboration activities carried out among Japan, Sri Lanka and other countries in Asia, we have been developing a collaboration system, which incorporates synchronous and asynchronous collaboration paradigms through network-effective persistent information sharing. The designed system facilitates synchronous collaborative work on maxillo-facial cases through real-time high-quality image delivery and by bringing the system database objects to a shared-workspace. The asynchronous activities are supported through a web based collaborative environment that enables both activity-centric and object-centric navigation of collaboration contents incorporated with email notifications of the system updates. Multimedia records of synchronous sessions are posted to the system database for later reviewing. Geographically dispersed groups experiencing different scales of network heterogeneities are served by a distributed application level multicast overlay and an adaptive multimedia delivery mechanism. The designed collaboration system also features several useful collaboration tools, user friendly GUI and ubiquitous connectivity.

Machine learning and data mining algorithms are increasingly being used in the intrusion detection systems (IDS), but their performances are laggard to some extent especially applied in network based intrusion detection: the larger load of network traffic monitoring requires more efficient algorithm in practice. In this paper, we propose and design an anomaly intrusion detection (AID) system based on the vector quantization (VQ) which is widely used for data compression and high-dimension multimedia data index. The design procedure optimizes the performance of intrusion detection by jointly accounting for accurate usage profile modeling by the VQ codebook and fast similarity measures between feature vectors to reduce the computational cost. The former is just the key of getting high detection rate and the later is the footstone of guaranteeing efficiency and real-time style of intrusion detection. Experiment comparisons to other related researches show that the performance of intrusion detection is improved greatly.

Space-frequency transmit diversity (SFTD) and space-code transmit diversity (SCTD), which are both based on space-time block codes (STBC), were applied to time-direction spreading and two-dimensional spreading orthogonal frequency-division multiplexing code-division multiplexing (OFDM-CDM) systems, and the transmission performances were compared by computer simulation. SFTD is designed for space and two adjacent subcarriers whereas SCTD is designed for space and two distinct Walsh-Hadamard (WH) codes. The simulation results show that SCTD applied to time-direction spreading OFDM-CDM was superior to SFTD because frequency selectivity distorted STBC's orthogonality between sub-carriers in SFTD. In contrast, when they were applied to two-dimensional spreading OFDM-CDM, SFTD was superior to SCTD when the number of WH codes belonging to the same mother-code group is small because the frequency diversity provided by SFTD surpassed that provided by SCTD. In addition, both SFTD and SCTD provide high tolerance to large Doppler spread. It can be therefore concluded that both SCTD and SFTD can be used in the same frame by code-multiplexing according to their suitability to physical channels. SCTD is suitable for transmitting high-rate data via time-direction spreading, whereas SFTD is suitable for transmitting control data via two-dimensional spreading.

Security protocols flaws represent a substantial portion of security exposures of data networks. In order to evaluate security protocols against any attack, formal methods are equipped with a number of techniques. Unfortunately, formal methods are applicable for static state only, and don't guarantee detecting all possible flaws. Therefore, formal methods should be complemented with dynamic protection. Anomaly detection systems are very suitable for security protocols environments as dynamic activities protectors. This paper presents an intrusion detection system that uses a number of different anomaly detection techniques to detect attacks against security protocols.

It has been a very important issue to evaluate the performance of transmission control protocol (TCP), and the importance is still growing up because TCP will be deployed more widely in future wireless as well as wireline networks. It is also the reason why there have been a lot of efforts to analyze TCP performance more accurately. Most of these works are focusing on overall TCP end-to-end throughput that is defined as the number of bytes transmitted for a given time period. Even though each TCP's fast recovery strategy should be considered in computation of the exact time period, it has not been considered sufficiently in the existing models. That is, for more detailed performance analysis of a TCP implementation, the fast recovery latency during which lost packets are retransmitted should be considered with its relevant strategy. In this paper, we extend the existing models in order to capture TCP's loss recovery behaviors in detail. On the basis of the model, the loss recovery latency of three TCP implementations can be derived with considering the number of retransmitted packets. In particular, the proposed model differentiates the loss recovery performance of TCP using selective acknowledgement (SACK) option from TCP NewReno. We also verify that the proposed model reflects the precise latency of each TCP's loss recovery by simulations.

Conventional video compression methods generally require a large amount of computation in the encoding process because they perform motion estimations. In order to reduce the encoding complexity for video compression, this paper proposes a new video compression method based on low-density parity check codes. The proposed method is suitable for resource-constrained devices such as mobile phones and satellite cameras.

The system under study is a convolutionally coded and orthogonally modulated DS-CDMA system over time-varying frequency-selective Rayleigh fading channels in multiuser environments. Iterative soft demodulation and decoding using the Turbo principle can be applied to such a system to increase the system capacity and performance. To combat multiple access interference (MAI), we incorporate the interference cancellation (IC) and decision-directed channel estimation (CE) in the demodulator. However, both IC and CE are subject to performance degradation due to incorrect decisions. In order to prevent error propagation from the decision feedback, soft interference cancellation and channel estimation assisted demodulation is proposed in this paper. The performance of this strategy is evaluated numerically and proved to be superior to the hard decision-directed approach with a minor increase in complexity.

In 2000, Xu and Tilborg proposed an ID-based conference key distribution scheme which builds on earlier work of Harn and Yang in the 2-party setting. Recently, Jung et al. have discovered security flaws in the Xu-Tilborg scheme and proposed an improvement of this scheme to fix the security flaws. However, Jung et al.'s improvement introduces another security weakness. We demonstrate this by showing that the improved scheme is vulnerable to a parallel session attack mounted by two colluding adversaries. Further, we recommend changes to the scheme that address this vulnerability.

Digital watermarking used for fingerprinting may receive a collusion attack; two or more users collude, compare their data, find a part of embedded watermarks, and make an unauthorized copy by masking their identities. In this paper, assuming that at most c users collude, we give a characterization of the fingerprinting codes that have the best security index in a sense of "(c,p/q)-secureness" proposed by Orihara et al. The characterization is expressed in terms of intersecting families of sets. Using a block design, we also show that a distributor of data can only find asymptotically a set of c users including at least one culprit, no matter how good fingerprinting code is used.

This paper presents an approach that uses the Viterbi algorithm in a stereo correspondence problem. We propose a matching process which is visualized as a trellis diagram to find the maximum a posterior result. The matching process is divided into two parts: matching the left scene to the right scene and matching the right scene to the left scene. The last result of stereo problem is selected based on the minimum error for uniqueness by a comparison between the results of the two parts of matching process. This makes the stereo matching possible without explicitly detecting occlusions. Moreover, this stereo matching algorithm can improve the accuracy of the disparity image, and it has an acceptable running time for practical applications since it uses a trellis diagram iteratively and bi-directionally. The complexity of our proposed method is shown approximately as O(N2P), in which N is the number of disparity, and P is the length of the epipolar line in both the left and right images. Our proposed method has been proved to be robust when applied to well-known samples of stereo images such as random dot, Pentagon, Tsukuba image, etc. It provides a 95.7 percent of accuracy in radius 1 (differing by 1) for the Tsukuba images.