Publications

2020

• Full-duplex for cellular networks : a stochastic geometry approach
  
  • Arrano Scharager Hernan
  , 2020. Full-duplex (FD) is a principle in which a transceiver can receive and transmit on the same time-frequency radio resource. The principle was long held as impractical due to the high self-interference that arises when simultaneously transmitting and receiving in the same resource block. When assuming perfect self-interference cancellation, FD can potentially double the spectral efficiency (SE) of a given point-to-point communication. In practice though, it is not possible to achieve the aforementioned characteristic. Moreover, under a cellular network context, not only the self-interference limits the performance, since additional co-channel interference is created by base stations (BSs) and users equipment (UEs). However, even with the higher interference dowlinks (DLs) still obtain higher SE performances, whereas uplinks (ULs) are generally critically degraded, when compared to half-duplex (HD). We focus our work in the study of alternatives that can help improve the impaired ULs in FD networks, while still trying to profit from the gains experienced by DLs.In this regard, we use stochastic geometry along the thesis as a means to characterize key performance indicators of cellular networks, such as: coverage probability, average SE and data rates. The thesis is divided into three major studies. Firstly, we propose a duplex-switching policy which enables BSs to operate in FD- or HD- depending on the UL and DL conditions. Secondly, we investigate the performance of hybrid HD/FD networks under a millimeter wave context. Finally, we propose a novel algorithm based on nonorthogonal multiple-access (NOMA) and successive interference cancellation (SIC), which allows BSs to coordinate on their respective transmission schemes to reduce the BS-to-BS interference. We demonstrate that the models presented in the thesis allow to balance the gains of one link over the other; reducing the UL degradation, while maintaining DL gains. In addition, we show that scenarios in which equipment is able to perform beamforming are ideal for FD deployments, since they directly reduce the cochannel interference.
• A New Network Configuration Management Architecture for Future Aircraft Systems
  
  • Delmas Thibault
  • Iannone Luigi
  • Garcia Jean-Pierre
  • Monsuez Bruno
  , 2020. Aircraft systems are evolving and being enhanced thanks to new design paradigms leveraging on recent technology advances in embedded systems. However, the Integrated Modular Avionics (IMA) model, used in current avionics, has shown important limitations to accommodate such evolution. These new paradigms demand for much more global system modularity than what IMA is able to offer. Such system evolution has as well an impact on the underlying different networks present on aircrafts. In this context, it is mandatory to investigate the kind and the breadth of adaptation networks need in order to cope with new requirements. To this end, this paper we firstly investigate the current aircrafts network configuration and management procedures. It appears that they lack the features, more specifically, the configuration management features, necessary to support these new use cases. We then look at proposals trying to fulfil this features gap. Each of them, while providing parts of the answers, also come with trade-off or insufficiencies that prevent them from fully answering to the new needs. Then, a new network configuration architecture able to cope with the newly defined configuration management requirements is provided. A comparison to the other approaches is presented, so to highlight how the proposed architecture better fulfils long-term evolution requirements while being less complex and more suitable for current configuration procedures than the other proposal. Finally, a simulation of the configuration architecture is done to provide insights on the new proposed features.
• Hardware / Software / Analog System Partitioning with SysML and SystemC-AMS
  
  • Genius Daniela
  • Apvrille Ludovic
  , 2020. Model-driven approaches for designing software and hardware parts of embedded systems are generally limited to their digital parts. On the other hand, virtual prototyping and co-simulation have emerged as a promising research topic, but target the modeling levels when partitioning has already been performed. This paper presents a model-driven platform for the partitioning of analog/mixed-signal systems. keywords: virtual prototyping, embedded systems , analog/mixed signal, design space exploration
• Towards Formal Verification of Autonomous Driving Supervisor Functions
  
  • Assioua Yasmine
  • Ameur-Boulifa Rabéa
  • Guitton-Ouhamou Patricia
  , 2020. In the software development lifecycle, errors and flaws can be introduced in the different phases and lead to failures. Establishing a set of functional requirements helps producing safe software. However, ensuring that the (being) developed software is compliant with those requirements is a challenging task due to the lack of automatic and formal means to lead this verification. In this paper, we present our approach that aims at analysing a collection of automotive requirements by using formal methods. The proposed approach for formal verification is evaluated by the application to supervisor functions of the autonomous driving (AD) system, the system in charge of self-driving.
• Invited Lecture on Continous-Variable Quantum Key Distribution
  
  • Alleaume Romain
  , 2020.
• Engineering Railway Systems with an Architecture-Centric Process Supported by AADL and ALISA: an Experience Report
  
  • Crisafulli Paolo
  • Blouin Dominique
  • Caron Françoise
  • Maxim Cristian
  , 2020. The increasing automation of transportation systems has contributed to the emergence of the so-called Cyber-Physical Systems (CPS), which are computation-based systems in which computing devices, sensors, actuators and networks collaborate to monitor and control physical entities via feedback loops. To cope with the increasing complexity of such systems, engineering teams require model-based tools, because they can provide early virtual integration and verification, reuse of existing models, requirements traceability and support of an incremental development process. However, these benefits can only be earned if the chosen modelling languages are expressive enough to capture all aspects necessary to perform the virtual verifications with the required confidence degree.
• Prédiction conformelle profonde pour des modèles robustes
  
  • Messoudi Soundouss
  • Rousseau Sylvain
  • Destercke Sébastien
  , 2020, RNTI-E-36, pp.301-308. Les réseaux profonds, comme d'autres modèles, peuvent associer une confiance élevée à des prédictions peu fiables. Rendre ces modèles robustes et fiables est donc essentiel, surtout pour les décisions critiques. Ce papier montre expérimentalement que la prédiction conformelle, et plus particulièrement l'ap-proche de [Hechtlinger et al. (2018)], apporte une solution convaincante à ce défi. La prédiction conformelle fournit un ensemble de classes couvrant la vraie classe avec avec une fréquence choisie au préalable par l'utilisateur. Dans le cas où l'exemple à prédire est atypique, la prédiction conformelle prédira l'en-semble vide. Les expériences menées montrent le bon comportement de l'ap-proche conformelle, en particulier lorsque les données sont bruitées.
• Innovative ATMEGA8 Microcontroler Static Authentication Based on SRAM PUF
  
  • Urien Pascal
  , 2020, pp.1-2. (10.1109/CCNC46108.2020.9045502)
  DOI : 10.1109/CCNC46108.2020.9045502
• High Security Bare Metal Bluetooth Blockchain Payment Terminal For Trusted Ethereum Transaction
  
  • Urien Pascal
  , 2020, pp.1-2. (10.1109/CCNC46108.2020.9045146)
  DOI : 10.1109/CCNC46108.2020.9045146
• On the Effect of Aging on Digital Sensors
  
  • Anik Md Toufiq Hasan
  • Guilley Sylvain
  • Danger Jean-Luc
  • Karimi Naghmeh
  , 2020, pp.189-194. (10.1109/VLSID49098.2020.00050)
  DOI : 10.1109/VLSID49098.2020.00050
• Static Data-Flow Analysis of UML/SysML Functional Views for Signal and Image Processing Applications
  
  • Enrici Andrea
  • Apvrille Ludovic
  • Pacalet Renaud
  • Pham Minh Hiep
  , 2020, pp.101-126. (10.1007/978-3-030-37873-8_5)
  DOI : 10.1007/978-3-030-37873-8_5
• Nonparametric imputation by data depth
  
  • Mozharovskyi Pavlo
  • Josse Julie
  • Husson François
  Journal of the American Statistical Association, Taylor & Francis, 2020, 115 (529), pp.241-253. The presented methodology for single imputation of missing values borrows the idea from data depth --- a measure of centrality defined for an arbitrary point of the space with respect to a probability distribution or a data cloud. This consists in iterative maximization of the depth of each observation with missing values, and can be employed with any properly defined statistical depth function. On each single iteration, imputation is narrowed down to optimization of quadratic, linear, or quasiconcave function being solved analytically, by linear programming, or the Nelder-Mead method, respectively. Being able to grasp the underlying data topology, the procedure is distribution free, allows to impute close to the data, preserves prediction possibilities different to local imputation methods (k-nearest neighbors, random forest), and has attractive robustness and asymptotic properties under elliptical symmetry. It is shown that its particular case --- when using Mahalanobis depth --- has direct connection to well known treatments for multivariate normal model, such as iterated regression or regularized PCA. The methodology is extended to the multiple imputation for data stemming from an elliptically symmetric distribution. Simulation and real data studies positively contrast the procedure with existing popular alternatives. The method has been implemented as an R-package. (10.1080/01621459.2018.1543123)
  DOI : 10.1080/01621459.2018.1543123
• Improving Interpretability for Computer-aided Diagnosis tools on Whole Slide Imaging with Multiple Instance Learning and Gradient-based Explanations
  
  • Pirovano A.
  • Heuberger H.
  • Berlemont S.
  • Ladjal S.
  • Bloch Isabelle
  , 2020, LNCS 12446, pp.43-53.
• A lightweight ECC-based authentication scheme for Internet of Things (IoT)
  
  • Hammi Badis
  • Fayad Achraf
  • Khatoun Rida
  • Zeadally Sherali
  IEEE Systems Journal, IEEE, 2020. (10.1109/JSYST.2020.2970167)
  DOI : 10.1109/JSYST.2020.2970167
• From Interferometric to Tomographic Synthetic Aperture Radar. Scatterer unmixing in urban areas: A review of synthetic aperture radar tomography-processing techniques
  
  • Rambour Clement
  • Budillon Alessandra
  • Johnsy Angel
  • Denis Loïc
  • Tupin Florence
  • Schirinzi Gilda
  IEEE geoscience and remote sensing magazine, IEEE, 2020, 8 (2).
• Discrete and stochastic coalitional storage games
  
  • Kiedanski Diego
  • Orda Ariel
  • Kofman Daniel
  , 2020. To achieve a fully decarbonized power grid, a massive deployment of renewable energy resources will be needed, but because of the intermittent nature of their generation, their full potential will not be unleashed unless demand side flexibility plays a bigger role than today. Introducing energy storage at the residential level enables increasing load flexibility, as it allows end-customers to easily change their consumption profile and adapt to the grid requirements. As of today, energy storage for residential consumers represents a considerable investment that is not guaranteed to be profitable. Shared investment models in which a group of consumers jointly acquires energy storage have been proposed in the literature to increase the attractiveness of these devices. Such models naturally employ concepts of cooperative game theory. In this paper, we extend the state-of-the-art cooperative game for modeling the shared investment in storage by adding two crucial extensions: stochasticity of the load and discreetness of the storage device capacity. As our goal is to increase storage capacity in the grid, the number of devices that would be acquired by a group of players that cooperate according to our proposed scheme is compared to the number of devices that would be bought by consumers acting individually. Under the same criteria of customer profitability , simulations using real data reveal that our proposed scheme can increase the deployed storage capacity between 100% and 250%. (10.1145/3396851.3397729)
  DOI : 10.1145/3396851.3397729
• Donsker's theorem in {Wasserstein}-1 distance
  
  • Coutin Laure
  • Decreusefond Laurent
  Electronic Communications in Probability, Institute of Mathematical Statistics (IMS), 2020, 25, pp.1--13. We compute the Wassertein-1 (or Kantorovitch-Rubinstein) distance between a random walk in $R^d$ and the Brownian motion. The proof is based on a new estimate of the Lipschitz modulus of the solution of the Stein's equation. As an application, we can evaluate the rate of convergence towards the local time at 0 of the Brownian motion. (10.1214/20-ECP308)
  DOI : 10.1214/20-ECP308
• « Je dois y aller ». Analyses de séquences de clôtures entre humains et robot
  
  • Licoppe Christian
  • Rollet Nicolas
  Réseaux : communication, technologie, société, Lavoisier, La Découverte, 2020, N°220-221 (2), pp.151. (10.3917/res.220.0151)
  DOI : 10.3917/res.220.0151
• Minimal linear codes from characteristic functions
  
  • Mesnager Sihem
  • Qi Y.
  • Ru H.
  • Tang C.
  IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2020.
• La transmission « naturelle » des savoirs
  
  • Dessalles Jean-Louis
  , 2020, pp.49-58. Les sociétés de chasseurs-cueilleurs n'ont pas d'écoles. Elles accumulent pourtant des savoirs, elles possèdent des langues et des cultures sophistiquées. Si l'on compare notre espèce aux autres primates, tout est différent. Les cultures animales existent, mais elles sont si restreintes qu'elles sont longtemps passées inaperçues aux yeux des éthologues. Pourquoi existe-t-il tant de « savoirs » dans notre espèce ? Et pourquoi les transmettons-nous ? Si la question semble saugrenue, c'est parce que nous avons perdu de vue le caractère apparemment contre-nature de ce comportement. Un comportement contre-nature Les chimpanzés étudiés par l'éthologue Tetsuro Matsuzawa [1994] dans la forêt de Bossou, en Guinée, cassent spontanément des noix très dures en posant la noix sur une pierre (l'enclume) et en frappant avec une autre pierre (le marteau). Leur expertise demande des années d'imitation des congénères. Les jeunes l'acquièrent en explorant un peu au hasard des centaines de combinaisons de paramètres : choix des pierres, position de l'enclume, face et angle de frappe, etc. Les adultes sont très bienveillants vis-à-vis des jeunes qui les observent, mais on ne les voit jamais leur montrer activement le bon geste et encore moins intervenir lorsqu'ils font des erreurs à répétition. L'espèce humaine offre un contraste saisissant. Prenons l'exemple des forums techniques. Imaginons un étudiant qui apprend le langage informatique Python et cherche à savoir comment inverser une liste. Il tape « python reverse list » sur son moteur de recherche et arrive sur un forum comme Stackoverflow. Il constate que sa question a déjà été posée par un autre débutant et qu'elle a obtenu 29 réponses qui ont elles-mêmes reçu 34 commentaires. Les personnes qui ont pris la peine de répondre ne connaissent pas l'étudiant. Elles font partie d'une communauté, celle des programmeurs Python, au sein de laquelle l'entraide spontanée est considérée comme normale. Paru dans : P. Pion & N. Schlanger (Eds.), Apprendre-Archéologie de la transmission des savoirs, pp. 49-58. Paris: La Découverte, 2020.
• Real-Time Deformation with Coupled Cages and Skeletons
  
  • Corda F
  • Thiery J M
  • Livesu M
  • Puppo E
  • Boubekeur T
  • Scateni R
  Computer Graphics Forum, Wiley, 2020. Skeleton-based and cage-based deformation techniques represent the two most popular approaches to control real-time deformations of digital shapes and are, to a vast extent, complementary to one another. Despite their complementary roles, high-end modelling packages do not allow for seamless integration of such control structures, thus inducing a considerable burden on the user to maintain them synchronized. In this paper, we propose a framework that seamlessly combines rigging skeletons and deformation cages, granting artists with a real-time deformation system that operates using any smooth combination of the two approaches. By coupling the deformation spaces of cages and skeletons, we access a much larger space, containing poses that are impossible to obtain by acting solely on a skeleton or a cage. Our method is oblivious to the specific techniques used to perform skinning and cage-based deformation, securing it compatible with pre-existing tools. We demonstrate the usefulness of our hybrid approach on a variety of examples. (10.1111/cgf.13900)
  DOI : 10.1111/cgf.13900
• phiflow: A Differentiable PDE Solving Framework for Deep Learning via Physical Simulations
  
  • Holl Philipp
  • Koltun Vladlen
  • Um Kiwon
  • Thuerey Nils
  , 2020.
• The Compared Costs of Domination, Location-Domination and Identification
  
  • Hudry Olivier
  • Lobstein Antoine
  Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2020, 40 (1), pp.127-147. Let G = (V, E) be a finite graph and r ≥ 1 be an integer. For v ∈ V , let B r (v) = {x ∈ V : d(v, x) ≤ r} be the ball of radius r centered at v. A set C ⊆ V is an r-dominating code if for all v ∈ V , we have B r (v) ∩ C = ∅; it is an r-locating-dominating code if for all v ∈ V , we have B r (v) ∩ C = ∅, and for any two distinct non-codewords x ∈ V \ C, y ∈ V \ C, we have B r (x) ∩ C = B r (y) ∩ C; it is an r-identifying code if for all v ∈ V , we have B r (v) ∩ C = ∅, and for any two distinct vertices x ∈ V , y ∈ V , we have B r (x) ∩ C = B r (y) ∩ C. We denote by γ r (G) (respectively, ld r (G) and id r (G)) the smallest possible cardinality of an r-dominating code (respectively, an r-locating-dominating code and an r-identifying code). We study how small and how large the three differences id r (G)−ld r (G), id r (G)−γ r (G) and ld r (G) − γ r (G) can be. (10.7151/dmgt.2129)
  DOI : 10.7151/dmgt.2129
• Complexity of voting procedures
  
  • Hudry Olivier
  , 2020.
• On the decoding of Barnes-Wall lattices
  
  • Corlay Vincent
  • Boutros Joseph
  • Ciblat Philippe
  • Brunel Loïc
  , 2020. We present new efficient recursive decoders for the Barnes-Wall lattices based on their squaring construction. The analysis of the new decoders reveals a quasi-quadratic complexity in the lattice dimension. The error rate is shown to be close to the universal lower bound in dimensions 64 and 128.