Aller au contenu principal
FR

# Jessica BOUCHEZ

Villeneuve d'Ascq Cedex

Bâtiment: Building: E

Bureau: Office: 109

Qui contacter en cas d'absence: In case of emergency:
Olivier DELAFRAYE

# Jessica BOUCHEZ

### Activités de recherche

- Gestion des publications,  visibilité des publications et des chercheurs,  identité numérique
scientifique..), culture de diffusion en accès libre

- Politique de signature des publications

- Repérage des publications, fourniture d'indicateurs bibliométriques

- Fonds documentaire du Campus de Lille

-ITRD

### My latest references

#### Decembre 2020

HOUBBADI, Adnane, 2020, Optimisation multicritère de la gestion de la recharge d'une flotte de bus électriques, Thèse de doctorat de l'Université de Lyon, Ecole DoctoraleED160 EEA, Spécialité : Génie Électrique, Université de Lyon, 219p.

Télécharger le document

KABALAN, Bilal, 2020, Méthodologie de génération systématique et de conception des chaines de traction de véhicules hybrides, THESE de DOCTORAT DE L'UNIVERSITE DE LYON opérée au sein de l'Université Claude Bernard Lyon 1, Spécialité de doctorat : Génie électrique Discipline : Sciences pour l'ingénieur, Université de Lyon

Télécharger le document

GONZALEZ RAMIREZ, Humberto, 2020, Etude des choix des usagers dans les réseaux de transport grâce à un "jeu de simulation", Thèse de doctorat de l'université de Lyon, Spécialité Génie Civil, Université de Lyon, 211p

Télécharger le document

ALISOLTANI DEHKORDI, Negin, 2020, Méthodes d'optimisation basée sur la simulation pour le covoiturage dynamique, Thèse de doctorat de l'université de Lyon, Spécialité Génie Civil, Université de Lyon, 195p

Télécharger le document

ALJ, Ismail, 2020, Durabilité des capteurs à fibre optique destinés aux mesures réparties de déformation dans les ouvrages en béton, Thèse de doctorat de l'Université Paris-Est, spécialité Génie Civil, Université Paris-Est, 385 p., photos, graph., fig., bibliogr., ann.

Télécharger le document

WANG, Ao, 2020, Imagerie différentielle en ondes de surface sismiques et ultrasonores pour le monitoring de structures anthropiques et du proche sous-sol environnant, Thèse de doctorat, Ecologie, Géosciences, Agronomie et Alimentation, Spécialité : Sciences de la Terre et de l'environnement, Université de Nantes, 161 p

Télécharger le document

CHAR, François, 2020, Estimation des bénéfices apportés en sécurité routière par des avertisseurs de collision frontale pour des piétons et des cyclistes et sensibilité de ces systèmes, Thèse de doctorat de l'université d'Aix-Marseille, Discipline : Sciences du Mouvement Humain, AMU - Aix Marseille Université, 293p

Télécharger le document

GHASEMI, Navid, 2020, Improvement of the driving simulator control and comparison between driver-road-vehicule interaction in real and simulated environment, Thèse de doctorat, Università degli studi Bologna, 219p

Télécharger le document

BOULET, Xavier, 2020, Articulation d'échelles en simulation de mobilité, Thèse de doctorat en Informatique, Université Paris-Est, Université Paris-Est, 129p

Télécharger le document

MARTINET, Simon, 2020, Estimation in-situ des facteurs d'émission des polluants du trafic routier, Thèse de doctorat de l'Université de Lyon, spécialité : Sciences de l'environnement / Émissions des transports, Université de Lyon

Télécharger le document

EL BOUSTANI, Chadi, 2020, Méthodes numériques efficaces et innovantes pour la modélisation non-linéaire des structures des charpentes métalliques , Thèse de doctorat, spécialité : structures et matériaux, Université Paris-Est, 208 p

Plus d'infos

ALAVOINE, Axelle, 2020, Modélisation du comportement des sédiments riches en hydrates de gaz via l'homogénéisation des propriétés micro-mécaniques , Thèse de doctorat, spécialité : géotechnique, Université Paris-Est, 170 p

Télécharger le document

BOULAUD, Romain, 2020, Etudes et modélisations du comportement d'un écran de filet pare-blocs à différentes échelles , Thèse de doctorat génie civil, spécialité : structure et matériaux, Université Paris-Est

Télécharger le document

BOU LEBA BASSIL, Marianne, 2020, Étude des mécanismes aérodynamiques à l'origine du bruit de contact pneumatique/chaussée, Thèse de doctorat de l'Ecole centrale de Nantes, spécialité : mécaniques des milieux fluides, École Centrale de Nantes, 182

Télécharger le document

RATON, Gwenaelle, GONCALVES, Amélie, GAILLARD, Leila, WALLET, Frédéric, 2020, Logistique des circuits courts alimentaires de proximité : état des lieux, nouveaux enjeux et pistes d'évolution. Synthèse , -, 21p

Télécharger le document

BOURBIA, Véréna, 2020, Le rôle de la diversité urbaine et commerciale sur les pratiques logistiques des commerces de détail alimentaires en ville : le cas des Hauts-de-France , Thèse de doctorat en Géographie, Université de Lille, Laboratoire Clersé UMR CNRS 8019, Université de Lille, Laboratoire Clersé UMR CNRS 8019, 409 p

Télécharger le document

MANZINI, Nicolas, 2020, Surveillance de santé structurale des ouvrages d'art incluant les systèmes de positionnement par satellites, Thèse de doctorat, spécialité Génie civil, Université Paris-Est, Université Paris-Est Créteil - UPEC, 214 p., graph., photos, bibliogr.

Télécharger le document

PERUL, Johan, 2020, Localisation autonome par apprentissage des dynamiques de déplacement en transport multimodal, Thèse de doctorat, Mathématiques et Sciences et Technologies de l'Information et de la Communication. Spécialité : Automatique, Productique, Robotique, Ecole centrale de Nantes, 156p

Télécharger le document

EL ARJA, Hiba, 2020, Contribution à la modélisation numérique des excavations profondes , Thèse de doctorat, spécialité géotechnique, Université Paris-Est, 230p

Télécharger le document

KAMENGA, Franck, 2020, Optimisation combinatoire intégrée de la gestion du matériel roulant et de la circulation ferroviaire dans les gares de passagers, Thèse de doctorat de l'Université de Lille, Spécialité Informatique, Université de Lille, 89p

Télécharger le document

NGUYEN, Minh-Hieu, 2020, Deriving trip's modes and trip's purposes from GPS-based travel surveys, Thesis for the degree of Doctor of Sciences, Université Paris-Est ; Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux - IFSTTAR, 154p

Télécharger le document

LASSERRE-BIGORRY, Vincent, 2020, Consommation de logement, parcours résidentiels et accession à la propriété en Île-de-France : une approche par la modélisation, Thèse de doctorat, Discipline : Aménagement de l'espace, urbanisme, Université Paris-Est, Université Paris-Est, 389p

Télécharger le document

PERRIN, Julie, 2020, La territorialisation des gares franciliennes de la grande vitesse ferroviaire face aux mutations du modèle TGV : Une analyse par la desserte du cas de Marne-la-Vallée Chessy, Thèse de doctorat de l'Université Paris-Est, Géographie, Université Paris-Est

Télécharger le document

VIZZARI, Domenico, 2020, Mix-design d'une nouvelle couche semi-transparente pour les routes solaires, Thèse de doctorat, Sciences pour l'Ingénieur, spécialité Génie civil, École centrale de Nantes, 180 p

Télécharger le document

KAYSER, Bill, 2020, Estimation des incertitudes de modélisation du bruit des éoliennes, Thèse de doctorat de Le Mans Université, spécialité : acoustique, Université du Maine, 191 p

Télécharger le document

ALHAJJ, Marie-Antoinette, 2020, Inversion conjointe de mesures non destructives pour l'évaluation des gradients de degré de saturation dans le béton d'enrobage des structures, Thèse de doctorat en Sciences pour l'ingénieur, spécialité Génie civil, École centrale de Nantes, 273 p.

Télécharger le document

Li, Qiutong, 2020, Analyses des mécanismes de réduction du bruit et prévision des effets des barrières presque fermées dans le transport ferroviaire urbain , Thèse de doctorat, spécialité structures et matériaux , Tongji university (Shanghai, Chine), 233 p

Télécharger le document

TELLIER, Xavier, 2020, Morphogenèse des structures courbes sous contrainte de fabrication , Thèse de doctorat, spécialité structures et matériaux, Université Paris-Est, 215p

Télécharger le document

BERTIN, Ingrid, 2020, Conception des bâtiments assurant leur réversibilité, leur déconstruction et leur réemploi, méthodologie de suivi et évaluation environnementale sur les cycles de vie , Thèse de doctorat, discipline : structures et matériaux, Université Paris-Est, 339 p

Télécharger le document

TRAN, Le-Hung, 2020, Développement de traverses instrumentées pour l'étude du comportement des voies ferrées , Thèse de doctorat, Université Paris-Est

Télécharger le document

N'GOUAMBA, Elie Merveille, 2020, Rhéologie des suspensions aqueuses de noir de carbone et de fluides à seuil modèles dans leur régime solide Rhéologie des suspensions aqueuses de noir de carbone et de fluides à seuil modèles dans leur régime solide, Thèse de doctorat, 222p

Télécharger le document

DE ALMEIDA PEREIRA, Dalay Israel, 2020, Analyse et spécification formelle des systèmes d'enclenchement ferroviaire basés sur les relais, Thèse de doctorat, Spécialité : Informatique, Automatique, Ecole Centrale de Lille, 184p

Télécharger le document

SAKOUT, Sofia, 2020, Modèle mésoscopique rapide de croissance de grain par mise àjour de tesselations orientées et homogénéisation probabiliste , Thèse de doctorat, spécialité sciences et matériaux, Université Paris-Est, 127p

Télécharger le document

SOUHEIL GEBAI, Sarah, 2020, Optimisation d'un amortisseur de masse accordé de type cantilever passif pour réduire le tremblement postural de la main , Thèse de doctorat, Université Libanaise Internationale

Plus d'infos

LOPES DOS SANTOS, Alexandre, 2020, Détermination du module de cisaillement des sols sous faibles déformations à partir d?une sonde pressiométrique innovante : Application au dimensionnement cyclique des pieux , Thèse de doctorat, spécialité géotechnique, Université Paris-Est, 376p

Télécharger le document

DAKTERA, Tomasz, 2020, Evaluation des méthodes de calcul des écrans de soutènement à partir du retour d'expérience de grands travaux récents, Thèse présentée pour l'obtention du grade de Docteur de l'Université Paris-Est, Spécialité : géotechnique, Université Paris-Est, Université Paris-Est, 290p

Télécharger le document

Allocating imprecise safety targets in satellite-based localization systems used in railway signaling operations

SASSI, Insaf ; BEUGIN, Julie ; SALLAK, Mohamed ; AIT TMAZIRTE, Nourdine   /   (2020)

ESREL'20 - PSAM 15, 30th European Safety and Reliability Conference and the 15th Probabilistic Safety Assessment and Management Conference, ITALIE, 8p

Plus d'infos

#### titre

Il n'y a aucune publication pour cette liste.

#### titre réf

Allocating imprecise safety targets in satellite-based localization systems used in railway signaling operations

SASSI, Insaf ; BEUGIN, Julie ; SALLAK, Mohamed ; AIT TMAZIRTE, Nourdine   /   (2020)

ESREL'20 - PSAM 15, 30th European Safety and Reliability Conference and the 15th Probabilistic Safety Assessment and Management Conference, ITALIE, 8p

Plus d'infos

#### ref decembre

On the robust guidance of users in road traffic networks

FARHI, Nadir ; HAJ SALEM, Habib ; LEBACQUE, Jean Patrick   /   (2014)

ICNAAM - International Conference of Numerical Analysis and Applied Mathematics, GRECE, 4p

Télécharger le document

#### Un ajout pour mise à jour

Info pour jeudi

Allocating imprecise safety targets in satellite-based localization systems used in railway signaling operations

SASSI, Insaf ; BEUGIN, Julie ; SALLAK, Mohamed ; AIT TMAZIRTE, Nourdine   /   (2020)

ESREL'20 - PSAM 15, 30th European Safety and Reliability Conference and the 15th Probabilistic Safety Assessment and Management Conference, ITALIE, 8p

Plus d'infos

Towards a Model-Based Safety Assessment of Railway Operation Using GNSS Localization

HIMRANE , Ouail ; BEUGIN, Julie ; GHAZEL, Mohamed   /   (2020)

ESREL'20 - PSAM 15, 30th European Safety and Reliability Conference and the 15th Probabilistic Safety Assessment and Management Conference, ITALIE, 8p

Plus d'infos

Démonstration de la sécurité opérationnelle de la téléconduite des trains : contexte, méthodologie et défis

BOUSSIF, Abderraouf ; COLLART-DUTILLEUL, Simon ; BARANOWSKI, François ; BEUGIN, Julie ; SCHON, Walter   /   (2020)

Lambda Mu 22, 22e Congrès de maîtrise des risques et de sûreté de fonctionnement, Les risques au coeur des transitions (e-congrès), FRANCE, pp312-320

Plus d'infos

Proposition d'une approche orientée modèles pour évaluer la sécurité des systèmes de signalisation ferroviaire utilisant les GNSS

HIMRANE, Ouail ; BEUGIN, Julie ; GHAZEL, Mohamed   /   (2020)

Lambda Mu 22, 22e Congrès de maîtrise des risques et de sûreté de fonctionnement. Les risques au coeur des transitions (e-congrès), FRANCE, pp687-696

Plus d'infos

From French National Signaling Systems to ERTMS: Considering the Evolution of Track-Side Systems

DE ALMEIDA PEREIRA, Dalay Israel ; HIMRANE, Ouail ; BON, Philippe ; BEUGIN, Julie   /   (2021)

International Journal of Signal Processing Systems, 9, 2, pp11-16

Télécharger le document

#### Hal id

Benoît Kloeckner, Alain l'Hostis, Thomas Richard
Contextual metrics. A mathematical definition for a comprehensive approach of geographical distances. Geographical Analysis, Wiley, 2020
Claire Tollis, Alain L'hostis, Redha Boubakour
Low Appetite for High Tech: When the Indifference of Inhabitants to Digital Mobilities Impedes a Smart Suburbs Project. International Journal of Urban Planning and Smart Cities (IJUPSC), 2020, 1 (1), pp.45-57
Alain l'Hostis
All geographical distances are optimal. Cybergeo : Revue européenne de géographie / European journal of geography, UMR 8504 Géographie-cités, 2020
Mirko Goletz, Sonja Haustein, Christina Wolking, Alain L'hostis
Intermodality in European metropolises: The current state of the art, and the results of an expert survey covering Berlin, Copenhagen, Hamburg and Paris. Transport Policy, Elsevier, 2020, 94, pp.109-122
Claire Tollis, Alain L'hostis, Redha Boubakour
Quand la participation des habitants retoque le projet d'un périurbain intelligent. Enseignements d'un programme de recherche-action sur les mobilités durables à Loos-en-Gohelle (62). revue Urbanités, Urbanités, 2019, 11p
Nathan Bounie, François Adoue, Martin Koning, Alain L'hostis
What value do travelers put on connectivity to mobile phone and Internet networks in public transport? Empirical evidence from the Paris region. Transportation Research : Part A, Policy and Practice, 2019, 130, pp158-177
Eleni Chalkia, Maria Teresa de la Cruz, Imre Keseru, Alain l'Hostis, Beate Muller
Societal Trends Influencing Mobility and Logistics in Europe: A Comprehensive Analysis.. Towards User-Centric Transport in Europe, Challenges, Solutions and Collaborations Challenges, Solutions and Collaborations, Springer Nature, pp. 31-49, 2018, Lecture Notes in Mobility
Francis Papon, Alain l'Hostis
La mobilité produit l'urbanisme, et inversement. La Jaune et la Rouge, 2018, 5p
Alain l'Hostis, Thomas Leysens, Liu Liu
Contribution de la future ligne ferroviaire à grande vitesse Tours-Bordeaux au développement des réseaux des villes, une évaluation par le potentiel de contact. Cybergeo : Revue européenne de géographie / European journal of geography, UMR 8504 Géographie-cités, 2018
Eleni Chalkia, Beate Mueller, Alain l'Hostis
The role of societal resistance in transportation innovation. 8th International Congress on Transportation Research: Transportation by 2030: Trends and perspectives, Sep 2017, THESSALONIKI, France. pp.12P
Alain l'Hostis, Liu Liu, Thomas Leysens
Using contact potential measurements to analyse future intercity links made possible by the Tours-Bordeaux High-Speed Rail line. Belgeo : Revue Belge de Géographie, National Committee of Geography of Belgium, Société Royale Belge de Géographie, 2017
Hélène Jacquot-Guimbal, Jean-Bernard Kovarik, Latifa Oukhellou, Alain l'Hostis, Guillaume Uster
Réussir les transitions que nous sommes en train de vivre. Point de vue de la directrice de l'Institut Francais des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux - Ifsttar. Transports Environnement Circulation, ATEC ITS France, 2017, 2p
Anne Aguilera-Belanger, Nacima Baron, J
Berrada, O. Bonin, V. Boutueil, et al.. Les mots du LVMT (Laboratoire Ville Mobilité Transport). 2017
Alain l'Hostis, Claude Soulas, Bogdan Vulturescu
A Multi‐criteria approach for choosing a new public transport system linked to urban development: a method developed in the Bahn.Ville project for a tram‐train scenario in the Saint‐Étienne region. RTS - Recherche Transports Sécurité, IFSTTAR, 2017, 2016 (01-02), pp.17-25
Alain l'Hostis
Detour and break optimising distance, a new perspective on transport and urbanism. Environment and Planning B: Planning and Design, SAGE Publications, 2017, 44 (3), pp.441-463
Alain l'Hostis
Shriveling time-space relief representation of the world at the time of Concorde 1977-2003. Computer graphics. France. 2016
Alain l'Hostis
The first unparametrized image of the shrivelled world. author A L'Hostis 2016. Computer graphics. France. 2016
Alain l'Hostis
Misunderstanding geographical distances: two errors and an issue in the interpretation of violations of triangle inequality. Cybergeo : Revue européenne de géographie / European journal of geography, UMR 8504 Géographie-cités, 2016
Alain l'Hostis, Leysens Thomas, Liu Liu
"Potentiel de contact" des villes. FNAU. Abécédaire Systèmes territoriaux régionaux, 2016
Alain l'Hostis
Les périmètres du Transit Oriented Development : caractérisation de la relation entre ville et transport collectifs. 2016
Alain l'Hostis, Beate Muller, Gereon Meyer, Annette Bruckner, Erzsebet Foldesi, et al.
MOBILITY4EU - D2.1 - Societal needs and requirements for future transportation and mobility as well as opportunities and challenges of current solutions. [Research Report] IFSTTAR - Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux. 2016, 85p
Alain l'Hostis, Sébastien Darchen
Characterising Transit Oriented Development in the Paris metropolitan region: what type of TOD are they?. 2015
Monica Coralli, Alain l'Hostis
Le train et la ville : un jeu de distances et de proximités. 2015
Alain l'Hostis
Le détour, la pause et l'optimalité, Essai sur la distance et ses apports au transport et à l'urbanisme. Architecture, aménagement de l'espace. Université Paris-Est, 2014
Liu Liu, Alain l'Hostis
Transport and Land Use Interaction: A French Case of Suburban Development in the Lille Metropolitan Area (LMA). Transportation Research Procedia, Elsevier, 2014, Sustainable Mobility in Metropolitan Regions. mobil.TUM 2014. International Scientific Conference on Mobility and Transport. Conference Proceedings, 4, pp.120 - 139
Alain l'Hostis, Claude Soulas, Gebhard Wulfhorst
La ville orientée vers le rail et l'intermodalité. Gérard Brun. Ville et mobilité, nouveaux regards, Economica, pp.115-126, 2013, Méthodes et Approches, 978-2-7178-6627-8
Alain l'Hostis
Theoretical models of time-space: the role of transport networks in the shrinking and shrivelling of geographical space. Rozenblat Céline, Mélançon Guy. Multilevel Analysis and visualization of Geographical Networks, Springer, pp.55-66, 2013, Methodos Series, vol. 11
Anne Aguilera, Alain l'Hostis, Neil Paulley
Land-use and transport interactions: Towards a research agenda. European Transport Conference, Sep 2013, Francfort, Germany. pp.x-x
L Halbert, M-N Comin, C Ducruet, Alain l'Hostis, D Peeters, et al.
Analyse comparative des métropoles européennes, rapport final, DATAR. 2013
Alain l'Hostis, E Alexandre, M Appert, C Araud-Ruyant, M Basty, et al.
Concevoir la ville à partir des gares, rapport final du Projet Bahn.Ville 2 sur un urbanisme orienté vers le rail, octobre. 2013
Alain l'Hostis, E Alexandre, M Appert, C Araud-Ruyant, M Basty, et al.
Rapport intermédiaire du projet Bahn.Ville 2 recherche action pour un urbanisme orienté vers le rail dans la région stéphanoise. 2013
Alain l'Hostis
Contactability p. 85-90 in Accessibility Instruments for Planning Practice edited by A. Hull, C. Silva, L. Bertolini, COST action Accessibility Instruments. 2013
Petter Christiansen, Olav Eidhammer, Jardar Andersen, Alain l'Hostis, G Adamos, et al.
Case studies: results and synthesis projet 7FP CLOSER (Connecting LOng and Short-distance networks for Efficient Transport) Rapport de recherche Deliverable 5.2 project européen CLOSER.. [Research Report] European Commission. 2012
Yves Crozet, Alain l'Hostis, Benjamin Collin, Anne-Laure Jeannez
Transport public et développement urbain durable en France et aux USA; partie relative au cas français. 2012
Alain l'Hostis
Métropoles sans aéroport international ? La contribution de l'intermodalité TGV-aérien au potentiel de contact des villes françaises dans le réseau des métropoles européennes. Colloque : L'intermodalité en questions - Durabilité, accessibilité, mobilité, Jun 2012, Montpellier, France
Alain l'Hostis, Thomas Leysens
Les méthodes de mesure et de représentation de l'accessibilité dans les méthodes d'évaluation des projets de transport interurbains et périurbains de voyageurs: méthode, indicateurs, applications et limites de la contactabilité.. 2012
Nathanail Eftithia, G Adamos, L Parra, E Ruiz-Ayucar, Alain l'Hostis, et al.
Deliverable D32 Core indicators for the interconnection between short and long-distance transport networks ; projet 7FP CLOSER (Connecting LOng and Short-distance networks for Efficient Transport); September 2011. [Research Report] European Commission. 2011
Ludovic Halbert, Marie Noëlle Comin, César Ducruet, Alain l'Hostis, D
Peeters, et al.. Analyse comparative des métropoles européennes. 2011, 248 p
B
Vulturescu, Alain l'Hostis, C. Soulas. Simulation des temps de parcours du transport ferroviaire régional du bassin de vie stéphanois dans le cadre du projet Bahn.Ville. RTS - Recherche Transports Sécurité, IFSTTAR, 2011, 27 (4), pp.283-297
Eftihia Nathanail, G
Adamos, Alain l'Hostis, L. Parra, E. Ruiz-Ayucar, et al.. Deliverable D4.1 Analysis of the Decision-Making framework, projet 7FP CLOSER (Connecting LOng and Short-distance networks for Efficient tRansport), july 2011. Deliverable D4.1, 2011
Alain l'Hostis, Alexis Conesa
Defining Intermodal Accessibility. in A Banos and Th Thévenin (eds). Geographical Information and Urban Transport System, Geographical Information Series, ISTE/Wiley, pp. 53-81, 2011
Alain l'Hostis
Le foncier des environs de gare, enjeu d'un développement urbain orienté vers le rail. Etudes foncières, Compagnie d'édition foncière, 2011, pp.3
Alain l'Hostis, Thomas Leysens, Johannes Keller
Fostering rail-based accessibility by land management. European Transport Conference ETC 2011, Oct 2011, Glasgow, United Kingdom
Alain l'Hostis
Contactability measures for assessing the competitiveness of European cities and networks of cities: the potential for high-speed rail and air to support a polycentric development. European Transport Conference ETC 2011, Oct 2011, Glasgow, United Kingdom
Ludovic Halbert, Patricia Cicille, Marie-Noëlle Cornin, César Ducruet, Alain l'Hostis, et al.
Analyse comparative des métropoles européennes. 2011, 334 p
Alain l'Hostis
El predial en el entorno de una estación ferroviaria Implicación de un desarrollo urbano orientado hacia el riel. Transporte y ciudad, foro de la movilidad, 2011, pp.40-42
A Lhostis
Le foncier des environs de gare, enjeu d'un développement urbain orienté vers le rail. Etudes foncières, Compagnie d'édition foncière, 2011, 3p
Alain l'Hostis
Les transports du polycentrisme européen, une analyse par la contactabilité entre métropoles. 11ème colloque du groupe de travail Mobilités Spatiales et Fluidité Sociale (MSFS) de l'Association Internationale des Sociologues de Langue Française (AISLF) : Mobilités spatiales et ressources métropolitaines : l'accessibilité en questions, Mar 2011, Grenoble, France
Moritz Lennert, Gilles van Hamme, Catherine Patris, Maciej Smętkowski, Adam Płoszaj, et al.
FOCI Future Orientation for Cities. 2010
Alain l'Hostis, Gebhard Wulfhorst, Sabina Morkisz, Hélène Pretsch, Vaclav Stransky, et al.
An Urbanism oriented towards rail in Germany and France: selected findings of the Bahn.Ville project. 2010
Alain l'Hostis, Sandra Bozzani-Franc
Contactability measures for assessing urban competitiveness. 2010
Sandra Bozzani-Franc, Thomas Leysens, Alain l'Hostis, Claude Soulas, Bogdan Vulturescu
Un Urbanisme orienté vers le rail illustré par le projet Bahn.Ville. Claude Soulas, Martine Wahl. Innovation dans les transports guidés urbains et régionaux, Hermès, p. 253-302, 2010
G Wulfhorst, Alain l'Hostis, H Pretsch, S Morkisz, V Stransky, et al.
An urbanism oriented towards rail in Germany and France, three main findings of a research-action program. General Proceedings of the 12th World Conference on Transport Research Society, Jul 2010, Lisbon, Portugal
Alain l'Hostis, Alexis Conesa
Définir l'accessibilité intermodale. Arnaud Banos, Thomas Thévenin. Systèmes de Transport Urbain, Hermès, pp.24, 2010, IGAT
Alain l'Hostis, Elsa Alexandre, Manuel Appert, Catherine Araud-Ruyant, Marius Basty, et al.
Concevoir la ville à partir des gares, Rapport final du Projet Bahn.Ville 2 sur un urbanisme orienté vers le rail. 2009
Alain l'Hostis
The shriveled USA: Representing time-space in the context of metropolitanization and the development of high speeds. Journal of Transport Geography, Elsevier, 2009, 17, pp.433-439
Alain l'Hostis, S Bozzani-Franc
Air and high-speed rail, territorial impact and opportunities for metropolitan performance. LINK european project final conference, Jun 2008, Köln, Germany
Alain l'Hostis
Mesurer l'accessibilité intermodale pour mieux relier l'organisation des réseaux et l'organisation territoriale dans la région urbaine de Lille. MobilTUM, Apr 2008, München, Allemagne
Reg Harman, Philippe Menerault, Alain l'Hostis
Public transport in cities and regions, Facing an uncertain future?. Ph. Booth, M. Breuillard, C. Fraser, D. Paris. Spatial Planning Systems of Britain and France, A comparative analysis, Routledge, pp.188-205, 2007
Alain l'Hostis
Graph theory and representation of distances : chronomaps, and other representations. Mathis Ph. Graphs and networks, multilevel modelling,, Lavoisier, pp.177-191, 2007
Sabine Avril, Sandra Bozzani-Franc, Alain l'Hostis, Francesca Pico, Jacques Bize, et al.
Strategic Research Agenda for Urban Mobility. 2007
Alexis Conesa, Alain l'Hostis
Accessibilité horaire des transports collectifs, un outil d'analyse pour la relation entre transport et aménagement du territoire. Journée d’échanges sur l’accessibilité des voyageurs en interurbain : enjeux et méthodes, Réseau des Economistes Transport et Aménagement (RETA), Apr 2007, La Défense, Paris, France
Alain l'Hostis, Gebhard Wulfhorst, Benjamin Puccio, Catherine Araud-Ruyant
Urbanisme et transport dans les régions urbaines : enjeux et perspectives d'un urbanisme orienté vers le rail. RTS - Recherche Transports Sécurité, IFSTTAR, 2007, pp.11-26
Alain l'Hostis, Hervé Baptiste
A Transport network for a City network: Analysing the quality of the public transport service in the Nord-Pas-de-Calais region. European Journal of Spatial Development, 2006, 18 p
Alain l'Hostis, Sandra Bozzani
Lille, une métropole sans aéroport international ? Analyse de la performance territoriale du nœud air-fer à grande vitesse de Roissy Charles de Gaulle dans l'accessibilité lilloise. RTS - Recherche Transports Sécurité, IFSTTAR, 2006, pp.157-170
Philippe Menerault, Alain Barré, Alexis Conesa, Alain l'Hostis, Paola Pucci, et al.
Multipolarités urbaines et nouvellles organisations intermodales. 2006
Céline Rozenblat, G
Melançon, D. Auber, C. Discazeaux, Alain l'Hostis, et al.. Worldwide Multi-Level Networks of Cities Emerging From Air Traffic (2000). Rubén C. Lois González. Urban changes in differents scales. Systems and structures, University of Santiago de Compostela, Publications Service, pp.N.C, 2006
Philippe Menerault, Alain Barré, Alexis Conesa, Alain l'Hostis, Paola Pucci, et al.
Multipolarités urbaines et nouvelles organisations intermodales. 2006, 126p
Alain l'Hostis, Philippe Menerault, Christophe Decoupigny
Assessing Spatial Planning Policy with Accessibility Indicators: the case of Lille's Metropolis Scenario. Beuthe M., Himanen V., Reggiani A., Zamparini L. Transport Development and Innovation in an Evolving world, Springer, pp.293-312, 2004
Philippe Menerault, Alain l'Hostis
Projets de grande vitesse ferroviaire en Grande-Bretagne : lignes ou réseau ?. Hommes et Terres du Nord, 2003, pp.43-54
Alain l'Hostis
De l'Espace contracté à l'espace chiffonné : Apports de l'animation à la cartographie en relief des distances-temps modifiées par les réseaux de transport rapides. Revue Internationale de Géomatique, Lavoisier, 2003, pp.69-80
Alain l'Hostis
Théorie des graphes et représentations des distances : chronocartes et autres représentations. Philippe Mathis. Graphes et réseaux, modélisation multiniveau, Lavoisier, pp.215-230, 2003, Information Géographique et Aménagement du Territoire
Alain l'Hostis, Christophe Decoupigny, Philippe Menerault, Nicolas Morice
Cadencement et intermodalité de l'offre en transport collectif en Nord-Pas-de-Calais, Analyse et propositions d'amélioration. 2001, 121p
Philippe Menerault, Alain l'Hostis
Analyse des relations réseaux/territoires : restructuration de l'offre ferroviaire de l'axe Lille/Valenciennes/Jeumont. 2000, 85p
Alain l'Hostis
Images de synthèse pour l'Aménagement du territoire : la déformation de l'espace par les réseaux de transport rapide. Géographie. Université François Rabelais - Tours, 1997. Français
Alain l'Hostis
Transports et aménagement du territoire : cartographie par images de synthèse d'une métrique réseau. Mappe Monde, Maison de la géographie, 1996, pp.37-43
Alain l'Hostis
The first time-space relief cartography, analog photo of cathodic screen, Europe. Computer graphics. France. 1994
Alain l'Hostis, Philippe Mathis, Nadine Polombo
Les grandes vitesses. Alain Bonnafous; François Plassard; Bénédicte Vulin. Circuler demain, Datar / éditions de l'aube, 1993, 2-87678-126-3

#### test geoloc

TAIA ALAOUI, Fadoua, 2018, Navigation des personnes aux moyens des technologiesdes smartphones et des données d'environnements cartographiés, Thèse de doctorat de l'école centrale de Nantes, Spécialité: Signal, Image, Vision, Université Bretagne-Loire, 153 p

Télécharger le document

ORTIZ, Miguel, PERUL, Johan, TORRES-SOSPEDRA, Joaqim, RENAUDIN, Valérie, 2018, Datasets and Supporting Materials for the IPIN 2018 Competition Track 4, IPIN 2018, 9th International conference on Indoor Positioning and Indoor Navigation, Nantes, FRANCE, 2018-09-24, DOI: 10.5281/zenodo.3228012

Plus d'infos

ANTIGNY, Nicolas, SERVIERES, Myriam, RENAUDIN, Valérie, 2018, Continuous Pose Estimation for Urban Pedestrian Applications on Hand-held Mobile Device, IPIN' 18, International Conference on Indoor Positioning and Indoor Navigation, Nantes, France, 2018-09-24, Institute of Electrical and Electronics Engineers - IEEE

Plus d'infos

ABID, Mahdi, RENAUDIN, Valérie, ROBERT, Thomas, AOUSTIN, Yannick, LE CARPENTIER, Eric, 2018, A Simulation-based Approach to Generate Walking Gait Accelerations for Pedestrian Navigation Solutions, IPIN'18, International Conference on Indoor Positioning and Indoor Navigation, Nantes, France, 2018-09-24, Institute of Electrical and Electronics Engineers - IEEE, 8 p.

Plus d'infos

PERUL, Johan, RENAUDIN, Valérie, 2018, Building individual inertial signals models to estimate PDR walking direction with smartphone sensors, IPIN'18, International Conference on Indoor Positioning and Indoor Navigation, NANTES, FRANCE, 2018-09-24, September, Institute of Electrical and Electronics Engineers - IEEE, p. 24-27

Plus d'infos

ZHU, Ni, 2018, Modélisation du canal de propagation GNSS en milieu contraint: Contribution à l'amélioration de la qualité de service de géolocalisation , Thèse de Doctorat, Discipline Sciences de l'information et de la communication, Université de Lille, 220p

Télécharger le document

ABIB, Mahdi, 2018, Walking gait features extraction and characterization using wearable devices, Thèse de doctorat de l'Ecole Centrale de Nantes, spécialité : Automatique, productique, robotique, L'ÉCOLE CENTRALE DE NANTES, Ecole Centrale de Nantes, 168

Télécharger le document

ANTIGNY, Nicolas, 2018, Estimation continue de la pose d'un équipement tenu en main par fusion des données visio-inertielles pour les applications de navigation piétonne en milieux urbains, Thèse de doctorat. Spécialité : Signal, Image, Vision, Université Loire Bretagne, 114 p

Télécharger le document

RENAUDIN, Valérie, 2018, Integrating human dimension in the development of pedestrian navigation, ITSNT 2018, International Technical Symposium on Navigation and Timing, TOULOUSE, FRANCE, 2018-11-13, 34p

Télécharger le document

RENAUDIN, Valérie, KHAMITOVA, Aigul, ORTIZ, Miguel, 2018, IPIN 2018 - Ninth International Conference On Indoor Positioning And Indoor Navigation, IPIN 2018, Nantes, France, 2018-09-24, IFSTTAR, 183 p.

Télécharger le document

MANZINI, Nicolas, ORCESI, André, THOM, Christian, CLEMENT, Antoine, BOTTON, Serge, ORTIZ, Miguel, DUMOULIN, John, 2018, Structural Health Monitoring using a GPS sensor network, EWSHM'18, 9th European Workshop on Structural Health Monitoring Series, MANCHESTER, ROYAUME-UNI, 2018-07-10, British Institute of Non Destructive Testing, 12 p.

Plus d'infos

MANZINI, Nicolas, ORCESI, André, THOM, Christian, BOTTON, Serge, CLEMENT, Antoine, ORTIZ, Miguel, DUMOULIN, John, 2018, Use of low-cost GNSS receivers for Structural Health Monitoring, 40th IABSE Symposium : Tomorrow's Megastructures, NANTES, FRANCE, 2018-09-19, International Association for Bridge and Structural Engineering - IABSE, 8 p.

Plus d'infos

RENAUDIN, Valérie, 2018, Human dimensions of navigation, The Israel Navigation Workshop and Exhibition INWE18, Hertzliya, ISRAEL, 2018-01-29

Plus d'infos

RENAUDIN, Valérie, 2018, Préparation de la compétition internationale de localisation intérieure IPIN : cartographie de parcours piétons, Forum de l'Association Française de Topographie , Anglet, FRANCE, 2018-03-29

Télécharger le document

RENAUDIN, Valérie, MOREAU, Nicolas, BILLEY, Antoine, LAMBLIN, Alexandre, VOS, Jasper, PERUL, Johan, ORTIZ, Miguel, 2018, Préparation de la compétition internationale de localisation intérieure IPIN : cartographie de parcours piétons, XYZ, 155, Association Française de Topographie - AFT, pp. 17-21

Plus d'infos

ANTIGNY, Nicolas, SERVIERES, Myriam, RENAUDIN, Valérie, 2018, Fusion of 3D GIS, Vision, Inertial and Magnetic Data for Improved Urban Pedestrian Navigation and Augmented Reality Applications, Navigation, WILEY, DOI: 10.1002/navi.254

Plus d'infos

PEYRET, François, GILLIERON, Pierre Yves, EUROPEAN COOPERATION IN THE FIELD OF SCIENTIFIC AND TECHNICAL RESEARCH - COST, 2018, SaPPART Guidelines: Performance assessment of positioning terminals, Techniques et méthodes, TMI 3, Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux - IFSTTAR, 45p

Télécharger le document

ANTIGNY, Nicolas, SERVIERES, Myriam, RENAUDIN, Valérie, 2018, Continuous Pose Estimation for Urban Pedestrian Mobility Applications on Smart-Handheld Devices, 2018 International Conference on Indoor Positioning and Indoor Navigation (IPIN), Nantes, FRANCE, 2018-09-24, IEEE, 8 p, DOI: 10.1109/IPIN.2018.8533680

Plus d'infos

Tijero, E. Domínguez, Fernández, L. Martínez, Herrero Zarzosa, Jorge Javier, Ibañez-Guzmán, J., Stawiarski, E., Xu, Philippe, Avellone, G., Pisoni, F., Falletti, E., ORTIZ, Miguel, 2018, High Accuracy Positioning Engine with an Integrity Layer for Safety Autonomous Vehicles, Proceedings of the 31st International Technical Meeting of the Satellite Division of The Institute of Navigation , MIAMI, ETATS-UNIS, 2018-09-24, Wiley-Blackwell, pp. 1566-1572, DOI: 10.33012/2018.15843

Plus d'infos

PERUL, Johan, RENAUDIN, Valérie, 2019, Fusion of Attitude and Statistical Walking Direction Estimations with Time-Difference Carrier Phase Velocity Update for Pedestrian Dead Reckoning Method, ION GNSS+'19, 32nd International Technical Meeting of the Satellite Division of The Institute Of Navigation, MIAMI, ETATS-UNIS, 2019-09-16, WILEY, p. 367-377, DOI: 10.33012/2019.17035

Télécharger le document

ZHU, Ni, ORTIZ, Miguel, RENAUDIN, Valérie, 2019, Seamless Indoor-Outdoor Infrastructure-free Navigation for Pedestrians and Vehicles with GNSS-aided Foot-mounted IMU, 2019 International Conference on Indoor Positioning and Indoor Navigation (IPIN), PISE, ITALIE, 2019-09-30, Institute of Electrical and Electronics Engineers - IEEE, 8 p.

Plus d'infos

GRENIER, Antoine, RENAUDIN, Valérie, 2019, Efficient Use of SSR RTCM Streams For Real-Time Precise Point Positioning on Smartphones, WPNC19, 16th Workshop on Positioning, Navigation and Communications, BREME, ALLEMAGNE, 2019-10-23, Institute of Electrical and Electronics Engineers - IEEE, 28 p.

Plus d'infos

GRENIER, Antoine, RENAUDIN, Valerie, 2019, Efficient Use of SSR RTCM Streams For Real-Time Precise Point Positioning on Smartphones Main objective Investigate precise positioning , in real-time , on Android Device using RTCM streams for low computation costs, WPNC'19, 16th Workshop on Positioning, Navigation and Communications, BREME, ALLEMAGNE, 2019-10-23, Institute of Electrical and Electronics Engineers - IEEE, p. 1-18

Plus d'infos

RENAUDIN, Valérie, ORTIZ, Miguel, PERUL, Johan, TORRES-SOSPEDRA, Joaquín, RAMON JIMENEZ, Antonio, PEREZ-NAVARRO, Antoni, MENDOZA-SILVA, German Martin, SECO, Fernando, LANDAU, Yaël, MARBEL, Retival, BEN-MOSHE, Boaz, ZHENG, Xingyu, YE, Feng, KUANG, Jian, LI, Yu, NIU, Xiaoji, LANDA, Vlad, HACOHEN, Shlomi, SHVALD, Nir, LU, Shuanhua, UCHIYAMA, Ideaki, THOMAS, Diego, SHIMADA, Atsushi, TANIGUCHI, Rin-Ichiro, KRONENWETT, Nikolai, VLADIMIROV, Blagovest, LEE, Soyeon, CHO, Eunyoung, JUN, Sungwoo, LE, Changeun, -, -, 2019, Evaluating Indoor Positioning Systems in a Shopping Mall: The Lessons Learned From the IPIN 2018 Competition, IEEE ACCESS, 7, Institute of Electrical and Electronics Engineers - IEEE, 148594 - 148628, DOI: 10.1109/ACCESS.2019.2944389

Télécharger le document

ANTIGNY, Nicolas, UCHIYAMA, Hideaki, SERVIERES, Myriam, RENAUDIN, Valérie, THOMAS, Diego, TANIGUCHI, Rin-ichiro, 2019, Solving Monocular Visual Odometry Scale Factor with Adaptive Step Length Estimates for Pedestrians Using Handheld Devices, sensors, 19, Multidisciplinary Digital Publishing Institute - MDPI, 1-18, DOI: 10.3390/s19040953

Télécharger le document

PERUL, Johan, RENAUDIN, Valérie, 2019, Learning individual models to estimate the walking direction of mobile phone users, IEEE Sensors Journal, 10 p, IEEE, DOI: 10.1109/JSEN.2019.2940138

Télécharger le document

RENAUDIN, Valérie, ORTIZ, Miguel, 2019, véhicules autonomes, 59e congrès annuel du club EEA , RENNES, FRANCE, 2019-06-12

Télécharger le document

RENAUDIN, Valérie, 2019, Indoor positioning: towards an infinite number of technologies?, 10th Chinese Satellite Navigation Conference, BEIJING, CHINE, 2019-05-22, 20p

Télécharger le document

POTORTÌ, FRANCESCO, PARK, SANGJOON, CRIVELLO, ANTONINO, PALUMBO, FILIPPO, GIROLAMI, MICHELE, BARSOCCHI, PAOLO, LEE, SOYEON, TORRES-SOSPEDRA, JOAQUÍN, JIMENEZ, ANTONIO RAMÓN, PÉREZ-NAVARRO, ANTONI, MENDOZA-SILVA, GERMÁN M., SECO, FERNANDO, ORTIZ, Miguel, PERUL, JOHAN, RENAUDIN, Valérie, KANG, HYUNWOONG, PARK, SOYOUNG, LEE, JAE-HONG, PARK, CHAN GOOK, HA, JISU, HAN, JAESEUNG, PARK, CHANGJUN, KIM, KEUNHYE, LEE, YONGHYUN, GYE, SEUNGHUN, LEE, KEUMRYEOL, KIM, EUNJEE, CHOI, JEONGSIK, CHOI, YANG-SEOK, TALWAR, SHILPA, CHO, SEONG YUN, BEN-MOSHE, BOAZ, SCHERBAKOV, ALEX, ANTSFELD, LEONID, SANSANO-SANSANO, EMILIO, CHIDLOVSKII, BORIS, KRONENWETT, NIKOLAI, PROPHET, SILVIA, LANDAU, YAEL, MARBEL, REVITAL, ZHENG, Lingxiang, PENG, Ao, LIN, Zhichao, WU, Bang, MA, Chengqoi, POSLAD, Stefan, SELVIAH, David, WU, Wei, MA, Zixiang, ZHANG, Wenchao, 2020, The IPIN 2019 Indoor Localisation Competition - Description and Results, IEEE Access, Institute of Electrical and Electronics Engineers Inc., 46p, DOI: 10.1109/ACCESS.2020.3037221

Télécharger le document

PERUL, Johan, RENAUDIN, Valérie, 2020, HEAD: smootH Estimation of wAlking Direction with a hand-held device embedding inertial, GNSS and magnetometer sensors, Navigation, Journal of the Institute of Navigation, WILEY, 17p, DOI: 10.1002/navi.389

Télécharger le document

DULERY, Christelle, ORTIZ, Miguel, LEBLAN, Xavier, 2020, EN 16803/ Référentiel Européen de géolocalisation pour certifier les solutions de Mobilité, RDMI'20, 47ème Congrès ATEC ITS France, les Rencontres De la Mobilité Intelligente, Montrouge, FRANCE, 2020-01-22, 9p

Télécharger le document

RAGOIN, Céline, RENAUDIN, Valérie, ORTIZ, Miguel, 2020, Precise positioning on smartphones: which implementation strategy to adopt?, GNSS'20, 4th Global Navigation Satellite Systems Raw Measurements Taskforce Workshop, PRAGUE, TCHÈQUE, RÉPUBLIQUE, 2020-05-27, 12p.

Télécharger le document

RUOTSALAINEN, Laura, RENAUDIN, Valérie, PEI, Ling, PIRAS, Marco, MARAIS, Juliette, CAVALHERI, Emerson, KAASALAINEN, Sanna, 2020, Toward Autonomous Driving in Arctic Areas, IEEE Intelligent Transportation Systems Magazine, IEEE, 15 p., DOI: 10.1109/MITS.2020.2994014

Télécharger le document

KONE, Yacouba, ZHU, Ni, RENAUDIN, Valérie, ORTIZ, Miguel, 2020, Machine Learning-Based Zero-Velocity Detection for Inertial Pedestrian Navigation, IEEE Sensors Journal, Institute of Electrical and Electronics Engineers - IEEE, 11p, DOI: 10.1109/JSEN.2020.2999863

Télécharger le document

ZHU, Ni, BETAILLE, David, MARAIS, Juliette, BERBINEAU, Marion, 2020, GNSS Integrity Monitoring Schemes for Terrestrial Applications in Harsh Signal Environments, IEEE Intelligent Transportation Systems Magazine , Institute of Electrical and Electronics Engineers - IEEE, 11p, DOI: 10.1109/MITS.2020.2994076

Plus d'infos

PONTE MULLER, Fabian, MUNOZ DIAZ, Estefania, PERUL, Johan, RENAUDIN, Valérie, 2020, Urban vulnerable road user localization using gnss, inertial sensors and ultra-wideband ranging, IEEE-IV'2020, IEEE Intelligent Vehicles Symposium, LAS VEGAS, ETATS-UNIS, 2020-10-20, Institute of Electrical and Electronics Engineers - IEEE, 7p

Plus d'infos

RENAUDIN, Valérie, ORTIZ, Miguel, RAGOIN, Céline, 2020, Positionnement GNSS précis sur smartphone : une réalité proche ?, Groupede Travail GNSS et Positionnementde la CNIG, Bouguenais, FRANCE, 2020-10-16, 13p

Télécharger le document

MANZINI, Nicolas, ORCESI, André, THOM, Christian, BROSSAULT, Marc-Antoine, BOTTON, Serge, ORTIZ, Miguel, DUMOULIN, John, 2020, Performance analysis of low-cost GNSS stations for structural health monitoring of civil engineering structures, Structure and Infrastructure Engineering, Taylor & Francis Ltd, 61 p., DOI: 10.1080/15732479.2020.1849320

Télécharger le document

ORTIZ, Miguel, BENMEZIANE , Karim, 2020, CEN standards in GNSS for Road/Automotive. Benefits of using EN16803 series for the automotive sector, UCP, 3rd edition of the User Consultation Platform, Virtuel, 2020-12-01, 15p

Télécharger le document

AL ABIAD, Naïma, RENAUDIN, Valérie, ROBERT, Thomas, 2020, Assessing gait variability from cellphone IMU placed in several locations: a feasibility study, Computer Methods in Biomechanics and Biomedical Engineering, 23, S1, TAYLOR AND FRANCIS, s1-s3, DOI: 10.1080/10255842.2020.1811490

Télécharger le document

ZHU, Ni, ORTIZ, Miguel, RENAUDIN, Valérie, ICHARD, Cécile, RICOU, Sander, 2020, Dataset of the intermediate competition in Challenge MALIN: Indoor-outdoor inertial navigation system data for pedestrian and vehicle with high accuracy references in a context of firefighter scenario, Data in Brief, 34, Elsevier, 14p, DOI: 10.1016/j.dib.2020.106626

Télécharger le document

PERUL, Johan, 2020, Localisation autonome par apprentissage des dynamiques de déplacement en transport multimodal, Thèse de doctorat, Mathématiques et Sciences et Technologies de l'Information et de la Communication. Spécialité : Automatique, Productique, Robotique, Ecole centrale de Nantes, 156p

Télécharger le document

# Ma liste perso html

Voici ma page web

Ceci est maliste html Ceci est mon texte.

Un lien vers mon site Web préféré.

## HAL : Dernières publications

• Pour la correction de textes obtenus automatiquement par numérisation puis reconnaissance optique de caractères, il est possible d’utiliser la plateforme Wikisource. Cette plateforme collaborative, hébergée comme Wikipédia par une fondation américaine, la Wikimedia Foundation, permet de visualiser simultanément la page scannée et le texte extrait automatiquement, éventuellement parsemé d’erreurs, pour corriger ce dernier et le mettre en forme (italique, notes de bas de page, titres de chapitres, etc.). Nous montrons dans cet article qu’en utilisant Wikisource, l’étape de saisie et de formatage des textes peut devenir un moyen de transmettre des savoirs non seulement numériques mais aussi littéraires, en particulier quand elle prend la forme d’un projet pédagogique associé à un enseignement universitaire ou d’une activité de stage. Cette démarche permet de bénéficier des avantages de la pédagogie par projet, notamment un apprentissage plus actif et une pédagogie plus individualisée. Par ailleurs, ces projets sont particulièrement propices à tisser des liens entre enseignement et recherche, en faisant découvrir les méthodologies ou outils d’analyse qui exploitent les corpus ainsi constitués. Ils incitent à manipuler des outils de visualisation ou d’analyse statistique des textes et conduisent aussi à des développements spécifiques, notamment pour les phases de vérification. Enfin, en utilisant un outil collaboratif qui n’a pas été conçu dans un cadre académique, ces projets ouvrent des pistes de communication grand public à propos de projets de recherche et de science participative, en réutilisant et en valorisant au mieux les contributions bénévoles effectuées sur Wikisource.

• In this paper, we study the Independent Set (IS) reconfiguration problem in graphs. An IS reconfiguration is a scenario transforming an IS L into another IS R, inserting/removing vertices one step at a time while keeping the cardinalities of intermediate sets greater than a specified threshold. We focus on the bipartite variant where only start and end vertices are allowed in intermediate ISs. Our motivation is an application to the RNA energy barrier problem from bioinformatics, for which a natural parameter would be the difference between the initial IS size and the threshold. We first show the para-NP hardness of the problem with respect to this parameter. We then investigate a new parameter, the cardinality range, denoted by ρ which captures the maximum deviation of the reconfiguration scenario from optimal sets (formally, ρ is the maximum difference between the cardinalities of an intermediate IS and an optimal IS). We give two different routes to show that this problem is in XP for ρ: The first is a direct O(n 2)-space, O(n 2ρ+2.5)-time algorithm based on a separation lemma; The second builds on a parameterized equivalence with the directed pathwidth problem, leading to a O(n ρ+1)-space, O(n ρ+2)-time algorithm for the reconfiguration problem through an adaptation of a prior result by Tamaki [20]. This equivalence is an interesting result in its own right, connecting a reconfiguration problem (which is essentially a connectivity problem within a reconfiguration network) with a structural parameter for an auxiliary graph. We demonstrate the practicality of these algorithms, and the relevance of our introduced parameter, by considering the application of our algorithms on random small-degree instances for our problem. Moreover, we reformulate the computation of the energy barrier between two RNA secondary structures, a classic hard problem in computational biology, as an instance of bipartite reconfiguration. Our results on IS reconfiguration thus yield an XP algorithm in O(n ρ+2) for the energy barrier problem, improving upon a partial O(n 2ρ+2.5) algorithm for the problem.

• Coloring unit-disk graphs efficiently is an important problem in the global and distributed setting, with applications in radio channel assignment problems when the communication relies on omni-directional antennas of the same power. In this context it is important to bound not only the complexity of the coloring algorithms, but also the number of colors used. In this paper, we consider two natural distributed settings. In the location-aware setting (when nodes know their coordinates in the plane), we give a constant time distributed algorithm coloring any unit-disk graph $G$ with at most $(3+\epsilon)\omega(G)+6$ colors, for any constant $\epsilon&gt;0$, where $\omega(G)$ is the clique number of $G$. This improves upon a classical 3-approximation algorithm for this problem, for all unit-disk graphs whose chromatic number significantly exceeds their clique number. When nodes do not know their coordinates in the plane, we give a distributed algorithm in the LOCAL model that colors every unit-disk graph $G$ with at most $5.68\omega(G)$ colors in $O(2^{\sqrt{\log \log n}})$ rounds. Moreover, when $\omega(G)=O(1)$, the algorithm runs in $O(\log^* n)$ rounds. This algorithm is based on a study of the local structure of unit-disk graphs, which is of independent interest. We conjecture that every unit-disk graph $G$ has average degree at most $4\omega(G)$, which would imply the existence of a $O(\log n)$ round algorithm coloring any unit-disk graph $G$ with (approximatively) $4\omega(G)$ colors.

• This paper analyzes the detection of a M-dimensional useful signal modeled as the output of a M ×K MIMO filter driven by a K-dimensional white Gaussian noise, and corrupted by a M-dimensional Gaussian noise with mutually uncorrelated components. The study is focused on frequency domain test statistics based on the eigenvalues of an estimate of the spectral coherence matrix (SCM), obtained as a renormalization of the frequency-smoothed periodogram of the observed signal. If N denotes the sample size and B the smoothing span, it is proved that in the high-dimensional regime where M, B, N converge to infinity while K remains fixed, the SCM behaves as a certain correlated Wishart matrix. Exploiting well-known results on the behaviour of the eigenvalues of such matrices, it is deduced that the standard tests based on linear spectral statistics of the SCM fail to detect the presence of the useful signal in the high-dimensional regime. A new test based on the SCM, which is proved to be consistent, is also proposed, and its statistical performance is evaluated through numerical simulations.

• We investigate the asymptotic distribution of the maximum of a frequency smoothed estimate of the spectral coherence of a M-variate complex Gaussian time series with mutually independent components when the dimension M and the number of samples N both converge to infinity. If B denotes the smoothing span of the underlying smoothed periodogram estimator, a type I extreme value limiting distribution is obtained under the rate assumptions M N → 0 and M B → c ∈ (0, +∞). This result is then exploited to build a statistic with controlled asymptotic level for testing independence between the M components of the observed time series. Numerical simulations support our results.

• Scaffolding is the final step in assembling Next Generation Sequencing data, in which pre-assembled contiguous regions ("contigs") are oriented and ordered using information that links them (for example, mapping of paired-end reads). As the genome of some species is highly repetitive, we allow placing some contigs multiple times, thereby generalizing established computational models for this problem. We study the subsequent problems induced by the translation of solutions of the model back to actual sequences, proposing models and analyzing the complexity of the resulting computational problems. We find both polynomialtime and N P-hard special cases like planarity or bounded degree. Finally, we propose two polynomial-time approximation algorithms according to cut/weight score.

• De nombreux ouvrages de Marceline Desbordes-Valmore sont disponibles en version numérisée sur internet, par exemple sur Gallica, Google Books ou Numelyo. Pourtant, peu d'entre eux sont pleinement accessibles en version texte, permettant d'en copier/coller facilement des extraits. L'association Le deuxième texte y travaille actuellement, dans le cadre de ses activités pour mettre à disposition plus de textes écrits par des femmes, à destination notamment des enseignantes et enseignants de lettres, afin de diversifier les corpus littéraires enseignés du collège à l'université.

• [...]

• Quasi-regularity has been proved to be a sufficient condition for simple-connectedness preservation during the digitization process of 2D continuous objects. The original definition of quasi-regularity relies on set-based morphological operations of erosion and dilation. With this definition, quasi-regularity is algorithmically difficult to assess. In this paper, we propose a tractable framework for quasi-regularity verification, especially designed for polygons. Our approach mainly relies on the computation and analysis of the medial axis of these objects, and determines their potential quasi-regularity, and thus their ability to undergo a digitization without alteration of their topological properties. The framework is applied in the context of topology-preserving rigid motions of digital objects.

• [...]

• Deep convolutional neural networks accuracy is heavily impacted by rotations of the input data. In this paper, we propose a convolutional predictor that is invariant to rotations in the input. This architecture is capable of predicting the angular orientation without angle-annotated data. Furthermore, the predictor maps continuously the random rotation of the input to a circular space of the prediction. For this purpose, we use the roto-translation properties existing in the Scattering Transform Networks with a series of 3D Convolutions. We validate the results by training with upright and randomly rotated samples. This allows further applications of this work on fields like automatic re-orientation of randomly oriented datasets.

• Hyperspectral images (HSI) consist of rich spatial and spectral information, which can potentially be used for several applications. However, noise, band correlations and high dimensionality restrict the applicability of such data. This is recently addressed using creative deep learning network architectures such as ResNet, SSRN, and A2S2K. However, the last layer, i.e. the classification layer, remains unchanged and is taken to be the softmax classifier. In this article, we propose to use a watershed classifier. Watershed classifier extends the watershed operator from Mathematical Morphology for classification. In its vanilla form, the watershed classifier does not have any trainable parameters. In this article, we propose a novel approach to train deep learning networks to obtain representations suitable for the watershed classifier. The watershed classifier exploits the connectivity patterns, a characteristic of HSI datasets, for better inference. We show that exploiting such characteristics allows the Triplet-Watershed to achieve state-of-art results in supervised and semi-supervised contexts. These results are validated on Indianpines (IP), University of Pavia (UP), Kennedy Space Center (KSC) and University of Houston (UH) datasets, relying on simple convnet architecture using a quarter of parameters compared to previous state-of-the-art networks.

• This article is inspired by two works from the early 90s. The first one is by Bogaert and Tison who considered a model of automata on finite ranked trees where one can check equality and disequality constraints between direct subtrees: they proved that this class of automata is closed under Boolean operations and that both the emptiness and the finiteness problem of the accepted language are decidable. The second one is by Niwinski who showed that one can compute the cardinality of any ω-regular language of infinite trees. Here, we generalise the model of automata of Tison and Bogaert to the setting of infinite binary trees. Roughly speaking we consider parity tree automata where some transitions are guarded and can be used only when the two direct sub-trees of the current node are equal/disequal. We show that the resulting class of languages encompasses the one of ω-regular languages of infinite trees while sharing most of its closure properties, in particular it is a Boolean algebra. Our main technical contribution is then to prove that it also enjoys a decidable cardinality problem. In particular, this implies the decidability of the emptiness problem.

• This paper studies a large class of two-player perfect-information turn-based parity games on infinite graphs, namely those generated by collapsible pushdown automata. The main motivation for studying these games comes from the connections from collapsible pushdown automata and higher-order recursion schemes, both models being equi-expressive for generating infinite trees. Our main result is to establish the decidability of such games and to provide an effective representation of the winning region as well as of a winning strategy. Thus, the results obtained here provide all necessary tools for an in-depth study of logical properties of trees generated by collapsible pushdown automata/recursion schemes.

• This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider three main problems -- model-checking, logical refection (aka global model-checking) and selection -- for both monadic second-order logic and modal mu-calculus and prove that they can be effectively answered positively. For that, we rely on the known connexion between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.

• Abstract We give necessary and sufficient conditions for the group of a rational maximal bifix code Z to be isomorphic with the F -group of Z ∩ F {Z ∪ F} , when F is recurrent and Z ∩ F {Z ∪ F} is rational. The case where F is uniformly recurrent, which is known to imply the finiteness of Z ∩ F {Z ∪ F} , receives special attention. The proofs are done by exploring the connections with the structure of the free profinite monoid over the alphabet of F .

• Given a set of words S, one can associate with every word w ∈ S its extension graph which describes the possible left and right extensions of w in S. Families of sets can be defined from the properties of the extension graph of their elements: acyclic sets, tree sets, neutral sets, etc. In this paper we study the specific case of the set of factors of a substitutive language and we show that it is decidable whether these properties are verified or not.

• Abstract A remarkable family of discrete sets which has recently attracted the attention of the discrete geometry community is the family of convex polyominoes, that are the discrete counterpart of Euclidean convex sets, and combine the constraints of convexity and connectedness. In this paper we study the problem of their reconstruction from orthogonal projections, relying on the approach defined by Barcucci et al. (Theor Comput Sci 155(2):321–347, 1996). In particular, during the reconstruction process it may be necessary to expand a convex subset of the interior part of the polyomino, say the polyomino kernel, by adding points at specific positions of its contour, without losing its convexity. To reach this goal we consider convexity in terms of certain combinatorial properties of the boundary word encoding the polyomino. So, we first show some conditions that allow us to extend the kernel maintaining the convexity. Then, we provide examples where the addition of one or two points causes a loss of convexity, which can be restored by adding other points, whose number and positions cannot be determined a priori.

• The visual perception of 2D and 3D geometric attributes (e.g. translation, rotation, spatial size and etc.) is important in robotic applications. It helps robotic system build knowledge about its surrounding environment and can serve as the input for down-stream tasks such as motion planning and physical intersection with objects.The main goal of this thesis is to automatically detect positions and poses of interested objects for robotic manipulation tasks. In particular, we are interested in the low-level task of estimating occlusion relationship to discriminate different objects and the high-level tasks of object visual tracking and object pose estimation.The first focus is to track the object of interest with correct locations and sizes in a given video. We first study systematically the tracking framework based on discriminative correlation filter (DCF) and propose to leverage semantics information in two tracking stages: the visual feature encoding stage and the target localization stage. Our experiments demonstrate that the involvement of semantics improves the performance of both localization and size estimation in our DCF-based tracking framework. We also make an analysis for failure cases.The second focus is using object shape information to improve the performance of object 6D pose estimation and do object pose refinement. We propose to estimate the 2D projections of object 3D surface points with deep models to recover object 6D poses. Our results show that the proposed method benefits from the large number of 3D-to-2D point correspondences and achieves better performance. As a second part, we study the constraints of existing object pose refinement methods and develop a pose refinement method for objects in the wild. Our experiments demonstrate that our models trained on either real data or generated synthetic data can refine pose estimates for objects in the wild, even though these objects are not seen during training.The third focus is studying geometric occlusion in single images to better discriminate objects in the scene. We first formalize geometric occlusion definition and propose a method to automatically generate high-quality occlusion annotations. Then we propose a new occlusion relationship formulation (i.e. abbnom) and the corresponding inference method. Experiments on occlusion reasoning benchmarks demonstrate the superiority of the proposed formulation and method. To recover accurate depth discontinuities, we also propose a depth map refinement method and a single-stage monocular depth estimation method.All the methods that we propose leverage on the versatility and power of deep learning. This should facilitate their integration in the visual perception module of modern robotic systems.Besides the above methodological advances, we also made available software (for occlusion and pose estimation) and datasets (of high-quality occlusion information) as a contribution to the scientific community

• [...]

• Scheduling tasks is one of the most challenging problems in real-time systems. In this paper, we assume that hard deadline periodic tasks are scheduled preemptively according to the Earliest Deadline First algorithm on uniprocessor. This work presents a framework for enhancing predictability in system behavior, when periodic task execution can be postponed. Our analysis first determines a lower bound to the slack defined as the time which may be stolen from hard deadline periodic tasks, without jeopardizing their timing constraints. Second, we show how to implement an efficient method for estimating the slack at run-time. This can be adopted to overcome practical situations where the slack has to be computed dynamically with acceptable time overheads.

• Este artigo tem o objetivo de discutir sobre o aspecto verbal nas Construções com Verbo-Suporte (CVS) e com extensões de verbo-suporte, focalizando a função semântica que os verbos podem ter quando exprimem aspecto. Para isso, analisamos a relação entre frases formadas com vários verbos-suporte e que diferem pelo aspecto. Por exemplo, as frases "Zé (ganhou + está com + perdeu a) coragem" indicam os aspectos incoativo, durativo e terminativo, respectivamente. Muito se discute sobre as CVS, mas o aspecto nessas construções ainda é um assunto de pouco interesse entre os pesquisadores no Brasil. Essa pesquisa está embasada no modelo teórico-metodológico do Léxico-Gramática (LG), desenvolvido por Gross (1975). O LG propõe a descrição e formalização dos itens lexicais em tábuas. Dessa forma, como resultado da descrição formal, apresentamos duas tábuas, que podem ser utilizadas no Processamento de linguagem natural (PLN), por meio de programas de computador.

• We present an unsupervised learning framework for decomposing images into layers of automatically discovered object models. Contrary to recent approaches that model image layers with autoencoder networks, we represent them as explicit transformations of a small set of prototypical images. Our model has three main components: (i) a set of object prototypes in the form of learnable images with a transparency channel, which we refer to as sprites; (ii) differentiable parametric functions predicting occlusions and transformation parameters necessary to instantiate the sprites in a given image; (iii) a layered image formation model with occlusion for compositing these instances into complete images including background. By jointly learning the sprites and occlusion/transformation predictors to reconstruct images, our approach not only yields accurate layered image decompositions, but also identifies object categories and instance parameters. We first validate our approach by providing results on par with the state of the art on standard multi-object synthetic benchmarks (Tetrominoes, Multi-dSprites, CLEVR6). We then demonstrate the applicability of our model to real images in tasks that include clustering (SVHN, GTSRB), cosegmentation (Weizmann Horse) and object discovery from unfiltered social network images. To the best of our knowledge, our approach is the first layered image decomposition algorithm that learns an explicit and shared concept of object type, and is robust enough to be applied to real images.

• Binary partition hierarchies and minimum spanning trees are key structures for numerous hierarchical analysis methods, as those involved in computer vision and mathematical morphology. In this article, we consider the problem of their computation in an out-of-core manner, i.e., by minimizing the size of the data structures that are simultaneously needed at the different computation steps. Out-of-core algorithms are necessary when the data are too large to fit entirely in the main memory of the computer, which can be the case with very large images in 2-, 3-, or higher dimension space. We propose a new algebraic framework composed of four main operations on hierarchies: edge-addition, select, insert, and join. Based on this framework, we propose and establish the correctness of an out-of-core calculus for binary partition hierarchies and for minimum spanning trees. First applications to image processing suggest the practical efficiency of this calculus.

• Hard graph problems are ubiquitous in Bioinformatics, inspiring the design of specialized Fixed-Parameter Tractable algorithms, many of which rely on a combination of tree-decomposition and dynamic programming. The time/space complexities of such approaches hinge critically on low values for the treewidth $tw$ of the input graph. In order to extend their scope of applicability, we introduce the TREE-DIET problem, &lt;I&gt;i.e.&lt;/I&gt; the removal of a minimal set of edges such that a given tree-decomposition can be slimmed down to a prescribed treewidth $tw'$. Our rationale is that the time gained thanks to a smaller treewidth in a parameterized algorithm compensates the extra post-processing needed to take deleted edges into account. Our core result is an FPT dynamic programming algorithm for TREE-DIET, using $2^{O(tw)} n$ time and space. We complement this result with parameterized complexity lower-bounds for stronger variants (e.g., NP-hardness when tw or $tw−tw'$ is constant). We propose a prototype implementation for our approach which we apply on difficult instances of selected RNA-based problems: RNA design, sequence-structure alignment, and search of pseudoknotted RNAs in genomes, revealing very encouraging results. This work paves the way for a wider adoption of tree-decomposition-based algorithms in Bioinformatics.

• This work aimed at giving a comprehensive, indetailed and benchmark guide on the route to fine-tuning Convolutional Neural Networks (CNNs) for glaucoma screening. Transfer learning consists in a promising alternative to train CNNs from scratch, to avoid the huge data and resources requirements. After a thorough study of five state-of-the-art CNNs architectures, a complete and well-explained strategy for fine-tuning these networks is proposed, using hyperparameter grid-searching and two-phase training approach. Excellent performance is reached on model evaluation, with a 0.9772 AUROC validation rate, giving arise to reliable glaucoma diagnosis-help systems. Also, a baseline benchmark analysis is conducted, studying the models according to performance indices such as model complexity and size, AUROC density and inference time. This in-depth analysis allows a rigorous comparison between model characteristics, and is useful for giving practioners important trademarks for prospective applications and deployments.

• [...]

• The fast evolution in microelectronics and the emergence of wireless communication technologies, have allowed the appearance of the promising field of Internet of Things (IoT). The latter is more and more present in the human life, that is why it becomes essential to secure the communications done with the connected objects. Almost all communicating systems attach great importance to security, consequently, on the cryptographic key management. The existing key management schemes for conventional networks are relatively resource-intensive, that is why they are not adequate for resource-constrained networks like IoT, especially since the nodes' capabilities are heterogeneous. In this paper, we focus on exchanging and updating of cryptographic keys among the IoT objects often limited in resources, where we propose a new form of key exchange based on the mechanism of concealing encryption keys, while exploiting the misused spaces in the header fields of the exchanged packets by the communication standards, such as ZigBee, BLE, WiFi.

• [...]

• [...]

• In this paper, we analyze timed systems with data structures. We start by describing behaviors of timed systems using graphs with timing constraints. Such a graph is called realizable if we can assign time-stamps to nodes or events so that they are consistent with the timing constraints. The logical definability of several graph properties [20], [10] has been a challenging problem, and we show, using a highly nontrivial argument, that the realizability property for collections of graphs with strict timing constraints is logically definable in a class of propositional dynamic logic (EQ-ICPDL), which is strictly contained in MSO. Using this result, we propose a novel, algorithmically efficient and uniform proof technique for the analysis of timed systems enriched with auxiliary data structures, like stacks and queues. Our technique unravels new results (for emptiness checking as well as model checking) for timed systems with richer features than considered so far, while also recovering existing results.

• In 1980, Edelman defined a poset on objects called the noncrossing 2-partitions. They are closely related with noncrossing partitions and parking functions. To some extent, his definition is a precursor of the parking space theory, in the framework of finite reflection groups. We present some enumerative and topological properties of this poset. In particular, we get a formula counting certain chains, that encompasses formulas for Whitney numbers (of both kinds). We prove shellability of the poset, and compute its homology as a representation of the symmetric group. We moreover link it with two well-known polytopes : the associahedron and the permutohedron.

• This article extends a classical marker-based image segmentation method proposed by Salembier and Garrido in 2000. In the original approach, the segmentation relies on two sets of pixels which play the role of object and background markers. In the proposed extension, the markers are not represented by crisp sets, but by fuzzy ones, i.e., functions of the image domain into the real interval [0, 1] indicating the degree of membership of each pixel to the markers. We show that when the fuzzy markers are indicator functions of crisp sets, the proposed method produces the same result as the original one. We present a linear-time algorithm for computing the result of the proposed method given two fuzzy markers and we establish the correctness of this algorithm. Additionally, we discuss possible applications of the proposed approach, such as adjusting marker strength in interactive image segmentation procedures and optimizing marker locations with gradient descent methods.

• [...]

• [...]

• In Mathematical Morphology (MM), dynamics are used to compute markers to proceed for example to watershed-based image decomposition. At the same time, persistence is a concept coming from Persistent Homology (PH) and Morse Theory (MT) and represents the stability of the extrema of a Morse function. Since these concepts are similar on Morse functions, we studied their relationship and we found, and proved, that they are equal on 1D Morse functions. Here, we propose to extend this proof to n-D, n ≥ 2, showing that this equality can be applied to n-D images and not only to 1D functions. This is a step further to show how much MM and MT are related.

• The Internet of Things (IoT) is an emerging paradigm in the world of computer networks, where physical objects are connected over the Internet. Given the huge number of connected devices that are potentially vulnerable, highly significant risks emerge around the issues of communication security. Unfortunately, the conventional security methods are hard to adapt due to the heterogeneity and resource-constrained objects. In this paper, we propose a reliable and adaptive distributed public-key management infrastructure for the IoT. The main purpose of our proposal is to mitigate the resource issue for publickey certificate management to design an effective security mechanism, which offers reliable end-to-end security services. In order to evaluate the performances of our proposal, we have conducted intensive simulations with comparison to the literature, in which we have obtained promising results in terms of storage, communication, response time and resilience against malicious nodes.

• Geometric algebra has become popularly used in applications dealing with geometry. This framework allows us to reformulate and redefine problems involving geometric transformations in a more intuitive and general way. In this paper, we focus on 2D bijective digitized reflections and rotations. After defining the digitization through geometric algebra, we characterize the set of bijective digitized reflections in the plane. We derive new bijective digitized rotations as compositions of bijective digitized reflections since any rotation is represented as the composition of two reflections. We also compare them with those obtained through geometric transformations by computing their distributions.

• Imaging flow cytometry has become a popular technology for bioparticle image analysis because of its capability of capturing thousands of images per second. Nevertheless, the vast number of images generated by imaging flow cytometry imposes great challenges for data analysis especially when the species have similar morphologies. In this work, we report a deep learning-enabled high-throughput system for predicting Cryptosporidium and Giardia in drinking water. This system combines imaging flow

• This thesis is devoted to studying synchronizing words for finite automata and variable-length codes. Intuitively, a synchronizing word is a word such that its application brings a system into some particular state regardless of its initial state. A code or automaton is synchronizing if it admits a synchronizing word. There is a deep connection between the concrete implementations of this notion for finite automata and variable-length codes, and the use of it is one of the leitmotifs of this thesis.One of the main tools for dealing with variable-length codes is assigning a special automaton preserving many synchronization properties to it. For finite codes, this is done using prefix automata.We investigate two fundamental problems about synchronization. The first one is measuring the length of shortest synchronizing words for synchronizing automata and codes. For the case of complete deterministic finite automata, the Černý conjecture, one of the oldest problems in combinatorial automata theory, proposes a quadratic upper bound in terms of the number of states in the automaton. We broaden this conjecture to partial deterministic finite automata and then to unambiguous non-deterministic finite automata. We show polynomial upper bounds for mentioned classes in the presence of strong connectivity, and discuss their connections with the original Černý conjecture.The relation with finite codes allows us to show similar bounds in terms of the sum of the lengths of the codewords, as well as in terms of the length of the longest codeword. The second case is related to another important conjecture stated by Restivo. It deals with mortal words instead of synchronizing ones, the case which we also investigate. For most of these settings we also examine the computational complexity of finding short synchronizing words, which is the second fundamental question investigated in this thesis. Besides that, we study various generalization of the notion of a synchronizing word, which allow to use some partial information about the current state of an automaton. For several such generalizations we show strong computational complexity lower bounds even in very restricted cases

• Epipolar rectification of a stereo pair is the process of resampling a pair of stereo images so that the apparent motion of corresponding points is horizontal. This is an important preliminary step in depth estimation, substituting depth by disparity estimation. Most methods rely on a perspective transform of both images, which has the advantage to simulate a different attitude of the pinhole cameras. A limitation is that when an epipole is inside the image domain, it has to be sent to infinity by the perspective transform, producing a strong distortion. On the contrary, relying on a polar transform centered at the epipole provides a method applicable universally to a pair of pinhole camera views. We present in detail the algorithm, filling in the information important for its implementation and missing in published articles.

• We study the problem of deciding if a given triple of permutations can be realized as geometric permutations of disjoint convex sets in R3. We show that this question, which is equivalent to deciding the emptiness of certain semi-algebraic sets bounded by cubic polynomials, can be lifted'' to a purely combinatorial problem. We propose an effective algorithm for that problem, and use it to gain new insights into the structure of geometric permutations. In particular, we prove that all triples of permutations of size 5 are realizable, and give a complete list of triples of size 6 that are not.

• A. We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous grammars, allowing us to work with all these generating systems in a unified way. The theory of bud generating systems uses colored operads. Indeed, an object is generated by a bud generating system if it satisfies a certain equation in a colored operad. To compute the generating series of the languages of bud generating systems, we introduce formal power series on colored operads and several operations on these. Series on colored operads are crucial to express the languages specified by bud generating systems and allow us to enumerate combinatorial objects with respect to some statistics. Some examples of bud generating systems are constructed; in particular to specify some sorts of balanced trees and to obtain recursive formulas enumerating these.

• A syntax tree is a planar rooted tree where internal nodes are labeled on a graded set of generators. There is a natural notion of occurrence of contiguous pattern in such trees. We describe a way, given a set of generators G and a set of patterns , to enumerate the trees constructed on G and avoiding. The method is built around inclusion-exclusion formulas forming a system of equations on formal power series of trees, and composition operations of trees. This does not require particular conditions on the set of patterns to avoid. We connect this result to the theory of nonsymmetric operads. Syntax trees are the elements of such free structures, so that any operad can be seen as a quotient of a free operad. Moreover, in some cases, the elements of an operad can be seen as trees avoiding some patterns. Relying on this, we use operads as devices for enumeration: given a set of combinatorial objects we want enumerate, we endow it with the structure of an operad, understand it in term of trees and pattern avoidance, and use our method to count them. Several examples are provided.

• The need to establish a secure communication for most applications of Internet of Things (IoT) has become increasingly crucial. Nevertheless, one of the major issues of such networks is how to establish cryptographic keys between all IoT objects to ensure secure data exchange. Several key management schemes have been suggested in the literature to achieve this goal, but they must be revised and innovated, while taking into account the limited resources of IoT objects. Likewise, the IoT presents a system where objects belonging to the physical world, are connected to the Internet, and have the capacity to measure, communicate, and act around all over the world. Nevertheless, some information available to IoT objects is private, hence the need to ensure an access control whose aim is to guarantee that the information be accessible only to those whose the access is allowed. In this paper, we propose a scheme involving two basic modules, namely key management, and access control. The key management module is designed to ensure the symmetric key generation for the IoT objects in a completely distributed manner without resorting to a central authority. In contrast, the access control module is used to impose an access control policy so as to prevent unauthorized access to services provided by a particular IoT object. The latter is ensured thanks to the existing cooperation between the TGOs servers of dierent domains in the IoT. Through assessments based on security analysis, we demonstrate that the proposed scheme is more secure than the existing ones. Simulations were also performed to validate the proposed solution by comparing it with some relevant concurrent schemes. The obtained results are not only encouraging, but also very favorable for the proposed scheme.

• [...]

• We introduce SharpNet, a method that predicts an accurate depth map given a single input color image, with a particular attention to the reconstruction of occluding contours: Occluding contours are an important cue for object recognition, and for realistic integration of virtual objects in Augmented Reality, but they are also notoriously difficult to reconstruct accurately. For example, they are a challenge for stereo-based reconstruction methods, as points around an occluding contour are only visible in one of the two views. Inspired by recent methods that introduce normal estimation to improve depth prediction, we introduce novel terms to constrain normals, depth and occluding contours predictions. Since ground truth depth is difficult to obtain with pixel-perfect accuracy along occluding contours, we use synthetic images for training, followed by fine-tuning on real data. We demonstrate our approach on the challenging NYUv2-Depth dataset, and show that our method outperforms the state-of-the-art along occluding contours, while performing on par with the best recent methods for the rest of the images. Its accuracy along the occluding contours is actually better than the "ground truth" acquired by a depth camera based on structured light. We show this by introducing a new benchmark based on NYUv2-Depth for evaluating occluding contours in monocular reconstruction, which is our second contribution.

• We consider general expressions, which are trees whose nodes are labeled with operators, that represent syntactic descriptions of formulas. We assume that there is an operator that has an absorbing pattern and prove that if we use this property to simplify a uniform random expression with n nodes, then the expected size of the result is bounded by a constant. In our framework, expressions are defined using a combinatorial system, which describes how they are built: one can ensure, for instance, that there are no two consecutive stars in regular expressions. This generalizes a former result where only one equation was allowed, confirming the lack of expressivity of uniform random expressions.

• In this article, we question the relevance of uniform random models for algorithms that use expressions as inputs. Using a general framework to describe expressions, we prove that if there is a subexpression that is absorbing for a given operator, then, after repeatedly applying the induced simplification to a uniform random expression of size n, we obtain an equivalent expression of constant expected size. This proves that uniform random expressions lack expressivity, as soon as there is an absorbing pattern. For instance, (a + b) is absorbing for the union for regular expressions on {a, b}, hence random regular expressions can be drastically reduced using the induced simplification.

#### Articles principaux

On the Performance of Sliding Window TD-LMMSE Channel Estimation for 5G Waveforms in High Mobility Scenario

SAIDEH, Michel ; BERBINEAU, Marion ; DAYOUB, Iyad   /   (2018)

IEEE Transactions on Vehicular Technology, 5p, doi: 10.1109/TVT.2018.2845551

Télécharger le document

On Doubly selective Channel Estimation for FBMC-OQAM using the LMMSE Filter for Future Railway Communications

SAIDEH, Michel ; BERBINEAU, Marion ; DAYOUB, Iyad   /   (2018)

ITST 2018, 16th International Conference on Intelligent Transport Systems Telecommunications, PORTUGAL, 6p

Plus d'infos

Cyber-Physical Security Risk Assessment for Train Control and Monitoring Systems

REKIK, mouna ; GRANSART, Christophe ; BERBINEAU, Marion   /   (2018)

SSV 2018, 1st International Workshop on System Security and Vulnerability, IEEE CNS Conference on Communications and Network Security, CHINE, 9p

Télécharger le document

Cyber-physical Threats and Vulnerabilities Analysis for Train Control and Monitoring Systems

REKIK, Mouna ; GRANSART, Christophe ; BERBINEAU, Marion   /   (2018)

IEEE ISNCC 2018, International Symposium on Networks, Computers and Communications, ITALIE, 6p

Télécharger le document

A new clustering structure for VANET

RIVOIRARD, Lucas ; WAHL, Martine ; SONDI, Patrick ; BERBINEAU, Marion ; GRUYER, Dominique   /   (2018)

TRA 2018, 7th Transport Research Arena, AUTRICHE, 10p

Plus d'infos

A Cooperative Vehicle Ego-localization Application Using V2V Communications with CBL Clustering

RIVOIRARD, Lucas ; WAHL, Martine ; SONDI, Patrick ; GRUYER, Dominique ; BERBINEAU, Marion   /   (2018)

IEEE IV 2018, 29th IEEE Intelligent Vehicles Symposium, CHINE, pp.722-727

Plus d'infos

Extended Kalman Filter (EKF) Innovation-based Integrity Monitoring Scheme with C/N0 Weighting

ZHU, Ni ; BETAILLE, David ; MARAIS, Juliette ; BERBINEAU, Marion   /   (2018)

IEEE RTSI 2018, 4th International Forum on Research and Technologies for Society and Industry, ITALIE, 6p

Plus d'infos

Evaluating TCMS Train-to-Ground communication performances based on the LTE technology and discreet event simulations

BOUAZIZ, Maha ; YAN, Ying ; KASSAB, Mohamed ; SOLER, José ; BERBINEAU, Marion   /   (2018)

13th International Workshop on Communication Technologies for Vehicles: Nets4Cars - Nets4Trains - Nets4Aircraft - Nets4Spacecrafts, ESPAGNE, 12p

Plus d'infos

Train-to-Ground communications of Train Control and Monitoring Systems: A simulation platform modelling approach

BOUAZIZ, Maha ; YAN, Ying ; KASSAB, Mohamed ; SOLER, José ; BERBINEAU, Marion   /   (2018)

TRA 2018, 7th Transport Research Arena, AUTRICHE, 10p

Plus d'infos

Proposition d'une structuration dynamique d'un réseau de communication intervéhiculaire pour les ITS

RIVOIRARD, Lucas ; WAHL, Martine ; SONDI, Patrick ; BERBINEAU, Marion ; GRUYER, Dominique   /   (2018)

RDMI 2018, Les rencontres de la mobilité intelligente, ATEC ITS FRANCE, FRANCE, 11p

Télécharger le document

Graph-based people segmentation using a genetically optimized combination of classifiers

MEURIE, Cyril ; LEZORAY, Olivier ; CONIGLIO, Christophe ; BERBINEAU, Marion   /   (2018)

Journal of Electronic Imaging, 27p

Télécharger le document

GNSS Integrity Enhancement for Urban Transport Applications by Error Characterization and Fault Detection and Exclusion (FDE)

ZHU, Ni ; BETAILLE, David ; MARAIS, Juliette ; BERBINEAU, Marion   /   (2018)

Géolocalisation et Navigation dans l'Espace et le Temps, Journées Scientifiques 2018 de l'URSI, FRANCE, 11p

Télécharger le document

Safety Appraisal of GNSS-Based Localization Systems Used in Train Spacing Control

BEUGIN, Julie ; LEGRAND, Cyril ; MARAIS, Juliette ; BERBINEAU, Marion ; EL KOURSI, El Miloudi   /   (2018)

IEEE Access, 6, 99, pp9898-9916, doi: 10.1109/ACCESS.2018.2807127

Télécharger le document

GNSS Position Integrity in Urban Environments: A Review of Literature

ZHU, Ni ; MARAIS, Juliette ; BETAILLE, David ; BERBINEAU, Marion   /   (2018)

IEEE Transactions on Intelligent Transportation Systems, 19, 9, pp2762-2778, doi: 10.1109/TITS.2017.2766768

Télécharger le document

The SmartRaCon Concept for advanced train control systems

MEYER ZU HÖRSTE, Michael ; HAINZ, Svenja ; BERBINEAU, Marion ; MARAIS, Juliette ; MASSON, Emilie ; MENDIZABAL, Jaizki ; HUTCHINSON, Michael   /   (2019)

WCRR 2019, 12th World Congress on Railway Research, Railway Research to Enhance the Customer Experience, JAPON, 6p

Plus d'infos

Extraction de silhouettes à partir de boîtes englobantes de détection

MEURIE, Cyril ; LEZORAY, Olivier ; BERBINEAU, Marion   /   (2019)

GRETSI 2019, 27ème Colloque francophone de traitement du signal et des images, FRANCE, 4p

Plus d'infos

Safe satellite-based localization of the train thanks to a combination of accuracy enhancement and fault detection and exclusion schemes

MARAIS, Juliette ; ZHU, Ni ; BERBINEAU, Marion ; BETAILLE, David   /   (2019)

WCRR 2019, 12th World Congress on Railway Research, JAPON, 6p

Plus d'infos

Application of fuzzy theory for identifying the required availability of an autonomous localization unit in European Train Control System

NGUYEN, Khanh ; BEUGIN, Julie ; BERBINEAU, Marion ; MARAIS, Juliette   /   (2019)

Journal of Intelligent Transportation Systems, 18p, doi: 10.1080/15472450.2018.1525533

Télécharger le document

Hardware-in-the-loop and Software-in-the-loop platform for test and validation of adaptable radio communications systems for railways at IP layer

MORENO, Juan ; BOUAZIZ, Maha ; BERBINEAU, Marion ; YAN, Ying ; SOLER, José ; TORREGO, Raul ; INAKI, Val ; VIZZARRI, Alessandro ; CLAVIER, Laurent ; KASSI, Rédha ; COCHERIL, Yann ; DENIAU, Virginie ; GRANSART, Christophe   /   (2019)

Net4Rails, FRANCE, 9p

Télécharger le document

Joint Interference Cancellation for Multi-Carrier Modulation-Based Non-Orthogonal Multiple Access

SAIDEH, Michel ; ALSABA, Yamen ; DAYOUB, Iyad ; BERBINEAU, Marion   /   (2019)

IEEE Communications Letters, 23, 11, pp2114-2117, doi: 10.1109/LCOMM.2019.2933817

Plus d'infos

Efficient Equalization for FBMC-OQAM Under Doubly Selective Channel Estimation Errors

SAIDEH, Michel ; DAYOUB, Iyad ; BERBINEAU, Marion   /   (2019)

IEEE Communications Letters, 23, 5, pp863-866, doi: 10.1109/LCOMM.2019.2907938

Plus d'infos

GNSS Integrity Monitoring Schemes for Terrestrial Applications in Harsh Signal Environments

ZHU, Ni ; BETAILLE, David ; MARAIS, Juliette ; BERBINEAU, Marion   /   (2020)

IEEE Intelligent Transportation Systems Magazine , 11p, doi: 10.1109/MITS.2020.2994076

Plus d'infos

Emulation of end-to-end communications systems in railway scenarios: physical layer results

MORENO GARCIA-LOYGORRI, Juan ; KHARBECH, Sofiane ; CLAVIER, Laurent ; KASSI, Redha ; TORREGO, Raul ; ARRIOLA, Aitor ; VAL, Inaki ; BERBINEAU, Marion ; SOLER, José ; YAN, Ying   /   (2020)

EuCAP 2020, 14th European Conference on Antennas and Propagation, DANEMARK, 5p

Télécharger le document