Author: "Orange Labs [Cesson-Sévigné]" / Database: OpenAIRE - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Orange Labs [Cesson-Sévigné]"' showing total 228 results

Start Over Author "Orange Labs [Cesson-Sévigné]" Database OpenAIRE

228 results on '"Orange Labs [Cesson-Sévigné]"'

1. Impact of Human Blockage on 5G Communication System in the 26 GHz Band

Author: Hamidou Dembele, Patrice Pajusco, Marie Le Bot, François Gallée, Orange Labs - Cesson-Sévigné (Orange Labs), Orange Labs [Cesson-Sévigné], Orange Labs, and UMR CNRS 6285 - LabSTICC
Subjects: mmWaves, Computer science, Quality of service, 020208 electrical & electronic engineering, Physical layer, 020206 networking & telecommunications, 02 engineering and technology, Communications system, antenna, Human blockage, BLER, [SPI.ELEC]Engineering Sciences [physics]/Electromagnetism, Block Error Rate, Link budget, 26 GHz, Error analysis, Order (business), propagation, Hardware_INTEGRATEDCIRCUITS, 0202 electrical engineering, electronic engineering, information engineering, Electronic engineering, link budget, 5G
Abstract: International audience; This paper deals with the impact of human blockage on 5G communication systems in millimeter-wave bands. The analysis of communication performance in terms of block error rate with and without the influence of human blockage is proposed in the 26 GHz band, thanks to the implementation of the 5G physical layer in a simulation tool. Based on the block error rate performance, a link budget is also established in order to evaluate the impact of blockage on the cell coverage.
Published: 2021
Full Text: View/download PDF

2. Adaptation for sustainable persuasion

Author: Gaëlle Calvary, Eric Villain, Anthony Foulonneau, Orange Labs [Cesson-Sévigné], Orange Labs, Ingénierie de l’Interaction Homme-Machine (IIHM), Laboratoire d'Informatique de Grenoble (LIG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Orange Labs - Cesson-Sévigné (Orange Labs), Ingénierie de l’Interaction Homme-Machine (IIHM ), Laboratoire d'Informatique de Grenoble (LIG ), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])
Subjects: Persuasion, persuasion, media_common.quotation_subject, adaptation, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Sociology, Humanities, media_common
Abstract: Making people change is difficult; making them change for ever is all the more challenging. We explore adaptation as a means for bringing diversity and thereby for killing the annoying effect of persuasive messages. The case study is TILT, a persuasive application dedicated to smartphone usage regulation. We show that adapting persuasion increases efficiency. Persuader est difficile ; persuader sur la durée l’est encore plus. Nous explorons l’adaptation pour apporter de la variété et de la pertinence à la persuasion et ainsi pallier l’usure de l’efficacité des messages persuasifs. Le cas d’étude est TILT, un dispositif persuasif pour la régulation du temps d’usage du smartphone. La persuasion de TILT s’appuie sur le principe d’auto-surveillance. L’expérimentation démontre la pertinence de l’adaptation du message persuasif comme renfort de l’efficacité du principe d’auto-surveillance dans le temps.
Published: 2021
Full Text: View/download PDF

3. Adaptation for sustainable persuasion

Author: Foulonneau, Anthony, Calvary, Gaëlle, Villain, Eric, Orange Labs [Cesson-Sévigné], Orange Labs, Laboratoire d'Informatique de Grenoble (LIG), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA), Orange Labs - Cesson-Sévigné (Orange Labs), Ingénierie de l’Interaction Homme-Machine (IIHM ), Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Ingénierie de l’Interaction Homme-Machine (IIHM), and Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )
Subjects: persuasion, InformationSystems_INFORMATIONINTERFACESANDPRESENTATION(e.g.,HCI), adaptation, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], InformationSystems_MISCELLANEOUS
Abstract: Making people change is difficult; making them change for ever is all the more challenging. We explore adaptation as a means for bringing diversity and thereby for killing the annoying effect of persuasive messages. The case study is TILT, a persuasive application dedicated to smartphone usage regulation. We show that adapting persuasion increases efficiency., Persuader est difficile ; persuader sur la durée l’est encore plus. Nous explorons l’adaptation pour apporter de la variété et de la pertinence à la persuasion et ainsi pallier l’usure de l’efficacité des messages persuasifs. Le cas d’étude est TILT, un dispositif persuasif pour la régulation du temps d’usage du smartphone. La persuasion de TILT s’appuie sur le principe d’auto-surveillance. L’expérimentation démontre la pertinence de l’adaptation du message persuasif comme renfort de l’efficacité du principe d’auto-surveillance dans le temps.
Published: 2020

4. Persuasive Context

Author: Foulonneau, Anthony, Calvary, Gaëlle, Villain, Eric, Orange Labs - Cesson-Sévigné (Orange Labs), Laboratoire d'Informatique de Grenoble, Laboratoire d'Informatique de Grenoble (LIG), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: InformationSystems_MODELSANDPRINCIPLES, persuasion, persuasive context, contexte interactif, ComputingMilieux_PERSONALCOMPUTING, adaptation, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], interactive context, InformationSystems_MISCELLANEOUS, contexte persuasif
Abstract: The background of persuasive technologies is the traditional interpersonal persuasion, studied for over two thousand years in rethoric, philosophy, and more recently in psychology. This last discipline offers many theories and models to understand more precisely the processes that influence human behaviors. These theories show in particular that persuasive situations are complex, varied, with many influence factors. Therefore, we propose the notion of adaptive persuasive technologies, i.e. technologies able to adapt their persuasive strategies to the user context. To design such products and services, we propose a model of the persuasive context, i.e. of all the constraints that influence a user’s targeted behavior at a given time. Each constraint in the persuasive context is at the same time an adaptation criterion and an action leverage for the adaptive persuasive technology., Les technologies persuasives ont pour fondement la persuasion inter-personnelle, étudiée depuis plus de deux millénaires dans le champ de la rhétorique, de la philosophie, et plus récemment de la psychologie. Cette dernière discipline propose des théories et des modèles pour rendre compte et comprendre les processus à l’œuvre dans le choix d’un comportement. Ces théories montrent en particulier que les situations persuasives sont complexes, variées, avec de nombreux facteurs d’influence. C’est pourquoi nous proposons la notion de technologies persuasives adaptatives, des technologies capables d’adapter leurs stratégies de persuasion à l’utilisateur dans son contexte. Pour mettre en œuvre ces dispositifs, nous proposons une modélisation du contexte persuasif, c’est-à-dire de l’ensemble des contraintes qui influencent l’adoption d’un comportement cible par un individu à un instant donné. Chacune de ces contraintes est à la fois un critère d’adaptation et un levier d’action dans la quête persuasive de la technologie.
Published: 2019

5. A control theoretic strategy for intelligent network interface selection in heterogeneous environments

Author: Yue LI, Yassine Hadjadj-Aoul, Philippe Bertin, Gerardo Rubino, Hadjadj Aoul, Yassine, Orange Labs [Cesson-Sévigné], Orange Labs, Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS), RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Orange Labs - Cesson-Sévigné (Orange), IEEE, Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2016

6. Control Theory Based Interface Selection Mechanism in Fixed-Mobile Converged Network

Author: Yue Li, Gerardo Rubino, Yassine Hadjadj-Aoul, Philippe Bertin, Orange Labs [Cesson-Sévigné], Orange Labs, Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Orange Labs - Cesson-Sévigné (Orange), IEEE, CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)
Subjects: Radio access network, Access network, Computer science, business.industry, Mobile computing, Public land mobile network, Intelligent computer network, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Control theory, Mobile station, Cellular network, Access network discovery and selection function, business, ComputingMilieux_MISCELLANEOUS, Computer network
Abstract: With the explosion of mobile data traffic as well as mobile devices' capability of connecting simultaneously to different access networks, we consider the need to evolve from legacy networks towards Fixed-Mobile Converged (FMC) networks. In FMC architectures, access network selection becomes an issue when mobile devices are under the coverage of distinct technologies. However, a bad selection may lead to network congestion and quality of experience degradation for the end user. In order to deal with this problem, we model and analyze the interface selection procedure using the control theory in FMC architecture. Based on our model, we design a scalable controller, which can help in directing the selection decision of mobile devices in a way to optimize the network resource utilization. Numerical results demonstrate that the number of mobile devices in each access network can converge to the target network occupation, which optimizes network resource utilization while preventing the network overload.
Published: 2015

7. Pattern Matching in Encrypted Stream from Inner Product Encryption

Author: Élie Bouscatié, Guilhem Castagnos, Olivier Sanders, Orange Labs [Cesson-Sévigné], Orange Labs, Lithe and fast algorithmic number theory (LFANT), Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), ANR-21-CE39-0006,SANGRIA,Calcul réparti sécurisé : Cryptographie, Combinatoire, Calcul Formel(2021), ANR-22-PECY-0003,SecureCompute,Secure computations(2022), ANR-19-CE39-0011,PRESTO,Traitement des flux chiffré s pour la gestion du trafic(2019), and ANR-18-CE39-0019,MobiS5,La sécurité et la privacy dans les réseaux 5G(2018)
Subjects: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Pattern Matching, Functional Encryption, Hidden Vector Encryption, Inner Product Encryption
Abstract: International audience; Functional encryption features secret keys, each associated with a key function f , which allow to directly recover f (x) from an encryption of x, without learning anything more about x. This property is particularly useful when delegating data processing to a third party as it allows the latter to perform its task while ensuring minimum data leakage. However, this generic term conceals a great diversity in the cryptographic constructions that strongly differ according to the functions f they support.
Published: 2023
Full Text: View/download PDF

8. On the Hardness of Module Learning with Errors with Short Distributions

Author: Katharina Boudgoust, Corentin Jeudy, Adeline Roux-Langlois, Weiqiang Wen, Aarhus University [Aarhus], Orange Labs [Cesson-Sévigné], Orange Labs, Applied Cryptography and Implementation Security (CAPSULE), SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Equipe AMACC - Laboratoire GREYC - UMR6072, Groupe de Recherche en Informatique, Image et Instrumentation de Caen (GREYC), Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Normandie Université (NU)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)-Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS), Institut Polytechnique de Paris (IP Paris), Département Informatique et Réseaux (INFRES), Télécom ParisTech, Cybersécurité et Cryptographie (C2), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, ANR-22-PETQ-0008,PQ-TLS,Post-quantum padlock for web browser(2022), and European Project: 780701,PROMETHEUS(2018)
Subjects: Short Distributions, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Bounded Error, Module Learning With Errors, Applied Mathematics, Lattice-Based Cryptography, Software, Bounded Secret, Computer Science Applications
Abstract: International audience; The Module Learning With Errors (M-LWE) problem is a core computational assumption of lattice-based cryptography which offers an interesting trade-off between guaranteed security and concrete efficiency. The problem is parameterized by a secret distribution as well as an error distribution. There is a gap between the choices of those distributions for theoretical hardness results (standard formulation of M-LWE, i.e., uniform secret modulo $q$ and Gaussian error) and practical schemes (small bounded secret and error). In this work, we make progress towards narrowing this gap. More precisely, we prove that M-LWE with uniform $\eta$-bounded secret for any $1 \leq \eta \ll q$ and Gaussian error, in both its search and decision variants, is at least as hard as the standard formulation of M-LWE, provided that the module rank $d$ is at least logarithmic in the ring degree $n$. We also prove that the search version of M-LWE with large uniform secret and uniform $\eta$-bounded error is at least as hard as the standard M-LWE problem, if the number of samples $m$ is close to the module rank $d$ and with further restrictions on $\eta$. The latter result can be extended to provide the hardness of search M-LWE with uniform η-bounded secret and error under specific parameter conditions. Overall, the results apply to all cyclotomic fields, but most of the intermediate results are proven in more general number fields.
Published: 2023
Full Text: View/download PDF

9. Towards a Better Understanding of Impersonation Risks Anonymous

Author: Bumiller, Anne, Barais, Olivier, Aillery, Nicolas, Le Lan, Gael, Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: Shapley Values, Authentication, [STAT.AP]Statistics [stat]/Applications [stat.AP], Impersonation Risk, Explainable AI
Abstract: International audience; In many situations, it is of interest for authentication systems to adapt to context (e.g., when the user's behavior differs from the previous behavior). Hence, during authentication events, it is common to use contextually available features to calculate an impersonation risk score. This paper proposes an explainability model that can be used for authentication decisions and, in particular, to explain the impersonation risks that arise during suspicious authentication events (e.g., at unusual times or locations). The model applies Shapley values to understand the context behind the risks. Through a case study on 30,000 real world authentication events, we show that risky and nonrisky authentication events can be grouped according to similar contextual features, which can explain the risk of impersonation differently and specifically for each authentication event. Hence, explainability models can effectively improve our understanding of impersonation risks. The risky authentication events can be classified according to attack types. The contextual explanations of the impersonation risk can help authentication policymakers and regulators who attempt to provide the right authentication mechanisms, to understand the suspiciousness of an authentication event and the attack type, and hence to choose the suitable authentication mechanism.
Published: 2022

10. A Study of Conventional and Learning-Based Depth Estimators for Immersive Video Transmission

Author: Lingadahalli Ravi, Smitha, Milovanovic, Marta, Morin, Luce, Henry, Félix, Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA), Orange Labs [Cesson-Sévigné], Orange Labs, Institut d'Électronique et des Technologies du numéRique (IETR), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Nantes Université - pôle Sciences et technologie, and Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)
Subjects: view synthesis, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], depth estimation, deep learning, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], [INFO]Computer Science [cs], MPEG-I, immersive video transmission
Abstract: International audience; Obtaining an accurate depth map of a scene is very important for major applications like immersive video, robotics, autonomous driving, and many more. The different methods to estimate depths can be classified as conventional and learning-based methods. While these methods have been studied for their depth accuracy, less attention has been paid to studying their performance in the use case of depth image-based rendering (DIBR). Here we study and evaluate two conventional methods and five learning-based methods for a real-world use case of immersive video transmission in the context of MPEG-I. The user-requested views are synthesized using Test Model for Immersive Video (TMIV) from the depth maps obtained by all methods and original texture views. The synthesized images are compared with their original counterparts using various quality metrics.
Published: 2022
Full Text: View/download PDF

11. Exploring Temporal Consistency in Image-Based Rendering for Immersive Video Transmission

Author: Lingadahalli Ravi, Smitha, Henry, Félix, Morin, Luce, Gendrin, Matthieu, Orange Labs [Cesson-Sévigné], Orange Labs, Institut d'Électronique et des Technologies du numéRique (IETR), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Nantes Université - pôle Sciences et technologie, and Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)
Subjects: [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, temporal consistency, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], [INFO]Computer Science [cs], image-based rendering, immersive video transmission
Abstract: International audience; Image-based rendering methods synthesize novel views given input images captured from multiple viewpoints to display free viewpoint immersive video. Despite significant progress with the recent learning-based approaches, there are still some drawbacks. In particular, these approaches operate at the still image level and do not maintain consistency among consecutive time instants, leading to temporal noise. To address this, we propose an intra-only framework to identify regions of input images leading to temporally inconsistent synthesized views. Our method synthesizes better and more stable novel views, even in the most general use case of immersive video transmission. We conclude that the network seems to identify and correct spatial features at the still image level that produce artifacts in the temporal dimension.
Published: 2022
Full Text: View/download PDF

12. Control Your Virtual Agent in its Daily-activities for Long Periods

Author: Lysa Gramoli, Jérémy Lacoche, Anthony Foulonneau, Valérie Gouranton, Bruno Arnaldi, 3D interaction with virtual environments using body and mind (Hybrid), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-RÉALITÉ VIRTUELLE, HUMAINS VIRTUELS, INTERACTIONS ET ROBOTIQUE (IRISA-D5), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA), Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: Autonomous agent, Control over the agent’s decision-making autonomy, Daily activity model, Scheduling, [INFO]Computer Science [cs]
Abstract: International audience; Simulating human behavior through virtual agents is a key feature to improve the credibility of virtual environments (VE). For many use cases, such as daily activities data generation, having a good ratio between the agent's control and autonomy is required to impose specific activities while letting the agent be autonomous. This is why we propose a model allowing a user to configure the level of the agent's decisionmaking autonomy according to their requirements. Our model, based on a BDI architecture, combines control constraints given by the user, an internal model simulating human daily needs for autonomy, and a scheduling process to create an activity plan considering these two parts. Using a calendar, the activities that must be performed in the required time can be given by the user. In addition, the user can indicate whether interruptions can happen during the activity calendar to apply an effect induced by the internal model. The plan generated by our model can be executed in the VE by an animated agent in real-time. To show that our model manages well the ratio between control and autonomy, we use a 3D home environment to compare the results with the input parameters.
Published: 2022
Full Text: View/download PDF

13. A survey of sound source localization with deep learning methods

Author: Pierre-Amaury Grumiaux, Srđan Kitić, Laurent Girin, Alexandre Guérin, Laboratoire des Sciences du Numérique de Nantes (LS2N), Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École Centrale de Nantes (Nantes Univ - ECN), Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes université - UFR des Sciences et des Techniques (Nantes univ - UFR ST), Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ), Orange Labs [Cesson-Sévigné], Orange Labs, GIPSA - Cognitive Robotics, Interactive Systems, & Speech Processing (GIPSA-CRISSP), GIPSA Pôle Parole et Cognition (GIPSA-PPC), Grenoble Images Parole Signal Automatique (GIPSA-lab), Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), Université Grenoble Alpes (UGA)-Grenoble Images Parole Signal Automatique (GIPSA-lab), Université Grenoble Alpes (UGA), ANRT CIFRE 2019/0533, ANR-19-P3IA-0003, and ANR-19-P3IA-0003,MIAI,MIAI @ Grenoble Alpes(2019)
Subjects: FOS: Computer and information sciences, [SPI.ACOU]Engineering Sciences [physics]/Acoustics [physics.class-ph], Sound (cs.SD), Computer Science - Machine Learning, Acoustics and Ultrasonics, deep learning, audio processing, Computer Science - Sound, Machine Learning (cs.LG), sound source localization, Arts and Humanities (miscellaneous), [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Audio and Speech Processing (eess.AS), [INFO.INFO-SD]Computer Science [cs]/Sound [cs.SD], FOS: Electrical engineering, electronic engineering, information engineering, Electrical Engineering and Systems Science - Audio and Speech Processing
Abstract: This article is a survey on deep learning methods for single and multiple sound source localization. We are particularly interested in sound source localization in indoor/domestic environment, where reverberation and diffuse noise are present. We provide an exhaustive topography of the neural-based localization literature in this context, organized according to several aspects: the neural network architecture, the type of input features, the output strategy (classification or regression), the types of data used for model training and evaluation, and the model training strategy. This way, an interested reader can easily comprehend the vast panorama of the deep learning-based sound source localization methods. Tables summarizing the literature survey are provided at the end of the paper for a quick search of methods with a given set of target characteristics., Accepted for publication in The Journal of the Acoustical Society of America
Published: 2022
Full Text: View/download PDF

14. Placement de services virtualisés par des stratégies intelligentes pour l'algorithme de Branch and Bound

Author: Taghavian, Masoud, Hadjadj-Aoul, Yassine, Texier, Géraldine, Bertin, Philippe, Institut de Recherche Technologique b-com (IRT b-com), Département Systèmes Réseaux, Cybersécurité et Droit du numérique (IMT Atlantique - SRCD), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Advanced technologies for operated networks (ADOPNET), Université de Rennes (UR)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), mEasuRing and ManagIng Network operation and Economic (ERMINE), Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Network function virtualization, A-Star, Branch and Bound
Abstract: International audience; La virtualisation des fonctions réseau (Network Function Virtualization, NFV) constitue un changement majeur, permettant de passer d'équipements matériels dédiés à des logiciels réutilisables fonctionnant dans des environnements virtualisés légers. Ces fonctions peuvent être déployées à la volée et nécessitent des stratégies de placement efficaces afin d'optimiser la gestion des ressources physiques partagées. Nous proposons une solution pour le placement systématique des services de réseau virtualisés, à la fois adaptative et proche des résultats optimaux, adaptée aux scénarios en ligne avec des contraintes de temps strictes. Notre solution, basée sur une recherche Branch and Bound, tire parti de stratégies de recherche de l'intelligence artificielle (en particulier A*) pour résoudre le problème du placement en maximisant l'acceptation de services (SA). L'analyse empirique approfondie réalisée montre la pertinence de cette approche.
Published: 2022

15. Clock-G: A temporal graph management system with space-efficient storage technique

Author: Massri, Maria, Miklos, Zoltan, Raipin, Philippe, Meye, Pierre, Université de Rennes (UR), Orange Labs, Declarative & Reliable management of Uncertain, user-generated Interlinked Data (DRUID), GESTION DES DONNÉES ET DE LA CONNAISSANCE (IRISA-D7), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), and Orange Labs [Cesson-Sévigné]
Subjects: [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Temporal graph traversal, Graph management systems, Temporal Graphs
Abstract: International audience; IoT applications can be naturally modeled as a graph where the edges represent the interactions between devices, sensors, and their environment. Thing'in 1 is a platform, initiated by Orange 2. The platform manages a graph of millions of connected and non-connected objects using a commercial graph database. The graph of Thing'in is dynamic because IoT devices create temporary connections between each other. Analyzing the history of these connections paves the way to new promising applications such as object tracking, anomaly detection, and forecasting the future behavior of devices. However, existing commercial graph databases are not designed with native temporal support which limits their usability in such use cases. In this paper, we discuss the design of a temporal graph management system Clock-G and introduce a new space-efficient storage technique δ-Copy+Log. Clock-G is designed by the developers of the Thing'in platform and is currently being deployed into production. It differentiates from existing temporal graph management systems by adopting the δ-Copy+Log technique. This technique targets the mitigation of the apparent trade-off between the conflicting goals of the reduction of space usage and acceleration of query execution time. Our experimental results demonstrate that the δ-Copy+Log presents an overall better performance as compared to traditional storage methods in terms of space usage and query evaluation time.
Published: 2022
Full Text: View/download PDF

16. RTGEN : A Relative Temporal Graph GENerator

Author: Massri, Maria, Miklos, Zoltan, Raipin, Philippe, Meye, Pierre, Declarative & Reliable management of Uncertain, user-generated Interlinked Data (DRUID), GESTION DES DONNÉES ET DE LA CONNAISSANCE (IRISA-D7), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Université de Rennes (UR), Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: Temporal graphs, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Graph generation, Optimal transport, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract: International audience; Graph management systems are emerging as an efficient solution to store and query graph-oriented data. To assess the performance and compare such systems, practitioners often design benchmarks in which they use large scale graphs. However, such graphs either do not fit the scale requirements or are not publicly available. This has been the incentive of a number of graph generators which produce synthetic graphs whose characteristics mimic those of real-world graphs (degree distribution, community structure, diameter, etc.). Applications, however, require to deal with temporal graphs whose topology is in constant change. Although generating static graphs has been extensively studied in the literature, generating temporal graphs has received much less attention. In this work, we propose RTGEN a relative temporal graph generator that allows the generation of temporal graphs by controlling the evolution of the degree distribution. In particular, we propose to generate new graphs with a desired degree distribution out of existing ones while minimizing the efforts to transform our source graph to target. Our proposed relative graph generation method relies on optimal transport methods. We extend our method to also deal with the community structure of the generated graphs that is prevalent in a number of applications. Our generation model extends the concepts proposed in the Chung-Lu model with a temporal and community-aware support. We validate our generation procedure through experiments that prove the reliability of the generated graphs with the ground-truth parameters.
Published: 2022

17. Toward a generic and secure bootloader for IoT device firmware OTA update

Author: Saad El Jaouhari, Eric Bouvet, Institut Supérieur d'Electronique de Paris (ISEP), Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], [INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET], [INFO.INFO-ES]Computer Science [cs]/Embedded Systems
Abstract: International audience; The Internet of Things (IoT) devices market has shown strong growth in recent years. Time to market has become essential to be competitive, the faster a competitor develops and integrates his/her product, the more likely he/she is to dominate the market. This competition leads to critical software problems in the systems due to lack of testing or short development times. Lots present some vulnerabilities that can be exploited by attacks via botnets or malwares. Moreover, they are subject to huge number of 0-days that need quick intervention to maintain the security of the environment in which the IoT device is deployed in. For this purpose, the quick update of the firmware of these devices via patches is the most effective solution to counter these attacks. In this process, to operate embedded systems' setup , control and supervision, an important component called the bootloader have to be implemented. This piece of code can manage and execute boot sequence and launch the firmware. However, without any recommendations or references, currently, there is no generic bootloader for all the IoT device, but there are several bootloaders specific for a particular or a group of hardware or kernel. This paper aims to analyze some of these bootloaders and develop a minimal generic bootloader implementing a firmware Over-The-Air update for constrained IoT devices. After analyzing several bootloaders and the OTA update process, a PoC of a bootloaders based on FreeRTOS, has been designed and implemented, and which allows to perform firmware verifications and OTA updates.
Published: 2022

18. Towards a Better Understanding of Impersonation Risks

Author: Bumiller, Anne, Barais, Olivier, Aillery, Nicolas, Le Lan, Gael, Bumiller, Anne, Diversity-centric Software Engineering (DiverSe), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Institut National de Recherche en Informatique et en Automatique (Inria), Orange Labs, and Orange Labs [Cesson-Sévigné]
Subjects: [STAT.AP]Statistics [stat]/Applications [stat.AP], Shapley Values, Authentication, [STAT.AP] Statistics [stat]/Applications [stat.AP], Impersonation Risk, Explainable AI
Abstract: International audience; In many situations, it is of interest for authentication systems to adapt to context (e.g., when the user's behavior differs from the previous behavior). Hence, during authentication events, it is common to use contextually available features to calculate an impersonation risk score. This paper proposes an explainability model that can be used for authentication decisions and, in particular, to explain the impersonation risks that arise during suspicious authentication events (e.g., at unusual times or locations). The model applies Shapley values to understand the context behind the risks. Through a case study on 30,000 real world authentication events, we show that risky and nonrisky authentication events can be grouped according to similar contextual features, which can explain the risk of impersonation differently and specifically for each authentication event. Hence, explainability models can effectively improve our understanding of impersonation risks. The risky authentication events can be classified according to attack types. The contextual explanations of the impersonation risk can help authentication policymakers and regulators who attempt to provide the right authentication mechanisms, to understand the suspiciousness of an authentication event and the attack type, and hence to choose the suitable authentication mechanism.
Published: 2022

19. Conception de courbes elliptiques et applications

Author: Clarisse, Rémi, Institut de Recherche Mathématique de Rennes (IRMAR), AGROCAMPUS OUEST, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Université de Rennes 2 (UR2), Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), Orange Labs [Cesson-Sévigné], Orange Labs, Université de Rennes 1, Sylvain Duquesne, Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-École normale supérieure - Rennes (ENS Rennes)-Université de Rennes 2 (UR2)-Centre National de la Recherche Scientifique (CNRS)-INSTITUT AGRO Agrocampus Ouest, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), Université Rennes 1, STAR, ABES, Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Université de Rennes 2 (UR2), Université de Rennes (UNIV-RENNES)-Université de Rennes 1 (UR1), and Université de Rennes (UNIV-RENNES)-AGROCAMPUS OUEST
Subjects: Authentication, Group signature, [MATH.MATH-AG] Mathematics [math]/Algebraic Geometry [math.AG], Signature de groupe, Public-Key cryptography, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Couplage, Elliptic curve, Courbe elliptique, Cryptographie à clé publique, Pairing, [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], Authentification, [INFO.INFO-CR] Computer Science [cs]/Cryptography and Security [cs.CR]
Abstract: In our day to day life, information security is a predominant topic. More specifically, (online) users expect to be asked for consent and that service providers handle their personal data with care and integrity. This urges the design of systems enforcing such expectations. The field of cryptography provides such powerful privacy-preserving tools. In this thesis, we consider one of those tools: pairings over elliptic curves. We strongly diverge from the general approach, i.e. taking already standardized curves regardless of the cryptographic protocol, and suggest curves satisfying chosen criteria. The given curves in this thesis have more efficient operations in the first pairing group than the curves from the literature. We follow by giving a group signature scheme, a primitive enabling the anonymity of its users among the group they belong to, designed using pairing over elliptic curves. This group signature is efficient when compared to the state-of-the-art, thanks to the very nice interaction between two randomizable signature schemes, allowing us to get rid of costly zero-knowledge proofs., Le thème de la sécurité de l'information est prédominant dans nos vies actuelles. En particulier, les utilisateurs de service, plus précisément en ligne, souhaitent que leurs données à caractère personnel soient traitées à des fins légitimes et avec leur consentement. Cela incite donc à concevoir des systèmes se pliant à de telles exigences. La cryptographie dispose de solutions puissantes pour satisfaire ce besoin de protéger la vie privée mais ces derniers nécessitent des outils mathématiques avancés. Dans cette thèse, nous abordons l'un de ces outils: le couplage sur les courbes elliptiques. Nous divergeons de l'approche générale, celle de prendre une courbe déjà établie, standardisée, quel que soit le protocole cryptographique, et proposons des courbes conçues pour optimiser les performances d’une famille spécifique d’algorithmes cryptographiques. Les courbes proposées dans cette thèse ont des opérations dans le premier groupe du couplage plus performantes, comparées aux courbes de la littérature. Nous donnons ensuite un schéma de signature de groupe, primitive déployée permettant d'assurer l'anonymat de ses utilisateurs au sein d'un groupe, conçu grâce aux couplages sur courbes elliptiques. Cette signature de groupe est compétitive face à l'état de l'art, tirant au maximum parti du couplage afin d'éviter d'utiliser des constructions lourdes, comme les preuves sans divulgation de connaissance, et de pâtir des limites associées, tant en termes de performances que de sécurité.
Published: 2021

20. Public Key Encryption with Flexible Pattern Matching

Author: Bouscatié, Elie, Castagnos, Guilhem, Sanders, Olivier, Orange Labs [Cesson-Sévigné], Orange Labs, Lithe and fast algorithmic number theory (LFANT), Institut de Mathématiques de Bordeaux (IMB), Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1 (UB)-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), ANR-16-CE39-0006,ALAMBIC,AppLicAtions de la MalléaBIlité en Cryptographie(2016), ANR-19-CE39-0011,PRESTO,Traitement des flux chiffré s pour la gestion du trafic(2019), ANR-18-CE39-0019,MobiS5,La sécurité et la privacy dans les réseaux 5G(2018), and Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Université Bordeaux Segalen - Bordeaux 2-Université Sciences et Technologies - Bordeaux 1-Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux (Bordeaux INP)-Centre National de la Recherche Scientifique (CNRS)-Inria Bordeaux - Sud-Ouest
Subjects: 021110 strategic, defence & security studies, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Pattern Matching, 010201 computation theory & mathematics, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Searchable encryption, 01 natural sciences
Abstract: International audience; Many interesting applications of pattern matching (e.g. deeppacket inspection or medical data analysis) target very sensitive data. In particular, spotting illegal behaviour in internet traffic conflicts with legitimate privacy requirements, which usually forces users (e.g. children, employees) to blindly trust an entity that fully decrypts their traffic in the name of security. The compromise between traffic analysis and privacy can be achieved through searchable encryption. However, as the traffic data is a stream and as the patterns to search are bound to evolve over time (e.g. new virus signatures), these applications require a kind of searchable encryption that provides more flexibility than the classical schemes. We indeed need to be able to search for patterns of variable sizes in an arbitrary long stream that has potentially been encrypted prior to pattern identification. To stress these specificities, we call such a scheme a stream encryption supporting pattern matching. Recent papers use bilinear groups to provide public key constructions supporting these features [3, 13]. These solutions are lighter than more generic ones (e.g. fully homomorphic encryption) while retaining the adequate expressivity to support pattern matching without harming privacy more than needed. However, all existing solutions in this family have weaknesses with respect to efficiency and security that need to be addressed. Regarding efficiency, their public key has a size linear in the size of the alphabet, which can be quite large, in particular for applications that naturally process data as bytestrings. Regarding security, they all rely on a very strong computational assumption that is both interactive and specially tailored for this kind of scheme. In this paper, we tackle these problems by providing two new constructions using bilinear groups to support pattern matching on encrypted streams. Our first construction shares the same strong assumption but dramatically reduces the size of the public key by removing the dependency on the size of the alphabet, while nearly halving the size of the ciphertext. On a typical application with large patterns, our public key is two order of magnitude smaller than the one of previous schemes, which demonstrates the practicality of our approach. Our second construction manages to retain most of the good features of the first one while exclusively relying on a simple (static) variant of DDH, which solves the security problem of previous works.
Published: 2021
Full Text: View/download PDF

21. Needs Model for an Autonomous Agent during Long-term Simulations

Author: Lysa Gramoli, Jérémy Lacoche, Anthony Foulonneau, Valérie Gouranton, ARNALDI Bruno, Orange Labs [Cesson-Sévigné], Orange Labs, 3D interaction with virtual environments using body and mind (Hybrid), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-MEDIA ET INTERACTIONS (IRISA-D6), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)
Subjects: 03 medical and health sciences, 0302 clinical medicine, 0202 electrical engineering, electronic engineering, information engineering, agent behavior, needs model, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], 02 engineering and technology, long-term simulation, 030218 nuclear medicine & medical imaging
Abstract: International audience; Simulating human behavior in virtual environments is still a challenge. Yet, this feature is crucial to make them more believable. Therefore, many approaches have been proposed in order to find ways to faithfully simulate human behavior. One of the key features to make a virtual agent more believable is the simulation of needs such as hunger or tiredness. Unfortunately, most of the existing approaches in needs simulation do not really address the issue of long-term simulations where some problems may appear such as time drift. Yet, this kind of simulation is useful in many fields like video games or virtual data generation. This is why, in this paper, we focus on the creation of a needs model designed for long-term simulations. According to this model, needs can evolve over several simulated days without interruption. This model is configured to obtain a proper relation between control and autonomy in order to have a coherent behavior during long periods. This paper deals with the key features to set up this needs model and introduces some preliminary results to check the coherence of the agent behavior.
Published: 2021

22. Multibeam Antenna Modelling and Blockage Impact Mitigation in 5G Millimeter-Wave Bands

Author: Patrice Pajusco, Marie Le Bot, Franeois Gallee, Hamidou Dembele, Orange Labs [Cesson-Sévigné], Orange Labs, Département Micro-Ondes (IMT Atlantique - MO), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Equipe DH (Lab-STICC_DH), Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT), and Equipe PIM (Lab-STICC_PIM)
Subjects: block error rate, Computer science, business.industry, reflectarray, 60 GHz, Beamwidth, Block Error Rate, [SPI.ELEC]Engineering Sciences [physics]/Electromagnetism, Extremely high frequency, human blockage, Performance prediction, Electronic engineering, millimeter-wave, Wireless, Multibeam antenna, transmitarray, Antenna (radio), business, Impact mitigation, 5G
Abstract: International audience; This paper discusses a generic approach proposal for modelling multibeam antenna systems for performance prediction characterized by scan loss and half-power beamwidth. The validation with the existing transmitarrays in the Ka and V bands is carried out. Using the proposed antenna model, the advantage of multibeam antenna to alleviate the impact of human blockage in millimeter-wave bands is highlighted. Communication performance is evaluated in terms of block error rate through the implementation of the 5G physical communication chain in a simulation tool.
Published: 2021

23. VisQA: X-raying Vision and Language Reasoning in Transformers

Author: Theo Jaunet, Christian Wolf, Moez Baccouche, Grigory Antipov, Corentin Kervadec, Romain Vuillemot, Situated Interaction, Collaboration, Adaptation and Learning (SICAL), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), Extraction de Caractéristiques et Identification (imagine), Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: FOS: Computer and information sciences, Visual analytics, Computer science, Computer Vision and Pattern Recognition (cs.CV), Computer Science - Computer Vision and Pattern Recognition, Computer Science - Human-Computer Interaction, 02 engineering and technology, Working hypothesis, Oracle, Visual Question Answering, Human-Computer Interaction (cs.HC), [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Human–computer interaction, Transformers, 0202 electrical engineering, electronic engineering, information engineering, Question answering, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], business.industry, Deep learning, 020207 software engineering, Computer Graphics and Computer-Aided Design, Visualization, XAI, Signal Processing, Data analysis, Computer Vision and Pattern Recognition, Artificial intelligence, Engineering design process, business, Software
Abstract: International audience; Visual Question Answering systems target answering open-ended textual questions given input images. They are a testbed for learning high-level reasoning with a primary use in HCI, for instance assistance for the visually impaired. Recent research has shown that state-of-the-art models tend to produce answers exploiting biases and shortcuts in the training data, and sometimes do not even look at the input image, instead of performing the required reasoning steps. We present VisQA, a visual analytics tool thatexplores this question of reasoning vs. bias exploitation. It exposes the key element of state-of-the-art neural models --- attention maps in transformers. Our working hypothesis is that reasoning steps leading to model predictions are observable from attention distributions, which are particularly useful for visualization. The design process of VisQA was motivated by well-known bias examples from the fields of deep learning and vision-language reasoning and evaluated in two ways. First, as a result of a collaboration of three fields, machine learning, vision and language reasoning, and data analytics, the work lead to a better understanding of bias exploitation of neural models for VQA, which eventually resulted in an impact on its design and training through the proposition of a method for the transfer of reasoning patterns from an oracle model. Second, we also report on the design of VisQA, and a goal-oriented evaluation of VisQA targeting the analysis of a model decision process from multiple experts, providing evidence that it makes the inner workings of models accessible to users.
Published: 2021

24. IoT Data Replication and Consistency Management in Fog Computing

Author: Jalil Boukhobza, Philippe Raipin, Laurent Lemarchand, Mohammed Islam Naas, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT), Equipe Software/HArdware and unKnown Environment inteRactions (Lab-STICC_SHAKER), Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: Edge device, Computer Networks and Communications, Computer science, Internet of Things, Replication, Cloud computing, 02 engineering and technology, Consistency (database systems), Synchronization (computer science), 0202 electrical engineering, electronic engineering, information engineering, business.industry, Quality of service, 020206 networking & telecommunications, 020207 software engineering, Replication (computing), Data access, Hardware and Architecture, P-median, Fog computing, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, Consistency, [INFO.INFO-OS]Computer Science [cs]/Operating Systems [cs.OS], business, Data Placement, Software, Access time, Information Systems, Computer network
Abstract: International audience; Fog Computing has emerged as a virtual platform extending Cloud services down to the network edge especially (and not exclusively) to host IoT applications. Data replication strategies have been designed to investigate the best storage location of data copies in geo-distributed storage systems in order to reduce its access time for different consumer services spread over the infrastructure. Unfortunately, due to the geographical distance between Fog nodes, misplacing data in such an infrastructure may generate high latencies when accessing or synchronizing replicas, thus degrading the Quality of Service (QoS). In this paper, we present two strategies to manage IoT data replication and consistency in Fog infrastructures. Our strategies choose for each datum, the right replica number and their location in order to reduce data access latency and replicas synchronization cost. This is done while respecting the required consistency level. Also, we propose an evaluation platform based on the simulator iFogSim to enable users to implement and test their own strategies for IoT data replication and consistency management. Our experiments show that when using our strategies, the service latency can be reduced by 30% in case of small Fog infrastructures and by 13% in case of large scale Fog infrastructures compared to iFogStor, a state-of-the-art strategy that does not use replication.
Published: 2021
Full Text: View/download PDF

25. Immersive Video Coding: Should Geometry Information be Transmitted as Depth Maps?

Author: Thomas Maugey, Patrick Garus, Christine Guillemot, Jung Joel, Felix Henry, Orange Labs [Cesson-Sévigné], Orange Labs, Tencent Media Lab [US], Analysis representation, compression and communication of visual data (Sirocco), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE (IRISA-D5), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique)
Subjects: decoder side depth estimation, Pixel, Computer science, Geometry, 02 engineering and technology, Rendering (computer graphics), Feature-Driven Depth Estimation, Immersive Video, Transmission (telecommunications), [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, Depth map, Encoding (memory), 0202 electrical engineering, electronic engineering, information engineering, Media Technology, MPEG, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, Encoder, Block (data storage), Coding (social sciences)
Abstract: International audience; Immersive video often refers to multiple views with texture and scene geometry information, from which different viewports can be synthesized on the client side. To design efficient immersive video coding solutions, it is desirable to minimize bitrate, pixel rate and complexity. We investigate whether the classical approach of sending the geometry of a scene as depth maps is appropriate to serve this purpose. Previous work shows that bypassing depth transmission entirely and estimating depth at the client side improves the synthesis performance while saving bitrate and pixel rate. In order to understand if the encoder side depth maps contain information that is beneficial to be transmitted, we first explore a hybrid approach which enables partial depth map transmission using a block-based RD-based decision in the depth coding process. This approach reveals that partial depth map transmission may improve the rendering performance but does not present a good compromise in terms of compression efficiency. This led us to address the remaining drawbacks of decoder side depth estimation: complexity and depth map inaccuracy. We propose a novel system that takes advantage of high quality depth maps at the server side by encoding them into lightweight features that support the depth estimator at the client side. These features allow reducing the amount of data that has to be handled during decoder side depth estimation by 88%, which significantly speeds up the cost computation and the energy minimization of the depth estimator. Furthermore,-46.0% and-37.9% average synthesis BD-Rate gains are achieved compared to the classical approach with depth maps estimated at the encoder.
Published: 2021
Full Text: View/download PDF

26. HANDWRITTEN DIGITS RECONSTRUCTION FROM UNLABELLED EMBEDDINGS

Author: Anthony Larcher, Gaël Le Lan, Thomas Thebaud, Orange Labs [Cesson-Sévigné], Orange Labs, Laboratoire d'Informatique de l'Université du Mans (LIUM), and Le Mans Université (UM)
Subjects: Signal processing, Biometrics, business.industry, Computer science, Pattern recognition, 02 engineering and technology, Mixture Density Network, Linear discriminant analysis, Transfer function, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Alignment flow, Recurrent neural network, 0202 electrical engineering, electronic engineering, information engineering, Mixture distribution, Embedding, 020201 artificial intelligence & image processing, Artificial intelligence, business, Encoder, Template reconstruction attack, Behavioral biometrics
Abstract: International audience; In this paper, we investigate template reconstruction attack of touchscreen biometrics, based on handwritten digits writer verification. In the event of a template database theft, we show that reconstructing the original drawn digit from the embeddings is possible without access to the original embedding encoder. Using an external labelled dataset, an attack encoder is trained along with a Mixture Density Recurrent Neural Network decoder. Thanks to an alignment flow, initialized with Linear Discriminant Analysis and Procrustes, the transfer function between the output space of the original and the attack encoder is estimated. The successive application of transfer function and decoder to the stolen embeddings allows to reconstruct the original drawings, which can be used to spoof the behavioural biometrics system.
Published: 2021

27. Roses are Red, Violets are Blue… But Should VQA expect Them To?

Author: Grigory Antipov, Christian Wolf, Corentin Kervadec, Moez Baccouche, Orange Labs [Cesson-Sévigné], Orange Labs, Extraction de Caractéristiques et Identification (imagine), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and Kervadec, Corentin
Subjects: FOS: Computer and information sciences, Exploit, business.industry, Computer science, Computer Vision and Pattern Recognition (cs.CV), Computer Science - Computer Vision and Pattern Recognition, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], 020207 software engineering, 02 engineering and technology, Measure (mathematics), Visualization, [INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], Knowledge extraction, Metric (mathematics), 0202 electrical engineering, electronic engineering, information engineering, Benchmark (computing), Question answering, Artificial intelligence, business, Diversity (business)
Abstract: Visual Question Answering (VQA) models are notorious for their tendency to rely on dataset biases.The large and unbalanced diversity of questions and concepts involved in VQA and the lack of high standard annotated data tend to prevent models from learning to `reason', leading them to perform `educated guesses' instead, relying on specific training set statistics, which is not helpful for generalizing to real world scenarios.In this paper, we claim that the standard evaluation metric, which consists in measuring the overall in-domain accuracy is misleading. Questions and concepts being unequally distributed, it tends to favor models which exploit subtle training set statistics.Alternatively, naively evaluating generalization by introducing artificial distribution shift between train and test splits is also not completely satisfying. First, the shifts do not reflect real words tendencies, resulting in unsuitable models; second, since the shifts are artificially handcrafted, trained models are specifically designed for this particular setting, and paradoxically do not generalize to other configurations.We propose the GQA-OOD benchmark designed to overcome these concerns: we measure and compare accuracy over, both, rare and frequent question-answer pairs and argue that the former is better suited to the evaluation of reasoning abilities, which we experimentally validate with models trained to more or less exploit biases. In a large-scale study involving 7 VQA models and 3 bias reduction techniques, we also experimentally demonstrate that these models fail to address questions involving infrequent concepts and provide recommendations for future directions of research.
Published: 2021
Full Text: View/download PDF

28. WSGP: A Window-based Streaming Graph Partitioning Approach

Author: Chuanyou Li, Anne-Cécile Orgerie, Yunbo Li, Philippe Raipin Parvedy, Shanghai Pudong Development Bank, Southeast University, Design and Implementation of Autonomous Distributed Systems (MYRIADS), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Orange Labs [Cesson-Sévigné], Orange Labs, This work is supported by the National Natural Science Foundation of China under Grant 61902063, and by the Provincial Natural Science Foundation of Jiangsu, China under Grant BK20190342. This work is also supported by China Postdoctoral Science Foundation under Grant 2020M671669. Early experiments that help us to understand partitioning problem were partially carried out using the Grid’5000 testbed (supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations, see https://www.grid5000.fr), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1)
Subjects: [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Computer science, Heuristic (computer science), Benchmark (computing), Graph partition, Complete graph, Overhead (computing), Parallel computing, Load balancing (computing), [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Partition (database), Replication (computing)
Abstract: International audience; Graph partitioning, a preliminary step of distributed graph processing, has been attracting increasing attention in the last decade. A high quality graph partitioning algorithm should facilitate graph processing by minimizing the communication overhead and maintaining the load balancing among distributed computing units. Offline partitioning algorithms usually require the knowledge of a complete graph,and therefore, are not adaptive to handle massive graph-structured data. On the contrary, streaming partitioning algorithms take edges or vertices as a stream and make partitioning decisions on the fly. However, the streaming manner faces dilemmas from time to time because of a lack of knowledge. Furthermore, an unmindful partitioning decision in such a dilemma could significantly decrease the partition quality. In this paper, we propose a novel window-based streaming graph partitioning algorithm (WSGP). WSGP leverages a greedy-based heuristic to perform edge partitioning. When facing a decision dilemma, WSGP utilizes a size-bounded window to buffer the edges. When the window is fully filled, an edge is poped and assigned to a partition. The assignment is decided by knowledge obtained from both the edges already settled and the ones still cached in the buffer window. Our experiments take into account various real-world benchmark graphs. The experimental results demonstrate that WSGP consistently has a smaller replication factor than the state-of-the-art algorithms by up to 23%, at a limited cost in terms of memory and comprehensive running time.
Published: 2021

29. Actes de la conférence CAID 2020

Author: de Vieilleville, François, May, Stéphane, Lagrange, Adrien, Dupuis, A, Ruiloba, Rosa, Ngolè Mboula, Fred, Bitard-Feildel, Tristan, Nogues, Erwan, Larroche, Corentin, Mazel, Johan, Clémençon, Stephan, Burgot, Romain, Gaurier, Alric, Hulot, Louis, Isaac-Dognin, Léo, Leichtnam, Laetitia, Totel, Eric, Prigent, Nicolas, Mé, Ludovic, Bernhard, Rémi, Moëllic, Pierre-Alain, Dutertre, Jean-Max, Kapusta, Katarzyna, Thouvenot, Vincent, Bettan, Olivier, Charrier, Tristan, Bonnafoux, Luc, Puig, Francisco-Pierre, Lhoest, Quentin, Renault, Thomas, Benamira, Adrien, Bonnet, Benoit, Furon, Teddy, Bas, Patrick, Farcy, Benjamin, Gil-Casals, Silvia, Mattioli, Juliette, Fiammante, Marc, Lambert, Marc, Bresson, Roman, Cohen, Johanne, Hullermeier, Eyke, Labreuche, Christophe, Sebag, Michele, Thebaud, Thomas, Larcher, Anthony, Le Lan, Gaël, Nour, Nouredine, Belhaj-Soullami, Reda, Buron, Cédric, Peres, Alain, Barbaresco, Frédéric, D’acremont, Antoine, Quin, Guillaume, Baussard, Alexandre, Fablet, Ronan, Corbineau, Marie-Caroline, Morge-Rollet, Louis, Le Roy, Frederic, Le Jeune, Denis, Gautier, Roland, Camus, Benjamin, Monteux, Eric, Vermet, Mikaël, Goupilleau, Alex, Ceillier, Tugdual, Agenium Space [Toulouse], Centre National d'Études Spatiales [Toulouse] (CNES), Commissariat à l'énergie atomique et aux énergies alternatives (CEA), DGA Maîtrise de l'information (DGA.MI), Direction générale de l'Armement (DGA), Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES), Agence nationale de la sécurité des systèmes d'information (ANSSI), Département Images, Données, Signal (IDS), Télécom ParisTech, Signal, Statistique et Apprentissage (S2A), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Institut Polytechnique de Paris (IP Paris), Capgemini Consulting [Paris], CentraleSupélec, Département Systèmes Réseaux, Cybersécurité et Droit du numérique (IMT Atlantique - SRCD), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), LSTI, Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE), CentraleSupélec-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT), Thales SIX GTS France, THALES COMMUNICATIONS & SECURITY, THALES, Centre National de la Recherche Scientifique (CNRS), Creating and exploiting explicit links between multimedia fragments (LinkMedia), MEDIA ET INTERACTIONS (IRISA-D6), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Centrale Lille, Thales (France), IBM France Lab [Biot], IBM - Paris [Bois-Colombes], IBM-IBM, Délégation générale de l'armement (DGA), Ministère de la Défense, Thales Research and Technology [Palaiseau], University of Paderborn, TAckling the Underspecified (TAU), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Interdisciplinaire des Sciences du Numérique (LISN), CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique de l'Université du Mans (LIUM), Le Mans Université (UM), Orange Labs [Cesson-Sévigné], Orange Labs, NukkAI [Paris], École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne), MBDA France [Le Plessis Robinson], Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Université de Brest (UBO), Scalian [Rennes], Earthcube [Paris], DGA, DGNUM, Ministère des Armées, Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-MEDIA ET INTERACTIONS (IRISA-D6), Institut National des Sciences Appliquées (INSA), IMT Atlantique (IMT Atlantique), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), THALES [France], Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Equipe Security, Intelligence and Integrity of Information (Lab-STICC_SI3), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université Bretagne Loire (UBL)-IMT Atlantique (IMT Atlantique)
Subjects: systèmes embarqués, intelligence artificielle, cyber-sécurité, prise de décision, signaux radar, artificial intelligence, sécurité des données, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract: National audience
Published: 2021

30. Practical Dynamic Group Signatures Without Knowledge Extractors

Author: Kim, Hyoseung, Sanders, Olivier, Abdalla, Michel, Park, Jong, Korea University [Seoul], Orange Labs [Cesson-Sévigné], Orange Labs, Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities (CASCADE), Département d'informatique - ENS Paris (DI-ENS), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria), SangMyung University [Seoul], IACR Cryptology ePrint Archive, Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris
Subjects: [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Random Oracle Model, Algebraic Group Model, Group Signatures, Subverted CRS, Knowledge Extractors, PS assumption, Computer Science::Cryptography and Security
Abstract: Dynamic group signature (DGS) allows a user to generate a signature on behalf of a group, while preserving anonymity. Although many existing DGS schemes have been proposed in the random oracle model for achieving efficiency, their security proofs require knowledge extractors that cause loose security reductions. In this paper, we first propose a new practical DGS scheme whose security can be proven without knowledge extractors in the random oracle model. Moreover, our scheme can also be proven in the strong security model where an adversary is allowed to generate group managers' keys maliciously. The efficiency of our scheme is comparable to existing secure DGS schemes in the random oracle model using knowledge extractors. The security of our scheme is based on a new complexity assumption that is obtained by generalizing the Pointcheval-Sanders (PS) assumption. Although our generalized PS (GPS) assumption is interactive, we prove that, under the symmetric discrete logarithm (SDL) assumption, the new GPS assumption holds in the algebraic group model.
Published: 2021

31. Partitionnement de graphes large échelle à l'aide d'une courbe de remplissage

Author: Thierry Coupaye, Philippe Raïpin Parvédy, Michel Hurfin, Cyprien Gottstein, Thomas Hassan, Orange Labs [Cesson-Sévigné], Orange Labs, Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE), CentraleSupélec-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)
Subjects: Theoretical computer science, Computer science, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Context (language use), 010103 numerical & computational mathematics, 02 engineering and technology, Space-filling curve, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.0: Graph algorithms, 01 natural sciences, Graph, ACM: H.: Information Systems/H.2: DATABASE MANAGEMENT/H.2.4: Systems/H.2.4.1: Distributed databases, 0202 electrical engineering, electronic engineering, information engineering, Spatial, Use case, Polygon mesh, 0101 mathematics, Structure (mathematical logic), [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Geography, Graph partitioning, Geometric, Graph partition, 020206 networking & telecommunications, Partition (database), ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, Space Filling Curve, Scalability, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Partitioning, Geometric partitioning
Abstract: International audience; Graph structure is a very powerful tool to model system and represent their actual shape. For instance, modelling an infrastructure or social network naturally leads to graph. Yet, graphs can be very different from one another as they do not share the same properties (size, connectivity, communities, etc.) and building a system able to manage graphs should take into account this diversity. A big challenge concerning graph management is to design a system providing a scalable persistent storage and allowing efficient browsing. Mainly to study social graphs, the most recent developments in graph partitioning research often consider scale-free graphs. As we are interested in modelling connected objects and their context, we focus on partitioning geometric graphs. Consequently our strategy differs, we consider geometry as our main partitioning tool. In fact, we rely on Inverse Space-filling Partitioning, a technique which relies on a space filling curve to partition a graph and was previously applied to graphs essentially generated from Meshes. Furthermore, we extend Inverse Space-Filling Partitioning toward a new target we define as Wide Area Graphs. We provide an extended comparison with two state-of-the-art graph partitioning streaming strategies, namely LDG and FENNEL. We also propose customized metrics to better understand and identify the use cases for which the ISP partitioning solution is best suited. Experimentations show that in favourable contexts, edge-cuts can be drastically reduced, going from more 34% using FENNEL to less than 1% using ISP.; Le concept de graphe permet de modéliser des systèmes variés en décrivant les interactions entre les éléments qui les composent. Par exemple, la modélisation d’une infrastructure réseau ou d’un réseau social peut se faire de façon naturelle via un graphe. Or les graphes sont très différents les uns des autres et ne partagent pas les mêmes caractéristiques (taille, connectivité, communautés, …). Les systèmes capables de gérer ces graphes doivent prendre en compte cette diversité. Un défi majeur concernant la gestion des graphes est de concevoir un système fournissant un stockage persistant capable de passer à l’échelle et de permettre une navigation efficace dans le graphe. En ciblant notamment les réseaux sociaux, des travaux récents ont été menés sur le thème du partitionnement de graphe dans le cas de graphes dits scale-free. Dans cet article, nous nous intéressons à la modélisation d’objets connectés et de leur environement. Nous adressons donc le problème du partitionnement dans le cas de graphes géométriques où chaque noeud du graphe possède une localisation géographique. Nous nous appuyons sur cette caractéristique pour étudier une solution de partitionnement inspirée de la technique « Inverse Space-Filling Partitioning (ISP)» qui repose sur l’utilisation d’une courbe de remplissage. Dans notre cas, nous n’appliquons pas cette technique à une structure de type Maillage mais à une famille de graphes géométriques de grande taille pour lesquels nous identifions des caractéristiques communes. Nous proposons une comparaison avec deux stratégies connues de streaming permettant de partitionner un graphe, à savoir LDG et FENNEL. Par rapport aux graphes que nous ciblons, nous définissons des métriques permettant d’identifier les cas d’usage où la solution ISP est la mieux adaptée. Les expérimentations montrent que dans des contextes favorables, la proportion d’arrêtes coupées (qui pénalisent les temps de traitement des requêtes concernant le graphe) peut être réduit drastiquement, passant de plus de 34% en utilisant FENNEL à moins de 1% en utilisant ISP.
Published: 2021
Full Text: View/download PDF

32. Threat for the Secure Remote Password Protocol and a Leak in Apple’s Cryptographic Library

Author: Andy Russon, Institut de Recherche Mathématique de Rennes (IRMAR), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-École normale supérieure - Rennes (ENS Rennes)-Université de Rennes 2 (UR2)-Centre National de la Recherche Scientifique (CNRS)-INSTITUT AGRO Agrocampus Ouest, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), Orange Labs [Cesson-Sévigné], Orange Labs, Kazue Sako, Nils Ole Tippenhauer, AGROCAMPUS OUEST, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Université de Rennes 2 (UR2), Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)
Subjects: Modular exponentiation, Exponentiation, Dictionary attack, computer.internet_protocol, Computer science, Cryptography, 0102 computer and information sciences, Computer security, computer.software_genre, Euclidean splitting, 01 natural sciences, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 03 medical and health sciences, Protocol (object-oriented programming), 030304 developmental biology, Password, 0303 health sciences, business.industry, Apple, Eavesdropping, Secure Remote Password, Secure Remote Password protocol, ComputingMilieux_MANAGEMENTOFCOMPUTINGANDINFORMATIONSYSTEMS, 010201 computation theory & mathematics, business, computer
Abstract: 19th International Conference, ACNS 2021, Kamakura, Japan, June 21–24, 2021, Proceedings, Part II; International audience; The Secure Remote Password protocol is a password-based authenticated key-exchange between two parties. One advantage is to prevent offline dictionary attacks from an adversary eavesdropping the communication. We present how such an attack is feasible if the modular exponentiation at the heart of the protocol is vulnerable and leaks some data related to the password.In the case of a fixed exponent, adding randomness during the execution is a classical protection mechanism, and such a mechanism is present in Apple’s cryptographic library to randomize the exponent. Despite being intended to protect against complex side-channel attacks, we show that its usage makes the implementation vulnerable to simple side-channels such as power analysis.This leakage observed in the library is mild but is useful for the attack we propose on the Secure Remote Password protocol.
Published: 2021
Full Text: View/download PDF

33. Managing Mutual Occlusions between Real and Virtual Entities in Virtual Reality

Author: Jérémy Lacoche, Bruno Arnaldi, Guillaume Bataille, Valérie Gouranton, 3D interaction with virtual environments using body and mind (Hybrid), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-MEDIA ET INTERACTIONS (IRISA-D6), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: Human–computer interaction, Computer science, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, Virtual reality, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]
Abstract: International audience; This paper describes a mixed interactive system managing mutual occlusions between real and virtual objects displayed by virtual reality display wall environments. These displays are physically unable to manage mutual occlusions between real and virtual objects. A real occluder located between the user’s eyes and the wall hides virtual objects regardless of their depth. This problem confuses the user’s stereopsis of the virtual environment, harming its user experience. For this reason, we present a mixed interactive system combining a stereoscopic optical see-through head-mounted display with a static stereoscopic display in order to manage mutual occlusions and enhance direct user interactions with virtual content. We illustrate our solution with a use case and an experiment proposal.
Published: 2021
Full Text: View/download PDF

34. Sparsity-based audio declipping methods: selected overview, new algorithms, and large-scale evaluation

Author: Clément Gaultier, Srdan Kitic, Nancy Bertin, Rémi Gribonval, Parcimonie et Nouveaux Algorithmes pour le Signal et la Modélisation Audio (PANAMA), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE (IRISA-D5), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Orange Labs [Cesson-Sévigné], Orange Labs, Dynamic Networks : Temporal and Structural Capture Approach (DANTE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Institut Rhône-Alpin des systèmes complexes (IXXI), École normale supérieure de Lyon (ENS de Lyon)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes (UGA), ERC-StG-2011-277906, European Research Council, European Project: 277906,EC:FP7:ERC,ERC-2011-StG_20101014,PLEASE(2012), SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE (IRISA-D5), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Institut Rhône-Alpin des systèmes complexes (IXXI), Université Grenoble Alpes (UGA)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Université Grenoble Alpes (UGA)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon, CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Université de Rennes (UNIV-RENNES)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Université de Rennes (UNIV-RENNES), Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université de Lyon-Université Lumière - Lyon 2 (UL2)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Joseph Fourier - Grenoble 1 (UJF)-École normale supérieure - Lyon (ENS Lyon)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Joseph Fourier - Grenoble 1 (UJF), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université Claude Bernard Lyon 1 (UCBL), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université Joseph Fourier - Grenoble 1 (UJF), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), École normale supérieure - Lyon (ENS Lyon)-Université Lumière - Lyon 2 (UL2)-Université Joseph Fourier - Grenoble 1 (UJF)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Lumière - Lyon 2 (UL2)-Université Joseph Fourier - Grenoble 1 (UJF)-Université Jean Moulin - Lyon 3 (UJML), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Acoustics and Ultrasonics, Computer science, audio declipping, 02 engineering and technology, Machine learning, computer.software_genre, time-frequency, Computer Science - Sound, Field (computer science), 030507 speech-language pathology & audiology, 03 medical and health sciences, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, Distortion, listening test, 0202 electrical engineering, electronic engineering, information engineering, Computer Science (miscellaneous), Code (cryptography), Electrical Engineering and Systems Science - Signal Processing, Electrical and Electronic Engineering, business.industry, sparsity, 020206 networking & telecommunications, structured sparsity, Benchmarking, Speech processing, Computational Mathematics, [INFO.INFO-SD]Computer Science [cs]/Sound [cs.SD], Benchmark (computing), Artificial intelligence, 0305 other medical science, Clipping (computer graphics), business, Scale (map), computer, Electrical Engineering and Systems Science - Audio and Speech Processing
Abstract: Recent advances in audio declipping have substantially improved the state of the art.% in certain saturation regimes. Yet, practitioners need guidelines to choose a method, and while existing benchmarks have been instrumental in advancing the field, larger-scale experiments are needed to guide such choices. First, we show that the clipping levels in existing small-scale benchmarks are moderate and call for benchmarks with more perceptually significant clipping levels. We then propose a general algorithmic framework for declipping that covers existing and new combinations of variants of state-of-the-art techniques exploiting time-frequency sparsity: synthesis vs. analysis sparsity, with plain or structured sparsity. Finally, we systematically compare these combinations and a selection of state-of-the-art methods. Using a large-scale numerical benchmark and a smaller scale formal listening test, we provide guidelines for various clipping levels, both for speech and various musical genres. The code is made publicly available for the purpose of reproducible research and benchmarking.
Published: 2021
Full Text: View/download PDF

35. Differential Fault Attack on Montgomery Ladder and in the Presence of Scalar Randomization

Author: Russon, Andy, Institut de Recherche Mathématique de Rennes (IRMAR), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-École normale supérieure - Rennes (ENS Rennes)-Université de Rennes 2 (UR2)-Centre National de la Recherche Scientifique (CNRS)-INSTITUT AGRO Agrocampus Ouest, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), Orange Labs [Cesson-Sévigné], Orange Labs, AGROCAMPUS OUEST, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Université de Rennes 2 (UR2), Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)
Subjects: Scalar blinding, Differential fault attack, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Montgomery ladder, 020202 computer hardware & architecture, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Scalar splitting, 010201 computation theory & mathematics, Computer Science::Multimedia, Elliptic curve, 0202 electrical engineering, electronic engineering, information engineering, Computer Science::Cryptography and Security
Abstract: International audience; Differential fault attacks are powerful techniques to break a cryptographic primitive, where the adversary disrupts the execution of a calculation to find a secret key. Those attacks have been applied in Elliptic Curve Cryptography under various types of faults, and there exists several protection mechanisms to prevent them.In this paper, we present a new differential fault attack on the Montgomery ladder algorithm for scalar multiplication. We further present that such attacks can be applied when specific point additions formulas are used and when different scalar blinding techniques to randomize the computation are present.
Published: 2021
Full Text: View/download PDF

36. Perceptual Quality Assessment of HEVC and VVC Standards for 8K Video

Author: Charles Bonnineau, Wassim Hamidouche, Jerome Fournier, Naty Sidaty, Jean-Francois Travers, Olivier Deforges, Institut d'Électronique et des Technologies du numéRique (IETR), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Nantes Université - pôle Sciences et technologie, Nantes Université (Nantes Univ)-Nantes Université (Nantes Univ), Institut de Recherche Technologique b-com (IRT b-com), Orange Labs [Cesson-Sévigné], Orange Labs, TéléDiffusion de France (TDF), Groupe TDF, ANR-A0-AIRT-07, French Government through the National Research Agency (ANR) Investment, and ANR-10-AIRT-0007,B-COM,B-COM(2010)
Subjects: HEVC, Standards, Subjective quality assessment, Image and Video Processing (eess.IV), ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, Electrical Engineering and Systems Science - Image and Video Processing, Bit rate, compression efficiency, Video recording, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, High efficiency video coding, UHD (4K), Media Technology, FOS: Electrical engineering, electronic engineering, information engineering, 8K, Electrical and Electronic Engineering, Video sequences, VVC, Quality assessment, Visualization
Abstract: With the growing data consumption of emerging video applications and users requirement for higher resolutions, up to 8K, a huge effort has been made in video compression technologies. Recently, versatile video coding (VVC) has been standardized by the moving picture expert group (MPEG), providing a significant improvement in compression performance over its predecessor high efficiency video coding (HEVC). In this paper, we provide a comparative subjective quality evaluation between VVC and HEVC standards for 8K resolution videos. In addition, we evaluate the perceived quality improvement offered by 8K over UHD 4K resolution. The compression performance of both VVC and HEVC standards has been conducted in random access (RA) coding configuration, using their respective reference software, VVC test model (VTM-11) and HEVC test model (HM-16.20). Objective measurements, using PSNR, MS-SSIM and VMAF metrics have shown that the bitrate gains offered by VVC over HEVC for 8K video content are around 31%, 26% and 35%, respectively. Subjectively, VVC offers an average of 40% of bitrate reduction over HEVC for the same visual quality. A compression gain of 50% has been reached for some tested video sequences regarding a Student t-test analysis. In addition, for most tested scenes, a significant visual difference between uncompressed 4K and 8K has been noticed., Comment: Paper under review
Published: 2021
Full Text: View/download PDF

37. Quality-driven Variable Frame-Rate for Green Video Coding in Broadcast Applications

Author: Wassim Hamidouche, Charles Bonnineau, Luce Morin, Glenn Herrou, Patrick Dumenil, Jerome Fournier, Institut d'Électronique et des Technologies du numéRique (IETR), Nantes Université (NU)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), TéléDiffusion de France (TDF), Groupe TDF, Institut de Recherche Technologique b-com (IRT b-com), Orange Labs [Cesson-Sévigné], Orange Labs, Université de Nantes (UN)-Université de Rennes 1 (UR1), Université de Nantes (UN)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), 10-AIRT-0007, French Government through the ANR Investment, and ANR-10-AIRT-0007,B-COM,B-COM(2010)
Subjects: Signal Processing (eess.SP), High Frame-Rate (HFR), Computer science, Real-time computing, 02 engineering and technology, High Efficiency Video Coding (HEVC), Video quality, Frame rate, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, Digital Video Broadcasting, FOS: Electrical engineering, electronic engineering, information engineering, 0202 electrical engineering, electronic engineering, information engineering, Media Technology, Variable frame rate, Codec, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, Electrical Engineering and Systems Science - Signal Processing, Ultra-High Definition (UHD), Encoder, High dynamic range, variable frame-rate
Abstract: International audience; The Digital Video Broadcasting (DVB) has proposed to introduce the Ultra-High Definition services in three phases: UHD-1 phase 1, UHD-1 phase 2 and UHD-2. The UHD-1 phase 2 specification includes several new features such as High Dynamic Range (HDR) and High Frame-Rate (HFR). It has been shown in several studies that HFR (+100 fps) enhances the perceptual quality and that this quality enhancement is content-dependent. On the other hand, HFR brings several challenges to the transmission chain including codec complexity increase and bit-rate overhead, which may delay or even prevent its deployment in the broadcast echo-system. In this paper, we propose a Variable Frame Rate (VFR) solution to determine the minimum (critical) frame-rate that preserves the perceived video quality of HFR video. The frame-rate determination is modeled as a 3-class classification problem which consists in dynamically and locally selecting one frame-rate among three: 30, 60 and 120 frames per second. Two random forests classifiers are trained with a ground truth carefully built by experts for this purpose. The subjective results conducted on ten HFR video contents, not included in the training set, clearly show the efficiency of the proposed solution enabling to locally determine the lowest possible frame-rate while preserving the quality of the HFR content. Moreover, our VFR solution enables significant bit-rate savings and complexity reductions at both encoder and decoder sides.
Published: 2020
Full Text: View/download PDF

38. Curves with fast computations in the first pairing group

Author: Olivier Sanders, Remi Clarisse, Sylvain Duquesne, Institut de Recherche Mathématique de Rennes (IRMAR), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-École normale supérieure - Rennes (ENS Rennes)-Université de Rennes 2 (UR2)-Centre National de la Recherche Scientifique (CNRS)-INSTITUT AGRO Agrocampus Ouest, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro), Orange Labs [Cesson-Sévigné], Orange Labs, AGROCAMPUS OUEST, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Université de Rennes 2 (UR2), Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)
Subjects: 050101 languages & linguistics, Computer science, business.industry, Group (mathematics), Computation, 05 social sciences, Cryptography, 02 engineering and technology, DFT, Algebra, Elliptic curve, Morinda citrifolia, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], ADMET, Scheme (mathematics), Pairing, Molecular docking, 0202 electrical engineering, electronic engineering, information engineering, MAPK6, 020201 artificial intelligence & image processing, 0501 psychology and cognitive sciences, business
Abstract: International audience; Pairings are a powerful tool to build advanced cryptographic schemes. The most efficient way to instantiate a pairing scheme is through Pairing-Friendly Elliptic Curves. Because a randomly picked elliptic curve will not support an efficient pairing (the embedding degree will usually be too large to make any computation practical), a pairing-friendly curve has to be carefully constructed. This has led to famous curves, e.g. Barreto-Naehrig curves. However, the computation of the Discrete Logarithm Problem on the finite-field side has received much interest and its complexity has recently decreased. Hence the need to propose new curves has emerged. In this work, we give one new curve that is specifically tailored to be fast over the first pairing-group, which is well suited for several cryptographic schemes, such as group signatures, and their variants, or accumulators.
Published: 2020

39. Group Signature without Random Oracles from Randomizable Signatures

Author: Remi Clarisse, Olivier Sanders, Institut de Recherche Mathématique de Rennes (IRMAR), AGROCAMPUS OUEST, Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Université de Rennes 2 (UR2), Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), Orange Labs [Cesson-Sévigné], Orange Labs, Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-École normale supérieure - Rennes (ENS Rennes)-Université de Rennes 2 (UR2)-Centre National de la Recherche Scientifique (CNRS)-INSTITUT AGRO Agrocampus Ouest, and Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)-Institut national d'enseignement supérieur pour l'agriculture, l'alimentation et l'environnement (Institut Agro)
Subjects: 050101 languages & linguistics, Authentication, Efflux pump, Multi-resistance, business.industry, Computer science, Data_MISCELLANEOUS, 05 social sciences, Structure–activity relationship, Cryptography, 02 engineering and technology, Group signature, Computer security, computer.software_genre, Bioactivity, Random oracle, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, 0501 psychology and cognitive sciences, business, computer, Anonymity
Abstract: International audience; Unlabelled - Chalcones are natural substances found in the metabolism of several botanical families. Their structure consists of 1,3-diphenyl-2-propen-1-one and they are characterized by having in their chains an α, β-unsaturated carbonyl system, two phenol rings and a three-carbon chain that unites them. In plants, Chalcones are mainly involved in the biosynthesis of flavonoids and isoflavonoids through the phenylalanine derivation. This group of substances has been shown to be a viable alternative for the investigation of its antibacterial potential, considering the numerous biological activities reported and the increase of the microbial resistance that concern global health agencies. is a bacterium that has stood out for its ability to adapt and develop resistance to a wide variety of drugs. This literature review aimed to highlight recent advances in the use of Chalcones and derivatives as antibacterial agents against , focusing on research articles available on the Science Direct, Pub Med and Scopus data platforms in the period 2015-2021. It was constructed informative tables that provided an overview of which types of Chalcones are being studied more (Natural or Synthetic); its chemical name and main Synthesis Methodology. From the analysis of the data, it was observed that the compounds based on Chalcones have great potential in medicinal chemistry as antibacterial agents and that the molecular skeletons of these compounds as well as their derivatives can be easily obtained through substitutions in the A and B rings of Chalcones, in order to obtain the desired bioactivity. It was verified that Chalcones and derivatives are promising agents for combating the multidrug resistance of to drugs. Supplementary information - The online version contains supplementary material available at 10.1007/s13205-022-03398-7.
Published: 2020

40. Creating AR Applications for the IOT : a New Pipeline

Author: Jérémy Lacoche, Eric Villain, Barnabé Soedji, Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: Augmented Reality, business.industry, Computer science, HCI theory, and Eric Villain 2020 Creating, 020206 networking & telecommunications, Virtual Reality ACM Reference Format: Ablam Edoh Barnabé Soedji, 02 engineering and technology, Virtual reality, Pipeline (software), Virtual reality KEYWORDS IoT, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], Rendering (computer graphics), Task (project management), Jérémy Lacoche, CCS CONCEPTS • Human-centered computing → Interactive systems and tools, Feature (computer vision), Human–computer interaction, concepts and models, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Smart environment, Augmented reality, Internet of Things, business
Abstract: International audience; (a) (b) (c) (d) Figure 1: The creation pipeline is composed of 4 steps: example of an augmented light bulb (a) A digital twin of the smart environment is captured (b) Augmentations are configured in the digital twin with VR interactions (c) The created application can be tested with an AR in VR simulator (d) The application can be deployed on AR devices. ABSTRACT Prototyping Augmented Reality (AR) applications for smart environments is still a difficult task. Therefore, we propose a pipeline to help designers and developers to create AR applications for monitoring and controlling indoor environments equipped with connected objects. This pipeline starts with the capture (geometry and objects) of the real environment with an AR device. Then, it proposes a Virtual Reality (VR) tool to configure augmentations in this captured environment. This tool includes a feature to simulate AR devices to help anticipate the application's rendering on real devices. The created application can then be seamlessly deployed on various AR devices including smartphones,tablets and glasses.
Published: 2020
Full Text: View/download PDF

41. Tone mapping high dynamic 3D scenes with global lightness coherency

Author: Rémi Cozot, Jérémy Lacoche, Ific Goudé, MEDIA ET INTERACTIONS (IRISA-D6), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Orange Labs, Laboratoire d'Informatique Signal et Image de la Côte d'Opale (LISIC), Université du Littoral Côte d'Opale (ULCO), Computational Visual Perception and Applications ( PERCEPT), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Orange Labs [Cesson-Sévigné], ANR-17-CE23-0020,ReVeRY,Vidéo riche pour une meilleure créativité(2017), Computational Visual Perception and Applications (PERCEPT), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes)
Subjects: Computer science, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, 02 engineering and technology, Tone mapping, Luminance, Rendering (computer graphics), Operator (computer programming), 0202 electrical engineering, electronic engineering, information engineering, Computer vision, High dynamic range, ComputingMilieux_MISCELLANEOUS, ComputingMethodologies_COMPUTERGRAPHICS, Viewport, business.industry, General Engineering, [INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM], 020207 software engineering, High Dynamic Range, Head Mounted Display, Computer Graphics and Computer-Aided Design, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], Visualization, Human-Computer Interaction, 3D scene, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], Human visual system model, 020201 artificial intelligence & image processing, Artificial intelligence, Tone Mapping Operator, business
Abstract: International audience; We propose a new approach for real-time Tone Mapping Operator dedicated to High Dynamic Range rendering of interactive 3D scenes. The proposed method considers the whole scene lighting in order to preserve the global coherency. This is the major contribution of our method. Indeed, most of existing Tone Mapping Operators only consider the image rendered by the camera at the current frame and simulate the Human Visual System accommodation to bright and dark luminance. Consequently, after an adaptation time, the lighting design of the 3D scene is lost. For example, two rooms with a high contrast (one dark and one bright) can be perceived with the same luminance level after adaptation. To cope with this coherency issue, we adapt an existing Tone Mapping Operator that combines (1) a global Tone Mapping Operator which takes into account the High Dynamic Range of the whole scene and (2) a viewport frame based Tone Mapping Operator that enhances the image contrast. Thus, we preserve the global lighting coherency and enhance the contrast for each rendered image. Furthermore, we present a subjective evaluation that shows that our method provides a better user experience than previous methods in the case of visualization on Head-Mounted Display.
Published: 2020
Full Text: View/download PDF

42. Data-driven Thresholding in Denoising with Spectral Graph Wavelet Transform

Author: Baptiste Olivier, Fabien Navarro, Basile de Loynes, Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] (ENSAI), Centre de Recherche en Economie et Statistique [Bruz] (CREST), Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: Signal Processing (eess.SP), FOS: Computer and information sciences, Mean squared error, Applied Mathematics, Noise reduction, Estimator, Wavelet transform, 010103 numerical & computational mathematics, 01 natural sciences, Thresholding, Graph, Data-driven, Methodology (stat.ME), 010101 applied mathematics, Computational Mathematics, Partition of unity, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], FOS: Electrical engineering, electronic engineering, information engineering, Electrical Engineering and Systems Science - Signal Processing, 0101 mathematics, Algorithm, [STAT.ME]Statistics [stat]/Methodology [stat.ME], Statistics - Methodology, Mathematics
Abstract: International audience; This paper is devoted to adaptive signal denoising in the context of Graph Signal Processing (GSP) using Spectral Graph Wavelet Transform (SGWT). This issue is addressed \emph{via} a data-driven thresholding process in the transformed domain by optimizing the parameters in the sense of the Mean Square Error (MSE) using the Stein's Unbiased Risk Estimator (SURE). The SGWT considered is built upon a partition of unity making the transform semi-orthogonal so that the optimization can be performed in the transformed domain. However, since the SGWT is over-complete, the divergence term in the SURE needs to be computed in the context of correlated noise. Two thresholding strategies called coordinatewise and block thresholding process are investigated. For each of them, the SURE is derived for a whole family of elementary thresholding functions among which the soft threshold and the James-Stein threshold. This multi-scales analysis shows better performance than the most recent methods from the literature. That is illustrated numerically for a series of signals on different graphs.
Published: 2020
Full Text: View/download PDF

43. Do Distant or Colocated Audiences Affect User Activity in VR?

Author: Terrier, Romain, Martin, Nicolas, Lacoche, Jérémy, Gouranton, Valérie, Arnaldi, Bruno, Institut de Recherche Technologique b-com (IRT b-com), 3D interaction with virtual environments using body and mind (Hybrid), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-MEDIA ET INTERACTIONS (IRISA-D6), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Orange Labs [Cesson-Sévigné], Orange Labs, Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA), ANR-07-A0-AIRT b<>com, Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), and Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)
Subjects: [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]
Abstract: International audience; We explore the impact of distant or colocated real audiences on social inhibition through a user study in virtual reality (VR). The study investigates, in an application, the differences among two multi-user configurations (i.e., the local and distant conditions) and one control condition where the user is alone (i.e., the alone condition). In the local condition, a single user and a real audience share the same real room. Conversely, in the distant condition, the user and the audience are separated into two different real rooms. The user performed a categorization of numbers task in VR, for which the users’ performance results (i.e., type and answering time) are extracted as subjective feelings and perceptions (i.e., perceptions of others, stress, cognitive workload, presence). The differences between the local and distant configurations are explored. Furthermore, we investigate any gender biases in the objective and subjective results. During the local and distant conditions, the presence of a real audience affects the user’s performance due to social inhibition. The users are even more influenced when the audience does not share the same room, despite the audience being less directly perceived in this condition.
Published: 2020
Full Text: View/download PDF

44. Localized Fourier Analysis for Graph Signal Processing

Author: Basile de Loynes, Baptiste Olivier, Fabien Navarro, Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] (ENSAI), Centre de Recherche en Economie et Statistique [Bruz] (CREST), Orange Labs [Cesson-Sévigné], Orange Labs, Université Paris 1 Panthéon-Sorbonne - UFR Mathématiques & Informatique (UP1 UFR27), Université Paris 1 Panthéon-Sorbonne (UP1), and Statistique, Analyse et Modélisation Multidisciplinaire (SAmos-Marin Mersenne) (SAMM)
Subjects: Signal Processing (eess.SP), Concentration in- equalities, Graph signal processing, Spectral graph theory, Harmonic analysis on graphs, 010103 numerical & computational mathematics, 01 natural sciences, Variance estimation, Combinatorics, 010104 statistics & probability, symbols.namesake, Matrix (mathematics), Chebyshev Approximations, Graph Fourier Transform, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], FOS: Electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Partition (number theory), Frame, 0101 mathematics, Electrical Engineering and Systems Science - Signal Processing, Mathematics, Sequence, Denoising, Chebyshev Ap- proximations, Applied Mathematics, Multiscale statistics, Nonparametric regression, Functional Analysis (math.FA), Mathematics - Functional Analysis, Fourier transform, Fourier analysis, Graph laplacian, symbols, Interval (graph theory), Concentration inequalities, Laplacian matrix, Wavelet, [MATH.MATH-SP]Mathematics [math]/Spectral Theory [math.SP]
Abstract: International audience; We propose a new point of view in the study of Fourier analysis on graphs, taking advantage of localization in the Fourier domain. For a signal $f$ on vertices of a weighted graph $\mathcal{G}$ with Laplacian matrix $\mathcal{L}$, standard Fourier analysis of $f$ relies on the study of functions $g(\mathcal{L})f$ for some filters $g$ on $I_\mathcal{L}$, the smallest interval containing the Laplacian spectrum ${\rm sp}(\mathcal{L}) \subset I_\mathcal{L}$. We show that for carefully chosen partitions $I_\mathcal{L} = \sqcup_{1\leq k\leq K} I_k$ ($I_k \subset I_\mathcal{L}$), there are many advantages in understanding the collection $(g(\mathcal{L}_{I_k})f)_{1\leq k\leq K}$ instead of $g(\mathcal{L})f$ directly, where $\mathcal{L}_I$ is the projected matrix $P_I(\mathcal{L})\mathcal{L}$. First, the partition provides a convenient modelling for the study of theoretical properties of Fourier analysis and allows for new results in graph signal analysis (\emph{e.g.} noise level estimation, Fourier support approximation). We extend the study of spectral graph wavelets to wavelets localized in the Fourier domain, called LocLets, and we show that well-known frames can be written in terms of LocLets. From a practical perspective, we highlight the interest of the proposed localized Fourier analysis through many experiments that show significant improvements in two different tasks on large graphs, noise level estimation and signal denoising. Moreover, efficient strategies permit to compute sequence $(g(\mathcal{L}_{I_k})f)_{1\leq k\leq K}$ with the same time complexity as for the computation of $g(\mathcal{L})f$.
Published: 2020
Full Text: View/download PDF

45. Estimating semantic structure for the VQA answer space

Author: Kervadec, Corentin, Antipov, Grigory, Baccouche, Moez, Wolf, Christian, Extraction de Caractéristiques et Identification (imagine), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), Orange Labs [Cesson-Sévigné], and Orange Labs
Subjects: FOS: Computer and information sciences, visual reasoning, Computer Science - Computation and Language, Computer Vision and Pattern Recognition (cs.CV), vision and language, Computer Science - Computer Vision and Pattern Recognition, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], VQA, Computation and Language (cs.CL)
Abstract: Since its appearance, Visual Question Answering (VQA, i.e. answering a question posed over an image), has always been treated as a classification problem over a set of predefined answers. Despite its convenience, this classification approach poorly reflects the semantics of the problem limiting the answering to a choice between independent proposals, without taking into account the similarity between them (e.g. equally penalizing for answering cat or German shepherd instead of dog). We address this issue by proposing (1) two measures of proximity between VQA classes, and (2) a corresponding loss which takes into account the estimated proximity. This significantly improves the generalization of VQA models by reducing their language bias. In particular, we show that our approach is completely model-agnostic since it allows consistent improvements with three different VQA models. Finally, by combining our method with a language bias reduction approach, we report SOTA-level performance on the challenging VQAv2-CP dataset., [WARNING] We want to notice the reader that additional experiments (not in the paper) have shown that using a `random' semantic space performs as much as the proposed semantic loss. This additional result question the effectiveness of our method
Published: 2020

46. Sparsity-based audio declipping methods: overview, new algorithms, and large-scale evaluation

Author: Gaultier, Clément, Kitić, Srđan, Gribonval, Rémi, Bertin, Nancy, Parcimonie et Nouveaux Algorithmes pour le Signal et la Modélisation Audio (PANAMA), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SIGNAUX ET IMAGES NUMÉRIQUES, ROBOTIQUE (IRISA-D5), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Université de Rennes (UNIV-RENNES)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Rennes (ENS Rennes)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Université de Rennes (UNIV-RENNES), Orange Labs [Cesson-Sévigné], Orange Labs, Dynamic Networks : Temporal and Structural Capture Approach (DANTE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Institut Rhône-Alpin des systèmes complexes (IXXI), Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université de Lyon-Université Lumière - Lyon 2 (UL2)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Joseph Fourier - Grenoble 1 (UJF)-École normale supérieure - Lyon (ENS Lyon)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Joseph Fourier - Grenoble 1 (UJF), and European Project: 277906,EC:FP7:ERC,ERC-2011-StG_20101014,PLEASE(2012)
Subjects: [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, listening test, sparsity, [INFO.INFO-SD]Computer Science [cs]/Sound [cs.SD], audio declipping, structured sparsity, time-frequency
Abstract: Recent advances in audio declipping have substantially improved the state of the art in certain saturation regimes. Yet, practitioners need guidelines to choose a method, and while existing benchmarks have been instrumental in advancing the field, larger-scale experiments are needed to guide such choices. First, we show that the saturation levels in existing small-scale benchmarks are moderate and call for benchmarks with more perceptually significant saturation levels. We then propose a general algorithmic framework for declipping that covers existing and new combinations of flavors of state-of-the-art techniques exploiting time-frequency sparsity: synthesis vs analysis sparsity, with plain or structured sparsity. Finally, we systematically compare these combinations and state-of-the-art methods. Using a large-scale numerical benchmarks and a smaller scale formal listening test, we provide guidelines for various saturation levels, both for speech and various musical “genres” from the RWC database. The code is made publicly available for the purpose of reproducible research and benchmarking.
Published: 2020

47. Short-Distance Intra Prediction of Screen Content in Versatile Video Coding (VVC)

Author: Frederic Dufaux, Pierre Duhamel, Felix Henry, Mohsen Abdoli, Patrice Brault, Orange Labs - Cesson-Sévigné, Orange Labs, Laboratoire des signaux et systèmes (L2S), and Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)
Subjects: Pixel, Computer science, Applied Mathematics, 030229 sport sciences, 02 engineering and technology, Screen content coding, Short distance, Intra prediction, 03 medical and health sciences, 0302 clinical medicine, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], Signal Processing, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Algorithm, Encoder, VVC, Coding (social sciences)
Abstract: International audience; A novel intra prediction algorithm is proposed to improve the coding performance of screen content for the emerging Versatile Video Coding (VVC) standard. The algorithm, called in-loop residual coding with scalar quantization, employs in-block pixels as reference rather than the regular out-block ones. To this end, an additional in-loop residual signal is used to partially reconstruct the block at the pixel level, during the prediction. The proposed algorithm is essentially designed to target high detail textures, where deep block partitioning structure is required. Therefore, it is implemented to operate on 4×4 blocks only, where further block split is not allowed and the standard algorithm is still unable to properly predict the texture. Experiments in the Joint Exploration Model (JEM) reference software show that the proposed algorithm brings a Bjontegaard Delta (BD)-rate gain of 13% on synthetic content, with a negligible computational complexity overhead at both encoder and decoder sides.
Published: 2018
Full Text: View/download PDF

48. Contributions of Climate Change, CO2, Land-Use Change, and Human Activities to Changes in River Flow across 10 Chinese Basins

Author: Catherine Ottlé, Jiashuo Yu, Philippe Ciais, Yi Xi, Xuhui Wang, Yan Bo, Zun Yin, Feng Zhou, Shilong Piao, Shushi Peng, Matthieu Guimberteau, Yue Li, Xuanze Zhang, Jan Polcher, Laboratoire des Sciences du Climat et de l'Environnement [Gif-sur-Yvette] (LSCE), Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), ICOS-ATC (ICOS-ATC), Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ), Orange Labs [Cesson-Sévigné], Orange Labs, Sino-French Institute for Earth System Science, College of Urban and Environmental Sciences, Peking University [Beijing], Laboratoire de Météorologie Dynamique (UMR 8539) (LMD), Département des Géosciences - ENS Paris, École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-École des Ponts ParisTech (ENPC)-École polytechnique (X)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC), Mads Clausen Institute for Product Innovation, University of Southern Denmark (SDU), Modélisation des Surfaces et Interfaces Continentales (MOSAIC), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Institut national des sciences de l'Univers (INSU - CNRS)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut national des sciences de l'Univers (INSU - CNRS)-École polytechnique (X)-École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Département des Géosciences - ENS Paris, École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-École normale supérieure - Paris (ENS-PSL), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)
Subjects: Atmospheric Science, 010504 meteorology & atmospheric sciences, Hydrological modelling, 0208 environmental biotechnology, Climate change, 02 engineering and technology, 15. Life on land, 01 natural sciences, 6. Clean water, 020801 environmental engineering, Water resources, Hydrology (agriculture), [SDU]Sciences of the Universe [physics], 13. Climate action, Streamflow, [SDE]Environmental Sciences, Per capita, Environmental science, Land use, land-use change and forestry, Hydrometeorology, [SDU.ENVI]Sciences of the Universe [physics]/Continental interfaces, environment, Water resource management, ComputingMilieux_MISCELLANEOUS, 0105 earth and related environmental sciences
Abstract: As an essential source of freshwater river flow comprises ~80% of the water consumed in China. Per capita water resources in China are only a quarter of the global average, and its economy is demanding in water resources; this creates an urgent need to quantify the factors that contribute to changes in river flow. Here, we used an offline process-based land surface model (ORCHIDEE) at high spatial resolution (0.1° × 0.1°) to simulate the contributions of climate change, rising atmospheric CO2 concentration, and land-use change to the change in natural river flow for 10 Chinese basins from 1979 to 2015. We found that climate change, especially an increase in precipitation, was responsible for more than 90% of the changes in natural river flow, while the direct effect of rising CO2 concentration and land-use change contributes at most 6.3%. Nevertheless, rising CO2 concentration and land-use change cannot be neglected in most basins as these two factors significantly change transpiration. From 2003 to 2015, the increase in water consumption offset more than 30% of the increase in natural river flow in northern China, especially in the Yellow River basin (~140%), but it had little effect on observed river flow in southern China. Although the uncertainties of rainfall data and the statistical water consumption data could propagate the uncertainties in simulated river flow, this study could be helpful for water planning and management in China under the context of global warming.
Published: 2018
Full Text: View/download PDF

49. Performance evaluation of TcpHas: TCP for HTTP adaptive streaming

Author: Bernard Cousin, Eugen Dedu, Chiheb Ben Ameur, Emmanuel Mory, INNES, Orange Labs [Cesson-Sévigné], Orange Labs, Advanced technologies for operated networks (ADOPNET), Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec, Université de Rennes (UNIV-RENNES), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS), Université de Rennes (UR)-IMT Atlantique (IMT Atlantique), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Université de Rennes (UR), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), and Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)
Subjects: Computer Networks and Communications, Computer science, Quality of Service, 050801 communication & media studies, Cross-layer optimization, Cryptography, 02 engineering and technology, TCP Congestion Control, Bottleneck, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0508 media and communications, 0202 electrical engineering, electronic engineering, information engineering, Media Technology, Quality of experience, business.industry, Network packet, Quality of service, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 05 social sciences, 020207 software engineering, Traffic Shaping, Hardware and Architecture, Queuing delay, Traffic shaping, business, Cross-layer Optimization, Software, Quality of Experience, Information Systems, Computer network
Abstract: International audience; HTTP Adaptive Streaming (HAS) is a widely used video streaming technology that suffers from a degradation of user's Quality of Experience (QoE) and network's Quality of Service (QoS) when many HAS players are sharing the same bottleneck link and competing for bandwidth. The two major factors of this degradation are: the large OFF period of HAS, which causes false bandwidth estimations, and the TCP congestion control, which is not suitable for HAS given that it does not consider the different video encoding bitrates of HAS. This paper proposes a HAS-based TCP congestion control, TcpHas, that minimizes the impact of the two aforementioned issues. It does this by using traffic shaping on the server. Simulations indicate that TcpHas improves both QoE, mainly by reducing instability and convergence speed, and QoS, mainly by reducing queuing delay and packet drop rate.
Published: 2018
Full Text: View/download PDF

50. Doppler Effect Reduction in an OFDM System Thanks to Massive MIMO

Author: Alexis Bazin, Bruno Jahan, Maryline Helard, Institut d'Électronique et des Technologies du numéRique (IETR), Université de Nantes (UN)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Orange Labs [Cesson-Sévigné], Orange Labs, Nantes Université (NU)-Université de Rennes 1 (UR1), Université de Nantes (UN)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), and Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)
Subjects: General Computer Science, Orthogonal frequency-division multiplexing, Computer science, MIMO, Context (language use), 02 engineering and technology, Data_CODINGANDINFORMATIONTHEORY, Interference (wave propagation), Reduction (complexity), symbols.namesake, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 0203 mechanical engineering, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, 0202 electrical engineering, electronic engineering, information engineering, Electronic engineering, massive MIMO, General Materials Science, Maximal-ratio combining, Computer Science::Information Theory, OFDM, General Engineering, 020302 automobile design & engineering, 020206 networking & telecommunications, Doppler effect, Modulation, symbols, lcsh:Electrical engineering. Electronics. Nuclear engineering, lcsh:TK1-9971, 5G, Communication channel
Abstract: International audience; Among many challenges, 5G should improve the quality of service for moving users. In such a mobility context, the Doppler effect creates interference which can severely damage the performance of the systems. The effect of very large number of uncorrelated receive antennas on the Doppler effect is studied in this paper with a simple maximum ratio combining receiver and the orthogonal frequency division multiplexing modulation. This paper relies on an analytical analysis of the signal-to-interference ratio (SIR) and on a statistical analysis of the propagation channel. Therefore, the contribution of this paper is twofold. First, the asymptotic SIR is analytically expressed when the number of receive antennas tends toward infinity. Second, the decrease of the impact of the Doppler effect with the increase of the number of receive antennas is demonstrated, proving that a massive multiple-input multiple-output system with a low-complexity maximum ratio combining receiver can be used to improve the quality of service in mobility scenarios. Finally, the simulation results highlight the impact of such a massive multiple-input multiple-output system in practice.
Published: 2018
Full Text: View/download PDF

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Journal

Database

Publisher

228 results on '"Orange Labs [Cesson-Sévigné]"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources