Publications

2019

• Séminaire : Quantum Key Distribution and Perspectives
  
  • Alleaume Romain
  , 2019.
• Performance Enhancement Techniques Based on CDL-impaired Multi-core Fiber Channel Model
  
  • Rekaya-Ben Othman Ghaya
  • Abousief Akram
  • Jaouën Yves
  , 2019.
• Benefits of Cache Assignment on Degraded Broadcast Channels
  
  • Saeedi Bidokhti Shirin
  • Wigger Michèle
  • Bidokhti Shirin Saeedi
  • Yener Aylin
  IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2019, 65 (11), pp.6999-7019. Degraded K-user broadcast channels (BCs) are studied when the receivers are facilitated with cache memories. Lower and upper bounds are derived on the capacity-memory tradeoff, i.e., on the largest rate of reliable communication over the BC as a function of the receivers' cache sizes, and the bounds are shown to match for interesting special cases. The lower bounds are achieved by two new coding schemes that benefit from nonuniform cache assignments. Lower and upper bounds are also established on the global capacity-memory tradeoff, i.e., on the largest capacity-memory tradeoff that can be attained by optimizing the receivers' cache sizes subject to a total cache memory budget. The bounds coincide when the total cache memory budget is sufficiently small or sufficiently large, where the thresholds depend on the BC statistics. For small cache memories, it is optimal to assign all the cache memory to the weakest receiver. In this regime, the global capacity-memory tradeoff grows by the total cache memory budget divided by the number of files in the system. In other words, a perfect global caching gain is achievable in this regime and the performance corresponds to a system where all the cache contents in the network are available to all receivers. For large cache memories, it is optimal to assign a positive cache memory to every receiver, such that the weaker receivers are assigned larger cache memories compared to the stronger receivers. In this regime, the growth rate of the global capacity-memory tradeoff is further divided by the number of users, which corresponds to a local caching gain. It is observed numerically that a uniform assignment of the total cache memory is suboptimal in all regimes, unless the BC is completely symmetric. For erasure BCs, this claim is proved analytically in the regime of small cache sizes. (10.1109/TIT.2019.2926714)
  DOI : 10.1109/TIT.2019.2926714
• Rademacher complexity for Markov chains: Applications to kernel smoothing and Metropolis–Hastings
  
  • Bertail Patrice
  • Portier François
  Bernoulli, Bernoulli Society for Mathematical Statistics and Probability, 2019, 25 (4B), pp.3912-3938. (10.3150/19-BEJ1115)
  DOI : 10.3150/19-BEJ1115
• Large Normal Dispersion Mode-Locked Erbium-Doped Fiber Laser
  
  • Tang Mincheng
  • Granger Geoffroy
  • Lesparre Fabien
  • Wang Hongjie
  • Qian Kai
  • Lecaplain Caroline
  • Oudar Jean-Louis
  • Jaouën Yves
  • Gabet Renaud
  • Gaponov Dmitry
  • Likhachev Mikhail
  • Godin Thomas
  • Février Sébastien
  • Hideur Ammar
  Fibers, MDPI, 2019, 7 (11), pp.97. We report on a passively mode-locked oscillator based on an erbium-doped dual concentric core fiber combining high normal dispersion and large mode area. This large normal dispersion laser generates long pulses with 30 ps duration and 0.17 nm spectral width at 1530 nm wavelength. The source delivers an average power of 64 mW at a repetition rate of 16 MHz, corresponding to 4 nJ energy. This concept opens up new degrees of freedom in the design of mode-locked fiber lasers. (10.3390/fib7110097)
  DOI : 10.3390/fib7110097
• Survey of Performance Acceleration Techniques for Network Function Virtualization
  
  • Linguaglossa Leonardo
  • Lange Stanislav
  • Pontarelli Salvatore
  • Rétvári Gábor
  • Rossi D.
  • Zinner Thomas
  • Bifulco Roberto
  • Jarschel Michael
  • Bianchi Giuseppe
  Proceedings of the IEEE, Institute of Electrical and Electronics Engineers, 2019. The ongoing network softwarization trend holds the promise to revolutionize network infrastructures by making them more flexible, reconfigurable, portable, and more adaptive than ever. Still, the migration from hard-coded/hardwired network functions towards their software-programmable counterparts comes along with the need for tailored optimizations and acceleration techniques, so as to avoid, or at least mitigate, the throughput/latency performance degradation with respect to fixed function network elements. The contribution of this article is twofold. First, we provide a comprehensive overview of the host-based Network Function Virtualization (NFV) ecosystem, covering a broad range of techniques, from low level hardware acceleration and bump-in-the-wire offloading approaches, to highlevel software acceleration solutions, including the virtualization technique itself. Second, we derive guidelines regarding the design, development, and operation of NFV-based deployments that meet the flexibility and scalability requirements of modern communication networks. (10.1109/JPROC.2019.2896848)
  DOI : 10.1109/JPROC.2019.2896848
• International mass gatherings and travel-associated illness: A GeoSentinel cross-sectional, observational study
  
  • Gautret Philippe
  • Angelo Kristina
  • Asgeirsson Hilmir
  • Duvignaud Alexandre
  • van Genderen Perry J.J.
  • Bottieau Emmanuel
  • Chen Lin
  • Parker Salim
  • Connor Bradley
  • Barnett Elizabeth
  • Libman Michael
  • Hamer Davidson
  Travel Medicine and Infectious Disease, Elsevier, 2019, 32, pp.101504. (10.1016/j.tmaid.2019.101504)
  DOI : 10.1016/j.tmaid.2019.101504
• Several new classes of self-dual bent functions derived from involutions
  
  • Luo Gaojun
  • Cao Xiwang
  • Mesnager Sihem
  Cryptography and Communications - Discrete Structures, Boolean Functions and Sequences, Springer, 2019, 11 (6), pp.1261-1273. (10.1007/s12095-019-00371-9)
  DOI : 10.1007/s12095-019-00371-9
• L'Ecole sur le site Barrault
  
  • Gallion Philippe
  La Revue Télécom, 2019, 194 (194), pp.pp 8-12.
• Séminaire : Communications et Calcul Quantique
  
  • Alleaume Romain
  , 2019.
• 2D indoor localization system with an UWB multistatic radar
  
  • Awarkeh Nour
  , 2019. Nowadays, the ability to track objects and people is crucial for a huge number of applications, such as medical applications (monitoring of patients) or independent applications that require a very high accuracy and resolution in the positioning process. Therefore, the main scientific objective of this thesis is to develop a tracking system using an UWB multistatic radar system to provide realtime 2D location of transponders or active tags. The localization is carried out in polar coordinates (distance and azimuth angle) by merging the interferometry and goniometry principles, assuming a propagation channel with a direct path, or LoS between the station and the target. The designed ILS incorporates a hybrid technique by combining the duplex UWB and the Phase Correlation methods for the radial-distance and the azimuth angle estimates. The proposed ILS consists of two main components, a transmitter /receiver (transceiver) station serving as a LBS and an AT. The LBS has one transmitting channel and two identical and independent receiving channels. The localization is performed by sending UWB pulses towards the AT which acts as an active transponder and retransmits in turn the received signal back to the LBS upon delaying it. This designed ILS is expected to offer, under LoS conditions, a position estimation with high accuracy and resolution while maintaining low system complexity. The system works with a single anchor, and simultaneously addresses indoor challenges such as multipaths, strong signal attenuations, reflections, etc.
• Reinforcement Learning Algorithm for Load Balancing in Self‐Organizing Networks
  
  • Ali Mohammed Shabbir
  • Coucheney Pierre
  • Coupechoux Marceau
  , 2019 (1).
• Ethereum for Secure Authentication of IoT using Pre-Shared Keys (PSKs)
  
  • El-Hajj Mohammad
  • Fadlallah Ahmad
  • Chamoun Maroun
  • Serhrouchni Ahmed
  , 2019, pp.1-7. Enterprises are no doubt interested in reaching data collected from billions of Internet of Things (IoT) devices which opens a huge potential business. The main concern remains the security challenges from the distribution of key while using public key cryptography. To ensure that IOT connected devices can be trusted to be what they are supposed to be, robust IoT device authentication is mandated. Each IoT device therefore requires a unique identity which can be verified when the device tries to link to an intermediate device. One of the early solutions used to secure data transmission among parties in public networks is the Public Key Infrastructure (PKI) which is used to distribute and manage public keys (digital certificates) among different parties and these certificates are generated upon request by Certificate Authorities (CA). Nevertheless, for billions of devices connected to IoT and mobile phones, the distribution management of certificates for each client proved to be inefficient. In this research, we propose a decentralized authentication platform based on PKI and Ethereum Blockchain. The public key certificates are stored in a decentralized fashion and the private keys are stored inside the devices themselves. It also includes a protocol for Pre-Shared Keys (PSK) distribution. PSK keys are then used by PSK-based security protocols for securing the communication channel between two devices. This platform includes a client-side module, a server-side Wallet Management Function, and a smart contract deployed on the Ethereum Blockchain network. This platform can be used by applications for end devices and/or intermediate devices authentication and a secure Machine-to-Machine (M2M) communication. The proposed platform is validated by the implementation of a Secure Session Establishment between IoT devices. Results show that the solution implementation has minimal impact on the existing networks, and the secure session setup time between two devices is negligib... (10.1109/WINCOM47513.2019.8942487)
  DOI : 10.1109/WINCOM47513.2019.8942487
• COCKPIT VIDEO CODING WITH TEMPORAL PREDICTION
  
  • Mitrica Iulia
  • Fiandrotti Attilio
  • Cagnazzo Marco
  • Mercier Eric
  • Ruellan Christophe
  , 2019. Recording an airplane cockpit screen is a challenging task since video codecs hardly preserve text details at the low bi-trates required by avionic applications. We recently proposed a scheme for semantic compression of airplane cockpit video that preserves the readability of text while meeting bitrate and encoder complexity constraints. Within each frame, text is segmented from the video and encoded as character strings rather than as pixels. Text in the screen is then inpainted, producing a residual video with few high frequency components easily encodable with standard codecs. The residual video is transmitted with the encoded text as side-information. At the receiver side, characters are synthesized atop the decoded residual video, leaving the text unaffected by compression artefacts. In this work, we evaluate our scheme with multiple video codecs with different prediction schemes, producing novel experimental evidence in terms of attainable rate-distortion performance and highlighting directions for future research.
• Conception d’un Réseau d’Antennes Patch Microruban pour la Détection de Drones
  
  • Mendes Ruiz Pedro
  • Begaud Xavier
  • Magne François
  • Leder Etienne
  , 2019.
• An OPC UA PubSub MQTT Configuration Tool
  
  • Liu Zepeng
  • Bellot Patrick
  , 2019.
• Weakly Informed Audio Source Separation
  
  • Schulze-Forster Kilian
  • Doire Clément
  • Richard Gael
  • Badeau Roland
  , 2019. Prior information about the target source can improve audio source separation quality but is usually not available with the necessary level of audio alignment. This has limited its usability in the past. We propose a separation model that can nevertheless exploit such weak information for the separation task while aligning it on the mixture as a byproduct using an attention mechanism. We demonstrate the capabilities of the model on a singing voice separation task exploiting artificial side information with different levels of expres-siveness. Moreover, we highlight an issue with the common separation quality assessment procedure regarding parts where targets or predictions are silent and refine a previous contribution for a more complete evaluation.
• A Blockchain-based Lightweight Authentication Solution for IoT
  
  • Fayad Achraf
  • Khatoun Rida
  • Hammi Badis
  • Serhrouchni Ahmed
  , 2019.
• Handwriting and Drawing Features for Detecting Personality Traits
  
  • Esposito Anna
  • Amorese Terry
  • Buonanno Michele
  • Cuciniello Marialucia
  • Esposito Antonietta
  • Faundez-Zanuy Marcos
  • Likforman-Sulem Laurence
  • Riviello Maria Teresa
  • Troncone Alda
  • Cordasco Gennaro
  , 2019, pp.79-84. This research reports on handwriting/drawing quantitative features and their links with personality traits. To this aim, handwriting/drawing tasks have been proposed to 78 subjects (equally balance by gender and aged between 22-35 years), which were first administered the Big Five Personality questionnaire (BFQ). Subjects were clustered as low, typical, and high according to the scores obtained to each 5 personality dimensions (Openness, Conscientiousness, Extraversion, Agreeableness, Neuroticism). Measures of pressure, ductus, time, space, and inclination, were computed from digital recordings of the proposed handwriting/drawing tasks through an INTUOS WACOM digitizing tablet. On these data, ANOVA repeated measures were performed with gender and group category (low, typical and high for each of the BFQ dimension) as between and associated computed measures as within factors. Results show significant differences for each of the BFQ dimension among subject group categories and handwriting/drawing measures connecting quantitatively personality traits to graphology (10.1109/CogInfoCom47531.2019.9089985)
  DOI : 10.1109/CogInfoCom47531.2019.9089985
• Time-division multiplexing method and circuit for concurrent access to a computer resource
  
  • Hebbache Farouk
  • Jan Mathieu
  • Brandner Florian
  • Pautet Laurent
  , 2019. The invention relates to a method implemented by computer for arbitration between computer programs seeking to access a shared resource concurrently and each transmitting an access request. The method performs time-division multiple access according to which the time is divided into time slots, each of which is allocated to a critical program for access to the shared resource, each time slot comprising a plurality of time units. The method exploits a processing slack associated with each critical program in order to delay a processing deadline for an access request transmitted by the critical program. The method comprises, for each unit time, a step of selecting a waiting access request and a step of determining authorization for immediate processing of the selected access request. This determining operation comprises, for a unit time which does not correspond to the beginning of a time slot, when the critical program to which the next time slot is allocated has not issued the selected request, authorization for the immediate processing of the selected request if the processing slack of the critical program to which the next time slot is allocated is greater than a threshold.
• Time-division multiplexing method and circuit for concurrent access to a computer resource
  
  • Hebbache Farouk
  • Jan Mathieu
  • Brandner Florian
  • Pautet Laurent
  , 2019. The invention relates to a method implemented by computer for arbitration between computer programs seeking to access a shared resource concurrently and each transmitting an access request. The method performs time-division multiple access according to which the time is divided into time slots, each of which is allocated to a critical program for access to the shared resource, each time slot comprising a plurality of time units. The method exploits a processing overhead associated with each critical program in order to delay a processing deadline for an access request transmitted by the critical program. The method comprises, for each unit time, a step of selecting a pending access request and a step of determining authorization for immediate processing of the selected access request. This determining operation comprises, for a unit time which does not correspond to the start of a time slot, when the critical program to which the next time slot is allocated has not transmitted the selected request, authorization for the immediate processing of the selected request if the processing overhead of the critical program to which the next time slot is allocated is greater than a threshold.
• Sensitivity to forecast errors in energy storage arbitrage for residential consumers
  
  • Kiedanski Diego
  • Hashmi Umar
  • Bušić Ana
  • Kofman Daniel
  , 2019. With the massive deployment of distributed energy resources, there has been an increase in the number of end consumers that own photovoltaic panels and storage systems. The optimal use of such storage when facing Time of Use (ToU) prices is directly related to the quality of the load and generation forecasts as well as the algorithm that controls the battery. The sensitivity of such control to different forecasts techniques is studied in this paper. It is shown that good and bad forecasts can result in losses in particularly bad days. Nevertheless, it is observed that performing Model Predictive Control with a simple forecast that is representative of the pasts can be profitable under different price and battery scenarios. We use real data from Pecan Street and ToU price levels with different buying and selling price for the numerical experiments.
• Reconfigurable Lattice Agreement and Applications
  
  • Kuznetsov Petr
  • Rieutord Thibault
  • Tucci-Piergiovanni Sara
  , 2019. Reconfiguration is one of the central mechanisms in distributed systems. Due to failures and connectivity disruptions, the very set of service replicas (or $servers$) and their roles in the computation may have to be reconfigured over time. To provide the desired level of consistency and availability to applications running on top of these servers, the $clients$ of the service should be able to reach some form of agreement on the system configuration. We observe that this agreement is naturally captured via a $lattice$ partial order on the system states. We propose an asynchronous implementation of $reconfigurable$ lattice agreement that implies elegant reconfigurable versions of a large class of $lattice$ abstract data types, such as max-registers and conflict detectors, as well as popular distributed programming abstractions, such as atomic snapshot and commit-adopt. (10.4230/LIPIcs)
  DOI : 10.4230/LIPIcs
• Exploiting flexibility in irrigation while maintaining optimal crop productivity
  
  • Kiedanski Diego
  • Kofman Daniel
  • Orda Ariel
  • Horta José
  • Otero Alvaro
  , 2019. Irrigation in agriculture is a major source of electricity demand flexibility that goes largely unexploited. In this paper we provide a model and a solution to the problem of scheduling irrigation time to minimize electricity costs while satisfying crop water requirements. We propose to apply rebates (aimed to consume renewable energy surplus) that were traditionally offered to the industrial sector, in the agricultural one. Furthermore an architecture is proposed to overcome some of the limitations that can hinder the adoption of such rebates. The architecture integrates scheduling techniques best studied in the networking literature. Numerical analysis is performed to validate our model and evaluate the proposed scheduling mechanisms, based on real data from a soybean producer and from the corresponding electricity operator. Results indicate that significant cost reductions can be obtained, specially if the rebates are considered.
• Skin-On Interfaces: A Bio-Driven Approach for Artificial Skin Design to Cover Interactive Devices
  
  • Teyssier Marc
  • Bailly Gilles
  • Pelachaud Catherine
  • Lecolinet Eric
  • Conn Andrew R.
  • Roudaut Anne
  , 2019, pp.307-322. We propose a paradigm called Skin-On interfaces, in which interactive devices have their own (artificial) skin, thus enabling new forms of input gestures for end-users (e.g. twist, scratch). Our work explores the design space of Skin-On interfaces by following a bio-driven approach: (1) From a sensory point of view, we study how to reproduce the look and feel of the human skin through three user studies; (2) From a gestural point of view, we explore how gestures naturally performed on skin can be transposed to Skin-On interfaces; (3) From a technical point of view, we explore and discuss different ways of fabricating interfaces that mimic human skin sensitivity and can recognize the gestures observed in the previous study; (4) We assemble the insights of our three exploratory facets to implement a series of Skin-On interfaces and we also contribute by providing a toolkit that enables easy reproduction and fabrication. (10.1145/3332165.3347943)
  DOI : 10.1145/3332165.3347943