NCube/papyrus huggingface dataset:
L’inclusion des immigrants et l’identité politique libérale

For David Miller, the inclusion of immigrants requires their cultural integration. A mere political inclusion of immigrants without cultural anchoring muddles the cultural background of the nation-state, already tested by globalization, sub-state nationalisms and fragmented identities. Therefore, cultural homogeneity provides the nation-state a strong national identity required for citizenship, democratic deliberation and social justice. Our aim in this memorandum is to show that this substantialist approach is too strong a requirement, that this conception of national identity should not be a sine qua non prerequisite for a viable liberal political identity, and that it is incompatible with a pluralist society. We are proposing, instead, a political approach founded on a specific interpretation of Rawl’s public reason theory. Hence, two objectives will be explored: the plausible dissociation of national identity and citizenship, and consequently, the foundation of a pluralist society.

Keyphrases: Inclusion, Immigrants, Miller, Philosophy, National identity, Citizenship, Public reason
La prostitution : une mesure de la marchandisation de la personne?

This paper aims to explore the normative assumptions underlying the conceptualization of prostitution as a measure of the commodification of the person. I propose to question some of the theoretical assumptions underlying the conceptualization of prostitution as a form of commodification of the person. Insofar as prostitution is distinguished from other activities on the basis of this symbolic status, my research consists in questioning the theoretical bases of this normative characterization. Feminist literature on the subject of prostitution focuses on the issue of the criminalization of prostitution and its social stigmatization, but it is not reduced to a polarized debate between abolitionists and regulationists. I will first identify how the subject of prostitution has been problematized from different theoretical frameworks and present epistemic perspectives on the conceptualization of the problem of prostitution. I will then identify and analyze the normative paradigms that historically constitute prostitution as the measure of women objectification. Finally, I will focus on Carole Pateman’s definition of prostitution in The Sexual Contract. My aim is to identify in which extent the conceptualization of the prostitution contract as the symbol of body commodification is relevant to understand the power dynamics underlying this type of agreement. More specifically, I will study the normative assumptions underlying the distinction between the prostitution contract and other contractual forms of subjection.

Keyphrases: prostitution, domination, Pateman, feminism, body commodification, Pateman, power relations, contract, sex work
Le problème de Steklov paramétrique et ses applications

This thesis contains two articles that I wrote during my M.Sc. studies. The first chapter serves as an introduction to both articles. Some concepts of spectral geometry in the context of the Steklov problem are presented, as well as the main results of the subsequent chapters. The second chapter concerns the parametric Steklov problem on smooth surfaces. We obtain a complete asymptotic expansion of the eigenvalues of the problem by using pseudodifferential techniques. This generalizes the already known spectral asymptotics of the classical Steklov problem. We deduce new geometric invariants determined by the spectrum. The third chapter concerns the sloshing problem on triangular prisms. The goal is to understand how the angles in the prism affect the second term in the asymptotic expansion of the eigenvalue counting function. By constructing quasimodes, we obtain an expression for this term that we conjecture as being correct for the true eigenvalues. This conjecture is then supported by numerical experiments.

Keyphrases: Spectral geometry, Dirichlet-to-Neumann operator, Parametric Steklov problem, Sloshing problem, Spectral asymptotics
La structure des représentations des algèbres de Temperley-Lieb affines sur la chaîne de spins XXZ

This master’s thesis reveals the structure of the representations of the affine Temperley-Lieb algebras aTLN(β) on the eigenspaces CN(q,v,d) (of the total spin Sz) of the periodic XXZ spin chains. In particular, we show that these representations, introduced by Martin/Saleur and Morin-Duchesne/Saint-Aubin, always admit a structure akin that of the Feigin-Fuchs representations of the Virasoro Vir algebra and that the different possibilities, for the structure of a Feigin-Fuchs Vir-module, are all realized by a given eigenspace. We also give a plethora of aTLN(β)-linear maps between different eigenspaces by considering a natural action of the Lusztig extension LUqsl2 on the periodic XXZ chains and we then fully characterize the kernel and image of these morphisms by means of long exact sequences and a generalized Clebsch-Gordan decomposition. Finally, we explicitly give the image of the intertwiner iNd(q,v) defined by Morin-Duchesne/Saint-Aubin and we also introduce a new explicit realization for the projective covers in the category modLUqsl2.

Keyphrases: Representation theory, Affine Temperley-Lieb algebras, Cellular modules, Periodic XXZ chains, Quantum groups, Quantum Schur-Weyl duality, Projective covers, Generalized Clebsch-Gordan decomposition
Modèle de mélange gaussien à effets superposés pour l’identification de sous-types de schizophrénie

This work is part of the research effort to identify subtypes of schizophrenia through brain connectivity data from functional magnetic resonance imaging. Clustering techniques, including the Esperance-Maximization algorithm (EM) for estimating parameters of Gaussian mixture models, have been used on such data in previous research. This approach captures the effects of normal brain processes that are irrelevant to the identification of disease subtypes. In this work, the population data of control (non-disease) individuals are modeled by a finite mixture of Gaussian densities. Each density represents an assumed subtype of normal brain function. A new model is proposed for the population data of affected individuals : a mixture of Gaussian densities where each density has an mean corresponding to the sum of a normal state and a disease state. Therefore, it is a mixture in which subtypes of normal brain function and subtypes of disease are superimposed. It is assumed that normal and unhealthy processes are additive and the goal is to isolate and estimate the unhealthy effects. An EM algorithm specifically designed for this model is developed. Data were obtained from functional magnetic resonance imaging of 242 control individuals and 242 patients diagnosed with schizophrenia. Results obtained using this algorithm on this data set are reported.

Keyphrases: clustering, gaussian mixture, schizophrenia, superimposed effects
La famille exceptionnelle des algèbres à couture

This thesis studies the representation theory of the Temperley-Lieb seam algebras Bn,k (β), more specifically the exceptionnal family of seam algebras Bn,l (β). The seam algebras are parametrized by two positive integers and one complex parameter q ∈ ℂˣ such that β = q + q⁻¹. The family Bn,l (β) involves a positive integer l satisfying q²ˡ = 1. The seam algebras were introduced by Morin-Duchesne, Rasmussen and Ridout and they were studied by Langlois-Rémillard and Saint-Aubin when they are not part of a particular case which is called exceptionnal. It was highlighted by Morin-Duchesne, Rasmussen and Ridout that the missing cases would probably need a separate analysis. This thesis has the objective of introducing tools which render the study of those missing cases possible. More specifically, by reinterpreting the defining relations of the seam algebras, the algebras Bn,l (β) are redefined as a quotient of the one boundary algebras by a nilpotent ideal generated by an element which generalises the Wenzl-Jones projectors.

Keyphrases: Idéaux nilpotents, Representation theory, Cellular algebras, Nilpotent ideals, One boundary Temperley-Lieb algebras, Seam algebras, Wenzl-Jones projectors
Croisements de lignes de flot entre fonctions de Morse et décomposition en cône itéré

This master’s thesis introduces a new way to sudy Morse functions on a compact manifold. More specifically, crossings between flows of pseudo-gradients associated to Morse functions allow one to define geometric realisations of morphisms between the Morse complexes. This new class of morphisms leads to the definition of a triangulated category. The main question is to determine if every object of this category admits an iterated cone decomposition. Such a decomposition would greatly simplify the study of the dynamic of a Morse function by interpreting it as many perfect Morse functions. A second topic concerns the global genericity condition to which this category is subject. We study a way, through deformation of Morse functions, to avoid such a constraint.

Keyphrases: Morse theory, Morse homology, Triangulated category, Iterated cone decomposition, Generic pair of Morse functions
Code-switching : language of bilingual children and what it can reveal about multiple language use

Code-switching and borrowing are both highly common linguistic phenomena in multilingual communities. Whilst much research has been carried out on these phenomena, there are two aspects of them which have not been satisfactorily explored. Firstly, the exact distinction between code-switching and borrowing, and secondly, that of code-switching in children.   Many researchers state that the difference between code-switching and borrowing lies in phonology: borrowings from another language assimilate to the phonology of the language in which they have been inserted. Whilst this may be a necessary distinction of borrowing, it may not be sufficient to distinguish it from code-switching. This has led to many researchers to propose that a key difference between code-switching and borrowing is that the former is subject to a set of constraints, though these differ greatly between theories.  Code-switching behaviour of young bilingual children is ideal for testing the validity of these theories: many researchers argue that there is a developmental aspect to constraints acting upon children’s code-switching, which provides valuable insight into the nature of bilingual language acquisition.  The aim of this thesis is therefore to answer two crucial questions. Firstly, if there does indeed exist a developmental aspect to constraints acting on children’s code-switching, and, secondly, what bilingual children’s code-switching can reveal about multiple language use, particularly with regards to bilingual language acquisition.

Keyphrases: bilingualism, language acquisition, code-switch, borrowing, constraint
Le point sur l’avantage cognitif du bilinguisme : deux langues, deux mesures

The present thesis aims to clarify the bilingual cognitive advantage debate. A review of the scientific literature must be realized to determine if speaking more than one language truly generates a cognitive improvement which can generalize itself further than within the sole language faculty. This will necessitate a modern and exhaustive redefinition of bilingualism and executive functions as research concepts in order to target the behavioral, cognitive and neurologic aspects at stake within the plurality of language.

Keyphrases: inhibition, attention, acquisition, bilingualism, executive functions, cerebral plasticity
Relations entre le fonctionnement cognitif précoce et le devenir fonctionnel à court terme des patients atteints d'un traumatisme craniocérébral

Context. There is currently little literature on early cognitive impairment following a traumatic brain injury (TBI). The aim of the study was to assess the early cognitive impairment of patients with TBI using the Batterie d’Efficience Cognitive (B.E.C. 96) and to predict their short-term functional outcome. Method. A total of 123 participants were recruited into this study (n= 73 TBI group; n= 50 orthopedic/traumatic group). Cognition was assessed by the B.E.C. 96 while the functional outcome of TBI patients was measured using the Glasgow Outcome Scale - Extended (GOS-E), the length of stay and the discharge destination. Results. Significant differences were found between the two groups on the Verbal Fluency, Delayed recall and Naming tests. Age and education predict total score of the B.E.C. 96. Mental manipulation, Problems solving and Verbal Fluency tests were found to be correlated with the GOS-E. As for the length of stay, it was significantly linked to Mental manipulation, Orientation and Problems solving tests as well as the total score. Finally, with the exception of the Naming test, all B.E.C. 96 tests including the total score were found to be significant predictors of the discharge destination. Conclusions. The B.E.C. 96 appears to be clinically useful in screening for TBI-related cognitive impairment and even more in determining their short-term prognosis. However, other larger studies are needed to validate this tool in such a context.

Keyphrases: Cognition, Glasgow Outcome Scale - Extended (GOS-E), Traumatic brain injury, Acute care, Functional outcome, Length of stay, Discharge destination, Clinical neuropsychology
An intelligent real-time help system for clinical reasoning in virtual reality environment based on emotional analysis

students can evaluate their medical knowledge by well-designed virtual clinical cases from a case database. During the process of the evaluation, electroencephalogram signals are collected simultaneously for evaluating the emotional status of the student, which helps researchers study the emotional change of the student during the whole evaluation process. Previous studies showed that maintaining a peaceful and positive emotion is necessary for good performance, and one possible way to maintain such emotional status is to help avoid negative emotions (frustration, stress, confusion, etc.) that can arise by errors during the evaluation. In this research, we studied, designed and developed a real-time help system and integrated it into Hypocrates to form its next version: Hypocrates+. The help system is intelligent as it provides personalized and high related help content when the whole platform believes such help content is necessary to maintain a student’s peaceful and positive emotion status. The help system is real-time as it has a very shot delay of response so that the student can obtain useful medical knowledge very quickly. The help content is generated from internet, or more precisely, from online Wiki pages, to keep the help content is always up to date. C# language and Visual Studio IDE were used to develop the real-time help system: a console application functions as a server providing services to its clients: other part of Hypocrates+ platform. Techniques like information retrieval, artificial intelligence, UDP network programming were widely involved to help developing the intelligent server. With the desired real-time help system integrated, Hypocrates+ upgraded to a virtual medical education platform instead of just an evaluation one, which is becoming more and more popular in modern medical education. Tests and Experiments were performed on the real-time help system and Hypocrates+ to investigate the quality and usefulness of the generated help content and the response time. Results show that the content quality is quite good. The response is very quick with average response time of 1.5 seconds. The results of emotion analysis show that help content reduced 4 8 of 5 participants’ negative emotion. We conclude that the real-time help system with good quality of help content enriches the functionality of a virtual reality medical education platform and it probably helps medical students reduce negative emotion during clinical reasoning.

Keyphrases: artificial intelligence, emotional analysis, medical education, real-time, virtual reality
Towards using fluctuations in internal quality metrics to find design intents

Version control is the backbone of the modern software development workflow. While building more and more complex systems, developers have to understand unfamiliar subsystems of source code. Understanding the logic of unfamiliar code is relatively straightforward. However, understanding its design and its genesis is often only possible through scattered and unreliable commit messages and project documentation -- when they exist.  Thus, developers need a reliable and relevant baseline to understand the history of software projects. In this thesis, we take the first steps towards understanding change patterns in commit histories. We study the changes in software metrics through the evolution of projects.  Through multiple exploratory studies, we conduct quantitative and qualitative experiments on several datasets extracted from a pool of 13 projects. We mine the changes in software metrics for each commit of the respective projects and manually build oracles to represent ground truth.  We identified several categories by analyzing these changes. One pattern, in particular, dubbed "tradeoffs", where some metrics may improve at the expense of others, proved to be a promising indicator of design-related changes -- in some cases, also hinting at a conscious design intent from the authors of the changes. Demonstrating the findings of our exploratory studies, we build a general model to identify the application of a well-known set of design principles in new projects.  Our overall results suggest that metric fluctuations have the potential to be relevant indicators for valuable macroscopic insights about the design evolution in a project's development history.

Keyphrases: Software maintenance, Software design, Version history, Software measurement, Refactoring
Assessing the robustness of genetic codes and genomes

There are two main approaches to assess the robustness of genetic codes and coding sequences. The statistical approach is based on empirical estimates of probabilities computed from random samples of permutations representing assignments of amino acids to codons, whereas, the optimization-based approach relies on the optimization percentage frequently computed by using metaheuristics. We propose a method based on the first two moments of the distribution of robustness values for all possible genetic codes. Based on a polynomially solvable instance of the Quadratic Assignment Problem, we propose also an exact greedy algorithm to find the minimum value of the genome robustness. To reduce the number of operations for computing the scores and Cantelli’s upper bound, we developed methods based on the genetic code neighborhood structure and pairwise comparisons between genetic codes, among others. For assessing the robustness of natural genetic codes and genomes, we have chosen 23 natural genetic codes, 235 amino acid properties, as well as 324 thermophilic and 418 non-thermophilic prokaryotes. Among our results, we found that although the standard genetic code is more robust than most genetic codes, some mitochondrial and nuclear genetic codes are more robust than the standard code at the third and first codon positions, respectively. We also observed that the synonymous codon usage tends to be highly optimized to buffer the impact of single-base changes, mainly, in thermophilic prokaryotes.

Keyphrases: Quadratic assignment problem, Cantelli’s upper bound, Generalized linear mixed models, Genetic code, Hydrophobicity, Codon usage bias
Vérification des patrons temporels d’utilisation d’API sans exécution du code : une approche et un outil

In modern software development, reuse takes the form of using libraries that expose their functionality via Application Programming Interfaces (APIs). In theory, APIs allow developers to write client code that reuses library code without needing to know its internals. In practice, correctly using APIs requires respecting explicit and implicit constraints and usage patterns. This allows developers to use functionality proposed by API so that they can focus directly on the task they want to achieve. APIs require a significant effort from the developer to learn various usage constraint. Ignoring such patterns could lead to errors and design flaws. These often cannot be detected prior to integration and system testing. Researchers have attempted to solve this problem by extracting API usage patterns and analyzing client code traces for conformance. However, dynamic analysis is still impossible to perform early without a minimum of integration and execution. We propose the Temporal Usage PAttern Checker (Tupac) for API, an interprocedural static analysis approach that can verify that client code conforms to temporal API usage patterns as it is being developed. Tupac can be deployed inside an Integrated Development Environment (IDE), thus providing developers with feedback about API usage much earlier in the development process. We evaluated the effectiveness of our approach on four projects with four different APIs. Our evaluation shows that Tupac has good precision and interesting recall. Crucially, we also show that it takes, on average, half a second to check an entire project for conformance to a pattern, meaning that it can realistically be deployed in the regular coding rhythm

Keyphrases: API usage patterns, Static analysis, Model checking
A rolling horizon approach for the locomotive routing problem at the Canadian National Railway Company

This thesis addresses the locomotive routing problem arising at the Canadian National Railway Company (CN) - the largest railway in Canada in terms of both revenue and the physical size of its rail network. The problem aims to determine the sequence of activities for each locomotive over the planning horizon. Besides assigning locomotives to scheduled trains and considering scheduled locomotive maintenance requirements, the problem also includes other decisions, such as sending locomotives to stations by deadheading, light traveling, and leasing of third-party locomotives. Based on an Integer Programming formulation and a Time-Expanded Network presented in the literature, we introduce a Rolling Horizon Approach (RHA) as a method to find near-optimal solutions of this problem in acceptable computing time. We adapt a mathematical formulation and a space-time network from the literature. We introduce a new type of arcs for the network and new constraints for the model to cope with issues arising when dividing the planning horizon into smaller ones. Computational experiments on real-life instances show the pros and cons of our algorithm when compared to an exact solution approach.

Keyphrases: Locomotive Routing Problem, Rolling Horizon Approach