Publications

2017

• Privacy Preserving Biometric Identity Verification
  
  • Chollet Gérard
  • Jimenez Abelino
  • Petrovska-Delacrétaz Dijana
  • Raj Bhiksha
  , 2017.
• Nonnegative Matrix Factorisation for multimodal data analysis
  
  • Essid Slim
  , 2017.
• Challenges, Solutions and Implications for Large Scale Enterprise Systems: OR in the Age of Big Data
  
  • Hudry Olivier
  , 2017.
• Low profile superstrate using Transformation Optics for semicircular radiation pattern of antenna
  
  • Joshi Chetan
  • Lepage A. C.
  • Begaud Xavier
  Applied physics. A, Materials science & processing, Springer Verlag, 2017, 123 (2). In this article, a dielectric superstrate inspired from transformation optics is presented. When placed over a patch antenna, this superstrate increases the half power beam width (HPBW) of a classical patch antenna. An appropriate spatial transformation relation with spatial compression and refractive index shift factors has been used to derive an expression for a dielectric material profile. The wave front exiting from the transformed space is optimized for a semicylindrical shape. Then, a discretized version of this profile has been used to design a cuboidal superstrate. Full wave simulations have been presented that essentially show a superstrate device capable of producing a 297° of HPBW in H-plane with a peak directivity of 3.2 dBi at the design frequency. The derived solution can be realized using the standard dielectric materials for real-world applications. (10.1007/s00339-017-0787-7)
  DOI : 10.1007/s00339-017-0787-7
• Set of tuples expansion by example with reliability
  
  • Er Ngurah Agus Sanjaya
  • Ba Mouhamadou Lamine
  • Abdessalem Talel
  • Bressan Stéphane
  International Journal of Web Information Systems (IJWIS), 2017, 13 (4), pp.425-444. <p>This paper aims to focus on the design of algorithms and techniques for an effective set expansion. A tool that finds and extracts candidate sets of tuples from the World Wide Web was designed and implemented. For instance, when a given user provides , , as seeds, our system returns tuples composed of countries with their corresponding capital cities and currency names constructed from content extracted from Web pages retrieved.</p> <p> </p> <p>The seeds are used to query a search engine and to retrieve relevant Web pages. The seeds are also used to infer wrappers from the retrieved pages. The wrappers, in turn, are used to extract candidates. The Web pages, wrappers, seeds and candidates, as well as their relationships, are vertices and edges of a heterogeneous graph. Several options for ranking candidates from PageRank to truth finding algorithms were evaluated and compared. Remarkably, all vertices are ranked, thus providing an integrated approach to not only answer direct set expansion questions but also find the most relevant pages to expand a given set of seeds.</p> <p> </p> <p>The experimental results show that leveraging the truth finding algorithm can indeed improve the level of confidence in the extracted candidates and the sources.</p> <p> </p> <p>Current approaches on set expansion mostly support sets of atomic data expansion. This idea can be extended to the sets of tuples and extract relation instances from the Web given a handful set of tuple seeds. A truth finding algorithm is also incorporated into the approach and it is shown that it can improve the confidence level in the ranking of both candidates and sources in set of tuples expansion.</p> (10.1108/IJWIS-04-2017-0037)
  DOI : 10.1108/IJWIS-04-2017-0037
• Practical metrics for evaluation of fault-tolerant logic design
  
  • Stempkovskiy Alexandre
  • Telpukhov Dmitry
  • Solovyev Roman
  • Balaka Ekaterina
  • Naviner Lirida
  , 2017, pp.569-573.
• Beam steering in quantum cascade lasers with optical feedback
  
  • Jumpertz Louise
  • Ferré Simon
  • Carras Mathieu
  • Grillot Frédéric
  , 2017.
• Security-Aware Modeling and Analysis for HW/SW Partitioning
  
  • Li Letitia W.
  • Lugou Florian
  • Apvrille Ludovic
  , 2017. The rising wave of attacks on communicating embedded systems has exposed their users to risks of informa- tion theft, monetary damage, and personal injury. Through improved modeling and analysis of security, we propose that these flaws could be mitigated. Since HW/SW partitioning, one of the first phases, impacts future integration of security into the system, this phase would benefit from supporting modeling security abstrac- tions and security properties, providing designers with useful partitioning feedback obtained from a security formal analyzer. In this paper, we present how our toolkit supports security modeling, automated security integration, and formal analysis during the HW/SW partitioning phase for secure communications in embedded systems. We introduce “Cryptographic Configurations”, an abstract representation of security that allows us to verify security formally. Our toolkit further assists designers by automatically adding these security representations based on a mapping and security requirements.
• Optimal Distributed Channel Assignment in D2D Networks Using Learning in Noisy Potential Games
  
  • Coupechoux Marceau
  , 2017.
• Deploy-As-You-Go Wireless Relay Placement: An Optimal Sequential Decision Approach using the Multi-Relay Channel Model
  
  • Chattopadhyay Arpan
  • Sinha Abhishek
  • Coupechoux Marceau
  • Kumar Anurag
  IEEE Transactions on Mobile Computing, Institute of Electrical and Electronics Engineers, 2017, 16 (2), pp.341 - 354. We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of as-you-go deployment of relay nodes. The achievable rate formulas are for full-duplex radios at the relays and for decode-and-forward relaying. Deployment is done along the straight line joining a source node and a sink node at an unknown distance from the source. The problem is for a deployment agent to walk from the source to the sink, deploying relays as he walks, given the knowledge of the wireless path-loss model, and given that the distance to the sink node is exponentially distributed with known mean. As a precursor to the formulation of the deploy-as-you-go problem, we apply the multi-relay channel achievable rate formula to obtain the optimal power allocation to relays placed along a line, at fixed locations. This permits us to obtain the optimal placement of a given number of nodes when the distance between the source and sink is given. Numerical work for the fixed source-sink distance case suggests that, at low attenuation, the relays are mostly clustered close to the source in order to be able to cooperate among themselves, whereas at high attenuation they are uniformly placed and work as repeaters. We also prove that the effect of path-loss can be entirely mitigated if a large enough number of relays are placed uniformly between the source and the sink. The structure of the optimal power allocation for a given placement of the nodes, then motivates us to formulate the problem of as-you-go placement of relays along a line of exponentially distributed length, and with the exponential path-loss model, so as to minimize a cost function that is additive over hops. The hop cost trades off a capacity limiting term, motivated from the optimal power allocation solution, against the cost of adding a relay node. We formulate the problem as a total cost Markov decision process, establish results for the value function, and provide insights into the placement policy and the performance of the deployed network via numerical exploration.
• A State of the Art of Drone (In)Security
  
  • Roudier Yves
  • Tanzi Tullio Joseph
  , 2017.
• Les radiosciences au service de l’humanité
  
  • Tanzi Tullio
  • Isnard Jean
  La Revue de l'électricité et de l'électronique, Société de l'Électricité, de l'Électronique et des Technologies de l'Information et de la Communication, 2017, 2017 (5), pp.67-68.
• Simulation and design of a multistage 10W Thulium-doped double clad silica fiber amplifier at 2050nm
  
  • Romano Clément
  • Tench Robert E
  • Jaouën Yves
  • Williams Glen M
  , 2017. A careful comparison of experiment and theory is important both for basic research and systematic engineering design of Thulium fiber amplifiers operating in the 2 µm region for applications such as LIDAR or spectroscopy (e.g. CO2 atmospheric absorption at 2051.4 nm). In this paper we report the design and performance of a multistage high-power PM Tm-doped fiber amplifier, cladding pumped at 793 nm. The design is the result of a careful comparison of numerical simulation, based on a three level model including ion-ion interactions, and experiment. Our simulation model is based on precise measurements of the cross sections and other parameters for both 6 and 10 µm core diameter fibers. Good agreement for several single and multistage amplifier topologies and operating conditions will be presented. Origins of the difference between theory and experiment are discussed, with emphasis on the accuracy of the cross sections and the cross relaxation parameters. Finally based on our simulation tool, we will demonstrate a design with an output power greater than 10 W for a multistage amplifier with a single-frequency signal at 2050 nm. The power stage was constructed with a 6 µm active fiber showing a 64 % optical slope efficiency. The output power is found to be within 5 % of the simulated results and is limited only by the available launched pump power of ~24 W. No stimulated Brillouin scattering is observed at the highest output power level for an active fiber well thermalized.
• Un Modèle de Factorisation de Poisson pour la Recommandation de Points d'Intérêt
  
  • Griesner Jean-Benoît
  • Abdessalem Talel
  • Naacke Hubert
  , 2017, pp.411-416. L'explosion des volumes de données circulant sur les réseaux sociaux géo-localisés (LBSN) rend possible l'extraction des préférences des utilisateurs. En particulier ces préférences peuvent être utilisées pour recommander à l'utilisateur des points d'intérêt en adéquation avec son profil. Aujourd'hui la recommandation de points d'intérêt est devenue une composante essentielle des LBSN. Malheureusement les méthodesde recommandation traditionnelles échouent à s'adapter aux contraintes propres aux LBSN, telles que la sparsité très élevée des données, ou prendre en compte l'influence géographique. Dans ce papier nous présentons un modèle de recommandation basée sur la factorisation de Poisson qui offre une solution efficace à ces contraintes. Nous avons testé notre modèle via des expérimentations sur un jeu de données réalisteissu du LBSN Foursquare. Ces expériences nous ont permis de démontrer une meilleure qualité de recommandation que 3 modèles de l'état de l'art.
• Formal Specification and Verification of Security Guidelines
  
  • Zhioua Zeineb
  • Roudier Yves
  • Ameur-Boulifa R.
  , 2017, pp.267--273. (10.1109/PRDC.2017.51)
  DOI : 10.1109/PRDC.2017.51
• Self-Healing Umbrella Sampling: Convergence and efficiency
  
  • Fort Gersende
  • Jourdain Benjamin
  • Lelièvre Tony
  • Stoltz Gabriel
  Statistics and Computing, Springer Verlag (Germany), 2017, 27 (1), pp.147–168. The Self-Healing Umbrella Sampling (SHUS) algorithm is an adaptive biasing algorithm which has been proposed to efficiently sample a multimodal probability measure. We show that this method can be seen as a variant of the well-known Wang-Landau algorithm. Adapting results on the convergence of the Wang-Landau algorithm, we prove the convergence of the SHUS algorithm. We also compare the two methods in terms of efficiency. We finally propose a modification of the SHUS algorithm in order to increase its efficiency, and exhibit some similarities of SHUS with the well-tempered metadynamics method. (10.1007/s11222-015-9613-2)
  DOI : 10.1007/s11222-015-9613-2
• Versatile and efficient mixed–criticality scheduling for multi-core processors
  
  • Gratia Romain
  , 2017. This thesis focuses on the scheduling of mixed-criticality scheduling algorithms for multi-processors. The correctness of the execution of the real-time applications is ensured by a scheduler and is checked during the design phase. The execution platform sizing aims at minimising the number of processors required to ensure this correct scheduling. This sizing is impacted by the safety requirements. Indeed, these requirements tend to overestimate the execution times of the applications to ensure their correct executions. Consequently, the resulting sizing is costly. The mixed-criticality scheduling theory aims at proposing compromises on the guarantees of the execution of the applications to reduce this over-sizing. Several models of mixed-criticality systems offering different compromises have been proposed but all are based on the use of execution modes. Modes are ordered and tasks have non decreasing execution times in each mode. Yet, to reduce the sizing of the execution platform, only the execution of the most critical tasks is ensured. This model is called the discarding model. For simplicity reasons, most of the mixed-criticality scheduling algorithms are limited to this model. Besides, the most efficient scheduling policies for multi-processors entail too many preemptions and migrations to be actually used. Finally, they are rarely generalised to handle different models of mixed-criticality systems. However, the handling of more than two execution modes or of tasks with elastic periods would make such solutions more attractive for the industry. The approach proposed in this thesis is based on the separation of concerns between handling the execution modes and the scheduling of the tasks on the multi-processors. With this approach, we achieve to design an efficient scheduling policy that schedules different models of mixed-criticality systems. It consists in performing the transformation of a mixed-criticality task set into a non mixed-criticality one. We then schedule this task set by using an optimal hard real-time scheduling algorithm that entails few preemptions and migrations: RUN. We first apply our approach on the discarding model with two execution modes. The results show the efficiency of our approach for such model. Then, we demonstrate the versatility of our approach by scheduling systems of the discarding model with more than two execution modes. Finally, by using a method based on the decomposition of task execution, our approach can schedule systems based on elastic tasks. (10.70675/1491c0f0zc845z47ddzbbe7z506be2233f4a)
  DOI : 10.70675/1491c0f0zc845z47ddzbbe7z506be2233f4a
• Best of both worlds
  
  • Diamanti Eleni
  • Kashefi Elham
  Nature Physics, Nature Publishing Group [2005-....], 2017, 13 (1), pp.3-4. Secure communication is emerging as a significant challenge for our hyper-connected data-dependent society. The answer may lie in a clever combination of quantum and classical cryptographic techniques. (10.1038/nphys3972)
  DOI : 10.1038/nphys3972
• Non-Local Patch-Based Image Inpainting
  
  • Newson Alasdair
  • Almansa Andrés
  • Gousseau Yann
  • Pérez Patrick
  Image Processing On Line, IPOL - Image Processing on Line, 2017, 7, pp.373-385. Image inpainting is the process of filling in missing regions in an image in a plausible way. In this contribution, we propose and describe an implementation of a patch-based image inpainting algorithm. The method is actually a two-dimensional version of our video inpainting algorithm proposed in [A. Newson et al., Video inpainting of complex scenes, SIAM Journal of Imaging Sciences, 7 (2014)]. The algorithm attempts to minimize a highly non-convex functional, first introducted by Wexler et al. in [Wexler et al., Space-time video completion, CCVPR (2004)]. The functional specifies that a good solution to the inpainting problem should be an image where each patch is very similar to its nearest neighbor in the unoccluded area. Iterations are performed in a multi-scale framework which yields globally coherent results. In this manner two of the major goals of image inpainting, the correct reconstruction of textures and structures, are addressed. We address a series of important practical issues which arise when using such an approach. In particular, we reduce execution times by using the PatchMatch [C. Barnes, PatchMatch: a randomized correspondence algorithm for structural image editing, ACM Transactions on Graphics, (2009)] algorithm for nearest neighbor searches, and we propose a modified patch distance which improves the comparison of textured patches. We address the crucial issue of initialization and the choice of the number of pyramid levels, two points which are rarely discussed in such approaches. We provide several examples which illustrate the advantages of our algorithm, and compare our results with those of state-of-the-art methods. (10.5201/ipol.2017.189)
  DOI : 10.5201/ipol.2017.189
• How to Find the Best Rated Items on a Likert Scale and How Many Ratings Are Enough
  
  • Liu Qing
  • Basu Debabrota
  • Goel Shruti
  • Abdessalem Talel
  • Bressan Stéphane
  , 2017, pp.351-359. (10.1007/978-3-319-64471-4_28)
  DOI : 10.1007/978-3-319-64471-4_28
• A Multilingual System for Cyberbullying Detection: Arabic Content Detection using Machine Learning
  
  • Haidar Batoul
  • Chamoun Maroun
  • Serhrouchni Ahmed
  Advances in Science, Technology and Engineering Systems Journal, Advances in Science Technology and Engineering Systems Journal (ASTESJ), 2017, 2 (6), pp.275-284. (10.25046/aj020634)
  DOI : 10.25046/aj020634
• Similarity and Contrast on Conceptual Spaces for Pertinent Description Generation
  
  • Sileno Giovanni
  • Bloch Isabelle
  • Atif Jamal
  • Dessalles Jean-Louis
  , 2017, LNAI 10505, pp.262-275. Within the general objective of conceiving a cognitive architecture for image interpretation able to generate outputs relevant to several target user profiles, the paper elaborates on a set of operations that should be provided by a cognitive space to guarantee the generation of relevant descriptions. First, it attempts to define a working definition of contrast operation. Then, revisiting well-known results in cognitive studies, it sketches a definition of similarity based on contrast, distin- guished from the metric defined on the conceptual space.
• On the uncontended complexity of anonymous agreement
  
  • Capdevielle Claire
  • Johnen Colette
  • Kuznetsov Petr
  • Milani Alessia
  Distributed Computing, 2017, 30 (6), pp.459-468. (10.1007/s00446-017-0297-z)
  DOI : 10.1007/s00446-017-0297-z
• Non-interference and local correctness in transactional memory
  
  • Kuznetsov Petr
  • Peri Sathya
  Theor. Comput. Sci., 2017, 688, pp.103-116. (10.1016/j.tcs.2016.06.021)
  DOI : 10.1016/j.tcs.2016.06.021
• Discovery and Registration: Finding and Integrating Components into Dynamic Systems
  
  • Rodriguez Berha Helena
  • Moissinac Jean-Claude Jc
  , 2017, pp.325-349. One of the major gaps in the current HTML5 web platform is the lack of an interoperable means for a multimodal application to discover services and applications available in a given space and network, for example, in a smart house with a network of connected objects. To address this gap, the Multimodal Interaction Working Group has produced a draft specification based on distributed services, which aims to support the Discovery and Registration of multimodal components. In this approach, the components are described and virtualized in a Resources Manager communicating bidirectionally through dedicated events. To facilitate the fine-grained management of concurrent multimodal interactions, the Resources Manager registers the distributed components and provides to the Interaction Manager the means to control them. In this way, interoperable search, discovery, and selection of heterogeneous and dynamic features on the Web of Things can be performed by multimodal applications producing natural interaction and a semantically rich user experience. (10.1007/978-3-319-42816-1_15)
  DOI : 10.1007/978-3-319-42816-1_15