Search

Your search keyword '"Computer, Society"' showing total 51 results
Start Over Author "Computer, Society" Topic [info]computer science [cs]
51 results on '"Computer, Society"'

1. Evolutionary-based Wireless Sensor Deployment for Target Coverage

Author

Albert Dipanda, Wahabou Abdou, Emmanuel Tonye, Arouna Ndam Njoya, University of Ngaoundéré - IUT, University of Ngaoundere, Laboratoire Electronique, Informatique et Image ( Le2i ), Université de Bourgogne ( UB ) -AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique ( CNRS ), Université de Yaoundé I [Yaoundé], Sponsor(s):Kasetsart University in Bangkok, LE2I (Laboratoire Electronique, Image et Informatique), University of Bourgogne, UKNOW, Center of Excellence for Unified Knowledge and Language Engineering at Kasetsart University., IEEE Computer Society, IEEE Computer Society Technical & Conference Activities Board, University of Milan, Yetongnon, K, Dipanda, A, Chbeir, R, Institut Universitaire de Technologie - Ngaoundéré (IUT Ngaoundéré), Université de Ngaoundéré/University of Ngaoundéré [Cameroun] (UN), Laboratoire Electronique, Informatique et Image [UMR6306] (Le2i), Université de Bourgogne (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Arts et Métiers (ENSAM), Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement, and Université de Yaoundé I

Subjects
Genetic Algorithm, Brooks–Iyengar algorithm, Surveillance, [ INFO ] Computer Science [cs], Computer science, Distributed computing, Disjoint sets, [SPI.TRON]Engineering Sciences [physics]/Electronics, Scheduling (computing), [ SPI.TRON ] Engineering Sciences [physics]/Electronics, Identifier, [SPI]Engineering Sciences [physics], Key distribution in wireless sensor networks, Genetic algorithm, Sensor deployment, Mobile wireless sensor network, network lifetime maximization, [ SPI ] Engineering Sciences [physics], [INFO]Computer Science [cs], Wireless sensor network, target coverage, Network Lifetime, Placement
Abstract

International audience; The sensor deployment problem consists in finding an optimal (or near-optimal) way of placing sensors in a given area in order to cover the whole space. However, sometimes it is not necessary to monitor the complete area; one may want to focus on some points considered as target. This leads to the target coverage problem. This problem includes two main processes: (1) placing sensors around the targets, (2) scheduling the activation time redundant sensors in order to lengthen the network lifetime. This paper proposes a multi-objective approach based on genetic algorithms that aims to simultaneously find good positions of sensor nodes and the maximum number of disjoint cover sets. A new chromosome (solution) encoding in which the genes contain both, the position and the identifier of sensor owning group is introduced. The efficiency of the proposed approach is assessed by a comparison with existing methods.

Published
2015

2. Overlapping community detection versus ground-truth in AMAZON co-purchasing network

Author

Atef Hamouda, Chantal Cherifi, Malek Jebabli, Hocine Cherifi, Laboratoire Electronique, Informatique et Image [UMR6306] (Le2i), Université de Bourgogne (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Arts et Métiers (ENSAM), Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement, Université Lumière - Lyon 2 (UL2), Unité de Recherche en Programmation Algorithmique et Heuristique (URPAH), Faculté des Sciences de Tunis, Sponsor(s):Kasetsart University in Bangkok, LE2I (Laboratoire Electronique, Image et Informatique), University of Bourgogne, UKNOW, Center of Excellence for Unified Knowledge and Language Engineering at Kasetsart University., IEEE Computer Society, IEEE Computer Society Technical & Conference Activities Board, University of Milan, Yetongnon, K, Dipanda, A, Chbeir, R, Université de Bourgogne (UB)-École Nationale Supérieure d'Arts et Métiers (ENSAM), HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique (CNRS), Décision et Information pour les Systèmes de Production (DISP), Université Lumière - Lyon 2 (UL2)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), Université de Tunis El Manar (UTM), Laboratoire Electronique, Informatique et Image ( Le2i ), Université de Bourgogne ( UB ) -AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique ( CNRS ), Décision et Information pour les Systèmes de Production ( DISP ), Université Lumière - Lyon 2 ( UL2 ) -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é Tunis El Manar ( UTM ), Université Lumière - Lyon 2 ( UL2 ), Unité de Recherche en Programmation Algorithmique et Heuristique ( URPAH ), and Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)

Subjects
[ INFO ] Computer Science [cs], Computer science, media_common.quotation_subject, 02 engineering and technology, computer.software_genre, Machine learning, 01 natural sciences, Clique percolation method, 010104 statistics & probability, [SPI]Engineering Sciences [physics], [ SPI ] Engineering Sciences [physics], 0202 electrical engineering, electronic engineering, information engineering, Quality (business), [INFO]Computer Science [cs], 0101 mathematics, Cluster analysis, network analysis, media_common, Ground truth, overlapping community networks, business.industry, Community structure, Purchasing, [ SPI.TRON ] Engineering Sciences [physics]/Electronics, [SPI.TRON]Engineering Sciences [physics]/Electronics, detection algorithms, overlap- ping community networks, 020201 artificial intelligence & image processing, Algorithm design, Artificial intelligence, Data mining, business, computer, Network analysis
Abstract

International audience; Objective evaluation of community detection algorithms is a strategic issue. Indeed, we need to verify that the communities identified are actually the good ones. Moreover, it is necessary to compare results between two distinct algorithms to determine which is most effective. Classically, validations rely on clustering comparison measures or on quality metrics. Although, various traditional performance measures are used extensively. It appears very clearly that they cannot distinguish community structures with different topological properties. It is therefore necessary to propose an alternative methodology more sensitive to the community structure variations in order to conduct more effective comparisons. In this paper, we present a framework to tackle this challenge through a comprehensive analysis of the community structure of overlapping community structured networks. We illustrate our approach with an experimental analysis of a real-world network with a ground-truth community structure that we compare with the output of eight different overlapping community detection procedures, representative of categories of popular algorithms available in the literature. The results allow a better understanding of their behavior. Furthermore, they demonstrate that more emphasis should be put on the topology of the uncovered community structure in order to evaluate the effectiveness of community detection algorithms.

Published
2015

3. Influence Assessment in Twitter Multi-relational Network

Author

Marinette Savonnet, Sergey Kirgizov, Rim Faiz, Lobna Azaza, Eric Leclercq, Laboratoire Electronique, Informatique et Image [UMR6306] (Le2i), Université de Bourgogne (UB)-École Nationale Supérieure d'Arts et Métiers (ENSAM), Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique (CNRS), Laboratoire de Recherche Opérationnelle de Décision et de Contrôle de Processus (LARODEC), Université de Tunis-ISG de Tunis, Sponsor(s):Kasetsart University in Bangkok, LE2I (Laboratoire Electronique, Image et Informatique), University of Bourgogne, UKNOW, Center of Excellence for Unified Knowledge and Language Engineering at Kasetsart University., IEEE Computer Society, IEEE Computer Society Technical & Conference Activities Board, University of Milan, Dipanda, A, Yetongnon, K, Chbeir, R, Laboratoire Electronique, Informatique et Image ( Le2i ), Université de Bourgogne ( UB ) -AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique ( CNRS ), Laboratoire de Recherche Opérationnelle de Décision et de Contrôle de Processus ( LARODEC ), and Université de Tunis [Tunis]-ISG de Tunis

Subjects
Service (systems architecture), [ INFO ] Computer Science [cs], Computer science, Twitter network, Context (language use), Belief theory, Data science, [ SPI.TRON ] Engineering Sciences [physics]/Electronics, [SPI.TRON]Engineering Sciences [physics]/Electronics, World Wide Web, [SPI]Engineering Sciences [physics], Information fusion, Influence, Order (business), [ SPI ] Engineering Sciences [physics], [INFO]Computer Science [cs], Dissemination
Abstract

International audience; Influence in Twitter has become recently a hot research topic since this micro-blogging service is widely used to share and disseminate information. Some users are more able than others to influence and persuade peers. Thus, studying most influential users leads to reach a large-scale information diffusion area, something very useful in marketing or political campaigns. In this paper, we propose a new approach for influence assessment on Twitter network, it is based on a modified version of the conjunctive combination rule in belief functions theory in order to combine different influence markers such as retweets, mentions and replies. We experiment the proposed method on a large amount of data gathered from Twitter in the context of the European Elections 2014 and deduce top influential candidates.

Published
2015

4. Keyword based Information Retrieval System for Urdu Document Images

Author

Haris Ahmad Khan, Asif Masood, Khurram Khurshid, Raashid Hussain, Imran Siddiqi, National University of Science and Technology, Islamadad, Laboratoire Electronique, Informatique et Image [UMR6306] (Le2i), Université de Bourgogne (UB)-École Nationale Supérieure d'Arts et Métiers (ENSAM), Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique (CNRS), Institute of Space Technology, Islamabad, Bahria University, Sponsor(s):Kasetsart University in Bangkok, LE2I (Laboratoire Electronique, Image et Informatique), University of Bourgogne, UKNOW, Center of Excellence for Unified Knowledge and Language Engineering at Kasetsart University., IEEE Computer Society, IEEE Computer Society Technical & Conference Activities Board, University of Milan, Dipanda, A, Yetongnon, K, Chbeir, R, Laboratoire Electronique, Informatique et Image ( Le2i ), and Université de Bourgogne ( UB ) -AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique ( CNRS )

Subjects
[ INFO ] Computer Science [cs], Computer science, 02 engineering and technology, computer.software_genre, 01 natural sciences, Clustering, [SPI]Engineering Sciences [physics], 0103 physical sciences, [ SPI ] Engineering Sciences [physics], 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Visual Word, 010302 applied physics, Concept search, Information retrieval, Search engine indexing, Shape, Optical character recognition, Document clustering, [ SPI.TRON ] Engineering Sciences [physics]/Electronics, [SPI.TRON]Engineering Sciences [physics]/Electronics, Index (publishing), Keyword spotting, Information Retrieval, 020201 artificial intelligence & image processing, Indexing, Precision and recall, computer, Word Spotting, Partial words
Abstract

International audience; Various dynasties ruled the Indian sub-continent and left behind enormous and rich cultural heritage that also included intellectually enriched research in the shape of various documents scripted in Urdu. In order to provide efficient access to this knowledge, analysis though digitizing the existing work is the need of hour. In addition to digitization, efficient search mechanisms also need to be implemented to provide users a rapid access to the queried information. In most cases, the digitized documents are complemented by manually assigned tags which not only is a time consuming task but also provides a very limited search facility. Automating the transcription of these documents using Optical Character Recognition (OCR) systems is also challenging due to the very complex cursive nature of Urdu text. To overcome these limitations, a keyword spotting based information retrieval system for document images is introduced in this study. The proposed technique relies on two major modules, document indexing and retrieval. Images of documents are segmented into partial words (ligatures) and identical partial words (PWs) are grouped into clusters. We introduce the concept of considering each (partial) word as a unique shape and a set of shape descriptors is extracted to characterize the PWs. The clusters of PWs are used to index a given set of documents. During retrieval, the query word presented to the system is matched with the clusters in the database and all documents containing instances of the query word are retrieved and presented to the user. The system evaluated on a set of printed Urdu documents in Nastaliq font realized promising precision and recall rates.

Published
2015

5. Reduced reference 3D mesh quality assessment based on statistical models

Author

Mounir Omari, Mohammed El Hassouni, Hocine Cherifi, Ilyass Abouelaziz, Laboratoire de Recherche Informatique et Télécommunications (LRIT), Université Mohammed V de Rabat [Agdal]-Centre National de la Recherche Scientifique et Technologique (CNRST), Laboratoire Electronique, Informatique et Image [UMR6306] (Le2i), Université de Bourgogne (UB)-École Nationale Supérieure d'Arts et Métiers (ENSAM), Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique (CNRS), Sponsor(s):Kasetsart University in Bangkok, LE2I (Laboratoire Electronique, Image et Informatique), University of Bourgogne, UKNOW, Center of Excellence for Unified Knowledge and Language Engineering at Kasetsart University., IEEE Computer Society, IEEE Computer Society Technical & Conference Activities Board, University of Milan, Dipanda, A, Yetongnon, K, Chbeir, R, Laboratoire de Recherche Informatique et Télécommunications ( LRIT ), Université Mohammed 5 Agdal-Centre National de la Recherche Scientifique et Technologique ( CNRST ), Laboratoire Electronique, Informatique et Image ( Le2i ), Université de Bourgogne ( UB ) -AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique ( CNRS ), Université de Bourgogne (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Arts et Métiers (ENSAM), and HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement

Subjects
Gamma distribution, [ INFO ] Computer Science [cs], Kullback–Leibler divergence, Kullback-Leibler divergence, statistical modeling, Context (language use), 02 engineering and technology, human visual system, Databases, [SPI]Engineering Sciences [physics], [ SPI ] Engineering Sciences [physics], 0202 electrical engineering, electronic engineering, information engineering, computational geometry, Polygon mesh, [INFO]Computer Science [cs], Divergence (statistics), Mathematics, ComputingMethodologies_COMPUTERGRAPHICS, Visualization, business.industry, 020207 software engineering, Statistical model, Pattern recognition, statistical distributions, Distortion, Geometry processing, 3D triangle mesh, [ SPI.TRON ] Engineering Sciences [physics]/Electronics, image processing, [SPI.TRON]Engineering Sciences [physics]/Electronics, Human visual system model, Metric (mathematics), Solid modeling, Three-dimensional displays, 020201 artificial intelligence & image processing, Distortion measurement, Weibull distribution, Artificial intelligence, business, objective metric, Quality assessment
Abstract

International audience; During their geometry processing and transmission 3D meshes are subject to various visual processing operations like compression, watermarking, remeshing, noise addition and so forth. In this context it is indispensable to evaluate the quality of the distorted mesh, we talk here about the mesh visual quality (MVQ) assessment. Several works have tried to evaluate the MVQ using simple geometric measures, However this metrics do not correlate well with the subjective score since they fail to reflect the perceived quality. In this paper we propose a new objective metric to evaluate the visual quality between a mesh with a perfect quality called reference mesh and its distorted version. The proposed metric uses a chosen statistical distribution to extract parameters of two random variable sets, the first set is the dihedral angles related to the reference mesh, while the second set is the dihedral angles related to the distorted mesh. The perceptual distance between two meshes is computed as the Kullback-Leibler divergence between the two sets of variables. Experimental results from two subjective databases (LIRIS masking database and LIRIS/EPFL general purpose database) and comparisons with seven objective metrics cited in the state-of-the-art demonstrate the efficacy of the proposed metric in terms of the correlation to the mean opinion scores across these databases.

Published
2015
Full Text
View/download PDF

6. A Predictive Performance Model for Immersive Interactions in Mixed Reality

Author

Marcos Serrano, Emmanuel Dubois, Florent Cabric, Etude de L’Interaction Personne SystèmE (IRIT-ELIPSE), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, IdPHYX - Région Occitanie, IEEE Computer Society, IEEE VGTC, and ACM SIGGRAPH

Subjects
Design phase, Computer science, Human–computer interaction, Task analysis, Augmented reality, [INFO]Computer Science [cs], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Engineering design process, Performance model, Mixed reality, Interaction time, Task (project management)
Abstract

Preprint; International audience; The design of immersive interaction for mixed reality based on headmounted displays (HMDs), hereafter referred to as Mixed Reality (MR), is still a tedious task which can hinder the advent of such devices. Indeed, the effects of the interface design on task performance are difficult to anticipate during the design phase: the spatial layout of virtual objects and the interaction techniques used to select those objects can have an impact on task completion time. Besides, testing such interfaces with users in controlled experiments requires considerable time and efforts. To overcome this problem, predictive models, such as the Keystroke-Level Model (KLM), can be used to predict the time required to complete an interactive task at an early stage of the design process. However, so far these models have not been properly extended to address the specific interaction techniques of MR environments. In this paper we propose an extension of the KLM model to interaction performed in MR. First, we propose new operators and experimentally determine the unit times for each of them with a HoloLens v1. Then, we perform experiments based on realistic interaction scenarios to consolidate our model. These experiments confirm the validity of our extension of KLM to predict interaction time in mixed reality environments.

Published
2021

7. Message from the EDOC 2020 Workshop, Demo, and Doctoral Consortium Chairs

Author

Rychkova, Irina, Karastoyanova, Dimka, Winter, Karolin, Lê, Lam-Son, Assar, Saïd, Neumayr, Bernd, Bosson Lamouille, F., Centre de Recherche en Informatique de Paris 1 (CRI), Université Paris 1 Panthéon-Sorbonne (UP1), University of Stuttgart, University of Vienna [Vienna], Ho Chi Minh City University of Technology (HCMUT), Département Technologies, Information & Management (IMT-BS - TIM), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom Business School (IMT-BS), Institut Mines-Télécom [Paris] (IMT), Laboratoire en Innovation, Technologies, Economie et Management (EA 7363) (LITEM), Université d'Évry-Val-d'Essonne (UEVE)-Université Paris-Saclay-Institut Mines-Télécom Business School (IMT-BS), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Johannes Kepler Universität Linz - Johannes Kepler University Linz [Autriche] (JKU), IEEE Computer Society, LITEM-NPR, and Information Systems

Subjects
Computer science, [SHS.GESTION]Humanities and Social Sciences/Business administration, Library science, [INFO]Computer Science [cs]
Abstract

International audience; For over twenty years the EDOC conference has been the primary annual event for disseminating and discussing the latest developments in the area of enterprise computing. The workshop program is an important satellite event of the EDOC conference. Workshops cover more focused topics and allow for the presentation and discussion of work that is in the earlier development stages. As such, the workshops provide an excellent forum for discussing topics from the area of enterprise computing that have the potential to become important research streams within the next few years, and for discussing topics that are already important in a smaller and more focused setting. In addition to the workshop program, the EDOC Demonstration track offers an exciting and highly interactive outlet for researchers and practitioners to present prototypes and applications in the context of enterprise computing. Four demonstrations are presented this year. 2020 is the year of the COVID-19 pandemic, with a strong impact on research and social life. Despite the challenges of new organization (the conference and the workshops will be held on-line), we are proud to present an interesting program and the four workshops that will be held in conjunction with EDOC this year:• The workshop on Trends in Enterprise Architecture Research, (TEAR)• The workshop on Service-oriented Enterprise Architecture for Enterprise Engineering (SoEA4EE)• The workshop on Privacy and Security in Enterprise Modeling (PriSEM)• The workshop on Frontiers of Process Aware Systems (FoPAS).[...]

Published
2020

8. The Laws and Regulation of AI and Autonomous Systems

Author

Anthony Wong, International Federation for Information Processing [Laxenburg, Austria] (IFIP), AGW Lawyers & Consultants, Australian Computer Society (ACS), Leon Strous, Roger Johnson, David Alan Grier, and Doron Swade

Subjects
Employment, Emerging technologies, media_common.quotation_subject, ComputingMilieux_LEGALASPECTSOFCOMPUTING, 02 engineering and technology, Intellectual property, 0603 philosophy, ethics and religion, Transparency, Job transition, Automation, 020204 information systems, Liability, Control, 0202 electrical engineering, electronic engineering, information engineering, Legal certainty, Data portability, Data Protection Act 1998, [INFO]Computer Science [cs], media_common, Data protection, Intelligent decision support system, 06 humanities and the arts, Explainability, Transparency (behavior), Access, Risk analysis (engineering), Data ownership, AI, Privacy, 060301 applied ethics, Business, Legal personhood, Robots, Law, Autonomy, Regulation
Abstract

International audience; Our regulatory systems have attempted to keep abreast of new technologies by recalibrating and adapting our regulatory frameworks to provide for new opportunities and risks, to confer rights and duties, safety and liability frameworks, and to ensure legal certainty for businesses. These adaptations have been reactive and sometimes piecemeal, often with artificial delineation on rights and responsibilities and with unintended flow-on consequences. Previously, technologies have been deployed more like tools, but as autonomy and self-learning capabilities increase, robots and intelligent AI systems will feel less and less like machines and tools. There is now a significant difference, because machine learning AI systems have the ability to learn, adapt their performances and ‘make decisions’ from data and ‘life experiences’. This chapter provides brief insights on some of the topical developments in our regulatory systems and the current debates on some of the risks and challenges from the use and actions of AI, autonomous and intelligent systems [1].

Published
2020

9. The Ethics of Artificial Intelligence

Author

Chris Rees, British Computer Society - The Chartered Institute for IT (BCS), Leon Strous, Roger Johnson, David Alan Grier, and Doron Swade

Subjects
Employment, media_common.quotation_subject, 03 medical and health sciences, 0302 clinical medicine, Optimism, Bias, Liability, Personality, Data-ethics, [INFO]Computer Science [cs], 030212 general & internal medicine, Charters, 030304 developmental biology, media_common, Ethics, 0303 health sciences, Legal-personality, Ai ethics, 16. Peace & justice, Explainability, Ethics of artificial intelligence, Harmlessness, Principal (commercial law), Public trust, Engineering ethics, Consciousness, Psychology, Regulation
Abstract

International audience; This chapter focuses on the ethics of narrow, as opposed to general AI. It makes the practical as well as the philosophical case for discussion of AI ethics. It considers ethical charters, then discusses the principal ethical issues: bias, explainability, liability for failure, harmlessness, the ethical use of data, whether AIs should have legal personality, the effects on employment and society, and AIs impersonating humans. A case study is presented of AI in personal insurance. It makes the case for regulation of AI and discusses the challenges of enacting regulation. It draws conclusions, that the benefits of AI are so valuable that the ethical risks must be managed, or the benefits may be lost because of the loss of public trust. There are grounds for optimism, notably the public consciousness of the issues, the engagement of governments and the amount of private and public investment in ethical research.

Published
2020

10. Geometric Compensation of Dynamic Video Projections

Author

Michèle Gouiffès, Aleksandr Setkov, Laboratoire Vision et Ingénierie des Contenus (LVIC), Département Intelligence Ambiante et Systèmes Interactifs (DIASI), Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Direction de Recherche Technologique (CEA) (DRT (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Laboratoire d'Intégration des Systèmes et des Technologies (LIST (CEA)), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay, Laboratoire d'Informatique pour la Mécanique et les Sciences de l'Ingénieur (LIMSI), Université Paris-Sud - Paris 11 (UP11)-Sorbonne Université - UFR d'Ingénierie (UFR 919), Sorbonne Université (SU)-Sorbonne Université (SU)-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Université Paris Saclay (COmUE), IEEE Computer Society, Laboratoire d'Intégration des Systèmes et des Technologies (LIST), Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Commissariat à l'énergie atomique et aux énergies alternatives (CEA)-Université Paris-Saclay-Laboratoire d'Intégration des Systèmes et des Technologies (LIST), Université Paris Saclay (COmUE)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université - UFR d'Ingénierie (UFR 919), and Sorbonne Université (SU)-Sorbonne Université (SU)-Université Paris-Saclay-Université Paris-Sud - Paris 11 (UP11)

Subjects
business.industry, Computer science, Frame (networking), ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, Optical flow, 020207 software engineering, 02 engineering and technology, Spatial Augmented Reality, Visualization, Image (mathematics), Compensation (engineering), Homography compensation, Optical Flow, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, Computer vision, Augmented reality, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], Artificial intelligence, business, Feature Matching, Transformation geometry, Structured light
Abstract

International audience; Projector-camera systems, used in Spatial AugmentedReality, automatically adapt the video projections tothe scene objects according to the visualization conditions.This paper introduces a novel non-invasive (without StructuredLight) method based on a combination of traditionalFeature Matching (FM) and more computationally effectiveOptical Flow (OF). It requires only one projected and oneacquired image at a time in the most difficult case when bothprojected content and geometric transformations changeevery frame. It detects scene changes when OF fails andthus should be replaced by FM. In the experiments, weshow that the method yields a more precise and less shakycompensation for different types of projected videos, and isup to 2.8 times faster than previous FM-based works.

Published
2016

11. Post-Hoc Interactive Analytics of Errors in the Context of a Person Discovery Task

Author

Pierrick Bruneau, Claude Barras, Mickaël Stefas, Hervé Bredin, Johann Poignant, Laboratoire d'Informatique pour la Mécanique et les Sciences de l'Ingénieur (LIMSI), Université Paris Saclay (COmUE)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université - UFR d'Ingénierie (UFR 919), Sorbonne Université (SU)-Sorbonne Université (SU)-Université Paris-Saclay-Université Paris-Sud - Paris 11 (UP11), and IEEE Computer Society

Subjects
Post hoc, Data curation, business.industry, Computer science, 020207 software engineering, Statistical model, Context (language use), 02 engineering and technology, Space (commercial competition), Machine learning, computer.software_genre, 01 natural sciences, Task (project management), 010104 statistics & probability, Information visualization, Human–computer interaction, Analytics, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], Artificial intelligence, 0101 mathematics, business, computer
Abstract

International audience; Part of the research effort in automatic person discovery in multimedia content consists in analyzing the errors made by algorithms. However exploring the space of models relating algorithmic errors in person discovery to intrinsic properties of associated shots (e.g. person facing the camera) - coined as post-hoc analysis in this paper - requires data cura- tion and statistical model tuning, which can be cumbersome. In this paper we present a visual and interactive tool that facilitates this exploration. Adequate statistical building blocks are defined, and coordinated by visual and interactive components inspired from the literature in information visualization. A case study is conducted with multimedia researchers to validate the tool. Real data obtained from the MediaEval person discovery task was used for this experiment. Our approach yielded novel insight that was completely unsuspected previously.

Published
2016

12. IEEE International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE 2016) . Collaborative Software Processes track (Track Report)

Author

Jamoussi, Yassine, Coulette, Bernard, Laboratoire de recherche en Génie Logiciel, Applications distribuées, Systèmes décisionnels et Imagerie intelligente [Manouba] (RIADI), École Nationale des Sciences de l'Informatique [Manouba] (ENSI), Université de la Manouba [Tunisie] (UMA)-Université de la Manouba [Tunisie] (UMA), Modèles, Architectures, Composants, Agilité et prOcessus (IRIT-MACAO), Institut de recherche en informatique de Toulouse (IRIT), Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées-Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse - Jean Jaurès (UT2J)-Université Toulouse III - Paul Sabatier (UT3), Université Fédérale Toulouse Midi-Pyrénées-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique (Toulouse) (Toulouse INP), Université Fédérale Toulouse Midi-Pyrénées-Université Toulouse 1 Capitole (UT1), Université Fédérale Toulouse Midi-Pyrénées, IEEE Computer Society, Jamoussi, Yassine, and Coulette, Bernard

Subjects
Computers, Collaborative software, Conferences, [INFO]Computer Science [cs], Companies, Model driven engineering
Abstract

International audience; This report provides an introduction to the papers accepted for the CSP track at IEEE WETICE 2016.

Published
2016

13. Towards refinement types for time-dependent data-flow networks

Author

Jean-Pierre Talpin, Sandeep K. Shukla, Pierre Jouvelot, Tim, Events and Architectures (TEA), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), 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), Mines Paris - PSL (École nationale supérieure des mines de Paris), Université Paris sciences et lettres (PSL), Indian Institute of Technology Kanpur (IIT Kanpur), USAF Office for Scientific Research, grant FA8655-13-1-3049, IEEE Computer Society, LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), 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), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria), and MINES ParisTech - École nationale supérieure des mines de Paris

Subjects
Soundness, Theoretical computer science, Computer science, Programming language, concurrence, types dependants, Type inference, computer.file_format, theorie des types, computer.software_genre, Semantics, Decidability, Data flow diagram, Type theory, Logical conjunction, flot-de-donnee, [INFO]Computer Science [cs], Compiler, Executable, computer, Formal verification, ComputingMilieux_MISCELLANEOUS
Abstract

The concept of liquid clocks introduced in this paper is a significant step towards a more precise compile-time framework for the analysis of synchronous and polychromous languages. Compiling languages such as Lustre or Signal indeed involves a number of static analyses of programs before they can be synthesized into executable code, e.g., synchronicity class characterization, clock assignment, static scheduling or causality analysis. These analyses are often equivalent to undecidable problems, necessitating abstracting such programs to provide sound yet incomplete analyses. Such abstractions unfortunately often lead to the rejection of programs that could very well be synthesized into deterministic code, provided abstraction refinement steps could be applied for more accurate analysis. To reduce the number of false negatives occurring during the compilation process, we leverage recent advances in type theory — with the definition of decidable classes of value-dependent type systems — and formal verification, linked to the development of efficient SAT/SMT solvers, to provide a type-theoretic approach that considers all the above analyses as type inference problems. To simplify the exposition of our new approach in this paper, we define a refinement type system for a minimalistic, synchronous, stream-processing language to concisely represent, analyze, and verify logical and quantitative properties of programs expressed as stream-processing data-flow networks. Our type system provides a new framework for representing logical time (clocks) and scheduling properties, and to describe their relations with stream values and, possibly, other quantas. We show how to analyze synchronous stream processing programs (a la Lustre, Signal) to enable previously described analyses involved in compiling such programs. We also prove the soundness of our type system and elaborate on the adaptability of this core framework by outlining its extensibility to specific models of computations and other quantas.

Published
2015

14. Fourth IEEE Symposium on Network Cloud Computing and Applications, NCCA 2015

Author

Puliafito, Antonio, Anceaume, Emmanuelle, Kurt, Tutschku, Dimiter, Avresky, Maehle, Erik, Faculty of Engineering, University of Messina, Confidentialité, Intégrité, Disponibilité et Répartition (CIDRE), CentraleSupélec-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-Centre National de la Recherche Scientifique (CNRS), Blekinge Institute of Technology [Karlskrona] (BTH), International Research Institute for Autonomic Network Computing [Munich] (IRIANC), Institute of Computer Engineering, Universität zu Lübeck = University of Lübeck [Lübeck], IEEE Computer Society 2015, 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), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Télécom Bretagne-Université de Rennes 1 (UR1), 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), and Universität zu Lübeck [Lübeck]

Subjects
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO]Computer Science [cs], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2015

15. Models and Adaptive Architecture for Smart Data Management

Author

Michael Mrissa, Pierre De Vettor, Djamal Benslimane, De Vettor, Pierre, IEEE Computer Society, Service Oriented Computing (SOC), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and Université de Lyon-Université Lumière - Lyon 2 (UL2)

Subjects
Data element, Database, [INFO.INFO-WB] Computer Science [cs]/Web, Computer science, Distributed computing, [INFO.INFO-WB]Computer Science [cs]/Web, Enterprise information integration, [INFO] Computer Science [cs], computer.software_genre, Data warehouse, Data mapping, Data modeling, smart data, data semantics, [INFO]Computer Science [cs], Data architecture, resource oriented architecture, computer, data integration, Data migration, Data virtualization
Abstract

International audience; Organizations, companies and Web platforms hold large amounts of unused data. These data are trapped in separate data sources, locked up in legacy formats and only reachable through several different protocols, making usage difficult. It is therefore necessary to manage this multiplicity of data sources in order to build a solution able to combine this multi-origin data into a coherent smart data set. We define a meta-model and models to describe data source diversity in a flexible way. We therefore propose an adaptive architecture that generates data integration workflows at runtime. We evaluate our approach to offer scalability, responsiveness, and dynamic and transparent data source management. We apply our approach in a live scenario from a French company to show how it adapts to industrial needs and facilitates smart data production and reuse. This paper describes our models and strategies and presents our resource-oriented architecture.

Published
2015

16. Mining Relevant Sequence Patterns with CP-Based Framework

Author

Patrice Boizumault, Bruno Crémilleux, Yahia Lebbah, Willy Ugarte, Samir Loudni, Amina Kemmar, Thierry Charnois, Laboratoire d'Informatique et Technologies de l'Information d'Oran (LITIO), Université d'Oran Al-Sanya, ScaLable Information Discovery and Exploitation [Saint Martin d’Hères] (SLIDE), Laboratoire d'Informatique de Grenoble (LIG), Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS), Equipe CODAG - Laboratoire GREYC - UMR6072, Groupe de Recherche en Informatique, Image et Instrumentation de Caen (GREYC), Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)-Normandie Université (NU)-Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU), codag, Mines Nantes (Mines Nantes), Cremilleux, Bruno, IEEE Computer Society, Laboratoire d'Informatique de Paris-Nord (LIPN), and Université Sorbonne Paris Cité (USPC)-Institut Galilée-Université Paris 13 (UP13)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Sequence, Computer science, subgroup patterns, 02 engineering and technology, computer.software_genre, sub- group patterns, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Task (project management), Sequential mining, 020204 information systems, Software design pattern, 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, Regular expression, Data mining, Sequential Pattern Mining, computer
Abstract

International audience; —Sequential pattern mining under various constraints is a challenging data mining task. The paper provides a generic framework based on constraint programming to discover sequence patterns defined by constraints on local patterns (e.g., gap, regular expressions) or constraints on patterns involving combination of local patterns such as relevant subgroups and top-k patterns. This framework enables the user to mine in a declarative way both kinds of patterns. The solving step is done by exploiting the machinery of Constraint Programming. For complex patterns involving combination of local patterns, we improve the mining step by using dynamic CSP. Finally, we present two case studies in biomedical information extraction and stylistic analysis in linguistics.

Published
2014

17. A Domain-Specific Framework for Creating Early Trusted Underwater Systems Relying on Enterprise Architecture

Author

Yvon Kermarrec, Siegfried Rouvrais, Iyas Alloush, Charbel Geryes Aoun, Département Logique des Usages, Sciences sociales et Sciences de l'Information ( LUSSI ), Institut Mines-Télécom [Paris]-Télécom Bretagne-Université européenne de Bretagne ( UEB ), Lab-STICC_TB_CID_IHSEV, 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 ) -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 ), Lab-STICC_ENSTAB_ CACS_MOCS, IDM, Pôle STIC [Brest] ( STIC ), ENSTA Bretagne-ENSTA Bretagne-Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance ( Lab-STICC ), Université de Brest ( UBO ) -Université européenne de Bretagne ( UEB ) -Institut Mines-Télécom [Paris]-Centre National de la Recherche Scientifique ( CNRS ), Lab-STICC_TB_CACS_MOCS, Département informatique ( INFO ), Université européenne de Bretagne ( UEB ) -Télécom Bretagne-Institut Mines-Télécom [Paris], Process for Adaptative Software Systems ( PASS ), Télécom Bretagne-LANGAGE ET GÉNIE LOGICIEL ( IRISA-D4 ), Institut de Recherche en Informatique et Systèmes Aléatoires ( IRISA ), Université de Rennes 1 ( UR1 ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National des Sciences Appliquées ( INSA ) -Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -Université de Rennes 1 ( UR1 ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National des Sciences Appliquées ( INSA ) -Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ) -Institut de Recherche en Informatique et Systèmes Aléatoires ( IRISA ), Université de Rennes ( UNIV-RENNES ) -Université de Rennes ( UNIV-RENNES ) -Université de Bretagne Sud ( UBS ) -École normale supérieure - Rennes ( ENS Rennes ) -Institut National de Recherche en Informatique et en Automatique ( Inria ) -Institut National des Sciences Appliquées ( INSA ) -CentraleSupélec-Centre National de la Recherche Scientifique ( CNRS ), IEEE computer Society, Département Logique des Usages, Sciences sociales et Sciences de l'Information (LUSSI), Université européenne de Bretagne - European University of Brittany (UEB)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT), 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)-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), Université européenne de Bretagne - European University of Brittany (UEB), Lab-STICC_ENSTAB_CACS_MOCS, 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)-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), Département informatique (INFO), Process for Adaptative Software Systems (PASS), LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), 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), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA), 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é 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)-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), 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), Télécom Bretagne-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), 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)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), and 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)

Subjects
[ INFO.INFO-MO ] Computer Science [cs]/Modeling and Simulation, Service (systems architecture), [ INFO ] Computer Science [cs], business.industry, Modeling language, Computer science, Enterprise architecture, Context (language use), computer.software_genre, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, Domain (software engineering), World Wide Web, Videoconferencing, ArchiMate, Modeling analysis, [INFO]Computer Science [cs], Model-driven architecture, networking domain, Software engineering, business, computer, computer.programming_language
Abstract

International audience; Service Creation Environments facilitate the creation of complex services and play a major role in the software industry. In this context, we aim at developing a domainspecific framework (networking domain) that uses a chain of existing ”off-the-shelf” tools that are integrated together fromthe design phase to the verification activities. In this paper, we propose a new meta-model that extends ArchiMate to provide a domain-specific modeling language concerning the Deep Sea Observatories (DSO). We instantiate, as a case study, DSO model with identification and localization functions from this language, and apply it to our framework that relies on an IMS platform to evaluate the service model. These functions can beorchestrated with other services (e.g. military or civil reaction) or interconnected with other SOSystems. On the one hand, this illustrates our approach in relying on Enterprise Architecture (EA) framework that respects: multiple-views, perspectives of stakeholders, and domain specificities. On the other hand, it shows the reusability of our framework by changing applications from different domains: Video Conference as a Telecom Service, and Localizations for DSO.

Published
2014

18. Bi-level token ring for multilateral negotiations

Author

Romain Cailliere, Samir Aknine, Souhila Arib, Chantal Berdier, Graphes, Algorithmes et Multi-Agents (GrAMA), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Systèmes Cognitifs et Systèmes Multi-Agents (SyCoSMA), Développement Urbain (EDU), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon, and IEEE Computer Society

Subjects
Knowledge management, business.industry, Computer science, Process (engineering), media_common.quotation_subject, Multi-agent system, 05 social sciences, Context (language use), 02 engineering and technology, 16. Peace & justice, Negotiation, Information asymmetry, Risk analysis (engineering), 0502 economics and business, 0202 electrical engineering, electronic engineering, information engineering, Key (cryptography), 050211 marketing, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], business, Token ring, Protocol (object-oriented programming), media_common
Abstract

International audience; Negotiation is a fundamental mechanism in multi-agent systems since it allows self-interested agents to come to mutual agreements and to distribute resources efficiently and effectively. However, in competitive situations, the agents need to negotiate repeatedly with one another, thus developing mechanisms that are effective over repeated interactions is a key challenge. At present, few research work deals with designing mechanisms for complex multilateral negotiations in which agents’ interactions are fully decentralized. We tackle the problem of multilateral negotiation where a group of agents has to make a joint decision. The explanatory breadth of this mechanism is illustrated by looking at its applicability in situations in which agents are self-interested, have asymmetric information, are motivated by individual interests but they have to converge to an agreement, and behave opportunistically. We search to guide the agents in their process, promote even partial solutions and facilitate the achievement of agreements specially in presence of large sets of agents where negotiation is notably difficult and convergence is hardly achieved. To this end, the protocol we propose leads the agents in efficiently coordinating their negotiations and to coming to an agreement based on provided rules. Negotiation illocutions are formalised to allow interactions between the agents. In addition rules are provided for the agents to manage their interactions. We introduce an illustrative scenario and detail the properties of our protocol. Experimental results show that our protocol guides the agents towards an agreement with reasonable communication and computational complexity.

Published
2014

19. Model Driven Conformance Testing for Standardized Services

Author

Nicolas Figay, Malik Khalfallah, Parisa Ghodous, Mahmoud Barhamgi, EADS Innovation Works [Suresnes] (EADS IW), EADS - European Aeronautic Defense and Space, Airbus Group Innovations [Suresnes], Airbus [France], Service Oriented Computing (SOC), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and IEEE Computer Society

Subjects
business.industry, Computer science, Software as a service, Software development, computer.software_genre, Software framework, Software construction, [INFO]Computer Science [cs], Software requirements, Software reliability testing, Software verification and validation, Software engineering, business, Software measurement, computer, ComputingMilieux_MISCELLANEOUS
Abstract

Software applications that are provided through services following the Software as a service (SaaS) paradigm generally need to be compliant to some standards. In order to select the software application that provides the most conformant service interface, we develop a formal framework that tests the compliance and reports quantitative results that help experts to take the right decision. Unlike existing work that focuses on a single dimension when checking the compliance of a software application with the corresponding standard (for example the functional dimension exclusively, or the syntactic dimension exclusively), in this work we consider multiple dimensions at the same time. This provides more comprehensive results. We implemented a prototype and we tested our framework on a case study regarding the selection of software applications for our collaborative platform.

Published
2014

20. A Fuzzy Clustering-Based Credibility Model for Trust Assessment in a Service-Oriented Architecture

Author

Djamal Benslimane, Noura Faci, Zakaria Maamar, Zohra Saoud, Service Oriented Computing (SOC), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), Zayed University, and IEEE Computer society

Subjects
Fuzzy clustering, Clustering algorithms, computer.internet_protocol, Computer science, Process (engineering), Credibility, 02 engineering and technology, computer.software_genre, Machine learning, Trust, 03 medical and health sciences, 0302 clinical medicine, 0202 electrical engineering, electronic engineering, information engineering, Social network services, [INFO]Computer Science [cs], 030216 legal & forensic medicine, Cluster analysis, Set (psychology), Robustness, business.industry, Communities, Computational modeling, Service-oriented architecture, 020201 artificial intelligence & image processing, Artificial intelligence, Data mining, Web service, business, WS-Policy, computer, Web Service
Abstract

International audience; This paper presents a credibility model to assess trust of Web services. The model relies on consumers' ratings whose accuracy can be questioned due to different biases. A category of consumers known as strict are usually excluded from the process of reaching a majority consensus. We demonstrated that this exclusion should not be. The proposed model reduces the gap between these consumers' ratings and the current majority rating. Fuzzy clustering is used to compute consumers' credibility. To validate this model a set of experiments are carried out.

Published
2014

21. MASC : MAp Sectors Creator - A tool to help at the configuration of multi-agents systems for everyone

Author

Joel Kwan, Yassine Gangat, Rémy Courdier, Aurélie Gaudieux, Laboratoire d'Informatique et de Mathématiques (LIM), Université de La Réunion (UR), Centre d'Économie et de Management de l'Océan Indien (CEMOI), École supérieure d’Ingénieurs Réunion Océan Indien (ESIROI), Institute for Systems and Technologies of Information, Control and Communication (INSTICC), Austrian Computer Society, Vienna University of Technology – TU Wien (TUW), Mohammad S. Obaidat, Janusz Kacprzyk, Tuncer Ören, Laboratoire d'Informatique et de Mathématiques ( LIM ), Université de la Réunion ( UR ), Centre d'Économie et de Management de l'Océan Indien ( CEMOI ), and ESIROI

Subjects
[ INFO ] Computer Science [cs], Database, business.industry, Computer science, Multi-agent system, Distributed computing, 05 social sciences, Initialization, Context (language use), computer.software_genre, USable, Grid, Automation, Field (computer science), 0502 economics and business, [INFO]Computer Science [cs], 050207 economics, business, Energy source, computer, 050203 business & management
Abstract

International audience; The initialization at the beginning of all type of simulation is recurring. In the field of multi-agents, spatial environments on a micro or macro scale, or more abstract context, such as mapping out energy sources for example, need often to be modelled. The initialization of these environments wherein evolve agents is generally tedious and time-consuming depending on the fineness of the mesh of the cutting in case of a 2D spatial representation. In this paper, we present MASC (Map Sectors Creator), a user-oriented tool that permits easy initialization through the creation of a mesh directly usable in multi-agents systems simulations platforms. The automation of cutting out maps followed by the generation of directly usable code snippets optimize the working time on initialization and allow to focus on the simulations results and observations.

Published
2014
Full Text
View/download PDF

22. Modeling and analysis of reliable Contract Net Protocol Using Timed Colored Petri Nets

Author

Ramdane Maamri, Samir Aknine, Djamila Boukredera, Laboratoire d'Informatique Répartie [Algérie] (LIRE), Université de Constantine 2 Abdelhamid Mehri [Constantine], Graphes, Algorithmes et Multi-Agents (GrAMA), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and IEEE Computer Society

Subjects
Correctness, Computer science, Distributed computing, Multi-agent system, Concurrency, Fault tolerance, 0102 computer and information sciences, 02 engineering and technology, Petri net, 01 natural sciences, Task (project management), Contract Net Protocol, CPN Tools, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs]
Abstract

International audience; Contract Net Protocol (CNP) is probably the most widely used task allocation protocol in distributed multi-agent systems (MAS). However it is limited in some issues and has serious drawbacks if it is applied in such real world applications where temporal interaction aspects are of great importance and fault-tolerance is a crucial issue. Many researchers have proposed various methods to expand and to improve it but those challenges have not been much addressed. To cope with these limitations, this paper proposes a formal model that extends the conventional contract net with real time constraints, often defined as interaction duration and message deadlines, and fault tolerance to handle the agent death exception. In this study we concentrate on the reliability of the awarded contractor which may die while carrying out the assigned task. In the proposed approach a timeout mechanism is modeled to detect the crash failure of the contractor, hence a proper termination of the negotiation process can be timely performed by the manager ensuring the failure recovery. We model the extended CNP with timed colored Petri nets and show that it terminates correctly either in a safety case or in a failure situation. The model analysis by means of CPN tools proves that the protocol meets the key properties namely model correctness, deadline respect, absence of deadlocks and live locks, absence of dead code, agent terminal states consistency, concurrency and validity.

Published
2013

23. Preferences and Constraints for Agent Coalition Formation

Author

Souhila Arib, Samir Aknine, Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Graphes, Algorithmes et Multi-Agents (GrAMA), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and IEEE Computer Society

Subjects
021103 operations research, Knowledge management, Operations research, Computer science, business.industry, Multi-agent system, media_common.quotation_subject, 0211 other engineering and technologies, 02 engineering and technology, 16. Peace & justice, ComputingMethodologies_ARTIFICIALINTELLIGENCE, Negotiation, Order (exchange), 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, business, Constraint satisfaction problem, media_common
Abstract

International audience; In this paper, we tackle the problem of coalition formation in multi-agent systems. We detail a new coalition formation model that uses the constraints of the agents to guide their search for coalitions and to derive their preferences in order to facilitate their negotiations. Our work focuses especially on agents which are self-interested and want to cooperate in executing actions in their plans. We propose a general framework for the coalition formation in which the constraints are used to form suitable coalitions. We describe a procedure that transforms such constraints into a structured input which is used by the agents during their negotiations. Then, we present the method which enables the agents to select the partners that are most likely to be interested in sharing their actions. We detail this method and provide the results of its experimental evaluation.

Published
2013

24. An Architecture to Combine Activity Traces and Reporting Traces to Support Self-Regulation Processes

Author

Elise Lavoué, Min Ji, Sébastien George, Christine Michel, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), Laboratoire de Recherche Magellan, Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université de Lyon-Institut d'Administration des Entreprises (IAE) - Lyon, Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Centre de Recherche Magellan, Institut d'Administration des Entreprises (IAE) - Lyon-Université Jean Moulin - Lyon 3 (UJML), Université de Lyon-Université de Lyon, Supporting Interaction and Learning by Experience (SILEX), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), and IEEE Computer Society ed.

Subjects
self-regulation, Computer science, Process (engineering), Information architecture, [SHS.EDU]Humanities and Social Sciences/Education, collaborative learning, 02 engineering and technology, computer.software_genre, information architecture, Data visualization, Human–computer interaction, 020204 information systems, project-based learning, 0202 electrical engineering, electronic engineering, information engineering, ComputingMilieux_COMPUTERSANDEDUCATION, [INFO]Computer Science [cs], Architecture, reporting, Multimedia, business.industry, 4. Education, 05 social sciences, 050301 education, Collaborative learning, Cognition, activity traces, Project-based learning, Learning Management, [INFO.EIAH]Computer Science [cs]/Technology for Human Learning, business, Software architecture, 0503 education, computer
Abstract

International audience; In this paper, we propose an architecture of Project- Based Learning Management System (PBLMS). These systems offer learners indicators to support self-regulation in PBL. Indeed, when students are engaged in learning processes with LMS, they are supposed to be autonomous to find information or to organize their activities. Indeed, most of time, few tools are proposed to help them. Our research focuses on the tools which support meta-cognition process to teach learners how to regulate their learning activities during projects. In this paper, we propose a PBLMS architecture that combines together activity traces (which are recorded automatically by the system) and reporting traces (which are reported by learners themselves). This architecture allows learners to build indicators. They can specify the data to take into account and the visualization modes. We present the details of the reporting tool, used to collect reporting traces, which can enhance learners' reflective processes on their own way to learn.

Published
2013

25. Avoiding Lock-In: Timely Reconfiguration of a Virtual Cloud Platform on Top of Multiple PaaS and IaaS Providers

Author

Paulo Rupino da Cunha, Catarina Ferreira da Silva, Paulo Melo, DEI/CISUC, University of Coimbra [Portugal] (UC), Faculdade De Economia Da Universidade De Coimbra (University of Coimbra) (FEUC), Service Oriented Computing (SOC), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and IEEE Computer Society

Subjects
Flexibility (engineering), reconfiguration, business.industry, Operating environment, Computer science, Software as a service, IaaS, Control reconfiguration, Cloud computing, computer.software_genre, Outsourcing, SaaS, Insourcing, Virtual machine, Operating system, [INFO]Computer Science [cs], PaaS, business, Cloud, computer, lock-in
Abstract

International audience; We describe our work with a major telecom company in creating a broker that enables them to retain independence from the various PaaS and IaaS providers that they use to support their own SaaS offer on the cloud. To achieve this goal, the broker starts by setting up the required operating environment across the desired mix of PaaS and IaaS providers, and then installs and configures the telco’s software on top of that virtual platform. The automation and articulation of these procedures confers the company a considerable flexibility. By updating the list of preferred PaaS providers maintained by our system and forcing a redeploy of the whole environment, it can move services from one supplier to the next, or even to virtual machines running in-house, in a matter of minutes. The most favorable combination of outsourcing and insourcing can be constantly pursued, by pondering factors such as cost, SLAs, and other factors on a provider-by-provider basis.

Published
2013

26. A Framework for Building Privacy-Conscious DaaS Service Mashups

Author

Mahmoud Barhamgi, Djamal Benslimane, Salah-Eddine Tbahriti, Michael Mrissa, Chirine Ghedira, Service Oriented Computing (SOC), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and IEEE Computer Society

Subjects
020203 distributed computing, Service (systems architecture), Information privacy, Computer science, Semantics (computer science), InformationSystems_INFORMATIONSYSTEMSAPPLICATIONS, 02 engineering and technology, computer.file_format, computer.software_genre, World Wide Web, Set (abstract data type), 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Mashup, Transient (computer programming), [INFO]Computer Science [cs], Web service, RDF, InformationSystems_MISCELLANEOUS, computer
Abstract

Data Mashup is a special class of mashup application that combines information on the fly from multiple data sources to respond to transient business needs. Data mashup is a difficult task that would require an important programming skill on the side of mashups' creators, and involves handling many challenging privacy and security concerns raised by data providers. This situation prevents non-expert users from mashing up data at large. In this paper, we present a declarative approach for mashing-up data. The approach allows data mashup creators to build data mashups without any programming involved. The approach builds the mashups automatically and takes into account the data's privacy concerns. We evaluate the efficiency of the approach via a thorough set of experiments. The results show that handling data privacy introduces only a negligible cost in the mashup building time.

Published
2011

27. 3D Feature Line Detection based on Vertex Labeling and 2D Skeletonization

Author

Sophie Viseur, Jean-Luc Mari, Dimitri Kudelski, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), Aix Marseille Université (AMU), IEEE Computer Society Publisher, and Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU)

Subjects
business.industry, Feature extraction, 020207 software engineering, Pattern recognition, 02 engineering and technology, Mathematical morphology, Edge detection, Skeletonization, Vertex (geometry), Mesh generation, 0202 electrical engineering, electronic engineering, information engineering, sort, 020201 artificial intelligence & image processing, Polygon mesh, [INFO]Computer Science [cs], Artificial intelligence, business, ComputingMilieux_MISCELLANEOUS, Mathematics
Abstract

In this paper, we present an approach to extract feature lines on a 3D mesh. The main problem of classical methods is the difficulty to obtain connectivity of resulting lines. In order to sort out this recurrent problem, we propose an algorithm based on the following ideas. The first one is to label candidate points: they characterize the relevant areas corresponding to the expected features. Our second idea is to unfold this binary flagged mesh into a 2D space in order to use well-known morphological operators. By mapping the resulting output back on the mesh, we get relevant and connected feature lines. We then apply this technique to geological data scans to extract fractures and bench limits.

Published
2010

28. Personality, Emotions and Physiology in a BDI Agent Architecture: The PEP-> BDI Model

Author

Jones, Hazaël, Saunier, Julien, Lourdeaux, Domitile, Analyse des Systèmes et Biométrie (ASB), Institut National de la Recherche Agronomique (INRA), Information – Technologies – Analyse Environnementale – Procédés Agricoles (UMR ITAP), Centre international d'études supérieures en sciences agronomiques (Montpellier SupAgro)-Centre national du machinisme agricole, du génie rural, des eaux et forêts (CEMAGREF), Heuristique et Diagnostic des Systèmes Complexes [Compiègne] (Heudiasyc), Université de Technologie de Compiègne (UTC)-Centre National de la Recherche Scientifique (CNRS), IEEE Computer Society, ANR-07-SECU-0005,SAGECE,Simulation pour l'Amélioration de la formation à la GEstion de CrisE(2007), and Saunier, Julien

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs], ComputingMilieux_MISCELLANEOUS, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

International audience; Global security is a growing problematic nowadays. In particular, terrorist threats bring security actors to look for new training tools for major scale crisis. In this context, simulation by multi-agent system enables the actors to observe the effects of their actions. In this article, we propose an extension of BDI architecture that consider physiology, emotion and personality: PEP -> BDI, and show how it is used to model crisis situations.

Published
2009

29. Physical Layout Segmentation of Mail Application Dedicated to Automatic Postal Sorting System

Author

Frank Lebourgeois, Véronique Eglin, Hubert Emptoz, Djamel Gaceb, Extraction de Caractéristiques et Identification (imagine), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and IEEE Computer Society

Subjects
Connected component, business.industry, Computer science, Graph colouring, 020207 software engineering, 02 engineering and technology, Image segmentation, Rejection rate, Machine learning, computer.software_genre, 01 natural sciences, 010309 optics, Robustness (computer science), 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, Segmentation, [INFO]Computer Science [cs], Artificial intelligence, Graph coloring, business, computer
Abstract

International audience; Every day, the postal sorting systems diffuse several tons of mails. It is noted that the principal origin of mail rejection is related to the failure of address-block localization task, particularly, of the physical layout segmentation stage. The bottom-up and top-down segmentation methods bring different knowledge that should not be ignored when we need to increase the robustness. Hybrid methods combine the two strategies in order to take advantages of one strategy to the detriment of other. Starting from these remarks, our proposal makes use of a hybrid segmentation strategy more adapted to the postal mails. The high level stages are based on the hierarchical graphs coloring, allowing managing through a pyramidal data organization, the complex rules leading the interpretation of the connected components decomposition of interest zones. Today, no other work in this context has make use of the powerfulness of this tool. The performance evaluation of our approach was tested on a corpus of 10000 envelope images. The processing times and the rejection rate were considerably reduced.; .

Published
2008

30. A User-Profile-Oriented Mediation Architecture for Very Large DataBases in a Dynamic Inter-Grid Context

Author

N. Bennani, N.H. Andrianarisoa, J. Gossa, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), and IEEE Computer Society

Subjects
User profile, Distributed database, Database, Computer science, Virtual organization, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, computer.software_genre, Grid, World Wide Web, Grid computing, Middleware (distributed applications), 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, Software architecture, computer
Abstract

International audience; In the last years, several distributed system paradigms have emerged, aiming at the share of a large amount of resources among a large number of users. The Virtual Organizations concept in a multi-institutional context presents obviously numerous opportunities for business applications as well as for scientific ones. Nevertheless, the current trends seem to lead to several independent specialized grids in opposition to the early vision of one generic world wide grid. In such a context, large scale heterogeneous databases must be seen as several specialized databases homed in different grids. The challenge is to allow users of these grids to access all databases with the same efficiency that if they are supported by the same grid. Our proposal is an overlay software architecture built on top of grid middlewares which acts on behalf of the user to facilitate the use of inter-grid databases. The proposed mediation solution deals with database heterogeneity and access rights management and is capable of making decisions regarding the selection of resources according to their homing grid and infrastructure performances.

Published
2008

31. Engineering Communities of Web services

Author

Sattanathan, Subramanian, Thiran, Philippe, Maamar, Zakaria, Benslimane, Djamal, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), Austrian Computer Society, and SI LIRIS, Équipe gestionnaire des publications

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs]
Abstract

Later on, Plus tard

Published
2007

32. ORIGAMI: Mining Representative Orthogonal Graph Patterns

Author

Vineet Chaoji, M. Al Hasan, J. Besson, Saeed Salem, Mohammed J. Zaki, Rensselaer Polytechnic Institute (RPI), Data Mining and Machine Learning (DM2L), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and IEEE Computer Society Press

Subjects
Traverse, business.industry, Two-graph, User defined, Graph theory, Pattern recognition, 02 engineering and technology, computer.software_genre, Randomized algorithm, 020204 information systems, Graph patterns, 0202 electrical engineering, electronic engineering, information engineering, Graph (abstract data type), [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, Artificial intelligence, Data mining, Pattern space, business, computer, Mathematics
Abstract

International audience; In this paper, we introduce the concept of alpha-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are alpha-orthogonal if their similarity is bounded above by alpha. Each alpha-orthogonal pattern is also a representative for those patterns that are at least beta similar to it. Given user defined alpha, beta in [0, 1], the goal is to mine an alpha-orthogonal, beta-representative set that minimizes the set of unrepresented patterns. We present ORIGAMI, an effective algorithm for mining the set of representative orthogonal patterns. ORIGAMI first uses a randomized algorithm to randomly traverse the pattern space, seeking previously unexplored regions, to return a set of maximal patterns. ORIGAMI then extracts an alpha-orthogonal, beta-representative set from the mined maximal patterns. We show the effectiveness of our algorithm on a number of real and synthetic datasets. In particular, we show that our method is able to extract high quality patterns even in cases where existing enumerative graph mining methods fail to do so.

Published
2007

33. A Composition Approach to Mutual Exclusion Algorithms for Grid Applications

Author

Pierre Sens, F. Legond-Aubry, Luciana Arantes, Julien Sopena, Large-Scale Distributed Systems and Applications (Regal), 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)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Modélisation et Vérification (MoVe), 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), IEEE Computer Society, and Grid'5000

Subjects
020203 distributed computing, Computer science, Distributed computing, Testbed, 020206 networking & telecommunications, 02 engineering and technology, Grid, computer.software_genre, Security token, Grid computing, Scalability, 0202 electrical engineering, electronic engineering, information engineering, Cluster (physics), [INFO]Computer Science [cs], Mutual exclusion algorithms, computer
Abstract

International audience; We propose a new composition approach to mutual exclusion algorithms for applications spread over a grid which is composed of a federation of clusters. Taking into account the heterogeneity of communication latency, our hierarchical architecture combines intra and inter cluster algorithms. We focus on token-based algorithms and study different compositions of algorithms. Performance evaluation tests have been conducted on a national grid testbed whose results show that our approach is scalable and that the choice of the most suitable inter cluster algorithm depends on the behavior of the application.

Published
2007

34. Morph Digital Signature A New Signature Framework for e-Documents in Pervasive Environments

Author

Lionel Brunie, Rachid Saadi, Jean-Marc Pierson, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), and IEEE Computer Society Press

Subjects
Authentication, Ubiquitous computing, Computer science, Data security, Context (language use), 02 engineering and technology, Information security, Certificate, World Wide Web, Non-repudiation, Digital signature, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs]
Abstract

International audience; Nowadays the exchange of documents, information and data is fulfilled through an electronic format. This arises security problems (i.e. Authentication, non repudiation and privacy). In order to tackle some security issues, the digital signature allows to strongly identify the signatory and prevents against any signed content violation. However with the evolution of distributed systems, context adaptation appears as a very important constraint in ubiquitous environment especially in pervasive and mobile environments. Indeed the most of electronic documents (e.g. book, journal, certificate etc.) should be adapted to contextual situation.In this paper we propose a new signature mechanism (Morph Digital Signature). It enables any trusted entity to blind or to disclose only authorized parts from document according to user and environment constraints. We have also adapted the morph signature to certificate issues by providing a trust entity the ability to morph their certificates format according to pervasive context.

Published
2007

35. A New Certificate Signature for Pervasive Environment

Author

Lionel Brunie, Rachid Saadi, Jean-Marc Pierson, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), IEEE Computer Society Press, and SI LIRIS, Équipe gestionnaire des publications

Subjects
021110 strategic, defence & security studies, Public key certificate, Computer science, business.industry, Internet privacy, 0211 other engineering and technologies, 02 engineering and technology, [INFO] Computer Science [cs], Self-signed certificate, Computer security, computer.software_genre, Certificate, Chain of trust, Authorization certificate, Root certificate, 020204 information systems, Certificate authority, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], business, Implicit certificate, computer
Abstract

International audience; In distributed systems especially in pervasive environments, the users usually face difficulties to obtain permissions to use the surrounding resources. Either they have an account locally, or they can show a certificate obtained beforehand given them the access. Problems arise when they arrive in an unknown environment occurring in a pervasive environment. In this paper, we propose the Chameleon architecture which offers users an access if they arrive with trusted certificates. These certificates may be gathered during her trip. Then, according to a trust relationships, a direct or a transitive site access is provided. We describe a new kind of certificate to set up a contextual broader access. Indeed, the X316 enables users to blind some attributes of their personal information embedded in the certificate and to disclose only what is mandatory for a given access.

Published
2007

36. Using Argumentative Agents to Manage Communities of Web Services

Author

Djamal Benslimane, Philippe Thiran, Jamal Bentahar, Zakaria Maamar, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), IEEE Computer Society, and SI LIRIS, Équipe gestionnaire des publications

Subjects
Web analytics, Web standards, medicine.medical_specialty, Knowledge management, Web development, Web 2.0, computer.internet_protocol, Computer science, Services computing, 02 engineering and technology, Web engineering, [INFO] Computer Science [cs], computer.software_genre, Application software, Social Semantic Web, World Wide Web, 020204 information systems, Web design, 0202 electrical engineering, electronic engineering, information engineering, medicine, Web navigation, [INFO]Computer Science [cs], WS-Addressing, business.industry, WS-I Basic Profile, 020206 networking & telecommunications, Service-oriented architecture, Web application security, Web Accessibility Initiative, Web service, Web intelligence, business, WS-Policy, computer, Web modeling, XML
Abstract

This paper presents a framework for specifying Web services communities. A Web service is an accessible application that humans, software agents, and other applications in general can discover, compose, and invoke in order to satisfy users' needs like hotel booking. Web services providing the same functionality are gathered into one community, independently of their origins. This framework shows how software agents that are able to argue, negotiate, and reason about Web services can be used to specify these Web services and to manage their respective communities. The use of what we call argumentative agents helps Web services in being better organized within communities and in achieving the goals for which they are conceived. The community is led by a master component, which among others attracts new Web services to the community, retains existing Web services in the community, and identifies the Web services in the community that will participate in composite Web services. All these operations are managed by interacting agents through flexible conversations made up by argumentation, persuasion, and negotiation phases called dialogue games.

Published
2007

37. Towards A Two-Layered Framework for Managing Web Services Interaction

Author

Quan Z. Sheng, Djamal Benslimane, Zakaria Maamar, SI LIRIS, Équipe gestionnaire des publications, IEEE Computer Society, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), and Université de Lyon-Université Lumière - Lyon 2 (UL2)

Subjects
WS-Addressing, medicine.medical_specialty, WS-I Basic Profile, computer.internet_protocol, Computer science, Services computing, 020207 software engineering, 02 engineering and technology, Service-oriented architecture, [INFO] Computer Science [cs], computer.software_genre, Business Process Execution Language, World Wide Web, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, medicine, [INFO]Computer Science [cs], Web service, WS-Policy, Web modeling, computer
Abstract

later on, plus tard

Published
2007

38. WeSCo_CBR: How to Compose Web Services via Case Based Reasoning

Author

Khaled Ghedira, Chirine Ghedira, Djamal Benslimane, Soufiene Lajmi, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), IEEE Computer Society, SI LIRIS, Équipe gestionnaire des publications, Service Oriented Computing (SOC), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Stratégies d’Optimisation et Informatique intelligentE (SOIE), and Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.)-ISG

Subjects
Web standards, 021110 strategic, defence & security studies, medicine.medical_specialty, Computer science, business.industry, 0211 other engineering and technologies, 02 engineering and technology, [INFO] Computer Science [cs], computer.software_genre, Social Semantic Web, GeneralLiterature_MISCELLANEOUS, World Wide Web, 0202 electrical engineering, electronic engineering, information engineering, medicine, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], Semantic Web Stack, Web service, WS-Policy, business, Web modeling, computer, Semantic Web, Data Web
Abstract

Later on, Plus tard

Published
2006

39. Performance evaluation of a fair fault-tolerant mutual exclusion algorithm

Author

Pierre Sens, Luciana Arantes, Julien Sopena, Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Large-Scale Distributed Systems and Applications (Regal), 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 Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), IEEE Computer Society, Grid'5000, and Sopena, Julien

Subjects
020203 distributed computing, Computer science, business.industry, Distributed computing, 020206 networking & telecommunications, Fault tolerance, 02 engineering and technology, [INFO] Computer Science [cs], Security token, Tree (data structure), Suzuki-Kasami algorithm, Distributed algorithm, 0202 electrical engineering, electronic engineering, information engineering, Overhead (computing), [INFO]Computer Science [cs], Mutual exclusion, business, Algorithm, Queue, Computer network
Abstract

International audience; This paper presents an efficient and fair fault-tolerant token-based algorithm for achieving mutual exclusion. It is an extension of the Naimi-Trehel algorithm that uses a distributed queue of token requests and a dynamic tree. In case of failures, our algorithm tries to recover the requests' queue by gathering intact portions of the one which existed just before the failure. Thus, fairness of token requests is preserved despite failures. Furthermore, the use of broad- cast is minimized when rebuilding the dynamic tree. Experiment results with different fault injection scenar- ios show that our approach presents a fast failure recovery and low message broadcast overhead.

Published
2006

40. The Web and Complex Adaptive Systems

Author

A. Rattrout, Salima Hassas, Maya Rupert, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), IEEE Computer Society Press, and SI LIRIS, Équipe gestionnaire des publications

Subjects
medicine.medical_specialty, business.industry, Computer science, 02 engineering and technology, Web engineering, [INFO] Computer Science [cs], computer.software_genre, Social Semantic Web, World Wide Web, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, medicine, 020201 artificial intelligence & image processing, Mashup, The Internet, [INFO]Computer Science [cs], Web content, Web intelligence, business, Complex adaptive system, computer, Web modeling, Content management
Abstract

International audience; The web continues to grow at a phenomenal rate and the amount of information on the web is overwhelming. Finding the relevant information remains a big challenge. Due to its wide distribution, its openness and high dynamics, the WWW is a complex system, for which we have to imagine mechanisms of content maintaining, filtering and organizing that are able to deal with its evolving, dynamics and distribution. Integrating mechanisms of self-organization of the web content is an attractive perspective, to match with these requirements. This paper explores the web from a complex adaptive system (CAS) perspective. It reviews some characteristic behaviours of CAS and shows how the web exhibits similar behaviours. We illustrate with a model for web content organization adopting the CAS vision and using the multi-agent paradigm.

Published
2006

41. Analyzing behavioral data for refining cognitive models of operator

Author

olivier georgeon, Mille, A., Bellet, T., SI LIRIS, Équipe gestionnaire des publications, IEEE Computer Society, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), Laboratoire Ergonomie et Sciences Cognitives pour les Transports (IFSTTAR/TS2/LESCOT), and Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux (IFSTTAR)-Université de Lyon

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs]
Abstract

International audience; We present a methodology and a tool for analyzing the activity of an operator interacting with a complex technical device. The goal is of refining cognitive models of the operator by relating them to patterns of behavior in real situations. The activity is observed to be modeled as a trace having a graph structure. The trace is transformed according to a "use model" in order to become meaningful in the context of modeling theories. Our "Trace Based System" thus gathers both a representation of the activity and of the analyst's expertise for facilitating the discovery of knowledge in the field of cognitive psychology. The approach is illustrated by its application for car driver cognitive modeling.

Published
2006

42. A View-based approach for tracking composite Web services

Author

Chirine Ghedira, Zakaria Maamar, Djamal Benslimane, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), IEEE Computer Society, and SI LIRIS, Équipe gestionnaire des publications

Subjects
WS-Addressing, medicine.medical_specialty, Computer science, computer.internet_protocol, WS-I Basic Profile, Services computing, 02 engineering and technology, Service-oriented architecture, [INFO] Computer Science [cs], computer.software_genre, Business Process Execution Language, World Wide Web, Human–computer interaction, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, medicine, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], Web service, WS-Policy, computer, Web modeling
Abstract

Later on, Plus tard

Published
2005

43. Toward a near optimal quad/triangle subdivision surface fitting

Author

Guillaume Lavoué, Atilla Baskurt, Florent Dupont, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), IEEE Computer Society Press, and SI LIRIS, Équipe gestionnaire des publications

Subjects
business.industry, 020207 software engineering, Geometry, 02 engineering and technology, [INFO] Computer Science [cs], Curvature, Vertex (geometry), Polyhedron, Mesh generation, 0202 electrical engineering, electronic engineering, information engineering, Piecewise, 020201 artificial intelligence & image processing, Polygon mesh, Subdivision surface, [INFO]Computer Science [cs], business, Algorithm, Mathematics, Subdivision, ComputingMethodologies_COMPUTERGRAPHICS
Abstract

International audience; In this paper we present a new framework for subdivision surface fitting of arbitrary surfaces (not closed objects) represented by polygonal meshes. Our approach is particularly suited for output surfaces from a mechanical or CAD object segmentation for a piecewise subdivision surface approximation. Our algorithm produces a mixed quadrangle-triangle control mesh, near optimal in terms of face and vertex numbers while remaining independent of the connectivity of the input mesh. The first step approximates the boundaries with subdivision curves and creates an initial subdivision surface by optimally linking the boundary control points with respect to the lines of curvature of the target surface. Then, a second step optimizes the initial control polyhedron by iteratively moving control points and enriching regions according to the error distribution. Experiments conducted on several surfaces and on a whole segmented mechanical object, have proven the coherency and the efficiency of our algorithm, compared with existing methods.

Published
2005

44. An Efficient Network API for in-Kernel Applications in Clusters

Author

P. Vicat-Blanc Primet, Olivier Glück, Brice Goglin, Laboratoire de l'Informatique du Parallélisme (LIP), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon), Laboratoire de l'informatique du parallélisme, École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Protocols and softwares for very high-performance network (RESO), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS), IEEE Computer Society Press, Grid'5000 these, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure de Lyon (ENS de Lyon)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Application programming interface, Computer science, Réseaux locaux haute performance, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 02 engineering and technology, computer.software_genre, 020202 computer hardware & architecture, Kernel (image processing), in-kernel network API, 0202 electrical engineering, electronic engineering, information engineering, Operating system, interface de programmation réseau dans le noyau, systèmes de fichiers distribués, protocole socket zéro-copie, 020201 artificial intelligence & image processing, zero-copy socket protocols, [INFO]Computer Science [cs], Myrinet, High-speed local networks, distributed file systems, Distributed File System, computer
Abstract

Running parallel applications on clusters with high-speed local networks requires fast communication between computing nodes but also low latency and high bandwidth file access. However, the application programming interfaces of high-speed local networks were designed for MPI communication and do not always meet the requirements of other applications like distributed file systems. In this paper, we explore several solutions to improve the use of high-speed network for in-kernel applications. Distributed file systems implemented on top of the GM interface of Myrinet are first examined to demonstrate how hard it is to get an efficient interaction between such applications and the network. Then, we propose solutions to simplify and improve this interaction and integrate them into the kernel interface of the new Myrinet driver, MX. Performance comparisons between MX and GM, and their usage in both a distributed file system and a zero-copy protocol show nice improvements. Moreover, we are able to improve the performance of the flexible kernel API we designed in MX that allows to remove some intermediate copy.; L’exécution performante d’applications parallèles sur une grappe nécessite de scommunications rapides entre les nœuds,mais aussi des accès aux fichiers à faible latence et grande bande passante. Cependant, les interfaces logicielles de programmation des réseaux rapides ont été conçues pour les communications MPI et ne conviennent pas toujours aux besoin des autres applications, par exemple les systèmes de fichiers distribués. Dans cet article, nous explorons différentes solutions pour améliorer l’utilisation des réseaux rapides pour les applications dans le noyau. Nous examinons tout d’abord l’implantation d’un système de fichiers distribués sur MYRINET/GM pour montrer les difficultés rencontrées lorsqu’on cherche à obtenir une interaction efficace entre ces applications et le réseau. Nous proposons ensuite des solutions pour simplifier et améliorer cette interaction et nous les intégrons dans l’interface noyau du nouveau pilote MYRINET, MX. Les études de performance de MX et GM et de leur utilisation dans un système de fichiers distribués et un protocole socket zéro-copie montrent des gains intéressants. De plus, la flexibilité de l’interface de programmation que nous avons conçue nous permet de supprimer certaines copies intermédiaires.

Published
2005

45. On Tracking Personalized Web Services Using Views

Author

Michael Mrissa, Zakaria Maamar, Djamal Benslimane, Chirine Ghedira, CIT, Zayed University, Dubai (CITZU), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2), IEEE Computer Society, and SI LIRIS, Équipe gestionnaire des publications

Subjects
WS-Addressing, medicine.medical_specialty, Multimedia, Web development, Computer science, WS-I Basic Profile, business.industry, Services computing, 02 engineering and technology, [INFO] Computer Science [cs], computer.software_genre, World Wide Web, 020204 information systems, Web page, 0202 electrical engineering, electronic engineering, information engineering, medicine, 020201 artificial intelligence & image processing, [INFO]Computer Science [cs], Web service, WS-Policy, business, computer, Web modeling
Abstract

Later on, Plus tard

Published
2005

46. A Model for Distributing and Querying a Data Warehouse on a Computing Grid

Author

Maryvonne Miquel, Pascal Wehrle, Anne Tchounikine, SI LIRIS, Équipe gestionnaire des publications, IEEE Computer Society, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), and Université de Lyon-Université Lumière - Lyon 2 (UL2)

Subjects
Database, Computer science, Spatial database, Online analytical processing, InformationSystems_DATABASEMANAGEMENT, Dimensional modeling, 02 engineering and technology, [INFO] Computer Science [cs], computer.software_genre, Grid, Data warehouse, Data modeling, Grid computing, Data model, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Resource management, [INFO]Computer Science [cs], computer, Computer Science::Databases
Abstract

International audience; Data warehouses store large volumes of data according to a multidimensional model with dimensions representing different axes of analysis. OLAP systems(OnLine Analytical Processing) provide the ability to interactively explore the data warehouse. Rising volumes and complexity of data favor the use of more powerful distributed computing architectures. Computing grids in particular are built for decentralized management of heterogeneous distributed resources. Their lack of centralized control however conflicts with classiccentralized data warehouse models. To take advantage of a computing grid infrastructure to operate a data warehouse, several problems need to be solved. First, the warehouse data must be uniquely identified and judiciously partitioned to allow efficient distribution, querying and exchange among the nodes of the grid. We propose a data model based on "chunks" as atomic entities of warehouse data that can be uniquely identified. We then build contiguous blocks of these chunks to obtain suitable fragments of the datawarehouse. The fragments stored on each grid node must be indexed in a uniform way to effectively interact with existing grid services. Our indexing structure consists of a lattice structure mapping queries to warehousefragments and a specialized spatial index structure formed by X-trees providing the information necessary for optimized query evaluation plans.

Published
2005

47. Optimizations of Client's side communications in a Distributed File System within a Myrinet Cluster

Author

Brice Goglin, O. Gluck, Loïc Prylli, Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'informatique du parallélisme, Protocols and softwares for very high-performance network (RESO), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure de Lyon (ENS de Lyon)-Centre National de la Recherche Scientifique (CNRS), IEEE Computer Society Press, these, Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon), École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Système de fichiers distribué, Computer science, Enregistrement mémoire, Stub file, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 02 engineering and technology, Réseau local hautes performances, Grappe, computer.software_genre, Myrinet, 0202 electrical engineering, electronic engineering, information engineering, Network File System, Distributed File System, [INFO]Computer Science [cs], SSH File Transfer Protocol, File system fragmentation, 020203 distributed computing, business.industry, Firmware, Linux, Device file, Unix file types, Virtual file system, 020202 computer hardware & architecture, High-Speed Local Network, Computer network programming, File Control Block, Self-certifying File System, Cluster, Computer data storage, Memory Registration, Operating system, business, computer, Computer network
Abstract

This paper presents a study of the interaction between high-speed interconnects and a distributed file system client. We use our ORFA remote file access protocol and Myrinet network with the GM software layer to show how the highly specific programming model of high-speed interconnects may be used in a high performance distributed file system client. We present both a user-level and a kernel-level client implementations with either buffered or non-buffered accesses. These implementations show high performances and may be transparently used by applications. Our improvements focus on pin-down cache techniques and memory registration issues. Our GM modifications show no impact on its performances while the network usage in the distributed file system client is improved.; Cet article présente une étude de l’interaction entre les réseaux hautes performances et un client de système de fichiers distribué. Nous utilisons notre protocole d’accès aux fichiers distants ORFA et un réseau MYRINET avec sa couche logicielle GM pour montrer comment le modèle de programmation très spécifique des réseaux rapides peut être utilisé dans un client de système de fichiers distribué performant.Nous présentons à la fois un client en espace utilisateur et un en espace noyau avec des accès bufferisés ou non. Ces implémentations montrent leur efficacité et peuvent être utilisées de manière transparent par les applications. Nos améliorations s’intéressent aux problèmes liés aux techniques de cache d’enregistrement mémoire.Nos modifications dans GM ne montrent aucun impact sur ses performances tandis que son utilisation dans le client de système de fichiers distribué est améliorée.

Published
2004

48. Performance Analysis of Remote File System Access over High Bandwidth Local Network

Author

Goglin, Brice, Prylli, Loïc, Protocols and softwares for very high-performance network (RESO), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure de Lyon (ENS de Lyon)-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), IEEE Computer Society Press, these, École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), Laboratoire de l'informatique du parallélisme, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), and Université de Lyon-École normale supérieure - Lyon (ENS Lyon)

Subjects
Système de fichiers distribué, HIGH BANDWIDTH LOCAL NETWORK, LINUX, DISTRIBUTED FILE SYSTEM, REMOTE ACCESS, NFS, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], [INFO]Computer Science [cs], CLUSTER, Accès distant, Grappe, Réseau local haut-débit
Abstract

We study the performance of file servers, comparing NFS implementation in Linux to our experimental lightweight system called ORFA. The aim is to find out NFS bottlenecks in the case of high bandwidth local network. Using a simple protocol without cache allow us to get best performance from the underlying communication subsystem. Our user-level implementation avoids several kernel-level constraints and thus provides better performance than NFS. Moreover we explore several optimization techniques to reduce the server overhead which usually is the bottleneck.; On étudie les performances des serveurs de fichiers en comparant l’implémentation de NFS dans Linux avec notre système expérimental nommé ORFA. Le but est de déterminer les goulots d’étranglements de NFS dans le cas des réseaux locaux haute performance.Utiliser un protocole simple sans cache nous permet de tirer profit des performances du système de communication sous-jacent. Notre implémentation au niveau utilisateur évite par ailleurs différentes contraintes du noyau et peut ainsi dépasser les performances de NFS.On explore de plus différentes techniques d’optimisation pour réduire la charge du serveur qui reste souvent le goulot d’étranglement.

Published
2004

49. Towards an Architecture of Enterprise Information Systems using Contextual Ontologies

Author

Aïcha-Nabila, Benharkat, Rifaieh, Rami, SI LIRIS, Équipe gestionnaire des publications, Austrian Computer Society 2004, Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), 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)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), and Université de Lyon-Université Lumière - Lyon 2 (UL2)

Subjects
[INFO]Computer Science [cs], [INFO] Computer Science [cs]
Abstract

International audience; EISMO (Enterprise Information System Multi-representation Ontology) project aims at defining aframework for the EIS cooperation. It is based on the paradigm of multi-representation ofontologies and aims at offering adequate services to different applications. Our goal at first is toprove the ability of EISMO to provide global understanding over EIS. In second, EISMO aims atachieving information systems interoperability (intra-inter), communication between systems, andreusability.For these purposes, we propose a conceptual framework to identify relevant information in order toallow the reusability and a better communication. Then we propose the architectural scope which,among other services, permits global query answering, or offers to reuse existing services when oneintroduce new models.

Published
2004

50. Multiscale Visualization of Small World Networks

Author

Fabien Jourdan, David Auber, Yves Chiricota, Guy Melançon, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Auber, David, Université du Québec à Chicoutimi (UQAC), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), and IEEE Computer Society

Subjects
Connected component, Theoretical computer science, Small-world network, business.industry, Computer science, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 020207 software engineering, Network science, 02 engineering and technology, Complex network, Multiscale graphs, Clustering metric, Visualization, [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Information visualization, Data visualization, Evolving networks, Semantic zooming, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, business
Abstract

International audience; Many networks under study in Information Visualization are "small world" networks. These networks first appeared in the study social networks and were shown to be relevant models in other application domains such as software reverse engineering and biology. Furthermore, many of these networks actually have a multiscale nature: they can be viewed as a network of groups that are themselves small world networks. We describe a metric that has been designed in order to identify the weakest edges in a small world network leading to an easy and low cost filtering procedure that breaks up a graph into smaller and highly connected components. We show how this metric can be exploited through an interactive navigation of the network based on semantic zooming. Once the network is decomposed into a hierarchy of sub-networks, a user can easily find groups and subgroups of actors and understand their dynamics.

Catalog

Books, media, physical & digital resources
See catalog results