Triantafyllidou D.,VTT Technical Research Center of Finland |
IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC | Year: 2010
Delay-based routing is proved to improve the network's round-trip time without enhancing its throughput . The reason is that optimising the end-to-end delay -as any load-based metric- creates route instability which results in packet reordering. This problem is detrimental for TCP. In the present work, we couple delay-based routing with a mechanism that locks, upon each node, the next-hop for each TCP flow, unless that hop becomes unavailable. The routes for future flows are proactively discovered by optimized link-state routing (OLSR) and reside in the node's routing table, so the proposed mechanism is fully distributed. Simulation experiments in static and mobile scenarios for small pedestrian networks show that the use of path-locking in conjunction with delay-based routing alleviates the route oscillations and improves the TCP's throughput. ©2010 IEEE.
Pujolle G.,Pohang University of Science and Technology |
Pujolle G.,University Pierre and Marie Curie |
Al Agha K.,LRI
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013
This paper deals with the minimization of energy consumption in mesh access networks. As proposed in 3GPP, future wireless access networks will be based in part on mesh technology. Indeed, as all access points cannot be connected by optic fibers to the core networks, we propose to realize a mesh network to connect altogether hotspots and femtocells. To optimize the energy consumption we have developed a Start-and-Stop mechanism permitting to turn-off all unused physical machines. Moreover, we developed a virtual environment to work with virtual machines instead physical machines. This permits to move virtual resources from one physical point to another one. Finally, we describe the piloting system based on the autonomic paradigm, and associated with a knowledge plane. This piloting system is able to minimize the energy consumption in future mesh access networks. © Springer-Verlag 2013.
Patel R.,University College London |
Kumar H.,LRI |
More B.,QMC |
BMJ Case Reports | Year: 2013
We present a case of recurrent painful blisters of middle phalanx of the left ring finger of a 15-month-old previously healthy and immunocompetent female child. These lesions initially were confused with infective bacterial whitlow, treated with incision and drainage, and later with cigarette burns which led to referral to child protection team. Paediatric dermatologist finally diagnosed after scrapping and virology culture. The patient had recovery following full treatment with topical and systemic acyclovir. She presented again at the age of 4 with recurrence which required topical and systemic acyclovir therapy with good recovery. It is important to be aware of the danger of incorrect diagnosis, raising child protection concerns and management leading to danger of cross infection and serious illness especially in the immunocompromised patients. Copyright 2013 BMJ Publishing Group. All rights reserved.
Kolpakov R.,Moscow State Pedagogical University |
Kucherov G.,French Institute for Research in Computer Science and Automation |
Kucherov G.,J V Poncelet Laboratory |
Ochem P.,LRI |
Ochem P.,J V Poncelet Laboratory
Information Processing Letters | Year: 2010
The first two authors have shown [1,2] (Kolpakov and Kucherov, 1999, 2000) that the sum of the exponents (and thus the number) of maximal repetitions of exponent at least 2 in a word (also called runs) is linear with respect to the length of the word. The exponent 2 in the definition of a run may seem arbitrary. In this paper, we consider maximal repetitions of exponent strictly greater than 1. © 2010 Elsevier B.V. All rights reserved.
Faur C.,CNRS LIMSI |
Caillou P.,LRI |
Martin J.-C.,CNRS LIMSI |
Clavel C.,CNRS LIMSI
2015 International Conference on Affective Computing and Intelligent Interaction, ACII 2015 | Year: 2015
Artificial agents are becoming artificial companions, interacting with the user on a long-term basis. This evolution brought new challenges to the affective computing domain, such as designing artificial agents with personalities to the benefits of the user. Endowing artificial agents with personality could help to increase the agent's believability, hence easing the interaction. This paper touches on two questions pertaining to computational personality modeling: 1/ how to produce artificial personalities which can inform personality researchers, whether from computer sciences or psychology and 2/ will behaviors produced by artificial agents be perceived by users as putting the programmed personality across as such. We propose to use a data-driven approach to endow artificial agents with personality, using the regulatory focus theory as a framework. We used machine-learned game strategies, in the form of alternative decision trees computed from human data, to convey the personality of artificial agents. We then tested whether these personalities can be perceived by users after playing a game against these agents. We used two artificial agents as controls: one randomly playing and one with an average / depersonalized strategy. On the one hand, our results show that agents' regulatory focus, when programmed, can be accurately perceived by users. On the other hand, our results also point out that personality will be perceived by users even if the agent's design does not intend to transmit one. © 2015 IEEE.