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
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 (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 (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
%~ INSTITUT-TELECOM
%~ TELECOM-BRETAGNE
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ ENIB
%~ TDS-MACS
%~ LAB-STICC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_DECIDE
%~ IMTA_INFO
%~ IMTA_LUSSI
%~ 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 (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},
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 (SRCD)
%+ Orange Labs [Issy les Moulineaux]
%+ Département Informatique (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
%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-DIONYSOS-IMTA
%~ IRISA-ADOPNET-IMTA
%~ IRISA-OCIF-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, 2018
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}},
PUBLISHER = {{Elsevier}},
YEAR = {2018},
MONTH = Dec,
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
%@ 1574-1192
%J Pervasive and Mobile Computing
%I Elsevier
%8 2018-12
%D 2018
%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
%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
Communication dans un congrès
Chouayakh Ayman, Bechler Aurelien, Amigo Isabel, Nuaymi Loutfi, Maillé Patrick
A truthful auction mechanism for dynamic allocation of LSA spectrum blocks for 5G
NetGCoop 2018 - 9th International Conference on NETwork Games, COntrol and OPtimisation, Nov 2018, New York, United States. Proceedings NetGCoop'18, 2018
Details
Quote
Bibtext :
@inproceedings{chouayakh:hal-01923463,
TITLE = {{A truthful auction mechanism for dynamic allocation of LSA spectrum blocks for 5G}},
AUTHOR = {Chouayakh, Ayman and Bechler, Aurelien and Amigo, Isabel and Nuaymi, Loutfi and Maill{\'e}, Patrick},
URL = {https://hal.archives-ouvertes.fr/hal-01923463},
BOOKTITLE = {{NetGCoop 2018 - 9th International Conference on NETwork Games, COntrol and OPtimisation}},
ADDRESS = {New York, United States},
HAL_LOCAL_REFERENCE = {19218},
YEAR = {2018},
MONTH = Nov,
HAL_ID = {hal-01923463},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T A truthful auction mechanism for dynamic allocation of LSA spectrum blocks for 5G
%+ Orange Labs [Issy les Moulineaux]
%+ Département Systèmes Réseaux, Cybersécurité et Droit du numérique (SRCD)
%+ Advanced technologies for operated networks (ADOPNET)
%+ Département Informatique (INFO)
%+ Objets communicants pour l'Internet du futur (OCIF)
%+ Dependability Interoperability and perfOrmance aNalYsiS Of networkS (DIONYSOS)
%A Chouayakh, Ayman
%A Bechler, Aurelien
%A Amigo, Isabel
%A Nuaymi, Loutfi
%A Maillé, Patrick
%< avec comité de lecture
%Z 19218
%( Proceedings NetGCoop'18
%B NetGCoop 2018 - 9th International Conference on NETwork Games, COntrol and OPtimisation
%C New York, United States
%8 2018-11-14
%D 2018
%Z Computer Science [cs]/Computer Science and Game Theory [cs.GT]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Computer Science [cs]/Human-Computer Interaction [cs.HC]Conference papers
%X Licensed shared access is a new frequency sharing concept that allows Mobile Network Operators (MNOs) to use some of the spectrum initially allocated to other incumbents, after obtaining a temporary license from the regulator. The allocation is made among groups such that two base stations in the same group can use the same spectrum simultaneously. In this context, different auction schemes were proposed, however they consider the scenario in which the regulator has one and only one block of LSA frequency to allocate. In this paper, we remove this hypothesis: we suppose that the regulator has K identical blocks of spectrum to allocate, and we propose a truthful auction mechanism based on the Vickrey-Clarke- Groves mechanism (VCG).We evaluate the efficiency of our mechanism in terms of social welfare, which depends on the allocation rule of the mechanism. Simulations show that the efficiency of the proposed mechanism is at least 60 % of that of VCG, which is known to be optimal.
%G English
%L hal-01923463
%U https://hal.archives-ouvertes.fr/hal-01923463
%~ CNRS
%~ UNIV-UBS
%~ IRISA_SET
%~ UNIV-RENNES1
%~ CENTRALESUPELEC
%~ IRISA
%~ INRIA
%~ IMT-ATLANTIQUE
%~ IMTA_SRCD
%~ TEST-UR-CSS
%~ IRISA-OCIF-IMTA
%~ UNIV-RENNES
%~ IRISA-ADOPNET-IMTA
%~ IMTA_INFO
%~ UR1-MATH-STIC
%~ UR1-HAL
%~ UR1-UFR-ISTIC
%~ IRISA_IMTA
%~ INRIA-RENNES
%~ INRIA_TEST
%~ INRIA-RENGRE
%~ IRISA-DIONYSOS-IMTA
Communication dans un congrès
Gilliot Jean-Marie, Iksal Sébastien, Medou Daniel, Dabbebi Inès
Conception participative de tableaux de bord d'apprentissage
IHM'18 : 30e Conférence Francophone sur l'Interaction Homme-Machine, Oct 2018, Brest, France. Actes téléchargeables depuis le site web IHM-2018, p119, 〈http://ihm18.afihm.org〉
Bibtext :
@inproceedings{gilliot:hal-01897914,
TITLE = {{Participatory Design of Learning Analytics Dashboards}},
AUTHOR = {Gilliot, Jean-Marie and Iksal, S{\'e}bastien and Medou, Daniel Magloire and Dabbebi, In{\`e}s},
URL = {https://hal.archives-ouvertes.fr/hal-01897914},
BOOKTITLE = {{IHM'18 : 30e Conf{\'e}rence Francophone sur l'Interaction Homme-Machine}},
ADDRESS = {Brest, France},
PAGES = {p119},
YEAR = {2018},
MONTH = Oct,
KEYWORDS = {Canvas ; Participatory design ; Learning Analytics ; Dashboard ; Tableau de bord ; Apprentissage ; Cartes ; Conception participative},
PDF = {https://hal.archives-ouvertes.fr/hal-01897914/file/Conception_participative_de_tableaux_de_bord_d_apprentissage%20IHM2018.pdf},
HAL_ID = {hal-01897914},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Participatory Design of Learning Analytics Dashboards
%+ Lab-STICC_IMTA_CID_IHSEV
%+ Département Informatique (INFO)
%+ Laboratoire d'Informatique de l'Université du Mans (LIUM)
%+ Le Mans Université (UM)
%+ Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)
%A Gilliot, Jean-Marie
%A Iksal, Sébastien
%A Medou, Daniel, Magloire
%A Dabbebi, Inès
%< avec comité de lecture
%( Actes téléchargeables depuis le site web IHM-2018
%B IHM'18 : 30e Conférence Francophone sur l'Interaction Homme-Machine
%C Brest, France
%P p119
%8 2018-10-23
%D 2018
%K Canvas
%K Participatory design
%K Learning Analytics
%K Dashboard
%K Tableau de bord
%K Apprentissage
%K Cartes
%K Conception participative
%Z Computer Science [cs]/Technology for Human Learning
%Z Computer Science [cs]/Human-Computer Interaction [cs.HC]Conference papers
%X While the field of Learning Analytics is in full development, potential users are just discovering the opportunities offered by these tools. One of the major difficulties consists in proposing a visual data representation which makes sense to the users. After refining our method to identify user needs in terms of visualization, and to define the main dimensions of a learning dashboard, we propose a tool to support participatory design. This tool is based on a canvas and cards to help dashboards’ creation using Learning Analytics. It allows users to support creativity around decision making, characterize their context, and draw a dashboard’s mockup using existing content.
%X Si le domaine d’analyse des données d’apprentissage est en plein développement, les utilisateurs potentiels des résultats obtenus découvrent les opportunités offertes par ces outils. L’une des difficultés majeures consiste à proposer une représentation graphique des données qui fasse sens aux utilisateurs. Après avoir présenté notre démarche permettant d’identifier les besoins des utilisateurs en terme de visualisation et de définir les dimensions principales d’un tableau de bord d’apprentissage, nous proposons un outil support à la conception participative. Cet outil est basé sur un tableau et des cartes pour aider à la création de tableaux de bord exploitant les Learning Analytics. Il permet aux utilisateurs d’organiser leur réflexion autour de la prise de décision, de caractériser leur contexte, et de maquetter le tableau de bord à l’aide de contenus existants.
%G French
%2 https://hal.archives-ouvertes.fr/hal-01897914/document
%2 https://hal.archives-ouvertes.fr/hal-01897914/file/Conception_participative_de_tableaux_de_bord_d_apprentissage%20IHM2018.pdf
%L hal-01897914
%U https://hal.archives-ouvertes.fr/hal-01897914
%~ TICE
%~ CNRS
%~ UNIV-LEMANS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ LIUM
%~ LAB-STICC_IMTA_CID_IHSEV
%~ EIAH
%~ IMT-ATLANTIQUE
%~ IMTA_INFO
%~ LAB-STICC_IMTA
%~ PUBLI-EIAH
%~ IHM-2018
Communication dans un congrès
Laubé Sylvain, Querrec Ronan, Richard Nicolas, Contreras Neira Rodolfo, Godoy Orellana Milton, Abiven Marie-Morgane, Ballester Benjamin, Carmona Yost Javier, Córdoba Lorena, Fernández Gaete Manuel, Galaz-Mandakovic Damir, Gallardo Porras Viviana, Quiroz Daniel, Vezub Julio, Rohou Bruno
Paysages portuaires et réalité virtuelle : Taltal, un laboratoire dans le désert d'Atacama
workshop, Oct 2018, Brest, France. CERV Centre Européen de Réalité Virtuelle, ENIB, Technopôle Plouzané
Details
Quote
Bibtext :
@inproceedings{laube:halshs-01922189,
TITLE = {{Paysages portuaires et r{\'e}alit{\'e} virtuelle : Taltal, un laboratoire dans le d{\'e}sert d'Atacama}},
AUTHOR = {Laub{\'e}, Sylvain and Querrec, Ronan and Richard, Nicolas and Contreras Neira, Rodolfo and Godoy Orellana, Milton and Abiven, Marie-Morgane and Ballester, Benjamin and Carmona Yost, Javier and C{\'o}rdoba, Lorena and Fern{\'a}ndez Gaete, Manuel and Galaz-Mandakovic, Damir and Gallardo Porras, Viviana and Quiroz, Daniel and Vezub, Julio and ROHOU, BRUNO},
URL = {https://halshs.archives-ouvertes.fr/halshs-01922189},
BOOKTITLE = {{workshop}},
ADDRESS = {Brest, France},
PUBLISHER = {{CERV Centre Europ{\'e}en de R{\'e}alit{\'e} Virtuelle, ENIB, Technop{\^o}le Plouzan{\'e}}},
YEAR = {2018},
MONTH = Oct,
KEYWORDS = {R{\'e}alit{\'e} Virtuelle ; Ports ; Paysages industriels ; D{\'e}sert d'Atacama ; Salp{\^e}tre ; Histoire technique ; Les syst{\`e}mes miniers dans le D{\'e}sert d'Atacama ; Taltal},
HAL_ID = {halshs-01922189},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T Paysages portuaires et réalité virtuelle : Taltal, un laboratoire dans le désert d'Atacama
%+ Centre François Viète : épistémologie, histoire des sciences et des techniques
%+ Lab-STICC_UBO_CID_IHSEV
%+ CREDA - Centre de Recherche Et de Documentation sur les Amériques - UMR 7227 (CREDA)
%+ Museo Augusto Capdeville, Municipalidad de Taltal
%+ Universidad Academia de Humanismo Cristiano (UAHC)
%+ Universidad de Tarapaca
%+ Centre François Viète - Brest (CFV UBO)
%+ Université Panthéon-Sorbonne (UP1)
%+ Université de Rennes (UNIV-RENNES)
%+ Universidad Católica del Norte, San Pedro de Atacama
%+ Consejo Nacional de Investigaciones Científicas y Técnicas [Buenos Aires] (CONICET)
%+ Université de Rennes 2 (UR2)
%+ Dirección nacional del patrimonio (Chile), Subdirección de investigación
%+ Universidad de Chile
%+ Centro Nacional Patagónico (CENPAT-CONICET)
%A Laubé, Sylvain
%A Querrec, Ronan
%A Richard, Nicolas
%A Contreras Neira, Rodolfo
%A Godoy Orellana, Milton
%A Abiven, Marie-Morgane
%A Ballester, Benjamin
%A Carmona Yost, Javier
%A Córdoba, Lorena
%A Fernández Gaete, Manuel
%A Galaz-Mandakovic, Damir
%A Gallardo Porras, Viviana
%A Quiroz, Daniel
%A Vezub, Julio
%A ROHOU, BRUNO
%< avec comité de lecture
%B workshop
%C Brest, France
%I CERV Centre Européen de Réalité Virtuelle, ENIB, Technopôle Plouzané
%8 2018-10-12
%D 2018
%K Réalité Virtuelle
%K Ports
%K Paysages industriels
%K Désert d'Atacama
%K Salpêtre
%K Histoire technique
%K Les systèmes miniers dans le Désert d'Atacama
%K Taltal
%Z Humanities and Social Sciences/Social Anthropology and ethnology
%Z Humanities and Social Sciences/HistoryConference papers
%G French
%L halshs-01922189
%U https://halshs.archives-ouvertes.fr/halshs-01922189
%~ SHS
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ AO-ETHNO
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC_ENIB
%~ ETHNO
%~ AO-HISTOIRE
%~ HISTOIRE
%~ LAB-STICC
%~ UNIV-PARIS1
%~ CFV
%~ HIPHISCITECH
%~ UNIV-RENNES2
%~ UR2-HB
%~ LAB-STICC_UBO
%~ CREDA
%~ UNIV-NANTES
%~ UNIV-PARIS3
%~ AMERIQUES
%~ USPC
%~ UNIV-RENNES
%~ IMT-ATLANTIQUE
%~ IMTA_INFO
%~ LAB-STICC_IMTA
%~ CFV-BREST
%~ IBSHS
%~ IBNM
%~ ATACAMA-SHS
Communication dans un congrès
Sagar Samya, Lefrançois Maxime, Rebaï Issam, Khemaja Maha, Garlatti Serge, Feki Jamel, Médini Lionel
Modeling Smart Sensors on top of SOSA/SSN and WoT TD with the Semantic Smart Sensor Network (S3N) modular Ontology
9th International Semantic Sensor Networks Workshop, Oct 2018, Monterey, United States
Bibtext :
@inproceedings{sagar:hal-01885330,
TITLE = {{Modeling Smart Sensors on top of SOSA/SSN and WoT TD with the Semantic Smart Sensor Network (S3N) modular Ontology}},
AUTHOR = {Sagar, Samya and Lefran{\c c}ois, Maxime and Reba{\"i}, Issam and Khemaja, Maha and Garlatti, Serge and Feki, Jamel and M{\'e}dini, Lionel},
URL = {https://hal.archives-ouvertes.fr/hal-01885330},
BOOKTITLE = {{9th International Semantic Sensor Networks Workshop}},
ADDRESS = {Monterey, United States},
YEAR = {2018},
MONTH = Oct,
KEYWORDS = {Ontology modeling ; SSN Ontology ; Smart-Sensor ; context adaptation},
PDF = {https://hal.archives-ouvertes.fr/hal-01885330/file/best-paper-1-preprint.pdf},
HAL_ID = {hal-01885330},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T Modeling Smart Sensors on top of SOSA/SSN and WoT TD with the Semantic Smart Sensor Network (S3N) modular Ontology
%+ Lab-STICC_IMTA_CID_IHSEV
%+ Université de Sfax
%+ Multimedia, InfoRmation systems and Advanced Computing Laboratory (MIRACL)
%+ Département Informatique (INFO)
%+ École des Mines de Saint-Étienne (Mines Saint-Étienne MSE)
%+ Laboratoire Hubert Curien [Saint Etienne] (LHC)
%+ Lab-STICC_IMTA_CID_DECIDE
%+ Université de Sousse
%+ Traces, Web, Education, Adaptation, Knowledge (TWEAK)
%A Sagar, Samya
%A Lefrançois, Maxime
%A Rebaï, Issam
%A Khemaja, Maha
%A Garlatti, Serge
%A Feki, Jamel
%A Médini, Lionel
%< avec comité de lecture
%B 9th International Semantic Sensor Networks Workshop
%C Monterey, United States
%8 2018-10-09
%D 2018
%K Ontology modeling
%K SSN Ontology
%K Smart-Sensor
%K context adaptation
%Z Computer Science [cs]/WebConference papers
%X The joint OGC and W3C standard SOSA/SSN ontology describes sensors, observations, sampling, and actuation. The W3C Thing Description ontology under development in the W3C WoT working group describes things and their interaction patterns. In this paper we are interested in combining these two ontologies for modeling Smart-Sensors. Along with basic sensors, a Smart-Sensor contains a micro-controller that can run different algorithms adapted to the context and a communicating system that exposes the Smart-Sensor on some network. For example, a smart accelerometer can be used to measure cycling cadence, step numbers or a variety of other things. The SOSA/SSN ontology is only able to model partially the adaptation capabilities of Smart-Sensors to different contexts. Thus, we design an SOSA/SSN extension, called the Semantic Smart Sensor Network (S3N) ontology. S3N answers several competency questions such as how to adapt the Smart-Sensor to the current context of use, that is to say selecting the algorithms to provide the right sensors outputs and the micro-controller capabilities.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01885330/document
%2 https://hal.archives-ouvertes.fr/hal-01885330/file/best-paper-1-preprint.pdf
%L hal-01885330
%U https://hal.archives-ouvertes.fr/hal-01885330
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ EC-LYON
%~ IOGS
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ LAB-STICC_IMTA_CID_IHSEV
%~ PARISTECH
%~ IOGS-SACLAY
%~ UNIV-ST-ETIENNE
%~ UNIV-LYON1
%~ INSA-LYON
%~ LIRIS
%~ LYON2
%~ UNIV-LYON2
%~ UNIV-PARIS-SACLAY
%~ INSA-GROUPE
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_DECIDE
%~ IMTA_INFO
%~ LAB-STICC_IMTA
%~ EMSE
%~ FAYOL-ENSMSE
%~ ISCOD-ENSMSE
Communication dans un congrès
Duminy Nicolas, Manoury Alexandre, Nguyen Sao Mai, Buche Cédric, Duhaut Dominique
Learning Sequences of Policies by using an Intrinsically Motivated Learner and a Task Hierarchy
Workshop on Continual Unsupervised Sensorimotor Learning, ICDL-EpiRob 2018, Sep 2018, Tokyo, Japan
Bibtext :
@inproceedings{duminy:hal-01887073,
TITLE = {{Learning Sequences of Policies by using an Intrinsically Motivated Learner and a Task Hierarchy}},
AUTHOR = {Duminy, Nicolas and Manoury, Alexandre and Nguyen, Sao Mai and Buche, C{\'e}dric and Duhaut, Dominique},
URL = {https://hal.archives-ouvertes.fr/hal-01887073},
BOOKTITLE = {{Workshop on Continual Unsupervised Sensorimotor Learning, ICDL-EpiRob 2018}},
ADDRESS = {Tokyo, Japan},
YEAR = {2018},
MONTH = Sep,
PDF = {https://hal.archives-ouvertes.fr/hal-01887073/file/icdl-epirob-2018_CameraReady.pdf},
HAL_ID = {hal-01887073},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Paper
%F Oral
%T Learning Sequences of Policies by using an Intrinsically Motivated Learner and a Task Hierarchy
%+ Lab-STICC_UBS_CID_IHSEV
%+ Université de Bretagne Sud (UBS)
%+ Lab-STICC_IMTA_CID_IHSEV
%+ Département Informatique (INFO)
%+ Lab-STICC_ENIB_CID_IHSEV
%+ Lab-STICC_UBS_CID_IHSEV
%A Duminy, Nicolas
%A Manoury, Alexandre
%A Nguyen, Sao Mai
%A Buche, Cédric
%A Duhaut, Dominique
%< avec comité de lecture
%B Workshop on Continual Unsupervised Sensorimotor Learning, ICDL-EpiRob 2018
%C Tokyo, Japan
%8 2018-09-18
%D 2018
%Z Computer Science [cs]/Machine Learning [cs.LG]
%Z Computer Science [cs]/Robotics [cs.RO]
%Z Computer Science [cs]/Artificial Intelligence [cs.AI]Conference papers
%X Our goal is to propose an algorithm for robots to learn sequences of actions, also called policies, in order to achieve complex tasks. We consider in this paper multiple and hierarchical tasks of various difficulties. To tackle this highly dimensional learning we propose a new algorithm, named Socially Guided Intrinsic Motivation for Sequence of Actions through Hierarchical Tasks (SGIM-SAHT), based on intrinsic motivation and using different learning strategies. We then present two implementations of this algorithm designed to address this challenge in different ways: through a "procedures" framework for Socially Guided Intrinsic Motivation with Procedure Babbling (SGIM-PB) and owing to planning and a dynamic environment representation learning for Continual Hierarchical Intrinsically Motivated Exploration (CHIME). We compare the two implementations and show, through two experiments, how efficiently they learn sequences of actions and dynamically adapt to their environment. We also discuss the benefits of implementing a full unified version of SGIM-SAHT using all the mentioned features of both implementations.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01887073/document
%2 https://hal.archives-ouvertes.fr/hal-01887073/file/icdl-epirob-2018_CameraReady.pdf
%L hal-01887073
%U https://hal.archives-ouvertes.fr/hal-01887073
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC_ENIB
%~ LAB-STICC_UBS
%~ LAB-STICC
%~ LAB-STICC_IMTA_CID_IHSEV
%~ IMT-ATLANTIQUE
%~ IMTA_INFO
%~ UBS
%~ LAB-STICC_IMTA
Communication dans un congrès
Haralambous Yannis, Quaresma Pedro
Geometric Search in TGTP
12th International Conference on Automated Deduction in Geometry (ADG 2018), Sep 2018, Nanning, China. Proceedings of the 12th International Conference on Automated Deduction in Geometry, pp.19-25, 2018, 〈http://adg2018.cc4cm.org/〉
Bibtext :
@inproceedings{haralambous:hal-01911857,
TITLE = {{Geometric Search in TGTP}},
AUTHOR = {Haralambous, Yannis and QUARESMA, Pedro},
URL = {https://hal.archives-ouvertes.fr/hal-01911857},
BOOKTITLE = {{12th International Conference on Automated Deduction in Geometry (ADG 2018)}},
ADDRESS = {Nanning, China},
HAL_LOCAL_REFERENCE = {19268},
PAGES = {19-25},
YEAR = {2018},
MONTH = Sep,
KEYWORDS = {Preuve automatis{\'e}e de th{\'e}or{\`e}mes ; Graphes conceptuels ; Isomorphisme de sous-graphes typ{\'e}s},
PDF = {https://hal.archives-ouvertes.fr/hal-01911857/file/adg2018.pdf},
HAL_ID = {hal-01911857},
HAL_VERSION = {v1},
}
Endnote :
%0 Conference Proceedings
%T Geometric Search in TGTP
%+ Lab-STICC_IMTA_CID_DECIDE
%+ Département Informatique (INFO)
%+ Universidade de Coimbra [Coimbra]
%A Haralambous, Yannis
%A QUARESMA, Pedro
%< avec comité de lecture
%Z 19268
%( Proceedings of the 12th International Conference on Automated Deduction in Geometry
%B 12th International Conference on Automated Deduction in Geometry (ADG 2018)
%C Nanning, China
%P 19-25
%8 2018-09-11
%D 2018
%K Preuve automatisée de théorèmes
%K Graphes conceptuels
%K Isomorphisme de sous-graphes typés
%Z Computer Science [cs]/Computational Geometry [cs.CG]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]
%Z Computer Science [cs]/Human-Computer Interaction [cs.HC]Conference papers
%X In this age of information the importance of retrieve the knowledge from the many sources of information is paramount. In Geometry, apart from textual approaches, common to other areas of mathematics, there is also the need for a geometric search approach, i.e., semantic searching in a corpus of geometric constructions. The Web-based repository of geometric problems Thousands of Geometric problems for geometric Theorem Provers (TGTP) has, from the start, some text search mechanisms. Since version 2.0 an implementation of the geometric search mechanism is integrated in it. Using a dynamic geometry system it is possible to build a geometric construction and then semantically search in the corpus for geometric constructions that are super-sets of the former, with regard to geometric properties. It should be noted that this is a semantic check, the selected constructions may not look like the query construction, but they will possess similar sets of geometric properties.
%G English
%2 https://hal.archives-ouvertes.fr/hal-01911857/document
%2 https://hal.archives-ouvertes.fr/hal-01911857/file/adg2018.pdf
%L hal-01911857
%U https://hal.archives-ouvertes.fr/hal-01911857
%~ CNRS
%~ UNIV-BREST
%~ UNIV-UBS
%~ INSTITUT-TELECOM
%~ ENIB
%~ LAB-STICC
%~ IMT-ATLANTIQUE
%~ LAB-STICC_IMTA_CID_DECIDE
%~ IMTA_INFO
%~ LAB-STICC_IMTA
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.