Monodisperse polyhedral metal-organic framework (MOF) particles up to 5 μm in size, large enough to enable in situ optical imaging of particle orientation, were synthesized by the strategy of simultaneous addition of two capping ligands with different binding strength during crystallization. Upon dispersing them in ethylene glycol and applying AC electric field, the particles facets link to for...

Article history: Received 9 March 2016 Received in revised form 26 April 2016 Accepted 30 April 2016 Available online 14 May 2016 The present study compared the psychometric properties of the Trait Emotional Intelligence Questionnaire (TEIQue) in Catalan and UK samples. The results showed similar means and standard deviations in the facets scoring higher in both languages, except for Adaptabili...

Genetic and environmental sources of covariation among cognitive measures of verbal IQ, performance IQ (PIQ), academic achievement, 2-choice reaction time (CRT), inspection time (IT) and the 6 Openness facets of the NEO Personality Inventory-Revised (NEO PI-R) were examined. The number of twin and twin-sibling pairs ranged from 432 (182 MZ, 350 DZ/sibling) to 1023 (273 MZ, 750 DZ/sibling) for c...

Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [9]. Ben Rebea conjectured a description for quasi-line graphs, see [12]; Chudnovsky and Seymour [2] v...

The study investigated differences in the Five-Factor Model (FFM) domains and facets across adulthood. The main questions were whether personality scales reflected coherent units of trait development and thereby coherent personality traits more generally. These questions were addressed by testing if the components of the trait scales (items for facet scales and facets for domain scales) showed ...

Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [9,14] and claw-free graphs [8,9]. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem [10]. However, even the problem of finding all facets of stable set polytopes of webs is open. So far,...

We study facets of the k-partition polytope Pk.+, the convex hull of edges cut by r-partitions of a complete graph for r < k, k 2 3. We generalize the hypermetric and cycle inequalities (see Deza and Laurent, 1992) from the cut polytope to Pk.,, k 2 3. We give some sufficient conditions under which these are facet defining. We show the anti-web inequality introduced by Deza and Laurent (1992) t...