Aline Hufschmitt
Aline Hufschmitt has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Adam Balcerzak
University of Warsaw
3 shared publications - Marcin Łączyński
University of Warsaw
3 shared publications - Tomasz Gackowski
University of Warsaw
3 shared publications - Bruno Ricaud
Innovation and International Directorate (D2I), KNDS France, Versailles, France
1 shared publication Jean-Noël Vittaut
LIP6, CNRS, Sorbonne Université
1 shared publication- Joël Bougron
ENSTA Paris, Institut Polytechnique de Paris
1 shared publication
Latest Publications
- Open Access
- 22 June 2026
- Published by University of Szeged in Acta Cybernetica
- Vol. 27 (3) , 267-292
A Discrete Search and Rescue Problem Under Uncertain Interval Parameters
The Search and Rescue Problem (SARP) can be formulated in an environment subject to both objective uncertainty (randomness inherent to nature) and subjective uncertainty (lack of knowledge about the state of the world). In this paper, we present an interval arithmetic interpretation of the uncertainty problem. A crisis scenario is modeled as an assignment and optimization problem with interval-valued parameters and constraints. These intervals capture uncertainty over the problem data. A branch and bound algorithm is used to explore the solution space. Interval arithmetic is employed to compute bounds and obtain feasible assignments. From the resulting assignments, residual injury intervals are derived to assess the impact of uncertainty on each wounded person. Parallel computing techniques are also investigated to reduce execution times in the solution process.
- 22 June 2026
- Published by University of Szeged in Acta Cybernetica
- Vol. 27 (3) , 267-292
Open AccessA Discrete Search and Rescue Problem Under Uncertain Interval Parameters
The Search and Rescue Problem (SARP) can be formulated in an environment subject to both objective uncertainty (randomness inherent to nature) and subjective uncertainty (lack of knowledge about the state of the world). In this paper, we present an interval arithmetic interpretation of the uncertainty problem. A crisis scenario is modeled as an assignment and optimization problem with interval-valued parameters and constraints. These intervals capture uncertainty over the problem data. A branch and bound algorithm is used to explore the solution space. Interval arithmetic is employed to compute bounds and obtain feasible assignments. From the resulting assignments, residual injury intervals are derived to assess the impact of uncertainty on each wounded person. Parallel computing techniques are also investigated to reduce execution times in the solution process.
- 3 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Décomposition des jeux dans le domaine du General Game Playing.
Dans cette thèse nous présentons une approche générale et robuste pour la décomposition des jeux décrits en Game Description Language (GDL). Dans le domaine du General Game Playing (GGP), les joueurs peuvent significativement diminuer le coût de l'exploration d'un jeu s'ils disposent d'une version décomposée de celui-ci. Les travaux existants sur la décomposition des jeux s'appuient sur la structure syntaxique des règles, sur des habitudes d'écriture du GDL ou sur le coûteux calcul de la forme normale disjonctive des règles. Nous proposons une méthode plus générale pour décomposer les jeux solitaires ou multijoueurs. Dans un premier temps nous envisageons une approche fondée sur l'analyse logique des règles. Celle-ci nécessite l'utilisation d'heuristiques, qui en limitent la robustesse, et le coûteux calcul de la forme normale disjonctive des règles. Une seconde approche plus efficace est fondée sur la collecte d'informations durant des simulations (playouts). Cette dernière permet la détection des liens de causalité entre les actions et les fluents d'un jeu. Elle est capable de traiter les différents types de jeux composés et de prendre en charge certains cas difficiles comme les jeux à actions composées et les jeux en série. Nous avons testé notre approche sur un panel de 597 jeux GGP. Pour 70% des jeux, la décomposition nécessite moins d'une minute en faisant 5k playouts. Nous montrons de 87% d'entre eux peuvent être correctement décomposés après seulement 1k playouts. Nous ébauchons également une approche originale pour jouer avec ces jeux décomposés. Les tests préliminaires sur quelques jeux solitaires sont prometteurs.
- 3 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Décomposition des jeux dans le domaine du General Game Playing.
Dans cette thèse nous présentons une approche générale et robuste pour la décomposition des jeux décrits en Game Description Language (GDL). Dans le domaine du General Game Playing (GGP), les joueurs peuvent significativement diminuer le coût de l'exploration d'un jeu s'ils disposent d'une version décomposée de celui-ci. Les travaux existants sur la décomposition des jeux s'appuient sur la structure syntaxique des règles, sur des habitudes d'écriture du GDL ou sur le coûteux calcul de la forme normale disjonctive des règles. Nous proposons une méthode plus générale pour décomposer les jeux solitaires ou multijoueurs. Dans un premier temps nous envisageons une approche fondée sur l'analyse logique des règles. Celle-ci nécessite l'utilisation d'heuristiques, qui en limitent la robustesse, et le coûteux calcul de la forme normale disjonctive des règles. Une seconde approche plus efficace est fondée sur la collecte d'informations durant des simulations (playouts). Cette dernière permet la détection des liens de causalité entre les actions et les fluents d'un jeu. Elle est capable de traiter les différents types de jeux composés et de prendre en charge certains cas difficiles comme les jeux à actions composées et les jeux en série. Nous avons testé notre approche sur un panel de 597 jeux GGP. Pour 70% des jeux, la décomposition nécessite moins d'une minute en faisant 5k playouts. Nous montrons de 87% d'entre eux peuvent être correctement décomposés après seulement 1k playouts. Nous ébauchons également une approche originale pour jouer avec ces jeux décomposés. Les tests préliminaires sur quelques jeux solitaires sont prometteurs.
- 5 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
From Code to Cognition: Implementing a Puzzle-Based Game Framework for Biometric Analysis
This paper presents a puzzle-based escape game developed in Unreal Engine 5 as a platform for studying cognitive load, emotional responses, and attentional focus during problem-solving. The experiment integrated gameplay telemetry with eye-tracking, GSR and webcam-based facial expression analysis, synchronized through iMotions. This multimodal approach enabled precise alignment of biometric signals with in-game events. Results show that time pressure and discrete stressors increased negative emotional intensity, while emotions such as joy and surprise were associated with greater task focus. The framework offers a replicable method for game-based cognitive and affective research.
- 5 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
From Code to Cognition: Implementing a Puzzle-Based Game Framework for Biometric Analysis
This paper presents a puzzle-based escape game developed in Unreal Engine 5 as a platform for studying cognitive load, emotional responses, and attentional focus during problem-solving. The experiment integrated gameplay telemetry with eye-tracking, GSR and webcam-based facial expression analysis, synchronized through iMotions. This multimodal approach enabled precise alignment of biometric signals with in-game events. Results show that time pressure and discrete stressors increased negative emotional intensity, while emotions such as joy and surprise were associated with greater task focus. The framework offers a replicable method for game-based cognitive and affective research.
- 15 August 2024
- Published by Springer Nature
- p. 144-156
Real-Time Gameplay Data and Biometric Measurement Integration as a Data Source for Game User Research
- 15 August 2024
- Published by Springer Nature
- p. 144-156
Real-Time Gameplay Data and Biometric Measurement Integration as a Data Source for Game User Research
- Open Access
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1264-1272
Genetic Meta Cipher
We present a concrete application of genetic algorithm in the field of cryptography. More precisely, we provide a new and original cryptographic symmetric encryption scheme called Genetic Meta Cipher (GMC) using the non-dominated sorting-based multiobjective genetic algorithm, NSGA-II. The originality of GMC is that it is a keyless encryption meta-program i.e. a program capable of producing encryption algorithms from modular operations (bitwise primitives) with configurable options. Compared with the randomness test methods for binary sequence of the Standardization Administration of China (SAC), the ciphering result obtained with the encryption algorithms generated by GMC is equivalent in terms of randomness to that obtained with AES protocol (using a random set of keys). Another feature of GMC is that, instead of renewing a single encryption key as with known symmetric algorithms, an entire encryption algorithm is renewed, making its cryptanalysis more complex. GMC therefore appears to be an effective and promising cryptographic response to privacy and security issues, with a new way of thinking about encryption and a wider use of genetic algorithms in cryptography.
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1264-1272
Open AccessGenetic Meta Cipher
We present a concrete application of genetic algorithm in the field of cryptography. More precisely, we provide a new and original cryptographic symmetric encryption scheme called Genetic Meta Cipher (GMC) using the non-dominated sorting-based multiobjective genetic algorithm, NSGA-II. The originality of GMC is that it is a keyless encryption meta-program i.e. a program capable of producing encryption algorithms from modular operations (bitwise primitives) with configurable options. Compared with the randomness test methods for binary sequence of the Standardization Administration of China (SAC), the ciphering result obtained with the encryption algorithms generated by GMC is equivalent in terms of randomness to that obtained with AES protocol (using a random set of keys). Another feature of GMC is that, instead of renewing a single encryption key as with known symmetric algorithms, an entire encryption algorithm is renewed, making its cryptanalysis more complex. GMC therefore appears to be an effective and promising cryptographic response to privacy and security issues, with a new way of thinking about encryption and a wider use of genetic algorithms in cryptography.
- 20 December 2020
- Published by Springer Nature
- p. 106-118
Exploiting Game Decompositions in Monte Carlo Tree Search
- 20 December 2020
- Published by Springer Nature
- p. 106-118
Exploiting Game Decompositions in Monte Carlo Tree Search