summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorquentin@aristote.fr <quentin@aristote.fr>2025-08-12 15:26:08 +0200
committeraristote <quentin.aristote@irif.fr>2025-08-12 15:52:07 +0200
commitf5c814c49c37637877bc518ba7c565bf3c057a19 (patch)
tree74f34919f580f58f813eb6a12d17e297cb544a02
parent4b819fb2559dc9d5c652077743218c73133b0343 (diff)
rename any last instances of 'publications' to 'research'
-rw-r--r--files/publications.json6
-rw-r--r--research/default.nix42
-rw-r--r--research/export.nix35
-rw-r--r--src.nix20
4 files changed, 63 insertions, 40 deletions
diff --git a/files/publications.json b/files/publications.json
deleted file mode 100644
index 1f82be1..0000000
--- a/files/publications.json
+++ /dev/null
@@ -1,6 +0,0 @@
-[
- {"id":"aristoteApplicationsCategoricalFramework2022","abstract":"M2 internship report. We extend Petrişan and Colcombet's categorical framework for automata minimization and learning with new categorical algorithms and apply it to various families of automata for which minimization and learning had not been studied previously. We focus on transducers whose output lie in arbitrary monoids, weighted automata on Dedekind domains and automata whose states are quasi-ordered. This last example links automata learning together with the Valk-Jantzen lemma, widely used in the theory of well-structured transition systems.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteApplicationsCategoricalFramework2022","issued":{"date-parts":[[2022,8,20]]},"language":"en","license":"All rights reserved","title":"Applications of a categorical framework for minimization and active learning of transition systems","type":"report","URL":"https://git.eleves.ens.fr/qaristote/m2-internship-report/uploads/2594114883f26d77c2b4f3731656351a/report.pdf"},
- {"id":"aristoteDynamicalTriangulationInduced2020","abstract":"We present the single-particle sector of a quantum cellular automaton, namely a quantum walk, on a simple dynamical triangulated 2-manifold. The triangulation is changed through Pachner moves, induced by the walker density itself, allowing the surface to transform into any topologically equivalent one. This model extends the quantum walk over triangular grid, introduced in a previous work, by one of the authors, whose space-time limit recovers the Dirac equation in (2+1)-dimensions. Numerical simulations show that the number of triangles and the local curvature grow as exp(a log(t) - bt²), where a and b parametrize the way geometry changes upon the local density of the walker, and that, in the long run, flatness emerges. Finally, we also prove that the global behavior of the walker, remains the same under spacetime random fluctuations.","accessed":{"date-parts":[[2020,8,17]]},"author":[{"family":"Aristote","given":"Quentin"},{"family":"Eon","given":"Nathanaël"},{"family":"Di Molfetta","given":"Giuseppe"}],"citation-key":"aristoteDynamicalTriangulationInduced2020","container-title":"Symmetry","DOI":"10.3390/sym12010128","ISSN":"2073-8994","issue":"1:128","issued":{"date-parts":[[2020,1]]},"language":"en","license":"http://creativecommons.org/licenses/by/3.0/","number":"1","publisher":"Multidisciplinary Digital Publishing Institute","source":"www.mdpi.com","title":"Dynamical Triangulation Induced by Quantum Walk","type":"article-journal","URL":"https://www.mdpi.com/2073-8994/12/1/128","volume":"12"},
- {"id":"aristoteFibrationalFrameworkNested2020","abstract":"M1 internship report. We extend a previous fibration- and coalgebra-based categorical framework for characterizing greatest fixed-points, e.g. bisimilarity-like notions, as winning positions in safety games. Our new framework thus characterizes nested alternating greatest and smallest fixed-points of a fibration- and coalgebra-based categorical operator as winning positions in parity games. This provides a new kind of parity games for the model checking of coalgebraic modal logic, but unfortunately we did not manage to instantiate more general notions of bisimulations such as fair and delayed bisimulations.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteFibrationalFrameworkNested2020","issued":{"date-parts":[[2020,8,28]]},"language":"en","license":"All rights reserved","title":"Fibrational Framework for Nested Alternating Fixed Points and (Bi)Simulation Notions for Büchi Automata","type":"report","URL":"https://git.eleves.ens.fr/qaristote/m1-internship-report/uploads/3431548a277eb5fc297d8e7d93d1e3ce/aristote_quentin_m1_internship_report.pdf"},
- {"id":"aristoteMarcheQuantiqueReseau2019","abstract":"Rapport de stage de L3. On introduit un automate cellulaire quantique à une particule, un marcheur quantique, sur une variété triangulée de dimension 2. La triangulation change à travers des Pachner moves, induits eux-même par la densité du marcheur, permettant à la surface de se transformer en n'importe quelle autre surface qui lui est topologiquement équivalente. Ce modèle généralise le marcheur quantique sur un réseau triangulaire, introduit dans un article précédent par un des auteurs, et dont la limite en espace-temps retombe sur l'équation de Dirac en 2+1 dimensions.\nDes simulations numériques montrent que le nombre de triangles et que la courbure évoluent en exp(a log(t) - bt²), où a et b paramétrisent la façon dont la géométrie change selon la densité locale du marcheur, et que, sur le long terme, la surface redevient plate. Enfin, on montre aussi numériquement que le comportement global du marcheur reste le même sous l'influence de fluctuations spatio-temporelles aléatoires.","author":[{"family":"Aristote","given":"Quentin"}],"citation-key":"aristoteMarcheQuantiqueReseau2019","issued":{"date-parts":[[2019,8,25]]},"language":"fr","license":"All rights reserved","page":"15","title":"Marche quantique sur un réseau triangulaire sujet à des Pachner moves","type":"report","URL":"https://git.eleves.ens.fr/qaristote/rapport-stage-l3/-/raw/b9f9cc78ad3eabe6508be70cc27dc9bf89d34755/rapport.pdf"}
-]
diff --git a/research/default.nix b/research/default.nix
index 8de25f8..90f0471 100644
--- a/research/default.nix
+++ b/research/default.nix
@@ -2,19 +2,31 @@
pkgs,
lib,
...
-}: let
- importPublications = builtins.map (publication:
- with publication;
- publication
- // {
- year = with builtins; toString (head (head issued.date-parts));
- url = URL;
- });
-in {
- conferences = importPublications (lib.importJSON ./conferences.json);
- journals = importPublications (lib.importJSON ./journals.json);
- reports = importPublications (lib.importJSON ./reports.json);
- misc = importPublications (lib.importJSON ./miscellaneous.json);
- talks = importPublications (lib.importJSON ./talks.json);
- files = pkgs.callPackage ./export.nix {refsJSON = lib.concatStringsSep " " [./conferences.json ./journals.json ./reports.json ./miscellaneous.json ./talks.json];};
+}:
+let
+ importResearch = builtins.map (
+ researchItem:
+ with researchItem;
+ researchItem
+ // {
+ year = with builtins; toString (head (head issued.date-parts));
+ url = URL;
+ }
+ );
+in
+{
+ conferences = importResearch (lib.importJSON ./conferences.json);
+ journals = importResearch (lib.importJSON ./journals.json);
+ reports = importResearch (lib.importJSON ./reports.json);
+ misc = importResearch (lib.importJSON ./miscellaneous.json);
+ talks = importResearch (lib.importJSON ./talks.json);
+ files = pkgs.callPackage ./export.nix {
+ refsJSON = lib.concatStringsSep " " [
+ ./conferences.json
+ ./journals.json
+ ./reports.json
+ ./miscellaneous.json
+ ./talks.json
+ ];
+ };
}
diff --git a/research/export.nix b/research/export.nix
index b119054..22c965d 100644
--- a/research/export.nix
+++ b/research/export.nix
@@ -4,20 +4,27 @@
refsJSON,
runCommand,
}:
-runCommand "publications" {buildInputs = [jq pandoc];} ''
- mkdir -p "$out"/{biblatex,bibtex,csljson}
- cd "$out"
+runCommand "export-research-bib"
+ {
+ buildInputs = [
+ jq
+ pandoc
+ ];
+ }
+ ''
+ mkdir -p "$out"/{biblatex,bibtex,csljson}
+ cd "$out"
- for refs in ${refsJSON}
- do
- jq --compact-output ".[]" $refs | while read -r ref
+ for refs in ${refsJSON}
do
- id=$(echo "$ref" | jq --raw-output '.id')
- echo $id
- echo "$ref" > "csljson/$id"
- cat csljson/$id
- pandoc --from=csljson --to=biblatex --output "biblatex/$id" <<< "[ $ref ]"
- pandoc --from=csljson --to=bibtex --output "bibtex/$id" <<< "[ $ref ]"
+ jq --compact-output ".[]" $refs | while read -r ref
+ do
+ id=$(echo "$ref" | jq --raw-output '.id')
+ echo $id
+ echo "$ref" > "csljson/$id"
+ cat csljson/$id
+ pandoc --from=csljson --to=biblatex --output "biblatex/$id" <<< "[ $ref ]"
+ pandoc --from=csljson --to=bibtex --output "bibtex/$id" <<< "[ $ref ]"
+ done
done
- done
-''
+ ''
diff --git a/src.nix b/src.nix
index 1d533fd..b24b2d4 100644
--- a/src.nix
+++ b/src.nix
@@ -1,7 +1,17 @@
-{lib, ...}: let
+{ lib, ... }:
+let
fs = lib.fileset;
in
- fs.toSource {
- root = ./.;
- fileset = fs.unions [./default.nix ./basics ./education ./experience ./files ./languages ./publications ./software];
- }
+fs.toSource {
+ root = ./.;
+ fileset = fs.unions [
+ ./default.nix
+ ./basics
+ ./education
+ ./experience
+ ./files
+ ./languages
+ ./research
+ ./software
+ ];
+}