TCP-aware network coding with opportunistic scheduling in wireless mobile ad hoc networks

This paper presents a scheme that employs TCP-aware network coding with opportunistic scheduling to enhance TCP throughput in wireless mobile ad hoc networks. Specifically, it considers a TCP parameter, congestion window size, and wireless channel conditions simultaneously to improve TCP throughput performance. Evaluation of this scheme is carried out by using ns2 simulations in different scenarios. The results show that the proposed scheme gives approximately 35% throughput improvement in a high mobility environment and about 33% throughput increase in no or low mobility environment as compared to traditional network coding with opportunistic scheduling. This paper also proposes a new adaptive-W (i.e., adaptive Waiting time) scheme whose objective is to adaptively control waiting time of overheard packets that are stored in a buffer to achieve tradeoff between throughput and overhead.     

Kolmogorov complexity and combinatorial methods in communication complexity

We introduce a method based on Kolmogorov complexity to prove lower bounds on communication complexity. The intuition behind our technique is close to information theoretic methods.We use Kolmogorov complexity for three different things: first, to give a general lower bound in terms of Kolmogorov mutual information; second, to prove an alternative to Yao’s minmax principle based on Kolmogorov complexity; and finally, to identify hard inputs.We show that our method implies the rectangle and corruption bounds, known to be closely related to the subdistribution bound. We apply our method to the hidden matching problem, a relation introduced to prove an exponential gap between quantum and classical communication. We then show that our method generalizes the VC dimension and shatter coefficient lower bounds. Finally, we compare one-way communication and simultaneous communication in the case of distributional communication complexity and improve the previous known result.     

Prioritizing usability problems: data-driven and judgement-driven severity estimates

Software-ergonomic system analysis often reveals numerous usability problems. Given that system design suffers from limited resources, the prioritization of usability problems seems inevitable. Surprisingly enough, prioritization is not in the focus of scientific interest. Within this paper, approaches to prioritization relying on severity estimates will be presented. Two of the approaches, namely priorities based on data about the impact of a problem (data-driven) and priorities based on judgements of interest group members (judgement-driven) will be further explored. In the data-driven approach total problem-handling time caused by a usability problem is presented as a measure of severity. The major disadvantage of the data-driven approach is its costs. A possible alternative are severity estimates based on judgements by members of involved interest groups. The first of two studies shows how to obtain judgement driven severity estimates and reveals a fundamental lack of correspondence between data-driven and judgement-driven severity estimates. The second study supports the notion that the lack of correspondence may stem from a difference between assumptions of the data-driven approach and the naive judgement model of interest group members in the judgement-driven approach. A hypothetical model for severity estimates by interest group members is presented.     

Independent Hybrid Force/Motion Control of Constrained Six-Degrees-of-Freedom Manipulators

Controlling the dynamics of a constrained manipulator includesposition tracking as well as stabilization of the contact wrench.In this paper we derive a control scheme, that makes it possible to treat position and force control independently.The approach is based on a mass-orthogonal splitting of the space of joint torques, allowing independent actuation and therefore independent specification of control laws. An appropriate definition of the reference wrenchmakes it possible to achieve independent stability of the position and force loop.     

Generic remeshing of 3D triangular meshes with metric-dependent discrete voronoi diagrams

In this paper, we propose a generic framework for 3D surface remeshing. Based on a metric-driven Discrete Voronoi Diagram construction, our output is an optimized 3D triangular mesh with a user defined vertex budget. Our approach can deal with a wide range of applications, from high quality mesh generation to shape approximation. By using appropriate metric constraints the method generates isotropic or anisotropic elements. Based on point-sampling, our algorithm combines the robustness and theoretical strength of Delaunay criteria with the efficiency of entirely discrete geometry processing . Besides the general described framework, we show experimental results using isotropic, quadric-enhanced isotropic and anisotropic metrics which prove the efficiency of our method on large meshes, for a low computational cost.     

Resource-efficient routing and scheduling of time-constrained streaming communication on networks-on-chip

Network-on-chip-based multiprocessor systems-on-chip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel platform involves scheduling the communication on the network-on-chip. This paper presents different scheduling strategies that minimize resource usage by exploiting all scheduling freedom offered by networks-on-chip. It also introduces a technique to take the dynamism in applications into account when scheduling the communication of an application on the network-on-chip while minimizing the resource usage. Our experiments show that resource-utilization is improved when compared to existing techniques.     

Improving security and performance of an Ad Hoc network through a multipath routing strategy

Privacy and security solutions require today the protection of personal information so that it may not be disclosed to unauthorized participant for illegal purposes. It is a challenge to address these issues in networks with strong constraints such as Ad Hoc network. The security increase is often obtained with a quality of service (QoS) decrease. We propose in this paper a solution that provides at the anonymity, security to Ad Hoc network with a limited impact on QoS. This method could be efficient against some viral attacks. We also give some security proofs of our solution for Ad Hoc networks. The work of Hervé Aiache and Cédric Tavernier was supported by DISCREET, IST project no. 027679, funded in part by the European Commission’s Information Society Technology 6th Framework Programme.     

Perceptual issues in the use of head-mounted visual displays

OBJECTIVE: We provide a review and analysis of much of the published literature on visual perception issues that impact the design and use of head-mounted displays (HMDs). BACKGROUND: Unlike the previous literature on HMDs, this review draws heavily from the basic vision literature in order to help provide insight for future design solutions for HMDs. METHOD: Included in this review are articles and books found cited in other works as well as articles and books obtained from an Internet search. RESULTS: Issues discussed include the effect of brightness and contrast on depth of field, dark focus, dark vergence, and perceptual constancy; the effect of accommodation-vergence synergy on perceptual constancy, eyestrain, and discomfort; the relationship of field of view to the functioning of different visual pathways and the types of visual-motor tasks mediated by them; the relationship of binocular input to visual suppression; and the importance of head movements, head tracking, and display update lag. CONCLUSION: This paper offers a set of recommendations for the design and use of HMDs. APPLICATION: Consideration of the basic vision literature will provide insight for future design solutions for HMDs.