Publications

2018

• Adaptive collaborative topic modeling for online recommendation
  
  • Al-Ghossein Marie
  • Murena Pierre-Alexandre
  • Abdessalem Talel
  • Barré Anthony
  • Cornuéjols Antoine
  , 2018, pp.9 p.. Collaborative filtering (CF) mainly suffers from rating sparsity and from the cold-start problem. Auxiliary information like texts and images has been leveraged to alleviate these problems, resulting in hybrid recommender systems (RS). Due to the abundance of data continuously generated in real-world applications, it has become essential to design online RS that are able to handle user feedback and the availability of new items in real-time. These systems are also required to adapt to drifts when a change in the data distribution is detected. In this paper, we propose an adaptive collaborative topic modeling approach, CoAWILDA, as a hybrid system relying on adaptive online Latent Dirichlet Allocation (AWILDA) to model newly available items arriving as a document stream and incremental matrix factorization for CF. The topic model is maintained up-to-date in an online fashion and is retrained in batch when a drift is detected using documents automatically selected by an adaptive windowing technique. Our experiments on real-world datasets prove the effectiveness of our approach for online recommendation. (10.1145/3240323.3240363)
  DOI : 10.1145/3240323.3240363
• Weighted Spectral Embedding of Graphs
  
  • Bonald Thomas
  • Hollocou Alexandre
  • Lelarge Marc
  , 2018. We present a novel spectral embedding of graphs that incorporates weights assigned to the nodes, quantifying their relative importance. This spectral embedding is based on the first eigenvectors of some properly normalized version of the Laplacian. We prove that these eigenvectors correspond to the configurations of lowest energy of an equivalent physical system, either mechanical or electrical, in which the weight of each node can be interpreted as its mass or its capacitance, respectively. Experiments on a real dataset illustrate the impact of weighting on the embedding.
• The Database Version Approach: Overview and Future directions
  
  • Abdessalem Talel
  • Bauzer Medeiros Claudia
  • Cellary Wojciech
  • Gançarski Stéphane
  • Jouini Khaled
  • Manouvrier Maude
  • Rukoz Marta
  • Zam Michel
  , 2018. En 1990, W. Cellary et G. Jomier ont proposé l’approche des VBD(Version de Bases de Données), qui permet de gérer des bases de données multiversions, c-à-d celles dans lesquelles plusieurs versions d’un ensemble de données coexistent. Depuis lors, ce modèle,sa théorie et ses algorithmes ont été adoptés dans une multitude de projets de recherche et de publications, et ont été appliqués à divers domaines d’applications, en particulier ceux dans lesquels ilest nécessaire de garder la trace de l’évolution parallèle ou (spatio) temporelle des états du monde modélisé. Cet article présente une vue d’ensemble de l’approche des VBD et de certains des projets de recherche associés au cours des trois dernières décennies. Cet article a été écrit en hommage à Geneviève Jomier, professeur émérite de l’Université de Paris-Dauphine, qui nous a quittée en mars 2018.
• Bash Datalog: Answering Datalog Queries with Unix Shell Commands
  
  • Rebele Thomas
  • Tanon Thomas Pellissier
  • Suchanek Fabian M.
  , 2018. Dealing with large tabular datasets often requires extensive preprocessing. This preprocessing happens only once, so that loading and indexing the data in a database or triple store may be an overkill. In this paper, we present an approach that allows preprocessing large tabular data in Datalog – without indexing the data. The Datalog query is translated to Unix Bash and can be executed in a shell. Our experiments show that, for the use case of data preprocessing, our approach is competitive with state-of-the-art systems in terms of scalability and speed, while at the same time requiring only a Bash shell, and a Unix-compatible operating system. (10.1007/978-3-030-00671-6_33)
  DOI : 10.1007/978-3-030-00671-6_33
• Learning-based Tracking of AoAs and AoDs in mmWave Networks
  
  • Ghadikolaei Hossein
  • Ghauch Hadi
  • Fischione Carlo
  , 2018, pp.45-50. (10.1145/3264492.3264500)
  DOI : 10.1145/3264492.3264500
• A local-global principle for the real continuum
  
  • Rioul Olivier
  • Magossi José Carlos
  , 2018, 47, pp.213-240. We discuss the implications of a local-global (or global-limit) principle for proving the basic theorems of real analysis. The aim is to improve the set of available tools in real analysis, where the local-global principle is used as a unifying principle from which the other completeness axioms and several classical theorems are proved in a fairly direct way. As a consequence, the study of the local-global concept can help establish better pedagogical approaches for teaching classical analysis. (10.1007/978-3-319-98797-2_11)
  DOI : 10.1007/978-3-319-98797-2_11
• Representativeness of Knowledge Bases with the Generalized Benford’s Law
  
  • Soulet Arnaud
  • Giacometti Arnaud
  • Bouchou Markhoff Béatrice
  • Suchanek Fabian M.
  , 2018. Knowledge bases (KBs) such as DBpedia, Wikidata, and YAGO contain a huge number of entities and facts. Several recent works induce rules or calculate statistics on these KBs. Most of these methods are based on the assumption that the data is a representative sample of the studied universe. Unfortunately, KBs are biased because they are built from crowdsourcing and opportunistic agglomeration of available databases. This paper aims at approximating the representativeness of a relation within a knowledge base. For this, we use the generalized Benford's law, which indicates the distribution expected by the facts of a relation. We then compute the minimum number of facts that have to be added in order to make the KB representative of the real world. Experiments show that our unsupervised method applies to a large number of relations. For numerical relations where ground truths exist, the estimated representativeness proves to be a reliable indicator.
• Impact of Aging on the Reliability of Delay PUFs
  
  • Karimi Naghmeh
  • Danger Jean-Luc
  • Guilley Sylvain
  Journal of Electronic Testing: : Theory and Applications, Springer Verlag, 2018, 34 (5), pp.571-586. (10.1007/s10836-018-5745-6)
  DOI : 10.1007/s10836-018-5745-6
• Single-event transient effects on dynamic comparator in 28nm FDSOI CMOS technology
  
  • Maciel Nilson
  • Crespo Marques Elaine
  • Naviner Lirida
  • Cai Hao
  Microelectronics Reliability, Elsevier, 2018, 88-90, pp.965-968.
• POSTER: Circular AON: A very fast Scheme to protect Encrypted Data Against Key Exposure
  
  • Kapusta Katarzyna
  • Memmi Gérard
  , 2018.
• Speed-accuracy tradeoff of aimed movement: A formal information-theoretic transmission scheme (FITTS)
  
  • Gori Julien
  • Rioul Olivier
  • Guiard Yves
  ACM Transactions on Computer-Human Interaction, Association for Computing Machinery, 2018, 25 (5), pp.27:1-27:33. The rationale for Fitts’ law is that pointing tasks have the information-theoretic analogy of sending a signal over a noisy channel, thereby matching Shannon’s capacity formula. Yet, the currently received analysis is incomplete and unsatisfactory: There is no explicit communication model for pointing; there is a confusion between central concepts of capacity (a mathematical limit), throughput (an average performance measure), and bandwidth (a physical quantity); and there is also a confusion between source and channel coding so that Shannon’s Theorem 17 can be misinterpreted. We develop an information-theoretic model for pointing tasks where the index of difficulty (ID) is the expression of both a source entropy and a zero-error channel capacity. Then, we extend the model to include misses at rate ε and prove that ID should be adjusted to (1 − ε)ID. Finally, we reflect on Shannon’s channel coding theorem and argue that only minimum movement times, not performance averages, should be considered. (10.1145/3231595)
  DOI : 10.1145/3231595
• Distributed hypothesis testing with collaborative detection
  
  • Escamilla Pierre
  • Zaidi Abdellatif
  • Wigger Michèle
  , 2018.
• A fast algorithm for occlusion detection and removal
  
  • Yang Xiaoyi
  • Gousseau Yann
  • Maître Henri
  • Tendero Yohann
  , 2018, pp.2505-2509. This paper describes a simple and fast algorithm for removing occlusions that may occur in multiple views of a scene. In contrast to many methods of the literature, no assumption is made on occlusion shapes, colors or motions. Instead, this new method assumes that the background can be re-warped using an homography and that the reflectivity is quasi-Lambertian. After geometric and photometric alignments, three methods are evaluated. A median based method, a novel algorithm based on maximal clique detection and a robust PCA method are compared on real and simulated image sequences. This comparison shows that the new clique-based method provides the best performance in terms of quality and reliability.
• Energy-Aware Distribution of Data Fragments in Unattended Wireless Sensor Networks
  
  • Choi Hongbeom
  • Ko Young-Bae
  • Lim Keun-Woo
  , 2018. In this paper, we study and analyze data fragment placement techniques to exploit their problems and design an energy-aware fragment placement method in Unattended Wireless Sensor Networks (UWSN). In UWSN, the survivability of data is of utmost importance because sensed data cannot be immediately transmitted and must reside in the storage of sensor nodes for extended periods of time. The data, which have delay-tolerant characteristics, can be exploited by attackers that access the storage to erase or steal the data. Even though data fragmentation methods have been designed to solve this problem, these works do not consider a critical issue of where to place data fragments in the sensor network. In this work, we show that basic existing methods of data fragment placement have some problems, especially in terms of energy efficiency and data survival probability. Based on our analysis, we propose a lightweight method that allows us to efficiently select sensor nodes that are used to safely distribute and place data fragments. We show through simulation and preliminary testbed analysis that our proposed method can improve the overall performance of data fragmentation. (10.1109/SSIC.2018.8556816)
  DOI : 10.1109/SSIC.2018.8556816
• Utilizing the Complex Dynamics of InAs/GaAs Quantum Dot lasers for Ultrafast Devices
  
  • Grillot Frédéric
  , 2018.
• Design and Analysis of an Ultra-wideband Metamaterial Absorber with Composite Materials
  
  • Rance Olivier
  • Lepage A. C.
  • Begaud Xavier
  • Soiron M.
  • Barka André
  • Parneix Patrick
  , 2018.
• Cross-Domain Recommendation in the Hotel Sector
  
  • Al-Ghossein Marie
  • Abdessalem Talel
  • Barré Anthony
  , 2018, pp.1-6.
• Selective All-Or-Nothing Transform: Protecting Outsourced Data Against Key Exposure
  
  • Kapusta Katarzyna
  • Memmi Gérard
  , 2018.
• Entrainment of chaotic optical power dropouts driven by weak modulation in a quantum cascade laser with optical feedback
  
  • Spitz Olivier
  • Wu Jiagui
  • Wong Chee-Wei
  • Carras Mathieu
  • Grillot Frédéric
  , 2018.
• Segmentation automatique des ovaires et des follicules en IRM pour le calcul de la volumétrie ovarienne et le comptage folliculaire
  
  • Fondin Maxime
  • Gori Pietro
  • Adamsbaum Catherine
  • Bloch Isabelle
  , 2018, pp.952.
• Speed-accuracy tradeoff of aimed movement: A formal information-theoretic transmission scheme (FITTS)
  
  • Gori Julien
  • Rioul Olivier
  • Guiard Yves
  ACM Transactions on Computer-Human Interaction, Association for Computing Machinery, 2018, 25 (5), pp.Article 27 (33 pp.). The rationale for Fitts’ law is that pointing tasks have the information-theoretic analogy of sending a signal over a noisy channel, thereby matching Shannon’s capacity formula. Yet, the currently received analysis is incomplete and unsatisfactory: There is no explicit communication model for pointing; there is a confusion between central concepts of capacity (a mathematical limit), throughput (an average performance measure) and bandwidth (a physical quantity); and there is also a confusion between source and channel coding so that Shannon’s Theorem 17 can be misinterpreted. We develop an information-theoretic model for pointing tasks where the index of difficulty ID is the expression of both a source entropy and a zero-error channel capacity. Then, we extend the model to include misses at rate ε and prove that ID should be adjusted to (1 − ε )ID. Finally, we reflect on Shannon’s channel coding theorem and argue that only minimum movement times, not performance averages, should be considered
• Low linewidth enhancement factor and high optical feedback resistance of p-doped silicon based quantum dot lasers
  
  • Duan J.
  • Huang H.
  • Jung D.
  • Norman J.
  • Bowers J. E
  • Grillot F.
  , 2018, pp.1-2. This work shows that p-doped quantum dot lasers grown on silicon exhibit a low linewidth enhancement factor and hence a high resistance against optical feedback which are promising for isolator-free transmissions in photonic integrated circuits. (10.1109/IPCon.2018.8527184)
  DOI : 10.1109/IPCon.2018.8527184
• Synchronization Costs in Parallel Programs and Concurrent Data Structures
  
  • Aksenov Vitalii
  , 2018. To use the computational power of modern computing machines, we have to deal with concurrent programs. Writing efficient concurrent programs is notoriously difficult, primarily due to the need of harnessing synchronization costs. In this thesis, we focus on synchronization costs in parallel programs and concurrent data structures. First, we present a novel granularity control technique for parallel programs designed for the dynamic multithreading environment. Then in the context of concurrent data structures, we consider the notion of concurrency-optimality and propose the first implementation of a concurrency-optimal binary search tree that, intuitively, accepts a concurrent schedule if and only if the schedule is correct. Also, we propose parallel combining, a technique that enables efficient implementations of concurrent data structures from their parallel batched counterparts. We validate the proposed techniques via experimental evaluations showing superior or comparable performance with respect to state-of-the-art algorithms. From a more formal perspective, we consider the phenomenon of helping in concurrent data structures. Intuitively, helping is observed when the order of some operation in a linearization is fixed by a step of another process. We show that no wait-free linearizable implementation of stack using read, write, compare&swap and fetch&add primitives can be help-free, correcting a mistake in an earlier proof by Censor-Hillel et al. Finally, we propose a simple way to analytically predict the throughput of data structures based on coarse-grained locking.
• Analyse des sentiments dans les conversations humain-agent Vers un modèle des goûts de l'utilisateur
  
  • Langlet Caroline
  , 2018. Cette thèse se situe à la croisée de deux domaines de recherche : celui de l'analyse des sentiments et celui des agents conversationnels animés. Les agents conversationnels animés peuvent être définis comme des personnages virtuels ayant la capacité de converser avec un utilisateur humain. Afin d’accroître les compétences communicationnelles de l’agent, il est important que celui-ci soit doté d’une forme d’intelligence socio-émotionnelle. L’agent doit être ainsi en capacité de gérer des signaux socio-émotionnels, tant du côté de la génération que de celui de la détection. Du côté de la génération, de nombreux travaux ont produit des modèles optimisant la production de gestes ou d’expressions faciales pour exprimer soit des émotions soit des attitudes sociales. Du côté de la détection, une majorité des travaux se concentrent sur l’analyse d’indices socio-affectifs non-verbaux (expressions faciales, indices acoustiques). Le contenu verbal et les expressions de sentiment qu’il véhicule restent quant à lui encore partiellement exploité. En effet, les rares études, intégrant un module de détection des sentiments de l’utilisateur dans le cadre de conversations humain-agent, ne prennent pas en compte les spécificités de ce contexte d’interaction. Pour combler cette lacune, notre travail s’intéresse à l’analyse du contenu verbal produit par l’utilisateur et à la manière dont celui-ci réfère ou exprime des sentiments, des affects ou des attitudes. Nous en proposons un modèle de détection au cours d’une interaction multi-modale et en face à face avec un agent conversationnel animé. Pour construire ce modèle, deux questions se sont posées à nous. Dans un premier temps, il nous a fallu identifier, au sein de la vaste classe des expressions de sentiment, celles qui apparaissaient comme les plus pertinentes pour l’élaboration des stratégies de communication de l’agent. Dans un second temps, nous avons dû choisir une méthode devant être non seulement opérante pour une analyse à grain fin de ces expressions, mais également adaptable au contexte conversationnel. Nos contributions s’articulent autour de trois axes. Tout d’abord, nous fournissons une analyse approfondie des expressions de sentiment. Trois unités conversationnelles sont considérées : le tour de parole, la paire adjacente et la séquence thématique. Cette analyse met en évidence un certain nombre de caractéristiques nécessaires au développement d’un ensemble de règles de détection. Ensuite, nous proposons un modèle de détection symbolique intégrant des règles sémantiques et des grammaires formelles. Ce modèle repose sur une analyse ascendante des énoncés – du niveau lexical au niveau phrastique – et se concentre successivement sur trois cadres d’analyse : le tour de parole, la paire adjacente et la séquence thématique. Enfin, nous proposons un protocole d’évaluation pour la validation des règles. Grâce à la création de deux plateformes d’annotation, nous avons pu créer deux jeux d’annotations sur deux corpus différents : un corpus de small-talk et un corpus de négociation. Les performances du système ont ainsi pu être évaluées par rapport aux références obtenues.
• Improvement of the angle measurement accuracy for indoor UWB localization
  
  • Awarkeh Nour
  • Cousin Jean-Christophe
  • Muller Muriel
  • Samama Nel
  , 2018, pp.285 - 288. As the demand for indoor localization increases, several ultrawideband (UWB) localization systems are proposed and evaluated. The most difficult challenge for positioning is to find the simplest and most accurate indoor localization method. In this paper, a method of a 2D UWB indoor localization system is presented, allowing to improve the accuracy of angular measurement using a sliding window correlation method. The proposed architecture is simple, and the position of a tag is determined by the relative range and angle from the dedicated localization base station. The experimental results show that the proposed method can achieve high accuracy in estimating position and angle (10.23919/EuRAD.2018.8546539)
  DOI : 10.23919/EuRAD.2018.8546539