Atelier HAL v3¶
En ligne de commande¶
Par défaut, l’API HAL semble retourner du JSON.
Attention en ligne de commande (curl, wget) à mettre des quotes autour de l’URL !
Utilisation de wget¶
$ wget -qO- 'http://api.archives-ouvertes.fr/ref/structure/?fq=valid_s:VALID&rows=10&q=%22centre%20de%20calcul%22'
Utilisation de curl¶
J’ai plutôt l’habitude de curl.
$ curl 'http://api.archives-ouvertes.fr/ref/structure/?fq=valid_s:VALID&rows=10&q=%22centre%20de%20calcul%22'
Enregistrer dans un fichier¶
On peut enregistrer les données récupérées dans un fichier via l’option -o.
$ curl -o structures-cc.json 'http://api.archives-ouvertes.fr/ref/structure/?fq=valid_s:VALID&rows=10&q=%22centre%20de%20calcul%22'
Paramètres HTTP¶
On peut spécifier la méthode HTTP par l’option -X (ici la méthode GET) et des headers via l’option -H (ici on spécifie que l’on souhaite du json).
$ curl -X GET -H "Content-Type:application/json" -o structures-cc.json 'http://api.archives-ouvertes.fr/ref/structure/?fq=valid_s:VALID&rows=10&q=%22centre%20de%20calcul%22'
Pretty print json¶
Si vous avez python installé, vous pouvez demander une visualisation “pretty print” du json récupéré par la commande suivante.
$ cat structures-cc.json | python -mjson.tool
{
"response": {
"docs": [
{
"docid": 16,
"label_s": "Centre de Calcul Formel MEDICIS [CCF]"
},
{
"docid": 496,
"label_s": "Centre de Calcul de l'IN2P3 [CC-IN2P3]"
}
],
"numFound": 2,
"start": 0
}
}
Pretty print XML¶
On peut essayer la récupération de données avec d’autres formats : xml.
$ curl -X GET -o structures-cc.xml 'http://api.archives-ouvertes.fr/ref/structure/?wt=xml&fq=valid_s:VALID&rows=10&q=%22centre%20de%20calcul%22'
Pour obtenir une version “pretty print” du XML récupéré en ligne de commande, on peut (sous Linux et MacOS X) utiliser l’utilitaire xmllint qui vient du package libxml2-utils sous Linux.
$ xmllint --format structures-cc.xml
<?xml version="1.0" encoding="UTF-8"?>
<response>
<result name="response" numFound="2" start="0">
<doc>
<int name="docid">16</int>
<str name="label_s">Centre de Calcul Formel MEDICIS [CCF]</str>
</doc>
<doc>
<int name="docid">496</int>
<str name="label_s">Centre de Calcul de l'IN2P3 [CC-IN2P3]</str>
</doc>
</result>
</response>
Format CSV¶
La récupération de données au format csv n’a pas l’air de retourner tout le contenu (notamment les labels) : à spécifier ?
$ curl -X GET 'http://api.archives-ouvertes.fr/ref/structure/?wt=csv&fq=valid_s:VALID&rows=10&q=%22centre%20de%20calcul%22'
$ curl -X GET -H "Content-Type:text/plain" 'http://api.archives-ouvertes.fr/ref/structure/?wt=csv&fq=valid_s:VALID&rows=10&q=%22centre%20de%20calcul%22'
$ curl -X GET -H "Content-Type:text/csv" 'http://api.archives-ouvertes.fr/ref/structure/?wt=csv&fq=valid_s:VALID&rows=10&q=%22centre%20de%20calcul%22'
docid,halId_s,version_i,docType_s,citationFull_s,citationRef_s
16,,,,,
496,,,,,
En spécifiant les explicitement les champs retournés par défaut en json ou en xml, on obtient les données recherchées.
$ curl -X GET -H "Content-Type:text/csv" 'http://api.archives-ouvertes.fr/ref/structure/?wt=csv&fq=valid_s:VALID&rows=10&q=%22centre%20de%20calcul%22&fl=docid,label_s'
docid,label_s
16,Centre de Calcul Formel MEDICIS [CCF]
496,Centre de Calcul de l'IN2P3 [CC-IN2P3]
Référentiel des structures de recherche¶
http://api.archives-ouvertes.fr/docs/ref/resource/structure
La première requête présentée utilise fq=valid_s:VALID où fq= sert à filtrer les requêtes ... http://api.archives-ouvertes.fr/docs/ref/resource/structure/#fq
On a également un rows=10, on récupère nettement plus de 10 éléments ? http://api.archives-ouvertes.fr/docs/ref/resource/structure/#rows
On fait ici une recherche par défaut q= (le nom du champ sur lequel porter la recherche n’est pas précisé) de la chaine de caractère “centre de calcul” (les %20, %22 sont des encodages des caractères espace et guillemet respectivement, http://en.wikipedia.org/wiki/Percent-encoding#Character_data).
$ curl -o structures-cc.json 'http://api.archives-ouvertes.fr/ref/structure/?fq=valid_s:VALID&rows=10&q=%22centre%20de%20calcul%22'
{
"response": {
"docs": [
{
"docid": 16,
"label_s": "Centre de Calcul Formel MEDICIS [CCF]"
},
{
"docid": 496,
"label_s": "Centre de Calcul de l'IN2P3 [CC-IN2P3]"
}
],
"numFound": 2,
"start": 0
}
}
Référentiel des types de documents¶
http://api.archives-ouvertes.fr/docs/ref/resource/doctype
$ curl -o doctype-hal.json 'http://api.archives-ouvertes.fr/ref/doctype?instance_s=hal'
{
"response": {
"lst": {
"int": [
"0",
"0"
],
"lst": {
"bool": "true",
"str": [
"hal",
"fr",
"json"
]
}
},
"result": {
"doc": [
{
"str": [
"ART",
"Article dans des revues"
]
},
{
"str": [
"COMM",
"Communication dans un congr\u00e8s"
]
},
{
"str": [
"POSTER",
"Poster"
]
},
{
"str": [
"OUV",
"Ouvrage (y compris \u00e9dition critique et traduction)"
]
},
{
"str": [
"COUV",
"Chapitre d'ouvrage"
]
},
{
"str": [
"DOUV",
"Direction d'ouvrage, Proceedings"
]
},
{
"str": [
"PATENT",
"Brevet"
]
},
{
"str": [
"OTHER",
"Autre publication"
]
},
{
"str": [
"UNDEFINED",
"Pr\u00e9-publication, Document de travail"
]
},
{
"str": [
"REPORT",
"Rapport"
]
},
{
"str": [
"THESE",
"Th\u00e8se"
]
},
{
"str": [
"HDR",
"HDR"
]
},
{
"str": [
"LECTURE",
"Cours"
]
},
{
"str": [
"IMG",
"Image"
]
},
{
"str": [
"VIDEO",
"Vid\u00e9o"
]
},
{
"str": [
"SON",
"Son"
]
},
{
"str": [
"MAP",
"Carte"
]
}
]
}
}
}
Référentiel des listes de métadonnées¶
http://api.archives-ouvertes.fr/docs/ref/resource/metadatalist
metaName_s = relator¶
Le paramètre fl= permet de sélectionner les champs à retourner (ici tous ?).
$ curl -o metadatalist-metaname-relator.xml 'http://api-preprod.archives-ouvertes.fr/ref/metadataList/?q=metaName_s:relator&fl=*&wt=xml'
<?xml version="1.0" encoding="UTF-8"?>
<response>
<result name="response" numFound="18" start="0">
<doc>
<int name="docid">55</int>
<str name="label_s">relator : Auteur</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">aut</str>
<str name="fr_metaLabel_s">Auteur</str>
<str name="en_metaLabel_s">Author</str>
<str name="es_metaLabel_s">relator_aut</str>
<str name="eu_metaLabel_s">relator_aut</str>
<long name="_version_">1479316907638128641</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">56</int>
<str name="label_s">relator : Auteur correspondant</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">crp</str>
<str name="fr_metaLabel_s">Auteur correspondant</str>
<str name="en_metaLabel_s">Correspondent author</str>
<str name="es_metaLabel_s">relator_crp</str>
<str name="eu_metaLabel_s">relator_crp</str>
<long name="_version_">1479316907638128642</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">57</int>
<str name="label_s">relator : Directeur de publication</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">edt</str>
<str name="fr_metaLabel_s">Directeur de publication</str>
<str name="en_metaLabel_s">Editor</str>
<str name="es_metaLabel_s">relator_edt</str>
<str name="eu_metaLabel_s">relator_edt</str>
<long name="_version_">1479316907638128643</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">58</int>
<str name="label_s">relator : Directeur scientifique</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">sad</str>
<str name="fr_metaLabel_s">Directeur scientifique</str>
<str name="en_metaLabel_s">Scientific advisor</str>
<str name="es_metaLabel_s">relator_sad</str>
<str name="eu_metaLabel_s">relator_sad</str>
<long name="_version_">1479316907638128644</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">59</int>
<str name="label_s">relator : Collaborateur</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">ctb</str>
<str name="fr_metaLabel_s">Collaborateur</str>
<str name="en_metaLabel_s">Contributor</str>
<str name="es_metaLabel_s">relator_ctb</str>
<str name="eu_metaLabel_s">relator_ctb</str>
<long name="_version_">1479316907639177216</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">60</int>
<str name="label_s">relator : Auteur du matériel d'accompagement</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">wam</str>
<str name="fr_metaLabel_s">Auteur du matériel d'accompagement</str>
<str name="en_metaLabel_s">Writer of accompanying material</str>
<str name="es_metaLabel_s">relator_wam</str>
<str name="eu_metaLabel_s">relator_wam</str>
<long name="_version_">1479316907639177217</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">61</int>
<str name="label_s">relator : Photographe</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">pht</str>
<str name="fr_metaLabel_s">Photographe</str>
<str name="en_metaLabel_s">Photographer</str>
<str name="es_metaLabel_s">relator_pht</str>
<str name="eu_metaLabel_s">relator_pht</str>
<long name="_version_">1479316907639177218</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">62</int>
<str name="label_s">relator : Annoteur</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">ann</str>
<str name="fr_metaLabel_s">Annoteur</str>
<str name="en_metaLabel_s">Annotator</str>
<str name="es_metaLabel_s">relator_ann</str>
<str name="eu_metaLabel_s">relator_ann</str>
<long name="_version_">1479316907639177219</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">63</int>
<str name="label_s">relator : Traducteur</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">trl</str>
<str name="fr_metaLabel_s">Traducteur</str>
<str name="en_metaLabel_s">Translator</str>
<str name="es_metaLabel_s">relator_trl</str>
<str name="eu_metaLabel_s">relator_trl</str>
<long name="_version_">1479316907639177220</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">64</int>
<str name="label_s">relator : Commentateur</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">cwt</str>
<str name="fr_metaLabel_s">Commentateur</str>
<str name="en_metaLabel_s">Commentator</str>
<str name="es_metaLabel_s">relator_cwt</str>
<str name="eu_metaLabel_s">relator_cwt</str>
<long name="_version_">1479316907640225792</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">65</int>
<str name="label_s">relator : Illustrateur</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">ill</str>
<str name="fr_metaLabel_s">Illustrateur</str>
<str name="en_metaLabel_s">Illustrator</str>
<str name="es_metaLabel_s">relator_ill</str>
<str name="eu_metaLabel_s">relator_ill</str>
<long name="_version_">1479316907640225793</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">66</int>
<str name="label_s">relator : Metteur en scène</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">stm</str>
<str name="fr_metaLabel_s">Metteur en scène</str>
<str name="en_metaLabel_s">Stage manager</str>
<str name="es_metaLabel_s">relator_stm</str>
<str name="eu_metaLabel_s">relator_stm</str>
<long name="_version_">1479316907640225794</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">67</int>
<str name="label_s">relator : Monteur</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">pro</str>
<str name="fr_metaLabel_s">Monteur</str>
<str name="en_metaLabel_s">Producer</str>
<str name="es_metaLabel_s">relator_pro</str>
<str name="eu_metaLabel_s">relator_pro</str>
<long name="_version_">1479316907640225795</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">68</int>
<str name="label_s">relator : Directeur artistique</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">ard</str>
<str name="fr_metaLabel_s">Directeur artistique</str>
<str name="en_metaLabel_s">Artistic director</str>
<str name="es_metaLabel_s">relator_ard</str>
<str name="eu_metaLabel_s">relator_ard</str>
<long name="_version_">1479316907640225796</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">69</int>
<str name="label_s">relator : Ingénieur du son</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">sds</str>
<str name="fr_metaLabel_s">Ingénieur du son</str>
<str name="en_metaLabel_s">Sound designer</str>
<str name="es_metaLabel_s">relator_sds</str>
<str name="eu_metaLabel_s">relator_sds</str>
<long name="_version_">1479316907641274368</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">70</int>
<str name="label_s">relator : Cartographe</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">ctg</str>
<str name="fr_metaLabel_s">Cartographe</str>
<str name="en_metaLabel_s">Cartographer</str>
<str name="es_metaLabel_s">relator_ctg</str>
<str name="eu_metaLabel_s">relator_ctg</str>
<long name="_version_">1479316907641274369</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">71</int>
<str name="label_s">relator : Autre</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">oth</str>
<str name="fr_metaLabel_s">Autre</str>
<str name="en_metaLabel_s">Other</str>
<str name="es_metaLabel_s">relator_oth</str>
<str name="eu_metaLabel_s">relator_oth</str>
<long name="_version_">1479316907641274370</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
<doc>
<int name="docid">72</int>
<str name="label_s">relator : Orateur</str>
<str name="metaName_s">relator</str>
<str name="metaValue_s">spk</str>
<str name="fr_metaLabel_s">Orateur</str>
<str name="en_metaLabel_s">Speaker</str>
<str name="es_metaLabel_s">relator_spk</str>
<str name="eu_metaLabel_s">relator_spk</str>
<long name="_version_">1479316907641274371</long>
<date name="dateLastIndexed_tdate">2014-09-15T13:09:00.617Z</date>
</doc>
</result>
</response>
Recherche¶
Dépôts 2014 avec fichiers¶
http://api.archives-ouvertes.fr/docs/search/#fq
fq=submitType_s:file pour n’avoir que les dépôts avec fichiers de l’année 2014 fq=submittedDateY_i:2014 ?
$ curl -o publis-2014.json 'http://api.archives-ouvertes.fr/search/?fq=submitType_s:file&fq=submittedDateY_i:2014'
La requête trouve 48397 résultats ? En affiche un nombre limité (valeur par défaut ?).
{
"response": {
"docs": [
{
"docid": 994591,
"label_s": "Guy Louchard, Helmut Prodinger. Asymptotic results for silent elimination. Discrete Mathematics and Theoretical Computer Science, Discrete Mathematics & Theoretical Computer Science, 2010, special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity, 12 (2), pp.185-196. <hal-00994591>",
"uri_s": "https://hal.inria.fr/hal-00994591"
},
{
"docid": 994597,
"label_s": "R. SCHERRER, Laurent Maxit, Jean-Louis Guyader, C. Audoly, M. Bertinier. Analysis of the sound radiated by a heavy fluid loaded structure excited by an impulsive force. Internoise 2013, 2013, Innsbruck, Austria. pp.#827. <hal-00994597>",
"uri_s": "https://hal.archives-ouvertes.fr/hal-00994597"
},
{
"docid": 994598,
"label_s": "Van Ly Tran. Stochastic models of solar radiation processes. General Mathematics. Universit\u00e9 d'Orl\u00e9ans, 2013. English. <NNT : 2013ORLE2046>. <tel-00994598>",
"uri_s": "https://tel.archives-ouvertes.fr/tel-00994598"
},
{
"docid": 994600,
"label_s": "Olivier Marty. Monetizing French Distance Education. The International Review of Research in Open and Distance Learning, 2014, vol. 15 (n\u00b0 2), http://www.irrodl.org/index.php/irrodl/article/view/1677/2831. <halshs-00994600>",
"uri_s": "https://halshs.archives-ouvertes.fr/halshs-00994600"
},
{
"docid": 994601,
"label_s": "Nicolas Joudiou. D\u00e9veloppement de m\u00e9thodes de spectroscopie par r\u00e9sonance magn\u00e9tique localis\u00e9e pour l'\u00e9tude du m\u00e9tabolisme chez le petit animal. Other. Universit\u00e9 d'Orl\u00e9ans, 2013. French. <NNT : 2013ORLE2044>. <tel-00994601>",
"uri_s": "https://tel.archives-ouvertes.fr/tel-00994601"
},
{
"docid": 994602,
"label_s": "Camille Marini, Claude Frankignoul, Juliette Mignot. Links between the Southern Annular Mode and the Atlantic Meridional Overturning Circulation in a Climate Model. Journal of Climate, American Meteorological Society, 2011, 24, http://journals.ametsoc.org/doi/abs/10.1175/2010JCLI3576.1. <10.1175/2010JCLI3576.1>. <hal-00994602>",
"uri_s": "https://hal.archives-ouvertes.fr/hal-00994602"
},
{
"docid": 1069861,
"label_s": "P. Ghenuche, J. De Torres, P. Ferrand, J. Wenger. Multi-focus parallel detection of fluorescent molecules at picomolar concentration with photonic nanojets arrays. Applied Physics Letters, American Institute of Physics (AIP), 2014, 105 (13), pp.131102. <10.1063/1.4896852>. <hal-01069861>",
"uri_s": "https://hal.archives-ouvertes.fr/hal-01069861"
},
{
"docid": 994604,
"label_s": "Awad Bettamer. prediction of proximal femur fracture : finite element modeling based on mechanical damage and experimental validation. Other. Universit\u00e9 d'Orl\u00e9ans, 2013. English. <NNT : 2013ORLE2045>. <tel-00994604>",
"uri_s": "https://tel.archives-ouvertes.fr/tel-00994604"
},
{
"docid": 994605,
"label_s": "Jean Bazantay. La chose pour le dire : mono en japonais contemporain : approche s\u00e9mantique, syntaxique et \u00e9nonciative. Linguistics. Universit\u00e9 Michel de Montaigne - Bordeaux III, 2013. French. <NNT : 2013BOR30023>. <tel-00994605>",
"uri_s": "https://tel.archives-ouvertes.fr/tel-00994605"
},
{
"docid": 994610,
"label_s": "Isabelle Galichon. Le r\u00e9cit de soi comme \u00e9criture de r\u00e9sistance face au nazisme : du sentiment \u00e0 l'acte : d\u00e9finition d'une po\u00e9tique du r\u00e9cit de soi en r\u00e9sistance. Literature. Universit\u00e9 Michel de Montaigne - Bordeaux III, 2013. French. <NNT : 2013BOR30020>. <tel-00994610>",
"uri_s": "https://tel.archives-ouvertes.fr/tel-00994610"
},
{
"docid": 994612,
"label_s": "C\u00e9line Antonin, Christophe Blot, Sabine Le Bayon, Herv\u00e9 P\u00e9l\u00e9raux, Christine Rifflart, et al.. Banques centrales dernier rempart contre la d\u00e9flation. Revue de l'OFCE - Analyse et pr\u00e9visions, 2014, pp.11-51. <hal-00994612>",
"uri_s": "https://hal-sciencespo.archives-ouvertes.fr/hal-00994612"
},
{
"docid": 1069877,
"label_s": "Mountaz Hasco\u00ebt. Skinnable graph drawing. RR-14007, 2014. <lirmm-00615429v2>",
"uri_s": "http://hal-lirmm.ccsd.cnrs.fr/lirmm-00615429v2"
},
{
"docid": 994617,
"label_s": "Dominique Michelet. Cuecillo Prieto : Panoramique (3/4). Photography. CEMCA:73A544, Cuecillo Prieto, Mexico. 1973. <medihal-00994617>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994617"
},
{
"docid": 994619,
"label_s": "Dominique Michelet. Cuecillo Prieto : Pied du grand monticule. Photography. CEMCA:73A546, Cuecillo Prieto, Mexico. 1973. <medihal-00994619>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994619"
},
{
"docid": 994621,
"label_s": "Dominique Michelet. Orde\u00f1a Vieja : Mur nord de monticule Sud. Photography. Orde\u00f1a Vieja, Mexico. 1973. <medihal-00994621>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994621"
},
{
"docid": 1069882,
"label_s": "Yui-Yip LAU, Adolf KY NG, David GUERRERO. Becoming a major hub in the distribution of wine: Hong Kong as a gate to Asian markets. IFSPA - International Forum on Shipping, Ports and Airports, May 2014, China. 22p. <hal-01069882>",
"uri_s": "https://hal.archives-ouvertes.fr/hal-01069882"
},
{
"docid": 994624,
"label_s": "Dominique Michelet. El Organo : La grande Structure Sud-Ouest. Photography. CEMCA:73A551, El Organo, Mexico. 1973. <medihal-00994624>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994624"
},
{
"docid": 1069884,
"label_s": "Jean-Marie Gueullette. La place du r\u00e9cit dans la d\u00e9finition de l'ost\u00e9opathie. Sylvie Patron, Brian Schiff. Narrative Matters 2014 : Narrative Knowing/ R\u00e9cit et Savoir, Jun 2014, Paris, France. <hal-01069884>",
"uri_s": "https://hal-univ-diderot.archives-ouvertes.fr/hal-01069884"
},
{
"docid": 994627,
"label_s": "Dominique Michelet. Los Cuecillos del Refugio : Panoramique (1/5). Photography. CEMCA:73A554, Los Cuecillos del Refugio, Mexico. 1973. <medihal-00994627>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994627"
},
{
"docid": 994631,
"label_s": "Maxime Deschanet. Les Tatars de Crim\u00e9e au XVII\u00e8me si\u00e8cle dans Pierre Chevalier, \"Histoire de la guerre des Cosaques contre la Pologne\", Paris, 1663. La Crim\u00e9e, le destin d'une p\u00e9ninscule, Jun 2014, Paris, France. <hal-00994631>",
"uri_s": "https://hal.archives-ouvertes.fr/hal-00994631"
},
{
"docid": 994632,
"label_s": "Dominique Michelet. Los Cuecillos del Refugio : Panoramique (5/5). Photography. CEMCA:73A558, Los Cuecillos del Refugio, Mexico. 1973. <medihal-00994632>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994632"
},
{
"docid": 994633,
"label_s": "Dominique Michelet. Los Cuecillos del Refugio : Le monticule principal. Photography. CEMCA:73A559, Les Cuecillos del Refugio, Mexico. 1973. <medihal-00994633>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994633"
},
{
"docid": 994634,
"label_s": "Dominique Michelet. El Refugio : Vue prise de la sortie du village. Photography. CEMCA:73A561, El Refugio, Mexico. 1973. <medihal-00994634>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994634"
},
{
"docid": 994635,
"label_s": "Dominique Michelet. Arroyo Seco : \u00e9glise forteresse. Photography. CEMCA:73A562, Arroyo Seco, Mexico. 1973. <medihal-00994635>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994635"
},
{
"docid": 994636,
"label_s": "Dominique Michelet. San Rafael : Ancienne piste coupant le monticule. Photography. CEMCA:73A563, San Rafael, Mexico. 1973. <medihal-00994636>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994636"
},
{
"docid": 994641,
"label_s": "Dominique Michelet. Amoladeras : Vue depuis le sommet du monticule isol\u00e9. Photography. CEMCA:73A567, Amoladeras, Mexico. 1973. <medihal-00994641>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994641"
},
{
"docid": 994642,
"label_s": "Dominique Michelet. Los Juzgados : Panoramique (1/2). Photography. CEMCA:73A568, Los Juzgados, Mexico. 1973. <medihal-00994642>",
"uri_s": "https://medihal.archives-ouvertes.fr/medihal-00994642"
},
{
"docid": 994650,
"label_s": "Maxime Deschanet. Introduction \u00e0 l'Histoire de l'Ukraine. 5 pages. 2014. <hal-00994650>",
"uri_s": "https://hal.archives-ouvertes.fr/hal-00994650"
},
{
"docid": 1069905,
"label_s": "Isa Baud, Karin Pfeffer, Diane Scott, Eric Denis, John Sydenstricker-Neto. Participatory 'Spatial' Knowledge Management Configurations in Metropolitan Governance Networks for SD. Thematic Report n\u00b02. Thematic Report n\u00b02, Chance2Sustain. 2014. <halshs-01069905>",
"uri_s": "https://halshs.archives-ouvertes.fr/halshs-01069905"
},
{
"docid": 1069917,
"label_s": "Pritish Mohapatra, C. V. Jawahar, M. Pawan Kumar. Efficient Optimization for Average Precision SVM. NIPS - Advances in Neural Information Processing Systems, 2014, Montreal, Canada. <hal-01069917>",
"uri_s": "https://hal.inria.fr/hal-01069917"
}
],
"numFound": 48397,
"start": 0
}
}
Dépôts INRIA domaine informatique¶
Si les caractères (‘[‘, ‘”’, ‘ ‘, ‘]’, ...) ne sont pas URL-encodés, j’ai une erreur curl: (3) [globbing] bad range specification in column 110 (c’est bien la cause ?).
$ curl -o publis-inria-info.xml 'http://api.archives-ouvertes.fr/search/?q=*:*&fq=level0_domain_s:info&fq=collCode_s:INRIA&fq=modifiedDate_s:%5B%222011-06-02%2000:00:00%22%20TO%20*%5D&wt=xml-tei'
Le résultat est assez long 6500 lignes (28079 résultats ?).
<?xml version="1.0"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:tei="http://www.tei-c.org/ns/1.0">
<teiHeader>
<fileDesc>
<titleStmt>
<title>Search restults from HAL API</title>
</titleStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<availability status="restricted">
<licence target="http://creativecommons.org/licenses/by/4.0/">Distributed under a Creative Commons Attribution 4.0 International License</licence>
</availability>
<date when="2015-02-17T16:37:42+01:00"/>
</publicationStmt>
<sourceDesc>
<p part="N">HAL API platform</p>
</sourceDesc>
</fileDesc>
<profileDesc>
<creation>
<measure quantity="28079" unit="count" commodity="totalSearchResults"/>
<measure quantity="30" unit="count" commodity="searchResultsInDocument"/>
<ptr type="query" target="https://api.archives-ouvertes.fr/search/?q=*:*&fq=level0_domain_s:info&fq=collCode_s:INRIA&fq=modifiedDate_s:%5B%222011-06-02%2000:00:00%22%20TO%20*%5D&wt=xml-tei"/>
</creation>
</profileDesc>
</teiHeader>
<text>
<body>
<listBibl>
<biblFull>
<titleStmt>
<title xml:lang="en">YAM: a Schema Matcher Factory</title>
<author role="aut">
<persName>
<forename type="first">Fabien</forename>
<surname>Duchateau</surname>
</persName>
<email>duchatea@lirmm.fr</email>
<idno type="halauthor">145765</idno>
<affiliation ref="#struct-181"/>
</author>
<author role="aut">
<persName>
<forename type="first">Remi</forename>
<surname>Coletta</surname>
</persName>
<email>coletta@lirmm.fr</email>
<ptr type="url" target="http://www.lirmm.fr/~coletta"/>
<idno type="halauthor">784050</idno>
<affiliation ref="#struct-141072"/>
</author>
<author role="aut">
<persName>
<forename type="first">Zohra</forename>
<surname>Bellahsene</surname>
</persName>
<email>Zohra.Bellahsene@lirmm.fr</email>
<idno type="halauthor">753580</idno>
<affiliation ref="#struct-141072"/>
</author>
<author role="aut">
<persName>
<forename type="first">Renée</forename>
<surname>J. Miller</surname>
</persName>
<email/>
<idno type="halauthor">416269</idno>
<affiliation ref="#struct-28612"/>
</author>
<editor role="depositor">
<persName>
<forename>Fabien</forename>
<surname>Duchateau</surname>
</persName>
<email>duchatea@lirmm.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2010-06-25 07:00:12</date>
<date type="whenModified">2015-02-06 16:04:19</date>
<date type="whenReleased">2009-06-26 15:38:44</date>
<date type="whenProduced">2009-06-05</date>
<ref type="file" target="http://hal-lirmm.ccsd.cnrs.fr/lirmm-00399184/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="114409">
<persName>
<forename>Fabien</forename>
<surname>Duchateau</surname>
</persName>
<email>duchatea@lirmm.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">lirmm-00399184</idno>
<idno type="halUri">http://hal-lirmm.ccsd.cnrs.fr/lirmm-00399184</idno>
<idno type="halBibtex">duchateau:lirmm-00399184</idno>
<idno type="halRefHtml">RR-09018, 2009</idno>
<idno type="halRef">RR-09018, 2009</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="UNIV-MONTP2">Université Montpellier II - Sciences et Techniques du Languedoc</idno>
<idno type="stamp" n="TAMP_LIRMM_DOI">LIRMM</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA34">Montpellier</idno>
<idno type="stamp" n="ZENITH">Scientific Data Management</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="0">Not set</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">YAM: a Schema Matcher Factory</title>
<author role="aut">
<persName>
<forename type="first">Fabien</forename>
<surname>Duchateau</surname>
</persName>
<email>duchatea@lirmm.fr</email>
<idno type="halAuthorId">145765</idno>
<affiliation ref="#struct-181"/>
</author>
<author role="aut">
<persName>
<forename type="first">Remi</forename>
<surname>Coletta</surname>
</persName>
<email>coletta@lirmm.fr</email>
<ptr type="url" target="http://www.lirmm.fr/~coletta"/>
<idno type="halAuthorId">784050</idno>
<affiliation ref="#struct-141072"/>
</author>
<author role="aut">
<persName>
<forename type="first">Zohra</forename>
<surname>Bellahsene</surname>
</persName>
<email>Zohra.Bellahsene@lirmm.fr</email>
<idno type="halAuthorId">753580</idno>
<affiliation ref="#struct-141072"/>
</author>
<author role="aut">
<persName>
<forename type="first">Renée</forename>
<surname>J. Miller</surname>
</persName>
<idno type="halAuthorId">416269</idno>
<affiliation ref="#struct-28612"/>
</author>
</analytic>
<monogr>
<idno type="reportNumber">RR-09018</idno>
<imprint>
<date type="datePub">2009-06-05</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="en">Schema matching</term>
<term xml:lang="en">data integration</term>
<term xml:lang="en">matcher factory</term>
<term xml:lang="en">machine learning</term>
<term xml:lang="en">XML schemas</term>
<term xml:lang="en">YAM</term>
<term xml:lang="en">Yet Another Matcher</term>
<term xml:lang="en">demo</term>
</keywords>
<classCode scheme="halDomain" n="info.info-db">Computer Science/Databases</classCode>
<classCode scheme="halDomain" n="info.info-lg">Computer Science/Machine Learning</classCode>
<classCode scheme="halTypology" n="REPORT">Reports</classCode>
</textClass>
<abstract xml:lang="en">In this paper, we present YAM, a schema matcher factory. YAM (Yet Another Matcher) is not (yet) another schema matching system as it enables the generation of a la carte schema matchers according to user requirements. These re- quirements include a preference for recall or precision, a training data set (schemas already matched) and provided expert correspondences. YAM uses a knowledge base that includes a (possibly large) set of similarity measures and classifiers. Based on the user requirements, YAM learns how to best apply these tools (similarity measures and clas- sifiers) in concert to achieve the best matching quality. In our demonstration, we will let users apply YAM to build the best schema matcher for different user requirements.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="fr">Reconstruction 3D du bâti par la technique des ombres chinoises</title>
<author role="aut">
<persName>
<forename type="first">Pavel</forename>
<surname>Lukashevish</surname>
</persName>
<email>Pavel.Lukashevich@newman.bas-net.by</email>
<idno type="halauthor">416280</idno>
<affiliation ref="#struct-42196"/>
</author>
<author role="aut">
<persName>
<forename type="first">Alianxandr</forename>
<surname>Kraushonak</surname>
</persName>
<email>alpha_storm@mail.ru</email>
<idno type="halauthor">416281</idno>
<affiliation ref="#struct-42196"/>
</author>
<author role="aut">
<persName>
<forename type="first">Xavier</forename>
<surname>Descombes</surname>
</persName>
<email>Xavier.Descombes@sophia.inria.fr</email>
<idno type="halauthor">97831</idno>
<affiliation ref="#struct-2450"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jean-Denis</forename>
<surname>Durou</surname>
</persName>
<email/>
<idno type="halauthor">99444</idno>
<affiliation ref="#struct-34499"/>
</author>
<author role="aut">
<persName>
<forename type="first">Boris</forename>
<surname>Zalessky</surname>
</persName>
<email>zalesky@newman.bas-net.by</email>
<idno type="halauthor">416282</idno>
<affiliation ref="#struct-42196"/>
</author>
<author role="aut">
<persName>
<forename type="first">Elena</forename>
<surname>Zhizhina</surname>
</persName>
<email>ejj@iitp.ru</email>
<idno type="halauthor">416283</idno>
<affiliation ref="#struct-20456"/>
</author>
<editor role="depositor">
<persName>
<forename>Xavier</forename>
<surname>Descombes</surname>
</persName>
<email>Xavier.Descombes@sophia.inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2009-06-25 18:38:51</date>
<date type="whenModified">2013-01-15 13:34:50</date>
<date type="whenReleased">2009-06-25 19:52:27</date>
<date type="whenProduced">2009-09</date>
<ref type="file" target="https://hal.inria.fr/inria-00399208/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="113126">
<persName>
<forename>Xavier</forename>
<surname>Descombes</surname>
</persName>
<email>Xavier.Descombes@sophia.inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">inria-00399208</idno>
<idno type="halUri">https://hal.inria.fr/inria-00399208</idno>
<idno type="halBibtex">lukashevish:inria-00399208</idno>
<idno type="halRefHtml"><i>GRETSI</i>, Sep 2009, Dijon, France</idno>
<idno type="halRef">GRETSI, Sep 2009, Dijon, France</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="UNICE">Université de Nice Sophia-Antipolis</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-TLSE3">Université Paul Sabatier - Toulouse III</idno>
<idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
<idno type="stamp" n="I3S">Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis</idno>
<idno type="stamp" n="UNIV-TLSE1">Université des Sciences Sociales - Toulouse I</idno>
<idno type="stamp" n="UNIV-TLSE2">Université Toulouse le Mirail - Toulouse II</idno>
<idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="3">National</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="fr">Reconstruction 3D du bâti par la technique des ombres chinoises</title>
<author role="aut">
<persName>
<forename type="first">Pavel</forename>
<surname>Lukashevish</surname>
</persName>
<email>Pavel.Lukashevich@newman.bas-net.by</email>
<idno type="halAuthorId">416280</idno>
<affiliation ref="#struct-42196"/>
</author>
<author role="aut">
<persName>
<forename type="first">Alianxandr</forename>
<surname>Kraushonak</surname>
</persName>
<email>alpha_storm@mail.ru</email>
<idno type="halAuthorId">416281</idno>
<affiliation ref="#struct-42196"/>
</author>
<author role="aut">
<persName>
<forename type="first">Xavier</forename>
<surname>Descombes</surname>
</persName>
<email>Xavier.Descombes@sophia.inria.fr</email>
<idno type="halAuthorId">97831</idno>
<affiliation ref="#struct-2450"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jean-Denis</forename>
<surname>Durou</surname>
</persName>
<idno type="halAuthorId">99444</idno>
<affiliation ref="#struct-34499"/>
</author>
<author role="aut">
<persName>
<forename type="first">Boris</forename>
<surname>Zalessky</surname>
</persName>
<email>zalesky@newman.bas-net.by</email>
<idno type="halAuthorId">416282</idno>
<affiliation ref="#struct-42196"/>
</author>
<author role="aut">
<persName>
<forename type="first">Elena</forename>
<surname>Zhizhina</surname>
</persName>
<email>ejj@iitp.ru</email>
<idno type="halAuthorId">416283</idno>
<affiliation ref="#struct-20456"/>
</author>
</analytic>
<monogr>
<meeting>
<title>GRETSI</title>
<date type="start">2009-09</date>
<settlement>Dijon</settlement>
<country key="FR">France</country>
</meeting>
<imprint>
<date type="datePub">2009</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="fr">French</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-ti">Computer Science/Image Processing</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="fr">Dans cet article, nous effectuons la reconstruction 3D du bâti à partir d'images satellitaires. Nous nous écartons de l'approche classique qui consiste à considérer le problème comme un problème inverse qui doit être résolu en utilisant deux images stéréoscopiques et en les mettant en correspondance. Au contraire, nous montrons qu'il est plus simple de résoudre le problème directement par essais/erreurs comme on on le fait très naturellement pour produire des ombres chinoises. Nous montrons notamment que cette approche ne nécessite pas un temps de calcul considérable, grâce à la puissance de calcul d'OpenGL qui s'appuie sur une carte graphique. Les premiers résultats obtenus montrent la pertinence de l'approche adoptée. En particulier, elle permet de résoudre des ambiguïtés pour lesquelles l'inversion du problème serait quasiment impossible.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">A Simple and Efficient Boolean Solver for Constraint Logic Programming</title>
<author role="aut">
<persName>
<forename type="first">Philippe</forename>
<surname>Codognet</surname>
</persName>
<email/>
<idno type="halauthor">102979</idno>
<affiliation ref="#struct-252578"/>
</author>
<author role="aut">
<persName>
<forename type="first">Daniel</forename>
<surname>Diaz</surname>
</persName>
<email/>
<idno type="halauthor">681811</idno>
<affiliation ref="#struct-74131"/>
</author>
<editor role="depositor">
<persName>
<forename>Daniel</forename>
<surname>Diaz</surname>
</persName>
<email>Daniel.Diaz@univ-paris1.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2012-05-02 11:49:46</date>
<date type="whenModified">2014-09-19 13:14:25</date>
<date type="whenReleased">2012-05-02 11:49:46</date>
<date type="whenProduced">1996</date>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="167515">
<persName>
<forename>Daniel</forename>
<surname>Diaz</surname>
</persName>
<email>Daniel.Diaz@univ-paris1.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00693251</idno>
<idno type="halUri">https://hal-paris1.archives-ouvertes.fr/hal-00693251</idno>
<idno type="halBibtex">codognet:hal-00693251</idno>
<idno type="halRefHtml"><i>Journal of Automated Reasoning</i>, Springer Verlag (Germany), 1996, 17 (1), pp.97-129</idno>
<idno type="halRef">Journal of Automated Reasoning, Springer Verlag (Germany), 1996, 17 (1), pp.97-129</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="UNIV-PARIS1">Université Panthéon-Sorbonne - Paris I</idno>
<idno type="stamp" n="CRI">Centre de Recherche en Informatique de Paris 1</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">A Simple and Efficient Boolean Solver for Constraint Logic Programming</title>
<author role="aut">
<persName>
<forename type="first">Philippe</forename>
<surname>Codognet</surname>
</persName>
<idno type="halAuthorId">102979</idno>
<affiliation ref="#struct-252578"/>
</author>
<author role="aut">
<persName>
<forename type="first">Daniel</forename>
<surname>Diaz</surname>
</persName>
<idno type="halAuthorId">681811</idno>
<affiliation ref="#struct-74131"/>
</author>
</analytic>
<monogr>
<idno type="halJournalId">15114</idno>
<idno type="issn">0168-7433</idno>
<idno type="eissn">1573-0670</idno>
<title level="j">Journal of Automated Reasoning</title>
<imprint>
<publisher>Springer Verlag (Germany)</publisher>
<biblScope unit="volume">17</biblScope>
<biblScope unit="issue">1</biblScope>
<biblScope unit="pp">97-129</biblScope>
<date type="datePub">1996</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="en">contraint programming</term>
<term xml:lang="en">boolean constraints</term>
<term xml:lang="en">SAT</term>
<term xml:lang="en">CLP</term>
<term xml:lang="en">constraint logic programming</term>
<term xml:lang="en">WAM</term>
</keywords>
<classCode scheme="halDomain" n="info.info-se">Computer Science/Software Engineering</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="da">[Tiger2/] Documentation</title>
<author role="aut">
<persName>
<forename type="first">Laurent</forename>
<surname>Romary</surname>
</persName>
<email>laurent.romary@inria.fr</email>
<idno type="idhal">laurentromary</idno>
<idno type="halauthor">49567</idno>
<idno type="arXiv">http://arxiv.org/a/Romary_L</idno>
<idno type="IdRef">http://www.idref.fr/060702494</idno>
<idno type="ORCID">http://orcid.org/0000-0002-0756-0508</idno>
<affiliation ref="#struct-95237"/>
<affiliation ref="#struct-118511"/>
</author>
<author role="aut">
<persName>
<forename type="first">Amir</forename>
<surname>Zeldes</surname>
</persName>
<email>amir.zeldes@rz.hu-berlin.de</email>
<idno type="halauthor">608962</idno>
<affiliation ref="#struct-95237"/>
</author>
<author role="aut">
<persName>
<forename type="first">Florian</forename>
<surname>Zipser</surname>
</persName>
<email/>
<idno type="halauthor">535485</idno>
<affiliation ref="#struct-95237"/>
<affiliation ref="#struct-118511"/>
</author>
<editor role="depositor">
<persName>
<forename>Laurent</forename>
<surname>Romary</surname>
</persName>
<email>laurent.romary@inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1">
<date type="whenSubmitted">2011-05-18 09:35:45</date>
</edition>
<edition n="v2" type="current">
<date type="whenSubmitted">2011-05-25 21:19:12</date>
<date type="whenModified">2011-08-02 09:39:12</date>
<date type="whenReleased">2011-05-26 10:00:28</date>
<date type="whenProduced">2010-07-16</date>
<ref type="file" target="https://hal.inria.fr/inria-00593903v2/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="105529">
<persName>
<forename>Laurent</forename>
<surname>Romary</surname>
</persName>
<email>laurent.romary@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">inria-00593903</idno>
<idno type="halUri">https://hal.inria.fr/inria-00593903</idno>
<idno type="halBibtex">romary:inria-00593903</idno>
<idno type="halRefHtml">[Technical Report] 2010</idno>
<idno type="halRef">[Technical Report] 2010</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-SACLAY">INRIA Saclay - Ile de France</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="0">Not set</note>
<note type="report" n="4">Technical Report</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="da">[Tiger2/] Documentation</title>
<author role="aut">
<persName>
<forename type="first">Laurent</forename>
<surname>Romary</surname>
</persName>
<email>laurent.romary@inria.fr</email>
<idno type="idHal">laurentromary</idno>
<idno type="halAuthorId">49567</idno>
<idno type="arXiv">http://arxiv.org/a/Romary_L</idno>
<idno type="IdRef">http://www.idref.fr/060702494</idno>
<idno type="ORCID">http://orcid.org/0000-0002-0756-0508</idno>
<affiliation ref="#struct-95237"/>
<affiliation ref="#struct-118511"/>
</author>
<author role="aut">
<persName>
<forename type="first">Amir</forename>
<surname>Zeldes</surname>
</persName>
<email>amir.zeldes@rz.hu-berlin.de</email>
<idno type="halAuthorId">608962</idno>
<affiliation ref="#struct-95237"/>
</author>
<author role="aut">
<persName>
<forename type="first">Florian</forename>
<surname>Zipser</surname>
</persName>
<idno type="halAuthorId">535485</idno>
<affiliation ref="#struct-95237"/>
<affiliation ref="#struct-118511"/>
</author>
</analytic>
<monogr>
<imprint>
<date type="datePub">2010-07-16</date>
</imprint>
</monogr>
<ref type="seeAlso">http://korpling.german.hu-berlin.de/tiger2/</ref>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-cl">Computer Science/Computation and Language</classCode>
<classCode scheme="halTypology" n="REPORT">Reports</classCode>
</textClass>
<abstract xml:lang="en">This report presents the main components of the Tiger2 format for the representation of syntactic annotations for linguistic data. Derived from the existing Tiger format and in compliance with ISO standard 24615 (SynAF), it offers mechanisms covering the wide range of constituency and dependency annotations.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Efficient Optimization for Average Precision SVM</title>
<author role="aut">
<persName>
<forename type="first">Pritish</forename>
<surname>Mohapatra</surname>
</persName>
<email/>
<idno type="halauthor">1079540</idno>
<affiliation ref="#struct-184796"/>
</author>
<author role="aut">
<persName>
<forename type="first">C. V.</forename>
<surname>Jawahar</surname>
</persName>
<email/>
<idno type="halauthor">1074663</idno>
<affiliation ref="#struct-184796"/>
</author>
<author role="aut">
<persName>
<forename type="first">M. Pawan</forename>
<surname>Kumar</surname>
</persName>
<email>pawan.kumar@ecp.fr</email>
<idno type="halauthor">804789</idno>
<affiliation ref="#struct-56046"/>
<affiliation ref="#struct-187174"/>
</author>
<editor role="depositor">
<persName>
<forename>M. Pawan</forename>
<surname>Kumar</surname>
</persName>
<email>pawan.kumar@ecp.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-09-30 11:01:54</date>
<date type="whenModified">2014-11-14 16:35:31</date>
<date type="whenReleased">2014-10-07 09:16:46</date>
<date type="whenProduced">2014</date>
<ref type="file" target="https://hal.inria.fr/hal-01069917/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="179268">
<persName>
<forename>M. Pawan</forename>
<surname>Kumar</surname>
</persName>
<email>pawan.kumar@ecp.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-01069917</idno>
<idno type="halUri">https://hal.inria.fr/hal-01069917</idno>
<idno type="halBibtex">mohapatra:hal-01069917</idno>
<idno type="halRefHtml"><i>NIPS - Advances in Neural Information Processing Systems</i>, 2014, Montreal, Canada</idno>
<idno type="halRef">NIPS - Advances in Neural Information Processing Systems, 2014, Montreal, Canada</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="EC-PARIS">Ecole Centrale Paris</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-SACLAY">INRIA Saclay - Ile de France</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Efficient Optimization for Average Precision SVM</title>
<author role="aut">
<persName>
<forename type="first">Pritish</forename>
<surname>Mohapatra</surname>
</persName>
<idno type="halAuthorId">1079540</idno>
<affiliation ref="#struct-184796"/>
</author>
<author role="aut">
<persName>
<forename type="first">C. V.</forename>
<surname>Jawahar</surname>
</persName>
<idno type="halAuthorId">1074663</idno>
<affiliation ref="#struct-184796"/>
</author>
<author role="aut">
<persName>
<forename type="first">M. Pawan</forename>
<surname>Kumar</surname>
</persName>
<email>pawan.kumar@ecp.fr</email>
<idno type="halAuthorId">804789</idno>
<affiliation ref="#struct-56046"/>
<affiliation ref="#struct-187174"/>
</author>
</analytic>
<monogr>
<meeting>
<title>NIPS - Advances in Neural Information Processing Systems</title>
<date type="start">2014</date>
<settlement>Montreal</settlement>
<country key="CA">Canada</country>
</meeting>
<imprint>
<date type="datePub">2014</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-lg">Computer Science/Machine Learning</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">The accuracy of information retrieval systems is often measured using average precision (AP). Given a set of positive (relevant) and negative (non-relevant) samples, the parameters of a retrieval system can be estimated using the AP-SVM framework, which minimizes a regularized convex upper bound on the empirical AP loss. However, the high computational complexity of loss-augmented inference, which is required for learning an AP-SVM, prohibits its use on large training datasets. To alleviate this deficiency, we propose three complementary approaches. The first approach guarantees an asymptotic decrease in the computational complexity of loss-augmented inference by exploiting the problem structure. The second approach takes advantage of the fact that we do not require a full ranking during loss-augmented inference. This helps us to avoid the expensive step of sorting the negative samples according to their individual scores. The third approach approximates the AP loss over all samples by the AP loss over difficult samples (for example, those that are incorrectly classified by a binary SVM), while ensuring the correct classification of the remaining samples. Using the PASCAL VOC action classification dataset, we show that our approaches provide significant speed-ups during training without degrading the test accuracy of AP-SVM.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="fr">Estimation des paramètres de processus ponctuels marqués dans le cadre de l'extraction d'objets en imagerie de télédétection</title>
<author role="aut">
<persName>
<forename type="first">Florent</forename>
<surname>Chatelain</surname>
</persName>
<email>florent.chatelain@gipsa-lab.inpg.fr</email>
<idno type="halauthor">394263</idno>
<affiliation ref="#struct-388180"/>
</author>
<author role="aut">
<persName>
<forename type="first">Xavier</forename>
<surname>Descombes</surname>
</persName>
<email>Xavier.Descombes@sophia.inria.fr</email>
<idno type="halauthor">97831</idno>
<affiliation ref="#struct-2450"/>
</author>
<author role="aut">
<persName>
<forename type="first">Josiane</forename>
<surname>Zerubia</surname>
</persName>
<email>Josiane.Zerubia@sophia.inria.fr</email>
<idno type="halauthor">97606</idno>
<affiliation ref="#struct-2450"/>
</author>
<editor role="depositor">
<persName>
<forename>Xavier</forename>
<surname>Descombes</surname>
</persName>
<email>Xavier.Descombes@sophia.inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2009-06-26 09:27:59</date>
<date type="whenModified">2014-10-28 18:35:24</date>
<date type="whenReleased">2009-06-26 09:55:16</date>
<date type="whenProduced">2009-09-08</date>
<ref type="file" target="https://hal.inria.fr/inria-00399258/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="113126">
<persName>
<forename>Xavier</forename>
<surname>Descombes</surname>
</persName>
<email>Xavier.Descombes@sophia.inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">inria-00399258</idno>
<idno type="halUri">https://hal.inria.fr/inria-00399258</idno>
<idno type="halBibtex">chatelain:inria-00399258</idno>
<idno type="halRefHtml"><i>XXIIe colloque GRETSI (GRETSI 2009)</i>, Sep 2009, Dijon, France</idno>
<idno type="halRef">XXIIe colloque GRETSI (GRETSI 2009), Sep 2009, Dijon, France</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
<idno type="stamp" n="I3S">Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis</idno>
<idno type="stamp" n="GIPSA-SA-IGA" p="GIPSA-DA">SA-IGA</idno>
<idno type="stamp" n="GIPSA-DIS" p="GIPSA">Département Image et Signal</idno>
<idno type="stamp" n="GIPSA" p="UGA">Grenoble Images Parole Signal Automatique</idno>
<idno type="stamp" n="UNIV-GRENOBLE1" p="UGA">Université Joseph Fourier - Grenoble I</idno>
<idno type="stamp" n="UNIV-PMF_GRENOBLE" p="UGA">Université Pierre-Mendès-France - Grenoble II</idno>
<idno type="stamp" n="UNIV-GRENOBLE3" p="UGA">Université Stendhal - Grenoble III</idno>
<idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
<idno type="stamp" n="UNICE">Université de Nice Sophia-Antipolis</idno>
<idno type="stamp" n="INPG" p="UGA">Institut polytechnique de Grenoble</idno>
<idno type="stamp" n="UGA">HAL Grenoble Alpes</idno>
<idno type="stamp" n="LORIA-TALC" p="LORIA">Traitement automatique des langues et des connaissances</idno>
<idno type="stamp" n="INRIA-MECSCI">Médiation Scientifique en Science du Numérique</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="3">National</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="fr">Estimation des paramètres de processus ponctuels marqués dans le cadre de l'extraction d'objets en imagerie de télédétection</title>
<author role="aut">
<persName>
<forename type="first">Florent</forename>
<surname>Chatelain</surname>
</persName>
<email>florent.chatelain@gipsa-lab.inpg.fr</email>
<idno type="halAuthorId">394263</idno>
<affiliation ref="#struct-388180"/>
</author>
<author role="aut">
<persName>
<forename type="first">Xavier</forename>
<surname>Descombes</surname>
</persName>
<email>Xavier.Descombes@sophia.inria.fr</email>
<idno type="halAuthorId">97831</idno>
<affiliation ref="#struct-2450"/>
</author>
<author role="aut">
<persName>
<forename type="first">Josiane</forename>
<surname>Zerubia</surname>
</persName>
<email>Josiane.Zerubia@sophia.inria.fr</email>
<idno type="halAuthorId">97606</idno>
<affiliation ref="#struct-2450"/>
</author>
</analytic>
<monogr>
<meeting>
<title>XXIIe colloque GRETSI (GRETSI 2009)</title>
<date type="start">2009-09-08</date>
<date type="end">2009-09-11</date>
<settlement>Dijon</settlement>
<country key="FR">France</country>
</meeting>
<imprint>
<date type="datePub">2009</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="fr">French</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-ti">Computer Science/Image Processing</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="fr">L'article étudie le problème de l'estimation des paramètres d'un processus ponctuel marqué modélisant un réseau d'objets dans une image. L'objectif est de mettre en oeuvre des méthodes d'extraction automatique des objets dans des images de télédétection. L'estimation des paramètres du processus est menée dans le cas de données incomplètes, où la configuration des objets dans l'image n'est pas connue. Les paramètres du modèle, ainsi que la configuration des objets, sont alors estimés conjointement. Ces travaux montrent la possibilité d'estimer certains paramètres des processus étudiés, et ouvrent la voie à des méthodes d'extraction automatique des objets</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Compiling Constraints in clp(FD)</title>
<author role="aut">
<persName>
<forename type="first">Philippe</forename>
<surname>Codognet</surname>
</persName>
<email/>
<idno type="halauthor">102979</idno>
<affiliation ref="#struct-252578"/>
</author>
<author role="aut">
<persName>
<forename type="first">Daniel</forename>
<surname>Diaz</surname>
</persName>
<email/>
<idno type="halauthor">681811</idno>
<affiliation ref="#struct-74131"/>
</author>
<editor role="depositor">
<persName>
<forename>Daniel</forename>
<surname>Diaz</surname>
</persName>
<email>Daniel.Diaz@univ-paris1.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2012-05-02 11:45:17</date>
<date type="whenWritten">1996</date>
<date type="whenModified">2014-09-19 12:01:31</date>
<date type="whenReleased">2012-05-02 11:45:17</date>
<date type="whenProduced">1996</date>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="167515">
<persName>
<forename>Daniel</forename>
<surname>Diaz</surname>
</persName>
<email>Daniel.Diaz@univ-paris1.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00693245</idno>
<idno type="halUri">https://hal-paris1.archives-ouvertes.fr/hal-00693245</idno>
<idno type="halBibtex">codognet:hal-00693245</idno>
<idno type="halRefHtml"><i>Journal of Logic Programming</i>, 1996, 27 (3), pp.185-226</idno>
<idno type="halRef">Journal of Logic Programming, 1996, 27 (3), pp.185-226</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="UNIV-PARIS1">Université Panthéon-Sorbonne - Paris I</idno>
<idno type="stamp" n="CRI">Centre de Recherche en Informatique de Paris 1</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Compiling Constraints in clp(FD)</title>
<author role="aut">
<persName>
<forename type="first">Philippe</forename>
<surname>Codognet</surname>
</persName>
<idno type="halAuthorId">102979</idno>
<affiliation ref="#struct-252578"/>
</author>
<author role="aut">
<persName>
<forename type="first">Daniel</forename>
<surname>Diaz</surname>
</persName>
<idno type="halAuthorId">681811</idno>
<affiliation ref="#struct-74131"/>
</author>
</analytic>
<monogr>
<idno type="halJournalId">44288</idno>
<title level="j">Journal of Logic Programming</title>
<imprint>
<biblScope unit="volume">27</biblScope>
<biblScope unit="issue">3</biblScope>
<biblScope unit="pp">185-226</biblScope>
<date type="datePub">1996</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="en">constraint programming</term>
<term xml:lang="en">constraint logic programming</term>
<term xml:lang="en">finite domains</term>
<term xml:lang="en">implementation</term>
<term xml:lang="en">WAM</term>
</keywords>
<classCode scheme="halDomain" n="info.info-se">Computer Science/Software Engineering</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Rounding-based Moves for Metric Labeling</title>
<author role="aut">
<persName>
<forename type="first">M. Pawan</forename>
<surname>Kumar</surname>
</persName>
<email>pawan.kumar@ecp.fr</email>
<idno type="halauthor">804789</idno>
<affiliation ref="#struct-56046"/>
<affiliation ref="#struct-187174"/>
</author>
<editor role="depositor">
<persName>
<forename>M. Pawan</forename>
<surname>Kumar</surname>
</persName>
<email>pawan.kumar@ecp.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-09-30 10:57:46</date>
<date type="whenModified">2014-10-07 09:15:34</date>
<date type="whenReleased">2014-10-07 09:15:34</date>
<date type="whenProduced">2014</date>
<ref type="file" target="https://hal.inria.fr/hal-01069910/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="179268">
<persName>
<forename>M. Pawan</forename>
<surname>Kumar</surname>
</persName>
<email>pawan.kumar@ecp.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-01069910</idno>
<idno type="halUri">https://hal.inria.fr/hal-01069910</idno>
<idno type="halBibtex">kumar:hal-01069910</idno>
<idno type="halRefHtml"><i>NIPS - Advances in Neural Information Processing Systems</i>, 2014, Montreal, Canada</idno>
<idno type="halRef">NIPS - Advances in Neural Information Processing Systems, 2014, Montreal, Canada</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="EC-PARIS">Ecole Centrale Paris</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-SACLAY">INRIA Saclay - Ile de France</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Rounding-based Moves for Metric Labeling</title>
<author role="aut">
<persName>
<forename type="first">M. Pawan</forename>
<surname>Kumar</surname>
</persName>
<email>pawan.kumar@ecp.fr</email>
<idno type="halAuthorId">804789</idno>
<affiliation ref="#struct-56046"/>
<affiliation ref="#struct-187174"/>
</author>
</analytic>
<monogr>
<meeting>
<title>NIPS - Advances in Neural Information Processing Systems</title>
<date type="start">2014</date>
<settlement>Montreal</settlement>
<country key="CA">Canada</country>
</meeting>
<imprint>
<date type="datePub">2014</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-lg">Computer Science/Machine Learning</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Metric labeling is a special case of energy minimization for pairwise Markov random fields. The energy function consists of arbitrary unary potentials, and pairwise potentials that are proportional to a given metric distance function over the label set. Popular methods for solving metric labeling include (i) move-making algorithms, which iteratively solve a minimum st-cut problem; and (ii) the linear programming (LP) relaxation based approach. In order to convert the fractional solution of the LP relaxation to an integer solution, several randomized rounding procedures have been developed in the literature. We consider a large class of parallel rounding procedures, and design move-making algorithms that closely mimic them. We prove that the multiplicative bound of a move-making algorithm exactly matches the approximation factor of the corresponding rounding procedure for any arbitrary distance function. Our analysis includes all known results for move-making algorithms as special cases.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="fr">Adaptation d'un algorithme d'ordonnancement de tâches parallèles sur plates-formes homogènes aux systèmes hétérogènes</title>
<author role="aut">
<persName>
<forename type="first">Tchimou</forename>
<surname>N'Takpé</surname>
</persName>
<email>ntakpe@loria.fr</email>
<idno type="halauthor">62818</idno>
<affiliation ref="#struct-2346"/>
</author>
<editor role="depositor">
<persName>
<forename>Tchimou</forename>
<surname>N'Takpé</surname>
</persName>
<email>tchimou.ntakpe@loria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2005-10-13 16:57:18</date>
<date type="whenModified">2012-04-24 09:40:05</date>
<date type="whenReleased">2005-10-13 17:20:31</date>
<date type="whenProduced">2005</date>
<ref type="file" target="https://hal.inria.fr/inria-00000434/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="103512">
<persName>
<forename>Tchimou</forename>
<surname>N'Takpé</surname>
</persName>
<email>tchimou.ntakpe@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">inria-00000434</idno>
<idno type="halUri">https://hal.inria.fr/inria-00000434</idno>
<idno type="halBibtex">ntakpe:inria-00000434</idno>
<idno type="halRefHtml">Rapport de stage d'initiation à la recherche. 2005</idno>
<idno type="halRef">Rapport de stage d'initiation à la recherche. 2005</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="UNIV-NANCY1">Université Henri Poincaré - Nancy I</idno>
<idno type="stamp" n="UNIV-NANCY2">Université Nancy II</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-LORRAINE-LORIA-SET" p="LORIA">INRIA-LORRAINE LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-NSS" p="LORIA">Réseaux, systèmes et services</idno>
<idno type="stamp" n="GRID5000">Grid'5000</idno>
</seriesStmt>
<notesStmt>
<note type="description">Rapport de stage d'initiation à la recherche</note>
<note type="audience" n="0">Not set</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="fr">Adaptation d'un algorithme d'ordonnancement de tâches parallèles sur plates-formes homogènes aux systèmes hétérogènes</title>
<author role="aut">
<persName>
<forename type="first">Tchimou</forename>
<surname>N'Takpé</surname>
</persName>
<email>ntakpe@loria.fr</email>
<idno type="halAuthorId">62818</idno>
<affiliation ref="#struct-2346"/>
</author>
</analytic>
<monogr>
<imprint>
<date type="datePub">2005</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="fr">French</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-dc">Computer Science/Distributed, Parallel, and Cluster Computing</classCode>
<classCode scheme="halTypology" n="OTHER">Other publications</classCode>
</textClass>
<abstract xml:lang="fr">Ce stage d'initiation à la recherche nous a permis de concevoir et d'évaluer des algorithmes d'ordonnancement de tâches parallèles en milieu hétérogène en partant d'un algorithme adapté aux plates-formes homogènes. Après avoir réalisé de nombreuses simulations sur les deux algorithmes que nous avons mis en place, nous avons noté que cette adaptation aux systèmes hétérogènes permettait de tirer profit des agglomérations hétérogènes de grappes homogènes de ressources de calculs lors de l'exécution des grosses applications composées de tâches parallèles. La comparaison des performances de nos deux algorithmes avec celles d'un autre algorithme nous a également permis de conclure que notre approche permettait d'obtenir un meilleur compromis entre le temps de completion des applications et la puissance de calcul utilisée.</abstract>
<particDesc>
<org type="consortium">Grid'5000</org>
</particDesc>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Parallel local search for the Costas Array Problem</title>
<author role="aut">
<persName>
<forename type="first">Daniel</forename>
<surname>Diaz</surname>
</persName>
<email/>
<idno type="halauthor">681811</idno>
<affiliation ref="#struct-74131"/>
</author>
<author role="aut">
<persName>
<forename type="first">Florian</forename>
<surname>Richoux</surname>
</persName>
<email/>
<idno type="halauthor">509123</idno>
</author>
<author role="aut">
<persName>
<forename type="first">Yves</forename>
<surname>Caniou</surname>
</persName>
<email>caniou@loria.fr</email>
<idno type="halauthor">59335</idno>
<affiliation ref="#struct-35418"/>
</author>
<author role="aut">
<persName>
<forename type="first">Philippe</forename>
<surname>Codognet</surname>
</persName>
<email/>
<idno type="halauthor">102979</idno>
<affiliation ref="#struct-233"/>
</author>
<author role="aut">
<persName>
<forename type="first">Salvador</forename>
<surname>Abreu</surname>
</persName>
<email/>
<idno type="halauthor">685040</idno>
<affiliation ref="#struct-182104"/>
</author>
<editor role="depositor">
<persName>
<forename>Daniel</forename>
<surname>Diaz</surname>
</persName>
<email>Daniel.Diaz@univ-paris1.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2012-05-02 12:09:36</date>
<date type="whenWritten">2012</date>
<date type="whenModified">2012-05-02 12:09:36</date>
<date type="whenReleased">2012-05-02 12:09:36</date>
<date type="whenProduced">2012</date>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="167515">
<persName>
<forename>Daniel</forename>
<surname>Diaz</surname>
</persName>
<email>Daniel.Diaz@univ-paris1.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00693275</idno>
<idno type="halUri">https://hal-paris1.archives-ouvertes.fr/hal-00693275</idno>
<idno type="halBibtex">diaz:hal-00693275</idno>
<idno type="halRefHtml"><i>Parallel Computing and Optimization</i>, 2012, Shanghai, China</idno>
<idno type="halRef">Parallel Computing and Optimization, 2012, Shanghai, China</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="ENS-LYON">École Normale Supérieure de Lyon</idno>
<idno type="stamp" n="UNIV-PARIS1">Université Panthéon-Sorbonne - Paris I</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-LYON1">Université Claude Bernard - Lyon I</idno>
<idno type="stamp" n="LIP">Laboratoire de l'Informatique du Parallélisme</idno>
<idno type="stamp" n="CRI">Centre de Recherche en Informatique de Paris 1</idno>
<idno type="stamp" n="UPMC">Université Pierre et Marie Curie</idno>
<idno type="stamp" n="LIP6" p="UPMC">Laboratoire d'Informatique de Paris 6</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Parallel local search for the Costas Array Problem</title>
<author role="aut">
<persName>
<forename type="first">Daniel</forename>
<surname>Diaz</surname>
</persName>
<idno type="halAuthorId">681811</idno>
<affiliation ref="#struct-74131"/>
</author>
<author role="aut">
<persName>
<forename type="first">Florian</forename>
<surname>Richoux</surname>
</persName>
<idno type="halAuthorId">509123</idno>
</author>
<author role="aut">
<persName>
<forename type="first">Yves</forename>
<surname>Caniou</surname>
</persName>
<email>caniou@loria.fr</email>
<idno type="halAuthorId">59335</idno>
<affiliation ref="#struct-35418"/>
</author>
<author role="aut">
<persName>
<forename type="first">Philippe</forename>
<surname>Codognet</surname>
</persName>
<idno type="halAuthorId">102979</idno>
<affiliation ref="#struct-233"/>
</author>
<author role="aut">
<persName>
<forename type="first">Salvador</forename>
<surname>Abreu</surname>
</persName>
<idno type="halAuthorId">685040</idno>
<affiliation ref="#struct-182104"/>
</author>
</analytic>
<monogr>
<title level="m">Parallel Computing and Optimization</title>
<meeting>
<title>Parallel Computing and Optimization</title>
<date type="start">2012</date>
<settlement>Shanghai</settlement>
<country key="CN">China</country>
</meeting>
<imprint>
<date type="datePub">2012</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-se">Computer Science/Software Engineering</classCode>
<classCode scheme="halDomain" n="info.info-dc">Computer Science/Distributed, Parallel, and Cluster Computing</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="fr">Des ordinateurs capables de calculer plus juste</title>
<author role="aut">
<persName>
<forename type="first">Jean-Michel</forename>
<surname>Muller</surname>
</persName>
<email>jean-michel.muller@ens-lyon.fr</email>
<ptr type="url" target="http://perso.ens-lyon.fr/jean-michel.muller/"/>
<idno type="halauthor">662358</idno>
<affiliation ref="#struct-178327"/>
<affiliation ref="#struct-35418"/>
</author>
<author role="aut">
<persName>
<forename type="first">Sylvie</forename>
<surname>Boldo</surname>
</persName>
<email>sylvie.boldo@inria.fr</email>
<ptr type="url" target="http://www.lri.fr/~sboldo/"/>
<idno type="idhal">sboldo</idno>
<idno type="halauthor">739834</idno>
<idno type="Linkedin">http://www.linkedin.com/pub/sylvie.boldo</idno>
<affiliation ref="#struct-2544"/>
<affiliation ref="#struct-212219"/>
</author>
<editor role="depositor">
<persName>
<forename>Jean-Michel</forename>
<surname>Muller</surname>
</persName>
<email>jean-michel.muller@ens-lyon.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-09-29 17:02:56</date>
<date type="whenModified">2015-02-07 01:07:48</date>
<date type="whenReleased">2014-09-29 17:02:56</date>
<date type="whenProduced">2014-10</date>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="110251">
<persName>
<forename>Jean-Michel</forename>
<surname>Muller</surname>
</persName>
<email>jean-michel.muller@ens-lyon.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">ensl-01069744</idno>
<idno type="halUri">https://hal-ens-lyon.archives-ouvertes.fr/ensl-01069744</idno>
<idno type="halBibtex">muller:ensl-01069744</idno>
<idno type="halRefHtml"><i>La Recherche</i>, société d'éditions scientifiques, 2014, pp.46-53</idno>
<idno type="halRef">La Recherche, société d'éditions scientifiques, 2014, pp.46-53</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="ENS-LYON">École Normale Supérieure de Lyon</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-RHA">INRIA Grenoble - Rhône-Alpes</idno>
<idno type="stamp" n="LIP">Laboratoire de l'Informatique du Parallélisme</idno>
<idno type="stamp" n="UMR8623">Laboratoire de Recherche en Informatique</idno>
<idno type="stamp" n="INRIA-SACLAY">INRIA Saclay - Ile de France</idno>
<idno type="stamp" n="INRIA-MECSCI">Médiation Scientifique en Science du Numérique</idno>
</seriesStmt>
<notesStmt>
<note type="commentary">Article de vulgarisation</note>
<note type="audience" n="3">National</note>
<note type="popular" n="1">Yes</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="fr">Des ordinateurs capables de calculer plus juste</title>
<author role="aut">
<persName>
<forename type="first">Jean-Michel</forename>
<surname>Muller</surname>
</persName>
<email>jean-michel.muller@ens-lyon.fr</email>
<ptr type="url" target="http://perso.ens-lyon.fr/jean-michel.muller/"/>
<idno type="halAuthorId">662358</idno>
<affiliation ref="#struct-178327"/>
<affiliation ref="#struct-35418"/>
</author>
<author role="aut">
<persName>
<forename type="first">Sylvie</forename>
<surname>Boldo</surname>
</persName>
<email>sylvie.boldo@inria.fr</email>
<ptr type="url" target="http://www.lri.fr/~sboldo/"/>
<idno type="idHal">sboldo</idno>
<idno type="halAuthorId">739834</idno>
<idno type="Linkedin">http://www.linkedin.com/pub/sylvie.boldo</idno>
<affiliation ref="#struct-2544"/>
<affiliation ref="#struct-212219"/>
</author>
</analytic>
<monogr>
<idno type="halJournalId">20250</idno>
<title level="j">La Recherche</title>
<imprint>
<publisher>société d'éditions scientifiques</publisher>
<biblScope unit="pp">46-53</biblScope>
<date type="datePub">2014-10</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="fr">French</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-oh">Computer Science/Other</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="fr">Additionner 3 nombres quelconques sans erreur peut devenir mission impossible pour un ordinateur. Afin de pallier ce manque de fiabilité, les informaticiens inventent une nouvelle arithmétique. Indispensable pour construire un pont ou une aile d'avion.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">C3PO: a Spontaneous and Ephemeral Social Networking Framework for a collaborative Creation and Publishing of Multimedia Contents</title>
<author role="aut">
<persName>
<forename type="first">Frédérique</forename>
<surname>Laforest</surname>
</persName>
<email>frederique.laforest@telecom-st-etienne.fr</email>
<idno type="idhal">frederique-laforest</idno>
<idno type="halauthor">1002777</idno>
<affiliation ref="#struct-2003"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nicolas</forename>
<surname>Le Sommer</surname>
</persName>
<email/>
<idno type="halauthor">1079392</idno>
<affiliation ref="#struct-203131"/>
</author>
<author role="aut">
<persName>
<forename type="first">Stéphane</forename>
<surname>Frénot</surname>
</persName>
<email/>
<idno type="halauthor">99431</idno>
<affiliation ref="#struct-218317"/>
</author>
<author role="aut">
<persName>
<forename type="first">François</forename>
<surname>De Corbière</surname>
</persName>
<email>Francois.De-Corbiere@mines-nantes.fr</email>
<idno type="halauthor">987953</idno>
<orgName ref="#struct-84538"/>
<affiliation ref="#struct-95496"/>
<affiliation ref="#struct-84538"/>
</author>
<author role="aut">
<persName>
<forename type="first">Yves</forename>
<surname>Mahéo</surname>
</persName>
<email>yves.maheo@univ-ubs.fr</email>
<ptr type="url" target="http://people.irisa.fr/Yves.Maheo"/>
<idno type="halauthor">901280</idno>
<affiliation ref="#struct-203131"/>
</author>
<author role="aut">
<persName>
<forename type="first">Pascale</forename>
<surname>Launay</surname>
</persName>
<email>pascale.launay@univ-ubs.fr</email>
<idno type="halauthor">1079393</idno>
<affiliation ref="#struct-203131"/>
</author>
<author role="aut">
<persName>
<forename type="first">Christophe</forename>
<surname>GRAVIER</surname>
</persName>
<email/>
<idno type="halauthor">757307</idno>
<affiliation ref="#struct-184756"/>
</author>
<author role="aut">
<persName>
<forename type="first">Julien</forename>
<surname>Subercaze</surname>
</persName>
<email/>
<idno type="halauthor">393170</idno>
<affiliation ref="#struct-184756"/>
</author>
<author role="aut">
<persName>
<forename type="first">Damien</forename>
<surname>Reimert</surname>
</persName>
<email/>
<idno type="halauthor">701524</idno>
<affiliation ref="#struct-2377"/>
</author>
<author role="aut">
<persName>
<forename type="first">Etienne</forename>
<surname>Brodu</surname>
</persName>
<email/>
<idno type="halauthor">1079394</idno>
<affiliation ref="#struct-203831"/>
</author>
<author role="aut">
<persName>
<forename type="first">Idris</forename>
<surname>Daikh</surname>
</persName>
<email/>
<idno type="halauthor">1079395</idno>
<affiliation ref="#struct-203831"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nicolas</forename>
<surname>Phelippeau</surname>
</persName>
<email/>
<idno type="halauthor">1079396</idno>
<affiliation ref="#struct-267787"/>
</author>
<author role="aut">
<persName>
<forename type="first">Xavier</forename>
<surname>Adam</surname>
</persName>
<email/>
<idno type="halauthor">1079397</idno>
<affiliation ref="#struct-267787"/>
</author>
<author role="aut">
<persName>
<forename type="first">Frédéric</forename>
<surname>Guidec</surname>
</persName>
<email/>
<idno type="halauthor">101449</idno>
<affiliation ref="#struct-203131"/>
</author>
<author role="aut">
<persName>
<forename type="first">Stéphane</forename>
<surname>Grumbach</surname>
</persName>
<email/>
<idno type="idhal">sgrumbach</idno>
<idno type="halauthor">1079398</idno>
<affiliation ref="#struct-218317"/>
</author>
<editor role="depositor">
<persName>
<forename>Nicolas</forename>
<surname>Le Sommer</surname>
</persName>
<email>Nicolas.Le-Sommer@univ-ubs.fr</email>
</editor>
<funder ref="#projanr-26863"/>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-10-17 12:26:02</date>
<date type="whenWritten">2014-06-25</date>
<date type="whenModified">2014-12-19 01:19:04</date>
<date type="whenReleased">2014-10-17 15:50:12</date>
<date type="whenProduced">2014-09-08</date>
<ref type="file" target="https://hal.archives-ouvertes.fr/hal-01069778/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="112500">
<persName>
<forename>Nicolas</forename>
<surname>Le Sommer</surname>
</persName>
<email>Nicolas.Le-Sommer@univ-ubs.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-01069778</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-01069778</idno>
<idno type="halBibtex">laforest:hal-01069778</idno>
<idno type="halRefHtml"><i>International conference on selected topics in Mobile and Wireless Networking (MoWNet 2014)</i>, Sep 2014, Rome, Italy. Elsevier, pp.1-6, Procedia Computer Science</idno>
<idno type="halRef">International conference on selected topics in Mobile and Wireless Networking (MoWNet 2014), Sep 2014, Rome, Italy. Elsevier, pp.1-6, Procedia Computer Science</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="UNIV-ST-ETIENNE">Université Jean Monnet - Saint-Etienne</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-LYON2">Université Lumière Lyon 2</idno>
<idno type="stamp" n="INSA-LYON">Institut National des Sciences Appliquées de Lyon</idno>
<idno type="stamp" n="EC-LYON">Ecole Centrale de Lyon</idno>
<idno type="stamp" n="INRIA-RHA">INRIA Grenoble - Rhône-Alpes</idno>
<idno type="stamp" n="IRISA">Irisa</idno>
<idno type="stamp" n="LEMNA" p="UNIV-NANTES">Laboratoire d'Economie et de Management de Nantes-Atlantique</idno>
<idno type="stamp" n="UNIV-NANTES">Université de Nantes</idno>
<idno type="stamp" n="LIRIS">Laboratoire d'InfoRmatique en Image et Systèmes d'information</idno>
<idno type="stamp" n="IRISA_SET">IRISA_SET</idno>
<idno type="stamp" n="LIP">Laboratoire de l'Informatique du Parallélisme</idno>
<idno type="stamp" n="INRIA-MECSCI">Médiation Scientifique en Science du Numérique</idno>
<idno type="stamp" n="ENS-LYON">École Normale Supérieure de Lyon</idno>
<idno type="stamp" n="UNIV-LYON1">Université Claude Bernard - Lyon I</idno>
<idno type="stamp" n="UNIV-UBS">Université de Bretagne Sud</idno>
<idno type="stamp" n="SSG" p="MINES-NANTES">Département sciences sociales et de gestion</idno>
<idno type="stamp" n="INSTITUT-TELECOM">Institut Télécom</idno>
<idno type="stamp" n="UNAM">l'unam - université nantes angers le mans</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">C3PO: a Spontaneous and Ephemeral Social Networking Framework for a collaborative Creation and Publishing of Multimedia Contents</title>
<author role="aut">
<persName>
<forename type="first">Frédérique</forename>
<surname>Laforest</surname>
</persName>
<email>frederique.laforest@telecom-st-etienne.fr</email>
<idno type="idHal">frederique-laforest</idno>
<idno type="halAuthorId">1002777</idno>
<affiliation ref="#struct-2003"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nicolas</forename>
<surname>Le Sommer</surname>
</persName>
<idno type="halAuthorId">1079392</idno>
<affiliation ref="#struct-203131"/>
</author>
<author role="aut">
<persName>
<forename type="first">Stéphane</forename>
<surname>Frénot</surname>
</persName>
<idno type="halAuthorId">99431</idno>
<affiliation ref="#struct-218317"/>
</author>
<author role="aut">
<persName>
<forename type="first">François</forename>
<surname>De Corbière</surname>
</persName>
<email>Francois.De-Corbiere@mines-nantes.fr</email>
<idno type="halAuthorId">987953</idno>
<orgName ref="#struct-84538"/>
<affiliation ref="#struct-95496"/>
<affiliation ref="#struct-84538"/>
</author>
<author role="aut">
<persName>
<forename type="first">Yves</forename>
<surname>Mahéo</surname>
</persName>
<email>yves.maheo@univ-ubs.fr</email>
<ptr type="url" target="http://people.irisa.fr/Yves.Maheo"/>
<idno type="halAuthorId">901280</idno>
<affiliation ref="#struct-203131"/>
</author>
<author role="aut">
<persName>
<forename type="first">Pascale</forename>
<surname>Launay</surname>
</persName>
<email>pascale.launay@univ-ubs.fr</email>
<idno type="halAuthorId">1079393</idno>
<affiliation ref="#struct-203131"/>
</author>
<author role="aut">
<persName>
<forename type="first">Christophe</forename>
<surname>GRAVIER</surname>
</persName>
<idno type="halAuthorId">757307</idno>
<affiliation ref="#struct-184756"/>
</author>
<author role="aut">
<persName>
<forename type="first">Julien</forename>
<surname>Subercaze</surname>
</persName>
<idno type="halAuthorId">393170</idno>
<affiliation ref="#struct-184756"/>
</author>
<author role="aut">
<persName>
<forename type="first">Damien</forename>
<surname>Reimert</surname>
</persName>
<idno type="halAuthorId">701524</idno>
<affiliation ref="#struct-2377"/>
</author>
<author role="aut">
<persName>
<forename type="first">Etienne</forename>
<surname>Brodu</surname>
</persName>
<idno type="halAuthorId">1079394</idno>
<affiliation ref="#struct-203831"/>
</author>
<author role="aut">
<persName>
<forename type="first">Idris</forename>
<surname>Daikh</surname>
</persName>
<idno type="halAuthorId">1079395</idno>
<affiliation ref="#struct-203831"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nicolas</forename>
<surname>Phelippeau</surname>
</persName>
<idno type="halAuthorId">1079396</idno>
<affiliation ref="#struct-267787"/>
</author>
<author role="aut">
<persName>
<forename type="first">Xavier</forename>
<surname>Adam</surname>
</persName>
<idno type="halAuthorId">1079397</idno>
<affiliation ref="#struct-267787"/>
</author>
<author role="aut">
<persName>
<forename type="first">Frédéric</forename>
<surname>Guidec</surname>
</persName>
<idno type="halAuthorId">101449</idno>
<affiliation ref="#struct-203131"/>
</author>
<author role="aut">
<persName>
<forename type="first">Stéphane</forename>
<surname>Grumbach</surname>
</persName>
<idno type="idHal">sgrumbach</idno>
<idno type="halAuthorId">1079398</idno>
<affiliation ref="#struct-218317"/>
</author>
</analytic>
<monogr>
<idno type="halJournalId">62050</idno>
<title level="j">procedia computer science</title>
<title level="m">International conference on selected topics in Mobile and Wireless Networking (MoWNet 2014)</title>
<meeting>
<title>International conference on selected topics in Mobile and Wireless Networking (MoWNet 2014)</title>
<date type="start">2014-09-08</date>
<date type="end">2014-09-10</date>
<settlement>Rome</settlement>
<country key="IT">Italy</country>
</meeting>
<imprint>
<publisher>Elsevier</publisher>
<biblScope unit="serie">Procedia Computer Science</biblScope>
<biblScope unit="pp">1-6</biblScope>
<date type="datePub">2014-09-10</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="en">Social Networking</term>
<term xml:lang="en">Opportunistic Computing</term>
<term xml:lang="en">Collaborative Edition</term>
</keywords>
<classCode scheme="halDomain" n="info.info-iu">Computer Science/Ubiquitous Computing</classCode>
<classCode scheme="halDomain" n="info.info-mc">Computer Science/Mobile Computing</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Online social networks have been adopted by a large part of the population, and have become in few years essential communication means and a source of information for journalists. Nevertheless, these networks have some drawbacks that make people reluctant to use them, such as the impossibility to claim for ownership of data and to avoid commercial analysis of them, or the absence of collaborative tools to produce multimedia contents with a real editorial value. In this paper, we present a new kind of social networks, namely spontaneous and ephemeral social networks (SESNs). SESNs allow people to collaborate spontaneously in the production of multimedia documents so as to cover cultural and sport events.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Speech Cine SSFP with optical microphone synchronization and motion compensated reconstruction</title>
<author role="aut">
<persName>
<forename type="first">Pierre-André</forename>
<surname>Vuissoz</surname>
</persName>
<email/>
<idno type="halauthor">338492</idno>
<affiliation ref="#struct-81479"/>
</author>
<author role="aut">
<persName>
<forename type="first">Freddy</forename>
<surname>Odille</surname>
</persName>
<email/>
<idno type="halauthor">338491</idno>
<affiliation ref="#struct-81479"/>
</author>
<author role="aut">
<persName>
<forename type="first">Yves</forename>
<surname>Laprie</surname>
</persName>
<email>Yves.Laprie@loria.fr</email>
<idno type="halauthor">58846</idno>
<affiliation ref="#struct-205127"/>
</author>
<author role="aut">
<persName>
<forename type="first">Emmanuel</forename>
<surname>Vincent</surname>
</persName>
<email>emmanuel.vincent@inria.fr</email>
<idno type="idhal">emmanuelv</idno>
<idno type="halauthor">571022</idno>
<affiliation ref="#struct-205127"/>
</author>
<author role="aut">
<persName>
<forename type="first">Gabriela</forename>
<surname>Hossu</surname>
</persName>
<email/>
<idno type="halauthor">1025300</idno>
<affiliation ref="#struct-254586"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jacques</forename>
<surname>Felblinger</surname>
</persName>
<email>j.felblinger@chu-nancy.fr</email>
<idno type="halauthor">303875</idno>
<affiliation ref="#struct-81479"/>
</author>
<editor role="depositor">
<persName>
<forename>Emmanuel</forename>
<surname>Vincent</surname>
</persName>
<email>emmanuel.vincent@inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-05-21 15:56:30</date>
<date type="whenModified">2015-01-16 13:41:02</date>
<date type="whenReleased">2014-05-21 15:56:30</date>
<date type="whenProduced">2014-07-11</date>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="150572">
<persName>
<forename>Emmanuel</forename>
<surname>Vincent</surname>
</persName>
<email>emmanuel.vincent@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00994526</idno>
<idno type="halUri">https://hal.inria.fr/hal-00994526</idno>
<idno type="halBibtex">vuissoz:hal-00994526</idno>
<idno type="halRefHtml"><i>ISMRM Workshop on Motion Correction in MRI</i>, Jul 2014, Tromso, Norway</idno>
<idno type="halRef">ISMRM Workshop on Motion Correction in MRI, Jul 2014, Tromso, Norway</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-NANCY1">Université Henri Poincaré - Nancy I</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="INRIA-LORRAINE-LORIA-SET" p="LORIA">INRIA-LORRAINE LORIA</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-TALC" p="LORIA">Traitement automatique des langues et des connaissances</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="0">No</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Speech Cine SSFP with optical microphone synchronization and motion compensated reconstruction</title>
<author role="aut">
<persName>
<forename type="first">Pierre-André</forename>
<surname>Vuissoz</surname>
</persName>
<idno type="halAuthorId">338492</idno>
<affiliation ref="#struct-81479"/>
</author>
<author role="aut">
<persName>
<forename type="first">Freddy</forename>
<surname>Odille</surname>
</persName>
<idno type="halAuthorId">338491</idno>
<affiliation ref="#struct-81479"/>
</author>
<author role="aut">
<persName>
<forename type="first">Yves</forename>
<surname>Laprie</surname>
</persName>
<email>Yves.Laprie@loria.fr</email>
<idno type="halAuthorId">58846</idno>
<affiliation ref="#struct-205127"/>
</author>
<author role="aut">
<persName>
<forename type="first">Emmanuel</forename>
<surname>Vincent</surname>
</persName>
<email>emmanuel.vincent@inria.fr</email>
<idno type="idHal">emmanuelv</idno>
<idno type="halAuthorId">571022</idno>
<affiliation ref="#struct-205127"/>
</author>
<author role="aut">
<persName>
<forename type="first">Gabriela</forename>
<surname>Hossu</surname>
</persName>
<idno type="halAuthorId">1025300</idno>
<affiliation ref="#struct-254586"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jacques</forename>
<surname>Felblinger</surname>
</persName>
<email>j.felblinger@chu-nancy.fr</email>
<idno type="halAuthorId">303875</idno>
<affiliation ref="#struct-81479"/>
</author>
</analytic>
<monogr>
<meeting>
<title>ISMRM Workshop on Motion Correction in MRI</title>
<date type="start">2014-07-11</date>
<date type="end">2014-07-14</date>
<settlement>Tromso</settlement>
<country key="NO">Norway</country>
</meeting>
<imprint>
<date type="datePub">2014-05-20</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-ts">Computer Science/Signal and Image Processing</classCode>
<classCode scheme="halDomain" n="spi.signal">Engineering Sciences/Signal and Image processing</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Experimental Assessment of BitTorrent Completion Time in Heterogeneous TCP/uTP swarms</title>
<author role="aut">
<persName>
<forename type="first">Claudio</forename>
<surname>Testa</surname>
</persName>
<email/>
<idno type="halauthor">723461</idno>
<affiliation ref="#struct-162010"/>
<affiliation ref="#struct-160294"/>
</author>
<author role="aut">
<persName>
<forename type="first">D.</forename>
<surname>Rossi</surname>
</persName>
<email/>
<idno type="halauthor">699945</idno>
<affiliation ref="#struct-162010"/>
<affiliation ref="#struct-160294"/>
</author>
<author role="aut">
<persName>
<forename type="first">Ashwin</forename>
<surname>Rao</surname>
</persName>
<email/>
<idno type="halauthor">723462</idno>
<affiliation ref="#struct-2491"/>
</author>
<author role="aut">
<persName>
<forename type="first">Arnaud</forename>
<surname>Legout</surname>
</persName>
<email/>
<idno type="halauthor">339655</idno>
<affiliation ref="#struct-2491"/>
</author>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2013-03-01 00:16:09</date>
<date type="whenModified">2013-03-26 10:53:23</date>
<date type="whenReleased">2013-03-01 00:16:14</date>
<date type="whenProduced">2012-03</date>
</edition>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00795818</idno>
<idno type="halUri">https://hal-institut-mines-telecom.archives-ouvertes.fr/hal-00795818</idno>
<idno type="halBibtex">testa:hal-00795818</idno>
<idno type="halRefHtml"><i>Traffic Measurement and Analysis (TMA) Workshop at Passive and Active Measurement (PAM)</i>, Mar 2012, Wien, Australia. pp.52-65</idno>
<idno type="halRef">Traffic Measurement and Analysis (TMA) Workshop at Passive and Active Measurement (PAM), Mar 2012, Wien, Australia. pp.52-65</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="ENST">Ecole Nationale Supérieure des Télécommunications</idno>
<idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
<idno type="stamp" n="TELECOM-PARISTECH" p="INSTITUT-TELECOM">Télécom ParisTech</idno>
<idno type="stamp" n="INSTITUT-TELECOM">Institut Télécom</idno>
<idno type="stamp" n="PARISTECH">ParisTech</idno>
<idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
<idno type="stamp" n="UPMC">Université Pierre et Marie Curie</idno>
<idno type="stamp" n="INRIA-RHA">INRIA Grenoble - Rhône-Alpes</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Experimental Assessment of BitTorrent Completion Time in Heterogeneous TCP/uTP swarms</title>
<author role="aut">
<persName>
<forename type="first">Claudio</forename>
<surname>Testa</surname>
</persName>
<idno type="halAuthorId">723461</idno>
<affiliation ref="#struct-162010"/>
<affiliation ref="#struct-160294"/>
</author>
<author role="aut">
<persName>
<forename type="first">D.</forename>
<surname>Rossi</surname>
</persName>
<idno type="halAuthorId">699945</idno>
<affiliation ref="#struct-162010"/>
<affiliation ref="#struct-160294"/>
</author>
<author role="aut">
<persName>
<forename type="first">Ashwin</forename>
<surname>Rao</surname>
</persName>
<idno type="halAuthorId">723462</idno>
<affiliation ref="#struct-2491"/>
</author>
<author role="aut">
<persName>
<forename type="first">Arnaud</forename>
<surname>Legout</surname>
</persName>
<idno type="halAuthorId">339655</idno>
<affiliation ref="#struct-2491"/>
</author>
</analytic>
<monogr>
<idno type="localRef">DR:TMA-12</idno>
<title level="m">Traffic Measurement and Analysis (TMA) Workshop at Passive and Active Measurement (PAM)</title>
<meeting>
<title>Traffic Measurement and Analysis (TMA) Workshop at Passive and Active Measurement (PAM)</title>
<date type="start">2012-03</date>
<settlement>Wien</settlement>
<country key="AU">Australia</country>
</meeting>
<imprint>
<biblScope unit="pp">52-65</biblScope>
<date type="datePub">2012-03</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="it">p2p</term>
<term xml:lang="it">bittorrent</term>
<term xml:lang="it">ledbat</term>
</keywords>
<classCode scheme="halDomain" n="info.info-ni">Computer Science/Networking and Internet Architecture</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en"><p>{BitTorrent, one of the most widespread used P2P application for file- sharing, recently got rid of TCP by introducing an application-level congestion control protocol named uTP. The aim of this new protocol is to efficiently use the available link capacity, while minimizing its interference with the rest of user traffic (e.g., Web, VoIP and gaming) sharing the same access bottleneck. In this paper we perform an experimental study of the impact of uTP on the torrent completion time, the metric that better captures the user experience. We run BitTorrent applications in a flash crowd scenario over a dedicated cluster platform, under both homogeneous and heterogeneous swarm population. Exper- iments show that an all-uTP swarms have shorter torrent download time with respect to all-TCP swarms. Interestingly, at the same time, we observe that even shorter completion times can be achieved under mixtures of TCP and uTP traffic, as in the default BitTorrent settings.</p></abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="it">Non-commutative Elimination in Ore Algebras Proves Multivariate Identities</title>
<author role="aut">
<persName>
<forename type="first">Frédéric</forename>
<surname>Chyzak</surname>
</persName>
<email>frederic.chyzak@inria.fr</email>
<ptr type="url" target="http://algo.inria.fr/chyzak/"/>
<idno type="halauthor">811862</idno>
<affiliation ref="#struct-54378"/>
</author>
<author role="aut">
<persName>
<forename type="first">Bruno</forename>
<surname>Salvy</surname>
</persName>
<email>Bruno.Salvy@inria.fr</email>
<ptr type="url" target="http://perso.ens-lyon.fr/bruno.salvy/"/>
<idno type="halauthor">1079459</idno>
<affiliation ref="#struct-54378"/>
</author>
<editor role="depositor">
<persName>
<forename>Frédéric</forename>
<surname>Chyzak</surname>
</persName>
<email>frederic.chyzak@inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-09-30 09:16:15</date>
<date type="whenModified">2014-10-07 09:11:19</date>
<date type="whenReleased">2014-10-07 09:11:19</date>
<date type="whenProduced">1998</date>
<ref type="file" target="https://hal.inria.fr/hal-01069833/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="110517">
<persName>
<forename>Frédéric</forename>
<surname>Chyzak</surname>
</persName>
<email>frederic.chyzak@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-01069833</idno>
<idno type="halUri">https://hal.inria.fr/hal-01069833</idno>
<idno type="halBibtex">chyzak:hal-01069833</idno>
<idno type="halRefHtml"><i>Journal of Symbolic Computation</i>, Elsevier, 1998, 26 (2), pp.187-227</idno>
<idno type="halRef">Journal of Symbolic Computation, Elsevier, 1998, 26 (2), pp.187-227</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="it">Non-commutative Elimination in Ore Algebras Proves Multivariate Identities</title>
<author role="aut">
<persName>
<forename type="first">Frédéric</forename>
<surname>Chyzak</surname>
</persName>
<email>frederic.chyzak@inria.fr</email>
<ptr type="url" target="http://algo.inria.fr/chyzak/"/>
<idno type="halAuthorId">811862</idno>
<affiliation ref="#struct-54378"/>
</author>
<author role="aut">
<persName>
<forename type="first">Bruno</forename>
<surname>Salvy</surname>
</persName>
<email>Bruno.Salvy@inria.fr</email>
<ptr type="url" target="http://perso.ens-lyon.fr/bruno.salvy/"/>
<idno type="halAuthorId">1079459</idno>
<affiliation ref="#struct-54378"/>
</author>
</analytic>
<monogr>
<idno type="halJournalId">16278</idno>
<idno type="issn">0747-7171</idno>
<idno type="eissn">1095-855X</idno>
<title level="j">Journal of Symbolic Computation</title>
<imprint>
<publisher>Elsevier</publisher>
<biblScope unit="volume">26</biblScope>
<biblScope unit="issue">2</biblScope>
<biblScope unit="pp">187-227</biblScope>
<date type="datePub">1998</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-sc">Computer Science/Symbolic Computation</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">Many computations involving special functions, combinatorial sequences or their $q$-analogues can be performed using linear operators and simple arguments on the dimension of related vector spaces. In this article, we develop a theory of~$\partial$-finite sequences and functions which provides a unified framework to express algorithms for computing sums and integrals and for the proof or discovery of multivariate identities. This approach is vindicated by an implementation.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">A hybrid approach to managing job offers and candidates</title>
<author role="aut">
<persName>
<forename type="first">Rémy</forename>
<surname>Kessler</surname>
</persName>
<email/>
<idno type="halauthor">465141</idno>
<affiliation ref="#struct-100376"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nicolas</forename>
<surname>Béchet</surname>
</persName>
<email>nicolas.bechet@lirmm.fr</email>
<ptr type="url" target="http://www.lirmm.fr/~bechet"/>
<idno type="halauthor">832691</idno>
<affiliation ref="#struct-2446"/>
</author>
<author role="aut">
<persName>
<forename type="first">Mathieu</forename>
<surname>Roche</surname>
</persName>
<email>Mathieu.Roche@lirmm.fr</email>
<ptr type="url" target="http://www.lirmm.fr/~mroche"/>
<idno type="halauthor">831908</idno>
<affiliation ref="#struct-392245"/>
</author>
<author role="aut">
<persName>
<forename type="first">Juan-Manuel</forename>
<surname>Torres-Moreno</surname>
</persName>
<email/>
<idno type="halauthor">412600</idno>
<affiliation ref="#struct-57241"/>
</author>
<author role="aut">
<persName>
<forename type="first">Marc</forename>
<surname>El-Bèze</surname>
</persName>
<email/>
<idno type="halauthor">131939</idno>
<affiliation ref="#struct-100376"/>
</author>
<editor role="depositor">
<persName>
<forename>Mathieu</forename>
<surname>Roche</surname>
</persName>
<email>mroche@lirmm.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2012-05-02 10:26:16</date>
<date type="whenModified">2015-02-06 15:16:17</date>
<date type="whenReleased">2012-05-02 10:51:29</date>
<date type="whenProduced">2012-04-10</date>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="114352">
<persName>
<forename>Mathieu</forename>
<surname>Roche</surname>
</persName>
<email>mroche@lirmm.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">lirmm-00693181</idno>
<idno type="halUri">http://hal-lirmm.ccsd.cnrs.fr/lirmm-00693181</idno>
<idno type="halBibtex">kessler:lirmm-00693181</idno>
<idno type="halRefHtml"><i>Information Processing and Management</i>, Elsevier, 2012, 48 (6), pp.1124-1135. <a target="_blank" href="http://www.sciencedirect.com/science/article/pii/S0306457312000416">&lt;http://www.sciencedirect.com/science/article/pii/S0306457312000416&gt;</a>. <a target="_blank" href="http://dx.doi.org/10.1016/j.ipm.2012.03.002">&lt;10.1016/j.ipm.2012.03.002&gt;</a></idno>
<idno type="halRef">Information Processing and Management, Elsevier, 2012, 48 (6), pp.1124-1135. &lt;http://www.sciencedirect.com/science/article/pii/S0306457312000416&gt;. &lt;10.1016/j.ipm.2012.03.002&gt;</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="UNIV-AVIGNON">Université d'Avignon</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
<idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
<idno type="stamp" n="TAMP_LIRMM_DOI">LIRMM</idno>
<idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
<idno type="stamp" n="INRIA-MECSCI">Médiation Scientifique en Science du Numérique</idno>
<idno type="stamp" n="TEXTE">Exploration et Exploitation de Données Textuelles</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">A hybrid approach to managing job offers and candidates</title>
<author role="aut">
<persName>
<forename type="first">Rémy</forename>
<surname>Kessler</surname>
</persName>
<idno type="halAuthorId">465141</idno>
<affiliation ref="#struct-100376"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nicolas</forename>
<surname>Béchet</surname>
</persName>
<email>nicolas.bechet@lirmm.fr</email>
<ptr type="url" target="http://www.lirmm.fr/~bechet"/>
<idno type="halAuthorId">832691</idno>
<affiliation ref="#struct-2446"/>
</author>
<author role="aut">
<persName>
<forename type="first">Mathieu</forename>
<surname>Roche</surname>
</persName>
<email>Mathieu.Roche@lirmm.fr</email>
<ptr type="url" target="http://www.lirmm.fr/~mroche"/>
<idno type="halAuthorId">831908</idno>
<affiliation ref="#struct-392245"/>
</author>
<author role="aut">
<persName>
<forename type="first">Juan-Manuel</forename>
<surname>Torres-Moreno</surname>
</persName>
<idno type="halAuthorId">412600</idno>
<affiliation ref="#struct-57241"/>
</author>
<author role="aut">
<persName>
<forename type="first">Marc</forename>
<surname>El-Bèze</surname>
</persName>
<idno type="halAuthorId">131939</idno>
<affiliation ref="#struct-100376"/>
</author>
</analytic>
<monogr>
<idno type="halJournalId">5497</idno>
<idno type="issn">0306-4573</idno>
<title level="j">Information Processing and Management</title>
<imprint>
<publisher>Elsevier</publisher>
<biblScope unit="volume">48</biblScope>
<biblScope unit="issue">6</biblScope>
<biblScope unit="pp">1124-1135</biblScope>
<date type="datePub">2012-04-10</date>
</imprint>
</monogr>
<idno type="doi">10.1016/j.ipm.2012.03.002</idno>
<ref type="publisher">http://www.sciencedirect.com/science/article/pii/S0306457312000416</ref>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="spi.other">Engineering Sciences/Other</classCode>
<classCode scheme="halDomain" n="info.info-tt">Computer Science/Document and Text Processing</classCode>
<classCode scheme="halDomain" n="info.info-ir">Computer Science/Information Retrieval</classCode>
<classCode scheme="halDomain" n="info.info-ai">Computer Science/Artificial Intelligence</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">The evolution of the job market has resulted in traditional methods of recruitment becoming insufficient. As it is now necessary to handle volumes of information (mostly in the form of free text) that are impossible to process manually, an analysis and assisted categorization are essential to address this issue. In this paper, we present a combination of the E-Gen and Cortex systems. E-Gen aims to perform analysis and categorization of job offers together with the responses given by the candidates. E-Gen system strategy is based on vectorial and probabilistic models to solve the problem of profiling applications according to a specific job offer. Cortex is a statistical automatic summarization system. In this work, E-Gen uses Cortex as a powerful filter to eliminate irrelevant information contained in candidate answers. Our main objective is to develop a system to assist a recruitment consultant and the results obtained by the proposed combination surpass those of E-Gen in standalone mode on this task.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Writing a Reproducible Article</title>
<author role="crp">
<persName>
<forename type="first">Luka</forename>
<surname>Stanisic</surname>
</persName>
<email>luka.stanisic@imag.fr</email>
<idno type="halauthor">1028566</idno>
<orgName ref="#struct-51016"/>
<affiliation ref="#struct-37506"/>
<affiliation ref="#struct-24471"/>
</author>
<author role="aut">
<persName>
<forename type="first">Arnaud</forename>
<surname>Legrand</surname>
</persName>
<email>Arnaud.Legrand@imag.fr</email>
<idno type="halauthor">98005</idno>
<orgName ref="#struct-364074"/>
<affiliation ref="#struct-37506"/>
<affiliation ref="#struct-24471"/>
</author>
<editor role="depositor">
<persName>
<forename>Luka</forename>
<surname>Stanisic</surname>
</persName>
<email>luka.stanisic@imag.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-05-21 16:49:05</date>
<date type="whenModified">2014-11-08 01:14:40</date>
<date type="whenReleased">2014-05-27 10:03:53</date>
<date type="whenProduced">2014-04-22</date>
<ref type="file" target="https://hal.inria.fr/hal-00994575/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="193197">
<persName>
<forename>Luka</forename>
<surname>Stanisic</surname>
</persName>
<email>luka.stanisic@imag.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00994575</idno>
<idno type="halUri">https://hal.inria.fr/hal-00994575</idno>
<idno type="halBibtex">stanisic:hal-00994575</idno>
<idno type="halRefHtml">Pascal Felber; Laurent Philippe; Etienne Riviere; Arnaud Tisserand. <i>ComPAS 2014 : conférence en parallélisme, architecture et systèmes</i>, Apr 2014, Neuchâtel, Switzerland</idno>
<idno type="halRef">Pascal Felber; Laurent Philippe; Etienne Riviere; Arnaud Tisserand. ComPAS 2014 : conférence en parallélisme, architecture et systèmes, Apr 2014, Neuchâtel, Switzerland</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="INPG" p="UGA">Institut polytechnique de Grenoble</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-GRENOBLE1" p="UGA">Université Joseph Fourier - Grenoble I</idno>
<idno type="stamp" n="UGA">HAL Grenoble Alpes</idno>
<idno type="stamp" n="UNIV-PMF_GRENOBLE" p="UGA">Université Pierre-Mendès-France - Grenoble II</idno>
<idno type="stamp" n="INRIA-RHA">INRIA Grenoble - Rhône-Alpes</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="LIG" p="UGA">Laboratoire d'Informatique de Grenoble</idno>
<idno type="stamp" n="INRIA-MECSCI">Médiation Scientifique en Science du Numérique</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="1">Yes</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Writing a Reproducible Article</title>
<author role="crp">
<persName>
<forename type="first">Luka</forename>
<surname>Stanisic</surname>
</persName>
<email>luka.stanisic@imag.fr</email>
<idno type="halAuthorId">1028566</idno>
<orgName ref="#struct-51016"/>
<affiliation ref="#struct-37506"/>
<affiliation ref="#struct-24471"/>
</author>
<author role="aut">
<persName>
<forename type="first">Arnaud</forename>
<surname>Legrand</surname>
</persName>
<email>Arnaud.Legrand@imag.fr</email>
<idno type="halAuthorId">98005</idno>
<orgName ref="#struct-364074"/>
<affiliation ref="#struct-37506"/>
<affiliation ref="#struct-24471"/>
</author>
</analytic>
<monogr>
<meeting>
<title>ComPAS 2014 : conférence en parallélisme, architecture et systèmes</title>
<date type="start">2014-04-22</date>
<date type="end">2014-04-25</date>
<settlement>Neuchâtel</settlement>
<country key="CH">Switzerland</country>
</meeting>
<editor>Pascal Felber</editor>
<editor>Laurent Philippe</editor>
<editor>Etienne Riviere</editor>
<editor>Arnaud Tisserand</editor>
<imprint>
<date type="datePub">2014-04-22</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="en">Reproducible Research</term>
<term xml:lang="en">Open Science</term>
</keywords>
<classCode scheme="halDomain" n="info.info-oh">Computer Science/Other</classCode>
<classCode scheme="halTypology" n="PRESCONF">Documents associated with scientific events</classCode>
</textClass>
<abstract xml:lang="fr">Nous avons récemment soumis à Europar notre premier article dont l'analyse est reproductible de bout en bout. L'objectif de cette intervention est d'expliquer comment nous avons procédé et de discuter sur la généralisation possible de cette approche à d'autres cas d'étude. Cet article porte sur la validation d'un modèle permettant de simuler StarPU, un runtime à base de tâches pour architectures hybrides, à l'aide de SimGrid. Pour valider ce modèle, un nombre conséquent d'expériences sur des architectures variées a du être réalisé. L'ensemble des traces des exécutions réalisées sur ces différentes plates-formes ainsi que l'ensemble des informations sur leur provenance et nécessaires à leur réalisation (versions des codes, type de machine, OS, options de compilation, ...) ont été consignées systématiquement grâce à une utilisation combinée de git et d'org-mode dans l'équivalent d'un cahier de laboratoire. Il a alors été très simple de rédiger un article sur le même principe. Concrètement, les traces ont été migrées sur figshare et les sources du document contiennent l'intégralité des scripts nécessaires à la réalisation de l'analyse. La compilation du document commence par télécharger l'ensemble des traces en local avant d'en extraire les informations importantes pour l'analyse et de générer les courbes figurant dans l'article. Il devient donc possible pour quiconque de partir d'un graphique et de remonter jusqu'aux informations sur les conditions expérimentales sous-jacentes.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Design and Implementation of Lattice-Based Cryptography</title>
<title xml:lang="fr">Conception and implémentation de cryptographie à base de réseaux</title>
<author role="aut">
<persName>
<forename type="first">Tancrède</forename>
<surname>Lepoint</surname>
</persName>
<email>tancrede.lepoint@ens.fr</email>
<idno type="halauthor">890290</idno>
<affiliation ref="#struct-59704"/>
<affiliation ref="#struct-54531"/>
<affiliation ref="#struct-188786"/>
<affiliation ref="#struct-221841"/>
</author>
<editor role="depositor">
<persName>
<forename>Tancrède</forename>
<surname>Lepoint</surname>
</persName>
<email>tancrede.lepoint@ens.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-09-30 09:51:08</date>
<date type="whenModified">2014-10-07 11:42:32</date>
<date type="whenReleased">2014-10-07 11:42:32</date>
<date type="whenProduced">2014-06-30</date>
<ref type="file" target="https://tel.archives-ouvertes.fr/tel-01069864/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="186711">
<persName>
<forename>Tancrède</forename>
<surname>Lepoint</surname>
</persName>
<email>tancrede.lepoint@ens.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">tel-01069864</idno>
<idno type="halUri">https://tel.archives-ouvertes.fr/tel-01069864</idno>
<idno type="halBibtex">lepoint:tel-01069864</idno>
<idno type="halRefHtml">Cryptography and Security. Ecole Normale Supérieure de Paris - ENS Paris, 2014. English</idno>
<idno type="halRef">Cryptography and Security. Ecole Normale Supérieure de Paris - ENS Paris, 2014. English</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-ROCQ">INRIA Paris - Rocquencourt</idno>
<idno type="stamp" n="THESES-ENS" p="ENS-PARIS">Thèses ENS</idno>
<idno type="stamp" n="ENS-PARIS">Ecole Normale Supérieure de Paris</idno>
</seriesStmt>
<notesStmt/>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Design and Implementation of Lattice-Based Cryptography</title>
<title xml:lang="fr">Conception and implémentation de cryptographie à base de réseaux</title>
<author role="aut">
<persName>
<forename type="first">Tancrède</forename>
<surname>Lepoint</surname>
</persName>
<email>tancrede.lepoint@ens.fr</email>
<idno type="halAuthorId">890290</idno>
<affiliation ref="#struct-59704"/>
<affiliation ref="#struct-54531"/>
<affiliation ref="#struct-188786"/>
<affiliation ref="#struct-221841"/>
</author>
</analytic>
<monogr>
<imprint>
<date type="dateDefended">2014-06-30</date>
</imprint>
<authority type="institution">Ecole Normale Supérieure de Paris - ENS Paris</authority>
<authority type="supervisor">David Pointcheval, Jean-Sébastien Coron</authority>
</monogr>
<ref type="seeAlso">https://www.cryptoexperts.com/tlepoint/thesis/lepoint-phd-thesis-print.pdf</ref>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="en">public key cryptography</term>
<term xml:lang="en">lattices</term>
<term xml:lang="en">digital signature</term>
<term xml:lang="en">fully homomorphic encryption</term>
<term xml:lang="en">multilinear maps</term>
<term xml:lang="fr">cryptographie à clé publique</term>
<term xml:lang="fr">réseaux euclidiens</term>
<term xml:lang="fr">signature numérique</term>
<term xml:lang="fr">chiffrement homomorphe</term>
<term xml:lang="fr">applications multilinéaires</term>
<term xml:lang="fr">implémentation</term>
</keywords>
<classCode scheme="halDomain" n="info.info-cr">Computer Science/Cryptography and Security</classCode>
<classCode scheme="halTypology" n="THESE">Theses</classCode>
</textClass>
<abstract xml:lang="en">Today, lattice-based cryptography is a thriving scientific field. Its swift expansion is due, among others, to the attractiveness of fully homomorphic encryption and cryptographic multilinear maps. Lattice-based cryptography has also been recognized for its thrilling properties: a security that can be reduced to worst-case instances of problems over lattices, a quasi-optimal asymptotic efficiency and an alleged resistance to quantum computers. However, its practical use in real-world products leaves a lot to be desired. This thesis accomplishes a step towards this goal by narrowing the gap between theoretical research and practical implementation of recent public key cryptosystems. In this thesis, we design and implement a lattice-based digital signature, two fully homomorphic encryption schemes and cryptographic multilinear maps. Our highly efficient signature scheme, BLISS, opened the way to implementing lattice-based cryptography on constrained devices and remains as of today a promising primitive for post-quantum cryptography. Our fully homomorphic encryption schemes enjoy competitive homomorphic evaluations of nontrivial circuits. Finally, we describe the first implementation of cryptographic multilinear maps. Based on our implementation, a non interactive key exchange between more than three parties has been realized for the first time, and amounts to a few seconds per party.</abstract>
<abstract xml:lang="fr">La cryptographie à base de réseaux euclidiens est aujourd'hui un domaine scientifique en pleine expansion et connait une évolution rapide et accélérée par l'attractivité du chiffrement complètement homomorphe ou des applications multilinéaires cryptographiques. Ses propriétés sont très attractives : une sécurité pouvant être réduite à la difficulté des pires cas de problèmes sur les réseaux euclidiens, une efficacité asymptotique quasi-optimale et une résistance présupposée aux ordinateurs quantiques. Cependant, on dénombre encore peu de résultats de recherche sur les constructions à visée pratique pour un niveau de sécurité fixé. Cette thèse s'inscrit dans cette direction et travaille à réduire l'écart entre la théorie et la pratique de la cryptographie à clé publique récente. Dans cette thèse, nous concevons et implémentons une signature numérique basée sur les réseaux euclidiens, deux schémas de chiffrement complètement homomorphe et des applications multilinéaires cryptographiques. Notre signature digitale ultra-performante, BLISS, ouvre la voie à la mise en pratique de la cryptographie à base de réseaux sur petites architectures et est un candidat sérieux à la cryptographie post-quantique. Nos schémas de chiffrement complètement homomorphes permettent d'évaluer des circuits non triviaux de manière compétitive. Finalement, nous proposons la première implémentation d'applications multilinéaires et réalisons, pour la première fois, un échange de clé non interactif entre plus de trois participants en quelques secondes.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Model Based Testing for Concurrent Systems with Labeled Event Structures</title>
<author role="aut">
<persName>
<forename type="first">Hernán</forename>
<surname>Ponce De León</surname>
</persName>
<email/>
<idno type="halauthor">806219</idno>
<affiliation ref="#struct-2571"/>
<affiliation ref="#struct-157663"/>
</author>
<author role="aut">
<persName>
<forename type="first">Stefan</forename>
<surname>Haar</surname>
</persName>
<email>Stefan.Haar@inria.fr</email>
<ptr type="url" target="http://www.lsv.ens-cachan.fr/~haar/"/>
<idno type="halauthor">822868</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-2571"/>
<affiliation ref="#struct-157663"/>
</author>
<author role="aut">
<persName>
<forename type="first">Delphine</forename>
<surname>Longuet</surname>
</persName>
<email/>
<ptr type="url" target="https://www.lri.fr/~longuet/"/>
<idno type="halauthor">822869</idno>
<orgName ref="#struct-92966"/>
<affiliation ref="#struct-392183"/>
</author>
<editor role="depositor">
<persName>
<forename>Stefan</forename>
<surname>Haar</surname>
</persName>
<email>Stefan.Haar@inria.fr</email>
</editor>
<funder>Digiteo TECSTES</funder>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2013-03-01 14:31:26</date>
<date type="whenModified">2014-10-28 18:55:18</date>
<date type="whenReleased">2013-03-01 14:32:58</date>
<date type="whenProduced">2013-03-01</date>
<ref type="file" target="https://hal.inria.fr/hal-00796006/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="140518">
<persName>
<forename>Stefan</forename>
<surname>Haar</surname>
</persName>
<email>Stefan.Haar@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00796006</idno>
<idno type="halUri">https://hal.inria.fr/hal-00796006</idno>
<idno type="halBibtex">poncedeleon:hal-00796006</idno>
<idno type="halRefHtml">Submitted to a journal. 2013</idno>
<idno type="halRef">Submitted to a journal. 2013</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-SACLAY">INRIA Saclay - Ile de France</idno>
<idno type="stamp" n="UMR8623">Laboratoire de Recherche en Informatique</idno>
<idno type="stamp" n="INRIA-MECSCI">Médiation Scientifique en Science du Numérique</idno>
<idno type="stamp" n="ENS-CACHAN">Ecole Normale Supérieure de Cachan</idno>
</seriesStmt>
<notesStmt>
<note type="commentary">Submitted to a journal.</note>
<note type="audience" n="1">Not set</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Model Based Testing for Concurrent Systems with Labeled Event Structures</title>
<author role="aut">
<persName>
<forename type="first">Hernán</forename>
<surname>Ponce De León</surname>
</persName>
<idno type="halAuthorId">806219</idno>
<affiliation ref="#struct-2571"/>
<affiliation ref="#struct-157663"/>
</author>
<author role="aut">
<persName>
<forename type="first">Stefan</forename>
<surname>Haar</surname>
</persName>
<email>Stefan.Haar@inria.fr</email>
<ptr type="url" target="http://www.lsv.ens-cachan.fr/~haar/"/>
<idno type="halAuthorId">822868</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-2571"/>
<affiliation ref="#struct-157663"/>
</author>
<author role="aut">
<persName>
<forename type="first">Delphine</forename>
<surname>Longuet</surname>
</persName>
<ptr type="url" target="https://www.lri.fr/~longuet/"/>
<idno type="halAuthorId">822869</idno>
<orgName ref="#struct-92966"/>
<affiliation ref="#struct-392183"/>
</author>
</analytic>
<monogr>
<imprint/>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="acm" n="D.2.5"/>
<classCode scheme="halDomain" n="info.info-oh">Computer Science/Other</classCode>
<classCode scheme="halTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
</textClass>
<abstract xml:lang="en">Abstract. We propose a theoretical testing framework and a test generation algorithm for concurrent systems that are speci ed with true concurrency models, such as Petri nets or networks of automata. The semantic model of computation of such formalisms are labeled event structures, which allow to represent concurrency explicitly. The activity of testing relies on the de nition of a conformance relation that depends on the observable behaviors on the system under test. The ioco type conformance relations for sequential systems rely on the observation of sequences of inputs and outputs and blockings. However these relations are not capable of capturing and exploiting concurrency of non sequential behavior. We propose an extension of the ioco conformance relation for labeled event structures, named co-ioco, which allows to deal with explicit concurrency. We give an algorithm to build test cases from a given speci cation and prove that the generated test suite is complete for co-ioco.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="fr">Analyses linguistiques et techniques d'alignement pour créer et enrichir une ontologie topographique</title>
<author role="aut">
<persName>
<forename type="first">Mustière</forename>
<surname>Sébastien</surname>
</persName>
<email>Sebastien.Mustiere@ign.fr</email>
<idno type="halauthor">611564</idno>
<orgName ref="#struct-300101"/>
<affiliation ref="#struct-30598"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nathalie</forename>
<surname>Abadie</surname>
</persName>
<email>Nathalie-F.Abadie@ign.fr</email>
<idno type="halauthor">611565</idno>
<orgName ref="#struct-300101"/>
<affiliation ref="#struct-30598"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nathalie</forename>
<surname>Aussenac- Gilles</surname>
</persName>
<email>aussenac@irit.fr</email>
<idno type="idhal">nathalie-aussenac-gilles</idno>
<idno type="halauthor">611566</idno>
<orgName ref="#struct-217752"/>
<affiliation ref="#struct-34499"/>
</author>
<author role="aut">
<persName>
<forename type="first">Marie-Noëlle</forename>
<surname>Bessagnet</surname>
</persName>
<email/>
<idno type="halauthor">611567</idno>
<orgName ref="#struct-301085"/>
<affiliation ref="#struct-29209"/>
</author>
<author role="aut">
<persName>
<forename type="first">Mouna</forename>
<surname>Kamel</surname>
</persName>
<email>kamel@irit.fr</email>
<idno type="halauthor">398764</idno>
<affiliation ref="#struct-34499"/>
</author>
<author role="aut">
<persName>
<forename type="first">Eric</forename>
<surname>Kergosien</surname>
</persName>
<email/>
<idno type="halauthor">611568</idno>
<orgName ref="#struct-301085"/>
<affiliation ref="#struct-29209"/>
</author>
<author role="aut">
<persName>
<forename type="first">Chantal</forename>
<surname>Reynaud</surname>
</persName>
<email>cr@lri.fr</email>
<idno type="halauthor">447245</idno>
<affiliation ref="#struct-2544"/>
<affiliation ref="#struct-118082"/>
</author>
<author role="aut">
<persName>
<forename type="first">Brigitte</forename>
<surname>Safar</surname>
</persName>
<email>safar@lri.fr</email>
<idno type="halauthor">71458</idno>
<affiliation ref="#struct-2544"/>
<affiliation ref="#struct-118082"/>
</author>
<author role="aut">
<persName>
<forename type="first">Christian</forename>
<surname>Sallaberry</surname>
</persName>
<email>Christian.Sallaberry@univ-pau.fr</email>
<idno type="halauthor">379319</idno>
<affiliation ref="#struct-29209"/>
</author>
<editor role="depositor">
<persName>
<forename>Chantal</forename>
<surname>Reynaud</surname>
</persName>
<email>cr@lri.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2011-05-26 09:10:09</date>
<date type="whenModified">2011-11-15 20:02:42</date>
<date type="whenReleased">2011-05-26 10:02:30</date>
<date type="whenProduced">2011</date>
<ref type="file" target="https://hal.inria.fr/inria-00595964/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="107363">
<persName>
<forename>Chantal</forename>
<surname>Reynaud</surname>
</persName>
<email>cr@lri.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">inria-00595964</idno>
<idno type="halUri">https://hal.inria.fr/inria-00595964</idno>
<idno type="halBibtex">sebastien:inria-00595964</idno>
<idno type="halRefHtml"><i>Revue internationale de Géomatique/International Journal of Geomatics and Spatial Analysis </i>, Hermes, 2011, 21 (2), pp.155-180</idno>
<idno type="halRef">Revue internationale de Géomatique/International Journal of Geomatics and Spatial Analysis , Hermes, 2011, 21 (2), pp.155-180</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="UNIV-TLSE2">Université Toulouse le Mirail - Toulouse II</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-PAU">Université de Pau et des Pays de l'Adour</idno>
<idno type="stamp" n="UNIV-PSUD">Université Paris Sud - Paris XI</idno>
<idno type="stamp" n="UNIV-TLSE1">Université des Sciences Sociales - Toulouse I</idno>
<idno type="stamp" n="UNIV-TLSE3">Université Paul Sabatier - Toulouse III</idno>
<idno type="stamp" n="INRIA-SACLAY">INRIA Saclay - Ile de France</idno>
<idno type="stamp" n="UNIV-PARIS11">Université Paris-Sud 11</idno>
<idno type="stamp" n="UMR8623">Laboratoire de Recherche en Informatique</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="3">National</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="fr">Analyses linguistiques et techniques d'alignement pour créer et enrichir une ontologie topographique</title>
<author role="aut">
<persName>
<forename type="first">Mustière</forename>
<surname>Sébastien</surname>
</persName>
<email>Sebastien.Mustiere@ign.fr</email>
<idno type="halAuthorId">611564</idno>
<orgName ref="#struct-300101"/>
<affiliation ref="#struct-30598"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nathalie</forename>
<surname>Abadie</surname>
</persName>
<email>Nathalie-F.Abadie@ign.fr</email>
<idno type="halAuthorId">611565</idno>
<orgName ref="#struct-300101"/>
<affiliation ref="#struct-30598"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nathalie</forename>
<surname>Aussenac- Gilles</surname>
</persName>
<email>aussenac@irit.fr</email>
<idno type="idHal">nathalie-aussenac-gilles</idno>
<idno type="halAuthorId">611566</idno>
<orgName ref="#struct-217752"/>
<affiliation ref="#struct-34499"/>
</author>
<author role="aut">
<persName>
<forename type="first">Marie-Noëlle</forename>
<surname>Bessagnet</surname>
</persName>
<idno type="halAuthorId">611567</idno>
<orgName ref="#struct-301085"/>
<affiliation ref="#struct-29209"/>
</author>
<author role="aut">
<persName>
<forename type="first">Mouna</forename>
<surname>Kamel</surname>
</persName>
<email>kamel@irit.fr</email>
<idno type="halAuthorId">398764</idno>
<affiliation ref="#struct-34499"/>
</author>
<author role="aut">
<persName>
<forename type="first">Eric</forename>
<surname>Kergosien</surname>
</persName>
<idno type="halAuthorId">611568</idno>
<orgName ref="#struct-301085"/>
<affiliation ref="#struct-29209"/>
</author>
<author role="aut">
<persName>
<forename type="first">Chantal</forename>
<surname>Reynaud</surname>
</persName>
<email>cr@lri.fr</email>
<idno type="halAuthorId">447245</idno>
<affiliation ref="#struct-2544"/>
<affiliation ref="#struct-118082"/>
</author>
<author role="aut">
<persName>
<forename type="first">Brigitte</forename>
<surname>Safar</surname>
</persName>
<email>safar@lri.fr</email>
<idno type="halAuthorId">71458</idno>
<affiliation ref="#struct-2544"/>
<affiliation ref="#struct-118082"/>
</author>
<author role="aut">
<persName>
<forename type="first">Christian</forename>
<surname>Sallaberry</surname>
</persName>
<email>Christian.Sallaberry@univ-pau.fr</email>
<idno type="halAuthorId">379319</idno>
<affiliation ref="#struct-29209"/>
</author>
</analytic>
<monogr>
<idno type="halJournalId">25847</idno>
<idno type="issn">1260-5875</idno>
<title level="j">Revue internationale de Géomatique/International Journal of Geomatics and Spatial Analysis </title>
<imprint>
<publisher>Hermes</publisher>
<biblScope unit="volume">21</biblScope>
<biblScope unit="issue">2</biblScope>
<biblScope unit="pp">155-180</biblScope>
<date type="datePub">2011</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="fr">French</language>
</langUsage>
<textClass>
<classCode scheme="acm" n="H.2.5"/>
<classCode scheme="halDomain" n="info.info-ai">Computer Science/Artificial Intelligence</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">One of the goals of the GéOnto project is to build an ontology of topographic concepts. This ontology results from the enrichment of a first taxonomy developed beforehand, through the analysis of two types of textual documents: technical database specifications and description of journeys. This work relies on natural language processing and ontology alignment techniques, as well as external knowledge resources such as dictionaries and gazetteers.</abstract>
<abstract xml:lang="fr">Dans cet article, nous présentons le projet GéOnto dont un des buts est de construire une ontologie de concepts topographiques. Cette ontologie est réalisée par enrichissement d'une première taxonomie de termes réalisée précédemment, et ce grâce à l'analyse de deux types de documents textuels : des spécifications techniques de bases de données et des récits de voyage. Cet enrichissement s'appuie sur des techniques automatiques de traitement du langage et d'alignement d'ontologies, ainsi que sur des connaissances externes comme des dictionnaires et des bases de toponymes.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="fr">Constrained Regular Expressions in SPARQL</title>
<author role="aut">
<persName>
<forename type="first">Faisal</forename>
<surname>Alkhateeb</surname>
</persName>
<email>faisal.alkhateeb@inria.fr</email>
<idno type="halauthor">179138</idno>
<affiliation ref="#struct-44971"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jean-François</forename>
<surname>Baget</surname>
</persName>
<email>jean-francois.baget@lirmm.fr</email>
<idno type="idhal">jfbaget</idno>
<idno type="halauthor">859567</idno>
<affiliation ref="#struct-35546"/>
<affiliation ref="#struct-388182"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jérôme</forename>
<surname>Euzenat</surname>
</persName>
<email>Jerome.Euzenat@inria.fr</email>
<idno type="idhal">jerome-euzenat</idno>
<idno type="halauthor">94198</idno>
<idno type="arXiv">http://arxiv.org/a/au:euzenat</idno>
<idno type="Linkedin">http://www.linkedin.com/pub/http://www.linkedin.com/in/jeuzenat</idno>
<idno type="Blog">http://exmo.inria.fr/~euzenat/</idno>
<idno type="VIAF">http://viaf.org/viaf/http://viaf.org/viaf/17546352</idno>
<affiliation ref="#struct-44971"/>
</author>
<editor role="depositor">
<persName>
<forename>Faisal</forename>
<surname>Alkhateeb</surname>
</persName>
<email>faisal.alkhateeb@inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v2">
<date type="whenSubmitted">2007-11-19 10:46:17</date>
</edition>
<edition n="v3" type="current">
<date type="whenSubmitted">2007-12-16 18:53:55</date>
<date type="whenWritten">2007-10-16</date>
<date type="whenModified">2015-02-07 01:06:10</date>
<date type="whenReleased">2007-12-17 07:31:02</date>
<date type="whenProduced">2007</date>
<ref type="file" target="https://hal.inria.fr/inria-00188287v3/document"/>
</edition>
<edition n="v1">
<date type="whenSubmitted">2007-11-16 11:35:56</date>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="117795">
<persName>
<forename>Faisal</forename>
<surname>Alkhateeb</surname>
</persName>
<email>faisal.alkhateeb@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">inria-00188287</idno>
<idno type="halUri">https://hal.inria.fr/inria-00188287</idno>
<idno type="halBibtex">alkhateeb:inria-00188287</idno>
<idno type="halRefHtml">[Research Report] RR-6360, 2007, pp.23</idno>
<idno type="halRef">[Research Report] RR-6360, 2007, pp.23</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="INRIA-RRRT">Rapports de recherche et Technique de l'Inria</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-GRENOBLE1" p="UGA">Université Joseph Fourier - Grenoble I</idno>
<idno type="stamp" n="UNIV-PMF_GRENOBLE" p="UGA">Université Pierre-Mendès-France - Grenoble II</idno>
<idno type="stamp" n="INPG" p="UGA">Institut polytechnique de Grenoble</idno>
<idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
<idno type="stamp" n="INRIA-RHA">INRIA Grenoble - Rhône-Alpes</idno>
<idno type="stamp" n="LIG" p="UGA">Laboratoire d'Informatique de Grenoble</idno>
<idno type="stamp" n="UGA">HAL Grenoble Alpes</idno>
<idno type="stamp" n="EDELWEISS" p="WIMMICS">Edelweiss (2007-07-01 => 2001-12-31)</idno>
<idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
<idno type="stamp" n="INRIA-MECSCI">Médiation Scientifique en Science du Numérique</idno>
<idno type="stamp" n="GRAPHIK">Graphs for Inferences on Knowledge</idno>
<idno type="stamp" n="CIRAD">CIRAD - Centre de coopération internationale en recherche agronomique pour le développement</idno>
<idno type="stamp" n="INRA">INRA - Institut national de la recherche agronomique</idno>
<idno type="stamp" n="TAMP_LIRMM_DOI">LIRMM</idno>
<idno type="stamp" n="IATE">Ingénierie des agropolymères et technologies émergentes</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="0">Not set</note>
<note type="report" n="6">Research Report</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="fr">Constrained Regular Expressions in SPARQL</title>
<author role="aut">
<persName>
<forename type="first">Faisal</forename>
<surname>Alkhateeb</surname>
</persName>
<email>faisal.alkhateeb@inria.fr</email>
<idno type="halAuthorId">179138</idno>
<affiliation ref="#struct-44971"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jean-François</forename>
<surname>Baget</surname>
</persName>
<email>jean-francois.baget@lirmm.fr</email>
<idno type="idHal">jfbaget</idno>
<idno type="halAuthorId">859567</idno>
<affiliation ref="#struct-35546"/>
<affiliation ref="#struct-388182"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jérôme</forename>
<surname>Euzenat</surname>
</persName>
<email>Jerome.Euzenat@inria.fr</email>
<idno type="idHal">jerome-euzenat</idno>
<idno type="halAuthorId">94198</idno>
<idno type="arXiv">http://arxiv.org/a/au:euzenat</idno>
<idno type="Linkedin">http://www.linkedin.com/pub/http://www.linkedin.com/in/jeuzenat</idno>
<idno type="Blog">http://exmo.inria.fr/~euzenat/</idno>
<idno type="VIAF">http://viaf.org/viaf/http://viaf.org/viaf/17546352</idno>
<affiliation ref="#struct-44971"/>
</author>
</analytic>
<monogr>
<idno type="reportNumber">RR-6360</idno>
<imprint>
<biblScope unit="pp">23</biblScope>
<date type="datePub">2007</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="en">semantic web</term>
<term xml:lang="en">query language</term>
<term xml:lang="en">RDF</term>
<term xml:lang="en">SPARQL</term>
<term xml:lang="en">constrained regular expressions</term>
</keywords>
<classCode scheme="acm" n="H.2.3.3"/>
<classCode scheme="halDomain" n="info.info-ai">Computer Science/Artificial Intelligence</classCode>
<classCode scheme="halTypology" n="REPORT">Reports</classCode>
</textClass>
<abstract xml:lang="en">RDF is a knowledge representation language dedicated to the annotation of resources within the Semantic Web. Though RDF itself can be used as a query language for an RDF knowledge base (using RDF consequence), the need for added expressivity in queries has led to the definition of the SPARQL query language. SPARQL queries are defined on top of graph patterns that are basically RDF (and more precisely GRDF) graphs. To be able to characterize paths of arbitrary length in a query (e.g., "does there exist a trip from town A to town B using only trains and buses?"), we have already proposed the PRDF (for Path RDF) language, effectively mixing RDF reasonings with database-inspired regular paths. However, these queries do not allow expressing constraints on the internal nodes (e.g., "Moreover, one of the stops must provide a wireless connection."). To express these constraints, we present here an extension of RDF, called CRDF (for Constrained paths RDF). For this extension of RDF, we provide an abstract syntax and an extension of RDF semantics. We characterize query answering (the query is a CRDF graph, the knowledge base is an RDF graph) as a particular case of CRDF entailment that can be computed using some kind of graph homomorphism. Finally, we use CRDF graphs to generalize SPARQL graph patterns, defining the CSPARQL extension of that query language, and prove that the problem of query answering using only CRDF graphs is an NP-hard problem.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Impact of IT Monoculture on Behavioral End Host Intrusion Detection</title>
<author role="aut">
<persName>
<forename type="first">Dhiman</forename>
<surname>Barman</surname>
</persName>
<email/>
<idno type="halauthor">824803</idno>
<affiliation ref="#struct-17973"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jaideep</forename>
<surname>Chandrashekar</surname>
</persName>
<email/>
<idno type="halauthor">645796</idno>
<affiliation ref="#struct-135817"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nina</forename>
<surname>Taft</surname>
</persName>
<email/>
<idno type="halauthor">645797</idno>
<affiliation ref="#struct-135817"/>
</author>
<author role="aut">
<persName>
<forename type="first">Michalis</forename>
<surname>Faloutsos</surname>
</persName>
<email/>
<idno type="halauthor">824804</idno>
<affiliation ref="#struct-17973"/>
</author>
<author role="aut">
<persName>
<forename type="first">Lim</forename>
<surname>Huang</surname>
</persName>
<email/>
<idno type="halauthor">824805</idno>
<affiliation ref="#struct-135817"/>
</author>
<author role="aut">
<persName>
<forename type="first">Frédéric</forename>
<surname>Giroire</surname>
</persName>
<email/>
<idno type="halauthor">538896</idno>
<affiliation ref="#struct-2466"/>
</author>
<editor role="depositor">
<persName>
<forename>Alain</forename>
<surname>Monteil</surname>
</persName>
<email>alain.monteil@inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2013-03-07 11:26:25</date>
<date type="whenModified">2014-11-18 16:33:02</date>
<date type="whenReleased">2013-03-07 14:02:20</date>
<date type="whenProduced">2009</date>
<ref type="file" target="https://hal.inria.fr/hal-00795994/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="102239">
<persName>
<forename>Alain</forename>
<surname>Monteil</surname>
</persName>
<email>alain.monteil@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00795994</idno>
<idno type="halUri">https://hal.inria.fr/hal-00795994</idno>
<idno type="halBibtex">barman:hal-00795994</idno>
<idno type="halRefHtml"><i>ACM SIGCOMM Workshop on Research on Enterprise Networking ― WREN</i>, 2009, Barcelone, Spain. pp.27―36</idno>
<idno type="halRef">ACM SIGCOMM Workshop on Research on Enterprise Networking ― WREN, 2009, Barcelone, Spain. pp.27―36</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNICE">Université de Nice Sophia-Antipolis</idno>
<idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
<idno type="stamp" n="I3S">Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis</idno>
<idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Impact of IT Monoculture on Behavioral End Host Intrusion Detection</title>
<author role="aut">
<persName>
<forename type="first">Dhiman</forename>
<surname>Barman</surname>
</persName>
<idno type="halAuthorId">824803</idno>
<affiliation ref="#struct-17973"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jaideep</forename>
<surname>Chandrashekar</surname>
</persName>
<idno type="halAuthorId">645796</idno>
<affiliation ref="#struct-135817"/>
</author>
<author role="aut">
<persName>
<forename type="first">Nina</forename>
<surname>Taft</surname>
</persName>
<idno type="halAuthorId">645797</idno>
<affiliation ref="#struct-135817"/>
</author>
<author role="aut">
<persName>
<forename type="first">Michalis</forename>
<surname>Faloutsos</surname>
</persName>
<idno type="halAuthorId">824804</idno>
<affiliation ref="#struct-17973"/>
</author>
<author role="aut">
<persName>
<forename type="first">Lim</forename>
<surname>Huang</surname>
</persName>
<idno type="halAuthorId">824805</idno>
<affiliation ref="#struct-135817"/>
</author>
<author role="aut">
<persName>
<forename type="first">Frédéric</forename>
<surname>Giroire</surname>
</persName>
<idno type="halAuthorId">538896</idno>
<affiliation ref="#struct-2466"/>
</author>
</analytic>
<monogr>
<meeting>
<title>ACM SIGCOMM Workshop on Research on Enterprise Networking ― WREN</title>
<date type="start">2009</date>
<settlement>Barcelone</settlement>
<country key="ES">Spain</country>
</meeting>
<imprint>
<biblScope unit="pp">27―36</biblScope>
<date type="datePub">2009</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-oh">Computer Science/Other</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">In this paper, we study the impact of today's IT policies, defined based upon a monoculture approach, on the performance of endhost anomaly detectors. This approach leads to the uniform configuration of Host intrusion detection systems (HIDS) across all hosts in an enterprise networks. We assess the performance impact this policy has from the individual's point of view by analyzing network traces collected from 350 enterprise users. We uncover a great deal of diversity in the user population in terms of the “tail†behavior, i.e., the component which matters for anomaly detection systems. We demonstrate that the monoculture approach to HIDS configuration results in users that experience wildly different false positive and false negatives rates. We then introduce new policies, based upon leveraging this diversity and show that not only do they dramatically improve performance for the vast majority of users, but they also reduce the number of false positives arriving in centralized IT operation centers, and can reduce attack strength.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">A Demonstration for Building Modular and Efficient DSLs: The Kermeta v2 Experience</title>
<author role="aut">
<persName>
<forename type="first">Olivier</forename>
<surname>Barais</surname>
</persName>
<email>olivier.barais@univ-rennes1.fr</email>
<idno type="idhal">olivierbarais</idno>
<idno type="halauthor">297215</idno>
<idno type="IdRef">http://www.idref.fr/Olivier Barais</idno>
<orgName ref="#struct-105160"/>
<affiliation ref="#struct-2539"/>
</author>
<author role="aut">
<persName>
<forename type="first">Benoit</forename>
<surname>Baudry</surname>
</persName>
<email>Benoit.Baudry@inria.fr</email>
<idno type="halauthor">169022</idno>
<affiliation ref="#struct-2539"/>
</author>
<author role="aut">
<persName>
<forename type="first">Arnaud</forename>
<surname>Blouin</surname>
</persName>
<email>arnaud.blouin@irisa.fr</email>
<idno type="idhal">arnaud-blouin</idno>
<idno type="halauthor">626254</idno>
<orgName ref="#struct-367992"/>
<affiliation ref="#struct-2539"/>
</author>
<author role="aut">
<persName>
<forename type="first">Benoit</forename>
<surname>Combemale</surname>
</persName>
<email>benoit.combemale@univ-rennes1.fr</email>
<idno type="halauthor">549648</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-2539"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jean-Marc</forename>
<surname>Jézéquel</surname>
</persName>
<email>jean-marc.jezequel@irisa.fr</email>
<idno type="halauthor">61332</idno>
<orgName ref="#struct-105160"/>
<affiliation ref="#struct-2539"/>
</author>
<author role="aut">
<persName>
<forename type="first">Didier</forename>
<surname>Vojtisek</surname>
</persName>
<email>didier.vojtisek@irisa.fr</email>
<idno type="halauthor">61327</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-2539"/>
</author>
<editor role="depositor">
<persName>
<forename>Arnaud</forename>
<surname>Blouin</surname>
</persName>
<email>arnaud.blouin@inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2013-03-01 13:27:23</date>
<date type="whenModified">2015-02-04 13:24:59</date>
<date type="whenReleased">2013-03-01 13:36:50</date>
<date type="whenProduced">2013-04-02</date>
<ref type="file" target="https://hal.inria.fr/hal-00796009/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="147081">
<persName>
<forename>Arnaud</forename>
<surname>Blouin</surname>
</persName>
<email>arnaud.blouin@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00796009</idno>
<idno type="halUri">https://hal.inria.fr/hal-00796009</idno>
<idno type="halBibtex">barais:hal-00796009</idno>
<idno type="halRefHtml"><i>Conférence en IngénieriE du Logiciel (CIEL)</i>, Apr 2013, Nancy, France</idno>
<idno type="halRef">Conférence en IngénieriE du Logiciel (CIEL), Apr 2013, Nancy, France</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-RENNES1">Université de Rennes 1</idno>
<idno type="stamp" n="INRIA-RENNES">INRIA Rennes - Bretagne Atlantique</idno>
<idno type="stamp" n="IRISA">Irisa</idno>
<idno type="stamp" n="IRISA_SET">IRISA_SET</idno>
<idno type="stamp" n="IRISA-INSA-R" p="IRISA">Institut de Recherche en Informatique et Systèmes Aléatoires - Composante INSA Rennes</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="3">National</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">A Demonstration for Building Modular and Efficient DSLs: The Kermeta v2 Experience</title>
<author role="aut">
<persName>
<forename type="first">Olivier</forename>
<surname>Barais</surname>
</persName>
<email>olivier.barais@univ-rennes1.fr</email>
<idno type="idHal">olivierbarais</idno>
<idno type="halAuthorId">297215</idno>
<idno type="IdRef">http://www.idref.fr/Olivier Barais</idno>
<orgName ref="#struct-105160"/>
<affiliation ref="#struct-2539"/>
</author>
<author role="aut">
<persName>
<forename type="first">Benoit</forename>
<surname>Baudry</surname>
</persName>
<email>Benoit.Baudry@inria.fr</email>
<idno type="halAuthorId">169022</idno>
<affiliation ref="#struct-2539"/>
</author>
<author role="aut">
<persName>
<forename type="first">Arnaud</forename>
<surname>Blouin</surname>
</persName>
<email>arnaud.blouin@irisa.fr</email>
<idno type="idHal">arnaud-blouin</idno>
<idno type="halAuthorId">626254</idno>
<orgName ref="#struct-367992"/>
<affiliation ref="#struct-2539"/>
</author>
<author role="aut">
<persName>
<forename type="first">Benoit</forename>
<surname>Combemale</surname>
</persName>
<email>benoit.combemale@univ-rennes1.fr</email>
<idno type="halAuthorId">549648</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-2539"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jean-Marc</forename>
<surname>Jézéquel</surname>
</persName>
<email>jean-marc.jezequel@irisa.fr</email>
<idno type="halAuthorId">61332</idno>
<orgName ref="#struct-105160"/>
<affiliation ref="#struct-2539"/>
</author>
<author role="aut">
<persName>
<forename type="first">Didier</forename>
<surname>Vojtisek</surname>
</persName>
<email>didier.vojtisek@irisa.fr</email>
<idno type="halAuthorId">61327</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-2539"/>
</author>
</analytic>
<monogr>
<meeting>
<title>Conférence en IngénieriE du Logiciel (CIEL)</title>
<date type="start">2013-04-02</date>
<date type="end">2013-04-04</date>
<settlement>Nancy</settlement>
<country key="FR">France</country>
</meeting>
<imprint>
<date type="datePub">2013-04-02</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-se">Computer Science/Software Engineering</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">This demonstration presents the new version (v2) of the Kermeta workbench that uses one domain-specific meta-language per language implementation concern. We show that the usage and combination of those meta-languages is simple and intuitive enough to deserve the term mashup and implemented as an original modular compilation scheme in the new version of Kermeta. This demonstration illustrates the use of the new version of Kermeta by presenting its use to design and implement two DSLs: Kompren, a DSL for designing and implementing model slicers; KCVL, the Commun Variability Language dedicated to variability management in software design models.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="it">SUM Query Processing over Probabilistic Data</title>
<author role="aut">
<persName>
<forename type="first">Reza</forename>
<surname>Akbarinia</surname>
</persName>
<email>reza.akbarinia@inria.fr</email>
<idno type="halauthor">670704</idno>
<affiliation ref="#struct-141072"/>
</author>
<author role="aut">
<persName>
<forename type="first">Patrick</forename>
<surname>Valduriez</surname>
</persName>
<email>Patrick.Valduriez@inria.fr</email>
<idno type="halauthor">97777</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-141072"/>
<affiliation ref="#struct-181"/>
</author>
<author role="aut">
<persName>
<forename type="first">Guillaume</forename>
<surname>Verger</surname>
</persName>
<email>guillaume.verger@lirmm.fr</email>
<idno type="halauthor">611613</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-181"/>
</author>
<editor role="depositor">
<persName>
<forename>Reza</forename>
<surname>Akbarinia</surname>
</persName>
<email>reza.akbarinia@inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2011-05-26 11:43:12</date>
<date type="whenModified">2015-02-06 16:04:24</date>
<date type="whenReleased">2011-05-26 11:55:45</date>
<date type="whenProduced">2011-05</date>
<ref type="file" target="https://hal.inria.fr/inria-00596020/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="116140">
<persName>
<forename>Reza</forename>
<surname>Akbarinia</surname>
</persName>
<email>reza.akbarinia@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">inria-00596020</idno>
<idno type="halUri">https://hal.inria.fr/inria-00596020</idno>
<idno type="halBibtex">akbarinia:inria-00596020</idno>
<idno type="halRefHtml">[Research Report] RR-7629, 2011, pp.21</idno>
<idno type="halRef">[Research Report] RR-7629, 2011, pp.21</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
<idno type="stamp" n="TAMP_LIRMM_DOI">LIRMM</idno>
<idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
<idno type="stamp" n="INRIA34">Montpellier</idno>
<idno type="stamp" n="INRIA-RRRT">Rapports de recherche et Technique de l'Inria</idno>
<idno type="stamp" n="INRIA-MECSCI">Médiation Scientifique en Science du Numérique</idno>
<idno type="stamp" n="ZENITH">Scientific Data Management</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="0">Not set</note>
<note type="report" n="6">Research Report</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="it">SUM Query Processing over Probabilistic Data</title>
<author role="aut">
<persName>
<forename type="first">Reza</forename>
<surname>Akbarinia</surname>
</persName>
<email>reza.akbarinia@inria.fr</email>
<idno type="halAuthorId">670704</idno>
<affiliation ref="#struct-141072"/>
</author>
<author role="aut">
<persName>
<forename type="first">Patrick</forename>
<surname>Valduriez</surname>
</persName>
<email>Patrick.Valduriez@inria.fr</email>
<idno type="halAuthorId">97777</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-141072"/>
<affiliation ref="#struct-181"/>
</author>
<author role="aut">
<persName>
<forename type="first">Guillaume</forename>
<surname>Verger</surname>
</persName>
<email>guillaume.verger@lirmm.fr</email>
<idno type="halAuthorId">611613</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-181"/>
</author>
</analytic>
<monogr>
<idno type="reportNumber">RR-7629</idno>
<imprint>
<biblScope unit="pp">21</biblScope>
<date type="datePub">2011-05</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="es">Probabilistic databases</term>
<term xml:lang="es">query processing</term>
<term xml:lang="es">aggregate queries</term>
<term xml:lang="es">SUM queries</term>
</keywords>
<classCode scheme="halDomain" n="info.info-ir">Computer Science/Information Retrieval</classCode>
<classCode scheme="halTypology" n="REPORT">Reports</classCode>
</textClass>
<abstract xml:lang="en">SUM queries are crucial for many applications that need to deal with probabilistic data. In this report, we are interested in the queries, called ALL_SUM, that return all possible sum values and their probabilities. In general, there is no efficient solution for the problem of evaluating ALL_SUM queries. But, for many practical applications, where aggregate values are small integers or real numbers with small precision, it is possible to develop efficient solutions. In this report, based on a recursive approach, we propose a complete solution for this problem. We implemented our solution and conducted an extensive experimental evaluation over synthetic and real-world data sets; the results show its effectiveness.</abstract>
<abstract xml:lang="fr">Les requêtes d'agrégation, notamment SUM, sont cruciales pour de nombreuses applications qui ont besoin de traiter des données incertaines probabilistes. Dans cet article, nous nous intéressons à un type de requête, appelé ALL_SUM, qui a pour objectif de retourner toutes les valeurs de somme possibles et leurs probabilités. En général, il n'y a pas de solution efficace au problème de l'évaluation de ces requêtes. Mais, pour de nombreuses applications pratiques, où les valeurs globales sont de petits entiers ou des nombres réels avec une petite précision, il est possible de développer des solutions efficaces. Dans ce rapport nous proposons une solution complète à ce problème. Nous avons implémenté notre solution et mené une évaluation expéri-mentale approfondie sur des données réelles et synthétiques; les résultats montrent son efficaci-té.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="no">(Portable) Task-based programming model for elastodynamics</title>
<author role="aut">
<persName>
<forename type="first">Lionel</forename>
<surname>Boillot</surname>
</persName>
<email>lionel.boillot@inria.fr</email>
<ptr type="url" target="http://people.bordeaux.inria.fr/boillot/"/>
<idno type="halauthor">1099500</idno>
<affiliation ref="#struct-55997"/>
</author>
<author role="aut">
<persName>
<forename type="first">Hélène</forename>
<surname>Barucq</surname>
</persName>
<email/>
<idno type="halauthor">217622</idno>
<orgName ref="#struct-364144"/>
<affiliation ref="#struct-55997"/>
<affiliation ref="#struct-87850"/>
</author>
<author role="aut">
<persName>
<forename type="first">Henri</forename>
<surname>Calandra</surname>
</persName>
<email>henri.calandra@total.com</email>
<idno type="halauthor">1066982</idno>
<orgName ref="#struct-379572"/>
<affiliation ref="#struct-123884"/>
</author>
<author role="aut">
<persName>
<forename type="first">Julien</forename>
<surname>Diaz</surname>
</persName>
<email>julien.diaz@inria.fr</email>
<idno type="halauthor">1099469</idno>
<orgName ref="#struct-367715"/>
<affiliation ref="#struct-55997"/>
<affiliation ref="#struct-87850"/>
</author>
<editor role="depositor">
<persName>
<forename>Lionel</forename>
<surname>Boillot</surname>
</persName>
<email>lionel.boillot@inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-09-30 13:42:39</date>
<date type="whenModified">2014-11-22 01:02:20</date>
<date type="whenReleased">2014-09-30 13:42:39</date>
<date type="whenProduced">2014-09-07</date>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="178479">
<persName>
<forename>Lionel</forename>
<surname>Boillot</surname>
</persName>
<email>lionel.boillot@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-01070015</idno>
<idno type="halUri">https://hal.inria.fr/hal-01070015</idno>
<idno type="halBibtex">boillot:hal-01070015</idno>
<idno type="halRefHtml"><i>EAGE workshop on HPC for Upstream</i>, Sep 2014, Chania, Greece</idno>
<idno type="halRef">EAGE workshop on HPC for Upstream, Sep 2014, Chania, Greece</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="LMA-PAU">Laboratoire de Mathématiques et de leurs Applications de Pau</idno>
<idno type="stamp" n="INRIA-BORDEAUX">INRIA Bordeaux - Sud-Ouest</idno>
<idno type="stamp" n="UNIV-PAU">Université de Pau et des Pays de l'Adour</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="no">(Portable) Task-based programming model for elastodynamics</title>
<author role="aut">
<persName>
<forename type="first">Lionel</forename>
<surname>Boillot</surname>
</persName>
<email>lionel.boillot@inria.fr</email>
<ptr type="url" target="http://people.bordeaux.inria.fr/boillot/"/>
<idno type="halAuthorId">1099500</idno>
<affiliation ref="#struct-55997"/>
</author>
<author role="aut">
<persName>
<forename type="first">Hélène</forename>
<surname>Barucq</surname>
</persName>
<idno type="halAuthorId">217622</idno>
<orgName ref="#struct-364144"/>
<affiliation ref="#struct-55997"/>
<affiliation ref="#struct-87850"/>
</author>
<author role="aut">
<persName>
<forename type="first">Henri</forename>
<surname>Calandra</surname>
</persName>
<email>henri.calandra@total.com</email>
<idno type="halAuthorId">1066982</idno>
<orgName ref="#struct-379572"/>
<affiliation ref="#struct-123884"/>
</author>
<author role="aut">
<persName>
<forename type="first">Julien</forename>
<surname>Diaz</surname>
</persName>
<email>julien.diaz@inria.fr</email>
<idno type="halAuthorId">1099469</idno>
<orgName ref="#struct-367715"/>
<affiliation ref="#struct-55997"/>
<affiliation ref="#struct-87850"/>
</author>
</analytic>
<monogr>
<meeting>
<title>EAGE workshop on HPC for Upstream</title>
<date type="start">2014-09-07</date>
<date type="end">2014-09-10</date>
<settlement>Chania</settlement>
<country key="GR">Greece</country>
</meeting>
<imprint>
<date type="datePub">2014-09-07</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-mo">Computer Science/Modeling and Simulation</classCode>
<classCode scheme="halDomain" n="info.info-dc">Computer Science/Distributed, Parallel, and Cluster Computing</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<particDesc>
<org type="consortium">Plafrim</org>
<org type="consortium">Strategic Action Depth Imaging Partnership</org>
</particDesc>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Some numerical considerations for lattice basis reduction</title>
<author role="aut">
<persName>
<forename type="first">Gilles</forename>
<surname>Villard</surname>
</persName>
<email/>
<idno type="halauthor">62681</idno>
<affiliation ref="#struct-35418"/>
<affiliation ref="#struct-178327"/>
</author>
<editor role="depositor">
<persName>
<forename>Gilles</forename>
<surname>Villard</surname>
</persName>
<email>Gilles.Villard@ens-lyon.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-05-22 08:31:33</date>
<date type="whenModified">2014-05-22 08:42:59</date>
<date type="whenReleased">2014-05-22 08:31:33</date>
<date type="whenProduced">2011-11-16</date>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="102342">
<persName>
<forename>Gilles</forename>
<surname>Villard</surname>
</persName>
<email>Gilles.Villard@ens-lyon.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">ensl-00994751</idno>
<idno type="halUri">https://hal-ens-lyon.archives-ouvertes.fr/ensl-00994751</idno>
<idno type="halBibtex">villard:ensl-00994751</idno>
<idno type="halRefHtml"><i>Fields Institute Workshop on Hybrid Methodologies for Symbolic-Numeric Computation</i>, Nov 2011, David R. Cheriton School of Computer Science, Waterloo, Ontario, Canada</idno>
<idno type="halRef">Fields Institute Workshop on Hybrid Methodologies for Symbolic-Numeric Computation, Nov 2011, David R. Cheriton School of Computer Science, Waterloo, Ontario, Canada</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="ENS-LYON">École Normale Supérieure de Lyon</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-LYON1">Université Claude Bernard - Lyon I</idno>
<idno type="stamp" n="INRIA-RHA">INRIA Grenoble - Rhône-Alpes</idno>
<idno type="stamp" n="LIP">Laboratoire de l'Informatique du Parallélisme</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="1">Not set</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="0">No</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Some numerical considerations for lattice basis reduction</title>
<author role="aut">
<persName>
<forename type="first">Gilles</forename>
<surname>Villard</surname>
</persName>
<idno type="halAuthorId">62681</idno>
<affiliation ref="#struct-35418"/>
<affiliation ref="#struct-178327"/>
</author>
</analytic>
<monogr>
<meeting>
<title>Fields Institute Workshop on Hybrid Methodologies for Symbolic-Numeric Computation</title>
<date type="start">2011-11-16</date>
<date type="end">2011-11-19</date>
<settlement>David R. Cheriton School of Computer Science, Waterloo, Ontario</settlement>
<country key="CA">Canada</country>
</meeting>
<imprint/>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="en">lattice basis reduction</term>
<term xml:lang="en">QR factorization</term>
<term xml:lang="en">numerical precision</term>
<term xml:lang="en">integer matrix</term>
<term xml:lang="en">LLL</term>
<term xml:lang="en">computational complexity</term>
<term xml:lang="en">bit complexity</term>
</keywords>
<classCode scheme="halDomain" n="info.info-ds">Computer Science/Data Structures and Algorithms</classCode>
<classCode scheme="halDomain" n="info.info-na">Computer Science/Numerical Analysis</classCode>
<classCode scheme="halDomain" n="info.info-sc">Computer Science/Symbolic Computation</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Fastest algorithms and implementations for LLL basis reduction are highly hybrid symbolic-numeric. A "numerical engine" computes, via a orthogonalization process, the unimodular transformations that will improve the quality of the basis. Then, for example in the case of integer lattice bases, the transformations are applied in exact arithmetic. We focus on several aspects concerning the choice of the precision than can be used for the numerical computations. We present theoretical bounds based on reducedness perturbation results, and on a "fully numerical view" of the algorithms. This leads to new methods for certifying reducedness. We also adopt a practical point of view for looking at approches with a dynamical tuning of the precision, and at the difficulties for heuristically mastering the behavior of the codes when the precision is very low compared to theoretical requirements.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">Mapping and re-localization for mobile augmented reality</title>
<author role="aut">
<persName>
<forename type="first">Pierre</forename>
<surname>Martin</surname>
</persName>
<email/>
<idno type="halauthor">81909</idno>
<affiliation ref="#struct-2520"/>
<affiliation ref="#struct-121780"/>
</author>
<author role="aut">
<persName>
<forename type="first">Eric</forename>
<surname>Marchand</surname>
</persName>
<email/>
<idno type="idhal">eric-marchand</idno>
<idno type="halauthor">376518</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-2520"/>
</author>
<author role="aut">
<persName>
<forename type="first">Pascal</forename>
<surname>Houlier</surname>
</persName>
<email/>
<idno type="halauthor">555635</idno>
<orgName ref="#struct-300518"/>
<affiliation ref="#struct-121780"/>
</author>
<author role="aut">
<persName>
<forename type="first">Isabelle</forename>
<surname>Marchal</surname>
</persName>
<email/>
<idno type="halauthor">555634</idno>
<orgName ref="#struct-300518"/>
<affiliation ref="#struct-121780"/>
</author>
<editor role="depositor">
<persName>
<forename>Eric</forename>
<surname>Marchand</surname>
</persName>
<email>Eric.Marchand@irisa.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-05-22 09:01:34</date>
<date type="whenModified">2014-05-22 09:22:52</date>
<date type="whenReleased">2014-05-22 09:22:52</date>
<date type="whenProduced">2014-10</date>
<ref type="file" target="https://hal.inria.fr/hal-00994756/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="110655">
<persName>
<forename>Eric</forename>
<surname>Marchand</surname>
</persName>
<email>Eric.Marchand@irisa.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00994756</idno>
<idno type="halUri">https://hal.inria.fr/hal-00994756</idno>
<idno type="halBibtex">martin:hal-00994756</idno>
<idno type="halRefHtml"><i>IEEE Int. Conf. on Image Processing</i>, Oct 2014, Paris, France</idno>
<idno type="halRef">IEEE Int. Conf. on Image Processing, Oct 2014, Paris, France</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="UNIV-RENNES1">Université de Rennes 1</idno>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INRIA-RENNES">INRIA Rennes - Bretagne Atlantique</idno>
<idno type="stamp" n="IRISA">Irisa</idno>
<idno type="stamp" n="IRISA_SET">IRISA_SET</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">Mapping and re-localization for mobile augmented reality</title>
<author role="aut">
<persName>
<forename type="first">Pierre</forename>
<surname>Martin</surname>
</persName>
<idno type="halAuthorId">81909</idno>
<affiliation ref="#struct-2520"/>
<affiliation ref="#struct-121780"/>
</author>
<author role="aut">
<persName>
<forename type="first">Eric</forename>
<surname>Marchand</surname>
</persName>
<idno type="idHal">eric-marchand</idno>
<idno type="halAuthorId">376518</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-2520"/>
</author>
<author role="aut">
<persName>
<forename type="first">Pascal</forename>
<surname>Houlier</surname>
</persName>
<idno type="halAuthorId">555635</idno>
<orgName ref="#struct-300518"/>
<affiliation ref="#struct-121780"/>
</author>
<author role="aut">
<persName>
<forename type="first">Isabelle</forename>
<surname>Marchal</surname>
</persName>
<idno type="halAuthorId">555634</idno>
<orgName ref="#struct-300518"/>
<affiliation ref="#struct-121780"/>
</author>
</analytic>
<monogr>
<meeting>
<title>IEEE Int. Conf. on Image Processing</title>
<date type="start">2014-10</date>
<settlement>Paris</settlement>
<country key="FR">France</country>
</meeting>
<imprint>
<date type="datePub">2014-10</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-rb">Computer Science/Robotics</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Using Simultaneous Localization And Mapping (SLAM) methods become more and more common in Augmented Re- ality (AR). To achieve real-time requirement and to cope with scale factor and the lack of absolute positioning issue, we pro- pose to decouple the localization and the mapping step. We explain the benefits of this approach and how a SLAM strategy can still be used in a way that is meaningful for the end user. The method we proposed has been fully implemented on various smartphone in order to show its efficiency.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">A perfect sampling algorithm of random walks with forbidden arcs</title>
<author role="aut">
<persName>
<forename type="first">Stéphane</forename>
<surname>Durand</surname>
</persName>
<email>stephane.durand@ens-lyon.fr</email>
<idno type="halauthor">1000781</idno>
<orgName ref="#struct-6818"/>
<affiliation ref="#struct-37506"/>
</author>
<author role="aut">
<persName>
<forename type="first">Bruno</forename>
<surname>Gaujal</surname>
</persName>
<email>Bruno.Gaujal@imag.fr</email>
<idno type="halauthor">97860</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-37506"/>
</author>
<author role="aut">
<persName>
<forename type="first">Florence</forename>
<surname>Perronnin</surname>
</persName>
<email>florence.perronnin@imag.fr</email>
<ptr type="url" target="http://tinyurl.com/fperronnin"/>
<idno type="idhal">fperronnin</idno>
<idno type="halauthor">1079607</idno>
<affiliation ref="#struct-37506"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jean-Marc</forename>
<surname>Vincent</surname>
</persName>
<email>Jean-Marc.Vincent@imag.fr</email>
<idno type="halauthor">97861</idno>
<orgName ref="#struct-51016"/>
<affiliation ref="#struct-37506"/>
</author>
<editor role="depositor">
<persName>
<forename>Florence</forename>
<surname>Perronnin</surname>
</persName>
<email>florence.perronnin@imag.fr</email>
</editor>
<funder ref="#projanr-25398"/>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-09-30 11:43:53</date>
<date type="whenModified">2014-09-30 11:43:53</date>
<date type="whenReleased">2014-09-30 11:43:53</date>
<date type="whenProduced">2014-09-08</date>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="185435">
<persName>
<forename>Florence</forename>
<surname>Perronnin</surname>
</persName>
<email>florence.perronnin@imag.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-01069975</idno>
<idno type="halUri">https://hal.inria.fr/hal-01069975</idno>
<idno type="halBibtex">durand:hal-01069975</idno>
<idno type="halRefHtml"><i>QEST 2014 - 11th International Conference on Quantitative Evaluation of Systems</i>, Sep 2014, Florence, Italy. Springer, 8657, pp.178-193, LNCS; Quantitative Evaluation of Systems. <a target="_blank" href="http://dx.doi.org/10.1007/978-3-319-10696-0_15">&lt;10.1007/978-3-319-10696-0_15&gt;</a></idno>
<idno type="halRef">QEST 2014 - 11th International Conference on Quantitative Evaluation of Systems, Sep 2014, Florence, Italy. Springer, 8657, pp.178-193, LNCS; Quantitative Evaluation of Systems. &lt;10.1007/978-3-319-10696-0_15&gt;</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNIV-GRENOBLE1" p="UGA">Université Joseph Fourier - Grenoble I</idno>
<idno type="stamp" n="INPG" p="UGA">Institut polytechnique de Grenoble</idno>
<idno type="stamp" n="INRIA-RHA">INRIA Grenoble - Rhône-Alpes</idno>
<idno type="stamp" n="UGA">HAL Grenoble Alpes</idno>
<idno type="stamp" n="LIG" p="UGA">Laboratoire d'Informatique de Grenoble</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">A perfect sampling algorithm of random walks with forbidden arcs</title>
<author role="aut">
<persName>
<forename type="first">Stéphane</forename>
<surname>Durand</surname>
</persName>
<email>stephane.durand@ens-lyon.fr</email>
<idno type="halAuthorId">1000781</idno>
<orgName ref="#struct-6818"/>
<affiliation ref="#struct-37506"/>
</author>
<author role="aut">
<persName>
<forename type="first">Bruno</forename>
<surname>Gaujal</surname>
</persName>
<email>Bruno.Gaujal@imag.fr</email>
<idno type="halAuthorId">97860</idno>
<orgName ref="#struct-300009"/>
<affiliation ref="#struct-37506"/>
</author>
<author role="aut">
<persName>
<forename type="first">Florence</forename>
<surname>Perronnin</surname>
</persName>
<email>florence.perronnin@imag.fr</email>
<ptr type="url" target="http://tinyurl.com/fperronnin"/>
<idno type="idHal">fperronnin</idno>
<idno type="halAuthorId">1079607</idno>
<affiliation ref="#struct-37506"/>
</author>
<author role="aut">
<persName>
<forename type="first">Jean-Marc</forename>
<surname>Vincent</surname>
</persName>
<email>Jean-Marc.Vincent@imag.fr</email>
<idno type="halAuthorId">97861</idno>
<orgName ref="#struct-51016"/>
<affiliation ref="#struct-37506"/>
</author>
</analytic>
<monogr>
<meeting>
<title>QEST 2014 - 11th International Conference on Quantitative Evaluation of Systems</title>
<date type="start">2014-09-08</date>
<date type="end">2014-09-10</date>
<settlement>Florence</settlement>
<country key="IT">Italy</country>
</meeting>
<imprint>
<publisher>Springer</publisher>
<biblScope unit="serie"/>
<biblScope unit="volume">8657</biblScope>
<biblScope unit="pp">178-193</biblScope>
<date type="datePub">2014</date>
</imprint>
</monogr>
<idno type="doi">10.1007/978-3-319-10696-0_15</idno>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-mo">Computer Science/Modeling and Simulation</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">In this paper we show how to construct an algorithm to sample the stationary distribution of a random walk over ${1,...,N}^d$ with forbidden arcs. This algorithm combines the rejection method and coupling from the past of a set of trajectories of the Markov chain that generalizes the classical sandwich approach. We also provide a complexity analysis of this approach in several cases showing a coupling time in $O(N^2 d log d )$ when no arc is forbidden and an experimental study of its performance.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="en">On the odd-minor variant of Hadwiger's conjecture</title>
<author role="aut">
<persName>
<forename type="first">Jim</forename>
<surname>Geelen</surname>
</persName>
<email/>
<idno type="halauthor">824786</idno>
<affiliation ref="#struct-2466"/>
</author>
<author role="aut">
<persName>
<forename type="first">Bert</forename>
<surname>Gerards</surname>
</persName>
<email/>
<idno type="halauthor">824787</idno>
<affiliation ref="#struct-2466"/>
</author>
<author role="aut">
<persName>
<forename type="first">Bruce</forename>
<surname>Reed</surname>
</persName>
<email/>
<idno type="halauthor">358249</idno>
<orgName ref="#struct-364346"/>
<affiliation ref="#struct-49508"/>
</author>
<author role="aut">
<persName>
<forename type="first">Paul</forename>
<surname>Seymour</surname>
</persName>
<email/>
<idno type="halauthor">824788</idno>
<affiliation ref="#struct-2466"/>
</author>
<author role="aut">
<persName>
<forename type="first">Adrian</forename>
<surname>Vetta</surname>
</persName>
<email/>
<idno type="halauthor">824789</idno>
<affiliation ref="#struct-2466"/>
</author>
<editor role="depositor">
<persName>
<forename>Alain</forename>
<surname>Monteil</surname>
</persName>
<email>alain.monteil@inria.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2013-03-07 11:22:20</date>
<date type="whenModified">2014-11-18 17:55:15</date>
<date type="whenReleased">2013-03-07 14:02:21</date>
<date type="whenProduced">2009</date>
<ref type="file" target="https://hal.inria.fr/hal-00795995/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="102239">
<persName>
<forename>Alain</forename>
<surname>Monteil</surname>
</persName>
<email>alain.monteil@inria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00795995</idno>
<idno type="halUri">https://hal.inria.fr/hal-00795995</idno>
<idno type="halBibtex">geelen:hal-00795995</idno>
<idno type="halRefHtml"><i>Journal of Combinatorial Theory, Series B</i>, Elsevier, 2009, 99, pp.20―29</idno>
<idno type="halRef">Journal of Combinatorial Theory, Series B, Elsevier, 2009, 99, pp.20―29</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="UNICE">Université de Nice Sophia-Antipolis</idno>
<idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
<idno type="stamp" n="I3S">Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis</idno>
<idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="2">International</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">On the odd-minor variant of Hadwiger's conjecture</title>
<author role="aut">
<persName>
<forename type="first">Jim</forename>
<surname>Geelen</surname>
</persName>
<idno type="halAuthorId">824786</idno>
<affiliation ref="#struct-2466"/>
</author>
<author role="aut">
<persName>
<forename type="first">Bert</forename>
<surname>Gerards</surname>
</persName>
<idno type="halAuthorId">824787</idno>
<affiliation ref="#struct-2466"/>
</author>
<author role="aut">
<persName>
<forename type="first">Bruce</forename>
<surname>Reed</surname>
</persName>
<idno type="halAuthorId">358249</idno>
<orgName ref="#struct-364346"/>
<affiliation ref="#struct-49508"/>
</author>
<author role="aut">
<persName>
<forename type="first">Paul</forename>
<surname>Seymour</surname>
</persName>
<idno type="halAuthorId">824788</idno>
<affiliation ref="#struct-2466"/>
</author>
<author role="aut">
<persName>
<forename type="first">Adrian</forename>
<surname>Vetta</surname>
</persName>
<idno type="halAuthorId">824789</idno>
<affiliation ref="#struct-2466"/>
</author>
</analytic>
<monogr>
<idno type="halJournalId">15253</idno>
<idno type="issn">0095-8956</idno>
<idno type="eissn">1096-0902</idno>
<title level="j">Journal of Combinatorial Theory, Series B</title>
<imprint>
<publisher>Elsevier</publisher>
<biblScope unit="volume">99</biblScope>
<biblScope unit="pp">20―29</biblScope>
<date type="datePub">2009</date>
</imprint>
</monogr>
<ref type="seeAlso">http://portal.acm.org/citation.cfm?id=1465824</ref>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en">English</language>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="info.info-mc">Computer Science/Mobile Computing</classCode>
<classCode scheme="halDomain" n="info.info-ni">Computer Science/Networking and Internet Architecture</classCode>
<classCode scheme="halTypology" n="ART">Journal articles</classCode>
</textClass>
<abstract xml:lang="en">A Kl-expansion consists of l vertex-disjoint trees, every two of which are joined by an edge. We call such an expansion odd if its vertices can be two-coloured so that the edges of the trees are bichromatic but the edges between trees are monochromatic. We show that, for every l, if a graph contains no odd Kl-expansion then its chromatic number is View the MathML source. In doing so, we obtain a characterization of graphs which contain no odd Kl-expansion which is of independent interest. We also prove that given a graph and a subset S of its vertex set, either there are k vertex-disjoint odd paths with endpoints in S, or there is a set X of at most 2kâˆ'2 vertices such that every odd path with both ends in S contains a vertex in X. Finally, we discuss the algorithmic implications of these results.</abstract>
</profileDesc>
</biblFull>
<biblFull>
<titleStmt>
<title xml:lang="fr">Intergiciels pour systèmes multi-robots: état de l'art</title>
<author role="aut">
<persName>
<forename type="first">Stefan-Gabriel</forename>
<surname>Chitic</surname>
</persName>
<email>stefan.chitic@insa-lyon.fr</email>
<ptr type="url" target="http://www.chitic.eu"/>
<idno type="halauthor">1025558</idno>
<affiliation ref="#struct-203831"/>
</author>
<author role="crp">
<persName>
<forename type="first">Julien</forename>
<surname>Ponge</surname>
</persName>
<email>julien.ponge@insa-lyon.fr</email>
<idno type="halauthor">1025559</idno>
<affiliation ref="#struct-203831"/>
</author>
<author role="aut">
<persName>
<forename type="first">Olivier</forename>
<surname>Simonin</surname>
</persName>
<email>olivier.simonin@insa-lyon.fr</email>
<ptr type="url" target="http://perso.citi-lab.fr/osimonin/"/>
<idno type="halauthor">958341</idno>
<affiliation ref="#struct-203831"/>
</author>
<editor role="depositor">
<persName>
<forename>Stefan-Gabriel</forename>
<surname>Chitic</surname>
</persName>
<email>stefan.chitic@insa-lyon.fr</email>
</editor>
</titleStmt>
<editionStmt>
<edition n="v1" type="current">
<date type="whenSubmitted">2014-06-06 07:00:16</date>
<date type="whenWritten">2014-05-12</date>
<date type="whenModified">2014-06-06 07:00:16</date>
<date type="whenReleased">2014-05-22 13:37:30</date>
<date type="whenProduced">2014-06-05</date>
<ref type="file" target="https://hal.archives-ouvertes.fr/hal-00994810/document"/>
</edition>
<respStmt>
<resp>contributor</resp>
<name key="195586">
<persName>
<forename>Stefan-Gabriel</forename>
<surname>Chitic</surname>
</persName>
<email>stefan.chitic@insa-lyon.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt>
<distributor>CCSD</distributor>
<idno type="halId">hal-00994810</idno>
<idno type="halUri">https://hal.archives-ouvertes.fr/hal-00994810</idno>
<idno type="halBibtex">chitic:hal-00994810</idno>
<idno type="halRefHtml"><i>UbiMob2014 : 10èmes journées francophones Mobilité et Ubiquité</i>, Jun 2014, Sophia Antipolis, France. 8 p</idno>
<idno type="halRef">UbiMob2014 : 10èmes journées francophones Mobilité et Ubiquité, Jun 2014, Sophia Antipolis, France. 8 p</idno>
</publicationStmt>
<seriesStmt>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INSA-LYON">Institut National des Sciences Appliquées de Lyon</idno>
</seriesStmt>
<notesStmt>
<note type="audience" n="3">National</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="fr">Intergiciels pour systèmes multi-robots: état de l'art</title>
<author role="aut">
<persName>
<forename type="first">Stefan-Gabriel</forename>
<surname>Chitic</surname>
</persName>
<email>stefan.chitic@insa-lyon.fr</email>
<ptr type="url" target="http://www.chitic.eu"/>
<idno type="halAuthorId">1025558</idno>
<affiliation ref="#struct-203831"/>
</author>
<author role="crp">
<persName>
<forename type="first">Julien</forename>
<surname>Ponge</surname>
</persName>
<email>julien.ponge@insa-lyon.fr</email>
<idno type="halAuthorId">1025559</idno>
<affiliation ref="#struct-203831"/>
</author>
<author role="aut">
<persName>
<forename type="first">Olivier</forename>
<surname>Simonin</surname>
</persName>
<email>olivier.simonin@insa-lyon.fr</email>
<ptr type="url" target="http://perso.citi-lab.fr/osimonin/"/>
<idno type="halAuthorId">958341</idno>
<affiliation ref="#struct-203831"/>
</author>
</analytic>
<monogr>
<title level="m">UbiMob2014 : 10èmes journées francophones Mobilité et Ubiquité</title>
<meeting>
<title>UbiMob2014 : 10èmes journées francophones Mobilité et Ubiquité</title>
<date type="start">2014-06-05</date>
<date type="end">2014-06-06</date>
<settlement>Sophia Antipolis</settlement>
<country key="FR">France</country>
</meeting>
<imprint>
<biblScope unit="pp">8 p.</biblScope>
<date type="datePub">2014-06-05</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="fr">French</language>
</langUsage>
<textClass>
<keywords scheme="author">
<term xml:lang="fr">Systèmes multi-robots</term>
<term xml:lang="fr">intergiciel</term>
<term xml:lang="fr">cloud robotique</term>
</keywords>
<classCode scheme="halDomain" n="info.info-iu">Computer Science/Ubiquitous Computing</classCode>
<classCode scheme="halDomain" n="info.info-rb">Computer Science/Robotics</classCode>
<classCode scheme="halDomain" n="info.info-se">Computer Science/Software Engineering</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="fr">Les flottes de robots autonomes sont des systèmes complexes qui nécessitent des interactions et des communications entre des éléments matériels et logiciels hétérogènes. Malgré l'évolution du domaine robotique, il existe encore un manque d'architectures logicielles de référence et d'intergiciels éprouvés, en particulier pour les systèmes multi-robots. De nombreuses équipes continuent d'élaborer des logiciels orientés spécifiquement vers le matériel lié à leurs robots. Cette vision rend le partage des modules ou des codes existants difficile. Un intergiciel robotique doit être conçu pour abstraire l'architecture matérielle de bas niveau, pour faciliter la communication et l'intégration avec des briques logicielles tierces. Dans cet article, nous présentons et comparons les intergiciels les plus susceptibles de s'appliquer aux systèmes multi-robots. Nous présentons et discutons également deux solutions de type cloud dédiées aux plate-formes multi-robots.</abstract>
</profileDesc>
</biblFull>
</listBibl>
</body>
<back>
<listOrg type="structures">
<org type="laboratory" xml:id="struct-181">
<orgName>Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier</orgName>
<orgName type="acronym">LIRMM</orgName>
<desc>
<address>
<addrLine>CC 477, 161 rue Ada, 34095 Montpellier Cedex 5</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.lirmm.fr</ref>
</desc>
<listRelation>
<relation active="#struct-410122" type="direct"/>
<relation name="UMR5506" active="#struct-388064" type="direct"/>
</listRelation>
</org>
<org type="researchteam" xml:id="struct-141072">
<orgName>ZENITH: Scientific Data Management</orgName>
<orgName type="acronym">ZENITH</orgName>
<desc>
<address>
<country key="FR"/>
</address>
<ref type="url">https://team.inria.fr/zenith/</ref>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-407026" type="direct"/>
<relation active="#struct-181" type="indirect"/>
<relation active="#struct-410122" type="indirect"/>
<relation name="UMR5506" active="#struct-388064" type="indirect"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-28612">
<orgName>Department of Computer Science</orgName>
<desc>
<address>
<addrLine>CS Lab - Sandford Fleming Building - 10 Kings College Road, Room 3302 - Toronto, Ontario M5S 3G4</addrLine>
<country key="CA"/>
</address>
<ref type="url">http://www.cs.toronto.edu/DCS/index.html</ref>
</desc>
<listRelation>
<relation active="#struct-300722" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-410122">
<orgName>Université de Montpellier</orgName>
<orgName type="acronym">UM</orgName>
<desc>
<address>
<addrLine>163 rue Auguste Broussonnet - 34090 Montpellier</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.umontpellier.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-388064">
<orgName>CNRS</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-300009">
<orgName>INRIA</orgName>
<desc>
<address>
<country key="FR"/>
</address>
<ref type="url">http://www.inria.fr</ref>
</desc>
</org>
<org type="department" xml:id="struct-407026">
<orgName>Département Informatique</orgName>
<orgName type="acronym">INFO/LIRMM</orgName>
<desc>
<address>
<country key="FR"/>
</address>
<ref type="url">http://www.lirmm.fr/recherche/departements/info</ref>
</desc>
<listRelation>
<relation active="#struct-181" type="direct"/>
<relation active="#struct-410122" type="indirect"/>
<relation name="UMR5506" active="#struct-388064" type="indirect"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-300722">
<orgName>University of Toronto</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-42196">
<orgName>United Institute of Informatics Problems</orgName>
<orgName type="acronym">UIIP [Minsk]</orgName>
<desc>
<address>
<addrLine>6, Surganova str, 220012 Minsk, Republic of Belarus</addrLine>
<country key="BY"/>
</address>
<ref type="url">http://www.uiip.bas-net.by/index-eng.html</ref>
</desc>
<listRelation>
<relation active="#struct-310289" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-2450">
<orgName>ARIANA</orgName>
<orgName type="acronym">INRIA Sophia Antipolis / Laboratoire I3S</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation name="UMR7271" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-117617" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-34499">
<orgName>Institut de recherche en informatique de Toulouse</orgName>
<orgName type="acronym">IRIT</orgName>
<desc>
<address>
<addrLine>118 Route de Narbonne, F-31062 Toulouse Cedex 9</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.irit.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-81148" type="direct"/>
<relation name="UMR5505" active="#struct-388064" type="direct"/>
<relation active="#struct-217752" type="direct"/>
<relation active="#struct-116256" type="direct"/>
<relation active="#struct-5030" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-20456">
<orgName>Dobrushin laboratory of Mathematics</orgName>
<orgName type="acronym">IITP</orgName>
<desc>
<address>
<addrLine>Institute of Information Transmission Problems (IITP), Bolshoy Karetny per. 19, 127994 Moscow, Russia.</addrLine>
<country key="RU"/>
</address>
<ref type="url">http://www.iitp.ru/en/science</ref>
</desc>
<listRelation>
<relation active="#struct-307269" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-310289">
<orgName>Academy of Sciences of Belarus, Minsk</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-117617">
<orgName>Université Nice Sophia Antipolis</orgName>
<orgName type="acronym">UNS</orgName>
<desc>
<address>
<addrLine>Parc Valrose - BP 2135 - 06103 Nice cedex 2</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://unice.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-81148">
<orgName>Université Toulouse 1 Capitole</orgName>
<orgName type="acronym">UT1</orgName>
<desc>
<address>
<addrLine>2 rue du Doyen-Gabriel-Marty - 31042 Toulouse Cedex 9 </addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.ut-capitole.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-217752">
<orgName>Université Paul Sabatier - Toulouse 3</orgName>
<orgName type="acronym">UPS</orgName>
<desc>
<address>
<addrLine>118 route de Narbonne - 31062 Toulouse</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.univ-tlse3.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-116256">
<orgName>Université Toulouse 2 Le Mirail</orgName>
<orgName type="acronym">UTM</orgName>
<desc>
<address>
<addrLine>5 allées Antonio Machado - 31058 Toulouse Cedex 9 </addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.univ-tlse2.fr</ref>
</desc>
</org>
<org type="institution" xml:id="struct-5030">
<orgName>Institut National Polytechnique de Toulouse</orgName>
<orgName type="acronym">INP Toulouse</orgName>
<desc>
<address>
<addrLine>6 allée Émile Monso - BP 34038 - 31029 Toulouse cedex 4</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.inp-toulouse.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-307269">
<orgName>Institute for Information Transmission Problems</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-252578">
<orgName>LOCO</orgName>
<orgName type="acronym">INRIA Rocquencourt</orgName>
<desc>
<address>
<addrLine>Domaine de Voluceau - BP 105 78153 Rocquencourt</addrLine>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-74131">
<orgName>Centre de Recherche en Informatique de Paris 1</orgName>
<orgName type="acronym">CRI</orgName>
<desc>
<address>
<addrLine>Université Paris 1 Panthéon-Sorbonne 90 rue de Tolbiac 75013 Paris Pays FR</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://crinfo.univ-paris1.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-7550" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-7550">
<orgName>Université Panthéon-Sorbonne</orgName>
<orgName type="acronym">UP1</orgName>
<desc>
<address>
<addrLine>12 place du Panthéon - 75231 Paris Cedex 05</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.univ-paris1.fr/</ref>
</desc>
</org>
<org type="laboratory" xml:id="struct-95237">
<orgName>Institut für Deutsche Sprache und Linguistik</orgName>
<orgName type="acronym">IDSL</orgName>
<desc>
<address>
<addrLine>Dorotheenstraße 24, 10099 Berlin</addrLine>
<country key="DE"/>
</address>
<ref type="url">http://www.linguistik.hu-berlin.de/</ref>
</desc>
<listRelation>
<relation active="#struct-368014" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-118511">
<orgName>INRIA Saclay - Ile de France</orgName>
<orgName type="acronym">INRIA Saclay - Ile de France</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-368014">
<orgName>Humboldt Universität Berlin</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-184796">
<orgName>International Institute of Information Technology Hyperabad</orgName>
<orgName type="acronym">IIIT-H</orgName>
<desc>
<address>
<addrLine>Gachibowli, Hyderabad 500 032 Andhra Pradesh, INDIA</addrLine>
<country key="IN"/>
</address>
<ref type="url">http://www.iiit.ac.in/</ref>
</desc>
<listRelation>
<relation active="#struct-300171" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-56046">
<orgName>GALEN</orgName>
<orgName type="acronym">INRIA Saclay - Ile de France</orgName>
<desc>
<address>
<addrLine>Laboratoire MAS Ecole Centrale de Paris Grande Voie des Vignes 92295 Chatenay-Malabry Cedex</addrLine>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-300342" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-187174">
<orgName>Centre de vision numérique</orgName>
<orgName type="acronym">CVN</orgName>
<desc>
<address>
<addrLine>Grande voie des Vignes 92295 Châtenay-Malabry Cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://cvc.centrale-ponts.fr</ref>
</desc>
<listRelation>
<relation active="#struct-300342" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-300171">
<orgName>International Institute of Information Technology</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-300342">
<orgName>Ecole Centrale Paris</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="researchteam" xml:id="struct-388180">
<orgName>SA-IGA</orgName>
<orgName type="acronym">GIPSA-SA-IGA</orgName>
<desc>
<address>
<addrLine>GIPSA-lab, 11 rue des Mathématiques, Grenoble Campus BP46, F-38402 SAINT MARTIN D'HERES CEDEX</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.gipsa-lab.grenoble-inp.fr/saiga/accueil-saiga.php</ref>
</desc>
<listRelation>
<relation active="#struct-408339" type="direct"/>
<relation active="#struct-24470" type="indirect"/>
<relation active="#struct-300339" type="indirect"/>
<relation active="#struct-5485" type="indirect"/>
<relation name="UMR5216" active="#struct-388064" type="indirect"/>
<relation active="#struct-3886" type="indirect"/>
<relation active="#struct-51016" type="indirect"/>
<relation active="#struct-408340" type="direct"/>
</listRelation>
</org>
<org type="department" xml:id="struct-408339">
<orgName>Département Automatique</orgName>
<orgName type="acronym">GIPSA-DA</orgName>
<desc>
<address>
<addrLine>11 rue des Mathématiques, Grenoble Campus BP46, 38402 SAINT MARTIN D'HERES</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.gipsa-lab.fr/recherche/departement-automatique.php</ref>
</desc>
<listRelation>
<relation active="#struct-24470" type="direct"/>
<relation active="#struct-300339" type="indirect"/>
<relation active="#struct-5485" type="indirect"/>
<relation name="UMR5216" active="#struct-388064" type="indirect"/>
<relation active="#struct-3886" type="indirect"/>
<relation active="#struct-51016" type="indirect"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-24470">
<orgName>Grenoble Images Parole Signal Automatique</orgName>
<orgName type="acronym">GIPSA-lab</orgName>
<desc>
<address>
<addrLine>Gipsa-lab - 961 rue de la Houille Blanche - BP 46 - 38402 Grenoble cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.gipsa-lab.inpg.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-300339" type="direct"/>
<relation active="#struct-5485" type="direct"/>
<relation name="UMR5216" active="#struct-388064" type="direct"/>
<relation active="#struct-3886" type="direct"/>
<relation active="#struct-51016" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-300339">
<orgName>Institut Polytechnique de Grenoble - Grenoble Institute of Technology</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-5485">
<orgName>Université Stendhal</orgName>
<orgName type="acronym">Grenoble 3</orgName>
<desc>
<address>
<addrLine>BP 25 38040 Grenoble Cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.u-grenoble3.fr/stendhal/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-3886">
<orgName>Université Pierre Mendès France</orgName>
<orgName type="acronym">Grenoble 2 UPMF</orgName>
<desc>
<address>
<addrLine>BP 47 - 38040 Grenoble Cedex 9</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.upmf-grenoble.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-51016">
<orgName>Université Joseph Fourier</orgName>
<orgName type="acronym">Grenoble 1 UJF</orgName>
<desc>
<address>
<addrLine>Université Joseph Fourier - BP 53 - 38041 Grenoble Cedex 9</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.ujf-grenoble.fr/</ref>
</desc>
</org>
<org type="department" xml:id="struct-408340">
<orgName>Département Images et Signal</orgName>
<orgName type="acronym">GIPSA-DIS</orgName>
<desc>
<address>
<addrLine>11 rue des Mathématiques, Grenoble Campus BP46, 38402 SAINT MARTIN D'HERES</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.gipsa-lab.fr/recherche/departement-images-signal.php</ref>
</desc>
<listRelation>
<relation active="#struct-24470" type="direct"/>
<relation active="#struct-300339" type="indirect"/>
<relation active="#struct-5485" type="indirect"/>
<relation name="UMR5216" active="#struct-388064" type="indirect"/>
<relation active="#struct-3886" type="indirect"/>
<relation active="#struct-51016" type="indirect"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-2346">
<orgName>ALGORILLE</orgName>
<orgName type="acronym">INRIA Lorraine - LORIA</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation name="UMR7503" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-300291" type="direct"/>
<relation active="#struct-300292" type="direct"/>
<relation active="#struct-300293" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-300291">
<orgName>Université Henri Poincaré - Nancy I</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-300292">
<orgName>Université Nancy II</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-300293">
<orgName>Institut National Polytechnique de Lorraine (INPL)</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-35418">
<orgName>Laboratoire de l'Informatique du Parallélisme</orgName>
<orgName type="acronym">LIP</orgName>
<desc>
<address>
<addrLine>46 Allée d'Italie 69364 LYON CEDEX 07</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.ens-lyon.fr/LIP/</ref>
</desc>
<listRelation>
<relation name="UMR5668" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-194495" type="direct"/>
<relation active="#struct-301088" type="direct"/>
<relation active="#struct-6818" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-233">
<orgName>Laboratoire d'Informatique de Paris 6</orgName>
<orgName type="acronym">LIP6</orgName>
<desc>
<address>
<addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.lip6.fr/</ref>
</desc>
<listRelation>
<relation name="UMR7606" active="#struct-388064" type="direct"/>
<relation active="#struct-93591" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-182104">
<orgName>Centre for Artificial Intelligence</orgName>
<orgName type="acronym">CENTRIA</orgName>
<desc>
<address>
<addrLine>Departamento de Informática, FCT/UNL Quinta da Torre 2829-516 CAPARICA - Portugal</addrLine>
<country key="PT"/>
</address>
<ref type="url">http://centria.di.fct.unl.pt/</ref>
</desc>
<listRelation>
<relation active="#struct-300564" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-194495">
<orgName>Université Claude Bernard Lyon 1</orgName>
<orgName type="acronym">UCBL</orgName>
<desc>
<address>
<addrLine>43, boulevard du 11 novembre 1918, 69622 Villeurbanne cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.univ-lyon1.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-301088">
<orgName>PRES Université de Lyon</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-6818">
<orgName>École normale supérieure - Lyon</orgName>
<orgName type="acronym">ENS Lyon</orgName>
<desc>
<address>
<addrLine>15 parvis René Descartes - BP 7000 - 69342 Lyon Cedex 07</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.ens-lyon.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-93591">
<orgName>Université Pierre et Marie Curie - Paris 6</orgName>
<orgName type="acronym">UPMC</orgName>
<desc>
<address>
<addrLine>4 place Jussieu - 75005 Paris</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.upmc.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-300564">
<orgName>Universidade Nova de Lisboa</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-178327">
<orgName>ARIC</orgName>
<orgName type="acronym">Inria Grenoble Rhône-Alpes / LIP Laboratoire de l'Informatique du Parallélisme</orgName>
<desc>
<address>
<addrLine>46 Allée d'Italie 69364 Lyon France</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.ens-lyon.fr/LIP/AriC/</ref>
</desc>
<listRelation>
<relation name="UMR5668" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-194495" type="direct"/>
<relation active="#struct-6818" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-2544">
<orgName>Laboratoire de Recherche en Informatique</orgName>
<orgName type="acronym">LRI</orgName>
<desc>
<address>
<addrLine>LRI - Bâtiments 650-660 Université Paris-Sud 91405 Orsay Cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.lri.fr/</ref>
</desc>
<listRelation>
<relation name="UMR8623" active="#struct-388064" type="direct"/>
<relation active="#struct-92966" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-212219">
<orgName>TOCCATA</orgName>
<orgName type="acronym">INRIA Saclay - Île-de-France</orgName>
<desc>
<address>
<addrLine>Université Paris-Sud ; LRI - bâtiment 650 ; 91405 ORSAY CEDEX</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://toccata.lri.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-92966" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-301438" type="direct"/>
<relation name="UMR8623" active="#struct-388064" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-92966">
<orgName>Université Paris-Sud - Paris 11</orgName>
<orgName type="acronym">UP11</orgName>
<desc>
<address>
<addrLine>Bâtiment 300 - 91405 Orsay cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.u-psud.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-301438">
<orgName>Laboratoire de Recherche en Informatique</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-2003">
<orgName>Laboratoire d'InfoRmatique en Image et Systèmes d'information</orgName>
<orgName type="acronym">LIRIS</orgName>
<desc>
<address>
<addrLine>Bâtiment Blaise Pascal - 20, avenue Albert Einstein - 69621 Villeurbanne cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://liris.cnrs.fr/</ref>
</desc>
<listRelation>
<relation name="UMR5205" active="#struct-388064" type="direct"/>
<relation active="#struct-194495" type="direct"/>
<relation active="#struct-126765" type="direct"/>
<relation active="#struct-33804" type="direct"/>
<relation name="- LYON" active="#struct-301232" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-203131">
<orgName>CASA</orgName>
<orgName type="acronym">IRISA - UBS</orgName>
<desc>
<address>
<addrLine>IRISA, Université de Bretagne-Sud, Campus de Tohannic, 56017 Vannes</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www-irisa.univ-ubs.fr/CASA/index-en.html</ref>
</desc>
<listRelation>
<relation active="#struct-172265" type="direct"/>
<relation name="UMR6074" active="#struct-388064" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-218317">
<orgName>DICE</orgName>
<orgName type="acronym">Inria Grenoble Rhône-Alpes / CITI Insa Lyon</orgName>
<desc>
<address>
<addrLine>CITI Laboratory, INSA Lyon Domaine Scientifique de la Doua Batiment Claude Chappe 6 avenue des Arts 69621 Villeurbanne</addrLine>
<country key="FR"/>
</address>
<ref type="url">https://project.inria.fr/dice/</ref>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"/>
<relation name="- LYON" active="#struct-301232" type="direct"/>
</listRelation>
</org>
<org type="department" xml:id="struct-84538">
<orgName>École des Mines de Nantes</orgName>
<orgName type="acronym">Mines Nantes</orgName>
<desc>
<address>
<addrLine>La Chantrerie - 4, rue Alfred Kastler - BP 20722 - 44307 Nantes cedex 3</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.mines-nantes.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-302102" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-95496">
<orgName>Laboratoire d'économie et de management de Nantes Atlantique</orgName>
<orgName type="acronym">LEMNA</orgName>
<desc>
<address>
<country key="FR"/>
</address>
<ref type="url">http://www.iemniae.univ-nantes.fr/21073574/0/fiche___pagelibre/&RH=1187947570416&RF=1183733811753</ref>
</desc>
<listRelation>
<relation name="EA4272" active="#struct-93263" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-184756">
<orgName>Laboratoire Telecom Claude Chappe</orgName>
<orgName type="acronym">LT2C</orgName>
<desc>
<address>
<addrLine>LT2C Télécom Saint-Etienne 25 rue Dr Rémy Annino 42000 Saint-Etienne Cedex 2</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://lt2c.telecom-st-etienne.fr/FRA/index.html</ref>
</desc>
<listRelation>
<relation name="EA3523" active="#struct-300284" type="direct"/>
<relation active="#struct-346007" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-2377">
<orgName>GRAAL</orgName>
<orgName type="acronym">INRIA Grenoble Rhône-Alpes / LIP Laboratoire de l'Informatique du Parallélisme</orgName>
<desc>
<address>
<addrLine>LIP, ENS Lyon, 46 allée d'Italie, 69364 LYON cedex 07 France</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://graal.ens-lyon.fr/</ref>
</desc>
<listRelation>
<relation name="UMR5668" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-194495" type="direct"/>
<relation active="#struct-301269" type="direct"/>
<relation active="#struct-6818" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-203831">
<orgName>CITI Centre of Innovation in Telecommunications and Integration of services</orgName>
<orgName type="acronym">CITI</orgName>
<desc>
<address>
<addrLine>CITI Laboratory, INSA Lyon Domaine Scientifique de la Doua Batiment Claude Chappe 6 avenue des Arts 69621 Villeurbanne Cedex Phone +33 4 7243 6415 Fax +33 4 7243 6227 E-Mail citi@insa-lyon.fr</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.citi.insa-lyon.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-219748" type="direct"/>
<relation active="#struct-301232" type="indirect"/>
<relation active="#struct-300009" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-267787">
<orgName>ChronoCourse</orgName>
<orgName type="acronym">ChronoCourse</orgName>
<desc>
<address>
<addrLine>Vannes</addrLine>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation active="#struct-301100" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-126765">
<orgName>École Centrale de Lyon</orgName>
<orgName type="acronym">ECL</orgName>
<desc>
<address>
<addrLine>36 avenue Guy de Collongue - 69134 Ecully cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.ec-lyon.fr</ref>
</desc>
</org>
<org type="institution" xml:id="struct-33804">
<orgName>Université Lumière - Lyon 2</orgName>
<orgName type="acronym">UL2</orgName>
<desc>
<address>
<addrLine>86, rue Pasteur - 69007 Lyon</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.univ-lyon2.fr</ref>
</desc>
</org>
<org type="institution" xml:id="struct-301232">
<orgName>Institut National des Sciences Appliquées</orgName>
<orgName type="acronym">INSA</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-172265">
<orgName>Université de Bretagne Sud</orgName>
<orgName type="acronym">UBS</orgName>
<desc>
<address>
<addrLine>BP 92116 - 56321 Lorient cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.univ-ubs.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-302102">
<orgName>Institut Mines-Télécom</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-93263">
<orgName>Université de Nantes</orgName>
<orgName type="acronym">UN</orgName>
<desc>
<address>
<addrLine>1, quai de Tourville - BP 13522 - 44035 Nantes cedex 1</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.univ-nantes.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-300284">
<orgName>Université Jean Monnet - Saint-Etienne</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-346007">
<orgName>Ecole d'ingenieurs Telecom Saint Etienne</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-301269">
<orgName>Laboratoire d'informatique du Parallélisme</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="department" xml:id="struct-219748">
<orgName>Institut National des Sciences Appliquées - Lyon</orgName>
<orgName type="acronym">INSA Lyon</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation active="#struct-301232" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-301100">
<orgName>PME</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-81479">
<orgName>Imagerie Adaptative Diagnostique et Interventionnelle</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation name="U947" active="#struct-300002" type="direct"/>
<relation active="#struct-300291" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-205127">
<orgName>PAROLE</orgName>
<orgName type="acronym">INRIA Nancy - Grand Est / LORIA</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-302051" type="direct"/>
<relation name="UMR7503" active="#struct-388064" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-254586">
<orgName>Dispositif, Méthodologie et Technique pour l'IRM</orgName>
<orgName type="acronym">CIC-IT801</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation active="#struct-300002" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-300002">
<orgName>INSERM</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-302051">
<orgName>Université de Lorraine</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-162010">
<orgName>Laboratoire Traitement et Communication de l'Information</orgName>
<orgName type="acronym">LTCI</orgName>
<desc>
<address>
<addrLine>46 rue Barrault F-75634 Paris Cedex 13</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.ltci.telecom-paristech.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-300362" type="direct"/>
<relation active="#struct-302102" type="direct"/>
<relation name="UMR5141" active="#struct-388064" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-160294">
<orgName>Laboratory of Information, Network and Communication Sciences</orgName>
<orgName type="acronym">LINCS</orgName>
<desc>
<address>
<addrLine>23 avenue d'Italie 75013 Paris</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.lincs.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-93591" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-302102" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-2491">
<orgName>PLANETE</orgName>
<orgName type="acronym">INRIA Sophia Antipolis / INRIA Grenoble Rhône-Alpes</orgName>
<desc>
<address>
<country key="FR"/>
</address>
<ref type="url">http://www-sop.inria.fr/planete/index-fr.html</ref>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-300362">
<orgName>Télécom ParisTech</orgName>
<desc>
<address>
<addrLine>46 rue Barrault 75634 Paris Cedex 13</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.telecom-paristech.fr</ref>
</desc>
</org>
<org type="laboratory" xml:id="struct-54378">
<orgName>ALGORITHMS</orgName>
<orgName type="acronym">INRIA Rocquencourt</orgName>
<desc>
<address>
<country key="FR"/>
</address>
<ref type="url">http://www.inria.fr/equipes/algorithms</ref>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-100376">
<orgName>Laboratoire Informatique d'Avignon</orgName>
<orgName type="acronym">LIA</orgName>
<desc>
<address>
<addrLine>339 Chemin des Meinajaries Agroparc BP 1228 84911 Avignon cedex 9</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://lia.univ-avignon.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-195507" type="direct"/>
<relation active="#struct-302221" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-2446">
<orgName>AxIS</orgName>
<orgName type="acronym">INRIA Rocquencourt / INRIA Sophia Antipolis</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"/>
</listRelation>
</org>
<org type="researchteam" xml:id="struct-392245">
<orgName>TEXTE: Exploration et exploitation de données textuelles</orgName>
<orgName type="acronym">INFO/TEXTE</orgName>
<desc>
<address>
<country key="FR"/>
</address>
<ref type="url">http://www.lirmm.fr/recherche/equipes/texte</ref>
</desc>
<listRelation>
<relation active="#struct-407026" type="direct"/>
<relation active="#struct-181" type="indirect"/>
<relation active="#struct-410122" type="indirect"/>
<relation name="UMR5506" active="#struct-388064" type="indirect"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-57241">
<orgName>Ecole Polytechnique de Montreal</orgName>
<orgName type="acronym">EPM</orgName>
<desc>
<address>
<addrLine>Campus de l'Université de Montréal 2500, chemin de Polytechnique Montréal (Québec) H3T 1J4</addrLine>
<country key="CA"/>
</address>
<ref type="url">http://www.polymtl.ca/</ref>
</desc>
<listRelation>
<relation active="#struct-300447" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-195507">
<orgName>Université d'Avignon et des Pays de Vaucluse</orgName>
<orgName type="acronym">UAPV</orgName>
<desc>
<address>
<addrLine>74 rue Louis Pasteur - 84 029 Avignon cedex 1</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.univ-avignon.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-302221">
<orgName>Centre d'Enseignement et de Recherche en Informatique - CERI</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-300447">
<orgName>Université de Montréal</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-37506">
<orgName>MESCAL</orgName>
<orgName type="acronym">INRIA Grenoble Rhône-Alpes / LIG laboratoire d'Informatique de Grenoble</orgName>
<desc>
<address>
<addrLine>Inria Grenoble - Rhône-Alpes 655 avenue de l'Europe - Montbonnot 38334 Saint Ismier Cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://mescal.imag.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-51016" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-300275" type="direct"/>
<relation name="LIG" active="#struct-302247" type="direct"/>
<relation name="UMR5217" active="#struct-388064" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-24471">
<orgName>Laboratoire d'Informatique de Grenoble</orgName>
<orgName type="acronym">LIG</orgName>
<desc>
<address>
<addrLine>UMR 5217 - Laboratoire LIG - 38041 Grenoble cedex 9 - France Tél. : +33 (0)4 76 51 43 61 - Fax : +33 (0)4 76 51 49 85</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.liglab.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-51016" type="direct"/>
<relation active="#struct-300275" type="direct"/>
<relation active="#struct-3886" type="direct"/>
<relation name="UMR5217" active="#struct-388064" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-364074">
<orgName>CNRS</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-300275">
<orgName>Institut National Polytechnique de Grenoble (INPG)</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-302247">
<orgName>Laboratoire d'Informatique de Grenoble</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-59704">
<orgName>École normale supérieure - Paris</orgName>
<orgName type="acronym">ENS Paris</orgName>
<desc>
<address>
<addrLine>45, Rue d'Ulm - 75230 Paris cedex 05</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.ens.fr</ref>
</desc>
</org>
<org type="laboratory" xml:id="struct-54531">
<orgName>CASCADE</orgName>
<orgName type="acronym">INRIA Paris-Rocquencourt</orgName>
<desc>
<address>
<country key="FR"/>
</address>
<ref type="url">http://www.inria.fr/equipes/cascade</ref>
</desc>
<listRelation>
<relation name="UMR 8548" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-59704" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-188786">
<orgName>Faculty of Sciences, Technology, and Communication</orgName>
<desc>
<address>
<country key="LU"/>
</address>
</desc>
<listRelation>
<relation active="#struct-366875" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-221841">
<orgName>CryptoExperts</orgName>
<desc>
<address>
<addrLine>41 boulevard des Capucines, 75002 Paris</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.cryptoexperts.com</ref>
</desc>
<listRelation>
<relation active="#struct-375971" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-366875">
<orgName>University of Luxembourg</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-375971">
<orgName>CryptoExperts</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-2571">
<orgName>Laboratoire Spécification et Vérification [Cachan]</orgName>
<orgName type="acronym">LSV</orgName>
<desc>
<address>
<addrLine>Bâtiment d'Alembert 61 Avenue du Président Wilson 94235 CACHAN CEDEX</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.lsv.ens-cachan.fr/</ref>
</desc>
<listRelation>
<relation name="UMR8643" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-6862" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-157663">
<orgName>MEXICO</orgName>
<orgName type="acronym">INRIA Saclay - Ile de France</orgName>
<desc>
<address>
<addrLine>LSV, ENS Cachan 61 av président Wilson 94235 Cachan cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.lsv.ens-cachan.fr/axes/MEXICO/mexico?l=fr</ref>
</desc>
<listRelation>
<relation active="#struct-6862" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation name="UMR8643" active="#struct-388064" type="direct"/>
</listRelation>
</org>
<org type="researchteam" xml:id="struct-392183">
<orgName>ForTesse</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation active="#struct-2544" type="direct"/>
<relation name="UMR8623" active="#struct-388064" type="indirect"/>
<relation active="#struct-92966" type="indirect"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-6862">
<orgName>École normale supérieure - Cachan</orgName>
<orgName type="acronym">ENS Cachan</orgName>
<desc>
<address>
<addrLine>61, avenue du Président Wilson - 94230 Cachan</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.ens-cachan.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-300101">
<orgName>IGN</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-30598">
<orgName>Conception Objet et Généralisation de l'Information Topographique</orgName>
<orgName type="acronym">COGIT</orgName>
<desc>
<address>
<addrLine>2-4 avenue Pasteur, F-94165 St Mandé</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://recherche.ign.fr/labos/cogit/accueilCOGIT.php</ref>
</desc>
<listRelation>
<relation active="#struct-300101" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-301085">
<orgName>Université de Pau et des Pays de l'Adour</orgName>
<orgName type="acronym">UPPA</orgName>
<desc>
<address>
<addrLine>Avenue de l'Université - BP 576 - 64012 Pau Cedex </addrLine>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-29209">
<orgName>Laboratoire Informatique de l'Université de Pau et des Pays de l'Adour</orgName>
<orgName type="acronym">LIUPPA</orgName>
<desc>
<address>
<country key="FR"/>
</address>
<ref type="url">http://liuppa.univ-pau.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-301085" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-118082">
<orgName>LEO</orgName>
<orgName type="acronym">INRIA Saclay - Ile de France</orgName>
<desc>
<address>
<addrLine>Parc Club Orsay Université, 4 rue Jacques Monod - Bât G, 91893 Orsay Cedex France</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://leo.saclay.inria.fr//</ref>
</desc>
<listRelation>
<relation active="#struct-92966" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation name="UMR8623" active="#struct-388064" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-44971">
<orgName>EXMO</orgName>
<orgName type="acronym">INRIA Grenoble Rhône-Alpes / LIG Laboratoire d'Informatique de Grenoble</orgName>
<desc>
<address>
<addrLine>Inria Grenoble - Rhône-Alpes 655 avenue de l'Europe - Montbonnot 38334 Saint Ismier Cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.inrialpes.fr/exmo/</ref>
</desc>
<listRelation>
<relation name="UMR5217" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-51016" type="direct"/>
<relation active="#struct-3886" type="direct"/>
<relation active="#struct-300275" type="direct"/>
<relation name="LIG" active="#struct-302247" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-35546">
<orgName>Edelweiss</orgName>
<orgName type="acronym">INRIA Sophia Antipolis</orgName>
<desc>
<address>
<addrLine>2004 route des Lucioles BP93 06902 Sophia Antipolis</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www-sop.inria.fr/edelweiss/</ref>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"/>
</listRelation>
</org>
<org type="researchteam" xml:id="struct-388182">
<orgName>GraphiK: Graphs for Inferences on Knowledge</orgName>
<orgName type="acronym">INFO/GRAPHIK</orgName>
<desc>
<address>
<country key="FR"/>
</address>
<ref type="url">https://team.inria.fr/graphik/</ref>
</desc>
<listRelation>
<relation active="#struct-16791" type="direct"/>
<relation active="#struct-92699" type="indirect"/>
<relation name="UR1208" active="#struct-300001" type="indirect"/>
<relation name="UMR62" active="#struct-300004" type="indirect"/>
<relation active="#struct-410122" type="indirect"/>
<relation active="#struct-34586" type="direct"/>
<relation active="#struct-300009" type="indirect"/>
<relation active="#struct-407026" type="direct"/>
<relation active="#struct-181" type="indirect"/>
<relation name="UMR5506" active="#struct-388064" type="indirect"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-16791">
<orgName>Ingénierie des Agropolymères et Technologies Émergentes</orgName>
<orgName type="acronym">UMR IATE</orgName>
<desc>
<address>
<addrLine>Campus Inra-AgroM - 2, place Viala - 34060 Montpellier Cedex 1</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.montpellier.inra.fr/umr-iate/</ref>
</desc>
<listRelation>
<relation active="#struct-92699" type="direct"/>
<relation name="UR1208" active="#struct-300001" type="direct"/>
<relation name="UMR62" active="#struct-300004" type="direct"/>
<relation active="#struct-410122" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-92699">
<orgName>Centre international d'études supérieures en sciences agronomiques</orgName>
<orgName type="acronym">Montpellier SupAgro</orgName>
<desc>
<address>
<addrLine>Montpellier SupAgro - 2, place Pierre Viala - 34060 Montpellier Cedex 02</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.supagro.fr/</ref>
</desc>
</org>
<org type="institution" xml:id="struct-300001">
<orgName>Institut national de la recherche agronomique (INRA)</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-300004">
<orgName>Centre de coopération internationale en recherche agronomique pour le développement [CIRAD]</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-34586">
<orgName>INRIA Sophia Antipolis</orgName>
<orgName type="acronym">INRIA Sophia Antipolis</orgName>
<desc>
<address>
<addrLine>2004 route des Lucioles BP 93 06902 Sophia Antipolis</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www-sop.inria.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-17973">
<orgName>Computer Science & Engineering [Riverside]</orgName>
<orgName type="acronym">CSE</orgName>
<desc>
<address>
<addrLine>University of California, Riverside 900 University Ave. Riverside, CA 92521</addrLine>
<country key="US"/>
</address>
<ref type="url">http://www1.cs.ucr.edu/</ref>
</desc>
<listRelation>
<relation active="#struct-300446" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-135817">
<orgName>Intel Research [Berkeley]</orgName>
<desc>
<address>
<addrLine>Intel Labs Berkeley 2150 Shattuck Avenue, Penthouse Suite Berkeley, CA 94704</addrLine>
<country key="US"/>
</address>
<ref type="url">http://berkeley.intel-research.net/</ref>
</desc>
<listRelation>
<relation active="#struct-367569" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-2466">
<orgName>MASCOTTE</orgName>
<orgName type="acronym">INRIA Sophia Antipolis / Laboratoire I3S</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation name="UMR7271" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-117617" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-300446">
<orgName>University of California, Riverside</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-367569">
<orgName>Intel Research</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-105160">
<orgName>Université de Rennes 1</orgName>
<orgName type="acronym">UR1</orgName>
<desc>
<address>
<addrLine>2 rue du Thabor - CS 46510 - 35065 Rennes cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.univ-rennes1.fr/</ref>
</desc>
</org>
<org type="laboratory" xml:id="struct-2539">
<orgName>TRISKELL</orgName>
<orgName type="acronym">INRIA - IRISA</orgName>
<desc>
<address>
<addrLine>Campus de Beaulieu 35042 Rennes cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.inria.fr/equipes/triskell</ref>
</desc>
<listRelation>
<relation name="UMR6074" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-105160" type="direct"/>
<relation active="#struct-117606" type="direct"/>
<relation active="#struct-301232" type="indirect"/>
</listRelation>
</org>
<org type="department" xml:id="struct-117606">
<orgName>Institut National des Sciences Appliquées - Rennes</orgName>
<orgName type="acronym">INSA Rennes</orgName>
<desc>
<address>
<addrLine>20, avenue des Buttes de Coësmes - CS 70839 - 35708 Rennes cedex 7</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.insa-rennes.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-301232" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-55997">
<orgName>MAGIQUE-3D</orgName>
<orgName type="acronym">INRIA Bordeaux - Sud-Ouest</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation name="UMR5142" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-301085" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-87850">
<orgName>Laboratoire de Mathématiques et de leurs Applications [Pau]</orgName>
<orgName type="acronym">LMAP</orgName>
<desc>
<address>
<addrLine>Bâtiment IPRA - Université de Pau et des Pays de l'Adour Avenue de l'Université - BP 1155 64013 PAU CEDEX</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://lma-umr5142.univ-pau.fr/live/</ref>
</desc>
<listRelation>
<relation active="#struct-301085" type="direct"/>
<relation name="UMR5142" active="#struct-388064" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-123884">
<orgName>TOTAL-Scientific and Technical Center Jean Féger</orgName>
<orgName type="acronym">CSTJF</orgName>
<desc>
<address>
<addrLine>Centre Scientifique et Technique Jean Féger. Avenue Larribau 64018 Pau Cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.total.com/en/our-energies/oil/exploration-and-production/our-skills-and-expertise/cstjf-940845.html</ref>
</desc>
<listRelation>
<relation active="#struct-365908" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-365908">
<orgName>Total</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-2520">
<orgName>LAGADIC</orgName>
<orgName type="acronym">INRIA - IRISA</orgName>
<desc>
<address>
<addrLine>Campus de Beaulieu 35042 Rennes cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.inria.fr/equipes/lagadic</ref>
</desc>
<listRelation>
<relation name="UMR6074" active="#struct-388064" type="direct"/>
<relation active="#struct-300009" type="direct"/>
<relation active="#struct-105160" type="direct"/>
</listRelation>
</org>
<org type="laboratory" xml:id="struct-121780">
<orgName>Orange Labs R&D [Rennes]</orgName>
<desc>
<address>
<addrLine>4 rue du Clos Courtel, 35112 Cesson-Sévigné Cedex, France</addrLine>
<country key="FR"/>
</address>
</desc>
<listRelation>
<relation active="#struct-300518" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-300518">
<orgName>France Télécom</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-364346">
<orgName>McGill University</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="laboratory" xml:id="struct-49508">
<orgName>School of Computer Science [Quebec]</orgName>
<orgName type="acronym">SOCS</orgName>
<desc>
<address>
<addrLine>3480 University Street Montreal, McConnell Engineering Bldg, Rm 318, Quebec, Canada H3A 2A7 - Phone: (514) 398-7071 Fax: (514) 398-3883</addrLine>
<country key="CA"/>
</address>
<ref type="url">http://www.cs.mcgill.ca/</ref>
</desc>
<listRelation>
<relation active="#struct-300738" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-300738">
<orgName>McGill University</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
</listOrg>
<listOrg type="projects">
<org type="anrProject" xml:id="projanr-26863">
<idno type="anr">Collaborative Creation of Contents and Publishing using Opportunistic network,C3PO,ANR-13-CORD-0005</idno>
</org>
<org type="anrProject" xml:id="projanr-25398">
<idno type="anr">ANR-12-MONU-0019</idno>
<orgName>MARMOTE</orgName>
<desc>MARMOTE : MARkovian MOdeling Tools and Environments</desc>
<date type="start">2013</date>
</org>
</listOrg>
</back>
</text>
</TEI>
SWORD : Import de publication¶
Import sur le site de test https://api-preprod.archives-ouvertes.fr/sword/hal/ avec le compte test_ws dont le mot de passe est test.
Le paramètre –data-binary @filename (ici @tei2.xml) permet d’envoyer le fichier indiqué comme contenu (payload) de la requête POST (ou PUT).
Le paramètre -v permet d’avoir les informations plus détaillées que la seule réponse sword (partie XML en fin de réponse).
$ curl -v -u test_ws:test 'https://api-preprod.archives-ouvertes.fr/sword/hal/' -H "X-Packaging:http://purl.org/net/sword-types/AOfr" -X POST -H "Content-Type:text/xml" --data-binary @tei2.xml
* Hostname was NOT found in DNS cache
* Trying 193.48.96.10...
* Connected to api-preprod.archives-ouvertes.fr (193.48.96.10) port 443 (#0)
* successfully set certificate verify locations:
* CAfile: none
CApath: /etc/ssl/certs
* SSLv3, TLS handshake, Client hello (1):
* SSLv3, TLS handshake, Server hello (2):
* SSLv3, TLS handshake, CERT (11):
* SSLv3, TLS handshake, Server key exchange (12):
* SSLv3, TLS handshake, Server finished (14):
* SSLv3, TLS handshake, Client key exchange (16):
* SSLv3, TLS change cipher, Client hello (1):
* SSLv3, TLS handshake, Finished (20):
* SSLv3, TLS change cipher, Client hello (1):
* SSLv3, TLS handshake, Finished (20):
* SSL connection using ECDHE-RSA-AES256-GCM-SHA384
* Server certificate:
* subject: OU=Domain Control Validated; CN=*.archives-ouvertes.fr
* start date: 2014-03-31 00:00:00 GMT
* expire date: 2017-03-30 23:59:59 GMT
* subjectAltName: api-preprod.archives-ouvertes.fr matched
* issuer: C=NL; O=TERENA; CN=TERENA SSL CA
* SSL certificate verify ok.
* Server auth using Basic with user 'test_ws'
> POST /sword/hal/ HTTP/1.1
> Authorization: Basic dGVzdF93czp0ZXN0
> User-Agent: curl/7.35.0
> Host: api-preprod.archives-ouvertes.fr
> Accept: */*
> X-Packaging:http://purl.org/net/sword-types/AOfr
> Content-Type:text/xml
> Content-Length: 7243
> Expect: 100-continue
>
< HTTP/1.1 100 Continue
< HTTP/1.1 202 Accepted
< Date: Tue, 17 Feb 2015 15:53:44 GMT
* Server Apache/2.4.10 (Unix) OpenSSL/1.0.1e-fips is not blacklisted
< Server: Apache/2.4.10 (Unix) OpenSSL/1.0.1e-fips
< Set-Cookie: PHPSESSID=4m6qnli34998boet2h87fftve3; path=/
< Expires: Thu, 19 Nov 1981 08:52:00 GMT
< Cache-Control: no-store, no-cache, must-revalidate, post-check=0, pre-check=0
< Pragma: no-cache
< Location: https://halv3-preprod.archives-ouvertes.fr/hal-01025925
< Access-Control-Allow-Origin: *
< Content-Length: 747
< Content-Type: application/atom+xml
<
<?xml version="1.0" encoding="utf-8"?>
<entry xmlns="http://www.w3.org/2005/Atom" xmlns:sword="http://purl.org/net/sword/" xmlns:dcterms="http://purl.org/dc/terms/">
<title>Accepted media deposit to HAL</title>
<id>https://halv3-preprod.archives-ouvertes.fr/hal-01025925</id>
<updated>2015-02-17T16:53:45+01:00</updated>
<summary>A media deposit was stored in the HAL workspace</summary>
<sword:treatment>stored in HAL workspace</sword:treatment>
<sword:userAgent>HAL SWORD API Server</sword:userAgent>
<source>
<generator uri="https://api-preprod.archives-ouvertes.fr/sword" version="1.0">hal@ccsd.cnrs.fr</generator>
</source>
<link rel="alternate" href="https://halv3-preprod.archives-ouvertes.fr/hal-01025925"/>
</entry>
* Connection #0 to host api-preprod.archives-ouvertes.fr left intact
Fichier XML-TEI importé.
<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:hal="http://hal.archives-ouvertes.fr/">
<text>
<body>
<listBibl>
<biblFull>
<titleStmt>
<title xml:lang="und">The AZF explosion of September 21st : precise estimation of the origin time</title>
<author role="aut"><persName><forename type="first">Julien</forename><surname>Vergoz</surname></persName><email/><idno type="halauthor">532637</idno><affiliation ref="#struct-17953"/></author>
<author role="aut"><persName><forename type="first">Bruno</forename><surname>Feignier</surname></persName><email/><idno type="halauthor">532635</idno><affiliation ref="#struct-17953"/></author>
<author role="aut"><persName><forename type="first">Yves</forename><surname>Cansi</surname></persName><email/><idno type="halauthor">532636</idno><affiliation ref="#struct-17953"/></author>
<author role="aut"><persName><forename type="first">Jocelyn</forename><surname>Guilbert</surname></persName><email/><idno type="halauthor">532638</idno><affiliation ref="#struct-17953"/></author>
<author role="aut"><persName><forename type="first">Véra</forename><surname>Flavin</surname></persName><email/><idno type="halauthor">532639</idno><affiliation ref="#struct-17953"/></author>
<author role="aut"><persName><forename type="first">Jean-Louis</forename><surname>Lacoume</surname></persName><email/><idno type="halauthor">198718</idno><affiliation ref="#struct-24470"/></author>
</titleStmt>
<notesStmt>
<note type="audience" n="2">International</note><note type="invited" n="0">No</note><note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note><note type="proceedings" n="0">No</note>
</notesStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="und">The AZF explosion of September 21st : precise estimation of the origin time</title>
<author role="aut"><persName><forename type="first">Julien</forename><surname>Vergoz</surname></persName><idno type="halAuthorId">532637</idno><affiliation ref="#struct-17953"/></author>
<author role="aut"><persName><forename type="first">Bruno</forename><surname>Feignier</surname></persName><idno type="halAuthorId">532635</idno><affiliation ref="#struct-17953"/></author>
<author role="aut"><persName><forename type="first">Yves</forename><surname>Cansi</surname></persName><idno type="halAuthorId">532636</idno><affiliation ref="#struct-17953"/></author>
<author role="aut"><persName><forename type="first">Jocelyn</forename><surname>Guilbert</surname></persName><idno type="halAuthorId">532638</idno><affiliation ref="#struct-17953"/></author>
<author role="aut"><persName><forename type="first">Véra</forename><surname>Flavin</surname></persName><idno type="halAuthorId">532639</idno><affiliation ref="#struct-17953"/></author>
<author role="aut"><persName><forename type="first">Jean-Louis</forename><surname>Lacoume</surname></persName><idno type="halAuthorId">198718</idno><affiliation ref="#struct-24470"/></author>
</analytic>
<monogr>
<idno type="localRef">Département Images et Signal</idno>
<title level="m">European Seismological Commission, ESC 2010</title>
<meeting>
<title>European Seismological Commission, ESC 2010</title>
<date type="start">2010-09-06</date>
<date type="end">2010-09-10</date>
<settlement>Montpellier</settlement>
<country key="FR"/>
</meeting><imprint>
<biblScope unit="pp">poster</biblScope>
<date type="datePub">2010</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc>
<langUsage>
<language ident="en"/>
</langUsage>
<textClass>
<classCode scheme="halDomain" n="shs.hisphilso"/>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
</profileDesc>
</biblFull>
</listBibl>
</body>
<back>
<listOrg type="laboratories">
<org type="laboratory" xml:id="struct-17953">
<orgName>Laboratoire de Géophysique</orgName>
<orgName type="acronym">LDG</orgName><desc><address>
<addrLine>CEA DIF F-91297, Arpajon</addrLine>
<country key="FR"/></address>
</desc>
<listRelation>
<relation name="DIF" active="#struct-300016" type="direct"/>
</listRelation></org>
<org type="laboratory" xml:id="struct-24470">
<orgName>Grenoble Images Parole Signal Automatique</orgName>
<orgName type="acronym">GIPSA-lab</orgName>
<desc>
<address>
<addrLine>Gipsa-lab - 961 rue de la Houille Blanche - BP 46 - 38402 Grenoble cedex</addrLine>
<country key="FR"/>
</address>
<ref type="url">http://www.gipsa-lab.inpg.fr/</ref>
</desc>
<listRelation>
<relation active="#struct-300272" type="direct"/>
<relation active="#struct-300273" type="direct"/>
<relation active="#struct-300274" type="direct"/>
<relation active="#struct-300339" type="direct"/>
<relation name="UMR5216" active="#struct-388064" type="direct"/>
</listRelation>
</org>
<org type="institution" xml:id="struct-300016">
<orgName>CEA</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-300272">
<orgName>Université Joseph Fourier - Grenoble I</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-300273">
<orgName>Université Pierre-Mendès-France - Grenoble II</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-300274">
<orgName>Université Stendhal - Grenoble III</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-300339">
<orgName>Institut Polytechnique de Grenoble - Grenoble Institute of Technology</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
<org type="institution" xml:id="struct-388064">
<orgName>CNRS</orgName>
<desc>
<address>
<country key="FR"/>
</address>
</desc>
</org>
</listOrg>
</back>
</text>
</TEI>
Chrome - Application “Advanced REST Client”¶
Requête GET avec “Advanced REST Client”¶
Par défaut, récupération de json¶
En spécifiant le Content-Type¶
On peut saisir des couples clé / valeur à insérer / modifier dans l’en-tête HTTP et notamment le Content-Type.
Récupération de XML¶
Récupération de CSV¶
Référentiel des structures de recherche¶
Référentiel des types de documents¶
Chrome - Postman “REST client”¶
Cette application est capable de faire l’import par POST et semble plus conviviale que l’application “Advanced REST Client”.
SWORD : Import de publication¶
La préparation de la requête est beaucoup plus intuitive et assistée par la complétion automatique plus riche que dans l’autre application.
Et ça a le bon goût de fonctionner
SoapUI¶
SoapUI est une application Java que j’ai utilisée pour faire des tests d’API Soap (comme son nom l’indique).
GCette application permet également de créer un projet REST, mais c’est plutôt lourd à mon goût pour ce type d’API et elle s’est plantée à plusieurs occasions lors de mes tests (définitivement figée).
On est face à une sorte de cliquodrôme géant où il n’est pas évident de trouver où les informations doivent être placées et dont le comportement peut surprendre. Je n’ai pas vu comment effacer l’affichage des données retournées, qui sont conservées d’une requête à l’autre (on se retrouve avec une vue json et une vue xml alors que j’aimerais que seule les données reçues en dernière instance soient affichées).
Du coup, j’avais l’impression que le Content-type n’était pas pris en compte lorsqu’on le précisait mais en regardant les logs HTTP et SoapUI cela semble fonctionner.
C’est un outil qui demande une prise en main plus longue, documentation : http://www.soapui.org/rest-testing/getting-started.html
A la création du projet il faut spécifier l’URL, ce qui laisse penser qu’il faudra un projet pour les référentiels et un projet pour les recherches de publications, voire un projet pour l’import : ce n’est pas le cas voir plus loin la création de Resources, de Méthodes et de Requêtes.
SoapUI semble reprendre ici le principe SOAP de récupérer une description des services Web existants (WADL, WSDL) pour générer des squelettes d’appel aux API.
Ceci est très pratique pour des API Soap, mais les services REST ne fournissent pas nécessairement ce type de descriptif (et le principe en est même discuté). Sans descriptif, il faut créer les éléments à la main et ce n’est pas évident.
Lorsque l’on créer ses éléments à la main, il semble que SoapUI génère un WADL à partir de ces données.
Une fois l’URL saisie, SoapUI crée un projet complet avec :
- un Service http://api.archives-ouvertes.fr/ (génération d’un WADL ?),
- une Resource /ref/structure,
- une Méthode GET
- une Requête qui semble correspondre aux paramètres ?fq=valid_s:VALID&rows=10&q="centre de calcul" (l’encodage des caractères spéciaux semble être fait par l’outil)
et il ouvre l’éditeur de requêtes.
Référentiel des structures de recherche¶
Référentiel des types de documents¶
Référentiel des listes de métadonnées¶
metaName_s = relator¶
Après un clic droit sur le Service http://api.archives-ouvertes.fr/, sélectionner new resource et saisir /ref/metadatalist.
SoapUI génère alors une méthode GET et une requête à laquelle il faut ajouter les paramètres souhaités (query string). Voir la documentation SoapUI Understanding REST Parameters.
Par défaut les paramètres créés ont pour Level : Resource ce qui entraîne que ces paramètres seront appliqués à toutes les requêtes associées aux méthodes de cette ressource. On peut indiquer que Method plutôt que Resource pour les paramètres.
En bas, à gauche de l’éditeur de requête on peut afficher un panneau header et y ajouter des paramètres de header HTTP comme le Content-Type.
metaName_s = relatedType¶
Ajouter simplement une nouvelle requête à la méthode GET de la Resource /ref/metadatalist par un clic droit sur la méthode, puis en sélectionnant new request.
Les paramètres définis pour la méthode GET précédente sont déjà définis et on peut en changer la valeur.
Recherche¶
Après un clic droit sur le Service http://api.archives-ouvertes.fr/, sélectionner new resource et saisir /search.
Dépôts 2014 avec fichiers¶
Ici on a une difficulté, l’éditeur de requêtes n’accepte pas de mettre 2 paramètres de même nom fq : fq=submitType_s:file et fq=submittedDateY_i:2014.
Arg ... il semblerait que ce soit un bug et qui n’est pas récent, c’est assez ennuyeux ! Le bug serait SOAPUI-4646 mais leur bugtracker n’est pas public :/
- http://stackoverflow.com/a/24168328/481719
- http://community.smartbear.com/t5/SoapUI-Open-Source/Single-Parameter-Multiple-times-in-Rest-Request/td-p/36588
Pour cette requête, il peut être contourné en désactivant l’encodage du paramètre et en mettant comme valeur les autres paramètres. Dans ce cas, il faut bien sûr encoder soit même les caractères spéciaux (comme avec curl).
Dépôts INRIA domaine informatique¶
Le contournement du bug semble avoir fonctionné également pour cette requête.
SWORD : Import de publication¶
Après un clic droit sur le Projet REST, sélectionner New REST service from URI pour travailler avec le service sword de test.
Saisir l’URL du service sword de test https://api-preprod.archives-ouvertes.fr/sword/hal/.
Changer la requête HTTP créée par défaut de GET en POST et ajouter des informations d’authentification.
Sélectionner l’authentification Basic
et saisissez “test_ws” comme Username et “test” comme Password sans l’onglet “Auth”, sélectionner Authenticate pre-emptively comme “Pre-emptive auth”.
Ajouter les en-têtes HTTP spécifiques :
- X-Packaging: http://purl.org/net/sword-types/AOfr
- Content-Type:text/xml
dans l’onglet Headers.
Consulter aussi la documentation SoapUI Working with REST Requests
Note
If you want to insert the message body from a file instead then leave the editor empty and add a single attachment with the same content-type as the set media-type for the message; SoapUI will insert the contents of the file into the message body instead of attaching it as a MIME attachment.
J’ai modifié le Media Type pour mettre text/html comme l’en-tête Content-Type ajoutée dans l’onglet “Headers” et j’ai également spécifié text/html pour la propriété Content-Type du fichier tei2.xml chargé dans l’onglet Attachments (je n’ai pas accepté l’option “cache” proposée lorsque l’on charge le fichier). Il faut peut-être recharger le fichier attaché lorsque l’on modifie sa propriété Content-Type.
Voici l’affichage des requêtes HTTP échangées.
