Combinatorics on Words 10th International Conference
Notice bibliographique
Résumé
This volume contains the Local Proceedings of the Tenth International Conference on WORDS, that took place at the Kiel University, Germany, from the 14th to the 17th September 2015. WORDS is the main conference series devoted to the mathematical theory of words, and it takes place every two years. The first conference in the series was organised in 1997 in Rouen, France, with the following editions taking place in Rouen, Palermo,Turku, Montreal, Marseille, Salerno, Prague, and Turku. The main object in the scope of the conference, words, are finite or infinite sequences of symbols over a finite alphabet. They appear as natural and basic mathematical model in many areas, theoretical or applicative. Accordingly, the WORDS conference is open to both theoretical contributions related to combinatorial, algebraic, and algorithmic aspects of words, as well as to contributions presenting application of the theory of words, for instance, in other fields of computer science, inguistics, biology and bioinformatics, or physics. For the second time in the history of WORDS, after the 2013 edition, a refereed proceedings volume was published in Springer’s Lecture Notes in Computer Science series. In addition, this local proceedings volume was published in the Kiel Computer Science Series of the Kiel University. Being a conference at the border between theoretical computer science and mathematics, WORDS tries to capture in its two proceedings volumes the characteristics of the conferences from both these worlds. While the Lecture Notes in Computer Science volume was dedicated to formal contributions, this local proceedings volume allows, in the spirit of mathematics conferences, the publication of several contributions informing on current research and work in progress in areas closely connected to the core topics of WORDS. All the papers, the ones published in the Lecture Notes in Computer Science proceedings volume or the ones from this volume, were refereed to high standards by the members of the Program Committee. Following the conference, a special issue of the Theoretical Computer Science journal will be edited, containing extended versions of papers from both proceedings volumes. In total, the conference hosted 18 contributed talks. The papers on which 14 of these talks were based, were published in th LNCS volume; the other 4 are published in this volume. In addition to the contributed talks, the conference program included six invited talks given by leading experts in the areas covered by the WORDS conference: Jörg Endrullis (Amsterdam), Markus Lohrey (Siegen), Jean Néraud (Rouen), Dominique Perrin (Paris), Michaël Rao (Lyon), Thomas Stoll (Nancy). WORDS 2015 was the tenth conference in the series, so we were extremely happy to welcome, as invited speaker at this anniversary edition, Jean Néraud, one of the initiators of the series and the main organiser of the first two editions of this conference. We thank all the invited speakers and all the authors of submitted papers for their contributions to the the success of the conference. We are grateful to the members of the Program Committee for their work that lead to the selection of the contributed talks, and, implicitly, of the papers published in this volume. They were assisted in their task by a series of external referees, gratefully acknowledged below. The submission and reviewing process used the Easychair system; we thank Andrej Voronkov for this system which facilitated the work of the Programme Committee and the editors considerably. We grateful thank Gheorghe Iosif for designing the logo, poster, and banner of WORDS 2015; the logo of the conference can be seen on the front cover of this book. We also thank the editors of the Kiel Computer Science Series, especially Lasse Kliemann, for their support in editing this volume. Finally, we thank the Organising Committee of WORDS 2015 for ensuring the smooth run of the conference.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,002 | 0,005 |
| Méta-épidémiologie (sens strict) | 0,002 | 0,001 |
| Méta-épidémiologie (sens large) | 0,001 | 0,002 |
| Bibliométrie | 0,004 | 0,004 |
| Études des sciences et des technologies | 0,003 | 0,002 |
| Communication savante | 0,010 | 0,007 |
| Science ouverte | 0,002 | 0,005 |
| Intégrité de la recherche | 0,002 | 0,004 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,150 | 0,042 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».