نتایج جستجو برای: bermond
تعداد نتایج: 67 فیلتر نتایج به سال:
L’article s’intéresse aux livres de littérature jeunesse, parus en France au xxe et xxie siècles, se liant nombres avec l’intention implicite ou explicite d’initier leurs lecteurs à quelques savoirs, pratiques mystères jalonnant l’univers des entiers naturels. L’étude vise problématiser l’expérience esthétique dans le développement connaissances rôle l’imagination l’initiation nombres. Le cadre...
Genetic variation in the catechol-O-methyltransferase (COMT) Val158Met polymorphism has been shown to influence performance on cognitive and emotional tasks. Specifically, it has been suggested that the Met allele might be less advantageous than the Val allele with respect to emotional processing. This study addresses the question whether the presence of the Met allele is directly related to bo...
There is an increasing interest in the socio-affective atypicalities observed in adults with autism spectrum disorder (ASD). The aim of this study was to further explore emotional responsiveness in adults with ASD using well-validated self-reports of alexithymia and to determine whether anhedonic features are part of a broader autism phenotype (BAP). Participants comprised 38 adults with ASD, 8...
Affect regulation is often compromised as a result of early life interpersonal traumatization and disruption in caregiving relationships like in situations where the caretaker is emotionally, sexually or physically abusing the child. Prior studies suggest a clear relationship between early childhood attachment-related psychological trauma and affect dysregulation. We evaluated the relationship ...
This paper considers the question of the in uence of a coalition of vertices seeking to gain control or majority in local neighborhoods in a general graph Say that a vertex v is controlled by the coalition M if the majority of its neighbors are fromM We ask how many vertices as a function of jM j can M control in this fashion Upper and lower bounds are provided for this problem as well as for c...
Compound methods have been shown to be very eeective in the construction of minimal broadcast networks (mbns). Compound methods generate a large mbn by combining multiple copies of an mbn G using the structure of another mbn H. Node deletion is also allowed in some of these methods. The subset of connecting nodes of G has been deened as solid h-cover by Bermond, Fraigniaud and Peters, and cente...
in this paper, we prove that the wrapped Butterfly graph WBF(d; n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the case d = 2. Key-words: Butterfly graph, graph theory, Hamiltonism, Hamilton decomposition, Hamilton cycle, Hamilton circuit, perfect matching. (Résumé : tsvp) This work has been supported by the C...
BACKGROUND Alexithymia, or "no words for feelings", is a personality trait which is associated with difficulties in emotion recognition and regulation. It is unknown whether this deficit is due primarily to regulation, perception, or mentalizing of emotions. In order to shed light on the core deficit, we tested our subjects on a wide range of emotional tasks. We expected the high alexithymics t...
Let D be a strongly k−connected digraph of order n ≥ 2. We prove that for every l ≥ n 2k the power Dl of D is Hamiltonian. Moreover, for any n > 2k ≥ 2 we exhibit strongly k-connected digraphs D of order n such that Dl−1 is non-Hamiltonian for l = d n 2ke. We use standard terminology, unless otherwise stated. A digraph D = (V, A) of order n ≥ 2 is said to be strongly q-arc Hamiltonian if for an...
Alexithymia ("no words for feelings") is a major risk factor for psychosomatic and psychiatric conditions characterized by affect dysregulation. The alexithymia personality construct comprises an affective dimension, the level of subjective emotional experience (emotionalizing and fantasizing), and a cognitive dimension, referring to the cognitive control of emotions (identifying, analyzing, an...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید