Presenter : ZHOU Fen - ISEP
Abstract : This talk will first show my research activities related to routing and resource allocation in different communication networks (optical networks, wireless ad-hoc networks, and content delivery networks).
In wireless sensor networks (WSNs), we studied the problem of maximizing the network lifetime for data gathering tree. To this end, we considered several data aggregation modes, and proposed an integer linear program to obtain the optimal data gathering tree in each mode respectively.
Then, I will present our work on the service provisioning against disaster failures in optical datacenter networks, where we considered the survivability of both the service content and the provisioning path. To solve this problem efficiently, we proposed a column generation based method.
Bio. Since September 2018, Fen Zhou is working as an Associate Professor at the Institut Supérieur d'Electronique de Paris (ISEP, on leave from Univ. Avignon). Before that, he has been an Associate Professor at the LIA lab of Avignon University, from 2012 to 2018. He obtained the HDR degree from Avignon University in 2018 and his PhD from INSA of Rennes in 2010.
Dr. Zhou is a Senior Member of IEEE. He has served as the TPC co-chair of IEEE BMSB 2020, symposium co-chair for IEEE ICNC’18 and WCSP’14, publicity co-chair for IEEE Wimob’15/19 and NetgCOOP’16, etc. He has also served onthe program committees for several international conferences such as IEEE INFOCOM, IEEE GLOBECOM, IEEE ICC, and IEEE IWCMC.
For 2016-2020, he isawarded the French Research Bonus (PEDR).
Presenter : Anais DURAND - MC LIMOS, Université Clermont Auvergne
Abstract : Mobile networks, robot fleets, swarms of drones are example of highly dynamic networks, i.e., networks whose topology changes overtime. In these networks, topological changes cannot simply be considered as a perturbation but are truly inherent to the system. However, fault-tolerant distributed computing researches mainly focused on networks whose topology is static or systems where topological changes are rare and sparse.
Self-stabilizing systems are able to recover a correct behavior in finite time and without any external intervention, after some perturbations (e.g., memory corruption, message losses) put the system in an arbitrary state. Self-stabilization is a very promising solution to withstand faults in highly dynamic networks.
I will present some ongoing work aiming to explore the power of self-stabilization in highly dynamic networks (what problems can we solve? what hypotheses on the dynamic of the system are necessary?, etc.). We consider Time-Varying Graphs to model the dynamic of the network topology.
Presenter : Viet Hung NGUYEN - Professeur LIMOS, Université Clermont Auvergne
Abstract : In this talk, we address the problem of finding the best parameters of an electricity contract for a client based on her past records of electricity consumption over a fixed time period, typically one year. The electricity bill is composed by some fixed cost, the cost of the subscription of the electricity contract and penalties due to overpowering of consumption. The problem can be formulated as a problem of minimizing a convex separable function with constraints featuring node-arc inciden matrix structure which can be solved in polynomial time by flow-based algorithms (Ahuja et al 2003, Karzanov et al 1997, Minoux 1984, Minoux 1986). We propose a simple special purpose iterative algorithm for the deterministic version of the problem which has a better time complexity than the above cited algorithms. We also consider a robust version of the problem using the concept of budget of uncertainty introduced by (Bertsimas and Sim 2004). We prove that the resulting worst case cost minimisation problem can be solved by using the same algorithm as for the deterministic case.
Beaucoup d’animaux présentent des couleurs éclatantes et changeantes – du paon aux mouches vertes que nous connaissons bien, en passant par les plus beaux des papillons ou les oiseaux les plus communs comme les pigeons ou les canards.
Ce sont des couleurs structurelles : elles ne font appel à aucun colorant. Il s’agit de structures photoniques - des géométries complexes, incroyablement élégantes qui agissent directement sur la lumière.
En s’inspirant de la façon dont ces structures sont apparues dans la nature, on peut amener un ordinateur à les retrouver – et à conclure que ce sont les meilleures. Et on peut alors essayer de répondre à une question bizarre : qu’aurait fait la nature, si elle avait eu à faire des panneaux photovoltaïques ?