output
20132025
most citedTowards an Extension of the 2-tuple Linguistic Model to Deal With Unbalanced Linguistic Term sets

26 citations

7 papers

cs.RO2025

What Can Robots Teach Us About Trust and Reliance? An interdisciplinary dialogue between Social Sciences and Social Robotics

Julien Wacquez, Elisabetta Zibetti, Joffrey Becker +5

As robots find their way into more and more aspects of everyday life, questions around trust are becoming increasingly important. What does it mean to trust a robot? And how should…

cs.AI2025

Intra-neuronal attention within language models Relationships between activation and semantics

Michael Pichat, William Pogrund, Paloma Pichat +4

This study investigates the ability of perceptron-type neurons in language models to perform intra-neuronal attention; that is, to identify different homogeneous categorical segmen…

cs.CY2023★ 5 cited

The mentor-child paradigm for individuals with autism spectrum disorders

Marion Dubois-Sage, Baptiste Jacquet, Frank Jamet +1

Our aim is to analyze the relevance of the mentor-child paradigm with a robot for individuals with Autism Spectrum Disorders, and the adaptations required. This method could allow…

cs.HC2023★ 1 cited

PRIM project: what contributions for disabilities?

Céline Jost, Justin Debloos, Agnès Piquard-Kipffer +2

In the PRIM project, we aim at giving people the power to create scenagrams (interaction scenarios between a human and digital devices) without the need to learn programming or to…

cs.DC2017★ 20 cited

Performance Evaluation of Distributed Computing Environments with Hadoop and Spark Frameworks

Vladyslav Taran, Oleg Alienin, Sergii Stirenko +2

Recently, due to rapid development of information and communication technologies, the data are created and consumed in the avalanche way. Distributed computing create preconditions…

cs.CC2014★ 3 cited

Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method

Nicolas Gauvrit, Henrik Singmann, Fernando Soler-Toscano +1

Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed \emph…