Journal of Gender Equality Disability Social Inclusion and Children
Not a member yet
25069 research outputs found
Sort by
Rapport de l’expérimentation ICÉ-AuRA : Co-construction d’innovations entre recherche et terrain, Institut Carnot de l’Éducation Auvergne-Rhône-Alpes,2016-2019
No full textValidation of Affect-tag Affective and Cognitive Indicators
No full textThe Affect-tag solution measures physiological signals to deliver indicators derived from cognitive science. In order to provide the most accurate and effective results, a database of electrodermal activity signals acquired using the Affect-tag A1 band was created. An experimental paradigm was designed to measure action-taking, autonomic regulation, cognitive load, emotions and stress, affects, and social stress. The Affect-tag Emotional Power, Emotional Density, and Cognitive Load affective and cognitive indicators were refined based on the physiological responses of 48 participants during these tasks. Statistical significance was obtained for all indicators in tasks they were designed to measure resulting in a total accuracy score of 89% for the combined indicators. Data obtained during this study will be further analyzed to define emotional and affective states
CLASSIFICATION SUPERVISÉE DE DONNÉES PÉDAGOGIQUES POUR LA RÉUSSITE DANS L'ENSEIGNEMENT SUPÉRIEUR
No full text
Les enceintes de hauteur de la Burg à Ratzwiller, de la Heidenstadt à Ernolsheim-lès-Saverne et du Ziegenberg à Niederbronn-les-Bains (67) Prospection thématique Rapport 2019 Sous la direction de Steeve Gentner et Maxime Walter, avec la collaboration de Simon Diemer et Clément Féliu
No full textOn Proper Labellings of Graphs with Minimum Label Sum
No full textThe 1-2-3 Conjecture, raised by Karo\'nski, {\L}uczak and Thomason, states that almost every graph admits a proper -labelling, i.e., a labelling of the edges with~ such that no two adjacent vertices are incident to the same sum of labels. Another interpretation of this conjecture, that may be attributed to Chartrand et al., is that almost every graph can be turned into a locally irregular multigraph , i.e., with no two adjacent vertices of the same degree, by replacing each of its edges by at most three parallel edges. In other words, for almost every graph there should be a locally irregular multigraph with the same adjacencies and having a relatively small number of edges. The 1-2-3 Conjecture, if true, would indeed imply that there is such an with .In this work, we study proper labellings of graphs with the extra requirement that the sum of assigned labels must be as small as possible. In other words, given a graph , we are looking for a locally irregular multigraph with the smallest number of edges possible that can be obtained from by multiplying edges. This problem is actually quite different from the 1-2-3 Conjecture, as we prove that there is no absolute constant such that can always be obtained from by replacing each edge with at most parallel edges. We investigate several aspects of this problem, covering algorithmic and combinatorial aspects. In particular, we prove that the problem of designing proper labellings with minimum label sum is \np-hard in general, but solvable in polynomial time for graphs with bounded treewidth. We also conjecture that for all almost every graph there should be a proper labelling with label sum at most~, which we verify for several classes of graphs
Concurrence et risque algorithmique : quelle régulation des algorithmes?
No full textCette note s'intéresse à la régulation des algorithmes.En effet, l’utilisation des algorithmes dans de nombreux secteurs d’activité économique modifie le fonctionnement concurrentiel des marchés, à travers ses effets non seulement sur les choix et modes de consommation, mais aussi sur les stratégies et décisions des entreprises. Elle suscite de ce fait des interrogations quant aux atteintes à la concurrence qui pourraient lui être associées. Se pose dès lors la question de la régulation des algorithmes, ces derniers pouvant constituer une menace à l’encontre de la concurrence sur les marchés.Dans un premier temps, la note identifie les principaux effets des algorithmes en matière de collusion et d’abus de position dominante et discute la réalité du risque concurrentiel associé, sachant que l’impact des algorithmes sur la concurrence est encore aujourd’hui mal évalué par l’analyse économique. Dans un second temps, elle propose des pistes de réflexion en vue de la régulation des algorithmes lorsqu’ils sont à l’origine d’un risque concurrentiel important. Deux scénarii sont envisagés, selon le caractère disruptif ou non du risque, conduisant à gérer ce dernier par l’utilisation d’outils déjà existants en droit de la concurrence et de la régulation ou requérant, au contraire, d’innover en matière de régulation
2-Edge Connected Balanced Subgraphs for Correlation Clustering Problem
No full textCommunication oraleInternational audienceA signed graph, whose links are labeled as positive (+) and negative (−), is considered structurally balanced if it can be partitioned into a number of clusters, such that positive (negative) links are located inside (in-between) the clusters. Due to the imbalanced nature of real-world networks, various measures have been defined to quantify the amount of imbalance. Such measures are expressed relatively to a graph partition, so processing the graph balance amounts to identifying the partition corresponding to the lowest imbalance measure. A well-known measure among them corresponds to the definition of the Correlation Clustering (CC) problem, and it consists in counting the numbers of misplaced (w.r.t. structural balance definition) links.One issue of the CC problem is that it is solely based on misplaced links, and it may not always reflect the real situations. One extreme but plausible case is the network instance of two positive groups where they are connected by the same number of positive and negative links, and this produces two possible optimal solutions. To overcome these situations and those being in similar fashion one needs to extend the CC problem by adding additional topological constraints. The topology of the network is an important aspect in graph theory, and it is nearly always present in practical situations (e.g. in social dynamics). Indeed, topology constitutes the base of the problems in social networks (e.g. community detection), since they rely solely on this type of criteria. In this work, we are inspired by the studies ensuring network robustness (e.g. single failure in telecommunication, robustness to the damage by mutation or viral infection in biological networks), and we propose to extend the CC problem with 2 positive edge connectivity requirement at cluster level. Hence, the network topology provides for at least two diverse positive paths between each pair of nodes in the same cluster. In literature, although 2-edge connectivity constraint is well studied (for nonsigned networks), to the best of our knowledge, the only work considering 2-edge connectivity constraint for the CC problem is on planar graphs (i.e. graph that can be drawn on the plane without intersection of its edges), but not for the general case
Apports de deux enquêtes sur les connaissances orthographiques et les pratiques de l’écrit des Rhônalpins
No full textExpérimentation, amélioration et analyse du dispositif numérique FLEURON
No full textPowerpoint présenté lors de la réunion du Comité Opérationnel OLKi (bilan de l'activité de recherche et illustration des ressources en cours de développement, en collaboration avec Virginie André