Le développement cérébral est une succession d'étapes aboutissant à l'établissement d'un réseau neuronal. Il fait intervenir de nombreuses molécules comme des protéines d'adhésion permettant l'interaction des neurones avec leur environnement. L'implication de nombreux gènes codant des protéines d'adhésion dans la physiopathologie de maladies neuropsychiatriques comme l'autisme souligne l'intérêt à en identifier de nouveaux. Pendant ma thèse, j'ai pu caractériser deux nouveaux gènes, Susd2 et Susd4, codant des protéines contenant des domaines CCP (Complement Control Protein), classiquement connus pour leur présence dans les protéines participant à la régulation du système du Complément. Récemment, des protéines à domaines CCP ont été décrites chez la souris comme ayant une fonction dans le développement neuronal. L'existence de nombreuses protéines prédites à domaines CCP sans fonction connue m'ont conduit à tenter de caractériser Susd2 et Susd4 qui en font partie.Susd2 est exprimé dans les neurones au sein de cultures de cellules d'hippocampe de rat. Son expression atteint un pic à un stade post natal précoce, suggérant une fonction développementale. La protéine Susd2 recombinante a une localisation neuronale diffuse, mais est particulièrement enrichie dans les synapses excitatrices. La diminution de l'expression de Susd2 a pour conséquences un défaut de croissance axonale, une augmentation de la croissance dendritique, et une inhibition spécifique de la synaptogénèse excitatrice. Susd4 est également exprimé dans les neurones, avec un pic d'expression au stade embryonnaire, et semble jouer un rôle de régulation du développement dendritique. / During brain development, several steps precisely coordinated lead to establishment of a functional neuronal network. Many molecules participate to this process, including adhesion proteins mediating interactions between neurons and their environment. Involvement of numerous genes coding for adhesion proteins in neuropsychiatric diseases such as autism argue for usefulness of identifying new ones. During my PhD, I characterized two new genes, Sud2 and Susd4, coding for proteins containing CCP domains (Complement Control Protein), classically described in proteins involved in Complement regulation system. Recently, in mammals, CCP containing proteins were shown to be involved in neuronal development. Identification of several predicted CCP containing proteins without a known function prompted me to characterize Susd2 and Susd4 which are part of them.Susd2 is expressed in neurons from hippocampal cell cultures. Its peak of expression takes place in early post natal period, suggesting a developmental function. Susd2 recombinant protein has a diffuse neuronal localization, but is particularly enriched in excitatory synapses. Decreased expression of Susd2 leads to decreased axonal growth, increased dendritic growth, and specific inhibition of excitatory synaptogenesis. Susd4 is also expressed in neurons, with a peak of expression during embryonic development, and seems to act as a regulator of dendritic growth.

The relationships between work and personal life have been on the public, business, and research agenda for about 35 years. Perspectives on these relationships have shifted from a work-family to work-life or work-personal life focus, from a conflict to a balance or enrichment view and, finally, from a segmentation to an integration perspective. This evolution, however, leads to a theoretical and practical impasse where neither integration nor segmentation can be seen as the absolute individual, organisational and societal value. This thesis takes the discussion one step further and focuses on individuals’ work/non-work experiences, calling for a humanistic case. The humanistic case urges placing individuals’ work/non-work experiences at the centre of human resources and at the centre of the work-life field. The aim of the thesis is to theorise individuals’ work/non-work experiences in their individual, organisational and societal contexts. To achieve the purpose, the thesis presents individuals’ work/non-work self-narratives. These self-narratives of six French middle-managers, three men and three women, underline how individuals experience their diverse life domains, namely the work, the family, the social and the private and their management. The self-narratives have been generated through in-depth qualitative interviews and diaries. The thesis explores and provides an understanding of individuals’ work/non-work experiences from a boundary perspective. Focusing on the processes behind individuals’ work/non-work experiences, the thesis reveals that work/non-work preferences for integration and/or segmentation are not sufficient to understand individuals’ experiences. It is essential to consider the preferences in relation to their level of explicitness and the development of work/non-work self-identity. Moreover, it is important to understand the roles of positive and negative work/non-work emotions emerging in the work/non-work process as a respective signal of individuals’ satisfaction or dissatisfaction in how their life domains are developed and managed. The thesis contributes to the work-life field, especially the boundary perspective on work and non-work by presenting a model of individuals’ work/non-work experiences. The model pursued is derived from 33 theoretical propositions. The study suggests a two-dimensional approach for life domain boundaries as a systematic combination of seven boundary types (spatial, temporal, human, cognitive, behavioural, emotional and psychosomatic) and their mental and concrete natures. It suggests a three-dimensional model for work/non-work preferences, revealing five major archetypes of work/non-work preferences between segmentation and integration, and stressing the emotional side of the work/non-work process. It shows that individuals value segmentation on a daily basis and integration on a long-term. This thesis concludes that segmenting and integrating is essential for the harmony of their life domains namely their work, their family, their social and their private.

The main purpose of this thesis is to describe methods of constructing computer-free proofs of existence of finite groups and give useful techniques to perform double coset enumeration of groups with symmetric presentations over their control groups.

Dans de nombreux domaines où il existe des risques pour l'homme, comme la médecine, le nucléaire ou l'avionique, il est nécessaire de passer par une phase de certification visant à garantir le bon fonctionnement d'un système ou d'un produit. La certification se fait en fonction de documents normatifs qui expriment les exigences de justifications auxquelles le produit et le processus de développement doivent se conformer. Un audit de certification consiste alors à produire une documentation attestant la conformité avec ce cadre réglementaire.Pour faire face à ce besoin de justifications visant à assurer la conformité avec les normes en vigueur et la complétude des justifications apportées, il faut dès lors être capable de cibler les exigences de justification à revendiquer pour un projet et produire les justifications durant le développement du projet. Dans ce contexte, éliciter les exigences de justifications à partir des normes et produire les justifications nécessaires et suffisantes sont des enjeux pour assurer le respect des normes et éviter la sur-justification.Dans ces travaux nous cherchons à structurer les exigences de justification pour ensuite aider à la production des justifications associées tout en restant attentif à la confiance que l'on peut placer en elles. Pour relever ces défis, nous avons défini une sémantique formelle pour une modélisation existante des justifications : les Diagrammes de Justification. A partir de cette sémantique, nous avons pu définir un ensemble d'opérations permettant de contrôler le cycle de vie des justifications pour assurer la conformité des justifications au regard des exigences de justification. Par ce formalisme, nous avons également pu guider, voire automatiser dans certains cas, la production des justifications et la vérification de la conformité.Ces contributions ont été appliquées dans le contexte des technologies médicales pour l'entreprise AXONIC, porteuse de ces travaux. Ceci a permis de i) éliciter les exigences de justification des normes médicales et pratiques internes de l'entreprise, ii) produire automatiquement les justifications associées à la norme IEC 62304 pour le logiciel en médical, iii) automatiser la vérification et validation des justifications ainsi que la production de documents utilisables lors d'audit. / In many areas where it exists human risks, such as medicine, nuclear or avionics, it is necessary to go through a certification stage to ensure the proper functioning of a system or product. Certification is based on normative documents that express the justification requirements to which the product and the development process must conform. A certification audit then consists of producing documentation certifying compliance with this regulatory framework.To cope with this need for justifications to ensure compliance with the standards in force and the completeness of the justifications provided, it must therefore be able to target the justification requirements to be claimed for a project and produce justifications during the development of the project. In this context, eliciting the justification requirements from the standards and producing the necessary and sufficient justifications are issues to ensure compliance with standards and avoid over-justification.In these works we seek to structure the justification requirements and then help to produce the associated justifications while remaining attentive to the confidence that can be placed in them. To address these challenges, we have defined a formal semantics for an existing model of justifications: Justification Diagrams. From this semantics, we have been able to define a set of operations to control the life cycle of the justifications to ensure that the justifications regarding the justification requirements. Through this semantics, we have also been able to guide, and even automate in some cases, the production of justifications and the verification of conformance.These contributions were applied in the context of medical technologies for the company AXONIC, the bearer of this work. This made it possible to i) elicitate the justification requirements of the medical standards and company's internal practicals, ii) automatically produce the justifications associated with the IEC 62304 standard for medical software, iii) automate the verification and validation of the justifications as well as the production of documents that can be used during the audit.

Esta tese tem como foco modos ameríndios de conhecer e circular nas florestas, importante domínio cosmológico e de produção da vida. Mais especificamente, a tese está centrada nos saberes e nas formas de relações estabelecidas a partir de elementos vegetais, que envolvem múltiplas interações entre humanos e não humanos. Este trabalho está fundamentado, em grande parte, em levantamentos bibliográficos, mas também em material de campo levantado entre os Araweté, povo tupi-guarani habitante da região do Médio Xingu - Pará. / This thesis focuses on Amerindian ways of knowing and moving in the forest, an important cosmological and life production domain. More specifically, the thesis is centered on the knowledge and relations established with the vegetation, which involve multiple interactions between humans and non-humans. The work is largely based on bibliographic survey but also on fieldwork material gathered amongst the Araweté, Tupi-Guarani people that inhabitant the Middle Xingu region of Pará.

京都大学 / 0048 / 新制・課程博士 / 博士(人間・環境学) / 甲第22900号 / 人博第969号 / 新制||人||229(附属図書館) / 2020||人博||969(吉田南総合図書館) / 京都大学大学院人間・環境学研究科共生人間学専攻 / (主査)教授 谷口 一美, 教授 藤田 耕司, 准教授 守田 貴弘, 教授 山梨 正明 / 学位規則第4条第1項該当 / Doctor of Human and Environmental Studies / Kyoto University / DFAM

Temporal logics are a very popular family of logical languages, used to specify properties of abstracted systems. In the last few years, many extensions of temporal logics have been proposed, in order to address the need to express more than just abstract properties. In our work we study temporal logics extended by local constraints, which allow to express quantitative properties on data values from an arbitrary relational structure called the concrete domain. An example of concrete domain can be (Z, <, =), where the integers are considered as a relational structure over the binary order relation and the equality relation. Formulas of temporal logics with constraints are evaluated on data-words or data-trees, in which each node or position is labeled by a vector of data from the concrete domain. We call the constraints local because they can only compare values at a fixed distance inside such models. Several positive results regarding the satisfiability of LTL (linear temporal logic) with constraints over the integers have been established in the past years, while the corresponding results for branching time logics were only partial. In this work we prove that satisfiability of CTL* (computation tree logic) with constraints over the integers is decidable and also lift this result to ECTL*, a proper extension of CTL*. We also consider other classes of concrete domains, particularly ones that are \"tree-like\". We consider semi-linear orders, ordinal trees and trees of a fixed height, and prove decidability in this framework as well. At the same time we prove that our method cannot be applied in the case of the infinite binary tree or the infinitely branching infinite tree. We also look into extending the expressiveness of our logic adding non-local constraints, and find that this leads to undecidability of the satisfiability problem, even on very simple domains like (Z, <, =). We then find a way to restrict the power of the non-local constraints to regain decidability.

Oxidized phospholipids (OxPLs) are known to be present in living organisms due to oxidative stress. However, the physiological function of OxPLs is still not fully understood. They have been shown to be present in many inflammatory diseases such as atherosclerosis and neurodegenerative diseases like Parkinson's and Alzheimer's disease. In this work we present the influence of two truncated OxPLs on the lateral heterogeneity of a model lipid membrane. Specifically, we studied the effect of 1-palmitoyl-2-(5'-oxo-valeroyl)-sn-glycero-3- phosphocholine (POVPC) and 1-palmitoyl-2-glutaryl-sn-glycero-3-phosphocholine (PGPC) on the formation of nanodomains present in giant unilamellar vesicles containing 1,2- dioleoyl-sn-glycero-3-phosphocholine (DOPC), cholesterol and sphingomyelin. Only few techniques are capable of detecting nanometer-sized domains in the membrane with high resolution. Time resolved Förster resonance energy transfer (TR-FRET) combined with Monte Carlo (MC) simulations provide a strong tool not only to detect lateral heterogeneities but also characterize them with the resolution of 2 nm. Profound effects on the nanodomain size were observed in the presence of both studied OxPLs and differences were detected, as PGPC with a carboxylic group drives formation of larger nanodomains than POVPC...

Eigenvectors of the Laplacian of a graph G have received increasing attention in the recent past. Here we investigate their so-called nodal domains, i.e. the connected components of the maximal induced subgraphs of G on which an eigenvector ψ does not change sign. An analogue of Courant's nodal domain theorem provides upper bounds on the number of nodal domains depending on the location of ψ in the spectrum. This bound, however, is not sharp in general. In this contribution we consider the problem of computing minimal and maximal numbers of nodal domains for a particular graph. The class of Boolean Hypercubes is discussed in detail. We find that, despite the simplicity of this graph class, for which complete spectral information is available, the computations are still non-trivial. Nevertheless, we obtained some new results and a number of conjectures.

We discuss a new concept of agent programs that combines logic programming with reasoning about actions. These agent logic programs are characterized by a clear separation between the specification of the agent’s strategic behavior and the underlying theory about the agent’s actions and their effects. This makes it a generic, declarative agent programming language, which can be combined with an action representation formalism of one’s choice. We present a declarative semantics for agent logic programs along with (two versions of) a sound and complete operational semantics, which combines the standard inference mechanisms for (constraint) logic programs with reasoning about actions.