The virtual reality technology publishes many results, for example video game, 3D virtual movie, interface of computer and virtual meeting. However, the virtual reality has some restrictions that user neither can touc...
详细信息
The virtual reality technology publishes many results, for example video game, 3D virtual movie, interface of computer and virtual meeting. However, the virtual reality has some restrictions that user neither can touch objects nor feels like what we feel in the real world. Also user should wear some heavy equipment to make user feel reality. Furthermore, these equipments are too expensive to use people. Recently, many researchers make effort to overcome restrictions of virtual reality using the robot technology or huge display instruments. However, these approaching still can't touch others or it wears heavy equipments. We proposed a new system which is called the Tangible telemeeting system. It overcomes the restrictions of virtual reality. The user wears only see-through-HMD, and the user can touch 3D objects using the humanoid robot. The Tangible tele-meeting system links human with robots with cyber space by using the multi-view camera, a humanoid robot and network technology. When the user communicates with the other using the Tangible tele-meeting system, the user can use all senses which relate communication. It becomes more effective than other virtual meeting systems.
In this paper, we investigate the duration, lexical and linguistic properties of children's spontaneous speech for children ages 8 to 14 interacting with animated characters in a computer game. Age and gender tren...
详细信息
We study the problem of maintaining connectivity in a wireless network where the network nodes are equipped with directional antennas. Nodes correspond to points on the plane and each uses a directional antenna modele...
详细信息
ISBN:
(纸本)9781595939739
We study the problem of maintaining connectivity in a wireless network where the network nodes are equipped with directional antennas. Nodes correspond to points on the plane and each uses a directional antenna modeled by a sector with a given angle and radius. The connectivity problem is to decide whether or not it is possible to orient the antennas so that the directed graph induced by the node transmissions is strongly connected. We present algorithms for simple polynomial-time-solvable cases of the problem, show that the problem is NP-complete in the 2-dimensional case when the sector angle is small, and present algorithms that approximate the minimum radius to achieve connectivity for sectors with a given angle. We also discuss several extensions to related problems. To the best of our knowledge, the problem has not been studied before in the literature. Copyright 2008 ACM.
In this note 35 new extremal binary self-dual doubly-even codes of length 88 are presented. Their inequivalence is established by invariants. Moreover, a construction of a binary self-dual [88; 44; 16] code, having an...
详细信息
ISBN:
(纸本)9781424420681
In this note 35 new extremal binary self-dual doubly-even codes of length 88 are presented. Their inequivalence is established by invariants. Moreover, a construction of a binary self-dual [88; 44; 16] code, having an automorphism of order 21, is given.
In this article we consider tracking a maneuvering target with a non-holonomic agent. The target and the agent move in 2-dimensional space. The task is to capture/intercept the moving target using a continuous time co...
详细信息
In this paper, a novel approach for availability evaluation is presented. In order to precisely capture the features of practical network operation and improve the accuracy in the availability evaluation, the dependen...
详细信息
In this paper, a novel approach for availability evaluation is presented. In order to precisely capture the features of practical network operation and improve the accuracy in the availability evaluation, the dependency of network element failures is characterized by failure states (FS). For this purpose, a method that generating a failure state list for protection is developed and embedded in the proposed survivable routing algorithm such that the pre-defined connection availability can be guaranteed as simple as by protecting a single FS failure. Built on the availability evaluation a novel availability-constrained survivable routing algorithm, called Generalized Dedicated Protection (GDP), is introduced for circuit switched mesh networks. The proposed algorithm inherits the simplicity of dedicated protection mechanisms while offering the connection availability guarantee in presence of the network topological limitation that has been taken as the greatest challenge in the related research effort. Finally, extensive simulation is conducted to verify the advantages gained in the proposed GDP method compared with a number of previously reported counterparts.
This paper considers the performance of the MAC protocols ALOHA and CSMA in wireless ad hoc networks, where the total system bandwidth may be divided into smaller subbands. In the network model used, the arrival of us...
详细信息
This paper considers the performance of the MAC protocols ALOHA and CSMA in wireless ad hoc networks, where the total system bandwidth may be divided into smaller subbands. In the network model used, the arrival of users/packets follows a Poisson point process, communication between nodes is continuous in time, selection of a subband to transmit across is made randomly at each transmitter, and the outage assessments made in the network are based on SINR measurements. Accurate bounds on the probability of outage for the MAC protocols are derived, and evaluated with respect to the number of subbands. It is observed that there exists an optimal number of subbands for each protocol, for which the probability of outage is minimized. For ALOHA, we obtain an analytical expression for this optimal value, while in CSMA, the optimal value is observed through simulations. Furthermore, we improve the performance of CSMA by introducing channel sensing across all subbands, in order to decrease the probability that a packet is in outage upon arrival. The obtained results are used to compare the performance of the two MAC protocols. Finally, we also evaluate the performance of our network in terms of sum capacity.
Because of a distribution of copyrighted contents and private information on IT enable networks, copyright management and control of private information for the distribution became serious problems. In this paper, we ...
详细信息
Although the Distributed Coordination Function is the fundamental access protocol of IEEE 802.11, it cannot meet the quality of service (QoS) requirements in general. So, the Point Coordinate Function is provided to s...
详细信息
ISBN:
(纸本)9788996076117;8996076112
Although the Distributed Coordination Function is the fundamental access protocol of IEEE 802.11, it cannot meet the quality of service (QoS) requirements in general. So, the Point Coordinate Function is provided to support QoS related services. However, it has inherent problems. Access point (AP) has no knowledge of the queue status and instantaneous channel condition of stations in the system. In this paper we propose an efficient and versatile polling scheduler that shows excel-lent throughput and fairness performance. Comparison with well known polling schemes is provided through computer simulation under various channel situations including error prone environments.
The convexity arguments used in the consensus literature to prove synchronization in vector spaces can be applied to the circle only when all agents are initially located on a semicircle. Existing strategies for (almo...
详细信息
The convexity arguments used in the consensus literature to prove synchronization in vector spaces can be applied to the circle only when all agents are initially located on a semicircle. Existing strategies for (almost-)global synchronization on the circle are either restricted to specific interconnection topologies or use auxiliary variables. The present paper first illustrates this problem by showing that weighted, directed interconnection topologies can be designed to make any reasonably chosen configuration of the agents on the circle a stable equilibrium of a basic continuous-time consensus algorithm. Then it proposes a so-called “gossip algorithm”, which achieves global asymptotic synchronization on the circle with probability 1 for a large class of interconnections, without using auxiliary variables, thanks to the introduction of randomness in the system.
暂无评论