Français Anglais
Accueil Annuaire Plan du site
Home > Research results > Dissertations & habilitations
Research results
Faculty habilitation de TSANDILAS Theophanis
TSANDILAS Theophanis
Faculty habilitation
Group : Human-Centered Computing

Designing Interactive Tools for Creators and Creative Work

Starts on 08/07/2020
Advisor :

Funding :
Affiliation : vide
Laboratory :

Defended on 08/07/2020, committee :
* Stéphane Conversy, Professor, ENAC - École Nationale de l’Aviation Civile (rapporteur)
* Sharon Oviatt, Professor, Monash University (rapportrice et membre invité)
* Jürgen Steimle, Professor, Saarland University (rapporteur)
* Géry Casiez, Professor, Université de Lille & IUF (examinateur)
* Fanny Chevalier, Ass. Professor, University of Toronto (examinatrice)
* Patrick Bourdot, Research Director, CNRS & Université Paris-Saclay (examinateur)
* Wendy E. Mackay, Research Director, Inria & Université Paris-Saclay (examinatrice, marraine)

Research activities :

Abstract :
Creative work has been at the core of research in Human-Computer Interaction (HCI). I describe the results of a series of studies that look at how creators work, where creators include artists with years of professional practice, as well as learners, or novices and casual makers. My research focuses on three creation activities: drawing, physical modeling, and music composition. For these activities, I examine how artists switch between representations and how these representations evolve throughout their creative process, from early sketches to fine-grained forms or structured vocabularies. I present interactive systems that enrich their workflow (i) by extending their computer tools with physical user interfaces, or (ii) by making physical materials interactive. I also argue that sketch-based representations can allow for user interfaces that are more personal and less rigid. My presentation will reflect on lessons and limitations of this work and discuss challenges for future design-support tools.

Ph.D. dissertations & Faculty habilitations
The Stable Marriage Problem (SMP) is a matching problem where participants have preferences over their potential partners. The objective is to find a matching that is optimal (stable in certain sens) with regard to these preferences. This type of matching has a lot of widely used applications such as the assignment of children to schools, interns to hospitals, kidney transplant patients to donors, as well as taxi scheduling or content delivery on the Internet. Some applications can be solved in a centralized way while others, due to their distributed nature and their complex data, need a different treatment. In order to handle this challenge, we provide two distributed self-stabilizing solutions (i.e., that tolerate transient (or short-lived) failures (e.g., memory or message corruptions) of any nodes. The privacy of the preference lists is guaranteed by the two proposed algorithms: lists are not shared, only some binary queries and responses are transmitted. For both algorithms, executions proceed in atomic steps and a daemon (distributed unfair daemon) conveys the notion of asynchrony. Under this daemon, the stabilization time can be bounded in term of moves (local computations). This complexity metrics allows to evaluate the necessary computational power or the energy consumption of the algorithm's executions. The first algorithm, based on the centralized method of Ackermann et al. (SICOMP' 2011), solves the problem in O(n^4) moves. The starting point of the second algorithm is the local detection/global correction scheme of Awerbuch et al. (DA' 1994) Unfortunately, local checkability definition of DA '1994 does not apply to our case (in particular due to the unfair daemon). Consequently, we propose a new definition. Furthermore, we design a distributed self-stabilizing asynchronous reset algorithm. Using it, the resulting composed algorithm solves SMP in Theta(n^2) moves in a self-stabilizing way.