Publications

2017

• Asymptotic analysis of some point processes
  
  • Vasseur Aurélien
  , 2017. Stein’s method constitutes one of the main techniques to solve some approximation problems in probability theory. In this manuscript, we apply it in the context of point processes. The first part of these investigations focuses on the Poisson point process. Its characteristic independence property provides a way to explain intuitively why a sequence of point processes becoming less and less repulsive can converge to such a point process. More generally, this leads to show some convergence results for some sequences of point processes built by several operations such as superposition, thinning and rescaling. The use of a distance on point processes, the so-called Kantorovich-Rubinstein distance, enables moreover the getting of some convergence rates. The second part is centered on a class of point processes with important attractiveness, called discrete α-stable point processes. Their structure based on a Poisson point process gives us a way to enlarge to these point processes the method used previously and to propose new results, via some properties that we state on these point processes.
• Shape Proxies: Modeling the World’s Geometry With a Few Numbers
  
  • Boubekeur Tamy
  , 2017.
• A computational model of moral and legal responsibility via simplicity theory
  
  • Sileno Giovanni
  • Saillenfest Antoine
  • Dessalles Jean-Louis
  , 2017, 302, pp.171-176. Responsibility, as referred to in everyday life, as explored in moral philosophy and debated in jurisprudence, is a multiform, ill-defined but inescapable notion for reasoning about actions. Its presence in all social constructs suggests the existence of an underlying cognitive base. Following this hypothesis, and building upon simplicity theory, the paper proposes a novel computational approach. (10.3233/978-1-61499-838-9-171)
  DOI : 10.3233/978-1-61499-838-9-171
• Analyzing security breaches of countermeasures throughout the refinement process in hardware design flow
  
  • Danger Jean-Luc
  • Guilley Sylvain
  • Nguyen Philippe
  • Nguyen Robert
  • Souissi Youssef
  , 2017. (10.23919/DATE.2017.7927159)
  DOI : 10.23919/DATE.2017.7927159
• Effect of external convection on evaporating cooling for a volatile meniscus
  
  • Buffone Cosimo
  • Sefiane Khellil
  • Bennacer Rachid
  • Liu Bin
  Experimental Thermal and Fluid Science, Elsevier, 2017, 89, pp.181 - 188. (10.1016/j.expthermflusci.2017.08.006)
  DOI : 10.1016/j.expthermflusci.2017.08.006
• Modélisation formelle pour l’ingénierie système
  
  • Coudert Sophie
  • Legros Dominique
  Revue REE (Selection Journées scientifiques URSI 2017), 2017.
• Smooth Primal-Dual Coordinate Descent Algorithms for Nonsmooth Convex Optimization
  
  • Alacaoglu Ahmet
  • Tran-Dinh Quoc
  • Fercoq Olivier
  • Cevher Volkan
  , 2017.
• Continuous Ranking trough Oriented Recursive Partitions
  
  • Clémençon Stéphan
  • Achab Mastane
  , 2017.
• Impact of Information in Greedy Submodular Maximization
  
  • Grimsman David
  • Ali Mohammed Shabbir
  • Hespanha Joao P.
  • Marden Jason R.
  , 2017, pp.1-7. The maximization of submodular functions is a well-studied topic due to its application in many common engineering problems. Because this problem has been shown to be NP-Hard for certain subclasses of functions, much work has been done to develop efficient algorithms to approximate an optimal solution. Among these is a simple greedy algorithm, which has been shown to guarantee a solution within 1/2 the optimal. However, when this algorithm is implemented in a distributed way, it requires all agents to share information with one another - a costly constraint for some applications. This work explores how the degradation of information sharing among the agents affects the performance of the distributed greedy algorithm. For any underlying communication graph structure, we show results for how well the distributed greedy algorithm can perform. In addition, for applications where the number of agents and number of communication links is fixed, we identify near-optimal graph structures with the highest performance guarantees. This result can inform system designers as to the most impactful places to insert communication links.
• Massive Online Analytics for the Internet of Things (IoT)
  
  • Bifet Albert
  , 2017.
• SeamCut: Interactive Mesh Segmentation for Parameterization
  
  • Lucquin Victor
  • Boubekeur Tamy
  , 2017.
• Provenance and Probabilities in Relational Databases: From Theory to Practice
  
  • Senellart Pierre
  SIGMOD record, ACM, 2017, pp.1-11. We review the basics of data provenance in relational databases. We describe different provenance formalisms, from Boolean provenance to provenance semirings and beyond, that can be used for a wide variety of purposes, to obtain additional information on the output of a query. We discuss representation systems for data provenance, circuits in particular, with a focus on practical implementation. Finally, we explain how provenance is practically used for probabilistic query evaluation in probabilistic databases.
• Fast DD-classification of functional data
  
  • Mosler Karl
  • Mozharovskyi Pavlo
  Statistical Papers, Springer Verlag, 2017, 58 (4), pp.1055-1089. (10.1007/s00362-015-0738-3)
  DOI : 10.1007/s00362-015-0738-3
• Progress-Space Tradeoffs in Single-Writer Memory Implementations
  
  • Imbs Damien
  • Kuznetsov Petr
  • Rieutord Thibault
  , 2017. Many algorithms designed for shared-memory distributed systems assume the single-writer multi-reader (SWMR) setting where each process is provided with a unique register that can only be written by the process and read by all. In a system where computation is performed by a bounded number n of processes coming from a large (possibly unbounded) set of potential participants, the assumption of an SWMR memory is no longer reasonable. If only a bounded number of multi-writer multi-reader (MWMR) registers are provided, we cannot rely on an a priori assignment of processes to registers. In this setting, implementing an SWMR memory, or equivalently, ensuring stable writes (i.e., every written value persists in the memory), is desirable. In this paper, we propose an SWMR implementation that adapts the number of MWMR registers used to the desired progress condition. For any given k from 1 to n, we present an algorithm that uses n + k − 1 registers to implement a k-lock-free SWMR memory. In the special case of 2-lock-freedom, we also give a matching lower bound of n + 1 registers, which supports our conjecture that the algorithm is space-optimal. Our lower bound holds for the strictly weaker progress condition of 2-obstruction-freedom, which suggests that the space complexity for k-obstruction-free and k-lock-free SWMR implementations might coincide. (10.4230/LIPIcs.OPODIS.2017.9)
  DOI : 10.4230/LIPIcs.OPODIS.2017.9
• Relations between Automatically Extracted Motion Features and the Quality of Mother-Infant Interactions at 4 and 13 Months
  
  • Egmose Ida
  • Varni Giovanna
  • Cordes Katharina
  • Smith-Nielsen Johanne
  • Skovgaard Væver Mette
  • Køppe Simo
  • Cohen David
  • Chetouani Mohamed
  Frontiers in Psychology, Frontiers Media, 2017, 8. Bodily movements are an essential component of social interactions. However, the role of movement in early mother-infant interaction has received little attention in the research literature. The aim of the present study was to investigate the relationship between automatically extracted motion features and interaction quality in mother-infant interactions at 4 and 13 months. The sample consisted of 19 mother-infant dyads at 4 months and 33 mother-infant dyads at 13 months. The coding system Coding Interactive Behavior (CIB) was used for rating the quality of the interactions. Kinetic energy of upper-body, arms and head motion was calculated and used as segmentation in order to extract coarse- and fine-grained motion features. Spearman correlations were conducted between the composites derived from the CIB and the coarse- and fine-grained motion features. At both 4 and 13 months, longer durations of maternal arm motion and infant upper-body motion were associated with more aversive interactions, i.e., more parent-led interactions and more infant negativity. Further, at 4 months, the amount of motion silence was related to more adaptive interactions, i.e., more sensitive and child-led interactions. Analyses of the fine-grained motion features showed that if the mother coordinates her head movements with her infant's head movements, the interaction is rated as more adaptive in terms of less infant negativity and less dyadic negative states. We found more and stronger correlations between the motion features and the interaction qualities at 4 compared to 13 months. These results highlight that motion features are related to the quality of mother-infant interactions. Factors such as infant age and interaction set-up are likely to modify the meaning and importance of different motion features.
• Large scale automated assesment tools for code grading
  
  • Sharrock Rémi
  , 2017.
• Formal Framework for Automated Analysis and Verification of Distributed Reactive Applications
  
  • Chabane Sarah
  • Ameur-Boulifa Rabéa
  • Mezghiche Mohamed
  , 2017.
• In-the-wild chatbot corpus: from opinion analysis to interaction problem detection
  
  • Maslowski Irina
  • Lagarde Delphine
  • Clavel Chloé
  , 2017, pp.115-120. The past few years have seen growing interests in the development of online virtual assistants. In this paper, we present a system built on chatbot data corresponding to conversations between customers and a virtual assistant provided by a French energy supplier company. We aim at detecting in this data the expressions of user's opinions that are linked to interaction problems. The collected data contain a lot of "in-the-wild" features such as ungrammatical constructions and misspelling. The detection system relies on a hybrid approach mixing hand-crafted linguistic rules and unsupervised representation learning approaches. It takes advantage of the dialogue history and tackles the challenging issue of the opinion detection in "in-the-wild" conversational data. We show that the use of unsupervised representation learning approaches allows us to noticeably improve the performance (F-score = 74.3%) compared to the sole use of hand-crafted linguistic rules (F-score = 67,7%).
• An extensive performance evaluation of full-reference HDR image quality metrics
  
  • Zerman Emin
  • Valenzise Giuseppe
  • Dufaux Frederic
  Quality and User Experience, Springer, 2017, 2 (1), pp.5. High dynamic range (HDR) image and video technology has recently attracted a great deal of attention in the multimedia community, as a mean to produce truly realistic video and further improve the quality of experience (QoE) of emerging multimedia services. In this context, measuring the quality of compressed HDR content plays a fundamental role. However, full-reference (FR) HDR visual quality assessment poses new challenges with respect to the conventional low dynamic range case. Quality metrics have to be redesigned or adapted to HDR, and understanding their reliability to predict users’ judgments is even more critical due to the still limited availability of HDR displays to perform subjective evaluations. The goal of this paper is to provide a complete and thorough survey of the performance of the most popular HDR FR image quality metrics. To this end, we gather several existing HDR image databases with subjective quality annotations, in addition to a new one created by ourselves. After aligning the scores in these databases, we obtain an extensive set of 690 compressed HDR images, along with their subjective quality. Next, we analyze in depth many FR metrics, including those used in MPEG standardization, using both classical correlation analyses and classification accuracy. We believe that our results could serve as the most complete and comprehensive benchmark of image quality metrics in the field of HDR image compression. (10.1007/s41233-017-0007-4)
  DOI : 10.1007/s41233-017-0007-4
• Modeling and Analysis of HetNets with mm-Wave Multi-RAT Small Cells Deployed Along Roads
  
  • Ghatak Gourab
  • de Domenico Antonio
  • Coupechoux Marceau
  , 2017, pp.1-7. We characterize a multi tier network with classi- cal macro cells, and multi radio access technology (RAT) small cells, which are able to operate in microwave and millimeter- wave (mm-wave) bands. The small cells are assumed to be deployed along roads modeled as a Poisson line process. This characterization is more realistic as compared to the classical Poisson point processes typically used in literature. In this con- text, we derive the association and RAT selection probabilities of the typical user under various system parameters such as the small cell deployment density and mm-wave antenna gain, and with varying street densities. Finally, we calculate the signal to interference plus noise ratio (SINR) coverage probability for the typical user considering a tractable dominant interference based model for mm-wave interference. Our analysis reveals the need of deploying more small cells per street in cities with more streets to maintain coverage, and highlights that mm-wave RAT in small cells can help to improve the SINR performance of the users.
• Mimic Capacity Of Fisher And Generalized Gamma Distributions For High Resolution SAR Image Statistical Modeling
  
  • Sportouche H.
  • Nicolas Jean-Marie
  • Tupin Florence
  IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, IEEE, 2017, 10 (12), pp.5724 - 5735. <p>The aim of this paper is to compare the potential of two popular flexible laws, the Fisher distribution and the Generalized Gamma distribution, for the statistical modeling of high-resolution SAR data through an original “mimicking-based” approach. The presented study allows to evaluate the ability of both laws to correctly imitate or “mimic” another reference law, frequently used for modeling the intensity of SAR images and chosen for instance as the K law or the Weibull, Beta or log- normal laws in this work. This study uses log-cumulant statistics for parameter estimation of the imitating law and involves quantitative criteria of comparison based on the Kullback-Leibler divergences between the reference law and the Fisher law or the Generalized Gamma law. The mimicking capacities of both distributions are first analyzed for some sets of parameters describing different studied cases, covering a wide set of possible mimicked reference laws. The high modeling potential of both distributions is then illustrated on heterogeneous subscenes from real SAR intensity data. Pragmatical considerations are also taken into account to draw up recommendations about the pref- erential use of a distribution and to highlight complementarities of both Fisher and Generalized Gamma distributions, along with limitations of the approach.</p>
• Optimum NMOS/PMOS Imbalance for Energy Efficient Digital Circuits
  
  • Veirano Francisco
  • Naviner Lirida
  • Silveira Fernando
  IEEE Transactions on Circuits and Systems I: Regular Papers, IEEE, 2017.
• Near-field tailoring of mid infrared quantum cascade lasers with conventional optical feedback
  
  • Spitz O
  • Jumpertz Louise
  • Ferré S
  • Carras M
  • Grillot F
  , 2017. Quantum cascade lasers have become the most suitable laser sources from the mid-infrared to the THz range. This work examines the effects of external feedback in mid infrared quantum cascade laser structures and shows that different conditions of the incident angle of the feedback wave enable to efficiently tailor its near-field beam profile.
• Fast Lossy Compression of 3D Unit Vector Sets
  
  • Rousseau Sylvain
  • Boubekeur Tamy
  , 2017.
• Fair auto-adaptive clustering for hybrid vehicular networks
  
  • Garbiso Julian Pedro
  , 2017. For the development of innovative Intelligent Transportation Systems applications, connected vehicles will frequently need to upload and download position-based information to and from servers. These vehicles will be equipped with different Radio Access Technologies (RAT), like cellular and vehicle-to-vehicle (V2V) technologies such as LTE and IEEE 802.11p respectively. Cellular networkscan provide internet access almost anywhere, with QoS guarantees. However, accessing these networks has an economic cost. In this thesis, a multi-hop clustering algorithm is proposed in the aim of reducing the cellular access costs by aggregating information and off-loading data in the V2V network, using the Cluster Head as a single gateway to the cellular network. For the example application of uploading aggregated Floating Car Data, simulation results show that this approach reduce cellular data consumption by more than 80% by reducing the typical redundancy of position-based data in a vehicular network. There is a threefold contribution: First, an approach that delegates the Cluster Head selection to the cellular base station in order to maximize the cluster size, thus maximizing aggregation. Secondly, a self-adaptation algorithm that dynamically changes the maximum number of hops, addressing the trade-off between cellular access reduction and V2V packet loss. Finally, the incorporation of a theory of distributive justice, for improving fairness over time regarding the distribution of the cost in which Cluster Heads have to incur, thus improving the proposal’s social acceptability. The proposed algorithms were tested via simulation, and the results show a significant reduction in cellular network usage, a successful adaptation of the number of hops to changes in the vehicular traffic density, and an improvement in fairness metrics, without affecting network performance.