Résultats de recherche

Une délégation de l’Université de Namur a participé à une mission exploratoire à l’Université Cheikh Anta Diop (UCAD) de Dakar, au Sénégal. L’objectif : découvrir les recherches menées sur le terrain, rencontrer les chercheurs de l’UCAD et initier de futures collaborations entre les deux institutions. 

SynopsisOver recent years, the development of agent-based models has allowed researchers to advance their understanding of naturally occurring collective behaviours. Swarm robotics, a field studying the design of decentralised robot swarms, has emerged following the replication of some collective behaviours in artificial groups of robots. The first part of this thesis provides novel techniques for the aggregation of heterogeneous swarms. First, we enhance an existing controller for an aggregation problem on two sites through the use of informed robots. We show that our simplified approach offers a wider range of operating conditions and a greater flexibility. Second, we provide a new method for the aggregation of robot swarms with adaptive random walks. We separately study cue-based aggregation with a swarm of robots only sensing private information and neighbour-based aggregation with a swarm of robots sensing social information. We show that a trade-off can be obtained with a heterogeneous swarm composed of the two robot types, forming a dense cluster near the minimum of an environmental cue. Private and social information also play a key role in the evolution of biological processes inside animal groups. Dispersal, the movement of an animal from site of birth to site of reproduction, is strongly affected by the acquisition and the use of information. Since experimental research is often difficult to conduct while accounting for multiple information sources and environmental variability, the use of agent-based models offer an opportunity to study the evolution of dispersal and its associated costs linked to private and social information in a controlled setting. The second part of this thesis provides an agent-based model of dispersal including the acquisition of information and its associated costs. Throughout three case studies, we observe the evolution of genes linked to the acquisition of information and the obtained dispersal strategies in different scenarios. Jury members Prof. Wim Vanhoof, Président, Université de Namur, BelgiqueProf. Elio Tuci, Secrétaire, Université de Namur, BelgiqueProf. Timoteo Carletti, Membre interne, Université de Namur, Belgique Prof. Eliseo Ferrante, Membre externe, Vrije Universiteit Amsterdam, Pays-BasProf. Mauro Birattari, Membre externe, ULB, Belgique Prof. Andreagiovanni Reina, Membre externe, Universität Konstanz, Allemagne 

Maxime Lucas est Chargé de recherche FNRS au Département de mathématiques et membre de l’Institut naXys.  Il travaille sur les systèmes complexes au sein du pôle « Dynamique des réseaux » dirigé par le Professeur Timoteo Carletti.  Il est co-auteur de deux articles sur les systèmes complexes, récemment publiés dans des revues prestigieuses : Nature Physics et Physical Reviews Letters. 

Facebook, ça vous parle ? Mais connaissez-vous vraiment ce réseau social ?Pour cette première séance du numérique, (re)découvrez « The Social Network » de David Fincher, un film captivant qui retrace la naissance de ce géant américain.Ce qui vous attend :- Une introduction par nos experts : en vous révélant les secrets du fonctionnement des réseaux sociaux, ils vous donneront des clefs de lecture qui vous permettront de comprendre « The social network » avec un tout nouveau regard ! - Projection du film : plongez dans l’univers de Mark Zuckerberg.- Un moment convivial : prolongez la discussion autour d’un verre après la séance ! Où ? Quai 22, Namur (Rue du séminaire 22, 5000 Namur).Quand ? Le 14 mai à 18h00.Combien ? C’est 100% gratuit !Ne manquez pas cette soirée immersive qui mêle cinéma numérique et échanges passionnants !Inscription obligatoire

Synopsis The spreading of internet-based technologies since the mid-90s has led to a paradigm shift from monolithic centralized information systems to distributed information systems based upon the composition of software components, interacting with each other and of heterogeneous natures. The popularity of these systems is nowadays such that our everyday life is touched by them.Classically concurrent and distributed systems are coded by using the message passing paradigm-according to which components exchange information by sending and receiving messages. In the aim of clearly separating computational and interactional aspects of computations, Gelernter and Carriero have proposed an alternative framework in which components interact through the availability of information placed on a shared space. Their framework has been concretized in a language called Linda. A series of languages, referred to nowadays as coordination languages, have been developed afterwards. In addition to providing a more declarative framework, such languages nicely fit applications like Facebook, LinkedIn and Twitter, in which users share information by adding it or consulting it in a common place. Such systems are in fact particular cases of so-called socio-technical systems in which humans interact with machines and their environments through complex dependencies. As coordination languages nicely meet social networks, the question naturally arises whether they can also nicely code socio-technical systems. However, answering this question first requires to see how well programs written in coordination languages can reflect what they are assumed to model.This thesis aims at addressing these two questions. To that end, we shall use the Bach coordination language developed at the University of Namur as a representative of Linda-like languages. We shall extend it in a language named Multi-Bach to be able to code and reason on socio-technical systems. We will also introduce a workbench Anemone to support the modelling of such systems. Finally, we will evidence the interest of our approach through the coding of several social-technical systems. The Jury Prof. Wim Vanhoof - University of Namur, BelgiumProf. Jean-Marie Jacquet - University of Namur, BelgiumProf. Katrien Beuls - University of Namur, BelgiumProf. Pierre-Yves Schobbens - University of Namur, BelgiumProf. Laura Bocchi - University of Kent, United KingdomProf. Stefano Mariani - UNIMORE University, Italy Participation upon registration. Register here

Pour Bruno Dumas, l’informatique s’inscrit dans les principes de la psychologie appliquée L’intelligence artificielle (IA) s’immisce dans nos vies professionnelles comme dans nos vies privées. Elle nous séduit comme elle nous inquiète. À l’échelle mondiale, elle est au cœur d’importants enjeux stratégiques, sociétaux ou économiques, débattus encore mi-février 2025, lors du sommet mondial de l’IA à Paris. Mais comment ne pas la subir en tant qu’utilisateur ? Comment avoir accès à cette nécessaire transparence de son fonctionnement ? En plaçant son prisme de recherche du côté de l’utilisateur, Bruno Dumas est en quelque sorte « un psychologue de l’informatique ». Expert en interaction humain-machine, co-président de l’Institut NaDI (Namur Digital Institut), il défend l'idée d'une utilisation raisonnée et éclairée des technologies émergentes. 

Passionnée de jeux vidéo depuis toujours, Fanny Barnabé, chercheuse au centre de recherche CRIDS (Namur Digital Institute) et chargée de cours à l’Université de Namur, explore les coulisses d’un phénomène culturel majeur : le streaming de jeux vidéo sur Twitch. Entre humour, ironie et discours toxiques, elle décrypte les enjeux d’un espace numérique en pleine mutation.

Abstract Detecting semantic code clones in logic programs is a longstanding challenge, due to the lack of a unified definition of semantic similarity and the diversity of syntactic expressions that can represent similar behaviours. This thesis introduces a formal and flexible framework for semantic clone detection based on Constrained Horn Clauses (CHC). The approach considers two predicates as semantic clones if they can be independently transformed, via semantics-preserving program transformations, into a common third predicate. At the core of the method lies anti-unification, a process that computes the most specific generalisation of two predicates by identifying their shared structural patterns. The framework is parametric in regard with the allowed program transformations, the notion of generality, and the so-called quality estimators that steer the anti-unification process. Jury Prof. Wim Vanhoof - University of Namur, BelgiumProf. Katrien Beuls - University of Namur, BelgiumProf. Jean-Marie Jacquet - University of Namur, BelgiumProf. Temur Kutsia - Johannes Kepler University, AustriaProf. Frédéric Mesnard - University of the Reunion, Reunion IslandProf. Paul Van Eecke - Free University of Brussels, Belgium