Sorry, you need to enable JavaScript to visit this website.
Share

Publications

2017

  • Estimateur de Tyler régularisé dans le cas sous-déterminé. Application à la détection d'objets enfouis
    • Hoarau Quentin
    • Breloy Arnaud
    • Ginolhac Guillaume
    • Atto Abdourrahmane
    • Nicolas Jean-Marie
    , 2017. Among the various covariance matrix estimators, the regularised Tyler estimator performs independently from the data distribution and is robust to data outlier corruption. However, the shrinkage parameter value selection depends on the target application and data configuration, and have a direct influence on the estimator performance results. Thus finding a generic rule optimal for every criterion is not straightforward. This paper proposes a new regularistaion parameter selection based on a subspace approach. The performances of this method are investigated both in simulation and application to the adaptive buried objects detection problem.
  • Performance et simplicité d'implantation des constellations tournées: une approche pragmatique
    • Arbi Tarak
    • Yang Jianxiao
    • Abdel Nour Charbel
    • Rioul Olivier
    • Geller Benoit
    , 2017, pp.ID29. La norme DVB-T2 est la première à utiliser les constellations QAM tournées dont les performances théoriques sont meilleures que celles des constellations QAM conventionnelles sur des canaux à évanouissements. Toutefois, leur complexité de démodulation constitue un frein pour une diffusion plus large de cette technique. Dans cet article, nous proposons une série d'angles de rotation particulière afin de mettre en oeuvre une détection de faible complexité. Les résultats obtenus montrent que la méthode proposée simplifie non seulement le récepteur mais également l'émetteur, avec souvent des performances meilleures que pour des angles de la norme DVB-T2. Le démappeur proposé réduit la complexité globale de plus de 60% par rapport à la solution la plus simple utilisée actuellement en DVB-T2.
  • LISP-Views: Monitoring LISP at Large Scale
    • Li Yue
    • Abouseif Akram
    • Iannone Luigi
    • Saucez Damien
    , 2017. The Locator/Identifier Separation Protocol (LISP) separates classical IP addresses into two categories: one for identifying terminals, the other for routing. To associate identifiers and locators LISP needs a specific mechanism, called mapping system. This technology is still at an early stage but two experimental platforms have already been deployed in the Internet: LISP Beta Network and LISP-Lab. However, only the LISP Beta Network is monitored with LISPmon that partially monitors the mapping system once a day. To accompany the growth of LISP, a dynamic and complete monitoring system is required. Therefore, we propose LISP-Views, a dynamic versatile large scale LISP monitoring architecture. LISP-Views allows to automatically conduct comprehensive and objective measurements. After running LISP-Views in the wild for several months and comparing the monitoring results with LISPmon, we confirm that LISP-Views provides more detailed and accurate information. We observe the different behaviours between every network entity within mapping system, and also explore the current LISP performance for further improvements.
  • A Semi-Automated Approach for the Co-Refinement of Requirements and Architecture Models
    • Barkowski Matthias
    • Schneider Melanie
    • Giese Holger
    • Dyck Johannes
    • Tamzalit Dalila
    • Blouin Dominique
    • Borde Etienne
    • Noppen Joost
    , 2017. Requirements and architecture specifications are strongly related as the second provides a solution to a problem stated by the first. This coupling is typically realized by traceability links and maintaining such links becomes extremely difficult as both requirements and architecture specifications frequently evolve, and in particular when the architecture is refined providing an increasing level of details. In such case, not only the traceability must evolve but the requirements must be refined as well. We present a novel semi-automated approach to evolve non-functional requirements and their traceability links following system's architecture refinement in the context of design space exploration and automated code generation. The approach has been prototyped for AADL models refined with the RAMSES tool and for model transformations implemented as Story Diagrams. (10.1109/REW.2017.52)
    DOI : 10.1109/REW.2017.52
  • Machine-Learning Meets Extreme Value Theory
    • Clémençon Stéphan
    , 2017.
  • Towards combining admission control and link scheduling in wireless mesh networks
    • Dromard Juliette
    • Khoukhi Lyes
    • Khatoun Rida
    • Begriche Youcef
    Telecommunication Systems, Springer Verlag (Germany), 2017, 66 (1), pp.39-54. Wireless mesh networks (WMNs) have emerged recently as a key solution for next-generation wireless networks; they are low cost and easily deployed technology. However, WMNs have to deal with a low bandwidth which prevents them from guaranteeing the requirements of applications with strict constraints. To overcome this limitation, we propose in this paper a new admission control model which integrates a dynamic link scheduling scheme, named ACLS, in order to optimize the network bandwidth use. We formulate the admission control problem as a binary linear programming problem (BL2P). The proposed admission control integrates an algorithm, based on the Dakin’s branch and bound (B&B) method, which respects the bandwidth and delay required by the flows. The proposed ACLS solution has been validated on ns2, and the simulation results showed that ACLS model has better performance than the reference solution BRAWN; it accepts more flows while guaranteeing their delay and bandwidth. (10.1007/s11235-016-0273-0)
    DOI : 10.1007/s11235-016-0273-0
  • An Interactive E-book with an Educational Game for Children with Developmental Disorders: A Pilot User Study
    • Pistoljevic Nirvana
    • Hulusic Vedad
    , 2017. Children diagnosed with Autism spectrum disorder (ASD), as one of the most complex neurodevelopmental disabilities, are characterized by different brain and functioning development, distinct interaction with the environment and different learning patterns, language and social skills impairments, and repetitive auto-stimulating restricting behaviors. It has been shown that computer-assisted intervention is much more attention captivating and interesting to children compared with a classic approach to teaching, allowing for faster acquisition of skills. This makes these tools and the technology highly suitable for teaching children with autism basic developmental skills. In addition, interactive electronic books showed positive outcomes for comprehension and information acquisition in children with ASD, while decreasing inappropriate children behavior in the classroom. In this paper a pilot user study on an e-book with an embedded educational game for children with developmental disorders was presented. The results show that the e-book can be efficiently used for teaching children with ASD basic developmental skills and that the learned skills can be efficiently transfered to new media and environments. The framework will provide preschool children with and without disabilities with appropriate educational software, to build up their early cognitive abilities and school readiness skills, and promote incorporating technology as part of the educational and pedagogical process in schools.
  • Comparison of the nonlinear frequency division multiplexing and OFDM in experiment
    • Gemechu Wasyhun A.
    • Song Mengdi
    • Jaouën Yves
    • Wabnitz Stephano
    • Yousefi Mansoor
    , 2017, pp.paper W.3.C.4.
  • Rethinking of I/O-Automata Composition
    • Chabane Sarah
    • Ameur-Boulifa Rabéa
    • Mezghiche Mohamed
    , 2017.
  • Adapting to unknown noise level in sparse deconvolution
    • Boyer Claire
    • de Castro Yohann
    • Salmon Joseph
    Information and Inference, Oxford University Press (OUP), 2017. In this paper, we study sparse spike deconvolution over the space of complex-valued measures when the input measure is a finite sum of Dirac masses. We introduce a modified version of the Beurling Lasso (BLasso), a semi-definite program that we refer to as the Concomitant Beurling Lasso (CBLasso). This new procedure estimates the target measure and the unknown noise level simultaneously. Contrary to previous estimators in the literature, theory holds for a tuning parameter that depends only on the sample size, so that it can be used for unknown noise level problems. Consistent noise level estimation is standardly proved. As for Radon measure estimation, theoretical guarantees match the previous state-of-the-art results in Super-Resolution regarding minimax prediction and localization. The proofs are based on a bound on the noise level given by a new tail estimate of the supremum of a stationary non-Gaussian process through the Rice method. (10.1093/imaiai/iaw024)
    DOI : 10.1093/imaiai/iaw024
  • One-to-One Matching of RTT and Path Changes
    • Wenqin Shao
    • Rougier Jean-Louis
    • Paris Antoine
    • Devienne Francois
    • Viste Mateusz
    , 2017. Route selection based on performance measurements is an essential task in inter-domain Traffic Engineering. It can benefit from the detection of significant changes in RTT measurements and the understanding on potential causes of change. Among the extensive works on change detection methods and their applications in various domains, few focus on RTT measurements. It is thus unclear which approach works the best on such data.In this paper, we present an evaluation framework for change detection on RTT times series, consisting of: 1) a carefully labelled 34,008-hour RTT dataset as ground truth;2) a scoring method specifically tailored for RTT measurements. Furthermore, we proposed a data transformation that improves the detection performance of existing methods.Path changes are as well attended to. We fix shortcomings of previous works by distinguishing path changes due to routing protocols (IGP and BGP) from those caused by load balancing.Finally, we apply our change detection methods to a large set of measurements from RIPE Atlas. The characteristics of both RTT and path changes are analyzed; the correlation between the two are also illustrated. We identify extremely frequent AS path changes yet with few consequences on RTT, which has not been reported before. (10.23919/ITC.2017.8064356)
    DOI : 10.23919/ITC.2017.8064356
  • Formalism to assess and enhance the entropy and reliability of a Loop-PUF
    • Danger Jean-Luc
    , 2017.
  • Méthode de Monte Carlo à dynamique hamiltonienne pour estimation d'un modèle thermique de bâtiment
    • Nabil Tahar
    • Moulines Eric
    • Jicquel Jean-Marc
    • Girard Alexandre
    • Lajaunie Christian
    , 2017.
  • Dynamics of ultra small semiconductor lasers
    • Sarraute Jean-Maxime
    • Schires Kevin
    • Larochelle Sophie
    • Grillot Frédéric
    , 2017.
  • Exploiting Parallelism in Hierarchical Content Stores for High-speed ICN Routers
    • Mansilha Rodrigo
    • Barcellos Marinho
    • Leonardi E.
    • Rossi Dario
    Elsevier Computer Networks, 2017, 125, pp.132-145. Information-centric network (ICN) is a novel architecture identifying data as a first class citizen, and caching as a prominent low-level feature. Yet, efficiently using large storage (e.g., 1 TB) at line rate (e.g., 10 Gbps) is not trivial: in our previous work, we proposed an ICN router design equipped with hierarchical caches, that exploits peculiarities of the ICN traffic arrival process. In this paper, we implement such proposal in the NDN Forwarding Daemon (NFD), and carry on a thorough experimental evaluation of its performance with an emulation methodology on common off the shelf hardware. Our study testifies the interest and feasibility of the approach.
  • Le dessein de Laplume
    • Rioul Olivier
    • Flandrin Patrick
    , 2017. Cet article vise à faire sortir de l’oubli un travail original de 1948 de l’ingénieur français Jacques Laplume, relatif au calcul de la capacité d’un canal bruité, qui a précédé de peu l’article de Claude E. Shannon, le fondateur de la théorie de l’information. Jacques Laplume travaillait indépendamment et isolément en France; son approche est (contrairement à Shannon) plus physique que mathématique bien qu’exploitant explicitement (comme Shannon) le caractère aléatoire du bruit. Un véritable travail de détective a permis de remonter jusqu’à sa famille pour découvrir une personnalité forte aux multiples talents qui s’inscrit dans une véritable saga familiale.
  • Effects of Magnetic Field on the Phase Change Cells and the Formation of Ice Crystals in Biomaterials: Carrot Case
    • Liu Bin
    • Song Jianfei
    • Yao Zhaodn
    • Bennacer Rachid
    Journal of Thermal Science and Engineering Applications, American Society of Mechanical Engineers, 2017, 9 (3). (10.1115/1.4035936)
    DOI : 10.1115/1.4035936
  • SINR Model for MBSFN Based Mission Critical Communications
    • Daher Alaa
    • Coupechoux Marceau
    • Godlewski Philippe
    • Kélif Jean-Marc
    • Ngouat Pierre
    • Minot Pierre
    , 2017, pp.1-5. Multicast/Broadcast Single Frequency Network (MBSFN) is envisioned to be a key technology for business and mission critical communications. The need arises to define simple and efficient dimensioning rules for such networks. The Signal to Interference plus Noise Ratio (SINR) is an important key performance parameter since other metrics such as outage probability and capacity can be deduced from it. In this work, we propose an analytical model to derive an approximate closed-form formula of the SINR in a MBSFN. Our model takes into account Inter-Symbol Interference due to the different propagation delays between the User Equipment (UE) and its serving evolved Nodes-B (eNBs). The comparison with Monte Carlo simulations shows that our approach provides accurate results when shadowing standard deviation is low. When shadowing is highly variable, our model, while less accurate, outperforms the traditional approach based on Fenton-Wilkinson. This phenomenon is due to the fact that several eNBs serve the same UE so that shadowing on every individual link compensate.
  • Character and Subword-Based Word Representation for Neural Language Modeling Prediction
    • Labeau Matthieu
    • Allauzen Alexandre
    , 2017, pp.1-13. Most of neural language models use different kinds of embeddings for word prediction. While word embeddings can be associated to each word in the vocabulary or derived from characters as well as factored morphological decomposition, these word representations are mainly used to parametrize the input, i.e. the context of prediction. This work investigates the effect of using subword units (character and factored morphological decomposition) to build output representations for neural language modeling. We present a case study on Czech, a morphologically-rich language, experimenting with different input and output representations. When working with the full training vocabulary, despite unstable training, our experiments show that augmenting the output word representations with character-based embeddings can significantly improve the performance of the model. Moreover, reducing the size of the output look-up table, to let the character-based embeddings represent rare words, brings further improvement. (10.18653/v1/W17-4101)
    DOI : 10.18653/v1/W17-4101
  • Sparse representation of multivariate extremes with applications to anomaly detection
    • Goix Nicolas
    • Sabourin Anne
    • Clémençon Stéphan
    Journal of Multivariate Analysis, Elsevier, 2017, 161, pp.12-31. Capturing the dependence structure of multivariate extreme events is a major concern in many fields involving the management of risks stemming from multiple sources, e.g., portfolio monitoring, insurance, environmental risk management and anomaly detection. One convenient (nonparametric) characterization of extreme dependence in the framework of multivariate Extreme Value Theory (EVT) is the angular measure, which provides direct information about the probable “directions” of extremes, i.e., the relative contribution of each feature/coordinate of the largest observations. Modeling the angular measure in high-dimensional problems is a major challenge for the multivariate analysis of rare events. The present paper proposes a novel methodology aiming at exhibiting a particular kind of sparsity within the dependence structure of extremes. This is achieved by estimating the amount of mass spread by the angular measure on representative sets of directions corresponding to specific sub-cones of Rd+. This dimension reduction technique paves the way towards scaling up existing multivariate EVT methods. Beyond a non-asymptotic study providing a theoretical validity framework for our method, we propose as a direct application a first anomaly detection algorithm based on multivariate EVT. This algorithm builds a sparse normal profile of extreme behaviors, to be confronted with new (possibly abnormal) extreme observations. Illustrative experimental results provide strong empirical evidence of the relevance of our approach. (10.1016/j.jmva.2017.06.010)
    DOI : 10.1016/j.jmva.2017.06.010
  • Unsharp Masking Geometry Improves 3D Prints
    • Herholz Philipp
    • Koch Sebastian
    • Boubekeur Tamy
    • Alexa Marc
    Computer & Graphics (Proc. Shape Modeling International 2017), 2017, 66, pp.135-142. Mass market digital manufacturing devices are severely limited in accuracy and material, resulting in a significant gap between the appearance of the virtual and the real shape. In imaging as well as rendering of shapes, it is common to enhance features so that they are more apparent. We provide an approach for feature enhancement that directly operates on the geometry of a given shape, with particular focus on improving the visual appearance for 3D printing. The technique is based on unsharp masking, modified to handle arbitrary free-form geometry in a stable, efficient way, without causing large scale deformation. On a series of manufactured shapes we show how features are lost as size of the object decreases, and how our technique can compensate for this. We evaluate this effect in a human subject experiment and find significant preference for modified geometry.
  • MuLoG, or How to apply Gaussian denoisers to multi-channel SAR speckle reduction?
    • Deledalle Charles-Alban
    • Denis Loïc
    • Tabti Sonia
    • Tupin Florence
    IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2017, 26 (9), pp.4389-4403. Speckle reduction is a longstanding topic in synthetic aperture radar (SAR) imaging. Since most current and planned SAR imaging satellites operate in polarimetric, interferometric or tomographic modes, SAR images are multi-channel and speckle reduction techniques must jointly process all channels to recover polarimetric and interferometric information. The distinctive nature of SAR signal (complex-valued, corrupted by multiplicative fluctuations) calls for the development of specialized methods for speckle reduction. Image denoising is a very active topic in image processing with a wide variety of approaches and many denoising algorithms available, almost always designed for additive Gaussian noise suppression. This paper proposes a general scheme, called MuLoG (MUlti-channel LOgarithm with Gaussian denoising), to include such Gaussian denoisers within a multi-channel SAR speckle reduction technique. A new family of speckle reduction algorithms can thus be obtained, benefiting from the ongoing progress in Gaussian denoising, and offering several speckle reduction results often displaying method-specific artifacts that can be dismissed by comparison between results. (10.1109/TIP.2017.2713946)
    DOI : 10.1109/TIP.2017.2713946
  • Minimisation de la puissance émise dans les réseaux ad hoc utilisant l'ARQ hybride de Type-I sur canal de Rice
    • Leturc Xavier
    • Le Martret C.
    • Ciblat Philippe
    , 2017.
  • Procede de simplification de modele de geometrie
    • Legrand Hélène
    • Boubekeur Tamy
    , 2017.
  • Identification of a thermal building model by learning the dynamics of the solar flux
    • Nabil Tahar
    • Roueff François
    • Jicquel Jean-Marc
    • Girard Alexandre
    , 2017.