Publications

2020

• Moving a step forward in the quest for Deterministic Networks (DetNet)
  
  • Addanki Vamsi
  • Iannone Luigi
  , 2020. Recent years witnessed a fast-growing demand, in the context of industrial use-cases, for the so-called Deterministic Networks (DetNet). IEEE 802.1 TSN architecture provides link-layer services and IETF DetNet provides network-layer services for deterministic and reliable forwarding. In such a context, in the first part of this paper, we tackle the problem of misbehaving flows and propose a novel queuing and scheduling mechanism, based on Push-In-First-Out (PIFO) queues. Differently from the original DetNet/TSN specifications, our solution is able to guarantee performance of priority flows in spite of misbehaving flows. In the second part of this paper, we present our simulator DeNS: DetNet Simulator, based on OMNET++ and NeSTiNG, providing building blocks for link-layer TSN and network-layer DetNet. Existing simulators have important limitations that do not allow simulating the full DetNet/TSN protocol stack. We overcome these limitations, making easy DetNet/TSN evaluations possible. Our simulations clearly show that our solution is able to satisfy constraints of deterministic networks, namely, guarantee zero packet loss and low latency, while at the same time allowing best-effort flows to co-exist. Furthermore, we show how our newly-proposed queuing and scheduling solution successfully limits the impact of misbehaving flows.
• Bits Through Queues With Feedback
  
  • Aptel Laure
  • Tchamkerten Aslan
  IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2020, 66 (6), pp.3317-3326. In their seminal 1996 paper, Anantharam and Verdú showed that feedback does not increase the capacity of a queue under First-in-First-Out service policy and exponentially distributed service time. Since the channel has memory, this negative result raises the question whether it extends to other non-trivial combinations of service policy and service time. This paper addresses this question by providing two sufficient conditions under which feedback either increases capacity or does not increase capacity. The first is a sufficient condition on the service time distribution for feedback to increase capacity under First-In-First-Out service policy. The second is a sufficient condition for feedback not to increase capacity and is general in that it depends on the output distribution of the queue, but explicitly depends neither on the queue policy nor on the service time distribution. This condition is satisfied, for instance, by queues with Last-Come-First-Serve service policy and bounded service times. (10.1109/TIT.2020.2970421)
  DOI : 10.1109/TIT.2020.2970421
• A Multivariate Extreme Value Theory Approach to Anomaly Clustering and Visualization
  
  • Chiapino Maël
  • Clémençon Stéphan
  • Feuillard Vincent
  • Sabourin Anne
  Computational Statistics, Springer Verlag, 2020, 35 (2), pp.607-628. In a wide variety of situations, anomalies in the behaviour of a complex system, whose health is monitored through the observation of a random vector X = (X1,. .. , X d) valued in R d , correspond to the simultaneous occurrence of extreme values for certain subgroups α ⊂ {1,. .. , d} of variables Xj. Under the heavy-tail assumption, which is precisely appropriate for modeling these phenomena, statistical methods relying on multivariate extreme value theory have been developed in the past few years for identifying such events/subgroups. This paper exploits this approach much further by means of a novel mixture model that permits to describe the distribution of extremal observations and where the anomaly type α is viewed as a latent variable. One may then take advantage of the model by assigning to any extreme point a posterior probability for each anomaly type α, defining implicitly a similarity measure between anomalies. It is explained at length how the latter permits to cluster extreme observations and obtain an informative planar representation of anomalies using standard graph-mining tools. The relevance and usefulness of the clustering and 2-d visual display thus designed is illustrated on simulated datasets and on real observations as well, in the aeronautics application domain. (10.1007/s00180-019-00913-y)
  DOI : 10.1007/s00180-019-00913-y
• PDL in Optical Links: a Model Analysis and a Demonstration of a PDL-Resilient Modulation
  
  • Dumenil Arnaud
  • Awwad Elie
  • Measson Cyril
  Journal of Lightwave Technology, Institute of Electrical and Electronics Engineers (IEEE)/Optical Society of America(OSA), 2020, pp.1-1. (10.1109/JLT.2020.2998841)
  DOI : 10.1109/JLT.2020.2998841
• Low-Complexity Adaptive Spatial Processing of ESPAR Antenna Systems
  
  • Bucheli Garcia Juan Carlos
  • Kamoun Mohamed
  • Sibille Alain
  IEEE Transactions on Wireless Communications, Institute of Electrical and Electronics Engineers, 2020, 19 (6), pp.3700-3711. (10.1109/TWC.2020.2975800)
  DOI : 10.1109/TWC.2020.2975800
• Les probabilités ont la cote !
  
  • Zayana Karim
  • Rioul Olivier
  CultureMath, ENS, 2020. Cet article est consacré à la formule de Bayes, plus précisément dans sa version « cotée », très fonctionnelle. Après en avoir rappelé le principe, nous en décortiquons les applications dans les domaines du test médical et du filtrage anti-spam
• Hybrid and Optical Packet Switching Supporting Different Service Classes in Data Center Network
  
  • Minakhmetov Artur
  • Ware Cédric
  • Iannone Luigi
  Photonic Network Communications, Springer Verlag, 2020, 40 (3), pp.293-302.
• Multi-Cloud Chaining with Segment Routing
  
  • Spinelli Francesco
  • Iannone Luigi
  • Tollet Jerome
  , 2020. In recent years, next to Cloud Computing, Network Function Virtualization (NFV) has emerged as one of the most interesting paradigms inside the ICT world, leading to unex-plored scenarios and new features such as Service Chaining. The latter consisting in steering the packets through a sequence of services on their way to the destination. Even more, these services can be located inside different Public Clouds, hence giving us the possibility to exploit for the first time a Multi-Cloud approach. One way to perform Service Chaining is through the new Segment Routing protocol for IPv6. Within this context we have investigated how we could create, inside Amazon Web Services, a Multi-Cloud configuration to provide Service Chaining, leveraging on the Vector Packet Processing (VPP) software router for packet handling and SRv6 processing. We performed extensive measurement campaigns, looking in particular on how VPP and Segment Routing presence could affect the overall performance inside Amazon Web Services and having a first insight on what performance can be achieved when chaining several cloud instances in different geographical regions.
• Fast and Exact Rule Mining with AMIE 3
  
  • Lajus Jonathan
  • Galárraga Luis
  • Suchanek Fabian
  , 2020, pp.36-52. Given a knowledge base (KB), rule mining finds rules such as "If two people are married, then they live (most likely) in the same place". Due to the exponential search space, rule mining approaches still have difficulties to scale to today's large KBs. In this paper, we present AMIE 3, a system that employs a number of sophisticated pruning strategies and optimizations. This allows the system to mine rules on large KBs in a matter of minutes. Most importantly, we do not have to resort to approximations or sampling, but are able to compute the exact confidence and support of each rule. Our experiments on DBpedia, YAGO, and Wikidata show that AMIE 3 beats the state of the art by a factor of more than 15 in terms of runtime. (10.1007/978-3-030-49461-2_3)
  DOI : 10.1007/978-3-030-49461-2_3
• YAGO 4: A Reason-able Knowledge Base
  
  • Pellissier Tanon Thomas
  • Weikum Gerhard
  • Suchanek Fabian
  , 2020, pp.583--596. YAGO is one of the large knowledge bases in the Linked Open Data cloud. In this resource paper, we present its latest version, YAGO 4, which reconciles the rigorous typing and constraints of schema.org with the rich instance data of Wikidata. The resulting resource contains 2 billion type-consistent triples for 64 Million entities, and has a consistent ontology that allows semantic reasoning with OWL 2 description logics. (10.1007/978-3-030-49461-2_34)
  DOI : 10.1007/978-3-030-49461-2_34
• Introduction to the Special Section on Computational Modeling and Understanding of Emotions in Conflictual Social Interactions
  
  • Damiano Rossana
  • Patti Viviana
  • Clavel Chloé
  • Rosso Paolo
  ACM Transactions on Internet Technology, Association for Computing Machinery, 2020, 20 (2), pp.1-5. (10.1145/3392334)
  DOI : 10.1145/3392334
• Detecting Faults in Inner Product Masking Scheme IPM-FD: IPM with Fault Detection
  
  • Cheng Wei
  • Carlet Claude
  • Goli Kouassi
  • Danger Jean-Luc
  • Guilley Sylvain
  Journal of Cryptographic Engineering, Springer, 2020. Side-channel analysis and fault injection attacks are two typical threats to cryptographic implementations , especially in modern embedded devices. Thus there is an insistent demand for dual side-channel and fault injection protections. As we know, masking is a kind of provable countermeasure against side-channel attacks. Recently, inner product masking (IPM) was proposed as a promising higher-order masking scheme against side-channel analysis, but not for fault injection attacks. In this paper, we devise a new masking scheme named IPM-FD. It is built on IPM, which enables fault detection. This novel masking scheme has three properties: the security orders in the word-level probing model, bit-level probing model, and the number of detected faults. IPM-FD is proven secure both in the word-level and in the bit-level probing models, and allows for end-to-end fault detection against fault injection attacks. * This work is an extension of [8] (PROOFS 2019). Furthermore, we illustrate its security order by interpreting IPM-FD as a coding problem then linking it to one defining parameters of linear code, and show its implementation cost by applying IPM-FD to AES-128. (10.1007/s13389-020-00227-6)
  DOI : 10.1007/s13389-020-00227-6
• Design of an ultra-low-power communication system for leadless pacemaker synchronization
  
  • Maldari Mirko
  , 2020. Our research focused on power optimized solutions for the communication between Leadless Cardiac Pacemakers (LCP) to allow a synchronized therapy among devices implanted in different cardiac chambers. A promising solution is the Intra-Body Communication (IBC), which uses biological tissues as transmission medium. The attenuation of the communication channels were characterized using an accurate torso model that has been verified by means of in-vivo experiments. An ultra-low power receiver has been designed in CMOS technology according to the sensitivity requirement coming from the intra-cardiac channel characterization. Moreover, a novel communication strategy has been proposed to minimize the power consumption of the receiver reducing the impact in terms of device longevity. The research results show the feasibility of a telemetry driven synchronization of LCPs, paving the way toward multiple-leadless pacemaker systems that might improve the quality of treatment of the bradycardia patients. This work was part of the WiBEC project. It is a multi-disciplinary project aiming to develop the wireless technologies for novel implantable devices.
• Domestiquer l’information énergétique : Confronter les choix de conception de dispositifs de feedback et les pratiques des usagers pour proposer une démarche de design
  
  • Lacroix Samuel
  , 2020. Avec pour objectif d’engager les usagers à consommer moins d’électricité, des dispositifs de feedback ont été produits ces 20 dernières années. Cependant, de nombreuses études pointent leurs limites dans le contexte domestique. Dans cette thèse, nous soutenons que la prise en considération des pratiques réelles des usagers, pourrait permettre de générer de nouvelles pistes d’appareils de feedbacks énergétiques. Nous réalisons un Design Space pour décrire le point de vue des concepteurs. Nous analysons leurs choix, tels que les données utilisées, les manières de les représenter, de les diffuser, ainsi que les tâches attribuées aux usagers. En contrepoint, nous menons une étude empirique auprès de 10 participants. Grâce aux entretiens et aux observations effectués in situ, nous décrivons et analysons la manière dont ces derniers perçoivent l’électricité, estiment leurs consommations et adoptent des stratégies d’accès aux informations énergétiques. D’importants écarts entre ces deux points de vue sont identifiés. Nous nous appuyons sur ces constatations pour proposer des perspectives pour de futures conceptions. La seconde partie de cette thèse relate l’exploration d’une de ces perspectives. À la croisée des enjeux industriels et académiques, la définition d’un concept de dispositif, appelé « Interstices Informationnels », est proposée. Pour explorer ce concept, nous concevons un atelier de création où 15 propositions sont générées par un groupe d’étudiants en design. Les « Interstices Informationnels » seront repris avec les designers du DesignLab d’EDF. Quatre démonstrateurs sont créés et brevetés.
• Resonant optical feedback in epitaxial 1.3-µm passively mode-locked quantum dot lasers on silicon
  
  • Dong Bozhang
  • de Labriolle Xavier Champagne
  • Huang Heming
  • Duan Jianan
  • Grillot Frédéric
  • Liu Songtao
  • Norman Justin C
  • Bowers John E
  , 2019.
• Failure and Attack Detection by Digital Sensors
  
  • Anik Md Toufiq Hasan
  • Saini Rachit
  • Danger Jean-Luc
  • Guilley Sylvain
  • Karimi Naghmeh
  , 2020, pp.1-2. (10.1109/ETS48528.2020.9131580)
  DOI : 10.1109/ETS48528.2020.9131580
• PUF Enrollment and Life Cycle Management: Solutions and Perspectives for the Test Community
  
  • Ali Pour Amir
  • Beroulle Vincent
  • Cambou Bertrand
  • Danger Jean-Luc
  • Di Natale Giorgio
  • Hely David
  • Guilley Sylvain
  • Karimi Naghmeh
  , 2020, pp.1-10. Physically Unclonable Functions (PUFs) allow to extract unique fingerprints from silicon chips. The applications are numerous: chip identification, chip master key extraction, authentication protocol, unique seeding, etc. However, secure usage of PUF requires some precautions. This paper reviews industrial concerns associated with PUF operation, including those occurring before and after market. Namely, starting from PUF “secure”specifications, aligned with state-of-the-art standards, we explore innovative techniques to handle enrollment and subsequent PUF queries, in nominal as well as in adversarial environment.
• Packet scheduling and computation offloading for energy harvesting devices without CSIT
  
  • Fawaz Ibrahim
  • Sarkiss Mireille
  • Ciblat Philippe
  , 2020. This paper proposes a joint packet scheduling and computation offloading policy for an Energy Harvesting (EH) mobile terminal wirelessly connected to a Base Station (BS) when the channel between the mobile and the BS is unavailable at the mobile side. The mobile terminal has to decide if its packet related to one application is computed either locally or remotely by the BS within a strict delay imposed by this application without knowing the channel in advance. Our objective is to guarantee reliable communication by minimizing the packet loss. This packet loss is due to buffer overflow, strict delay violation and channel mismatch. We formulate the problem using a Markov Decision Process (MDP) and we propose and implement the optimal deterministic offline policy to solve it. This optimal policy decides: (i) the execution location (locally or remotely), (ii) the number of packets to be executed and (iii) the corresponding transmission power. This policy offers a dramatic increase in the number of executed packets and a significant energy saving. (10.1109/VTC2020-Spring48590.2020.9128717)
  DOI : 10.1109/VTC2020-Spring48590.2020.9128717
• DARE: A Reports Dataset for Global Misbehavior Authority Evaluation in C-ITS
  
  • Haidar Farah
  • Kamel Joseph
  • Jemaa Ines Ben
  • Kaiser Arnaud
  • Lonc Brigitte
  • Urien Pascal
  , 2020. European and North American governments are actively working on improving road safety and traffic efficiency. To this end, their corresponding standardization bodies: ETSI and IEEE are developing the Cooperative Intelligent Transport Systems (C-ITS). In this system, vehicles and road side units communicate in order to enable new services and propose cooperative safety applications. However, the system is vulnerable to new types of threats if not adequately secured. The security and privacy protection is crucial to the user acceptance of such new system. Currently, the ETSI and IEEE proposed using a specific vehicular Public Key Infrastructure (PKI) to protect the C-ITS system. The PKI can protect the system against external attackers but it still vulnerable to internal attacks. Registered vehicles with valid certificates can still disturb the system by misusing its applications. The aim of misbehavior detection is to detect and mitigate the effect of internal attackers. The current misbehavior detection architecture includes a local embedded component and a cloud component. In this paper, we propose a misbehavior reports dataset of derived from the local embedded detection of misbehaving entities. This dataset can be used to further develop and evaluate the cloud component. The set includes different road topology, varying attacker penetration rates and attack scenarios.
• Fractional Derivatives for Edge Detection: Application to Road Obstacles
  
  • Abi Zeid Daou Roy
  • El Samarani Fabio
  • Yaacoub Charles
  • Moreau Xavier
  , 2020, pp.115-137. (10.1007/978-3-030-14718-1_6)
  DOI : 10.1007/978-3-030-14718-1_6
• “Talk to you later”
  
  • Rollet Nicolas
  • Clavel Chloé
  Interaction Studies, John Benjamins Publishing Co, 2020, 21 (2), pp.268-292. (10.1075/is.19001.roll)
  DOI : 10.1075/is.19001.roll
• “Talk to you later” Doing social robotics with conversation analysis. Towards the development of an automatic system for the prediction of disengagement
  
  • Rollet Nicolas
  • Clavel Chloé
  Interaction Studies, John Benjamins Publishing Co, 2020, 21 (2), pp.268-292. Abstract This article presents an applied discussion of the possibility of integrating conversation analysis (CA) methodology into that of machine learning. The aim is to improve the detection of that which resembles disengagement in the interaction between a robot and a human. We offer a novel analytical assemblage at the heart of the two disciplines, and namely on the level of the annotation schemes provided by conversation analysis transcription methods. First, we demonstrate that the need for a stable structure in establishing an interaction scenario and in designing robot behaviours does not prevent the emergence of ordinariness or creativity among the participants engaged in this interaction. Secondly, based on an actual case, we emphasize the possibility of systematicness in CA transcription to support the choice (a) of the categories targeted by prediction methods and defined by the annotation scheme, and (b) of the verbal and non-verbal features used to create prediction models. (10.1075/is.19001.roll)
  DOI : 10.1075/is.19001.roll
• Les clés du crédit
  
  • Zayana Karim
  • Chaouch Khaled
  CultureMath, ENS, 2020. Qu'est-ce qu'un crédit ? Combien vais-je payer ? Comment cela fonctionne-t-il ?
• Low level feature detection in SAR images
  
  • Liu Chenguang
  , 2020. In this thesis we develop low level feature detectors for Synthetic Aperture Radar (SAR) images to facilitate the joint use of SAR and optical data. Line segments and edges are very important low level features in images which can be used for many applications like image analysis, image registration and object detection. Contrarily to the availability of many efficient low level feature detectors dedicated to optical images, there are very few efficient line segment detector and edge detector for SAR images mostly because of the strong multiplicative noise. In this thesis we develop a generic line segment detector and an efficient edge detector for SAR images.The proposed line segment detector which is named as LSDSAR, is based on a Markovian a contrario model and the Helmholtz principle, where line segments are validated according to their meaningfulness. More specifically, a line segment is validated if its expected number of occurences in a random image under the hypothesis of the Markovian a contrario model is small. Contrarily to the usual a contrario approaches, the Markovian a contrario model allows strong filtering in the gradient computation step, since dependencies between local orientations of neighbouring pixels are permitted thanks to the use of a first order Markov chain. The proposed Markovian a contrario model based line segment detector LSDSAR benefit from the accuracy and efficiency of the new definition of the background model, indeed, many true line segments in SAR images are detected with a control of the number of false detections. Moreover, very little parameter tuning is required in the practical applications of LSDSAR. The second work of this thesis is that we propose a deep learning based edge detector for SAR images. The contributions of the proposed edge detector are two fold: 1) under the hypothesis that both optical images and real SAR images can be divided into piecewise constant areas, we propose to simulate a SAR dataset using optical dataset; 2) we propose to train a classical CNN (convolutional neural network) edge detector, HED, directly on the graident fields of images. This, by using an adequate method to compute the gradient, enables SAR images at test time to have statistics similar to the training set as inputs to the network. More precisely, the gradient distribution for all homogeneous areas are the same and the gradient distribution for two homogeneous areas across boundaries depends only on the ratio of their mean intensity values. The proposed method, GRHED, significantly improves the state-of-the-art, especially in very noisy cases such as 1-look images.
• Surrogate modeling based on resampled polynomial chaos expansions
  
  • Liu Zicheng
  • Lesselier Dominique
  • Sudret Bruno B
  • Wiart Joe
  Reliability Engineering and System Safety, Elsevier, 2020, 202, pp.107008. In surrogate modeling, polynomial chaos expansion (PCE) is popularly utilized to represent the random model responses, which are computationally expensive and usually obtained by deterministic numerical modeling approaches including finite-element and finite-difference time-domain methods. Recently, efforts have been made to improve the prediction performance of the PCE-based model and build efficiency by only selecting the influential basis polynomials (e.g., via the approach of least angle regression). This paper proposes an approach, named resampled PCE (rPCE), to further optimize the selection by making use of the knowledge that the true model is fixed despite the statistical uncertainty inherent to sampling in the training. By simulating data variation via resampling (k-fold division utilized here) and collecting the selected polynomials with respect to all resamples, polynomials are ranked mainly according to selection frequency. The resampling scheme (the value of k here) matters much and various configurations are considered and compared. The proposed resampled PCE is implemented with two popular selection techniques, namely least angle regression and orthogonal matching pursuit, and a combination thereof. The performance of the proposed algorithm is demonstrated in two analytical examples, a benchmark problem in structural mechanics, as well as a realistic case study in computational dosimetry. (10.1016/j.ress.2020.107008)
  DOI : 10.1016/j.ress.2020.107008