Publications

2017

• Métasurfaces et antennes : nouvelles perspectives pour l’aéronautique et le spatial
  
  • Lepage A. C.
  • Begaud Xavier
  , 2017.
• Conferencing in Wyner's Asymmetric Interference Network: Effect of Number of Rounds
  
  • Wigger Michèle
  • Timo Roy
  • Shamai Shlomo
  IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2017, 63 (2), pp.1199 - 1226.
• k-Nearest Neighbours Classification Based Sybil Attack Detection in Vehicular Networks
  
  • Gu Pengwenlong
  • Khatoun Rida
  • Begriche Youcef
  • Serhrouchni Ahmed
  , 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
• Nonnegative Matrix Factorisation for multimodal data analysis
  
  • Essid Slim
  , 2017.
• Privacy Preserving Biometric Identity Verification
  
  • Chollet Gérard
  • Jimenez Abelino
  • Petrovska-Delacrétaz Dijana
  • Raj Bhiksha
  , 2017.
• 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.
• Optimal Distributed Channel Assignment in D2D Networks Using Learning in Noisy Potential Games
  
  • Coupechoux Marceau
  , 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.
• 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.
• 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
• A Novel Range-Free Jammer Localization Solution in Wireless Network by Using PSO Algorithm
  
  • Pang Liang
  • Chen Xiao
  • Xue Zhi
  • Khatoun Rida
  , 2017, pp.198-211. (10.1007/978-981-10-6388-6_17)
  DOI : 10.1007/978-981-10-6388-6_17
• A sharp oracle inequality for Graph-Slope
  
  • Bellec Pierre C.
  • Salmon Joseph
  • Vaiter Samuel
  Electronic Journal of Statistics, Shaker Heights, OH : Institute of Mathematical Statistics, 2017, 11 (2), pp.4851-4870. Following recent success on the analysis of the Slope estimator, we provide a sharp oracle inequality in term of prediction error for Graph-Slope, a generalization of Slope to signals observed over a graph. In addition to improving upon best results obtained so far for the Total Variation denoiser (also referred to as Graph-Lasso or Generalized Lasso), we propose an efficient algorithm to compute Graph-Slope. The proposed algorithm is obtained by applying the forward-backward method to the dual formulation of the Graph-Slope optimization problem. We also provide experiments showing the practical applicability of the method. (10.1214/17-EJS1364)
  DOI : 10.1214/17-EJS1364
• Segmentation d’IRM de cerveaux de nouveau-nés en quelques secondes à l’aide d’un réseau de neurones convolutif pseudo-3D et de transfert d’apprentissage
  
  • Xu Yongchao
  • Géraud Thierry
  • Bloch Isabelle
  , 2017.
• Détection de l’eau dans les images radar du futur satellite SWOT
  
  • Lobry Sylvain
  • Fjortoft Roger
  • Denis L.
  • Tupin Florence
  , 2017.
• Organising Complexity: Hierarchies and Holarchies
  
  • Diaconescu Ada
  , 2017, pp.89-106.
• Vidéo-ethnographie des usages de Gallica. Une exploration au plus près de l’activité
  
  • Rollet Nicolas
  • Beaudouin Valérie
  • Garron Isabelle
  Document numérique - Revue des sciences et technologies de l'information. Série Document numérique, Hermès, 2017, 20. Dans l’objectif d’observer au plus près les parcours des utilisateurs et les spécificités de leurs pratiques sur la bibliothèque numérique Gallica, nous avons effectué des captations audiovisuelles des activités à l’écran, complétées par des entretiens d’autoconfrontation qui permettent d’élaborer du sens aux observations. Deux axes d’analyse découlent des données recueillies. Le premier porte sur les phénomènes de catégorisation et d’évaluation (d’une liste de résultats, d’un document) et souligne la façon dont une idée, guidée par des motifs et dynamisée par de la sérendipité, peut émerger et se configurer dans le temps de la consultation. Le second explore la dimension écologique de l’usage de Gallica. Il met en lumière que l’utilisateur de Gallica est engagé dans de nombreuses opérations structurantes associant environnement numérique, matériel et social. (10.3166/dn.2017.00014)
  DOI : 10.3166/dn.2017.00014
• Reassigned Time-Frequency Representations of Discrete Time Signals and Application to the Constant Q Transform
  
  • Fenet Sébastien
  • Badeau Roland
  • Richard Gael
  Signal Processing, Elsevier, 2017, 132, pp.170-176. In this paper we provide a formal justification of the use of time-frequency reassignment techniques on time-frequency transforms of discrete time signals. State of the art techniques indeed rely on formulae established in the continuous case which are applied, in a somehow inaccurate manner, to discrete time signals. Here, we formally derive a general framework for discrete time reassignment. To illustrate its applicability and generality, this framework is applied to a specific transform: the Constant Q Transform. (10.1016/j.sigpro.2016.10.008)
  DOI : 10.1016/j.sigpro.2016.10.008