IT department

The next events of the department

Il n'y a pas d'événement en cours ou à venir pour le département.
Latest publications
Communication dans un congrès
Mouchet Maxime, Chonavel Thierry, Vaton Sandrine
Statistical Characterization of Round-Trip Times with Nonparametric Hidden Markov Models
IFIP/IEEE IM 2019 Workshop: 4th International Workshop on Analytics for Network and Service Management (AnNet 2019), Apr 2019, Washington, DC, United States
Bibtext :
@inproceedings{mouchet:hal-02010099,
TITLE = {{Statistical Characterization of Round-Trip Times with Nonparametric Hidden Markov Models}},
AUTHOR = {Mouchet, Maxime and Chonavel, Thierry and Vaton, Sandrine},
URL = {https://hal.archives-ouvertes.fr/hal-02010099},
BOOKTITLE = {{IFIP/IEEE IM 2019 Workshop: 4th International Workshop on Analytics for Network and Service Management (AnNet 2019)}},
ADDRESS = {Washington, DC, United States},
YEAR = {2019},
MONTH = Apr,
PDF = {https://hal.archives-ouvertes.fr/hal-02010099/file/AnNet_2019.pdf},
HAL_ID = {hal-02010099},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Statistical Characterization of Round-Trip Times with Nonparametric Hidden Markov Models
%+ Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA)
%+ Département Informatique (IMT Atlantique - INFO)
%+ Université Bretagne Loire (UBL)
%+ Lab-STICC_TB_CID_TOMS
%+ Département Signal et Communications (IMT Atlantique - SC)
%A Mouchet, Maxime
%A Chonavel, Thierry
%A Vaton, Sandrine
%< avec comité de lecture
%B IFIP/IEEE IM 2019 Workshop: 4th International Workshop on Analytics for Network and Service Management (AnNet 2019)
%C Washington, DC, United States
%8 2019-04-08
%D 2019
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X The study of round-trip time (RTT) measurements on the Internet is of particular importance for improving real-time applications, enforcing QoS with traffic engineering, or detecting unexpected network conditions. On large timescales, from 1 hour to several days, RTT measurements exhibit characteristic patterns due to inter and intra-AS routing changes and traffic engineering, in addition to link congestion. We propose the use of a nonparametric Bayesian model, the Hierarchical Dirichlet Process Hidden Markov Model (HDP-HMM), to characterize RTT timeseries. The parameters of the HMM, including the number of states, as well as the values of hidden states are estimated from delay observations by Gibbs sampling. No assumptions are made on the number of states, and a nonparametric mixture model is used to represent a wide range of delay distribution in each state for more flexibility. We validate the model through three applications: on RIPE Atlas measurements we show that 80% of the states learned on RTTs match only one AS path; on a labelled delay changepoint dataset we show that the model is competitive with state-of-the-art changepoint detection methods in terms of precision and recall; and we show that the predictive ability of the model allows us to reduce the monitoring cost by 90% in routing overlays using Markov decision processes.
%G English
%2 https://hal.archives-ouvertes.fr/hal-02010099/document
%2 https://hal.archives-ouvertes.fr/hal-02010099/file/AnNet_2019.pdf
%L hal-02010099
%U https://hal.archives-ouvertes.fr/hal-02010099
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ IRISA_SET
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC
%~ LAB-STICC_TB
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_TOMS
%~ LAB-STICC_IMTA
%~ INRIA-AUT
%~ IMTA_INFO
%~ IMTA_SC
%~ INSA-GROUPE
%~ UNIV-RENNES1
%~ UR1-MATH-STIC
%~ UR1-HAL
%~ UR1-UFR-ISTIC
%~ TEST-UR-CSS
%~ IRISA_IMTA
%~ UNIV-RENNES
%~ PRACOM
Communication dans un congrès
El Ankouri Anas, Neto Luiz, Simon Gaël, Le Bras Hugues, Sanhaji Ali, Chanclou P.
High-Speed Train Cell-less Network Enabled by XGS-PON and Impacts on vRAN Split Interface Transmission
OFC 2019 (Optical Fiber Conference), Mar 2019, San Diego, United States
Bibtext :
@inproceedings{elankouri:hal-02018862,
TITLE = {{High-Speed Train Cell-less Network Enabled by XGS-PON and Impacts on vRAN Split Interface Transmission}},
AUTHOR = {EL ANKOURI, ANAS and Neto, Luiz Anet and Simon, Ga{\"e}l and Le Bras, Hugues and Sanhaji, Ali and Chanclou, P.},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02018862},
BOOKTITLE = {{OFC 2019 (Optical Fiber Conference)}},
ADDRESS = {San Diego, United States},
YEAR = {2019},
MONTH = Mar,
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-02018862/file/OFC%202019.pdf},
HAL_ID = {hal-02018862},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T High-Speed Train Cell-less Network Enabled by XGS-PON and Impacts on vRAN Split Interface Transmission
%+ Orange Labs [Lannion]
%+ Département Informatique (IMT Atlantique - INFO)
%A EL ANKOURI, ANAS
%A Neto, Luiz, Anet
%A Simon, Gaël
%A Le Bras, Hugues
%A Sanhaji, Ali
%A Chanclou, P.
%< avec comité de lecture
%B OFC 2019 (Optical Fiber Conference)
%C San Diego, United States
%8 2019-03-03
%D 2019
%Z 1902.06137
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X We successfully demonstrate a transmission of a high layer split mobile interface for cell-less, high-speed train network applications using a commercially available XGS-PON. Operation is also demonstrated for a GbE interface.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02018862/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-02018862/file/OFC%202019.pdf
%L hal-02018862
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-02018862
%~ IMT-ATLANTIQUE
%~ IMTA_INFO
Communication dans un congrès
Manoury Alexandre, Nguyen Sao Mai, Buche Cédric
CHIME: an Adaptive Hierarchical Representation for Continuous Intrinsically Motivated Exploration
The Third IEEE International Conference on Robotic Computing (IRC 2019), Feb 2019, Naples, Italy. 〈http://irc.asia.edu.tw/2019/〉
Bibtext :
@inproceedings{manoury:hal-02072393,
TITLE = {{CHIME: an Adaptive Hierarchical Representation for Continuous Intrinsically Motivated Exploration}},
AUTHOR = {Manoury, Alexandre and Nguyen, Sao Mai and Buche, C{\'e}dric},
URL = {https://hal.archives-ouvertes.fr/hal-02072393},
BOOKTITLE = {{The Third IEEE International Conference on Robotic Computing (IRC 2019)}},
ADDRESS = {Naples, Italy},
YEAR = {2019},
MONTH = Feb,
KEYWORDS = {Adaptive ; Continuous learning ; Life-long learning ; Intrinsic motivation ; Goal-babbling ; Hierarchy ; Planning},
PDF = {https://hal.archives-ouvertes.fr/hal-02072393/file/IRC_2019__Short_%20%282%29.pdf},
HAL_ID = {hal-02072393},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T CHIME: an Adaptive Hierarchical Representation for Continuous Intrinsically Motivated Exploration
%+ Département Informatique (IMT Atlantique - INFO)
%+ Lab-STICC_IMTA_CID_IHSEV
%+ Laboratoire d'Informatique des Systèmes Complexes (LISYC)
%A Manoury, Alexandre
%A Nguyen, Sao Mai
%A Buche, Cédric
%< avec comité de lecture
%B The Third IEEE International Conference on Robotic Computing (IRC 2019)
%C Naples, Italy
%8 2019-02-25
%D 2019
%K Adaptive
%K Continuous learning
%K Life-long learning
%K Intrinsic motivation
%K Goal-babbling
%K Hierarchy
%K Planning
%Z Computer Science [cs]/Artificial Intelligence [cs.AI]
%Z Computer Science [cs]/Machine Learning [cs.LG]
%Z Computer Science [cs]/Robotics [cs.RO]Conference papers
%X For a lifelong learning, robots need to learn and adapt to the environment to complete multiple tasks ranging from low-level to high-level tasks, using simple actions or complex ones. Current intrinsically motivated solutions often rely on fixed representations of this environment to define possible tasks, limiting the possibility to adapt to new or changing ones. We propose an algorithm that is able to autonomously 1) self-discover tasks to learn in its environment 2) discover the relationship between tasks to leverage its acquired knowledge on low-level tasks to solve high-level tasks 3) devise a sequence of policies of unbounded length to complete the tasks. Our algorithm, named Continual Hierarchical Intrinsically Motivated Exploration (CHIME), uses planning to build chains of actions, the learning of a hierarchical representation of tasks to reuse low-level skills for high-level tasks and intrinsically-motivated goal babbling to discover new subtasks and orient its learning in its high-dimensional continuous environment. To highlight the features of CHIME, we implement it in a simulated mobile robot where it can move and place objects.
%G English
%2 https://hal.archives-ouvertes.fr/hal-02072393/document
%2 https://hal.archives-ouvertes.fr/hal-02072393/file/IRC_2019__Short_%20%282%29.pdf
%L hal-02072393
%U https://hal.archives-ouvertes.fr/hal-02072393
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA_CID_IHSEV
%~ IMT-ATLANTIQUE
%~ IMTA_INFO
%~ INSTITUT-TELECOM
Communication dans un congrès
Saverimoutou Antoine, Mathieu Bertrand, Vaton Sandrine
Web View: Measuring & Monitoring Representative Information on Websites
ICIN 2019 - QOE-MANAGEMENT 2019, Feb 2019, Paris, France
Bibtext :
@inproceedings{saverimoutou:hal-02072471,
TITLE = {{Web View: Measuring \& Monitoring Representative Information on Websites}},
AUTHOR = {Saverimoutou, Antoine and Mathieu, Bertrand and Vaton, Sandrine},
URL = {https://hal.archives-ouvertes.fr/hal-02072471},
BOOKTITLE = {{ICIN 2019 - QOE-MANAGEMENT 2019}},
ADDRESS = {Paris, France},
YEAR = {2019},
MONTH = Feb,
KEYWORDS = {Web Browsing ; Web Monitoring ; QoE ; QoS},
PDF = {https://hal.archives-ouvertes.fr/hal-02072471/file/WebView-QoE_Management2019.pdf},
HAL_ID = {hal-02072471},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T Web View: Measuring & Monitoring Representative Information on Websites
%+ Orange Labs [Lannion]
%+ Département Informatique (IMT Atlantique - INFO)
%+ Advanced technologies for operated networks (ADOPNET)
%+ IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique)
%+ RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA_D2)
%A Saverimoutou, Antoine
%A Mathieu, Bertrand
%A Vaton, Sandrine
%< avec comité de lecture
%B ICIN 2019 - QOE-MANAGEMENT 2019
%C Paris, France
%8 2019-02-18
%D 2019
%K Web Browsing
%K Web Monitoring
%K QoE
%K QoS
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Web browsing is a fast-paced and changing domain which delivers a wide set of services to end-users. While end-users' QoE (Quality of Experience) is the main focus of large service companies and service providers, websites' structure on the one hand change relentlessly. There is therefore a strong need to measure the temporal quality of web browsing by using user-representative web browsers, different Internet protocols and types of residential network access. We present in this paper our tool, Web view, which performs automated desk-top web browsing sessions where each measurement provides 61 monitoring parameters. An analysis of 8 Million different measurements of web pages' homepage indicate which and how different parameters can impact today's web browsing quality. Web measurement campaigns conducted since February 2018 are represented through a monitoring website. Our analysis and monitoring of measurements on a 10-month period show that Google Chrome brings increased web browsing quality.
%G English
%2 https://hal.archives-ouvertes.fr/hal-02072471/document
%2 https://hal.archives-ouvertes.fr/hal-02072471/file/WebView-QoE_Management2019.pdf
%L hal-02072471
%U https://hal.archives-ouvertes.fr/hal-02072471
%~ CNRS
%~ UNIV-UBS
%~ IRISA_SET
%~ UNIV-RENNES1
%~ UR1-HAL
%~ CENTRALESUPELEC
%~ TEST-IRISA-TB
%~ IRISA
%~ INRIA
%~ IMT-ATLANTIQUE
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ IRISA-ADOPNET-IMTA
%~ IMTA_INFO
%~ INSA-GROUPE
%~ UR1-MATH-STIC
%~ UR1-UFR-ISTIC
%~ IRISA_IMTA
%~ INRIA-AUT
Communication dans un congrès
Fahed Lina, Lenca Philippe, Haralambous Yannis, Lefort Riwal, Tallec Marie-Laure
Prédiction d'évènements distants basée sur les règles séquentielles
EGC 2019 : Extraction et gestion des connaissances, Jan 2019, Metz, France. Actes EGC 2019 : Extraction et gestion des connaissances, 2019
Details
Quote
Bibtext :
@inproceedings{fahed:hal-01962067,
TITLE = {{Distant events prediction based on sequential rules}},
AUTHOR = {Fahed, Lina and Lenca, Philippe and Haralambous, Yannis and Lefort, Riwal and Tallec, Marie-Laure},
URL = {https://hal.archives-ouvertes.fr/hal-01962067},
BOOKTITLE = {{EGC 2019 : Extraction et gestion des connaissances}},
ADDRESS = {Metz, France},
HAL_LOCAL_REFERENCE = {19290},
PAGES = {.},
YEAR = {2019},
MONTH = Jan,
HAL_ID = {hal-01962067},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Distant events prediction based on sequential rules
%+ Département Informatique (IMT Atlantique - INFO)
%+ Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)
%+ Lab-STICC_IMTA_CID_DECIDE
%+ Département Logique des Usages, Sciences sociales et Sciences de l'Information (IMT Atlantique - LUSSI)
%+ Arkéa
%A Fahed, Lina
%A Lenca, Philippe
%A Haralambous, Yannis
%A Lefort, Riwal
%A Tallec, Marie-Laure
%< avec comité de lecture
%Z 19290
%( Actes EGC 2019 : Extraction et gestion des connaissances
%B EGC 2019 : Extraction et gestion des connaissances
%C Metz, France
%P .
%8 2019-01-21
%D 2019
%Z Computer Science [cs]/Machine Learning [cs.LG]
%Z Computer Science [cs]/Artificial Intelligence [cs.AI]
%Z Computer Science [cs]/Human-Computer Interaction [cs.HC]
%Z Computer Science [cs]/Computers and Society [cs.CY]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Statistics [stat]/Machine Learning [stat.ML]Conference papers
%X Events prediction in sequences database is a challenging task that can be approached with data mining. In this paper, we focus on the specific goal of the prediction of distant events by mining sequential rules and propose the algorithm D-SR (Distant Sequential Rules). The originality of our algorithm is that it mines sequential rules with a consequent temporally distant from the antecedent by applying a minimal gap constraint between both elements. Our algorithm can be integrated into traditional algorithms as a post-processing step or during the mining process, with low time and memory complexity. Experiments show that D-SR is more efficient, in terms of running time and scalability, in mining distant rules during the mining process than in a post- processing step. By studying in details the rules mined from a real-world dataset, we demonstrate the efficiency of such rules for real-world applications.
%X La prédiction d'évènements dans une base de séquences est une tâche difficile à laquelle la fouille de données peut largement contribuer. Dans cet article nous nous concentrons sur le cas spécifique de la prédiction d'évènements distants à travers la fouille de règles séquentielles and nous proposons l'algorithme D-SR (règles séquentielles distantes). L'originalité de notre algorithme réside dans le fait qu'il fouille les règles séquentielles avec un conséquent temporellement distant de l'antécédent, en appliquant une contrainte de gap minimal entre les deux éléments. Notre algorithme peut être intégré dans les algorithmes traditionnels en tant qu'étape de post-traitement ou pendant le processus de fouille, avec une faible complexité de temps et de mémoire. Nos expériences montrent que D-SR est plus efficace, en termes de temps de calcul et de scalabilité, quand on fouille des règles distantes pendant le processus de fouille que plutôt en tant qu'étape de post-traitement. En étudiant en détail les règles obtenues par la fouille d'un ensemble de données, nous montrons leur efficacité pour des applications du monde réel.
%G French
%L hal-01962067
%U https://hal.archives-ouvertes.fr/hal-01962067
%~ TELECOM-BRETAGNE
%~ INSTITUT-TELECOM
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ TDS-MACS
%~ LAB-STICC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_DECIDE
%~ IMTA_INFO
%~ IMTA_LUSSI
%~ LAB-STICC_IMTA
Article dans une revue
Meddeb Maroua, Dhraief Amine, Belghith Abdelfettah, Monteil Thierry, Drira Khalil, Mathkour Hassan
Least fresh first cache replacement policy for NDN-based IoT networks
Pervasive and Mobile Computing, Elsevier, 2019, 52, pp.60-70. 〈10.1016/j.pmcj.2018.12.002〉
Details
Quote
Bibtext :
@article{meddeb:hal-01962554,
TITLE = {{Least fresh first cache replacement policy for NDN-based IoT networks}},
AUTHOR = {Meddeb, Maroua and Dhraief, Amine and Belghith, Abdelfettah and Monteil, Thierry and Drira, Khalil and Mathkour, Hassan},
URL = {https://hal.laas.fr/hal-01962554},
JOURNAL = {{Pervasive and Mobile Computing}},
HAL_LOCAL_REFERENCE = {Rapport LAAS n{\textdegree} 19024},
PUBLISHER = {{Elsevier}},
VOLUME = {52},
PAGES = {60-70},
YEAR = {2019},
MONTH = Jan,
DOI = {10.1016/j.pmcj.2018.12.002},
HAL_ID = {hal-01962554},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Least fresh first cache replacement policy for NDN-based IoT networks
%+ Équipe Services et Architectures pour Réseaux Avancés (LAAS-SARA)
%+ Département informatique (INFO)
%+ Centre de Recherche Réseau Image SysTème Architecture et MuLtimédia (CRISTAL)
%+ College of Computer and Information Sciences [Riyadh]
%A Meddeb, Maroua
%A Dhraief, Amine
%A Belghith, Abdelfettah
%A Monteil, Thierry
%A Drira, Khalil
%A Mathkour, Hassan
%< avec comité de lecture
%Z Rapport LAAS n° 19024
%@ 1574-1192
%J Pervasive and Mobile Computing
%I Elsevier
%V 52
%P 60-70
%8 2019-01
%D 2019
%R 10.1016/j.pmcj.2018.12.002
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Computer Science [cs]/Emerging Technologies [cs.ET]
%Z Computer Science [cs]/Software Engineering [cs.SE]
%Z Computer Science [cs]/WebJournal articles
%X In-network caching in Named Data Networking (NDN) based Internet of Things (IoT) plays a central role for efficient data dissemination. Data cached throughout the network may quickly become obsolete as they are transient and frequently updated by their producers. As such, NDN-based IoT networks impose stringent requirement in terms of data freshness. While various cache replacement policies were proposed, none has considered the cache freshness requirement. In this paper, we introduce a novel cache replacement policy called Least Fresh First (LFF) integrating the cache freshness requirement. LFF evicts invalid cached contents based on time series forecasting of sensors future events. Extensive simulations are performed to evaluate the performance of LFF and to compare it to the different well-known cache replacement policies in ICN-based IoT networks. The obtained results show that LFF significantly improves data freshness compared to other policies, while enhancing the server hit reduction ratio, the hop reduction ratio and the response latency.
%G English
%L hal-01962554
%U https://hal.laas.fr/hal-01962554
%~ LAAS
%~ CNRS
%~ UNIV-TLSE3
%~ INSTITUT-TELECOM
%~ LAAS-RESEAUX-ET-COMMUNICATIONS
%~ IMT-ATLANTIQUE
%~ INSA-TOULOUSE
%~ LAAS-SARA
%~ IMTA_INFO
%~ INSA-GROUPE
Chapitre d'ouvrage
Haralambous Yannis
Approches et applications de la graphématique
Méthodes et interdisciplinarité : analyse de quelques pratiques, ISTE Éditions, 2019, Méthodologies pour les sciences sociales
Details
Quote
Bibtext :
@incollection{haralambous:hal-02009941,
TITLE = {{Approches et applications de la graph{\'e}matique}},
AUTHOR = {Haralambous, Yannis},
URL = {https://hal.archives-ouvertes.fr/hal-02009941},
BOOKTITLE = {{M{\'e}thodes et interdisciplinarit{\'e} : analyse de quelques pratiques}},
HAL_LOCAL_REFERENCE = {19476},
PUBLISHER = {{ISTE {\'E}ditions}},
SERIES = {M{\'e}thodologies pour les sciences sociales},
PAGES = {.},
YEAR = {2019},
KEYWORDS = {Graph{\'e}matique ; Traitement automatique de langue ; Biom{\'e}trie ; St{\'e}ganographie},
HAL_ID = {hal-02009941},
HAL_VERSION = {v1},
}
Endnote :
%0 Book Section
%T Approches et applications de la graphématique
%+ Lab-STICC_IMTA_CID_DECIDE
%+ Département Informatique (IMT Atlantique - INFO)
%A Haralambous, Yannis
%Z 19476
%B Méthodes et interdisciplinarité : analyse de quelques pratiques
%I ISTE Éditions
%S Méthodologies pour les sciences sociales
%P .
%8 2019
%D 2019
%K Graphématique
%K Traitement automatique de langue
%K Biométrie
%K Stéganographie
%Z Computer Science [cs]/Human-Computer Interaction [cs.HC]
%Z Computer Science [cs]/Document and Text Processing
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Book sections
%X Dans ce chapitre nous traitons d'une discipline peu connue, pour avoir été délaissée par les linguistes saussuriens, au profit de la phonologie : la graphématique. Après une courte introduction à cette discipline et à ses tribulations, nous proposons trois approches à la graphématique originaires de trois disciplines différentes : les mathématiques avec une décomposition spectrale des graphèmes qui permet, sans aucune information autre que leurs combinaisons, de retrouver les "consonnes" et les "voyelles", la biométrie qui à partir de mesures précises des écarts temporels entre les touches de clavier saisies lors de l'écriture d'un mot allemand de retrouver sa structure morphologique et enfin, la stéganographie où on peut se servir de la variabilité de la transcription du grec en alphabet latin pour y cacher de l'information.
%G French
%L hal-02009941
%U https://hal.archives-ouvertes.fr/hal-02009941
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_DECIDE
%~ IMTA_INFO
%~ LAB-STICC_IMTA
Article dans une revue
Haralambous Yannis
Ne vous moquez pas de l'oiseau moqueur : un aperçu de la logique combinatoire
Quadrature, EDP Sciences, 2019
Details
Quote
Bibtext :
@article{haralambous:hal-02009937,
TITLE = {{Ne vous moquez pas de l'oiseau moqueur : un aper{\c c}u de la logique combinatoire}},
AUTHOR = {Haralambous, Yannis},
URL = {https://hal.archives-ouvertes.fr/hal-02009937},
JOURNAL = {{Quadrature}},
HAL_LOCAL_REFERENCE = {19475},
PUBLISHER = {{EDP Sciences}},
PAGES = {.},
YEAR = {2019},
KEYWORDS = {Logique combinatoire ; Fonctions primitives r{\'e}cursives ; Grammaires cat{\'e}gorielles combinatoires ; Traitement automatique de la langue ; Vulgarisation},
HAL_ID = {hal-02009937},
HAL_VERSION = {v1},
}
Endnote :
%0 Journal Article
%T Ne vous moquez pas de l'oiseau moqueur : un aperçu de la logique combinatoire
%+ Lab-STICC_IMTA_CID_DECIDE
%+ Département Informatique (IMT Atlantique - INFO)
%A Haralambous, Yannis
%< avec comité de lecture
%Z 19475
%@ 1142-2785
%J Quadrature
%I EDP Sciences
%P .
%8 2019
%D 2019
%K Logique combinatoire
%K Fonctions primitives récursives
%K Grammaires catégorielles combinatoires
%K Traitement automatique de la langue
%K Vulgarisation
%Z Computer Science [cs]/Human-Computer Interaction [cs.HC]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Computer Science [cs]/Logic in Computer Science [cs.LO]Journal articles
%X Nous proposons une découverte d'un domaine de la logique qui aura prochainement 100 ans : la logique combinatoire, dans le cadre des fonctions primitives récursives. Notre point de départ est le conte mathématique "Ne vous moquez pas de l'oiseau moqueur" de Raymond Smullyan. Après une brève description de la manière dont les objets de la logique combinatoire représentent les fonctions primitives récursives, nous donnons deux applications de celle-ci : l'algèbre de Boole et l'analyse syntaxique du langage naturel.
%G French
%L hal-02009937
%U https://hal.archives-ouvertes.fr/hal-02009937
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_DECIDE
%~ IMTA_INFO
%~ LAB-STICC_IMTA
Communication dans un congrès
Corbel Romuald, Braud Arnaud, Marjou Xavier, Simon Gwendal, Gravey Annie
Fairness Measurement Procedure for the Evaluation of Congestion Control Algorithms
2018 11th International Conference on Computer Science and Information Technology (ICCSIT 2018), Dec 2018, Paris, France
Bibtext :
@inproceedings{corbel:hal-01972139,
TITLE = {{Fairness Measurement Procedure for the Evaluation of Congestion Control Algorithms}},
AUTHOR = {Corbel, Romuald and BRAUD, Arnaud and Marjou, Xavier and Simon, Gwendal and GRAVEY, Annie},
URL = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-01972139},
BOOKTITLE = {{2018 11th International Conference on Computer Science and Information Technology (ICCSIT 2018)}},
ADDRESS = {Paris, France},
YEAR = {2018},
MONTH = Dec,
KEYWORDS = {QUIC ; congestion control ; fairness},
PDF = {https://hal-imt-atlantique.archives-ouvertes.fr/hal-01972139/file/2018_ICCSIT_paper-v3.pdf},
HAL_ID = {hal-01972139},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T Fairness Measurement Procedure for the Evaluation of Congestion Control Algorithms
%+ Orange Labs [Lannion]
%+ Advanced technologies for operated networks (ADOPNET)
%+ Département Informatique (IMT Atlantique - INFO)
%A Corbel, Romuald
%A BRAUD, Arnaud
%A Marjou, Xavier
%A Simon, Gwendal
%A GRAVEY, Annie
%< avec comité de lecture
%B 2018 11th International Conference on Computer Science and Information Technology (ICCSIT 2018)
%C Paris, France
%8 2018-12-21
%D 2018
%K QUIC
%K congestion control
%K fairness
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Computer Science [cs]/Modeling and Simulation
%Z Mathematics [math]/Probability [math.PR]
%Z Engineering Sciences [physics]/Optics / PhotonicConference papers
%X Congestion is one of the most critical issues im-pacting the performance of Internet networks, hence the need of Congestion Control Algorithms (CCAs) to either prevent or remove it. Nevertheless, CCAs may affect the network fairness given that the transport behavior can drastically change in function of the CCA (e.g., Performance-oriented Congestion Control (PCC), Bottleneck Bandwidth and Round-trip propagation time (BBR), Reno) used in the endpoints. New transport protocols such as Quick UDP Internet Connections (QUIC) allow to easily customize their CCA, which increases the types of CCAs on the Internet. Evaluating the fairness among competing CCAs is thus essential. In this work, we focus on determining an impartial Fairness Measurement Procedure (FMP) capable of assessing equity when several CCAs compete in a bottleneck during a given period of time. In order to validate the proposed mechanism, we perform an exhaustive evaluation of various competing CCAs within multiple network configurations while varying latency, packet loss, queuing policy and buffer size. Results show that the grade of fairness achieved by two different CCAs depends on the network configuration. This claim confirms the relevance of the proposed fairness measurement procedure.
%G English
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-01972139/document
%2 https://hal-imt-atlantique.archives-ouvertes.fr/hal-01972139/file/2018_ICCSIT_paper-v3.pdf
%L hal-01972139
%U https://hal-imt-atlantique.archives-ouvertes.fr/hal-01972139
%~ IMT-ATLANTIQUE
%~ CNRS
%~ UNIV-UBS
%~ INSMI
%~ IRISA_SET
%~ TDS-MACS
%~ UNIV-RENNES1
%~ CENTRALESUPELEC
%~ TEST-IRISA-TB
%~ IRISA
%~ INRIA
%~ TEST-UR-CSS
%~ IRISA_IMTA
%~ UNIV-RENNES
%~ IRISA-ADOPNET-IMTA
%~ IMTA_INFO
%~ UR1-MATH-STIC
%~ UR1-HAL
%~ UR1-UFR-ISTIC
%~ INRIA-AUT
Communication dans un congrès
Chouayakh Ayman, Bechler Aurelien, Amigo Isabel, Nuaymi Loutfi, Maillé Patrick
Auction mechanisms for Licensed Shared Access: reserve prices and revenue-fairness tradeoffs
IFIP WG PERFORMANCE 2018 - 36th International Symposium on Computer Performance, Modeling, Measurements and Evaluation 2018, Dec 2018, Toulouse, France. 2018, 〈https://performance2018.sciencesconf.org/〉
Bibtext :
@inproceedings{chouayakh:hal-01883697,
TITLE = {{Auction mechanisms for Licensed Shared Access: reserve prices and revenue-fairness tradeoffs}},
AUTHOR = {Chouayakh, Ayman and Bechler, Aurelien and Amigo, Isabel and Nuaymi, Loutfi and Maill{\'e}, Patrick},
URL = {https://hal.archives-ouvertes.fr/hal-01883697},
BOOKTITLE = {{IFIP WG PERFORMANCE 2018 - 36th International Symposium on Computer Performance, Modeling, Measurements and Evaluation 2018}},
ADDRESS = {Toulouse, France},
HAL_LOCAL_REFERENCE = {19173},
HAL_LOCAL_REFERENCE = {ACTI+},
YEAR = {2018},
MONTH = Dec,
PDF = {https://hal.archives-ouvertes.fr/hal-01883697/file/auction-mechanisms-licensed%2821%29.pdf},
HAL_ID = {hal-01883697},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Auction mechanisms for Licensed Shared Access: reserve prices and revenue-fairness tradeoffs
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (IMT Atlantique - SRCD)
%+ Orange Labs [Issy les Moulineaux]
%+ Département Informatique (IMT Atlantique - INFO)
%+ Advanced technologies for operated networks (ADOPNET)
%+ Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS)
%+ Objets communicants pour l'Internet du futur (OCIF)
%A Chouayakh, Ayman
%A Bechler, Aurelien
%A Amigo, Isabel
%A Nuaymi, Loutfi
%A Maillé, Patrick
%< avec comité de lecture
%Z 19173
%Z ACTI+
%B IFIP WG PERFORMANCE 2018 - 36th International Symposium on Computer Performance, Modeling, Measurements and Evaluation 2018
%C Toulouse, France
%8 2018-12-05
%D 2018
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Computer Science [cs]/Computer Science and Game Theory [cs.GT]
%Z Computer Science [cs]/Human-Computer Interaction [cs.HC]Conference papers
%X Licensed shared access (LSA) is a new approach that allows Mobile Network Operators to use a portion of the spectrum initially licensed to another incumbent user, by obtaining a license from the regulator via an auction mechanism. In this context, diierent truthful auction mechanisms have been proposed, and diier in terms of allocation (who gets the spectrum) but also on revenue. Since those mechanisms could generate an extremely low revenue, we extend them by introducing a reserve price per bidder which represents the minimum amount that each winning bidder should pay. Since this may be at the expense of the allocation fairness, for each mechanism we nd by simulation the reserve price that optimizes a trade-oo between expected fairness and expected revenue. Also, for each mechanism, we analytically express the expected revenue when valuations of operators for the spectrum are independent and identically distributed from a uniform distribution.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01883697/document
%2 https://hal.archives-ouvertes.fr/hal-01883697/file/auction-mechanisms-licensed%2821%29.pdf
%L hal-01883697
%U https://hal.archives-ouvertes.fr/hal-01883697
%~ CNRS
%~ UNIV-UBS
%~ IRISA_SET
%~ UNIV-RENNES1
%~ IMTA_SRCD
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ IMT-ATLANTIQUE
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ UR1-MATH-STIC
%~ UR1-HAL
%~ UR1-UFR-ISTIC
%~ IRISA_IMTA
%~ IMTA_INFO
%~ INRIA-RENNES
%~ INRIA_TEST
%~ TEST-IRISA-TB
%~ INRIA-RENGRE
%~ IRISA-ADOPNET-IMTA
%~ IRISA-DIONYSOS-IMTA
%~ IRISA-OCIF-IMTA
%~ PRACOM
See all publications of the department
Contacts
Head of department : Serge GARLATTI
Tél : +33 2 29 00 14 53
Assistant : Armelle LANNUZEL
Tél : +33 2 29 00 14 06
> See all department's members
Useful informations:
Access to the IT department: it is located in the D3 building.