Author: "Université de Lille, Sciences Humaines et Sociales" - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Université de Lille, Sciences Humaines et Sociales"' showing total 5,175 results

Start Over Author "Université de Lille, Sciences Humaines et Sociales"

5,175 results on '"Université de Lille, Sciences Humaines et Sociales"'

151. a research support librarian

Author: Westeel, Isabelle, Malleret, Cécile, Tayara, Françoise, Halipré, Aurélie, Institut de Recherches Historiques du Septentrion (IRHiS) - UMR 8529 (IRHiS), Université de Lille-Centre National de la Recherche Scientifique (CNRS), Service Commun de la Documentation - Université de Lille 3, Sciences Humaines et Sociales (SCD), Université de Lille, Sciences Humaines et Sociales, Atelier National de Reproduction des Thèses (ANRT), Ministère de l'Éducation nationale, Université de Lille Sciences humaines et sociales, Centre National de la Recherche Scientifique (CNRS)-Université de Lille, Service Commun de la Documentation - Université de Lille, Sciences Humaines et Sociales (SCD), and Ministère de l'Education Nationale
Subjects: open access, research support, [SHS.INFO]Humanities and Social Sciences/Library and information sciences, heritage collection, valorization, academic library
Abstract: International audience; The poster shows the different activities of a research support librarian, a new profile at the academic library of the University Lille social sciences and humanities campus (formerly Lille 3).Since 2012, the university library in Lille 3 tries to lead a research support policy. It is not only to develop information resources in connection with the areas of research, but also to respond to changing needs and practices of researchers.This poster aims to present the diversity of services (open archive, workplaces dedicated, digital library, customized workshops) and rich collections (archives, press, literature). Recovery and the increased visibility of the scientific production of researchers are at the heart of these support services to research that develop in academic libraries.
Published: 2016

152. Un système d'assurance chômage pour la zone Euro ?

Author: Farvaque, Etienne, Huart, Florence, Lille économie management - UMR 9221 (LEM), Université d'Artois (UA)-Université catholique de Lille (UCL)-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Economie Quantitative, Intégration, Politiques Publiques et Econométrie (EQUIPPE), Université de Lille, Droit et Santé-PRES Université Lille Nord de France-Université de Lille, Sciences Humaines et Sociales-Université de Lille, Sciences et Technologies, and Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-PRES Université Lille Nord de France-Université de Lille, Droit et Santé
Subjects: Europe, Assurance chômage, [SHS.ECO]Humanities and Social Sciences/Economics and Finance
Published: 2016

153. Fast head turns detection in low quality videos using optical flow

Author: José Mennesson, benjamin allaert, Ioan Marius Bilasco, 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), Université de Lille, Sciences et Technologies, FOX MIIRE (LIFL), 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: [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]
Abstract: National audience; Detecting automatically a person who needs help in a shopping center represents an unique challenge in computer vision. It lies in the poor quality of images we consider. Our method focuses on consistency of dense optical flow to extract head turns.; Détecter automatiquement une personne qui a besoin d'aide dans un magasin représente un défi en vision par or-dinateur. Cela réside dans le fait que la qualité des images est mauvaise. Notre méthode se porte sur un calcul de co-hérence des flots optiques denses
Published: 2016

154. Asymptotically Optimal Algorithms for Multiple Play Bandits with Partial Feedback

Author: Luedtke, Alexander, Kaufmann, Emilie, Chambaz, Antoine, Fred Hutchinson Cancer Research Center (FHCRC), Fred Hutchinson Cancer Research Center, Division of Biostatistics, UC Berkeley, Sequential Learning (SEQUEL), 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), Institut Mines-Télécom [Paris] - Centre National de la Recherche Scientifique (CNRS) - Université de Lille, Sciences Humaines et Sociales - Université de Lille, Sciences et Technologies - Ecole Centrale de Lille - Institut National de Recherche en Informatique et en Automatique (Inria) - Institut Mines-Télécom [Paris] - Centre National de la Recherche Scientifique (CNRS) - Université de Lille, Sciences Humaines et Sociales - Université de Lille, Sciences et Technologies - Ecole Centrale de Lille, Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Institut Mines-Télécom [Paris] - Centre National de la Recherche Scientifique (CNRS) - Université de Lille, Sciences Humaines et Sociales - Université de Lille, Sciences et Technologies - Ecole Centrale de Lille - Institut National de Recherche en Informatique et en Automatique (Inria), MAP5 - Mathématiques Appliquées à Paris 5 (MAP5 - UMR 8145), Centre National de la Recherche Scientifique (CNRS) - Institut National des Sciences Mathématiques et de leurs Interactions - Université Paris Descartes - Paris 5 (UPD5), Modélisation aléatoire de Paris X (MODAL'X), Université Paris Nanterre (UPN), Projet ANR, fellowship de l'Université de Berkeley, and ANR-13-BS01-0005, SPADRO, Statistique Semi-Paramétrique pour l'Allocation Dynamique de Ressources et l'Optimisation(2013)
Subjects: [STAT.ML] Statistics [stat]/Machine Learning [stat.ML]
Abstract: We study a variant of the multi-armed bandit problem with multiple plays in which the user wishes to sample the m out of k arms with the highest expected rewards, but at any given time can only sample l ≤ m arms. When l = m, Thompson sampling was recently shown to be asymptotically efficient. We derive an asymptotic regret lower bound for any uniformly efficient algorithm in our new setting where may be less than m. We then establish the asymptotic optimality of Thompson sampling for Bernoulli rewards, where our proof technique differs from earlier methods even when l = m. We also prove the asymptotic optimality of an algorithm based on upper confidence bounds, KL-CUCB, for single-parameter exponential families and bounded, finitely supported rewards, a result which is new for all values of l.
Published: 2016

155. Tractable Lineages on Treelike Instances: Limits and Extensions

Author: Pierre Senellart, Pierre Bourhis, Antoine Amarilli, Data, Intelligence and Graphs (DIG), Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris-Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Département Informatique et Réseaux (INFRES), Télécom ParisTech, Linking Dynamic Data (LINKS ), 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: FOS: Computer and information sciences, Polynomial, Class (set theory), TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Theoretical computer science, Computer science, 0102 computer and information sciences, 02 engineering and technology, Computer Science::Computational Complexity, Characterization (mathematics), 01 natural sciences, symbols.namesake, Computer Science - Databases, TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Computer Science::Databases, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Probabilistic logic, InformationSystems_DATABASEMANAGEMENT, Contrast (statistics), Databases (cs.DB), Graph, Planar graph, Treewidth, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, Bounded function, symbols, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract: Query evaluation on probabilistic databases is generally intractable (#P-hard). Existing dichotomy results have identified which queries are tractable (or safe), and connected them to tractable lineages. In our previous work, using different tools, we showed that query evaluation is linear-time on probabilistic databases for arbitrary monadic second-order queries, if we bound the treewidth of the instance. In this paper, we study limitations and extensions of this result. First, for probabilistic query evaluation, we show that MSO tractability cannot extend beyond bounded treewidth: there are even FO queries that are hard on any efficiently constructible unbounded-treewidth class of graphs. This dichotomy relies on recent polynomial bounds on the extraction of planar graphs as minors, and implies lower bounds in non-probabilistic settings, for query evaluation and match counting in subinstance-closed families. Second, we show how to explain our tractability result in terms of lineage: the lineage of MSO queries on bounded-treewidth instances can be represented as bounded-treewidth circuits, polynomial-size OBDDs, and linear-size d-DNNFs. By contrast, we can strengthen the previous dichotomy to lineages, and show that there are even UCQs with disequalities that have superpolynomial OBDDs on all unbounded-treewidth graph classes; we give a characterization of such queries. Last, we show how bounded-treewidth tractability explains the tractability of the inversion-free safe queries: we can rewrite their input instances to have bounded-treewidth., 36 pages, 2 tables. Version with proofs of the PODS'16 article. Some omitted proofs are available in the thesis of the first author. Includes a corrected proof of Theorem 5.5
Published: 2016

156. A dirty deed done dirt cheap: Reporting the blame of a national reform on local politicians

Author: Etienne Farvaque, Aurélie Cassette, Economie Quantitative, Intégration, Politiques Publiques et Econométrie (EQUIPPE), Université de Lille, Droit et Santé-PRES Université Lille Nord de France-Université de Lille, Sciences Humaines et Sociales-Université de Lille, Sciences et Technologies, Lille économie management - UMR 9221 (LEM), Université d'Artois (UA)-Université catholique de Lille (UCL)-Université de Lille-Centre National de la Recherche Scientifique (CNRS), and Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-PRES Université Lille Nord de France-Université de Lille, Droit et Santé
Subjects: Deed, School, Economics and Econometrics, Government, Boycott, media_common.quotation_subject, 05 social sciences, Public administration, 16. Peace & justice, Elections, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, Municipalities, 0506 political science, Reforms, Blame, Secession, Central government, 0502 economics and business, Political Science and International Relations, Accountability, 050602 political science & public administration, Economics, Federalism, 050207 economics, media_common
Abstract: International audience; This paper tests the hypothesis that upper-level governments can transfer the accountability of the costs of a reform to a lower one. The reform of the school week in France provides the ground for a verification of the attribution of accountability hypothesis, as it was nationally decided and locally implemented, right before a municipal election. The results confirm that local incumbents have taken the blame of the reform, especially in larger cities. In this case, thus, the cost of the reform is borne twice by the lower level of government, financially and politically. So doing, the central government does a dirty deed to the local ones, for a very cheap cost. That mayors who have announced a boycott of the reform have received electoral gains confirms that some local politicians expected to be the fall guys, bearing the brunt of the costs of the reform.
Published: 2016

157. Etude de la dynamique du visage en situation d'interaction naturelle

Author: benjamin allaert, José Mennesson, Ioan Marius Bilasco, Chaabane Djeraba, 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), FOX MIIRE (LIFL), 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), and Université de Lille, Sciences et Technologies
Subjects: Expressions faciales, Normalisation, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], Etude du mouvement
Abstract: International audience; L'importance de la dynamique faciale pour la reconnaissance d'expressions spontanées a été prouvée dans l'iden-tification subtile des déformations physiques du visage. Les approches courantes de reconnaissance d'expressions fa-ciales sont performantes sur des datasets où l'environne-ment est contrôlé et les expressions sont actées. Cepen-dant, ces datasets ne reflètent pas les conditions rencon-trées dans une situation d'interaction naturelle où la per-sonne est libre de ses mouvements. Dans ces contextes, la présence de variations de pose et de larges déplacements rend l'analyse difficile. Cet article présente une synthèse originale des solutions de normalisation et d'extraction de mouvements du visage en présence d'expressions sponta-nées et propose d'étudier l'impact de ces méthodes de nor-malisation sur la dynamique faciale.
Published: 2016

158. COCO: Performance Assessment

Author: Hansen, Nikolaus, Auger, Anne, Brockhoff, Dimo, Tušar, Dejan, Tušar, Tea, 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), 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), ANR-12-MONU-0009,NumBBO,Analyse, Amelioration, Evaluation d'algorithmes numériques pour l'optimisation boîte-noire(2012), 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), 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), Machine Learning and Optimisation ( TAO ), Laboratoire de Recherche en Informatique ( LRI ), Université Paris-Sud - Paris 11 ( UP11 ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -Université Paris-Sud - Paris 11 ( UP11 ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique ( Inria ), 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, and ANR-12-MONU-0009,NumBBO,Analyse, Amelioration, Evaluation d'algorithmes numériques pour l'optimisation boîte-noire ( 2012 )
Subjects: FOS: Computer and information sciences, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], [ INFO.INFO-MS ] Computer Science [cs]/Mathematical Software [cs.MS], [ INFO.INFO-NA ] Computer Science [cs]/Numerical Analysis [cs.NA], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Computer Science - Neural and Evolutionary Computing, Neural and Evolutionary Computing (cs.NE), [ INFO.INFO-NE ] Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], [INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA], [ INFO.INFO-PF ] Computer Science [cs]/Performance [cs.PF], [ INFO.INFO-LG ] Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-MS]Computer Science [cs]/Mathematical Software [cs.MS]
Abstract: ArXiv e-prints, arXiv:1605.03560; We present an any-time performance assessment for benchmarking numerical optimization algorithms in a black-box scenario, applied within the COCO benchmarking platform. The performance assessment is based on runtimes measured in number of objective function evaluations to reach one or several quality indicator target values. We argue that runtime is the only available measure with a generic, meaningful, and quantitative interpretation. We discuss the choice of the target values, runlength-based targets, and the aggregation of results by using simulated restarts, averages, and empirical distribution functions.
Published: 2016

159. Biotransformation of organic matter during composting of solid wastes from traditional tanneries by thermochemolysis coupled with gas chromatography and mass spectrometry

Author: Soumia Amir, Mohamed Hafidi, Fatima Benlboukht, Laurent Lemée, André Amblès, Institut de Chimie des Milieux et Matériaux de Poitiers (IC2MP), Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université de Poitiers-Institut de Chimie du CNRS (INC), FOX MIIRE (LIFL), 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), Laboratoire d'Ecologie Végétale et Environnement, faculté des sciences semlaia, and Université de Poitiers-Institut national des sciences de l'Univers (INSU - CNRS)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Environmental Engineering, 010501 environmental sciences, Management, Monitoring, Policy and Law, 01 natural sciences, complex mixtures, Hydrolysis, chemistry.chemical_compound, Biotransformation, Lignin, Tannin, [CHIM]Chemical Sciences, Organic matter, 0105 earth and related environmental sciences, Nature and Landscape Conservation, chemistry.chemical_classification, Chromatography, fungi, 04 agricultural and veterinary sciences, Decomposition, chemistry, 13. Climate action, Polyphenol, Environmental chemistry, 040103 agronomy & agriculture, 0401 agriculture, forestry, and fisheries, Gas chromatography
Abstract: International audience; In the present paper, Thermochemolysis (or Thermally Assisted Hydrolysis/Methylation) is used as a way of following the biotransformation of organic matter during composting of solid wastes from traditional tanneries. The qualitative analysis of the pyrograms allowed us to discriminate between four main families of compounds: aromatic compounds, lipids, polysaccharides and nitrogen-containing substances. The quantitative data revealed some variations in the chemical composition of the macromolecular content. Lipids are the most transformed fraction during the composting process. Animal and plant fatty acids showed a sensible decrease. Fungal fatty acids mainly increased during the thermophilic phase whereas bacterial fatty acids increased when the growth of fungi is repressed. During composting of solid wastes from traditional tanneries an adapted microbial community has been developed. Various lignin-derived units during composting showed a strong increase in p-hydroxyphenyl type-compounds in comparison with the other aromatic structures due to high decomposition of grass cuttings. Tannin derived compounds also increased throughout the composting. Lignin and condensed tannins polymers are partially degraded and stabilized by covalent linkage to more complex organic molecules such as humic substances. Nitrogen containing compounds increased during composting as a consequence of the high rate of degradation of the other fractions and/or their combination with polyphenolic structure leading to the formation of humic substances. In our study a correlation was found between NTK and nitrogen containing substances.
Published: 2016

160. Parallel Branch-and-Bound in Multi-core Multi-CPU Multi-GPU Heterogeneous Environments

Author: Bilel Derbel, Trong-Tuan Vu, 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), HEMERA GRID5000, 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), Ecole Centrale de Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Ecole Centrale de Lille-Université de Lille-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), Parallel Cooperative Multi-criteria Optimization [DOLPHIN], and Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Subjects: large scale parallel B&B;heterogenous CPU GPU, Load Balancing, work stealing, Speedup, Computer Networks and Communications, Computer science, Distributed computing, 02 engineering and technology, Parallel computing, Thread (computing), large scale parallel B&B, large scale heterogeneous distributed systems, Idle, 0202 electrical engineering, electronic engineering, information engineering, Multi gpu, multi-core multi-CPU multi-GPU systems, 020203 distributed computing, Multi-core processor, Branch and bound, heterogenous CPU GPU, Workload, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Load balancing (computing), Shared memory, Hardware and Architecture, Parallel B&B, 020201 artificial intelligence & image processing, Distributed memory, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Software
Abstract: We investigate the design of parallel B&B in large scale heterogeneous compute environments where processing units can be composed of a mixture of multiple shared memory cores, multiple distributed CPUs and multiple GPUs devices. We describe two approaches addressing the critical issue of how to map B&B workload with the different levels of parallelism exposed by the target compute platform. We also contribute a throughout large scale experimental study which allows us to derive a comprehensive and fair analysis of the proposed approaches under different system configurations using up to 16 GPUs and up to 512 distributed cores. Our results shed more light on the main challenges one has to face when tackling B&B algorithms while describing efficient techniques to address them. In particular, we are able to obtain linear speed-ups at moderate scales where adaptive load balancing among the heterogeneous compute resources is shown to have a significant impact on performance. At the largest scales, intra-node parallelism and hybrid decentralized load balancing is shown to have a crucial importance in order to alleviate locking issues among shared memory threads and to scale the distributed resources while optimizing communication costs and minimizing idle times. Key challenges in parallelizing Branch-and-Bound for large scale systems.Heterogeneous load balancing for parallel Branch-and-Bound.Shared and distributed memory hybrid work stealing.CPU-GPU distributed B&B protocol with near-optimal speedup.
Published: 2016

161. Constraint-Based Haptic Rendering of Multirate Compliant Mechanisms

Author: Igor Peterlik, Stéphane Cotin, Abderrahmane Kheddar, M. Nouicer, Christian Duriez, 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), École Nationale Supérieure d'Informatique [Alger] (ESI), Interactive Digital Humans (IDH), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Joint Robotics Laboratory [France] (CNRS-AIST JRL), National Institute of Advanced Industrial Science and Technology (AIST)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-National Institute of Advanced Industrial Science and Technology (AIST), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS), and Joint Robotics Laboratory (CNRS-AIST JRL )
Subjects: Computer science, deformable, Anatomical structures, multithread, 02 engineering and technology, Thread (computing), Haptic rendering, heterogeneous constraints, compliance, Rendering (computer graphics), virtual mechanisms, laparoscopic simulation, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], physically-based simulation, Simulation, intermediate representation, Haptic technology, ComputingMethodologies_COMPUTERGRAPHICS, contact modeling, multirate, Compliant mechanism, 020207 software engineering, needle simulation, Computer Science Applications, Human-Computer Interaction, 020201 artificial intelligence & image processing, Needle insertion, Surgical simulation
Abstract: International audience; The paper is dedicated to haptic rendering of complex physics-based environment in the context of surgical simulation. A new unified formalism for modeling the mechanical interactions between medical devices and anatomical structures and for computing accurately the haptic force feedback is presented. The approach deals with the mechanical interactions using appropriate force and/or motion transmission models named compliant mechanisms. These mechanisms are formulated as a constraint-based problem that is solved in two separate threads running at different frequencies. The first thread processes the whole simulation including the soft-tissue deformations, whereas the second one only deals with computer haptics. This method builds a bridge between the so-called virtual mechanisms (that were proposed for haptic rendering of rigid bodies) and intermediate representations (used for rendering of complex simulations). With this approach, it is possible to describe the specific behavior of various medical devices while relying on a unified method for solving the mechanical interactions between deformable objects and haptic rendering. The technique is demonstrated in interactive simulation of flexible needle insertion through soft anatomical structures with force feedback.
Published: 2016

162. Modeling and Compensation of the Internal Friction Torque of a Travelling Wave Ultrasonic Motor

Author: F. Ionescu, Betty Lemaire-Semail, Michel Amberg, Frédéric Giraud, Paul Sandulescu, 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), 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), University of Bucharest (UniBuc), Methods and tools for gestural interactions [MINT], Laboratoire d’Électrotechnique et d’Électronique de Puissance - ULR 2697 [L2EP], University of Bucharest [UniBuc], 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, and HESAM Université (HESAM)-HESAM Université (HESAM)
Subjects: Engineering, Stator, haptic display, 02 engineering and technology, DC motor, law.invention, Computer Science::Robotics, law, Control theory, Ultrasonic motor, 0202 electrical engineering, electronic engineering, information engineering, Torque, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Machine control, Haptic technology, business.industry, Rotor (electric), [SPI.NRJ]Engineering Sciences [physics]/Electric power, 020208 electrical & electronic engineering, 021001 nanoscience & nanotechnology, Computer Science Applications, Human-Computer Interaction, Force feedback, real-time control, ultrasonic motor, 0210 nano-technology, Actuator, business
Abstract: International audience; This paper deals with the control and experimentation of a one-degreeof- freedom haptic stick, actuated by a travelling wave ultrasonic motor. This type of actuator has many interesting properties such as low-speed operation capabilities and a high torque-to-weight ratio, making it appropriate for haptic applications. However, the motor used in this application displays nonlinear behavior due to the necessary contact between its rotor and stator. Moreover, due to its energy conversion process, the torque applied to the end-effector is not a straightforward function of the supply current or voltage. This is why a forcefeedback control strategy is presented, which includes an online parameter estimator. Experimental runs are then presented to examine the fidelity of the interface.
Published: 2016

163. Role of neoadjuvant treatment in clinical T2N0M0 oesophageal cancer: results from a retrospective multi-center European study

Author: Sheraz R. Markar, Caroline Gronnier, Arnaud Pasquer, Alain Duhamel, Hélène Beal, Jérémie Théreaux, Johan Gagnière, Gil Lebreton, Cécile Brigand, Bernard Meunier, Denis Collet, Christophe Mariette, Abdennahceur Dhahri, Delphine Lignier, Cyril Cossé, Jean-Marc Regimbeau, Magalie Cabau, Jacques Jougon, Bogdan Badic, Patrick Lozach, Jean Pierre Bail, Serge Cappeliez, Issam El Nakadi, Arnaud Alves, Renaud Flamein, Denis Pezet, Federica Pipitone, Bogdan Stan-Iuga, Nicolas Contival, Eric Pappalardo, Simon Msika, Styliani Mantziari, Nicolas Demartines, Flora Hec, Marguerite Vanderbeken, Williams Tessier, Nicolas Briez, Fabien Fredon, Alain Gainant, Muriel Mathonnet, Jean Marc Bigourdan, Salim Mezoughi, Christian Ducerf, Jacques Baulieux, Jean-Yves Mabrut, Oussama Baraket, Gilles Poncet, Mustapha Adham, Delphine Vaudoyer, Peggy Jourdan Enfer, Laurent Villeneuve, Olivier Glehen, Thibault Coste, Jean-Michel Fabre, Frédéric Marchal, Romain Frisoni, Ahmet Ayav, Laurent Brunaud, Laurent Bresler, Charlotte Cohen, Olivier Aze, Nicolas Venissac, Daniel Pop, Jérôme Mouroux, Ion Donici, Michel Prudhomme, Emanuele Felli, Stéphanie Lisunfui, Marie Seman, Gaelle Godiris Petit, Mehdi Karoui, Christophe Tresallet, Fabrice Ménégaux, Jean-Christophe Vaillant, Laurent Hannoun, Brice Malgras, Denis Lantuas, Karine Pautrat, Marc Pocard, Patrice Valleur, Najim Chafai, Pierre Balladur, Magalie Lefrançois, Yann Parc, François Paye, Emmanuel Tiret, Marius Nedelcu, Letizia Laface, Thierry Perniceni, Brice Gayet, Alexandre Filipello, Jack Porcheron, Olivier Tiffet, Noémie Kamlet, Rodrigue Chemaly, Amandine Klipfel, Patrick Pessaux, Cecile Brigand, Serge Rohr, Nicolas Carrère, Chiara Da Re, Frédéric Dumont, Diane Goéré, Dominique Elias, Claude Bertrand, Imperial College London, Centre de Recherche Jean-Pierre AUBERT Neurosciences et Cancer - U1172 Inserm - U837 (JPArc), Université Lille Nord de France (COMUE)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lille, Hôpital Claude Huriez [Lille], CHU Lille, Hôpital Edouard Herriot [CHU - HCL], Hospices Civils de Lyon (HCL), Site de Recherche Intégrée en Cancérologie (SIRIC-ONCOLille), Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-Centre Régional de Lutte contre le Cancer Oscar Lambret [Lille] (UNICANCER/Lille), Université de Lille-UNICANCER-Université de Lille-UNICANCER-Cancéropole Nord-Ouest-Université de Lille, Droit et Santé-Centre Hospitalier Régional Universitaire [Lille] (CHRU Lille), Service de Biostatistiques [CHRU Lille], Centre Hospitalier Régional Universitaire [Lille] (CHRU Lille), Service de Chirurgie Générale et Viscérale (CGV - BREST), Université de Brest (UBO)-Centre Hospitalier Régional Universitaire de Brest (CHRU Brest), Chirurgie digestive et hépatobiliaire, CHU Estaing [Clermont-Ferrand], CHU Clermont-Ferrand-CHU Clermont-Ferrand, Peuplements végétaux et bioagresseurs en milieu tropical (UMR PVBMT), Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut de Recherche pour le Développement (IRD)-Institut National de la Recherche Agronomique (INRA)-Université de La Réunion (UR), Hôpital Côte de Nacre [CHU Caen], CHU Caen, Normandie Université (NU)-Tumorothèque de Caen Basse-Normandie (TCBN)-Normandie Université (NU)-Tumorothèque de Caen Basse-Normandie (TCBN), Hôpital de Hautepierre [Strasbourg], Service de Chirurgie Hépatobiliaire et Digestive [Rennes] = Hepatobiliary and Digestive Surgery [Rennes], CHU Pontchaillou [Rennes], Service de chirurgie digestive, CHU Bordeaux [Bordeaux], Ingénierie des Matériaux Polymères (IMP), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet [Saint-Étienne] (UJM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS), CIC-IT Bordeaux, Université de Bordeaux (UB)-CHU Bordeaux [Bordeaux]-Institut National de la Santé et de la Recherche Médicale (INSERM), Université de Brest (UBO), Département de chirurgie digestive, CHU Clermont-Ferrand, Centre de recherche sur l'Inflammation (CRI (UMR_S_1149 / ERL_8252 / U1149)), Université Paris Diderot - Paris 7 (UPD7)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS), Hôpital Louis Mourier - AP-HP [Colombes], Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP), Service de Chirurgie Générale et Digestive[Lille], Université de Lille, Droit et Santé-Centre Hospitalier Régional Universitaire [Lille] (CHRU Lille), Service de Chirurgie digestive, endocrinienne et générale [CHU Limoges], CHU Limoges, Homéostasie Cellulaire et Pathologies (HCP), Université de Limoges (UNILIM)-CHU Limoges-Génomique, Environnement, Immunité, Santé, Thérapeutique (GEIST FR CNRS 3503), Université Pierre et Marie Curie - Paris 6 - UFR de Médecine Pierre et Marie Curie (UPMC), Université Pierre et Marie Curie - Paris 6 (UPMC), Hôpital de la Croix-Rousse [CHU - HCL], Hospices Civils de Lyon (HCL)-Hospices Civils de Lyon (HCL), Unité de Chirurgie Colorectale, CHU Grenoble, Environnement Ville Société (EVS), École normale supérieure - Lyon (ENS Lyon)-École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet [Saint-Étienne] (UJM)-École Nationale des Travaux Publics de l'État (ENTPE)-École nationale supérieure d'architecture de Lyon (ENSAL)-Centre National de la Recherche Scientifique (CNRS), Unité de Méthodologie en Recherche Clinique, Université de Lyon-Université de Lyon-Hospices Civils de Lyon (HCL), Centre Hospitalier Lyon Sud [CHU - HCL] (CHLS), Centre de recherche en éducation de Nantes (CREN), Le Mans Université (UM)-Université de Nantes - UFR Lettres et Langages (UFRLL), Université de Nantes (UN)-Université de Nantes (UN), Centre de Recherche en Automatique de Nancy (CRAN), Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Centre Hospitalier Régional Universitaire de Nancy (CHRU Nancy), Nutrition-Génétique et Exposition aux Risques Environnementaux (NGERE), Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), Chelsea and Westminster Hospital, Service de Chirurgie Thoracique (NICE - Chirurgie Thoracique), Centre Hospitalier Universitaire de Nice (CHU Nice), West University of Timișoara [Roumanie] (WUT), Service de Chirurgie thoracique, Centre Hospitalier Universitaire de Nîmes (CHU Nîmes), Lab-STICC_UBS_CID_DECIDE, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (UMR 3192) (Lab-STICC), Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Centre National de la Recherche Scientifique (CNRS), Service d'hépato-gastro-entérologie [APHP Henri Mondor], Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Hôpital Henri Mondor-Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12), Service d'Endocrinologie, Métabolisme et Prévention des Maladies Cardio-vasculaires [CHU Pitié-Salpêtrière], CHU Pitié-Salpêtrière [AP-HP], Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Sorbonne Université (SU)-Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Sorbonne Université (SU), Laboratoire de Mathématiques Informatique et Applications (LAMIA), Université des Antilles et de la Guyane (UAG), Service de Chirurgie Digestive, Hépato-Bilio-pancréatique et Transplantation Hépatique [CHU Pitié-Salpétrière], Department of Gastroenterological Surgery, Hôpital Lariboisière-Fernand-Widal [APHP], Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP), Carcinose Angiogenèse et Recherche Translationnelle, Angiogenese et recherche translationnelle (CART U965), Université Paris Diderot - Paris 7 (UPD7)-Institut National de la Santé et de la Recherche Médicale (INSERM), Service de Chirurgie Digestive, Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Hôpital Lariboisière-Fernand-Widal [APHP], Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Université Paris Diderot - Paris 7 (UPD7), Service de chirurgie générale et digestive [CHU Saint-Antoine], Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-CHU Saint-Antoine [AP-HP], Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Sorbonne Université (SU)-Sorbonne Université (SU), Centre de Recherche Saint-Antoine (UMRS893), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de la Santé et de la Recherche Médicale (INSERM), Centre Hospitalier Régional Universitaire [Montpellier] (CHRU Montpellier), Institut Mutualiste de Montsouris (IMM), Departement medico-chirurgical de pathologie digestive, Chirurgie digestive, Centre Hospitalier Universitaire de Saint-Etienne, Départment de Statistiques Bio-médicales, Centre Hospitalier Universitaire d'Angers (CHU Angers), PRES Université Nantes Angers Le Mans (UNAM)-PRES Université Nantes Angers Le Mans (UNAM), Service de chirurgie digestive [Strasbourg-Hautepierre], Département de chirurgie générale [Gustave Roussy], Institut Gustave Roussy (IGR), R&D, centre de Fresnes, Pfizer, Institut National de la Santé et de la Recherche Médicale (INSERM)-Université Lille Nord de France (COMUE)-Université de Lille, Université Lille Nord de France (COMUE)-UNICANCER-Université Lille Nord de France (COMUE)-UNICANCER-Cancéropole Nord-Ouest-Université de Lille, Droit et Santé-Centre Hospitalier Régional Universitaire [Lille] (CHRU Lille), Service de biostatistiques [CHU Lille], Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université Jean Monnet [Saint-Étienne] (UJM)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon, Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Centre National de la Recherche Scientifique (CNRS), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12)-Hôpital Henri Mondor-Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP), Service d’Endocrinologie, Métabolisme et Prévention des Risques Cardio-Vasculaires [CHU Pitié-Salpêtrière], ONERA - The French Aerospace Lab [Châtillon], ONERA-Université Paris Saclay (COmUE), Centre de recherche Jean-Pierre Aubert-Neurosciences et Cancer, Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lille, Droit et Santé, Hôpital Claude Huriez, Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-CRLCC Oscar Lambret-Cancéropole Nord-Ouest-Université de Lille, Droit et Santé-Centre Hospitalier Régional Universitaire [Lille] (CHRU Lille), Centre Hospitalier Universitaire Estaing, UMR Peuplement Végétaux et Bioagresseurs en Milieu Tropical (UMR PVBMT - INRA), Institut National de la Recherche Agronomique (INRA), Service de Chirurgie Hépatobiliaire et Digestive, Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Hôpital Pontchaillou-CHU Pontchaillou [Rennes], Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet [Saint-Étienne] (UJM)-Centre National de la Recherche Scientifique (CNRS), CHU Bordeaux [Bordeaux]-Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Bordeaux (UB), Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Diderot - Paris 7 (UPD7), Hopital Louis Mourier - AP-HP [Colombes], École normale supérieure - Lyon (ENS Lyon)-Université Lumière - Lyon 2 (UL2)-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université de Lyon-Université Jean Monnet [Saint-Étienne] (UJM)-École Nationale des Travaux Publics de l'État (ENTPE)-École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-École nationale supérieure d'architecture de Lyon (ENSAL)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA), Université de Lorraine (UL)-Institut National de la Santé et de la Recherche Médicale (INSERM), West University of Timisoara [Roumanie] (UVT), Centre Hospitalier Régional Universitaire de Nîmes (CHRU Nîmes), Assistance publique - Hôpitaux de Paris (AP-HP) (APHP)-Hôpital Henri Mondor-Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12), Service d'endocrinologie-métabolisme [CHU Pitié-Salpêtrière], Assistance publique - Hôpitaux de Paris (AP-HP) (APHP)-CHU Pitié-Salpêtrière [APHP], Service de chirurgie digestive et hépato-bilio-pancréatique [CHU Pitié-Salpétrière], Hôpital Lariboisière, Assistance publique - Hôpitaux de Paris (AP-HP) (APHP)-Hôpital Lariboisière-Université Paris Diderot - Paris 7 (UPD7), Assistance publique - Hôpitaux de Paris (AP-HP) (APHP)-CHU Saint-Antoine [APHP], Centre de Recherche Saint-Antoine (CR Saint-Antoine), ONERA, Institut National de la Santé et de la Recherche Médicale (INSERM)-Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Université de Limoges (UNILIM)-Génomique, Environnement, Immunité, Santé, Thérapeutique (GEIST FR CNRS 3503)-CHU Limoges, Centre de Recherche Jean-Pierre AUBERT Neurosciences et Cancer - U837 (JPArc), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS), Environnement, Ville, Société (EVS), École normale supérieure de Lyon (ENS de Lyon)-École des Mines de Saint-Étienne (Mines Saint-Étienne MSE), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-École Nationale des Travaux Publics de l'État (ENTPE)-École nationale supérieure d'architecture de Lyon (ENSAL)-Centre National de la Recherche Scientifique (CNRS), Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Sorbonne Université (SU), CHU Saint-Antoine [AP-HP], Centre Hospitalier Universitaire de Saint-Etienne [CHU Saint-Etienne] (CHU ST-E), Service de Chirurgie Hépatobiliaire et Digestive [Rennes], Sorbonne Université-Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Sorbonne Université-Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP), Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-CHU Pitié-Salpêtrière [AP-HP], Sorbonne Université-Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Sorbonne Université, Assistance publique - Hôpitaux de Paris (AP-HP) (AP-HP)-Sorbonne Université-Sorbonne Université, Institut National de la Santé et de la Recherche Médicale ( INSERM ) -Université de Lille, Droit et Santé, Université de Lille, Droit et Santé-Centre Hospitalier Régional Universitaire [Lille] ( CHRU Lille ), Hospices Civils de Lyon ( HCL ), Site de Recherche Intégrée en Cancérologie ( SIRIC-ONCOLille ), Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-CRLCC Oscar Lambret-Cancéropole Nord-Ouest-Université de Lille, Droit et Santé-Centre Hospitalier Régional Universitaire [Lille] ( CHRU Lille ), Centre Hospitalier Régional Universitaire [Lille] ( CHRU Lille ), Service de Chirurgie Générale et Viscérale ( CGV - BREST ), Centre Hospitalier Régional Universitaire de Brest ( CHRU Brest ) -Université de Brest ( UBO ), UMR Peuplement Végétaux et Bioagresseurs en Milieu Tropical ( UMR PVBMT - INRA ), Institut National de la Recherche Agronomique ( INRA ), Hôpital de la Côte de Nacre, Université de Rennes 1 ( UR1 ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Hôpital Pontchaillou-CHU Pontchaillou [Rennes], Ingénierie des Matériaux Polymères - Site Université Claude Bernard Lyon 1 ( IMP ), Université Claude Bernard Lyon 1 ( UCBL ), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon ( INSA Lyon ), Université de Lyon-Institut National des Sciences Appliquées ( INSA ) -Institut National des Sciences Appliquées ( INSA ) -Université Jean Monnet [Saint-Étienne] ( UJM ) -Centre National de la Recherche Scientifique ( CNRS ), CHU Bordeaux [Bordeaux]-Institut National de la Santé et de la Recherche Médicale ( INSERM ) -Université de Bordeaux ( UB ), Université de Brest ( UBO ), Centre de recherche sur l'Inflammation ( CRI ), Université Paris Diderot - Paris 7 ( UPD7 ) -Institut National de la Santé et de la Recherche Médicale ( INSERM ) -Centre National de la Recherche Scientifique ( CNRS ), Homéostasie Cellulaire et Pathologies ( HCP ), Université de Limoges ( UNILIM ) -CHU Limoges-Génomique, Environnement, Immunité, Santé, Thérapeutique ( GEIST FR CNRS 3503 ), Université Pierre et Marie Curie - Paris 6 - UFR de Médecine Pierre et Marie Curie ( UPMC ), Université Pierre et Marie Curie - Paris 6 ( UPMC ), Hospices Civils de Lyon ( HCL ) -Hospices Civils de Lyon ( HCL ), Environnement Ville Société ( EVS ), École normale supérieure - Lyon ( ENS Lyon ) -Université Lumière - Lyon 2 ( UL2 ) -Université Jean Moulin - Lyon III-Institut National des Sciences Appliquées de Lyon ( INSA Lyon ), Université de Lyon-Institut National des Sciences Appliquées ( INSA ) -Université de Lyon-Institut National des Sciences Appliquées ( INSA ) -Université Jean Monnet [Saint-Étienne] ( UJM ) -École Nationale des Travaux Publics de l'État ( ENTPE ) -Ecole Nationale Supérieure des Mines de Saint-Etienne-École nationale supérieure d'architecture de Lyon ( ENSAL ) -Centre National de la Recherche Scientifique ( CNRS ), Université de Lyon-Université de Lyon-Hospices Civils de Lyon ( HCL ), Centre Hospitalier Lyon Sud [CHU - HCL] ( CHLS ), Centre de recherche en éducation de Nantes ( CREN ), Université de Nantes ( UN ), Centre de Recherche en Automatique de Nancy ( CRAN ), Université de Lorraine ( UL ) -Centre National de la Recherche Scientifique ( CNRS ), Centre Hospitalier Régional Universitaire de Nancy ( CHRU Nancy ), Nutrition-Génétique et Exposition aux Risques Environnementaux ( NGERE ), Université de Lorraine ( UL ) -Institut National de la Santé et de la Recherche Médicale ( INSERM ), Chelsea and Westminster Hospital NHS Foundation Trust, Service de Chirurgie Thoracique ( NICE - Chirurgie Thoracique ), CHU Nice, West University of Timisoara [Roumanie], West University of Timisoara, Centre Hospitalier Régional Universitaire de Nîmes ( CHRU Nîmes ), Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (UMR 3192) ( Lab-STICC ), Université européenne de Bretagne ( UEB ) -Université de Bretagne Sud ( UBS ) -Université de Brest ( UBO ) -Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques ( IBNM ), Université de Brest ( UBO ) -Institut Mines-Télécom [Paris]-Centre National de la Recherche Scientifique ( CNRS ) -Université européenne de Bretagne ( UEB ) -Université de Bretagne Sud ( UBS ) -Université de Brest ( UBO ) -Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques ( IBNM ), Université de Brest ( UBO ) -Institut Mines-Télécom [Paris]-Centre National de la Recherche Scientifique ( CNRS ) -Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance ( Lab-STICC ), École Nationale d'Ingénieurs de Brest ( ENIB ) -Université de Bretagne Sud ( UBS ) -Université de Brest ( UBO ) -Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques ( IBNM ), Université de Brest ( UBO ) -Université européenne de Bretagne ( UEB ) -ENSTA Bretagne-Institut Mines-Télécom [Paris]-Centre National de la Recherche Scientifique ( CNRS ) -École Nationale d'Ingénieurs de Brest ( ENIB ) -ENSTA Bretagne-Centre National de la Recherche Scientifique ( CNRS ), Assistance publique - Hôpitaux de Paris (AP-HP)-Hôpital Henri Mondor-Université Paris-Est Créteil Val-de-Marne - Paris 12 ( UPEC UP12 ), Assistance publique - Hôpitaux de Paris (AP-HP)-CHU Pitié-Salpêtrière [APHP], Laboratoire de Mathématiques Informatique et Applications ( LAMIA ), Université des Antilles et de la Guyane ( UAG ), Angiogenese et recherche translationnelle ( CART U965 ), Université Paris Diderot - Paris 7 ( UPD7 ) -Institut National de la Santé et de la Recherche Médicale ( INSERM ), Assistance publique - Hôpitaux de Paris (AP-HP)-Hôpital Lariboisière-Université Paris Diderot - Paris 7 ( UPD7 ), Assistance publique - Hôpitaux de Paris (AP-HP)-CHU Saint-Antoine [APHP], Centre de Recherche Saint-Antoine ( CR Saint-Antoine ), Université Pierre et Marie Curie - Paris 6 ( UPMC ) -Institut National de la Santé et de la Recherche Médicale ( INSERM ), Centre Hospitalier Régional Universitaire [Montpellier] ( CHRU Montpellier ), Institut Mutualiste de Montsouris ( IMM ), CHU Angers, ONERA - The French Aerospace Lab ( Chatillon ), Procédés Alimentaires et Microbiologiques [Dijon] ( PAM ), Université de Bourgogne ( UB ) -AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Université Bourgogne Franche-Comté ( UBFC ), and Institut Gustave Roussy ( IGR )
Subjects: Oncology, Subset Analysis, Cancer Research, medicine.medical_specialty, Neoadjuvant treatment, Survival, medicine.medical_treatment, [SDV]Life Sciences [q-bio], [SDV.CAN]Life Sciences [q-bio]/Cancer, [ SDV.CAN ] Life Sciences [q-bio]/Cancer, 03 medical and health sciences, 0302 clinical medicine, Internal medicine, medicine, Neoadjuvant therapy, [ SDV ] Life Sciences [q-bio], business.industry, Oesophageal cancer, Carcinoma, Phase-III Trial, Cancer, Retrospective cohort study, Chemoradiotherapy, cT2N0M0, medicine.disease, Resection, 3. Good health, Postoperative Mortality, Esophagectomy, 030220 oncology & carcinogenesis, Propensity score matching, Adenocarcinoma, 030211 gastroenterology & hepatology, Surgery, Therapy, business
Abstract: International audience; Aims: The aims of this study were to compare short-and long-term outcomes for clinical T2N0 oesophageal cancer with analysis of (i) primary surgery (S) versus neoadjuvant therapy plus surgery (NS), (ii) squamous cell carcinoma and adenocarcinoma subsets; and (iii) neoadjuvant chemoradiotherapy versus neoadjuvant chemotherapy.Methods: Data were collected from 30 European centres from 2000 to 2010. Among 2944 included patients, 355 patients (12.1%) had cT2N0 disease; 285 (S) and 70 (NS), were compared in terms of short-and long-term outcomes. Propensity score matching analyses were used to compensate for differences in baseline characteristics.Results: No significant differences between the groups were shown in terms of in hospital morbidity and mortality. Nodal disease was observed in 50% of S-group at the time of surgery, with 20% pN2/N3. Utilisation of neoadjuvant therapy was associated with significant tumour downstaging as reflected by increases in pT0, pN0 and pTNM stage 0 disease, this effect was further enhanced with neoadjuvant chemoradiotherapy. After adjustment on propensity score and confounding factors, for all patients and subset analysis of squamous cell and adenocarcinoma, neoadjuvant therapy had no significant effect upon survival or recurrence (overall, loco-regional, distant or mixed) compared to surgery alone. There were no significant differences between neoadjuvant chemotherapy and chemoradiotherapy in short-or long-term outcomes.Conclusion: The results of this study suggest that a surgery alone treatment approach should be recommended as the primary treatment approach for cT2N0 oesophageal cancer despite 50% of patients having nodal disease at the time of surgery.
Published: 2016

164. Head Yaw Estimation using Frontal Face Detector

Author: José Mennesson, Afifa Dahmane, Ioan Marius Bilasco, Taner Danisman, 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), FOX MIIRE (LIFL), 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), Université de Lille, Sciences et Technologies, Laboratoire de Recherche en Intelligence Artificielle [Alger] (LRIA), Université des Sciences et de la Technologie Houari Boumediene [Alger] (USTHB), Akdeniz University, and Université des Sciences et de la Technologie Houari Boumediene = University of Sciences and Technology Houari Boumediene [Alger] (USTHB)
Subjects: business.industry, Computer science, Face (geometry), Detector, Head (vessel), [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], Computer vision, Artificial intelligence, business, ComputingMilieux_MISCELLANEOUS
Abstract: International audience
Published: 2016

165. Offshoring and labour market reforms in Germany: Assessment and policy implications

Author: Joël Hellier, Thomas Beissinger, Nathalie Chusseau, Economie Quantitative, Intégration, Politiques Publiques et Econométrie (EQUIPPE), Université de Lille, Droit et Santé-PRES Université Lille Nord de France-Université de Lille, Sciences Humaines et Sociales-Université de Lille, Sciences et Technologies, Lille économie management - UMR 9221 (LEM), Université d'Artois (UA)-Université catholique de Lille (UCL)-Université de Lille-Centre National de la Recherche Scientifique (CNRS), and Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-PRES Université Lille Nord de France-Université de Lille, Droit et Santé
Subjects: Economics and Econometrics, Labour economics, General equilibrium theory, Inequality, media_common.quotation_subject, German, Labour market policy, Offshoring, Germany, 0502 economics and business, Economics, 050207 economics, Low skilled, 050205 econometrics, media_common, 05 social sciences, [SHS.ECO]Humanities and Social Sciences/Economics and Finance, language.human_language, Competitiveness, Reservation wage, Unemployment, 8. Economic growth, language, Developed country
Abstract: International audience; Starting from the diagnosis that Germany has had better economic outcomes than most advanced countries since the mid-2000s, we propose a general equilibrium model to answer the following two questions: Why is it so and is the German experience applicable to other EU countries? Whereas a large number of observers explain German competitiveness by the labour market reforms implemented from 2003 to 2005 (Hartz laws), we suggest that (i) the gains in competitiveness are essentially due to offshoring and (ii) the labour market reforms have subsequently reduced the offshoring-related unemployment by decreasing the reservation wage, creating thereby low skilled jobs in non-tradable services. These reforms have also reinforced inequality already generated by offshoring. In contrast with the traditional explanation based on the Hartz reforms, our model findings and simulations fit well with the sequence of observed facts. This experience could be extended to other EU countries, but with higher cost and lower efficiency. Finally, as the reduction in unemployment is based on the extension of non-tradable services, we suggest alternative policies that reach the same goal without increasing inequality.
Published: 2016

166. Adaptability and Encapsulation in Dynamically-Typed Languages: Taming Reflection and Extension Methods

Author: Teruel, Camille, 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), Université des Sciences et Technologies de Lille, and Stéphane Ducasse
Subjects: conception de langage, langages dynamiquement types, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], ruby, language design, access control, controle d'acces, dynamically typed language, selecteur namespace, smalltalk, pharo, selector namespace, extensions de classes, class extensions, classboxes
Abstract: Users expect modern software to be both continually available and updated on the fly. Introduction of new features and integration of bug fixes should not trouble the smooth running of an application. Developers also benefit from dynamic mod- ifications of software, e.g. they can adapt code to new unanticipated situations or they can run dynamic analyses to get feedback about the behavior of running applications for monitoring, debugging and optimization purposes. Programming languages and their runtimes should thus provides developers with mechanisms that improve software adaptability.At the same time, the increasing size and complexity of software call for ap- plications made up of many interacting components developed by different parties. In this context, either all components are trusted or each component needs to be properly protected from other ones. For example, a plugin should not be able to manipulate the internal structures or leaks private data of its host application unre- strictedly. Likewise, a malicious library should not be able to corrupt its clients or interfere with their operations. Programming languages should thus provide devel- opers with mechanisms that improve software isolation, such as encapsulation and custom access control policies.The need for dynamic adaptations that can change nearly every aspect of an application on the one hand and the need for properly confined components on the other hand pulls programming language design in two opposite directions: ei- ther more flexibility or more control. This dissertation studies this tension in the context of dynamically-typed object-oriented languages with two language mech- anisms that promote software adaptability: reflection and extension methods. For both mechanisms, we demonstrate their usefulness, their harmful effect on encap- sulation and propose solutions to retain their power while maintaining encapsula- tion.; Les utilisateurs s’attendent à ce que les logiciels d’aujourd’hui soient à la fois con- tinuellement disponibles et mis-à-jour à la volée. L’introduction de nouvelles fonc- tionnalités et l’intégration de correctifs ne doit pas perturber la bonne marche d’une application. Les développeurs bénéficient aussi de la modification dynamique des logiciels: par exemple, ils peuvent adapter le code à de nouvelle situations non anticipées ou bien ils peuvent exécuter des analyses dynamiques pour obtenir du retour sur le comportement d’applications en cours d’exécution, et ce, à des fins de monitorage, de déboggage et d’optimisation. Les languages de programmation et leurs environments d’exécution doivent donc fournir aux développeurs des mécan- ismes qui améliorent l’adaptabilité logicielle.Dans le même temps, l’augmentation de la taille et de la complexité des logi- ciels requièrent des applications faites de nombreux composants développés par différents groupes. Dans ce contexte, soit tous les composant sont supposés dignes de confiance ou bien chaque composant doit être convenablement protégé des autres. Par exemple, un greffon logiciel ne doit pas être capable de manipuler les structures internes ou bien de divulguer les données privée de son application hôte de manière non contrôlée. De la même manière, une bibliothèque malveillante ne doit pas pouvoir corrompre ses clients ou interférer dans leurs opérations. Les lan- guages de programmation doivent donc fournir aux développeurs des mécanismes qui améliorent l’isolation logicielle, tels que l’encapsulation et des politiques de contrôle d’accès sur mesure.Le besoin de supporter des adaptations dynamiques qui peuvent change quasi- ment chaque aspect d’une application d’un côté, et le besoin d’avoir des com- posants convenablement confinés d’un autre côté, poussent la conception des lan- guages de programmation dans deux directions opposées: soit plus de flexibilité, soit plus de contrôle. Cette dissertation étudie cette tension dans le contexte des languages orientée-objet dynamiquement typés via deux mécanismes qui promeu- vent l’adaptabilité logicielle: la réflexion et les méthodes d’extension. Pour cha- cun de ces mécanismes, nous démontrons leur utilité, leurs effets néfastes sur l’encapsulation et proposons des solutions qui conservent leurs forces tout en main- tenant l’encapsulation.
Published: 2016

167. Introducing FoxFaces: A 3-in-1 Head Dataset

Author: Amel Aissaoui, Afifa Dahmane, Jean Martinet, Ioan Marius Bilasco, FOX MIIRE (LIFL), 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), Laboratoire de Recherche en Intelligence Artificielle [Alger] (LRIA), Université des Sciences et de la Technologie Houari Boumediene [Alger] (USTHB), Université de Lille, Sciences et Technologies, 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), and Université des Sciences et de la Technologie Houari Boumediene = University of Sciences and Technology Houari Boumediene [Alger] (USTHB)
Subjects: Facial expression, biometric dataset, Computer science, Head (linguistics), business.industry, Orientation (computer vision), face analysis and recognition, multimodal, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], 02 engineering and technology, Facial recognition system, Expression (mathematics), Face (geometry), expression, 0202 electrical engineering, electronic engineering, information engineering, Identity (object-oriented programming), 020201 artificial intelligence & image processing, Computer vision, Artificial intelligence, pose, business, Pose
Abstract: International audience; We introduce a new test collection named FoxFaces, dedicated to researchers in face recognition and analysis. The creation of this dataset was motivated by a lack encountered in the existing 3D/4D datasets. FoxFaces contains 3 face datasets obtained with several devices. Faces are captured with different changes in pose, expression and illumination. The presented collection is unique in two aspects: the acquisition is performed using three little constrained devices offering 2D, depth and stereo information on faces. In addition, it contains both still images and videos allowing static and dynamic face analysis. Hence, our dataset can be an interesting resource for the evaluation of 2D, 3D and bimodal algorithms on face recognition under adverse conditions as well as facial expression recognition and pose estimation algorithms in static and dynamic domains (images and videos). Stereo, color, and range images and videos of 64 adult human subjects are acquired. Acquisitions are accompanied with information about the subjects identity, gender, facial expression, approximate pose orientation and the coordinates of some manually located facial fiducial points.
Published: 2016

168. Role of neoadjuvant treatment in clinical T2N0M0 oesophageal cancer: results from a retrospective multi-center European study

Author: Markar, Sheraz, Gronnier, Caroline, Pasquer, Arnaud, Duhamel, Alain, Beal, Hélène, Thereaux, Jérémie, Gagniere, Johan, Lebreton, Gil, Brigand, Cécile, Meunier, Bernard, Collet, Denis, Mariette, Christophe, Imperial College London, Hôpital Claude Huriez, Université de Lille, Droit et Santé-Centre Hospitalier Régional Universitaire [Lille] (CHRU Lille), Hôpital Edouard Herriot [CHU - HCL], Hospices Civils de Lyon (HCL), Pôle Santé Publique, Pharmacie et Pharmacologie, Centre Hospitalier Régional Universitaire [Lille] (CHRU Lille), Site de Recherche Intégrée en Cancérologie (SIRIC-ONCOLille), Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-CRLCC Oscar Lambret-Cancéropole Nord-Ouest-Université de Lille, Droit et Santé-Centre Hospitalier Régional Universitaire [Lille] (CHRU Lille), Service de Chirurgie Générale et Viscérale (CGV - BREST), Université de Brest (UBO)-Centre Hospitalier Régional Universitaire de Brest (CHRU Brest), Groupe d'Etude de la Thrombose de Bretagne Occidentale (GETBO), Université de Brest (UBO)-Institut Brestois Santé Agro Matière (IBSAM), Université de Brest (UBO), Service Chirurgie Disgestive, Centre Hospitalier Universitaire Estaing, UMR Peuplement Végétaux et Bioagresseurs en Milieu Tropical (UMR PVBMT - INRA), Institut National de la Recherche Agronomique (INRA), Hôpital de Hautepierre [Strasbourg], CHU Pontchaillou [Rennes], Département de chirurgie digestive, CHU Bordeaux [Bordeaux], Centre Hospitalier Régional Universitaire de Brest (CHRU Brest)-Université de Brest (UBO), Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-Centre Régional de Lutte contre le Cancer Oscar Lambret [Lille] (UNICANCER/Lille), UNICANCER-Université Lille Nord de France (COMUE)-UNICANCER-Université Lille Nord de France (COMUE)-Cancéropole Nord-Ouest-Université de Lille, Droit et Santé-Centre Hospitalier Régional Universitaire [Lille] (CHRU Lille), Peuplements végétaux et bioagresseurs en milieu tropical (UMR PVBMT), and Centre de Coopération Internationale en Recherche Agronomique pour le Développement (Cirad)-Institut de Recherche pour le Développement (IRD)-Institut National de la Recherche Agronomique (INRA)-Université de La Réunion (UR)
Subjects: [SDV]Life Sciences [q-bio], [SDV.CAN]Life Sciences [q-bio]/Cancer, ComputingMilieux_MISCELLANEOUS, [SDV.MHEP]Life Sciences [q-bio]/Human health and pathology
Abstract: International audience
Published: 2016

169. Metaheuristics for Production Systems

Author: Lionel Amodeo, El-Ghazali Talbi, Farouk Yalaoui, 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), Laboratoire d'Optimisation des Systèmes Industriels (LOSI), Institut Charles Delaunay (ICD), Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Troyes (UTT)-Centre National de la Recherche Scientifique (CNRS), 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, and Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: 0209 industrial biotechnology, 020901 industrial engineering & automation, Computer science, 020209 energy, 0202 electrical engineering, electronic engineering, information engineering, Production (economics), 02 engineering and technology, Biochemical engineering, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Metaheuristic, ComputingMilieux_MISCELLANEOUS
Abstract: International audience; This book discusses the main techniques and newest trends to manage and optimize the production and service systems. The book begins by examining the three main levels of decision systems in production: the long term (strategic), the middle term (tactical) and short term (operational). It also considers online management as a new level (a sub level of the short term). As each level encounters specific problems, appropriate approaches to deal with these are introduced and explained. These problems include the line design, the line balancing optimization, the physical layout of the production or service system, the forecasting optimization, the inventory management, the scheduling etc.Metaheuristics for Production Systems then explores logistic optimization from two different perspectives: internal (production management), addressing issues of scheduling, layout and line designs, and external (supply chain management) focusing on transportation optimization, supply chain evaluation, and location of production. The book also looks at NP-hard problems that are common in production management. These complex configurations may mean that optimal solutions may not be reached due to variables, but the authors help provide a good solution for such problems. The effective new results and solutions offered in this book should appeal to researchers, managers, and engineers in the production and service industries.
Published: 2016

170. Effect of Political Orientation on Judgment of Agency, Competence, Morality, and Sociability: The French Presidential Election of 2012

Author: Astrid Mignon, Céline Bagès, Patrick Mollaret, Odile Rohmer, Unité de Recherche en Sciences Cognitives et Affectives (URECA), Université de Lille, Sciences Humaines et Sociales-PRES Université Lille Nord de France, Laboratoire Parisien de Psychologie Sociale (LAPPS), Université Paris 8 Vincennes-Saint-Denis (UP8)-Université Paris Nanterre (UPN), PRES Université Lille Nord de France-Université de Lille, Sciences Humaines et Sociales, Sciences Cognitives et Sciences Affectives (SCALab) - UMR 9193 (SCALab), Université de Lille-Centre National de la Recherche Scientifique (CNRS), Université Paris Nanterre (UPN)-Université Paris 8 Vincennes-Saint-Denis (UP8), Laboratoire de Psychologie des Cognitions (LPC), Université de Strasbourg (UNISTRA), Psychologie : Interactions, Temps, Emotions, Cognition (PSITEC) - ULR 4072 (PSITEC), Université de Lille, and Laboratoire Sciences Cognitives et Sciences Affectives - UMR 9193 (SCALab)
Subjects: Presidential election, media_common.quotation_subject, 05 social sciences, [SHS.PSY]Humanities and Social Sciences/Psychology, 050109 social psychology, 16. Peace & justice, Morality, 050105 experimental psychology, Biology and political orientation, [SHS]Humanities and Social Sciences, [SCCO]Cognitive science, Political Candidates, 0501 psychology and cognitive sciences, Psychology, Social psychology, Competence (human resources), General Psychology, media_common
Abstract: Abstract. This study tested the effect of voter’s political orientation on the importance they placed on agency, competence, morality, and sociability as qualities required for being President of the French Republic. It furthermore assessed the participants’ judgments of the five main candidates of the French Presidential Election of 2012 on those dimensions. The results showed that, compared to left-wing voters, right-wing voters placed greater importance on agency and less importance on morality and sociability as qualities required for being president. Right-wing voters differentiated between candidates with respect to agency more than competence, whereas the reverse pattern was observed for left-wing voters. Voters differentiated between candidates with respect to morality as much as sociability. Finally, the participants’ ratings of candidates showed a partisan effect: Left-wing voters rated left-wing candidates as being more competent, moral, and sociable, the same being true of right-wing candidates by right-wing voters. Ratings of candidates’ agentic qualities were less dependent on the voter’s political orientation. These data provide support for how people perceived qualities necessary for being President in France.
Published: 2016

171. Nonparametric multiple change point estimation in highly dependent time series

Author: Daniil Ryabko, Azadeh Khaleghi, Department of Mathematics & Statistics [Lancaster], Lancaster University, Sequential Learning (SEQUEL), 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), 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)-Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS), Université de Lille, Sciences et Technologies-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-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)-Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS), Université de Lille, Sciences et Technologies-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-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, General Computer Science, Series (mathematics), Nonparametric statistics, 020206 networking & telecommunications, Sample (statistics), 02 engineering and technology, [STAT.TH]Statistics [stat]/Statistics Theory [stat.TH], Stationary ergodic process, 01 natural sciences, Theoretical Computer Science, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], 010104 statistics & probability, Mixing (mathematics), [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], 0202 electrical engineering, electronic engineering, information engineering, Applied mathematics, Probability distribution, Ergodic theory, Point estimation, 0101 mathematics, Independence (probability theory), Mathematics
Abstract: International audience; Given a heterogeneous time-series sample, the objective is to find points in time, called change points, where the probability distribution generating the data has changed. The data are assumed to have been generated by arbitrary unknown stationary ergodic distributions. No modelling, independence or mixing assumptions are made. A novel, computationally efficient, nonparametric method is proposed, and is shown to be asymptotically consistent in this general framework. The theoretical results are complemented with experimental evaluations.
Published: 2016

172. Faster Evaluation of SBoxes via Common Shares

Author: Rina Zeitoun, Jean-Sébastien Coron, Aurélien Greuet, Emmanuel Prouff, Université du Luxembourg (Uni.lu), Calcul Formel (CALFOR), 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), Laboratoire de Mathématiques de Versailles (LMV), Université de Versailles Saint-Quentin-en-Yvelines (UVSQ)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS), Oberthur Card Systems - Puteaux, Oberthur Card Systems, Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Polynomial Systems (PolSys), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de cryptographie de l'ANSSI (LCR), Agence nationale de la sécurité des systèmes d'information (ANSSI), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Inria de Paris, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Computer science [C05] [Engineering, computing & technology], 060201 languages & linguistics, Masking countermeasure, Order (ring theory), 06 humanities and the arts, 02 engineering and technology, Sciences informatiques [C05] [Ingénierie, informatique & technologie], [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Finite field, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], 0602 languages and literature, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, 020201 artificial intelligence & image processing, Side channel attack, Algorithm, Mathematics, Block cipher
Abstract: International audience; We describe a new technique for improving the efficiency of the masking countermeasure against side-channel attacks. Our technique is based on using common shares between secret variables, in order to reduce the number of finite field multiplications. Our algorithms are proven secure in the ISW probing model with n t + 1 shares against t probes. For AES, we get an equivalent of 2.8 non-linear multiplications for every SBox evaluation, instead of 4 in the Rivain-Prouff countermeasure. We obtain similar improvements for other block-ciphers. Our technique is easy to implement and performs relatively well in practice, with roughly a 20% speed-up compared to existing algorithms.
Published: 2016

173. Crossed views of burden and emotional distress of cancer patients and family caregivers during palliative care

Author: Leroy, Tanguy, Fournier, Emmanuelle, Penel, Nicolas, Christophe, Véronique, Greps, Laboratoire, Groupe de Recherche en Psychologie Sociale (GRePS), Université Lumière - Lyon 2 (UL2), Laboratoire Sciences Cognitives et Sciences Affectives - UMR 9193 (SCALab), Université de Lille-Centre National de la Recherche Scientifique (CNRS), Centre Régional de Lutte contre le Cancer Oscar Lambret [Lille] (UNICANCER/Lille), Université de Lille-UNICANCER, Site de Recherche Intégrée en Cancérologie (SIRIC-ONCOLille), Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-Centre Régional de Lutte contre le Cancer Oscar Lambret [Lille] (UNICANCER/Lille), Université de Lille-UNICANCER-Université de Lille-UNICANCER-Cancéropole Nord-Ouest-Université de Lille, Droit et Santé-Centre Hospitalier Régional Universitaire [Lille] (CHRU Lille), Unité de Recherche en Sciences Cognitives et Affectives (URECA), Université de Lille, Sciences Humaines et Sociales-PRES Université Lille Nord de France, Sciences Cognitives et Sciences Affectives (SCALab) - UMR 9193 (SCALab), Université Lille Nord de France (COMUE)-UNICANCER, and Université Lille Nord de France (COMUE)-UNICANCER-Université Lille Nord de France (COMUE)-UNICANCER-Cancéropole Nord-Ouest-Université de Lille, Droit et Santé-Centre Hospitalier Régional Universitaire [Lille] (CHRU Lille)
Subjects: [SHS.PSY] Humanities and Social Sciences/Psychology, caregiver burden, emotional distress, palliative care, Health, self-perceived burden, oncology, cancer, [SHS.PSY]Humanities and Social Sciences/Psychology, social psychology
Abstract: International audience; Objective. Studies regarding natural caregivers’ burden (CB) in palliative situations, as well as its determinants and consequences, have been numerous during the last twenty years. Yet, studies regarding how terminally-ill cancer patients perceive their caregivers’ burden (self-perceived burden, SPB) are less common. This study aims to assess the links between CB and SPB evaluated by means of the very same items. It also aims at identifying the determinants of potential differences between CB and SPB and their consequences on emotional distress among both members of the dyad.Methods. Sixty cancer patients from a palliative care unit and their principal natural caregiver completed questionnaires concerning the subjective burden of the caregiver, their own personal emotional distress and that of the other member of the dyad.Results. Globally, patients had a good perception of their caregivers’ burden, although a little overestimated, except for their difficulties in managing their time. Caregivers overestimated patients’ distress. The minimisation by patients of caregivers’ burden was a source of emotional distress for the latter, and the perception of being a burden to others was a source of depression for patients. These results did not depend on the nature of the relationship between patients and their caregivers.Conclusions. This data confirmed the need to study the experiences of the patient-caregiver dyad as well as their communication of their respective experiences, with a prospect to offer clinical interventions to optimise the quality of life and health of patients and their close relatives.
Published: 2016

174. Biobjective Performance Assessment with the COCO Platform

Author: Brockhoff, Dimo, Tušar, Tea, Tusar, Dejan, Wagner, Tobias, Hansen, Nikolaus, Auger, Anne, Hansen, Nikolaus, Modèles Numériques - Analyse, Amelioration, Evaluation d'algorithmes numériques pour l'optimisation boîte-noire - - NumBBO2012 - ANR-12-MONU-0009 - MN - VALID, 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), Technische Universität Dortmund [Dortmund] (TU), 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), ANR-12-MONU-0009,NumBBO,Analyse, Amelioration, Evaluation d'algorithmes numériques pour l'optimisation boîte-noire(2012), 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: FOS: Computer and information sciences, bepress|Physical Sciences and Mathematics|Computer Sciences, [INFO.INFO-NE] Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], Computer Science - Neural and Evolutionary Computing, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE], [INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA], [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-MS] Computer Science [cs]/Mathematical Software [cs.MS], [INFO.INFO-PF] Computer Science [cs]/Performance [cs.PF], [INFO.INFO-NA] Computer Science [cs]/Numerical Analysis [cs.NA], Neural and Evolutionary Computing (cs.NE), [INFO.INFO-MS]Computer Science [cs]/Mathematical Software [cs.MS]
Abstract: ArXiv e-prints, arXiv:1605.01746; This document details the rationales behind assessing the performance of numerical black-box optimizers on multi-objective problems within the COCO platform and in particular on the biobjective test suite bbob-biobj. The evaluation is based on a hypervolume of all non-dominated solutions in the archive of candidate solutions and measures the runtime until the hypervolume value succeeds prescribed target values.
Published: 2016

175. SALOON: a platform for selecting and configuring cloud environments

Author: Quinton, Clément, Romero, Daniel, Duchien, Laurence, 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), Self-adaptation for distributed services and large software systems (SPIRALS), 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), Université de Lille, Sciences et Technologies, European Project: 317715,EC:FP7:ICT,FP7-ICT-2011-8,PAASAGE(2012), 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)-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é Lille Nord de France (COMUE)
Subjects: software product line, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], cloud computing, [INFO]Computer Science [cs], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], feature modeling, model driven engineering
Abstract: International audience; Migrating legacy systems or deploying a new application to a cloud environment has recently become very trendy, because the number of cloud providers available is still increasing. These cloud environments provide a wide range of resources at different levels of functionality, which must be appropriately configured by stakeholders for the application to run properly. Handling this variability during the configuration and deployment stages is known as a complex and error-prone process, usually made in an ad hoc manner. In this paper, we propose SALOON, a software product lines-based platform to face these issues. We describe the architecture of the SALOON platform, which relies on feature models combined with a domain model used to select among cloud environments a well-suited one. SALOON supports stakeholders while configuring the selected cloud environment in a consistent way and automates the deployment of such configurations through the generation of executable configuration scripts. This paper also reports on some experiments, showing that using SALOON significantly reduces time to configure a cloud environment compared with a manual approach and provides a reliable way to find a correct and suitable configuration. Moreover, our empirical evaluation shows that our approach is effective and scalable to properly deal with a significant number of cloud environments.
Published: 2016

176. Interactive Training System for Interventional Electrocardiology Procedures

Author: Stéphane Cotin, Christian Duriez, Hervé Delingette, Hugo Talbot, Maxime Sermesant, Federico Spadoni, Computational Anatomy and Simulation for Medicine (MIMESIS), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS), Analysis and Simulation of Biomedical Images (ASCLEPIOS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Deformable Robots Simulation Team (DEFROST ), 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), SOFA, European Project: 291080,EC:FP7:ERC,ERC-2011-ADG_20110209,MEDYMA(2012), 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, and Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Endovascular Navigation, Real-Time Electrophysiology, Cardiac electrophysiology, Computer science, medicine.medical_treatment, Training system, Cardiac arrhythmia, Interactive Simulation, Training Simulator, medicine.disease, Ablation, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Training System, Electrophysiology, Catheter, Human–computer interaction, Heart failure, medicine, Simulation, Radio-Frequency Ablation, Arrhythmia, Cardiac catheterization
Abstract: International audience; Recent progress in cardiac catheterization and devices has allowed the development of new therapies for severe cardiac diseases like arrhythmias and heart failure. The skills required for such interventions are very challenging to learn, and are typically acquired over several years. Virtual reality simulators may reduce this burden by allowing trainees to practice such procedures without risk to patients. In this paper, we propose the first training system dedicated to cardiac electrophysiology, including pacing and ablation procedures. Our framework involves the simulation of a catheter navigation that reproduces issues intrinsic to intra-cardiac catheterization, and a graphics processing unit (GPU)-based electrophysiological model. A multi-threading approach is proposed to compute both physical simulations (navigation and electrophysiology) asynchronously. With this method, we reach computational performances that account for user interactions in real-time. Based on a scenario of cardiac arrhythmia, we demonstrate the ability of the user-guided simulator to navigate inside vessels and cardiac cavities with a catheter and to reproduce an ablation procedure involving: extra-cellular potential measurements, endocardial surface reconstruction, electrophysiol-ogy mapping, radio-frequency (RF) ablation, as well as electrical stimulation. A clinical evaluation assessing the different aspects of the simulation is presented. This works is a step towards computerized medical learning curriculum.
Published: 2016

177. Mining closed patterns in relational, graph and network data

Author: Roni Khardon, Gemma C. Garriga, Luc De Raedt, 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), Tufts University [Medford], Department of Computer Science [Leuven] (CS), Catholic University of Leuven - Katholieke Universiteit Leuven (KU Leuven), and Roni Khardon was partly supported by NSF Grant IIS-0099446, and by a Research Semester Fellowship Award from Tufts University. Luc De Raedt was partly supported by the EU IST FET project IQ.
Subjects: Closed relational patterns, Computer science, Efficient algorithm, Generalization, Relational database, Applied Mathematics, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Complex system, Network data, Relational graph, 02 engineering and technology, Relational data, computer.software_genre, Graph, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Artificial Intelligence, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Data mining, Networks, Graphs, computer, Algorithms
Abstract: Recent theoretical insights have led to the introduction of efficient algorithms for mining closed item-sets. This paper investigates potential generalizations of this paradigm to mine closed patterns in relational, graph and network databases. Several semantics and associated definitions for closed patterns in relational data have been introduced in previous work, but the differences among these and the implications of the choice of semantics was not clear. The paper investigates these implications in the context of generalizing the LCM algorithm, an algorithm for enumerating closed item-sets. LCM is attractive since its run time is linear in the number of closed patterns and since it does not need to store the patterns output in order to avoid duplicates, further reducing memory signature and run time. Our investigation shows that the choice of semantics has a dramatic effect on the properties of closed patterns and as a result, in some settings a generalization of the LCM algorithm is not possible. On the other hand, we provide a full generalization of LCM for the semantic setting that has been previously used by the Claudien system. ispartof: Annals of Mathematics and Artificial Intelligence vol:69 issue:4 pages:315-342 status: published
Published: 2012

178. Hierarchical branch and bound algorithm for computational grids

Author: Ahcene Bendjoudi, Nouredine Melab, El-Ghazali Talbi, Centre de recherche sur l'Information Scientifique et Technique (CERIST), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), 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, and Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Hierarchical master/worker, Computer Networks and Communications, Computer science, 0211 other engineering and technologies, 02 engineering and technology, Parallel computing, computer.software_genre, Bottleneck, Large scale experiments, 0202 electrical engineering, electronic engineering, information engineering, Parallel branch and bound, 021103 operations research, Job shop scheduling, Hierarchy (mathematics), Branch and bound, Master/worker, Process (computing), [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Grid, Grid computing, Hardware and Architecture, Scalability, 020201 artificial intelligence & image processing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], computer, Software
Abstract: International audience; Branch and Bound (B&B) algorithms are efficiently used for exact resolution of combinatorial optimization problems (COPs). They are easy to parallelize using the Master/Worker paradigm (MW) but limited in scalability when solving large instances of COPs on large scale environments such as computational grids. Indeed, the master process rapidly becomes a bottleneck. In this paper, we propose a new approach H-B&B for parallel B&B based on a hierarchical MW paradigm in order to deal with the scalability issue of the traditional MW-based B&B. The hierarchy is built dynamically and evolves over time according to the dynamic acquisition of computing nodes. The inner nodes of the hierarchy (masters) perform branching operations to generate sub-trees and the leaves (workers) perform a complete exploration of these sub-trees. Therefore, in addition to the parallel exploration of sub-trees, a parallel branching is adopted. H-B&B is applied to the Flow-Shop scheduling problem. Unlike most existing grid-based B&B algorithms, H-B&B has been experimented on a real computational grid (Grid’5000). The results demonstrate the scalability and efficiency of H-B&B.
Published: 2012

179. Uniform hypothesis testing for finite-valued stationary processes

Author: Daniil Ryabko, Sequential Learning (SEQUEL), 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)-Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS), Université de Lille, Sciences et Technologies-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-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-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)-Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS), and Université de Lille, Sciences et Technologies-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)
Subjects: Statistics and Probability, Property testing, property testing, 02 engineering and technology, Type (model theory), Stationary ergodic process, 01 natural sciences, Combinatorics, 010104 statistics & probability, Mixing (mathematics), [MATH.MATH-ST]Mathematics [math]/Statistics [math.ST], hypothesis testing, 0202 electrical engineering, electronic engineering, information engineering, Uniform boundedness, Ergodic theory, 0101 mathematics, ergodic time series, Independence (probability theory), Mathematics, [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], 020206 networking & telecommunications, [STAT.TH]Statistics [stat]/Statistics Theory [stat.TH], 16. Peace & justice, Distribution (mathematics), [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], stationary processes, Statistics, Probability and Uncertainty
Abstract: International audience; Given a discrete-valued sample $X_1,\dots,X_n$ we wish to decide whether it was generated by a distribution belonging to a family $H_0$, or it was generated by a distribution belonging to a family $H_1$. In this work we assume that all distributions are stationary ergodic, and do not make any further assumptions (e.g. no independence or mixing rate assumptions). We would like to have a test whose probability of error (both Type I and Type II) is uniformly bounded. More precisely, we require that for each $\epsilon$ there exist a sample size $n$ such that probability of error is upper-bounded by $\epsilon$ for samples longer than $n$. We find some necessary and some sufficient conditions on $H_0$ and $H_1$ under which a consistent test (with this notion of consistency) exists. These conditions are topological, with respect to the topology of distributional distance.
Published: 2012

180. Contextualizing Learning Scenarios According to Different Learning Management Systems

Author: Mona Laroussi, Bruno Warin, X. Le Pallec, Rim Drira, 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), 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: Best practices, Decision support system, Computer science, Modeling language, Interoperability, design tools and techniques, Context (language use), [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Education, Unified Modeling Language, Human–computer interaction, Context modeling, computer.programming_language, Context model, Instructional design, Context, General Engineering, Computational modeling, Decision support, Computer Science Applications, Least squares approximation, distance learning, standards, Learning Management, computer, Unified modeling language
Abstract: International audience; In this paper, we first demonstrate that an instructional design process of Technology Enhanced Learning (TEL) systems based on a Model Driven Approach (MDA) addresses the limits of Learning Technology Standards (LTS), such as SCORM and IMS-LD. Although these standards ensure the interoperability of TEL systems across different Learning Management Systems (LMS), they are generic and lack expressiveness. In addition, the use of LTS limits designers to using a compliant LMS. MDA addresses these limits by allowing pedagogic modeling based on specific modeling languages and by ensuring interoperability across Learning Management Systems based on model transformations. In the context of an MDA-based design process, we propose a novel approach, named ACoMoD, to help designers to bridge the gap between pedagogic modeling and LMS specifications, based on graphic and interactive model transformations. Our approach, implemented with a tool called Gen-COM, enables designers to choose more effective LMS tools, based on a contextual recommendation of best practice for LMS tool use. Gen-COM and its evaluation with designers are described in this paper. The main results show, first, the usefulness of tailoring pedagogy with LMS tools based on the proposed solution. Second, the results show different levels of usefulness of the proposed assistance according to different situations that will be detailed. Some improvements are suggested and are in progress concerning the extension of Gen-COM to offer assistance to designers based on their profiles.
Published: 2012

181. Progressive and explicit refinement of scheduling for multidimensional data-flow applications using uml marte

Author: DeantoniJulien, GamatiéAbdoulaye, GlitiaCalin, MilloJean-Vivien, MalletFrédéric, BouletPierre, Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 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 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), ADAptive Computing (ADAC), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Models and methods of analysis and optimization for systems with real-time and embedding constraints (AOSTE), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), 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), 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), Contributions of the Data parallelism to real time (DART), 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é 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), and Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: [INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR], Logical time, Schedule, Theoretical computer science, Computer science, Distributed computing, Computation, Parallel computing, Embedded system design, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 02 engineering and technology, MARTE, Scheduling (computing), Physics::Fluid Dynamics, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Predictability, Computer Science::Operating Systems, Multidimensional data-flow, Clock constraint specification language, Radar signal processing, Multidimensional data, Repetitive structure modeling, 020207 software engineering, Uml marte, Hardware and Architecture, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, Software, Design Validation
Abstract: International audience; Process networks and data-flow graphs are used to capture data-dependencies in computation-intensive embedded systems. Their simplicity allows the computation of static schedules that reduce the dynamic overhead and increase predictability. The resulting schedule is a total ordering of actor computations and communications. It can therefore become an over-specification of the initial system when several schedules are valid. This is particularly the case for multidimensional data-flow applications. We propose a methodology to avoid such an over-specification. We propose to use logical time to capture explicitly all the valid schedules for a given multi-dimensional data-flow model. Then, we show that the proposed approach allows for a progressive and explicit refinement of computation scheduling that also captures constraints imposed by the environment and the execution platform. All this is achieved by using uml marte concepts and the resulting models can be considered for simulation and analysis with existing tools for early design validation. The whole approach is validated on a typical application devoted to radar signal processing.
Published: 2012

182. Expressing embedded systems configurations at high abstraction levels with UML MARTE profile: Advantages, limitations and alternatives

Author: Imran Rafiq Quadri, Pierre Boulet, Abdoulaye Gamatié, Jean-Luc Dekeyser, Samy Meftali, 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: MDE, Computer science, Distributed computing, QoS, MARTE, Systems-on-Chips (SoCs), Abstraction layer, Unified Modeling Language, Field-programmable gate array, computer.programming_language, Abstraction (linguistics), business.industry, Quality of service, Control reconfiguration, Avionics, Viewpoints, UML, Configurations, Hardware and Architecture, High abstraction levels, Embedded system, embedded systems, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, business, computer, Software
Abstract: International audience; Embedded systems have become an essential aspect of our professional and personal lives. From avionics, transport and telecommunication systems to general commercial appliances such as smart phones, high definition TVs and gaming consoles; it is difficult to find a domain where these systems have not made their mark. Moreover, Systems-on-Chips (SoCs) which are considered as an integral solution for designing embedded systems, offer advantages such as run-time reconfiguration that can change system configurations during execution, depending upon Quality-of-Service (QoS) criteria such as performance, energy levels etc. This article deals with aspects related to modeling of these configurations, useful for describing various states of an embedded system, from both structural and operational viewpoints. Our proposal adapts a high abstraction level approach based on the principles of Model-Driven Engineering (MDE) and takes into account the UML MARTE profile for modeling of real-time and embedded systems. Elevating the design abstraction levels help to increase design productivity and achieve execution platform independence, among other advantages. The article details the current proposition of configurations in MARTE via some examples, and points out the advantages as well as some limitations, mainly concerning the semantic aspects of the defined concepts. Finally, we report our experiences on the modeling of an alternate notion of configurations and execution modes within the MARTE compliant Gaspard2 SoC Co-Design framework that has been successful for the design as well as implementation of FPGA based SoCs.
Published: 2012

183. Object swapping challenges: An evaluation of imageSegment

Author: Noury Bouraqadi, Luc Fabresse, Mariano Martinez Peck, 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 - IMT Nord Europe), Ecole nationale supérieure Mines-Télécom Lille Douai (IMT Nord Europe), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Centre for Digital Systems (CERI SN), and Ecole nationale supérieure Mines-Télécom Lille Douai (IMT Lille Douai)
Subjects: Theoretical computer science, Computer Networks and Communications, Computer science, Serialization, Object swapping, 02 engineering and technology, computer.software_genre, Object graph, 0202 electrical engineering, electronic engineering, information engineering, Smalltalk, Pharo, Auxiliary memory, computer.programming_language, Object-oriented programming, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], Programming language, 020207 software engineering, ImageSegment, Method, Data transfer object, serialization, 020201 artificial intelligence & image processing, computer, Software
Abstract: International audience; In object-oriented systems, runtime memory is composed of an object graph in which objects refer to other objects. This graph of objects evolves while the system is running. Graph exporting and swapping are two important object graph operations. Exporting refers to copying the graph to some other memory so that it can be loaded by another system. Swapping refers to moving the graph to a secondary memory (for example, a hard disk) to temporary release part of the primary memory (for example, RAM). Exporting and swapping are achieved in different ways and the speed in presence of large object graphs is critical. Nevertheless, most of the existing solutions do not address well this issue. Another challenge is to deal with common situations where objects outside the exported/swapped graph point to objects inside the graph. To correctly load back an exported subgraph, it is necessary to compute and export extra information that is not explicit in the object subgraph. This extra information is needed because certain objects may require to be reinitialized or recreated, to run specific code before or after the loading, to be updated to a new class definition, etc. In this paper, we present all general problems to our knowledge about object exporting and swapping. As a case of study, we present an analysis of ImageSegment, a fast solution to export and swap object graphs, developed by Dan Ingalls. ImageSegment addresses the speed problems in an efficient way, as shown by the results of several benchmarks we have conducted using Pharo Smalltalk. However, ImageSegment is not a panacea since it still has other problems that hampers its general use.
Published: 2012

184. A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests

Author: Laetitia Jourdan, Briseida Sarasola, Enrique Alba, El-Ghazali Talbi, Mostepha Khouadjia, 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), Departamento Lenguajes y Ciencias de la Computación [Malaga] (LCC), Universidad de Málaga [Málaga] = University of Málaga [Málaga], 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), 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), and Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec
Subjects: Static routing, Mathematical optimization, 021103 operations research, Process (engineering), Computer science, 0211 other engineering and technologies, Particle swarm optimization, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], 02 engineering and technology, Set (abstract data type), Vehicle routing problem, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Routing (electronic design automation), Software, Variable neighborhood search
Abstract: International audience; Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data are known in advance, i.e. before the optimization process has started. However, in practice, many problems are dynamic, and change while the optimization is in progress. For example, in the dynamic vehicle routing problem (DVRP), new orders arrive when the working day plan is in progress. In this case, routes must be reconfigured dynamically while executing the current simulation. The DVRP is an extension of a conventional routing problem, its main interest being the connection to many real word applications (repair services, courier mail services, dial-a-ride services, etc.). In this article, a DVRP is examined, and solving methods based on particle swarm optimization and variable neighborhood search paradigms are proposed. The performance of both approaches is evaluated using a new set of benchmarks that we introduce here as well as existing benchmarks in the literature. Finally, we measure the behavior of both methods in terms of dynamic adaptation.
Published: 2012

185. Integrality and Separability of Multitouch Interaction Techniques in 3D Manipulation Tasks

Author: Laurent Grisoni, Géry Casiez, Anthony 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), 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), This work was supported by the ANR project n◦ ANR-09-CORD-013 'InSTInCT'. We thank the study participants for their time and Daniel Vogel for proof reading., ANR-09-CORD-0013,InSTInCT,Interfaces dédiées aux Surfaces Tactiles pour de l'Interaction avec des Contenus Tridimensionnels(2009), Laboratoire d'Informatique Fondamentale de Lille [LIFL], Collaborative interactive virtual environment [ALCOVE], Méthodes et outils pour l'Interaction à gestes [MINT2], Collaborative interactive virtual environment (ALCOVE), Institut National de Recherche en Informatique et en Automatique (Inria)-IRCICA, 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 Ecole Centrale de Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Ecole Centrale de Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)
Subjects: Adult, Male, Rotation, Computer science, 02 engineering and technology, Translation (geometry), Imaging, Three-Dimensional, Task Performance and Analysis, Computer Graphics, 0202 electrical engineering, electronic engineering, information engineering, Humans, [INFO.INFO-DL]Computer Science [cs]/Digital Libraries [cs.DL], 0501 psychology and cognitive sciences, Computer vision, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], 050107 human factors, Analysis of Variance, Depth Perception, business.industry, 05 social sciences, Degrees of freedom, 020207 software engineering, Computer Graphics and Computer-Aided Design, Visualization, Touch, Signal Processing, Female, Computer Vision and Pattern Recognition, Artificial intelligence, business, Rotation (mathematics), Software
Abstract: International audience; Multitouch displays represent a promising technology for the display and manipulation of data. While the manipulation of 2D data has been widely explored, 3D manipulation with multitouch displays remains largely unexplored. Based on an analysis of the integration and separation of degrees of freedom, we propose a taxonomy for 3D manipulation techniques with multitouch displays. Using that taxonomy, we introduce Depth-Separated Screen-Space (DS3), a new 3D manipulation technique based on the separation of translation and rotation. In a controlled experiment, we compared DS3 with Sticky Tools and Screen-Space. Results show that separating the control of translation and rotation significantly affects performance for 3D manipulation, with DS3 performing faster than the two other techniques.
Published: 2012

186. Prioritized repairing and consistent query answering in relational databases

Author: Sławek Staworko, Jan Chomicki, Jerzy Marcinkowski, 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), University at Buffalo [SUNY] (SUNY Buffalo), State University of New York (SUNY), and Research partially supported by NSF grants IIS-0119186 and IIS-0307434, Ministry of Higher Education and Research, Nord-Pas de Calais Regional Council and FEDER through the’ Contrat de Projets Etat Region (CPER) 2007-2013, Enumeration project ANR-07-blanc, and Polish Ministry of Science and Higher Education research project N N206 371339.
Subjects: priorities, FOS: Computer and information sciences, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], Information retrieval, Database, Computer science, Relational database, Applied Mathematics, Complex system, Databases (cs.DB), 02 engineering and technology, computer.software_genre, Query optimization, Preference, Consistent query answers, Set (abstract data type), Computer Science - Databases, Artificial Intelligence, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Sargable, computer, Repairing, preferences
Abstract: A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. We investigate here the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs. We axiomatize desirable properties of preferred repairs. We present three different families of preferred repairs and study their mutual relationships. Finally, we investigate the complexity of preferred repairing and computing preferred consistent query answers., Accepted to the special SUM'08 issue of AMAI
Published: 2012

187. Towards scalable array-oriented active storage

Author: Viet-Trung Tran, Gabriel Antoniu, Bogdan Nicolae, Scalable Storage for Clouds and Beyond (KerData), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Global parallel and distributed computing (GRAND-LARGE), 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)-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 Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria), GRID'5000, CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Télécom Bretagne-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Université de Bretagne Sud (UBS)-Centre National de la Recherche Scientifique (CNRS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), 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 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 de Recherche en Informatique (LRI), and Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-CentraleSupélec
Subjects: Database, Computer science, business.industry, Reading (computer), Distributed computing, Active storage, Context (language use), 02 engineering and technology, computer.software_genre, 020204 information systems, Pyramid, Computer data storage, Metadata management, Scalability, 0202 electrical engineering, electronic engineering, information engineering, General Earth and Planetary Sciences, 020201 artificial intelligence & image processing, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business, computer, Parallel array, General Environmental Science
Abstract: International audience; The recent explosion in data sizes manipulated by distributed scientific applications has prompted the need to develop specialized storage systems capable to deal with specific access patterns in a scalable fashion. In this context, a large class of applications focuses on parallel array processing: small parts of huge multi-dimensional arrays are concurrently accessed by a large number of clients, both for reading and writing. A specialized storage system that deals with such an access pattern faces several challenges at the level of data/metadata management. We introduce Pyramid, an active array-oriented storage system that addresses these challenges. Experimental evaluation demonstrates substantial scalability improvements brought by Pyramid with respect to state-of-art approaches both in weak and strong scaling scenarios, with gains of 100% to 150%.
Published: 2012

188. Embedding domain-specific modelling languages in Maude specifications

Author: Vlad Rusu, 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), Dynamic Reconfigurable Massively Parallel Architectures and Languages (DREAMPAL), Université de Lille, Sciences et Technologies-Inria Lille - Nord Europe, and 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)
Subjects: Domain-specific language, Theoretical computer science, Syntax (programming languages), Programming language, Property (programming), Computer science, General Medicine, computer.file_format, Tracing, computer.software_genre, Operational semantics, Computable function, Modeling and Simulation, Embedding, [INFO.INFO-ES]Computer Science [cs]/Embedded Systems, Executable, Domain specific modelling languages, computer, Formal verification, Software
Abstract: International audience; We propose a formal approach for the definition and analysis of domain-specific modelling languages (DSML). The approach uses standard model-driven engineering artifacts for defining a language's syntax (using metamodels) and its operational semantics (using model transformations). We give formal meanings to these artifacts by translating them to the Maude language: metamodels and models are mapped to equational specifications, and model transformations are mapped to rewrite rules between such specifications, which are also expressible in Maude thanks to Maude's reflective capabilities. These mappings provide us, on the one hand, with abstract definitions of the MDE concepts used for defining DSML, which naturally capture their intended meanings; and, on the other hand, with equivalent executable definitions, which can be directly used by Maude for formal verification. We also study a notion of operational semantics-preserving model transformations, which are model transformations between two DSML that ensure that each execution of a transformed instance is matched by an execution of the original instance. We propose a semidecision procedure, implemented in Maude, for checking the semantics-preservation property. We also show how the procedure can be adapted for tracing finite executions of the transformed instance back to matching executions of the original one. The approach is illustrated on xSPEM, a language for describing the execution of activities constrained by time, precedence, and resource availability.
Published: 2012

189. Good reduction of Puiseux series and applications

Author: Adrien Poteaux, Marc Rybowicz, Calcul Formel (CALFOR), 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), 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), DMI (XLIM-DMI), XLIM (XLIM), and Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)-Université de Limoges (UNILIM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], Algebraic functions, Algebra and Number Theory, Floating point, Modulo, 010102 general mathematics, Prime number, Symbolic–numeric algorithm, 010103 numerical & computational mathematics, 01 natural sciences, Puiseux series, Reduction (complexity), Algebra, Symbolic-numeric algorithm, Computational Mathematics, Finite field, Simple (abstract algebra), ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, Finite fields, Computer Science::Symbolic Computation, Algebraic function, 0101 mathematics, Mathematics
Abstract: International audience; We have designed a new symbolic-numeric strategy for computing efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over an algebraic number field. In essence, computations modulo a well-chosen prime number p are used to obtain the exact information needed to guide floating point computations. In this paper, we detail the symbolic part of our algorithm. First of all, we study modular reduction of Puiseux series and give a good reduction criterion for ensuring that the information required by the numerical part is preserved. To establish our results, we introduce a simple modification of classical Newton polygons, that we call "generic Newton polygons", which turns out to be very convenient. Finally, we estimate the size of good primes obtained with deterministic and probabilistic strategies. Some of these results were announced without proof at ISSAC'08.
Published: 2012

190. Equilibres et effondrement dans le cadre d'un cycle naturel

Author: Germain, Marc, ROMO, Marion, Economie Quantitative, Intégration, Politiques Publiques et Econométrie (EQUIPPE), Université de Lille, Sciences et Technologies-Université de Lille, Sciences Humaines et Sociales-PRES Université Lille Nord de France-Université de Lille, Droit et Santé, and Université de Lille, Droit et Santé-PRES Université Lille Nord de France-Université de Lille, Sciences Humaines et Sociales-Université de Lille, Sciences et Technologies
Subjects: Environment and Development, Environment and Trade, Sustainability, Environmental Accounting, Environmental Equity, Population Growth, General [Agricultural and Natural Resource Economics, Environmental and Ecological Economics], [QFIN.PR]Quantitative Finance [q-fin]/Pricing of Securities [q-fin.PR], limits to growth,matter conservation,natural cycle,collapse, limits to growth, matter conservation, natural cycle, collapse, O41, jel:E10, Q00, [QFIN.PR] Quantitative Finance [q-fin]/Pricing of Securities [q-fin.PR], Q56, Q57, General [General Aggregative Models], jel:O41, collapse, limits to growth, Ecological Economics, matter conservation, jel:Q00, One, Two, and Multisector Growth Models, Economie, natural cycle, jel:Q57, jel:Q56, E10
Abstract: RESUME :Le but de cet article est d'étudier comment la naissance et la croissance d'une économie estsusceptible d'affecter le fonctionnement de son environnement modélisé sous la forme d'uncycle naturel. Afin de mettre en évidence les facteurs qui stabilisent le système formé par lecycle naturel et l'économie et ceux qui au contraire sont susceptibles de le déstabiliser et de leconduire à l'effondrement, différents cas de figure sont envisagés selon la nature (i) des coûtsmarginaux d'extraction d'une ressource renouvelable faisant partie du cycle et (ii) des impactsde la pollution sur l'environnement., The aim of this article is to study how the birth and growth of an economy could affect itsenvironment modelled as a natural cycle. In order to underline the factors that stabilises thesystem formed by the natural cycle and the economy and those that are likely to destabilise andlead it to collapse, we study different cases depending on the form of (i) the marginal extractioncosts of a renewable resource included in the cycle and (ii) the impact of pollution on theenvironment., info:eu-repo/semantics/published
Published: 2012

191. A Learning Algorithm for Change Impact Prediction: Experimentation on 7 Java Applications

Author: Musco, Vincenzo, Carette, Antonin, Monperrus, Martin, Preux, Philippe, Self-adaptation for distributed services and large software systems (SPIRALS), 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), Sequential Learning (SEQUEL), 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)-Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS), Université de Lille, Sciences et Technologies-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Centre National de la Recherche Scientifique (CNRS), 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)-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'Automatique, Génie Informatique et Signal (LAGIS), Université de Lille, Sciences et Technologies-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-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-SE]Computer Science [cs]/Software Engineering [cs.SE]
Abstract: Change impact analysis consists in predicting the impact of a code change in a software application. In this paper, we take a learning perspective on change impact analysis and consider the problem formulated as follows. The artifacts that are considered are methods of object-oriented software; the change under study is a change in the code of the method, the impact is the test methods that fail because of the change that has been performed. We propose an algorithm, called LCIP that learns from past impacts to predict future impacts. To evaluate our system, we consider 7 Java software applications totaling 214,000+ lines of code. We simulate 17574 changes and their actual impact through code mutations, as done in mutation testing. We find that LCIP can predict the impact with a precision of 69%, a recall of 79%, corresponding to a F-Score of 55%.
Published: 2015

192. Distributed adaptive scheme for reliable data collection in fault tolerant WSNs

Author: Thomas Noel, Georgios Z. Papadopoulos, Antoine Gallais, Nikolaos Pappas, Vangelis Angelakis, RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Objets communicants pour l'Internet du futur (OCIF), IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES (IRISA-D2), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Département Systèmes Réseaux, Cybersécurité et Droit du numérique (IMT Atlantique - SRCD), Supélec Sciences des Systèmes (E3S), Ecole Supérieure d'Electricité - SUPELEC (FRANCE), System and Networking for Portable Objects Proved to be Safe (POPS), 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), Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Institut National de Recherche en Informatique et en Automatique (Inria)-Les Hôpitaux Universitaires de Strasbourg (HUS)-Centre National de la Recherche Scientifique (CNRS)-Matériaux et Nanosciences Grand-Est (MNGE), Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Réseau nanophotonique et optique, Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS), Department of Science and Technology [Linköping], Linköping University (LIU), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Université de Rennes (UNIV-RENNES)-CentraleSupélec, Institut National de Recherche en Informatique et en Automatique (Inria)-IRCICA, Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Réseau nanophotonique et optique, Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Centre National de la Recherche Scientifique (CNRS)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Matériaux et nanosciences d'Alsace (FMNGE), and Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Université de Haute-Alsace (UHA) Mulhouse - Colmar (Université de Haute-Alsace (UHA))-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)-Institut de Chimie du CNRS (INC)-Université de Strasbourg (UNISTRA)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Queue management system, business.industry, Computer science, Network packet, Quality of service, Distributed computing, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, 010401 analytical chemistry, 020206 networking & telecommunications, 02 engineering and technology, Communications system, 01 natural sciences, 0104 chemical sciences, Key distribution in wireless sensor networks, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Packet loss, Sensor node, 0202 electrical engineering, electronic engineering, information engineering, business, Wireless sensor network, Queue, ComputingMilieux_MISCELLANEOUS, Computer network, Efficient energy use
Abstract: Reliable data packet transfer is an essential facet of quality of service in Wireless Sensor Networks (WSNs). WSNs require pertinent and reliable data collection schemes to provide dependable information. We analyze the factors that affect reliability, and design efficient combinations of the possible options. While many researchers have tackled this issue by focusing on particular layers of the embedded communication stack (e.g., Medium Access Control (MAC) or routing layer), we propose a layer-independent transmission rate adaptive scheme, where no additional control messages are required. We focus on packet loss avoidance along prone-to-failure paths to the sink with the main objective being the efficient queue management of a sensor node. Based on certain factors (e.g., application or queue requirements) nodes will consequently take adjustment decisions. Our thorough simulation experiments demonstrate that DRAS reduces the packet drops and improves the data collection procedure in an energy efficient manner.
Published: 2015

193. Allocation séquentielle de ressources dans le modèle de bandit linéaire

Author: Soare, Marta, Sequential Learning (SEQUEL), 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)-Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS), Université de Lille, Sciences et Technologies-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria), Conseil Régional Nord - Pas de Calais, COMPLACS - Composing Learning for Artificial Cognitive Systems, Numéro CORDIS : 270327, Université Lille 1 - Sciences et Technologies, Rémi Munos, European Project: 270327,EC:FP7:ICT,FP7-ICT-2009-6,COMPLACS(2011), 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)-Laboratoire d'Automatique, Génie Informatique et Signal (LAGIS), Université de Lille, Sciences et Technologies-Centrale Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Centre National de la Recherche Scientifique (CNRS), Soare, Marta, and Composing Learning for Artificial Cognitive Systems - COMPLACS - - EC:FP7:ICT2011-03-01 - 2015-02-28 - 270327 - VALID
Subjects: bandit games, apprentissage séquentiel, optimisation stochastique, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], adaptive sampling, jeux de bandits, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], sequential learning, stochastic optimization, échantillonnage adaptatif
Abstract: This thesis is dedicated to the study of resource allocation problems in uncertain environments, where an agent can sequentially select which action to take. After each step, the environment returns a noisy observation of the value of the selected action. These observations guide the agent in adapting his resource allocation strategy towards reaching a given objective. In the most typical setting of this kind, the stochastic multi-armed bandit (MAB), it is assumed that each observation is drawn from an unknown probability distribution associated with the selected action and gives no information on the expected value of the other actions. The MAB setting has been widely studied and optimal allocation strategies were proposed to solve various objectives under the MAB assumptions. Here, we consider a variant of the MAB setting where there exists a global linear structure in the environment and by selecting an action, the agent also gathers information on the value of the other actions. Therefore, the agent needs to adapt his resource allocation strategy to exploit the structure in the environment. In particular, we study the design of sequences of actions that the agent should take to reach objectives such as: (i) identifying the best value with a fixed confidence and using a minimum number of pulls, or (ii) minimizing the prediction error on the value of each action. In addition, we investigate how the knowledge gathered by a bandit algorithm in a given environment can be transferred to improve the performance in other similar environments., Dans cette thèse nous étudions des problèmes d'allocation de ressources dans des environnements incertains où un agent choisit ses actions séquentiellement. Après chaque pas, l'environnement fournit une observation bruitée sur la valeur de l'action choisie et l'agent doit utiliser ces observations pour allouer ses ressources de façon optimale. Dans le cadre le plus classique, dit modèle du bandit à plusieurs bras (MAB), on fait l'hypothèse que chaque observation est tirée aléatoirement d'une distribution de probabilité associée à l'action choisie et ne fournit aucune information sur les valeurs espérées des autres actions disponibles dans l'environnement. Ce modèle a été largement étudié dans la littérature et plusieurs stratégies optimales ont été proposées, notamment pour le cas où le but de l'agent est de maximiser la somme des observations. Ici, nous considérons une version du MAB où les actions ne sont plus indépendantes, mais chaque observation peut être utilisée pour estimer les valeurs de l'ensemble des actions de l'environnement. Plus précisément, nous proposons des stratégies d'allocation de ressources qui sont efficaces et adaptées à un environnement caractérisé par une structure linéaire globale. Nous étudions notamment les séquences d'actions qui mènent à : (i) identifier la meilleure action avec une précision donnée et en utilisant un nombre minimum d'observations, ou (ii) maximiser la précision d'estimation de la valeur de chaque action. De plus, nous étudions les cas où les observations provenant d'un algorithme de bandit dans un environnement donné peuvent améliorer par la suite la performance de l'agent dans d'autres environnements similaires.
Published: 2015

194. Dissertations and Data

Author: Joachim Schöpfel, Južnič Primož, Hélène Prost, Cécile Malleret, Ana Češarek, Teja Koler-Povh, Groupe d'Études et de Recherche Interdisciplinaire en Information et COmmunication - ULR 4073 (GERIICO ), Université de Lille, University of Ljubljana, Service Commun de la Documentation - Université de Lille, Sciences Humaines et Sociales (SCD), and Université de Lille, Sciences Humaines et Sociales
Subjects: open access, electronic theses and dissertations, [SHS.INFO]Humanities and Social Sciences/Library and information sciences, open data, Open science, research data management, institutional repository, research data, data repository
Abstract: International audience; The keynote provides an overview on the field of research data produced by PhD students, in the context of open science, open access to research results, e-Science and the handling of electronic theses and dissertations. The keynote includes recent empirical results and recommendations for good practice and further research. In particular, the paper is based on an assessment of 864 print and electronic dissertations in sciences, social sciences and humanities from the Universities of Lille (France) and Ljubljana (Slovenia), submitted between 1987 and 2015, and on a survey on data management with 270 scientists in social sciences and humanities of the University of Lille 3.The keynote starts with an introduction into data-driven science, data life cycle and data publishing. It then moves on to research data management by PhD students, their practice, their needs and their willingness to disseminate and share their data. After this qualitative analysis of information behaviour, we present the results of a quantitative assessment of research data produced and submitted with dissertations Special attention is paid to the size of the research data in appendices, to their presentation and link to the text, to their sources and typology, and to their potential for further research. The discussion puts the focus on legal aspects (database protection, intellectual property, privacy, third-party rights) and other barriers to data sharing, reuse and dissemination through open access.Another part adds insight into the potential handling of these data, in the framework of the French and Slovenian dissertation infrastructures. What could be done to valorise these data in a centralized system for electronic theses and dissertations (ETDs)? The topics are formats, metadata (including attribution of unique identifiers), submission/deposit, long-term preservation and dissemination. This part will also draw on experiences from other campuses and make use of results from surveys on data management at the Universities of Berlin and Lille.The conclusion provides some recommendations for the assistance and advice to PhD students in managing and depositing their research data, and also for further research.Our study will be helpful for academic libraries to develop assistance and advice for PhD students in managing their research data, in collaboration with the research structures and the graduate schools. Moreover, it should be helpful to prepare and select research data for long-term preservation, curate research data in open repositories and design data repositories.The French part of paper is part of an ongoing research project at the University of Lille 3 (France) in the field of digital humanities and research data, conducted with scientists and academic librarians. Its preliminary results have been presented at a conference on research data in February 2015 at Lille, at the 8th Conference on Grey Literature and Repositories at Prague in October 2015 and published in the Journal of Librarianship and Scholarly Communication. The Slovenian research results have not been published before.
Published: 2015

195. Dissertations and Data: keynote address

Author: Schöpfel, Joachim, Primož, Južnič, Prost, Hélène, Malleret, Cécile, Češarek, Ana, Koler-Povh, Teja, Groupe d'Études et de Recherche Interdisciplinaire en Information et COmmunication - ULR 4073 (GERIICO ), Université de Lille, University of Ljubljana, Service Commun de la Documentation - Université de Lille, Sciences Humaines et Sociales (SCD), Université de Lille, Sciences Humaines et Sociales, and Service Commun de la Documentation - Université de Lille 3, Sciences Humaines et Sociales (SCD)
Subjects: open access, electronic theses and dissertations, [SHS.INFO]Humanities and Social Sciences/Library and information sciences, open data, Open science, research data management, institutional repository, research data, data repository
Abstract: International audience; The keynote provides an overview on the field of research data produced by PhD students, in the context of open science, open access to research results, e-Science and the handling of electronic theses and dissertations. The keynote includes recent empirical results and recommendations for good practice and further research. In particular, the paper is based on an assessment of 864 print and electronic dissertations in sciences, social sciences and humanities from the Universities of Lille (France) and Ljubljana (Slovenia), submitted between 1987 and 2015, and on a survey on data management with 270 scientists in social sciences and humanities of the University of Lille 3.The keynote starts with an introduction into data-driven science, data life cycle and data publishing. It then moves on to research data management by PhD students, their practice, their needs and their willingness to disseminate and share their data. After this qualitative analysis of information behaviour, we present the results of a quantitative assessment of research data produced and submitted with dissertations Special attention is paid to the size of the research data in appendices, to their presentation and link to the text, to their sources and typology, and to their potential for further research. The discussion puts the focus on legal aspects (database protection, intellectual property, privacy, third-party rights) and other barriers to data sharing, reuse and dissemination through open access.Another part adds insight into the potential handling of these data, in the framework of the French and Slovenian dissertation infrastructures. What could be done to valorise these data in a centralized system for electronic theses and dissertations (ETDs)? The topics are formats, metadata (including attribution of unique identifiers), submission/deposit, long-term preservation and dissemination. This part will also draw on experiences from other campuses and make use of results from surveys on data management at the Universities of Berlin and Lille.The conclusion provides some recommendations for the assistance and advice to PhD students in managing and depositing their research data, and also for further research.Our study will be helpful for academic libraries to develop assistance and advice for PhD students in managing their research data, in collaboration with the research structures and the graduate schools. Moreover, it should be helpful to prepare and select research data for long-term preservation, curate research data in open repositories and design data repositories.The French part of paper is part of an ongoing research project at the University of Lille 3 (France) in the field of digital humanities and research data, conducted with scientists and academic librarians. Its preliminary results have been presented at a conference on research data in February 2015 at Lille, at the 8th Conference on Grey Literature and Repositories at Prague in October 2015 and published in the Journal of Librarianship and Scholarly Communication. The Slovenian research results have not been published before.
Published: 2015

196. Sea level monitoring and sea state estimate using a single geodetic receiver

Author: Bertin, Xavier, Roussel, Nicolas, Ramillien, Guillaume, Frappart, Frédéric, Darrozes, José, Gay, Adrien, Biancale, Richard, Striebig, Nicolas, Hanquiez, Vincent, Allain, Damien, 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, Laboratoire d'études en Géophysique et océanographie spatiales (LEGOS), Institut de Recherche pour le Développement (IRD)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire Midi-Pyrénées (OMP), Météo France-Centre National d'Études Spatiales [Toulouse] (CNES)-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Météo France-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Centre National de la Recherche Scientifique (CNRS), Géosciences Environnement Toulouse (GET), Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Observatoire Midi-Pyrénées (OMP), Météo France-Centre National d'Études Spatiales [Toulouse] (CNES)-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD)-Météo France-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD), Centre National d'Études Spatiales [Toulouse] (CNES), Observatoire Midi-Pyrénées (OMP), Météo France-Centre National d'Études Spatiales [Toulouse] (CNES)-Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche pour le Développement (IRD), Environnements et Paléoenvironnements OCéaniques (EPOC), Observatoire aquitain des sciences de l'univers (OASU), Université Sciences et Technologies - Bordeaux 1-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université Sciences et Technologies - Bordeaux 1-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-École pratique des hautes études (EPHE), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), LIttoral ENvironnement et Sociétés - UMRi 7266 (LIENSs), Université de La Rochelle (ULR)-Centre National de la Recherche Scientifique (CNRS), LIttoral ENvironnement et Sociétés - UMR 7266 (LIENSs), Université Fédérale Toulouse Midi-Pyrénées-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS), Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées, Université Bordeaux Montaigne, Université Sciences et Technologies - Bordeaux 1-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université Sciences et Technologies - Bordeaux 1-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-École pratique des hautes études (EPHE)-Centre National de la Recherche Scientifique (CNRS), Station d'Amélioration Génétique des Animaux (SAGA), Institut National de la Recherche Agronomique (INRA), Centre National de la Recherche Scientifique (CNRS)-Université de La Rochelle (ULR), Centre National de la Recherche Scientifique (CNRS)-Observatoire Midi-Pyrénées (OMP), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Institut de Recherche pour le Développement (IRD)-Centre National d'Études Spatiales [Toulouse] (CNES), Institut National de Recherche en Informatique et en Automatique (Inria), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire Midi-Pyrénées (OMP), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Institut de Recherche pour le Développement (IRD)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France -Centre National de la Recherche Scientifique (CNRS), Université de Toulouse (UT)-Université de Toulouse (UT)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National d'Études Spatiales [Toulouse] (CNES)-Centre National de la Recherche Scientifique (CNRS)-Météo-France, Université Sciences et Technologies - Bordeaux 1 (UB)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Université Sciences et Technologies - Bordeaux 1 (UB)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-École Pratique des Hautes Études (EPHE), LIttoral ENvironnement et Sociétés (LIENSs), and La Rochelle Université (ULR)-Centre National de la Recherche Scientifique (CNRS)
Subjects: Soil Science, Sea state, SNR, tide gauge, Multipaths, Physics::Geophysics, Sea level, Wave, 14. Life underwater, Altimeter, Computers in Earth Sciences, [SDU.ENVI]Sciences of the Universe [physics]/Continental interfaces, environment, ComputingMilieux_MISCELLANEOUS, Remote sensing, [SDU.OCEAN]Sciences of the Universe [physics]/Ocean, Atmosphere, GNSS-R, Geodetic datum, Geology, Geodesy, Swell, Amplitude, GNSS applications, Physics::Space Physics, Tide gauge
Abstract: International audience; GNSS-Reflectometry (GNSS-R) altimetry has demonstrated a strong potential for sea level monitoring. Interference Pattern Technique (IPT) based on the analysis of the Signal-to-Noise Ratio (SNR) estimated by a GNSS receiver, presents the main advantage of being applicable everywhere by using a single geodetic antenna and receiver, transforming them to real tide gauges. Classical SNR analysis method used to estimate the variations of the reflecting surface height h(t) has a limited domain of validity due to its variation rate dhdtt assumed to be negligible. We present here a significant advance in this altimetric methodology using GNSS multipath to conjointly estimate h(t) and dhdtt over areas characterized by high amplitudes of tides and presence of waves. It drastically enhances the temporal and spatial monitoring of tides and waves. Inversion approach is based on a Least Square Method (LSM), combining simultaneous measurements from different GNSS constellations (GPS, GLONASS). Our method is validated with SNR data acquired on an offshore site of 60-meter height, in conditions were assumptions of the classical SNR analysis method are not valid (i.e. with a semi-diurnal tide amplitude of ~. 4. m, vertical velocity of the sea surface due to tide reaching 0.2. mm/s, and presence of waves with amplitude up to few meters). Linear correlation between the estimates with our method and tide gauges records are better than 0.97, whereas it only equals 0.82 with the classical method over the whole 3. months of acquisition. Our dynamic SNR method allows a very good estimate of the main tide periods and permits to detect swell and waves with realistic amplitudes and periods, which is not the case with tide gauges (located in protected areas) or classical SNR analysis method.
Published: 2015

197. Action Recognition Using Rate-Invariant Analysis of Skeletal Shape Trajectories

Author: Jingyong Su, Anuj Srivastava, Boulbaba Ben Amor, FOX MIIRE (LIFL), 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), Department of Statistics [Tallahassee, FL], Florida State University [Tallahassee] (FSU), This research was performed during B. Ben Amor’s visit to the Florida State University during 2013-2014, and was supported in part by Institut Mines-Télécom, the MAGNUM 2 project (BPI and Région Nord-Pas de Calais), and NSF grants DMS 1208959 and 1217515., and Ben Amor, Boulbaba
Subjects: Support Vector Machine, Movement, Video Recording, 02 engineering and technology, Pattern Recognition, Automated, Imaging, Three-Dimensional, [INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], Discriminative model, Artificial Intelligence, 0202 electrical engineering, electronic engineering, information engineering, Humans, Computer vision, Hidden Markov model, Skeleton, Mathematics, Models, Statistical, business.industry, Applied Mathematics, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], 020207 software engineering, Pattern recognition, Manifold, Support vector machine, Euclidean distance, Computational Theory and Mathematics, Problem domain, Metric (mathematics), 020201 artificial intelligence & image processing, Computer Vision and Pattern Recognition, Artificial intelligence, business, Algorithms, Software, Smoothing
Abstract: International audience; We study the problem of classifying actions of human subjects using depth movies generated by Kinect or other depth sensors. Representing human body as dynamical skeletons, we study the evolution of their (skeletons’) shapes as trajectories on Kendall’s shape manifold. The action data is typically corrupted by large variability in execution rates within and across subjects and, thus, causing major problems in statistical analyses. To address that issue, we adopt a recently-developed framework of Su et al. to this problem domain. Here, the variable execution rates correspond to re-parameterizations of trajectories, and one uses a parameterization-invariant metric for aligning, comparing, averaging, and modeling trajectories. This is based on a combination of transported square-root vector fields (TSRVFs) of trajectories and the standard Euclidean norm, that allows computational efficiency. We develop a comprehensive suite of computational tools for this application domain: smoothing and denoising skeleton trajectories using median filtering, up- and down-sampling actions in time domain, simultaneous temporal- registration of multiple actions, and extracting invertible Euclidean representations of actions. Due to invertibility these Euclidean representations allow both discriminative and generative models for statistical analysis. For instance, they can be used in a SVM-based classification of original actions as demonstrated here using MSR Action-3D, MSR Daily Activity and 3D Action Pairs datasets. This approach, using only the skeletal data, achieves the state-of-the-art classification results on these datasets.
Published: 2015

198. What should developers be aware of? An empirical study on the directives of API documentation

Author: Elif Tekes, Martin Monperrus, Mira Mezini, Michael Eichberg, 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), Software Technology Group [Darmstadt], and Technische Universität Darmstadt - Technical University of Darmstadt (TU Darmstadt)
Subjects: FOS: Computer and information sciences, Application programming interface, business.industry, Computer science, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Reuse, Software Engineering (cs.SE), Computer Science - Software Engineering, Software, Empirical research, Order (business), Taxonomy (general), Software engineering, business
Abstract: Application Programming Interfaces (API) are exposed to developers in order to reuse software libraries. API directives are natural-language statements in API documentation that make developers aware of constraints and guidelines related to the usage of an API. This paper presents the design and the results of an empirical study on the directives of API documentation of object-oriented libraries. Its main contribution is to propose and extensively discuss a taxonomy of 23 kinds of API directives., Comment: Empirical Software Engineering (2011)
Published: 2011

199. Supporting simultaneous versions for software evolution assessment

Author: Simon Denier, Jean-Rémy Falleri, Stéphane Ducasse, Jannik Laval, 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, and Institut National de Recherche en Informatique et en Automatique (Inria)
Subjects: Source code, Computer science, media_common.quotation_subject, Computation, Distributed computing, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], 0102 computer and information sciences, 02 engineering and technology, Business process reengineering, Revision control, computer.software_genre, 01 natural sciences, Interactive simulation, Software, Change simulation, 0202 electrical engineering, electronic engineering, information engineering, Software system, media_common, Impact analysis, business.industry, Programming language, Software evolution, 020207 software engineering, 010201 computation theory & mathematics, Simultaneous version, business, computer
Abstract: International audience; When reengineering software systems, maintainers should be able to assess and compare multiple change scenarios for a given goal, so as to choose the most pertinent one. Because they implicitly consider one single working copy, revision control systems do not scale up well to perform simultaneous analyses of multiple versions of systems. We designed Orion, an interactive prototyping tool for reengineering, to simulate changes and compare their impact on multiple versions of software source code models. Our approach offers an interactive simulation of changes, reuses existing assessment tools, and has the ability to hold multiple and branching versions simultaneously in memory. Specifically, we devise an infrastructure which optimizes memory usage of multiple versions for large models. This infrastructure uses an extension of the FAMIX source code meta-model but it is not limited to source code analysis tools since it can be applied to models in general. In this paper, we validate our approach by running benchmarks on memory usage and computation time of model queries on large models. Our benchmarks show that the Orion approach scales up well in terms of memory usage, while the current implementation could be optimized to lower its computation time. We also report on two large case studies on which we applied Orion.
Published: 2011

200. Unifying design and runtime software adaptation using aspect models

Author: Anthony Cleve, Xavier Blanc, Carlos Parra, Laurence Duchien, 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), Adaptive Distributed Applications and Middleware (ADAM), 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), Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)
Subjects: Software visualization, Resource-oriented architecture, Programming language, business.industry, Computer science, Runtime verification, Software development, 020207 software engineering, 02 engineering and technology, Software product lines, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], computer.software_genre, 020204 information systems, Component-based software engineering, Software construction, 0202 electrical engineering, electronic engineering, information engineering, Software design, Aspect oriented modeling, Software engineering, business, computer, Software design description, Software
Abstract: International audience; Software systems are seen more and more as evolutive systems. At the design phase, software is constantly in adaptation by the building process itself, and at runtime, it can be adapted in response to changing conditions in the executing environment such as location or resources. Adaptation is generally difficult to specify because of its crosscutting impact on software. This article introduces an approach to unify adaptation at design and at runtime based on Aspect Oriented Modeling. Our approach proposes a unified aspect metamodel and a platform that realizes two different weaving processes to achieve design and runtime adaptations. This approach is used in a Dynamic Software Product Line which derives products that can be configured at design time and adapted at runtime in order to dynamically fit new requirements or resource changes. Such products are implemented using the Service Component Architecture and Java. Finally, we illustrate the use of our approach based on an adaptive e-shopping scenario. The main advantages of this unification are: a clear separation of concerns, the self-contained aspect model that can be weaved during the design and execution, and the platform independence guaranteed by two different types of weaving.
Published: 2011
Full Text: View/download PDF

Catalog

Books, media, physical & digital resources

See catalog results

Searchworks

Select search scope, currently: Articles Catalog books, media & more in Jio Institute collections Articles journal articles & other e-resources

Search

Search Constraints

Refine your results

Search Limiters

Topic

Publication Year Range

Language

Journal

Database

Publisher

5,175 results on '"Université de Lille, Sciences Humaines et Sociales"'

Search Results

Catalog

Select search scope, currently: Articles

Catalog

books, media & more in Jio Institute collections

Articles

journal articles & other e-resources