Publications

2018

• Estimation d'un circuit électrique équivalent, à résistances et capacités thermiques, d'un bâtiment pour le contrôle optimal du chauffage du bâtiment
  
  • Nabil Tahar
  • Jicquel Jean-Marc
  • Girard Alexandre
  • Roueff François
  , 2018, pp.https://permalink.orbit.com/RenderStaticFirstPage?XPN=S5GmjW98%252BeXWqxLm4QBXD3fDUqlXTJ5uwQdFuycu4uk%3D%26n%3D1&id=0&base=FAMPAT. The invention relates to a method for determining a thermal model of a building equipped with a heating installation, in particular for energy diagnosis or optimization of the heating of said building, wherein: - An overall energy consumption load curve (CDC) is obtained from at least one energy consumption meter (COC), In predefined time steps, said load curve being capable of containing a consumption payload (Qu) for heating the building by said installation as well as a load for consumption needs not linked to the heating of the building, - And of one or more connected objects associated with respective appliances, which consume energy and are not controlled for a heat supply (ACN), at least one item of information on the switching on or off of said appliances (ACN), And time intervals are detected in the load curve (CDC) during which the connected objects inform of a stop state of the respective apparatuses, in order to obtain a first estimate of said payload (Qu), which makes it possible to iteratively correct the model for its optimization.
• Generalization Bounds for Minimum Volume Set Estimation based on Markovian Data, ISAIM, International Symposium on Artificial Intelligence and Mathematics proceedings, 1-7
  
  • Bertail Patrice
  • Ciołek Gabriela
  • Clémençon Stéphan
  , 2018.
• An In-depth Comparison of Group Betweenness Centrality Estimation Algorithms
  
  • Chehreghani Mostafa Haghir
  • Bifet Albert
  • Abdessalem Talel
  , 2018, pp.2104-2113.
• Audio-Visual Analysis of Music Performances
  
  • Duan Zhiyao
  • Essid Slim
  • Liem Cynthia
  • Richard Gael
  • Sharma Gaurav
  IEEE Signal Processing Magazine, Institute of Electrical and Electronics Engineers, 2018.
• Statistical Inference with Ensemble of Clustered Desparsified Lasso
  
  • Chevalier Jérôme-Alexis
  • Salmon Joseph
  • Thirion Bertrand
  , 2018. Medical imaging involves high-dimensional data, yet their acquisition is obtained for limited samples. Multivariate predictive models have become popular in the last decades to fit some external variables from imaging data, and standard algorithms yield point estimates of the model parameters. It is however challenging to attribute confidence to these parameter estimates, which makes solutions hardly trustworthy. In this paper we present a new algorithm that assesses parameters statistical significance and that can scale even when the number of predictors p ≥ 10^5 is much higher than the number of samples n ≤ 10^3 , by lever-aging structure among features. Our algorithm combines three main ingredients: a powerful inference procedure for linear models –the so-called Desparsified Lasso– feature clustering and an ensembling step. We first establish that Desparsified Lasso alone cannot handle n p regimes; then we demonstrate that the combination of clustering and ensembling provides an accurate solution, whose specificity is controlled. We also demonstrate stability improvements on two neuroimaging datasets.
• Identifier Randomization: An Efficient Protection Against CAN-Bus Attacks
  
  • Danger Jean-Luc
  • Karray Khaled
  • Guilley Sylvain
  • Elaabid M. Abdelaziz
  , 2018, pp.219-254. (10.1007/978-3-319-98935-8_11)
  DOI : 10.1007/978-3-319-98935-8_11
• Adding Missing Words to Regular Expressions
  
  • Rebele Thomas
  • Tzompanaki Aikaterini
  • Suchanek Fabian M.
  , 2018.
• Assessing Locator/Identifier Separation Protocol interworking performance through RIPE Atlas
  
  • Li Yue
  • Iannone Luigi
  , 2018.
• Operations research and voting theory
  
  • Hudry Olivier
  , 2018, pp.20-41.
• A Survey on Data-driven Dictionary-based Methods for 3D Modeling
  
  • Lescoat Thibault
  • Ovsjanikov Maks
  • Memari Pooran
  • Thiery Jean-Marc
  • Boubekeur Tamy
  Computer Graphics Forum, Wiley, 2018. Dictionaries are very useful objects for data analysis, as they enable a compact representation of large sets of objects through the combination of atoms. Dictionary-based techniques have also particularly benefited from the recent advances in machine learning, which has allowed for data-driven algorithms to take advantage of the redundancy in the input dataset and discover relations between objects without human supervision or hard-coded rules. Despite the success of dictionary-based techniques on a wide range of tasks in geometric modeling and geometry processing, the literature is missing a principled state-of-the-art of the current knowledge in this field. To fill this gap, we provide in this survey an overview of data-driven dictionary-based methods in geometric modeling. We structure our discussion by application domain: surface reconstruction, compression, and synthesis. Contrary to previous surveys, we place special emphasis on dictionary-based methods suitable for 3D data synthesis, with applications in geometric modeling and design. Our ultimate goal is to enlight the fact that these techniques can be used to combine the data-driven paradigm with design intent to synthesize new plausible objects with minimal human intervention. This is the main motivation to restrict the scope of the present survey to techniques handling point clouds and meshes, making use of dictionaries whose definition depends on the input data, and enabling shape reconstruction or synthesis through the combination of atoms.
• Ultra-low noise dual-frequency VECSEL at telecom wavelength using fully correlated pumping
  
  • Liu Hui
  • Gredat Grégory
  • De Syamsundar
  • Fsaifes Ihsan
  • Ly Aliou
  • Vatré Rémy
  • Baili Ghaya
  • Bouchoule Sophie
  • Goldfarb Fabienne
  • Bretenaker Fabien
  Optics Letters, Optical Society of America - OSA Publishing, 2018, 43 (8), pp.1794. An ultra-low intensity and beatnote phase noise dual-frequency vertical-external-cavity surface-emitting laser is built at telecom wavelength. The pump laser is realized by polarization combining two single-mode fibered laser diodes in a single-mode fiber, leading to a 100% in-phase correlation of the pump noises for the two modes. The relative intensity noise is lower than −140 dB∕Hz, and the beatnote phase noise is suppressed by 30 dB, getting close to the spontaneous emission limit. The role of the imperfect cancellation of the thermal effect resulting from unbalanced pumping of the two modes in the residual phase noise is evidenced. (10.1364/OL.43.001794)
  DOI : 10.1364/OL.43.001794
• Perception of Emotions and Body Movement in the Emilya Database
  
  • Fourati Nesrine
  • Pelachaud Catherine
  IEEE Transactions on Affective Computing, Institute of Electrical and Electronics Engineers, 2018, 9 (1), pp.90-101. In this paper, we examine the perception of emotions as well as the characterization and the classification of emotional body expressions based on perceptual body cues ratings. Emilya (EMotional body expression In daILY Actions), a database of body expressions of 8 emotions (including Neutral) in 7 daily actions performed by 11 actors, is used for these purposes. A perceptual study is conducted to explore four issues: 1) how expressed emotions are perceived by humans, 2) how emotion recognition by humans differs across daily actions, 3) how expressed emotions are characterized by humans through body cues, and 4) how emotions are automatically classified based on human rating of body cues. Across all the actions, most of the expressed emotions were correctly identified, but some were confused (e.g. Shame and Sadness). Confusions occurring at the level of emotion perception may be due to a lack of contextual factors (Emilya contains body movement of daily actions without reference to a context), to a similarity of bodily expressions, but also to the lack of other modalities that may contribute to a better recognition of bodily expression of these emotions (e.g. facial expressions). In the paper, we detail and discuss the results from these different studies. (10.1109/TAFFC.2016.2591039)
  DOI : 10.1109/TAFFC.2016.2591039
• Adaptive Window Strategy for Topic Modeling in Document Streams
  
  • Murena Pierre-Alexandre
  • Al-Ghossein Marie
  • Abdessalem Talel
  • Cornuéjols Antoine
  , 2018.
• 4 Leaf Clover RenderingImproving Monte Carlo Path Tracing with Double hierarchies and collaborative denoising
  
  • Boubekeur Tamy
  , 2018.
• Procédé de détection de défaillances et limitations des capteurs à l'aide des communications Car2X
  
  • Monteuuis Jean-Philippe
  • Mafrica Stefano
  • Labiod Houda
  • Servel Alain
  • Zhang Jun
  , 2018.
• Attribute‐based broadcast encryption scheme for lightweight devices
  
  • Canard Sébastien
  • Hieu Phan Duong
  • Trinh Viet Cuong
  IET Information Security, Institution of Engineering and Technology, 2018, 12 (1), pp.52-59. (10.1049/iet-ifs.2017.0157)
  DOI : 10.1049/iet-ifs.2017.0157
• Blind separation of a large number of sparse sources
  
  • Kervazo C.
  • Bobin Jerome
  • Chenot C.
  Signal Processing, Elsevier, 2018, 150, pp.157-165. Blind Source Separation (BSS) is one of the major tools to analyze multi-spectral data with applications that range from astronomical to biomedical signal processing. Nevertheless, most BSS methods fail when the number of sources becomes large, typically exceeding a few tens. Since the ability to estimate large number of sources is paramount in a very wide range of applications, we introduce a new algorithm, coined block-Generalized Morphological Component Analysis (bGMCA) to specifically tackle sparse BSS problems when large number of sources need to be estimated. Sparse BSS being a challenging nonconvex inverse problem in nature, the role played by the algorithmic strategy is central, especially when many sources have to be estimated. For that purpose, the bGMCA algorithm builds upon block-coordinate descent with intermediate size blocks. Numerical experiments are provided that show the robustness of the bGMCA algorithm when the sources are numerous. Comparisons have been carried out on realistic simulations of spectroscopic data. (10.1016/j.sigpro.2018.04.006)
  DOI : 10.1016/j.sigpro.2018.04.006
• Complexity of the computation of dominating sets in graphs
  
  • Hudry Olivier
  , 2018.
• Mathématiques à/en portée
  
  • Zayana Karim
  Au fil des maths, APMEP, 2018. Le langage mathématique et le langage musical ont de particulier que les mots, les signes, les symboles, n'y désignent pas seulement des objets : ils les incarnent [1]. Mieux : mathématiques et musique se parlent et se comprennent, au point que leur dialogue fut souvent fructueux : l'étude méthodique du monocorde, attribuée à Pythagore ; la pratique, en amateur, de la guitare par Zorn ; l'usage des probabilités par Xénakis ; l'emploi des transformations géométriques par Bach en sont autant d'exemples. Et si les deux disciplines ont leur grammaire, axiomes et théorèmes dans un cas, solfège et harmonie dans l'autre, elles ne se renouvellent que parce qu'elles savent perpétuellement réinventer et dépasser leurs règles. En voici un aperçu, à la portée du collégien. Par Karim Zayana, inspecteur général, professeur invité à Télécom Paristech.. La portée mathématique du langage musical Quand on lit de la musique, on fait déjà, sans le savoir des mathématiques. Une portée, c'est un axe horizontal-axe des temps, et un axe vertical-axe des notes, lesquelles notes sont indissociablement liées à des fréquences, et donc des nombres. Ajoutons une origine, marquée par la clé qui sert de référence, figure 1. Petit raffinement : l'axe vertical n'est, en vérité, pas gradué linéairement mais logarithmiquement. Quand on franchit un barreau, du DO au RÉ par exemple, on multiplie en fait la fréquence par à peu près 9 8 ⁄. Et quand on passe d'un MI au FA, on la multiplie à peu près par la racine carrée de ce nombre, √ 9 8 ⁄ = 3 2√2 ⁄. Autre fait remarquable : nous venons de décrire ce qui s'apparente à la représentation graphique d'une fonction telle que nous la rencontrons communément aujourd'hui. En cela, la musique avait quelques siècles d'avance sur les mathématiques, qui n'ont adopté ce mode d'explicitation qu'au XVII e siècle. Une portée musicale, nous l'avons dit, c'est un repère. Et la géométrie s'invite dès lors spontanément. On va reconnaître, sur certaines partitions, les effets de transformations du plan : translations et symétries ou association des deux. La translation horizontale traduit un décalage temporel, qu'on retrouve dans l'écriture du canon. La translation verticale est, elle, plus ou moins une transposition, c'est-à-dire que l'on Figure 1 Figure 2
• Phase evolution of the direct detection noise figure of a nondegenerate fiber phase-sensitive amplifier
  
  • Labidi Tarek
  • Fsaifes Ihsan
  • Xie Weilin
  • Chatterjee Debanuj
  • Goldfarb Fabienne
  • Bretenaker Fabien
  Optics Letters, Optical Society of America - OSA Publishing, 2018, 43 (18), pp.4546. We experimentally investigate the evolution of the direct detection noise figure of a nondegenerate phase-sensitive amplifier based on a nonlinear fiber, as a function of the relative phase between the signal, idler, and pump, all other parameters remaining fixed. The use of a fiber with a high stimulated Brillouin scattering threshold permits us to investigate the full range of phase-sensitive gain and noise figure without pump dithering. Good agreement is found with theory, both for signal only and combined signal and idler direct detections. (10.1364/OL.43.004546)
  DOI : 10.1364/OL.43.004546
• Shannon et la théorie de l'information
  
  • Rioul Olivier
  , 2018. Analyse de la publication de C.E. Shannon, &quot;A mathematical Theory of Communication&quot;, The Bell System Technical Journal, Vol. 27, pp. 379–423, 623-656, July, October, 1948 (55 pages)</p> Dans ce texte fondateur de la théorie de l’information, Shannon définit la notion de communication, la fonde sur celle de probabilité, définit le terme bit comme mesure logarithmique de l’information, ainsi que la notion d’entropie informatique (par analogie avec celle de Boltzmann en physique statistique). Il définit aussi mathématiquement la capacité d’un canal de transmission : on peut transmettre l’information de façon fiable tant que le débit ne dépasse pas cette capacité – le bruit présent dans le canal ne limite pas la qualité de la communication, mais uniquement le débit de transmission.</p>
• Uniformly Projected RCQD QAM: A Low-Complexity Signal Space Diversity Solution over Fading Channels With or Without Erasures
  
  • Arbi Tarak
  • Geller Benoit
  • Yang Jianxiao
  • Abdel Nour Charbel
  • Rioul Olivier
  IEEE Transactions on Broadcasting, Institute of Electrical and Electronics Engineers, 2018. —Rotated and cyclic Q-delayed (RCQD) M-QAM (Quadrature Amplitude Modulation) provides signal space diversity and thus improves system performance over fading channels. However, previously published RCQD solutions were designed without fully considering the high demodulation complexity which prohibits wider applications. In this paper, a complete solution is proposed to reduce complexity for both the modulator and the demodulator. This solution uses a series of rotation angles α =arctan(1/ √ M) which bring many interesting properties to the RCQD signals. A simplified sphere demapping algorithm is derived for fading channels with and without erasure events. In contrast to the sphere-decoder used for MIMO detection, the radius of the proposed sphere-demapper involves an exact amount of constellation points, thereby ensuring to perform the soft demapping operation successfully. Moreover, when either the in-phase (I) or the quadrature component (Q) is erased, the proposed demapping algorithm performs as well as the full-complexity Max-Log algorithm, with a reduced complexity. Compared to the solution currently used in DVB-T2, the proposed method reduces tremendously the computational complexity while still achieving similar performance over fading channels and even better performance over fading erasure channels. (10.1109/TBC.2018.2811618)
  DOI : 10.1109/TBC.2018.2811618
• A Generative Model for Non-Intrusive Load Monitoring in Commercial Buildings
  
  • Henriet Simon
  • Şimşekli Umut
  • Fuentes Benoît
  • Richard Gael
  Energy and Buildings, Elsevier, 2018. In the recent years, there has been an increasing academic and industrial interest for analyzing the electrical consumption of commercial buildings. Whilst having similarities with the Non Intrusive Load Monitoring (NILM) tasks for residential buildings, the nature of the signals that are collected from large commercial buildings introduces additional difficulties to the NILM research causing existing NILM approaches to fail. On the other hand, the amount of publicly available datasets collected from commercial buildings is very limited, which makes the NILM research even more challenging for this type of large buildings. In this study, we aim at addressing these issues. We first present an extensive statistical analysis of both commercial and residential measurements from public and private datasets and show important differences. Secondly, we develop an algorithm for generating synthetic current waveforms. We then demonstrate using real measurement and quantitative metrics that both our device model and our simulations are realistic and can be used to evaluate NILM algorithms. Finally, to encourage research on commercial buildings we release a synthesized dataset.
• Open data in the hotel industry: leveraging forthcoming events for hotel recommendation
  
  • Al-Ghossein Marie
  • Abdessalem Talel
  • Barré Anthony
  Information Technology \& Tourism, 2018.
• Experimental investigation of practical unforgeable quantum money
  
  • Bozzio Mathieu
  • Orieux Adeline
  • Trigo Vidarte Luis
  • Zaquine Isabelle
  • Kerenidis Iordanis
  • Diamanti Eleni
  npj Quantum Information, Nature, 2018, 4 (1). Wiesner's unforgeable quantum money scheme is widely celebrated as the first quantum information application. Based on the no-cloning property of quantum mechanics, this scheme allows for the creation of credit cards used in authenticated transactions offering security guarantees impossible to achieve by classical means. However, despite its central role in quantum cryptography, its experimental implementation has remained elusive because of the lack of quantum memories and of practical verification techniques. Here, we experimentally implement a quantum money protocol relying on classical verification that rigorously satises the security condition for unforgeability. Our system exploits polarization encoding of weak coherent states of light and operates under conditions that ensure compatibility with state-of-the-art quantum memories. We derive working regimes for our system using a security analysis taking into account all practical imperfections. Our results constitute a major step towards a real-world realization of this milestone protocol. (10.1038/s41534-018-0058-2)
  DOI : 10.1038/s41534-018-0058-2