Search

Your search keyword '"Université de Lille, Sciences Humaines et Sociales"' showing total 41 results
Start Over Author "Université de Lille, Sciences Humaines et Sociales" Publisher acm
41 results on '"Université de Lille, Sciences Humaines et Sociales"'

1. Global vs Local Search on Multi-objective NK-Landscapes

Author

Kiyoshi Tanaka, Arnaud Liefooghe, Sébastien Verel, Fabio Daolio, Hernán Aguirre, Faculty of Engineering [Nagano], Shinshu University [Nagano], Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Parallel Cooperative Multi-criteria Optimization (DOLPHIN), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique Signal et Image de la Côte d'Opale (LISIC), Université du Littoral Côte d'Opale (ULCO), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Mathematical optimization, 021103 operations research, Heuristic (computer science), business.industry, Fitness landscape, Association (object-oriented programming), 0211 other engineering and technologies, 02 engineering and technology, Variation (game tree), GeneralLiterature_MISCELLANEOUS, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Operator (computer programming), 0202 electrical engineering, electronic engineering, information engineering, Benchmark (computing), Combinatorial search, 020201 artificial intelligence & image processing, Local search (optimization), business, ComputingMilieux_MISCELLANEOUS, Mathematics
Abstract

Computationally hard multi-objective combinatorial optimization problems are common in practice, and numerous evolutionary multi-objective optimization (EMO) algorithms have been proposed to tackle them. Our aim is to understand which (and how) problem features impact the search performance of such approaches. In this paper, we consider two prototypical dominance-based algorithms: a global EMO strategy using an ergodic variation operator (GSEMO) and a neighborhood-based local search heuristic (PLS). Their respective runtime is estimated on a benchmark of combinatorial problems with tunable ruggedness, objective space dimension, and objective correlation ($\rho$MNK-landscapes). In other words, benchmark parameters define classes of instances with increasing empirical problem hardness; we enumerate and characterize the search space of small instances. Our study departs from simple performance comparison to systematically analyze the correlations between runtime and problem features, contrasting their association with search performance within and across instance classes, for both chosen algorithms. A mixed-model approach then allows us to further generalize from the experimental design, supporting a sound assessment of the joint impact of instance features on EMO search performance.

Published
2015

2. A Model-based Approach for Engineering Multimodal Mobile Interactions

Author

José Rouillard, Xavier Le Pallec, Jean-Claude Tarby, Nadia Elouali, Tarby, Jean-Claude, Nouveaux Outils pour La Coopération et l'Education (NOCE), Laboratoire d'Informatique Fondamentale de Lille (LIFL), and Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)

Subjects
Computer science, Modeling language, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces/H.5.2.16: User interface management systems (UIMS), [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], Context (language use), [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Accelerometer, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces/H.5.2.7: Interaction styles (e.g., commands, menus, forms, direct manipulation), ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces/H.5.2.4: Graphical user interfaces (GUI), [INFO.INFO-MC]Computer Science [cs]/Mobile Computing, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces/H.5.2.6: Input devices and strategies (e.g., mouse, touchscreen), [INFO.INFO-MC] Computer Science [cs]/Mobile Computing, Human–computer interaction, Multimodal Mobile Application, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Modelbased Approach, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces/H.5.2.9: Prototyping, Modalities, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces/H.5.2.10: Screen design (e.g., text, graphics, color), business.industry, Software development, Sensor-based Interactions, Modeling Language, Artificial intelligence, [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], Mobile interfaces, business
Abstract

International audience; Mobile phones have benefited from many enhancements since several years, including an increasing number of their embedded sensors (accelerometer, light sensor...). Created for giving contextaware abilities, these sensors also allow new types of interaction and pave the way to a great expansion of multimodal mobile interactions. Unfortunately, the current context of mobile software development makes difficult the development of multimodal applications. We propose our model-based solution that aims to facilitate the development of multimodal mobile interfaces. We adopt the principles of the Model-Driven Engineering (MDE) which is particularly fitted for such context. Our proposition includes M4L modeling language, library of high-level sensor-based modalities and MIMIC framework. Our approach respects the main criteria of the MDE in order to define an efficient model-based approach. Results of the first evaluation suggest that using our approach facilitates the development of sensor-based multimodal mobile interfaces.

Published
2014

3. Test case purification for improving fault localization

Author

Martin Monperrus, Jifeng Xuan, Self-adaptation for distributed services and large software systems (SPIRALS), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), and Université de Lille

Subjects
FOS: Computer and information sciences, test case atomization, Source code, Java, Computer science, business.industry, media_common.quotation_subject, Software development, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], dynamic program slicing, Fault (power engineering), computer.software_genre, Test (assessment), Software Engineering (cs.SE), Computer Science - Software Engineering, Test case, spectrum-based fault localization, Data mining, business, computer, Test case purification, computer.programming_language, media_common, TRACE (psycholinguistics)
Abstract

International audience; Finding and fixing bugs are time-consuming activities in software development. Spectrum-based fault localization aims to identify the faulty position in source code based on the execution trace of test cases. Failing test cases and their assertions form test oracles for the failing behavior of the system under analysis. In this paper, we propose a novel concept of spectrum driven test case purification for improving fault localization. The goal of test case purification is to separate existing test cases into small fractions (called purified test cases) and to enhance the test oracles to further localize faults. Combining with an original fault localization technique (e.g., Tarantula), test case purification results in better ranking the program statements. Our experiments on 1800 faults in six open-source Java programs show that test case purification can effectively improve existing fault localization techniques.

Published
2014

4. CtrlMouse et TouchCtrl : Dupliquer les Délimiteurs de Mode sur la Souris

Author

Gilles Bailly, Thomas Pietrzak, Sylvain Malacria, Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Université de Lille, Sciences et Technologies, Methods and tools for gestural interactions (MINT), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), University College of London [London] (UCL), Télécom ParisTech, Méthodes et outils pour l'Interaction à gestes (MINT2), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), and Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)

Subjects
Computer science, business.industry, Keyboard shortcut, Task (computing), Mode (computer interface), Human–computer interaction, keyboard shortcut, Delimiter, [INFO.INFO-DL]Computer Science [cs]/Digital Libraries [cs.DL], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Text entry, Artificial intelligence, mode delimiter, business, interaction techniques, mouse, Selection (genetic algorithm)
Abstract

National audience; Modifier keys of the keyboard such as Ctrl or Cmd are used to delimit text entry and command selection (keyboard shortcuts). In this paper we study the impact of the position of these modifier keys on performance and muscular load by duplicating them on the mouse. We derive two interaction techniques: CtrlMouse duplicates the Ctrl and Shift keys by associating them to the mouse buttons under the thumb; TouchCtrl automatically triggers the Ctrl key when the hand lays on the mouse. Two laboratory experiments reveal that 1) as the task requires more pointing, participants use more these techniques, 2) the temporal cost of the use of modifier keys on command selection is 0.21s, which represents 11.9% of pointing time, and 3) selection time with CtrlMouse with one or two modifiers is similar. We also deployed these techniques to ecologically validate the results we obtained in the laboratory. Finally we present several application scenarios based on CtrlMouse and TouchCtrl.; Les touches modifieur du clavier comme Ctrl ou Cmd sont utilisées pour délimiter l'entrée de texte de la sélection de commandes (raccourcis claviers). \ \ Dans cet article nous étudions l'impact de la localisation de ces délimiteurs sur la performance et la charge musculaire en les dupliquant sur la souris. À cet effet, nous dérivons deux techniques d'interaction : CtrlMouse duplique les touches Ctrl et Shift en les associant aux boutons de la souris sous le pouce; TouchCtrl déclenche automatiquement la touche Ctrl lorsque la main est posée sur la souris. Deux expériences en laboratoire révèlent 1) que ces techniques sont d'autant plus adoptées par les utilisateurs que la tâche demande du pointage, 2) le coût temporel des modifieurs sur la sélection de commandes est de 0,21s, ce qui correspond à 11,9% du temps de pointage et 3) le temps de sélection avec CtrlMouse avec un ou deux modifieurs est similaire. Nous avons également déployé ces techniques pour valider de manière écologique les résultats obtenus lors des évaluations en laboratoire. Enfin, nous présentons différents scénarios applicatifs élaborés à partir de CtrlMouse et TouchCtrl.

Published
2014

5. Adoiraccourcix : Sélection de Commandes sur Écrans Tactiles Multi-Points par Identification des Doigts

Author

Daniel Vogel, Thomas Pietrzak, Géry Casiez, Nicolas Roussel, Alix Goguey, Methods and tools for gestural interactions (MINT), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Université de Lille, Sciences et Technologies, David R. Cheriton School of Computer Science, University of Waterloo [Waterloo], Méthodes et outils pour l'Interaction à gestes (MINT2), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), and Université de Lille

Subjects
Computer science, business.industry, Multi-touch, User studies, Human–computer interaction, finger identification, [INFO.INFO-DL]Computer Science [cs]/Digital Libraries [cs.DL], Leverage (statistics), [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Artificial intelligence, direct manipulation, User interface, business, shortcuts, command selection
Abstract

National audience; Hotkeys are a critical factor of performance for expert users in WIMP interfaces. Multi-touch interfaces, by contrast, do not provide such efficient command shortcuts. We propose Adoiraccourcix, which leverage finger identification to introduce quick command invocation integrated with direct manipulation in this context. After presenting the concept behind, we illustrated Adoiraccourcix in a vectorial drawing application and ran preliminary user studies comparing Adoiraccourcix to classical user interfaces. Results suggest that once mastered, Adoiraccourcix provides very powerful means of interaction.; Alors que les raccourcis clavier permettent aux utilisa- teurs experts des interfaces WIMP d’exécuter rapidement des commandes, il existe aujourd’hui peu d'équivalents pour grands écrans tactiles multi-points. Afin de remédier à ce problème, nous avons conçu Adoiraccourcix, une technique d’interaction tirant parti de l’identification des doigts sur tables interactives, pour la sélection rapide de commandes associée au contrôle continu de paramètres de celles-ci. Après avoir présenté la logique de conception, nous illustrons Adoiraccourcix au travers d’une application de dessin vectoriel. Nous terminons par la présentation d’études préliminaires dans lesquelles nous comparons une mise en oeuvre d’Adoiraccourcix à une interface classique. Les premiers résultats suggèrent qu’une fois maîtrisé, Adoiraccourcix permet d’interagir plus efficacement que les interfaces classiques.

Published
2014

6. Do the fix ingredients already exist? an empirical inquiry into the redundancy assumptions of program repair approaches

Author

Martin Monperrus, Westley Weimer, Matias Martinez, Self-adaptation for distributed services and large software systems (SPIRALS), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), University of Virginia, and Université de Lille, Sciences et Technologies

Subjects
FOS: Computer and information sciences, Copying, Computer science, Programming language, 020207 software engineering, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 02 engineering and technology, Commit, computer.software_genre, Automatic program fixing, Software Engineering (cs.SE), automatic software repair, Computer Science - Software Engineering, 0202 electrical engineering, electronic engineering, information engineering, Redundancy (engineering), Empirical inquiry, 020201 artificial intelligence & image processing, computer, mining software repositories
Abstract

Much initial research on automatic program repair has focused on experimental results to probe their potential to find patches and reduce development effort. Relatively less effort has been put into understanding the hows and whys of such approaches. For example, a critical assumption of the GenProg technique is that certain bugs can be fixed by copying and re-arranging existing code. In other words, GenProg assumes that the fix ingredients already exist elsewhere in the code. In this paper, we formalize these assumptions around the concept of ''temporal redundancy''. A temporally redundant commit is only composed of what has already existed in previous commits. Our experiments show that a large proportion of commits that add existing code are temporally redundant. This validates the fundamental redundancy assumption of GenProg., Comment: ICSE - 36th IEEE International Conference on Software Engineering (2014)

Published
2014

7. Unit testing of energy consumption of software libraries

Author

Adel Noureddine, Romain Rouvoy, Lionel Seinturier, Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Self-adaptation for distributed services and large software systems (SPIRALS), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Institut Universitaire de France (IUF), and Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.)

Subjects
Consumption (economics), Unit testing, business.industry, Computer science, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.8: Metrics/D.2.8.0: Complexity measures, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Energy consumption, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.8: Metrics, computer.software_genre, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Software metric, Software framework, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], Software, Software deployment, Software construction, Operating system, Software engineering, business, computer, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.8: Metrics/D.2.8.1: Performance measures
Abstract

International audience; The development of energy-efficient software has become a key requirement for a large number of devices, from smartphones to data centers. However, measuring accurately this consumption is a major challenge that state-of-the-art approaches have tried to tackle with a limited success. While monitoring applications' consumption offers a clear insight on where the energy is being spent, it does not help in understanding how the energy is consumed. In this paper, we therefore introduce Jalen Unit, a software framework that infers the energy consumption model of software libraries from execution traces. This model can then be used to diagnose application code for detecting energy bugs, understanding energy distribution, establishing energy profiles and classifications, and comparing software libraries against their energy consumption.

Published
2014

8. A heuristic to minimize the cardinality of a real-time task set by automated task clustering

Author

Julien Forget, Antoine Bertout, Richard Olejnik, Contributions of the Data parallelism to real time (DART), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), LIFL - DART/Émeraude, Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), and Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)

Subjects
Earliest deadline first scheduling, Theoretical computer science, Computer science, Heuristic, real-time, Parallel computing, ACM: D.: Software/D.4: OPERATING SYSTEMS/D.4.7: Organization and Design/D.4.7.4: Real-time systems and embedded systems, Scheduling (computing), task clustering, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, scheduling, Cluster analysis, Computer Science::Operating Systems, functionality to task mapping
Abstract

International audience; We propose in this paper a method to automatically map functionalities (blocks of code corresponding to high-level features) with real-time constraints to tasks (or threads). We aim at reducing the number of tasks functions are mapped to, while preserving the schedulability of the initial system. We consider independent tasks running on a single processor. Our approach has been applied with fixed-task or fixed-job priorities assigned in a Deadline Monotonic (DM) or a Earliest Deadline First (EDF) manner.

Published
2014

9. Work Stealing Strategies For Multi-Core Parallel Branch-and-Bound Algorithm Using Factorial Number System

Author

Nouredine Melab, Daniel Tuyttens, Mohand Mezmaz, Rudi Leroy, Parallel Cooperative Multi-criteria Optimization (DOLPHIN), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Institut de Mathématiques [Mons], and Université de Mons (UMons)

Subjects
020203 distributed computing, Multi-core processor, Branch and bound, Permutation, Computer science, Factorial number system, trees, 02 engineering and technology, Interval (mathematics), Parallel computing, Concurrent programming, Numbering, Graph theory, Work stealing, Combinatorial algorithms, 0202 electrical engineering, electronic engineering, information engineering, Concurrent computing, Combinatorial optimization, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Arithmetic, Mixed radix, Mathematics
Abstract

International audience; Many real-world problems in different industrial and economic fields are permutation combinatorial optimization problems. Solving to optimality large instances of these problems, such as the flowshop problem, is a challenge for multi-core computing. This paper proposes four work stealing strategies for the multi-threaded factoradic-based branch-and-bound (B\&B) algorithm to solve permutation combinatorial problems on multi-core processors. The factoradic, called also factorial number system, is a mixed radix numeral system adapted to numbering permutations. In our new parallel strategies, the B\&B is based on a matrix of integers instead of a pool of permutations, and work units exchanged between threads are intervals of factoradics instead of sets of nodes. The experiments show that the strategy based on selecting the largest interval is better than the three other strategies in terms of the number of interval sharing events. Furthermore, the worst factoradic-based strategy spends on average $7.2$ times less time managing the pool of subproblems than a conventional pool-based parallel B\&B algorithm.

Published
2014

10. On the customization of model management systems for file-centric IDEs

Author

David Méndez-Acuña, Anne Etien, Rubby Casallas, Construcción de Software - Facultad de Ingéniería [Bogotá], Universidad de los Andes [Bogota] (UNIANDES), Software Construction Group, Universidad de los Andes [Bogota] (UNIANDES)-Universidad de los Andes [Bogota] (UNIANDES), Analyses and Languages Constructs for Object-Oriented Application Evolution (RMOD), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Université de Lille, Sciences et Technologies-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Université de Lille, Sciences et Technologies-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), and Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe

Subjects
File system, Programming language, Computer science, business.industry, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Workspace, Model-driven software development, computer.software_genre, Extensibility, Personalization, Model management, Software engineering, business, computer, Eclipse
Abstract

International audience; Model-based solutions are becoming more sophisticated because of the advent of new types of models, languages, and editors. To deal with this complexity, some of the current Integrated Development Environments (IDEs) offer Model Management Systems (MMSs) that provide functionalities to visualize, navigate, and search the modeling artifacts existing in a workspace. Each MMS defines the types of modeling artifacts that it supports and, commonly, furnish extensibility mechanisms for including new ones. However, the use of those mechanisms usually requires a big implementation effort. As a result, when an MMS does not support all the types of modeling artifacts that a model-driven engineer uses, he/she discards it and ends up manipulating his/her solution through file system views which is not appropriate when projects become larger. In this paper we present some of our preliminary results towards the construction of MoMS-DL, a domain-specific language to define (and automatically generate) customized Eclipse-based MMSs improv- ing the daily work of model-driven engineers.

Published
2013

11. On the integration of differential fractions

Author

Georg Regensburger, Markus Rosenkranz, François Boulier, François Lemaire, Boulier, François, Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Calcul Formel (CALFOR), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Austrian Academy of Sciences (OeAW), and University of Kent [Canterbury]

Subjects
[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Examples of differential equations, Stochastic partial differential equation, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, Mathematical analysis, First-order partial differential equation, Differential algebraic geometry, Differential algebraic equation, Mathematics, Integrating factor, Numerical partial differential equations, Algebraic differential equation
Abstract

International audience; In this paper, we provide a differential algebra algorithm for integrating fractions of differential polynomials. It is not restricted to differential fractions that are the derivatives of other differential fractions. The algorithm leads to new techniques for representing differential fractions, which may help converting differential equations to integral equations (as for example used in parameter estimation).

Published
2013

12. Components mobility for energy efficiency of digital home

Author

Rémi Druilhe, Lionel Seinturier, Jacques Pulou, Matthieu Anne, Laurence Duchien, Adaptive Distributed Applications and Middleware (ADAM), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Orange Labs [Meylan], Orange Labs, Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Université de Lille, Sciences et Technologies, Institut Universitaire de France (IUF), and Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.)

Subjects
[INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR], ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.11: Software Architectures, Engineering, Energy Efficiency, Deployment Constraints, business.industry, 020207 software engineering, 02 engineering and technology, Energy consumption, 7. Clean energy, Components Mobility, Power (physics), Digital Home, Software deployment, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization, Embedded system, Component (UML), Limit (music), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, State (computer science), Software architecture, business, Efficient energy use
Abstract

International audience; The number of connected devices in the home is growing dramatically, increasing the part of the Digital Home in the electric power demand. Reducing the overall energy consumption of the Digital Home becomes a concern in everyday life. Moving applications to the smaller set of devices enables to increase the number of devices that can be put into low power state, and thus reduce energy consumption. However, the applications deployment constraints and the Digital Home heterogeneity limit the choice in deployment solutions onto available devices. We propose to consider distributed component-based applications to overcome this limitation. The distribution of applications constraints over its components improves their mobility, i.e., the number of devices on which a component can be deployed. This approach is optimized to reduce the set of processed solutions. Moreover, the proposed architecture reacts continuously to relevant modifications in the Digital Home software architecture (connection and disconnection of devices, start and stop of applications) to always meet energy efficiency. The architecture is also designed to limit its own energy consumption impact. The feasibility of the approach is assessed with Digital Home applications and migration policies between devices.

Published
2013

13. A causal model to predict the effect of business process evolution on quality of service

Author

Laurence Duchien, Sébastien Mosser, Alexandre Feugas, Adaptive Distributed Applications and Middleware (ADAM), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Université de Lille, Sciences et Technologies, Laboratoire d'Informatique, Signaux, et Systèmes de Sophia-Antipolis (I3S) / Equipe MODALIS, Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Université Nice Sophia Antipolis (... - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS)

Subjects
Service (business), Engineering, Evolution, Business process, business.industry, Quality of service, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.5: Testing and Debugging/D.2.5.6: Monitors, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.4: Software/Program Verification, Quality of Service, Response time, 020207 software engineering, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 02 engineering and technology, Risk analysis (engineering), Order (exchange), ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.9: Management/D.2.9.2: Life cycle, 020204 information systems, Business Process, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), Systems engineering, Overhead (computing), business, Causal Model, Causal model
Abstract

International audience; Managing Quality of Service (QoS) of Service-based systems is a key challenge to produce systems that fulfill their requirements. Verifying the respect of a QoS contract in a system becomes more and more difficult as systems are more and more complex. Moreover, systems have to evolve in order to fulfil constantly changing requirements. As QoS properties are influenced by hidden factors such as connection rate or the system execution itself, determining the cause of a performance degradation is not mainstream. We propose in this paper to identify the causal relations to make explicit the hidden factors of influence. We more specifically focus on the consequences of system evolution with respect to QoS properties: using causal relations, we aim at predicting the possible overhead caused by an evolution. This paper shows through an example of Business Process how our evolution analysis helps to understand the effect of evolution on QoS property such as the Response Time. We show its efficiency by comparing the prediction with measured values.

Published
2013

14. Towards multi-cloud configurations using feature models and ontologies

Author

Nicolas Haderer, Romain Rouvoy, Clément Quinton, Laurence Duchien, Adaptive Distributed Applications and Middleware (ADAM), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), and Université de Lille, Sciences et Technologies

Subjects
Database, Computer science, business.industry, Distributed computing, 020207 software engineering, Cloud computing, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 02 engineering and technology, Ontology (information science), computer.software_genre, Semantics, Feature model, Personalization, Software, Cloud testing, Scalability, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, business, computer, Astrophysics::Galaxy Astrophysics
Abstract

International audience; Configuration and customization choices arise due to the heterogeneous and scalable aspect of the cloud computing paradigm. To avoid being restricted to a given cloud and ensure application requirements, using several clouds to deploy a multi-cloud configuration is recommended but introduces several challenges due to the amount of providers and their intrinsic variability. In this paper, we present a model-driven approach based on Feature Models originating from Software Product Lines to handle cloud variability and then manage and create cloud configurations. We combine it with ontologies, used to model the various semantics of cloud systems. The approach takes into consideration application technical requirements as well as non-functional ones to provide a set of valid cloud or multi-cloud configurations and is implemented in a framework named Saloon.

Published
2013

15. End-to-end latency computation in a multi-periodic design

Author

Rémy Wyss, Frédéric Boniol, Claire Pagetti, Julien Forget, ONERA - The French Aerospace Lab [Toulouse], ONERA, Ecole Nationale Supérieure d'Electrotechnique, d'Electronique, d'Informatique, d'Hydraulique et de Télécommunications (ENSEEIHT), Institut National Polytechnique (Toulouse) (Toulouse INP), Université de Toulouse (UT)-Université de Toulouse (UT), Contributions of the Data parallelism to real time (DART), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), LIFL - DART/Émeraude, Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), and Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées

Subjects
Computer engineering, Computer science, End to end latency, Computation, Semantics of logic, 020208 electrical & electronic engineering, Real-time computing, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, 02 engineering and technology, 020202 computer hardware & architecture
Abstract

International audience; The specification of a critical real-time application often includes quantitative temporal properties, imposed by the designer, that need to be respected by the implementation. In this paper we focus on end-to-end latency constraints, i.e. the amount of time required before an input is taken into account by the corresponding output. Such applications usually consist of a set of periodic communicating tasks. In this paper, we describe an application using the language Prelude, dedicated to the specification of multi-periodic systems, and show that end-to-end latencies can be computed automatically based on the formal semantics of the language.

Published
2013

16. Méthodologie de conception de textures pour les interfaces tactiles à frottement programmable

Author

Nicolas Roussel, Géry Casiez, Thomas Pietrzak, Ludovic Potier, Methods and tools for gestural interactions (MINT), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-IRCICA, Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Université de Lille, Sciences et Technologies, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Engineering, Engineering drawing, haptique, business.industry, media_common.quotation_subject, 05 social sciences, perception, variable roughness, 050105 experimental psychology, Evaluation/methodology, 03 medical and health sciences, Variable (computer science), frottement programmable, 0302 clinical medicine, Signal perception, Perception, Tactile, 0501 psychology and cognitive sciences, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], business, Design methods, 030217 neurology & neurosurgery, ComputingMethodologies_COMPUTERGRAPHICS, media_common
Abstract

National audience; The design of textures for so-called variable friction technologies requires multiple perspectives, which this paper aims to outline and discuss. We first propose a definition of texture and describe the current state of knowledge on their perception. After presenting two technologies for variable friction and comparing them to other tactile interfaces, we describe several particular uses for these devices. We then discuss psychophysical methods for signal perception evaluation and finally discuss methodologies for creating multidimensional tactile content.

Published
2012

17. On neighborhood tree search

Author

Bilel Derbel, Houda Derbel, FSEGS, Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Parallel Cooperative Multi-criteria Optimization (DOLPHIN), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
FOS: Computer and information sciences, Mathematical optimization, 021103 operations research, Heuristic (computer science), Backtracking, business.industry, Other Computer Science (cs.OH), Tardiness, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 0211 other engineering and technologies, 02 engineering and technology, Tree (data structure), Computer Science - Other Computer Science, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Local search (optimization), Pruning (decision trees), Heuristics, business, Metaheuristic, Mathematics
Abstract

We consider the neighborhood tree induced by alternating the use of different neighborhood structures within a local search descent. We investigate the issue of designing a search strategy operating at the neighborhood tree level by exploring different paths of the tree in a heuristic way. We show that allowing the search to 'backtrack' to a previously visited solution and resuming the iterative variable neighborhood descent by 'pruning' the already explored neighborhood branches leads to the design of effective and efficient search heuristics. We describe this idea by discussing its basic design components within a generic algorithmic scheme and we propose some simple and intuitive strategies to guide the search when traversing the neighborhood tree. We conduct a thorough experimental analysis of this approach by considering two different problem domains, namely, the Total Weighted Tardiness Problem (SMTWTP), and the more sophisticated Location Routing Problem (LRP). We show that independently of the considered domain, the approach is highly competitive. In particular, we show that using different branching and backtracking strategies when exploring the neighborhood tree allows us to achieve different trade-offs in terms of solution quality and computing cost., Comment: Genetic and Evolutionary Computation Conference (GECCO'12) (2012)

Published
2012

18. On the effect of mirroring in the IPOP active CMA-ES on the noiseless BBOB testbed

Author

Nikolaus Hansen, Dimo Brockhoff, Anne Auger, Parallel Cooperative Multi-criteria Optimization (DOLPHIN), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Machine Learning and Optimisation (TAO), Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Paris-Sud - Paris 11 (UP11)-Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec, Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique Fondamentale de Lille (LIFL), and Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)

Subjects
Mathematical optimization, Testbed, 0102 computer and information sciences, 02 engineering and technology, Function (mathematics), [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], 01 natural sciences, 010201 computation theory & mathematics, Margin (machine learning), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, CMA-ES, Evolution strategy, Mirroring, Mathematics
Abstract

International audience; Mirrored mutations and active covariance matrix adaptation are two recent ideas to improve the well-known covariance matrix adaptation evolution strategy (CMA-ES)---a state-of-the-art algorithm for numerical optimization. It turns out that both mechanisms can be implemented simultaneously. In this paper, we investigate the impact of mirrored mutations on the so-called IPOP active CMA-ES. We find that additional mirrored mutations improve the IPOP active CMA-ES statistically significantly, but by only a small margin, on several functions while never a statistically significant performance decline can be observed. Furthermore, experiments on different function instances with some algorithm parameters and stopping criteria changed reveal essentially the same results.

Published
2012

19. Dexpler

Author

Yves Le Traon, Martin Monperrus, Jacques Klein, Alexandre Bartel, Interdisciplinary Centre for Security, Reliability and Trust [Luxembourg] (SnT), Université du Luxembourg (Uni.lu), Adaptive Distributed Applications and Middleware (ADAM), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), and This research is supported by the National Research Fund, Luxembourg.

Subjects
FOS: Computer and information sciences, Computer science, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], code generation, 02 engineering and technology, computer.software_genre, medicine.disease_cause, Computer Science - Software Engineering, Soot, Android, 0202 electrical engineering, electronic engineering, information engineering, medicine, bytecode, Android (operating system), Jimple, Computer science [C05] [Engineering, computing & technology], Dalvik Bytecode, Programming language, Static Analysis, 020207 software engineering, Static analysis, Sciences informatiques [C05] [Ingénierie, informatique & technologie], Software Engineering (cs.SE), Bytecode, Dalvik, 020201 artificial intelligence & image processing, computer
Abstract

This paper introduces Dexpler, a software package which converts Dalvik bytecode to Jimple. Dexpler is built on top of Dedexer and Soot. As Jimple is Soot's main internal rep- resentation of code, the Dalvik bytecode can be manipu- lated with any Jimple based tool, for instance for performing point-to or flow analysis., Comment: ACM SIGPLAN International Workshop on the State Of the Art in Java Program Analysis(SOAP 2012), Beijing : China (2012)

Published
2012

20. CLASSY

Author

Abdoulaye Gamatié, Xin An, Eric Rutten, Sarra Boumedien, System architecture for reflective distributed computing environments (SARDES), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF), Contributions of the Data parallelism to real time (DART), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), INRIA, and Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Rapid prototyping, analysis, Computer science, Multiprocessing, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 02 engineering and technology, synchronous approach, 01 natural sciences, Scheduling (computing), Embedded applications, Adaptive system, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, 010302 applied physics, business.industry, embedded applications, abstract clocks, simulation, 020202 computer hardware & architecture, simulation and analysis, MPSoCs, Embedded system, MPSoC design, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, business, Mpsoc design
Abstract

This paper presents an abstract clock-based reasoning for the rapid prototyping of embedded applications executed on multiprocessor systems-on-chip (MPSoCs). In this framework, a synchronous multi-clock modeling of application behaviors is considered. The scheduling of these applications on execution platforms composed of processors operating at various frequencies is described and analyzed with the proposed clock modeling. As in the static scheduling of synchronous dataflows (SDFs), requirements for admissible schedules are investigated, which come not only from expected application behavior, but also from execution platform properties. An algorithm is proposed to construct admissible schedules respecting the identified requirements. It is then adapted to support the synthesis of admissible schedules for adaptive system behaviors including, e.g., dynamic frequency changing or task migration. The modeling, analysis and algorithms presented in this paper have been implemented in a prototype tool named CLASSY (standing for CLock AnalySis SYstem), providing also a way to visualize design results. The proposed approach provides a fast and cost-effective means to define correct-by-construction systems and simplify the design space exploration of complex embedded systems.; Ce rapport présente un raisonnement à base d'horloges abstraites pour le prototypage rapide d'applications embarquées sur des systèmes-sur-puce multiprocesseurs (en anglais, multiprocessor system-on-chip -- MPSoCs). Dans ce cadre, une modélisation synchrone multi-horloge des comportements d'applications est considérée. L'ordonnancement de ces applications sur des plates-formes d'exécution composées de processeurs fonctionnant à des fréquences différentes est décrit et analysé à l'aide d'horloges. Comme dans l'ordonnancement statique de spécifications flot de données synchrones, des critères d'admissibilité doivent être satisfaits non seulement par les comportements des applications, mais aussi par ceux des plates-formes d'exécution. Un algorithme est proposé pour construire des ordonnancements admissibles respectant les critères identifiés. Il est ensuite adapté pour supporter la synthèse d'ordonnancements admissibles pour comportements adaptatifs, incluant par exemple, des changements dynamiques de fréquences ou des migrations de tâches. La modélisation, l'analyse et les algorithmes présentés dans ce rapport ont été mis en oeuvre dans un prototype d'outil nommé CLASSY (pour CLock AnalySis SYstem), fournissant également un moyen de visualiser les résultats. Notre approche fournit un moyen rapide et peu coûteux pour définir des systèmes corrects-par-construction et simplifier l'exploration de l'espace de conception pour systèmes embarqués complexes.

Published
2012

21. Deriving configuration interfaces from feature models

Author

Quentin Boucher, Patrick Heymans, Gilles Perrouin, PReCISE Research Centre in Information Systems Engineering (PReCISE), Facultés Universitaires Notre Dame de la Paix (FUNDP), Adaptive Distributed Applications and Middleware (ADAM), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lille, Sciences et Technologies, Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Université de Lille, Sciences et Technologies-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Université de Lille, Sciences et Technologies-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Université de Lille, Sciences et Technologies-Centre National de la Recherche Scientifique (CNRS)

Subjects
Software, Workflow, Computer science, business.industry, End user, Human–computer interaction, Configuration management database, Usability, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Business model, User interface, business, Feature model
Abstract

International audience; In software product lines, feature models are the de-facto standard for representing variability as well as for configuring products. Yet, configuration relying on feature models faces two issues: i) it assumes knowledge of the underlying formalism, which may not be true for end users and ii) it does not take advantage of advanced user-interface controls, leading to usability and integration problems with other parts of the user interface. To address these issues, our research focuses on the generation of configuration interfaces based on variability models, both from the visual and behavioral perspectives. We tackle visual issues by generating abstract user-interfaces from feature models. Regarding configuration behavior, in particular the configuration sequence, we plan to use feature configuration workflows, variability-aware models that exhibit similar characteristics as of task, user, discourse and business models found in the in the human-computer interaction community. This paper discusses the main challenges and possible solutions to realize our vision.

Published
2012

22. A reflective platform for highly adaptive multi-cloud systems

Author

Lionel Seinturier, Philippe Merle, Romain Rouvoy, Adaptive Distributed Applications and Middleware (ADAM), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Institut Universitaire de France (IUF), and Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.)

Subjects
World Wide Web, Cloud systems, business.industry, Computer science, Distributed computing, Cloud computing, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], business
Abstract

International audience; Cloud platforms are increasingly used for hosting a broad diversity of services from traditional e-commerce applications to interactive web-based IDEs. However, we observe that the prolif- eration of offers by Cloud vendors raises several challenges. Developers will not only have to deploy applications for a specific Cloud, but will also have to consider migrating services from one cloud to another, and to manage applications spanning multiple Clouds. In this paper, we therefore report on a first experiment we conducted to build a multi-Cloud system on top of thirteen existing IaaS/PaaS. From this experiment, we advocate for two dimensions of adaptability - design and execution time - that applications for such systems require to exhibit. Finally, we propose a roadmap for future multi-Cloud systems.

Published
2011

23. Conté

Author

Daniel Vogel, Géry Casiez, David R. Cheriton School of Computer Science, University of Waterloo [Waterloo], Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Methods and tools for gestural interactions (MINT), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-IRCICA, SHIVA, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Vocabulary, Computer science, media_common.quotation_subject, 05 social sciences, 020207 software engineering, Input device, 02 engineering and technology, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces/H.5.2.7: Interaction styles (e.g., commands, menus, forms, direct manipulation), ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces/H.5.2.6: Input devices and strategies (e.g., mouse, touchscreen), Human–computer interaction, 0202 electrical engineering, electronic engineering, information engineering, 0501 psychology and cognitive sciences, Design space, 050107 human factors, media_common, Gesture
Abstract

International audience; Conté is a small input device inspired by the way artists manipulate a real Conté crayon. By changing which corner, edge, end, or side is contacting the display, the operator can switch interaction modes using a single hand. Conté's rec- tangular prism shape enables both precise pen-like input and tangible handle interaction. Conté also has a natural compatibility with multi-touch input: it can be tucked in the palm to interleave same-hand touch input, or used to ex- pand the vocabulary of bimanual touch. Inspired by infor- mal interviews with artists, we catalogue Conté's character- istics, and use these to outline a design space. We describe a prototype device using common materials and simple electronics. With this device, we demonstrate interaction techniques in a test-bed drawing application. Finally, we discuss alternate hardware designs and future human fac- tors research to study this new class of input.

Published
2011

24. Challenges to support automated random testing for dynamically typed languages

Author

Manuel Oriol, Alexandre Bergel, Stéphane Ducasse, Analyses and Languages Constructs for Object-Oriented Application Evolution (RMOD), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Department of Computer Science [York] (CS-YORK), University of York [York, UK], Department of Computer Science [Santiago, Chile] (DCC), and Universidad de Chile = University of Chile [Santiago] (UCHILE)

Subjects
[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Programming language, Computer science, White-box testing, Declaration, Random testing, 020207 software engineering, Context (language use), 02 engineering and technology, computer.software_genre, Precondition, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), Argument (linguistics), computer
Abstract

International audience; Automated random testing is a proven way to identify bugs and precondition violations, and this even in well tested libraries. In the context of statically typed languages, current automated random testing tools heavily take advantage of static method declaration (argument types, thrown exceptions) to constrain input domains while testing and to identify errors. For such reason, automated random testing has not been investigated in the context of dynamically typed languages. In this paper we present the key challenges that have to be addressed to support automated testing in dynamic languages.

Published
2011

25. Towards structural decomposition of reflection with mirrors

Author

Luc Fabresse, Marcus Denker, Nick Papoulias, Noury Bouraqadi, Stéphane Ducasse, Analyses and Languages Constructs for Object-Oriented Application Evolution (RMOD), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Centre for Digital Systems (CERI SN), Ecole nationale supérieure Mines-Télécom Lille Douai (IMT Lille Douai), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), ESUG, PHARO, Centre for Digital Systems (CERI SN - IMT Nord Europe), and Ecole nationale supérieure Mines-Télécom Lille Douai (IMT Nord Europe)

Subjects
[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], 050208 finance, Computer science, business.industry, Distributed computing, 05 social sciences, Resource constraints, mirrors, 020207 software engineering, Robotics, 02 engineering and technology, Structural decomposition, meta, Functional decomposition, Current mirror, oo languages, 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, Decomposition (computer science), Artificial intelligence, structural decomposition, Reflection (computer graphics), business, Focus (optics), reflection
Abstract

International audience; Mirrors are meta-level entities introduced to decouple reflection from the base-level system. Current mirror-based systems focus on functional decomposition of reflection. In this paper we advocate that mirrors should also address structural decomposition. Mirrors should not only be the entry points of reflective behavior but also be the storage entities of meta-information. This decomposition can help resolve issues in terms of resource constraints (e.g. embedded systems and robotics) or security. Indeed, structural decomposition enables discarding meta-information.

Published
2011

26. Implicit FEM and fluid coupling on GPU for interactive multiphysics simulation

Author

Hadrien Courtecuisse, Jérémie Allard, François Faure, Simulation in Healthcare using Computer Research Advances (SHACRA), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria), Virtual environments for animation and image synthesis of natural objects (EVASION), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Jean Kuntzmann (LJK), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS), and Mark Elendt

Subjects
Computer science, Multiphysics, 020207 software engineering, Fluid coupling, 02 engineering and technology, Solver, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], Finite element method, Computational science, Computer Science::Performance, Motion, Computer Science::Graphics, Computer graphics (images), Computer Science::Mathematical Software, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Collision detection, ComputingMethodologies_COMPUTERGRAPHICS
Abstract

We present a method to implement on the GPU an implicit FEM solver which is fast and stable enough to handle interactions and collisions. We combine this method with GPU-based fluids [Zhang et al. 2008] and collision detection [Allard et al. 2010] to achieve interactive multiphysics simulations entirely running on the GPU.

Published
2011

27. Supporting energy-driven adaptations in distributed environments

Author

Romain Rouvoy, Lionel Seinturier, Adel Noureddine, Adaptive Distributed Applications and Middleware (ADAM), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), and Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)

Subjects
Consumption (economics), ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.11: Software Architectures, Engineering, Scope (project management), business.industry, media_common.quotation_subject, Distributed computing, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Energy consumption, Adaptability, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-MC]Computer Science [cs]/Mobile Computing, Software, Middleware, Layer (object-oriented design), Architecture, business, media_common
Abstract

International audience; The rise of the usage of digital devices and software services contribute to the increase of energy consumption of IT infrastructures. However, energy is still largely produced by limited resources. Therefore, optimizing and reducing its consumption is an economic and human necessity. Related works addressing energy optimization in computer science are widespread, but at the middleware layer, existing approaches are limited in their scope, adaptability and autonomous functioning. In this paper, we propose the foundations of a middleware architecture capable of handling various types of energy techniques and in different contexts. The distributed nature of our approach fits in a ubiquitous environment and covers the energy dimensions of both devices and software services. We also present the experimental results of a prototype implementing a subset of our proposed architecture. These results illustrate the potential of our energy-aware and autonomous approach.

Published
2011

28. Surfpad

Author

Géry Casiez, Frédéric Giraud, Romuald Vanbelleghem, Nicolas Roussel, Methods and tools for gestural interactions (MINT), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-IRCICA, Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Laboratoire d’Électrotechnique et d’Électronique de Puissance - EA 2697 (L2EP), Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM), Laboratoire d’Électrotechnique et d’Électronique de Puissance - ULR 2697 (L2EP), Centrale Lille-Haute Etude d'Ingénieurs-Université de Lille-Arts et Métiers Sciences et Technologies, Institut National de Recherche en Informatique et en Automatique (Inria), Centrale Lille-Université de Lille-Arts et Métiers Sciences et Technologies, HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-JUNIA (JUNIA), and Université catholique de Lille (UCL)-Université catholique de Lille (UCL)

Subjects
Computer science, [SPI.NRJ]Engineering Sciences [physics]/Electric power, 05 social sciences, Squeeze film, 020207 software engineering, Adaptation (eye), 02 engineering and technology, Touchpad, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces/H.5.2.4: Graphical user interfaces (GUI), 0202 electrical engineering, electronic engineering, information engineering, 0501 psychology and cognitive sciences, Constant (mathematics), 050107 human factors, Simulation
Abstract

International audience; We present Surfpad, a pointing facilitation technique that does not decrease target distance or increase target width in either control or display space. This new technique oper- ates instead in the tactile domain by taking advantage of the ability to alter a touchpad's coefficient of friction by means of a squeeze film effect. We report on three experiments comparing Surfpad to the Semantic Pointing technique and constant control-display gain with and without distractor tar- gets. Our results clearly show the limits of traditional target- aware control-display gain adaptation in the latter case, and the benefits of our tactile approach in both cases. Surfpad leads to a performance improvement close to 9% compared to unassisted pointing at small targets with no distractor. It is also robust to high distractor densities, keeping an aver- age performance improvement of nearly 10% while Seman- tic Pointing can degrade up to 100%. Our results also sug- gest the performance improvement is caused by tactile in- formation feedback rather than mechanical causes, and that the feedback is more effective when friction is increased on targets using a simple step function.

Published
2011

29. Static analysis of synchronous programs in signal for efficient design of multi-clocked embedded systems

Author

GamatieAbdoulaye, GonnordLaure, Contributions of the Data parallelism to real time (DART), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
[INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], business.industry, Computer science, SIGNAL (programming language), [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Parallel computing, Static analysis, computer.software_genre, Computer Graphics and Computer-Aided Design, Embedded system, Component (UML), Code (cryptography), [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, Compiler, Mutual exclusion, business, computer, ComputingMilieux_MISCELLANEOUS, Software, Abstraction (linguistics)
Abstract

In this paper, we propose a sound abstraction for an efficient static analysis of synchronous programs describing multi-clock embedded systems in Signal. This abstraction combines the Boolean theory and numeric interval approximation to adequately address clock relations defined as combinations of logical and numerical expressions. Through a few examples, we show how the proposed solution is used to determine absence of reaction captured by empty clocks; mutual exclusion captured by two or more clocks whose associated signals never occur at the same time; or hierarchical control of component activations via clock inclusion. We also show this analysis improves the quality of the code generated automatically by the Signal compiler, e.g., a code with smaller footprint, or a code executed more efficiently thanks to optimizations enabled by the new abstraction.

Published
2011

30. Flexible object layouts: enabling lightweight language extensions by intercepting slot access

Author

VerwaestToon, LunguMircea, BruniCamillo, NierstraszOscar, Software Composition Group [Bern] (SCG), Universität Bern [Bern] (UNIBE), Analyses and Languages Constructs for Object-Oriented Application Evolution (RMOD), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Lse, Lse, and Software Engineering

Subjects
Domain-specific language, Computer science, 02 engineering and technology, computer.software_genre, Domain (software engineering), Common Intermediate Language, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Software system, GeneralLiterature_REFERENCE(e.g.,dictionaries,encyclopedias,glossaries), Smalltalk, computer.programming_language, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Programming language, Object language, Boilerplate code, 020207 software engineering, Object (computer science), Computer Graphics and Computer-Aided Design, Programming language implementation, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], Object code, Software design pattern, Low-level programming language, computer, Software
Abstract

Programming idioms, design patterns and application libraries often introduce cumbersome and repetitive boilerplate code to a software system. Language extensions and external DSLs (domain specific languages) are sometimes introduced to reduce the need for boilerplate code, but they also complicate the system by introducing the need for language dialects and inter-language mediation. To address this, we propose to extend the structural reflective model of the language with object layouts, layout scopes and slots. Based on the new reflective language model we can 1) provide behavioral hooks to object layouts that are triggered when the fields of an object are accessed and 2) simplify the implementation of state-related language extensions such as stateful traits. By doing this we show how many idiomatic use cases that normally require boilerplate code can be more effectively supported. We present an implementation in Smalltalk, and illustrate its usage through a series of extended examples.

Published
2011

31. A support to multi-devices web application

Author

Jean-Claude Tarby, Xaiver Le Pallec, Raphaël Marvie, José Rouillard, Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Composition de modèles pour l'ingénierie logicielle (COCOA), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), and Nouveaux Outils pour La Coopération et l'Education (NOCE)

Subjects
Ajax, medicine.medical_specialty, business.industry, Computer science, toolkit, Web engineering, web application, Web application security, Web API, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], interactive devices, Human–computer interaction, Web design, Web page, medicine, Web application, business, computer, Web modeling, computer.programming_language
Abstract

International audience; Programming an application which uses interactive devices located on different terminals is not easy. Programming such applications with standard Web technologies (HTTP, Javascript, Web browser) is even more difficult. However, Web applications have interesting properties like running on very different terminals, the lack of a specific installation step, the ability to evolve the application code at runtime. Our demonstration presents a support for designing multi-devices Web applications. After introducing the context of this work, we briefly describe some problems related to the design of multi-devices web application. Then, we present the toolkit we have implemented to help the development of applications based upon distant interactive devices.

Published
2010

32. A cross-layer reputation system for routing non-cooperation effects mitigation within hybrid ad-hoc networks

Author

Abdelmadjid Bouabdallah, Sylvie Laniepce, Luigi Lancieri, Mohammed Achemlal, Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Nouveaux Outils pour La Coopération et l'Education (NOCE), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), and Lifl, Hal

Subjects
Routing protocol, Dynamic Source Routing, Wireless ad hoc network, Computer science, media_common.quotation_subject, Distributed computing, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Enhanced Interior Gateway Routing Protocol, Wireless Routing Protocol, Geographic routing, Destination-Sequenced Distance Vector routing, ComputingMilieux_MISCELLANEOUS, Hierarchical routing, media_common, Zone Routing Protocol, Static routing, Adaptive quality of service multi-hop routing, Wireless mesh network, business.industry, Network packet, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Path vector protocol, Ad hoc wireless distribution service, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Routing domain, Optimized Link State Routing Protocol, Link-state routing protocol, Reputation system, Multipath routing, Hazy Sighted Link State Routing Protocol, business, Computer network, Reputation
Abstract

In Ad-Hoc networks, user nodes, in addition to handling their own traffic, also act as routers and contribute to network connectivity for the benefit of other nodes. With such a collaborative routing technique, hybrid Ad-Hoc networks i.e. Ad-Hoc networks interconnected to an infrastructure-based network via an Access Point (AP) - become a means to extend the network coverage of APs. However, nodes may not be continuously available to route the traffic of other nodes. This can result in severe bandwidth degradation if nodes (partially) drop data packets. In this paper, we propose a new routing protocol suite called MOOR which enables Ad-Hoc nodes to discover dynamically the most reliable routes toward the AP. It is based on a reputation cross-layer system which runs on the AP side and makes use of the TCP control mechanisms to evaluate node cooperation.

Published
2010

33. Semantics for intelligent delivery of multimedia content

Author

Samir Amir, Jiehan Zhou, Mika Ylianttila, Eduardo Martínez Graciá, Juhani Laitakari, Daniel Pakkala, Ioan Marius Bilasco, Jean Martinet, Patrick Blandin, Chabane Djeraba, Mika Rautiainen, Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), FOX MIIRE (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche Public Henri Tudor [Headquarters] (CRP Henri Tudor), Centre de Recherche Public Henri-Tudor [Luxembourg] (CRP Henri-Tudor), Technical Research Centre of Finland, VTT Technical Research Centre of Finland (VTT), Department of Information and Communications Engineering, Universidad de Murcia, Department of Electrical and Information Engineering, University of Oulu, Shin, Dongwan, and Lifl, Hal

Subjects
multimedia, Data element, Multimedia, Computer science, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], metadata, aggregation, Meta Data Services, users, Marker interface pattern, Metadata modeling, computer.software_genre, context, Metadata repository, Metamodeling, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], World Wide Web, Metadata, community, Software mining, Geospatial metadata, computer, ComputingMilieux_MISCELLANEOUS
Abstract

This paper describes a new generic metadata model, called CAM Metamodel, that merges altogether information about content, services, physical and technical environment in order to enable homogenous delivery and consumption of content. We introduce a metadata model that covers all these aspects and which can be easily extended so as to absorb new types of models and standards. We ensure this flexibility by introducing an abstract metamodel, which defines structured archetypes for metadata and metadata containers. The metamodel is the foundation for the technical metadata specification. We also introduce new structures in the abstract and core metamodels supporting the management of distributed community created metadata.

Published
2010

34. The view update problem for XML

Author

Iovka Boneva, Sławek Staworko, Benoît Groz, Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Modeling Tree Structures, Machine Learning, and Information Extraction (MOSTRARE), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Document Structure Description, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Information retrieval, computer.internet_protocol, Computer science, XML validation, Well-formed document, Document type definition, Simple API for XML, Document Schema Definition Languages, ComputingMethodologies_DOCUMENTANDTEXTPROCESSING, computer, XML, XML Catalog
Abstract

International audience; We study the problem of update propagation across views in the setting where both the view and the source database are XML documents. We consider a simple class of XML views that remove selected parts of the source document. The considered update operations permit to insert and delete subtrees of the document. We focus on constructing propagations that are 1) schema compliant i.e., when applied to the source document they give a document that satisfies the document schema; 2) side-effect free i.e., the view of the new source document is exactly as the result of applying the user update to the old view. We present a special structure allowing to capture all such propagations. We also show how to use this structure to capture only those propagations that affect minimally the parts of the document which are not visible in the view. Finally, we present a general outline of a polynomial algorithm constructing a unique propagation.

Published
2010

35. Efficacité et robustesse aux distracteurs d'un retour tactile pour faciliter le pointage

Author

Géry Casiez, Frédéric Giraud, Romuald Vanbelleghem, Nicolas Roussel, Laboratoire d'Informatique Fondamentale de Lille [LIFL], Methods and tools for gestural interactions [MINT], Laboratoire d’Électrotechnique et d’Électronique de Puissance - ULR 2697 [L2EP], Methods and tools for gestural interactions (MINT), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Laboratoire d’Électrotechnique et d’Électronique de Puissance - ULR 2697 (L2EP), Centrale Lille-Université de Lille-Arts et Métiers Sciences et Technologies, HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-JUNIA (JUNIA), Université catholique de Lille (UCL)-Université catholique de Lille (UCL), AFIHM, Institut National de Recherche en Informatique et en Automatique (Inria)-IRCICA, Centrale Lille-Haute Etude d'Ingénieurs-Université de Lille-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM), Laboratoire d’Électrotechnique et d’Électronique de Puissance - EA 2697 (L2EP), and Arts et Métiers Sciences et Technologies

Subjects
Computer science, Speech recognition, 05 social sciences, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.2: User Interfaces, 020207 software engineering, 02 engineering and technology, Touchpad, Pointing facilitation, touchpad, squeeze film effect, friction, distractor, 0202 electrical engineering, electronic engineering, information engineering, 0501 psychology and cognitive sciences, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Performance improvement, Coefficient of friction, 050107 human factors, Simulation
Abstract

International audience; Surfpad is a pointing facilitation technique that operates in the tactile domain by taking advantage of the ability to alter a touchpad's coefficient of friction. We report on two experiments comparing it to the semantic pointing technique and constant control-display gain with and without distractor targets. Our results clearly show the limits of traditional target-aware gain adaptation in the latter case, and the benefits of our tactile approach in both cases. Surfpad can lead to a performance improvement of up to 21% compared to unassisted pointing at small targets with no distractor. It is also robust to high distractor densities, keeping an average performance improvement of nearly 10% while semantic pointing can degrade up to 100%.; Surfpad est une technique de facilitation du pointage tirant parti de la possibilité de modifier le coefficient de friction d'un pavé tactile. Nous décrivons deux expériences comparant cette technique au pointage sémantique et à un gain control-display constant, avec et sans distracteurs. Nos résultats montrent les limites de l'adaptation de gain sensible aux cibles en présence de distracteurs et les avantages de notre approche tactile dans les deux cas. Le gain de temps permis par Surfpad face au pointage sans assistance peut aller jusqu'à 21% dans le cas de petites cibles sans distracteur. Notre technique est également robuste aux grandes densités de distracteurs, améliorant en moyenne les performances de près de 10% quand le pointage sémantique peut les dégrader jusqu'à 100%.

Published
2010

36. Automatic wrapper induction from hidden-web sources with domain knowledge

Author

Marc Tommasi, Daniel Muschick, Avin Mittal, Rémi Gilleron, Pierre Senellart, Modeling Tree Structures, Machine Learning, and Information Extraction (MOSTRARE), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Groupe de Recherche en Apprentissage Automatique (GRAppA - LIFL), Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Integration of data and knowledge distributed over the web (GEMO), Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), ANR-05-MMSA-0016,marmota,Apprentissage automatique, modèles probabilistes et langages d'arbres(2005), Tommasi, Marc, and Masse de données : Modélisation, Simulation, Applications - Apprentissage automatique, modèles probabilistes et langages d'arbres - - marmota2005 - ANR-05-MMSA-0016 - MMSA - VALID

Subjects
wrapper, Computer science, deep Web, 02 engineering and technology, computer.software_genre, form, Domain (software engineering), Set (abstract data type), Annotation, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, invisible Web, information extraction, probing, Structure (mathematical logic), Information retrieval, Web service, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], Information extraction, Hidden Web, Domain knowledge, 020201 artificial intelligence & image processing, Heuristics, computer
Abstract

International audience; We present an original approach to the automatic induction of wrappers for sources of the hidden Web that does not need any human supervision. Our approach only needs domain knowledge expressed as a set of concept names and concept instances. There are two parts in extracting valuable data from hidden-Web sources: understanding the structure of a given HTML form and relating its fields to concepts of the domain, and understanding how resulting records are represented in an HTML result page. For the former problem, we use a combination of heuristics and of probing with domain instances; for the latter, we use a supervised machine learning technique adapted to tree-like information on an automatic, imperfect, and imprecise, annotation using the domain knowledge. We show experiments that demonstrate the validity and potential of the approach.

Published
2008

37. Analyzing eye fixations and gaze orientations on films and pictures

Author

Nacim Ihaddadene, Stanislas Lew, Chabane Djeraba, Anthony Martinet, Jean Martinet, Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), FOX MIIRE (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Institut de Recherche sur les Composants logiciels et matériels pour l'Information et la Communication Avancé - USR 3380 (IRCICA), Centre National de la Recherche Scientifique (CNRS)-Université de Lille, and Université de Lille-Centre National de la Recherche Scientifique (CNRS)

Subjects
Computer science, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, 02 engineering and technology, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 03 medical and health sciences, InformationSystems_MODELSANDPRINCIPLES, 0302 clinical medicine, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], 0202 electrical engineering, electronic engineering, information engineering, Computer vision, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], business.industry, [INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM], [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], Eye movement, Human being, Gaze, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], Fixation (visual), Eye tracking, 020201 artificial intelligence & image processing, Artificial intelligence, business, 030217 neurology & neurosurgery
Abstract

Eye movements are arguably the most natural and repetitive movement of a human being. The most mundane activity, such as watching television or reading a newspaper, involves this automatic activity which consists of shifting our gaze from one point to another. Identification of the components of eye movements (fixations and saccades) is an essential part in the analysis of visual behavior because these types of movements provide the basic elements used by further investigations of human vision. However, many of the algorithms that detect fixations present a number of problems. In this paper, we present the results of a new fixation identification technique that is based on clustering of eye positions, using projections and a projection aggregation applied to static pictures. We also present results of a new method that computes dispersion of eye fixations in videos considering a multi-user environment.

Published
2008

38. Polynomial time fragments of XPath with variables

Author

Emmanuel Filiot, Sophie Tison, Joachim Niehren, Jean-Marc Talbot, Modeling Tree Structures, Machine Learning, and Information Extraction (MOSTRARE), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 (LIF), and Université de la Méditerranée - Aix-Marseille 2-Université de Provence - Aix-Marseille 1-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Theoretical computer science, computer.internet_protocol, Computer science, Modulo, InformationSystems_DATABASEMANAGEMENT, Path expression, ACM: H.: Information Systems/H.1: MODELS AND PRINCIPLES, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Fragment (logic), Core (graph theory), Feature (machine learning), Time complexity, computer, XML, XPath
Abstract

International audience; Variables are the distiguishing new feature of XPath 2.0 which permits to select n-tuples of nodes in trees. It is known that the Core of XPath 2.0 captures n-ary first-order (FO) queries modulo linear time transformations. In this paper, we distinguish a fragment of Core XPath 2.0 that remains FO-complete with respect to n-ary queries while enjoying polynomial-time query answering.

Published
2007

39. A domain-specific language for task handlers generation, applying discrete controller synthesis

Author

Eric Rutten, Gwenaël Delaval, Programming languages, Operating Systems, Parallelism, and Aspects for Real-Time (POP ART), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Contributions of the Data parallelism to real time (DART), Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Domain-specific language, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Computer science, Programming language, Process (engineering), Controller (computing), Avionics, computer.software_genre, discrete control synthesis, Task (project management), Domain (software engineering), Language primitive, domain-specific language, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.2: Design Tools and Techniques/D.2.2.0: Computer-aided software engineering (CASE), synchronous programming, ACM: C.: Computer Systems Organization/C.3: SPECIAL-PURPOSE AND APPLICATION-BASED SYSTEMS/C.3.2: Real-time and embedded systems, safe design, Programming domain, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.2: Language Classifications/D.3.2.12: Specialized application languages, Real-time systems, computer
Abstract

We propose a simple programming language, called Nemo, specific to the domain of multi-task real-time embedded systems, such as in robotic, automotive or avionics systems. It can be used to specify a set of resources with usage constraints, a set of tasks that consume them according to various modes, and applications sequencing the tasks. We obtain automatically an application-specific task handler that correctly manages the constraints (if there exists one), through a compilation-like process including a phase of discrete controller synthesis. This way, this formal technique contributes to the safety of the designed systems, while being encapsulated in a tool that makes it usable by end-users and application experts. Our approach is based on the synchronous modelling techniques, languages and tools.

Published
2006

40. Adaptive resolution of 1D mechanical B-spline

Author

Christophe Chaillou, Laurent Grisoni, Julien Lenoir, Philippe Meseure, Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Collaborative interactive virtual environment (ALCOVE), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-IRCICA, SIGNAL-IMAGE-COMMUNICATION (SIC), Université de Poitiers-Centre National de la Recherche Scientifique (CNRS), and Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
0209 industrial biotechnology, Computer science, B-spline, Mechanical 1D model, Adaptive resolution, 020207 software engineering, 02 engineering and technology, Animation, Real-time simulation, [INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR], Spline (mathematics), 020901 industrial engineering & automation, Computer graphics (images), 0202 electrical engineering, electronic engineering, information engineering, ComputingMethodologies_COMPUTERGRAPHICS
Abstract

International audience; This article presents an adaptive approach to B-spline curve physical simulation. We combine geometric refinement and coarsening techniques with an appropriate continuous mechanical model. We thus deal with the (temporal and geometric) continuity issues implied when mechanical adaptive resolution is used. To achieve real-time local adaptation of spline curves, some criteria and optimizations are shown. Among application examples, real-time knot tying is presented, and curve cutting is also pointed out as a nice sideeffect of the adaptive resolution animation framework.

Published
2005

41. PARDI!

Author

Boulier, François, Lemaire, François, Moreno Maza, Marc, Laboratoire d'Informatique Fondamentale de Lille (LIFL), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Calcul Formel (CALFOR), Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Sciences et Technologies-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lille, Sciences Humaines et Sociales-Centre National de la Recherche Scientifique (CNRS), Ontario Research Center for Computer Algebra (ORCCA), and University of Waterloo [Waterloo]-University of Western Ontario (UWO)

Subjects
[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], change of ranking, [MATH.MATH-AC]Mathematics [math]/Commutative Algebra [math.AC], ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, differential algebra, characteristic set, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], gcd, PDE
Abstract

International audience; We propose a new algorithm for converting a characteristic set of a prime differential ideal from one ranking into another. This differential algebra algorithm computes characteristic sets by change of ranking (ordering) for prime ideals. It identifies the purely algebraic subproblems which arise during differential computations and solves them algebraically. There are two improvements w.r.t. other approaches: formerly unsolved problems could be carried out; it is conceptually simple. Different variants are implemented.

Published
2001

Catalog

Books, media, physical & digital resources
See catalog results