Search

Your search keyword '"ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing"' showing total 12 results
Start Over Descriptor "ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing"
12 results on '"ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing"'

1. Large-scale trustworthy distributed collaboration

Author

Ignat, Claudia-Lavinia, Web Scale Trustworthy Collaborative Service Systems (COAST), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Université de Lorraine, Isabelle Chrisment (isabelle.chrisment@loria.fr), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), and Ignat, Claudia-Lavinia

Subjects
contract-based collaboration, [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], journaux authentifiés, [INFO.INFO-TT] Computer Science [cs]/Document and Text Processing, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], Operational transformation, user studies, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing, authenticated logs, confiance, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC], études d'usage, systèmes collaboratifs distribués, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems, [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], conscience de groupe, trust, transformées opérationnelles, Collaboration basée sur des contrats, [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, group awareness, trust game, [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], distributed collaborative systems, jeu de la confiance, CRDT, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.3: Group and Organization Interfaces/H.5.3.2: Computer-supported cooperative work, [INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC], [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Abstract

Most commonly used collaborative systems are provided by large service providers. While these collaborative services offer very interesting functionalities, they feature certain limitations. Most of the platforms hosting these collaboration services rely on a central authority and placepersonal information in the hands of a single large corporation which is a perceived privacy threat. Users must provide and store their data to vendors of these services and have to trust that they will preserve privacy of their data, but they have little control over the usage of their data after sharing it with other users. Moreover, these systems do not scale well in terms of the number of users and their modifications. Furthermore, user communities cannot deploy these kind of service applications since they generally rely on costly infrastructures rather than allowing sharing infrastructure and administration costs. My research work aims to move away from centralized authority-based collaboration towards a large scale trust-based peer-to-peer collaboration where control over data is given to users who can decide with whom to share their data. The main advantages of peer-to-peer collaborative systems are high scalability, resilience to faults and attacks and a low deployment barrier for new services. My contributions are structured around two axes of research: collaborative data management and trustworthy collaboration.In order to provide efficient data availability, data is typically replicated and users are allowed to concurrently modify replicated data. One of the challenges is to develop optimistic replication algorithms that maintain consistency of the shared data in the face of concurrent modifications. These algorithms have to be reliable, i.e. after the reception of all modifications the data copies have to converge. These algorithms also have to be scalable, i.e. have a complexity that does not depend on the number of users. These algorithms have also to be explainable, i.e. their decision must be comprehensible by users and therefore user intentions must be preserved. In the first part of this manuscript I present my contributions to the design of various optimistic data replication and their evaluation in terms of their complexities but also by means of experimental design with users. I also present my contributions on group awareness specifically on what information should be provided to users to prevent conflicting changes and to understand divergence when conflicts cannot be avoided.In this large scale peer-to-peer collaboration where users cannot remember the interactions with all collaborators a main question is how to choose the trusted collaborators in order to share them the data. A main challenge is how to assess users trust according to their past behaviour during collaboration in order to be able to predict their future behavior. In the second part of this manuscript I present a contract-based collaboration model where contracts are specified by the data owners when they share the data and user trust is assessed according to the observation of adherence to or violation of contracts. I also present a hash chain based authenticators approach for ensuring integrity and authenticity of logs of collaboration. For testing the proposed trust-based collaboration model, I designed a user experiment employing trust game and relying on a computational trust metric according to user exchanges in this game.I finally present my future research directions around secure and trustworthy collaborative data management.

Published
2021

2. A Formal Account of Disorders in Dialogues

Author

Amblard, Maxime, Semantic Analysis of Natural Language (SEMAGRAMME), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)

Subjects
[INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING, [SCCO.COMP]Cognitive science/Computer science, [SCCO.LING]Cognitive science/Linguistics, ComputingMilieux_MISCELLANEOUS, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing
Abstract

International audience

Published
2017

3. Merging OT and CRDT Algorithms

Author

Ahmed-Nacer Mehdi, Pascal Urso, Nuno Perguiça, Valter Balegas, Services and Cooperation (SCORE), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Centro de Investigação em Informática e Tecnologias da Informação (CITI), ANR-10-BLAN-0208,ConcoRDanT,Les CRDT pour la cohérence sans contrôle de concurrence dans les nuages et les systèmes pair-à-pair(2010), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)

Subjects
Computer science, Distributed computing, Performance, Cloud computing, Distributed architecture, Operational transformation, Microsoft Office, computer.software_genre, Distributed systems, Data type, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing, Collaborative editing, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Architecture, Commutative property, Experimentation, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems, business.industry, Programming language, Collaborative Editing, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.1: Network Architecture and Design, Operational Transformation, business, computer, Merge (version control), Algorithm, Commutative Replicated Data Types, Algorithms
Abstract

International audience; Nowadays, a large number of collaborative editing applications have been developed. Some of them are deployed on the cloud such as Google Drive and Microsoft Office at SkyDrive. Massively used editing systems make use of operational transformation (OT), a traditional replication mechanism for concurrent document editing. Such algorithms do not scale well in peer-to-peer environments with dynamic groups. Recently, Commutative Replicated Data Types (CRDTs) were introduced as a new class of replication mechanisms whose concurrent operations are designed to be natively commutative. They ensure consistency of highly dynamic contents on peer-to-peer networks. Through this paper, we propose an architecture to take advantage of both approaches -- OT and CRDT -- and to improve the performance of collaborative editing applications. We merge both algorithms on the proposed architecture and we study their suitability.

Published
2014

4. Concurrency Control and Awareness Support for Multi-synchronous Collaborative Editing

Author

Mehdi Ahmed-Nacer, Nuno Preguiça, Pascal Urso, Valter Balegas, Services and Cooperation (SCORE), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Centro de Investigação em Informática e Tecnologias da Informação (CITI), ANR-10-BLAN-0208,ConcoRDanT,Les CRDT pour la cohérence sans contrôle de concurrence dans les nuages et les systèmes pair-à-pair(2010), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Ahmed-Nacer, Mehdi, and BLANC - Les CRDT pour la cohérence sans contrôle de concurrence dans les nuages et les systèmes pair-à-pair - - ConcoRDanT2010 - ANR-10-BLAN-0208 - BLANC - VALID

Subjects
Computer science, Non-lock concurrency control, Data management, Multiversion concurrency control, 02 engineering and technology, multi-synchronous applications, Collaborative editing, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing, World Wide Web, Concurrency control, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Human–computer interaction, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, move/update operations, Collaborative software, concurrency control, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], business.industry, Distributed concurrency control, Asynchronous communication, 020201 artificial intelligence & image processing, CRDT, business, awareness information, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.8: Metrics/D.2.8.1: Performance measures
Abstract

International audience; Collaborative editing tools have become increasingly popular in the last decade, with some systems being used by massive numbers of users. While traditionally collaborative editing systems would either target synchronous or asynchronous collaboration settings, some recent systems support both types of collaboration, even supporting disconnected work. In this paper we analyze the limitations of existing systems and propose a data management solution that overcomes such limitations. The proposed concurrency control algorithm, based on conflict-free data types, builds on the ideas previously developed for synchronous collaboration, extending them to support asynchronous collaboration. Our solution also includes the necessary information for providing comprehensive awareness information to users. The evaluation of our algorithm shows that comparing our solution with traditional solutions in collaborative editing, the conflict resolution strategy proposed in this paper leads to results closer to the ones expected by users.

Published
2013

5. TiCL: the Prototype

Author

Verna, Didier, Verna, Didier, Laboratoire de Recherche et de Développement de l'EPITA (LRDE), and Ecole Pour l'Informatique et les Techniques Avancées (EPITA)

Subjects
ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.2: Language Classifications/D.3.2.8: Multiparadigm languages, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.2: Document Preparation, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES, [INFO.INFO-SE] Computer Science [cs]/Software Engineering [cs.SE], ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING, [INFO.INFO-TT] Computer Science [cs]/Document and Text Processing, ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.2: Language Classifications, [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE], ACM: D.: Software, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.2: Document Preparation/I.7.2.7: Photocomposition/typesetting, [INFO] Computer Science [cs], ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing, [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION, ComputingMethodologies_DOCUMENTANDTEXTPROCESSING, [INFO]Computer Science [cs], typesetting, TeX, Common Lisp, ACM: I.: Computing Methodologies
Abstract

International audience; While TeX is unanimously praised for its typesetting capabilities, it is also regularly blamed for its poor programmatic offerings. Several solutions have been proposed to modernize TeX on the programming side. All of them currently involve a heterogeneous approach in which TeX is mixed with a full-blown programming language. This paper advocates another, homogeneous approach in which the Common Lisp language is used to implement a TeX-like typesetting system. The underlying implementation language serves both at the core of the program and at the scripting level, hence removing the need for programmatic macros on top of typesetting commands. Aprototype implementation is presented.

Published
2013

6. Évaluation de l'occupation mémoire des CRDTs pour l'édition collaborative temps-réel mobile

Author

Ahmed-Nacer, Mehdi, Urso, Pascal, Ignat, Claudia-Lavinia, Oster, Gérald, Services and Cooperation (SCORE), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Oster, Gérald, Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Real-time Editing, Memory, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.8: Metrics/D.2.8.0: Complexity measures, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], ACM: I.: Computing Methodologies/I.6: SIMULATION AND MODELING/I.6.6: Simulation Output Analysis, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, Collaboration, Commutative Replicated Data Types, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing, Mobile Computing, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.8: Metrics/D.2.8.1: Performance measures
Abstract

Real-time collaborative editing systems are common in our everyday work life. They allow multiple authors to collaboratively write and review documents. Mobile devices are pervasive and therefore supporting collaborative editing applications becomes a natural need. In traditional real-time editing applications, a replication mechanism is required to offer support for concurrent editing while preserving consistency of the shared documents. Recently, a new class of replication mechanisms, named Commutative Replicated Data Types (CRDTs), was introduced for collaborative editing. They are expected to be substitutes of replication mechanisms in next generation collaborative editing systems. However, their suitability under mobile resources constraints such as limited computation and memory remains to be investigated. This paper presents an ongoing work in the evaluation of the suitability of CRDTs for real-time collaborative editing on mobile devices. Performance evaluations in terms of computation time and memory requirements for various CRDTs are presented. Additionally, it provides a comparison with traditional replication mechanisms., Les systèmes d'édition collaborative temps réel connaissent un large succès depuis quelques années. Ils permettent à plusieurs utilisateurs de collaborer pour rédiger un même document. Les appareils mobiles sont omniprésents dans notre vie quotidienne, et, par conséquent, le besoin d'applications dédiées à l'édition collaborative devient naturel. Dans ce cadre d'édition collaborative, chaque utilisateur à sa propre copie du document sur son dispositif mobile. Un mécanisme de réplication est donc nécessaire pour supporter l' édition concomitante et assurer la disponibilité des données tout en préservant la cohérence des copies. Récemment, une nouvelle classe de mécanismes de réplication dénommée CRDTs (Commutative Replicated Data Types), a été introduit pour l'édition collaborative. Cependant, leur pertinence face aux contraintes de ressources des appareils mobiles telles que les performances, la batterie et la mémoire limitée reste à étudier. Cet article présente un travail en cours sur l'évaluation des CRDTs pour l'édition collaborative en temps réel. Il présente une première évaluation des performances en termes de temps de calcul et d'occupation en mémoire pour les différents CRDTs. Il fournit également une comparaison avec un mécanisme de réplication traditionnel.

Published
2012

7. Evaluating CRDTs for Real-time Document Editing

Author

Mehdi Ahmed-Nacer, Hyun-Gul Roh, Claudia-Lavinia Ignat, Gérald Oster, Pascal Urso, Services and Cooperation (SCORE), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Networks, Systems and Services (LORIA - NSS), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), ACM, Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)

Subjects
real-time editing, 020203 distributed computing, Computer science, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.8: Metrics/D.2.8.0: Complexity measures, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], 02 engineering and technology, Operational transformation, Data type, Replication (computing), collaboration, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing, World Wide Web, Consistency (database systems), Collaborative editing, benchmark, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Benchmark (computing), commutative replicated data types, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, Commutative property, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.8: Metrics/D.2.8.1: Performance measures
Abstract

International audience; Nowadays, real-time editing systems are catching on. Tools such as Etherpad or Google Docs enable multiple authors at dispersed locations to collaboratively write shared documents. In such systems, a replication mechanism is required to ensure consistency when merging concurrent changes performed on the same document. Current editing systems make use of operational transformation (OT), a traditional replication mechanism for concurrent document editing. Recently, Commutative Replicated Data Types (CRDTs) were introduced as a new class of replication mechanisms whose concurrent operations are designed to be natively commutative. CRDTs, such as WOOT, Logoot, Treedoc, and RGAs, are expected to be substitutes of replication mechanisms in collaborative editing systems. This paper demonstrates the suitability of CRDTs for real-time collaborative editing. To reflect the tendency of decentralised collaboration, which can resist censorship, tolerate failures, and let users have control over documents, we collected editing logs from real-time peer-to-peer collaborations. We present our experiment results obtained by replaying those editing logs on various CRDTs and an OT algorithm implemented in the same environment.

Published
2011

8. CRDTs: Consistency without concurrency control

Author

Leția, Mihai, Preguiça, Nuno, Shapiro, Marc, 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), Centro de Investigação em Informática e Tecnologias da Informação (CITI), 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), Grid4All (FP6), INRIA, 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), and Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)

Subjects
eventual consistency, consistency, weak consistency, replicated data, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, ACM: E.: Data/E.1: DATA STRUCTURES/E.1.3: Lists, stacks, and queues, commutative replicated data type, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing, ACM: E.: Data/E.1: DATA STRUCTURES/E.1.1: Distributed data structures
Abstract

A CRDT is a data type whose operations commute when they are concurrent. Replicas of a CRDT eventually converge without any complex concurrency control. As an existence proof, we exhibit a non-trivial CRDT: a shared edit buffer called Treedoc. We outline the design, implementation and performance of Treedoc. We discuss how the CRDT concept can be generalised, and its limitations.

Published
2009

9. Structured templates for authoring semantically rich documents

Author

Irène Vatton, Vincent Quint, Web, adaptation and multimedia (WAM), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG), 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), Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Grenoble (INPG)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Université Joseph Fourier - Grenoble 1 (UJF)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Grenoble (INPG)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP ), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)

Subjects
Information retrieval, Computer science, business.industry, [INFO.INFO-WB]Computer Science [cs]/Web, 020206 networking & telecommunications, 02 engineering and technology, Semantics, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.2: Document Preparation/I.7.2.4: Languages and systems, Task (project management), [INFO.INFO-TT]Computer Science [cs]/Document and Text Processing, World Wide Web, Template, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.2: Document Preparation/I.7.2.5: Markup languages, ComputingMethodologies_DOCUMENTANDTEXTPROCESSING, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, business, Publication
Abstract

International audience; Structured documents associate explicit semantics with content, but authoring rigorously structured documents is a very difficult task. We present a new approach to this issue that adds schema-level information to the popular web formats. This makes editing highly structured documents easier, while ensuring that documents are valid. It is also an easy way to publish semantically rich documents on the web. The impact of this approach on authoring tools is discussed and its implementation in the Amaya editor is briefly presented.

Published
2007

10. Handling Conflicts through Multi-level Editing in Peer-to-peer Environments

Author

Ignat, Claudia, Norrie, Moira, Oster, Gérald, Institute for Information Systems - ETH Zurich, Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich), Environment for cooperation (ECOO), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)

Subjects
conflict handling, ACM: H.: Information Systems/H.1: MODELS AND PRINCIPLES/H.1.2: User/Machine Systems/H.1.2.0: Human factors, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], operational transformation, tombstone transformation functions, ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.3: Group and Organization Interfaces/H.5.3.2: Computer-supported cooperative work, multi-level editing, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing
Abstract

Part of the 20th anniversary conference on Computer Supported CooperativeWork (CSCW '06); The handling of conflicts in collaborative editing over hierarchical documents in peer-to-peer networks is a very important issue. In this paper we show how the multi-level editing approach that recursively applies a tombstone transformational approach over the document levels offers support for flexible conflict definition and resolution.

Published
2006

11. Optimistic Replication for Massive Collaborative Editing

Author

Oster, Gérald, Urso, Pascal, Molli, Pascal, Skaf-Molli, Hala, Imine, Abdessamad, Environment for cooperation (ECOO), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), Combination of approaches to the security of infinite states systems (CASSIS), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), INRIA, Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], optimistic replication, replicated data consistency, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], real time groupware, operational transformation, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.3: Group and Organization Interfaces/H.5.3.1: Collaborative computing, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing
Abstract

In recent times, Wikipedia has opened the way to massive collaborative editing. More specifically, it has demonstrated what can be achieved with a massive collaborative effort. Massive collaborative editing implies scalability and pessimistic replication scales poorly in the wide area. Optimistic replication offers better performance but has severe drawbacks for maintaining consistency. In this paper, we propose a new optimistic replication algorithm for massive collaborative editing called WOOT. It is designed to scale as well as to ensure eventual consistency and intention preservation. It is important to point out that WOOT's efficiency does not depend on a number of sites and can be deployed on a very large, pure peer-to-peer network.

Published
2005

12. Proving correctness of transformation functions in collaborative editing systems

Author

Oster, Gérald, Urso, Pascal, Molli, Pascal, Imine, Abdessamad, Global Information Systems Group [ETH Zürich] (GlobIS), Department of Computer Science [ETH Zürich] (D-INFK), Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich)- Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich), Environment for cooperation (ECOO), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), Combination of approaches to the security of infinite states systems (CASSIS), Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174) (FEMTO-ST), Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Centre National de la Recherche Scientifique (CNRS)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), INRIA, Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université de Technologie de Belfort-Montbeliard (UTBM)-Ecole Nationale Supérieure de Mécanique et des Microtechniques (ENSMM)-Centre National de la Recherche Scientifique (CNRS)-Université de Franche-Comté (UFC), Université Bourgogne Franche-Comté [COMUE] (UBFC)-Université Bourgogne Franche-Comté [COMUE] (UBFC)-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC], formal methods, optimistic replication, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], operational transformation, ACM: C.: Computer Systems Organization/C.2: COMPUTER-COMMUNICATION NETWORKS/C.2.4: Distributed Systems/C.2.4.1: Distributed applications, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], ACM: H.: Information Systems/H.5: INFORMATION INTERFACES AND PRESENTATION (e.g., HCI)/H.5.3: Group and Organization Interfaces/H.5.3.1: Collaborative computing, collaborative editing, ACM: I.: Computing Methodologies/I.7: DOCUMENT AND TEXT PROCESSING/I.7.1: Document and Text Editing
Abstract

Operational transformation (OT) is an approach which allows to build real-time groupware tools. This approach requires correct transformation functions regarding two conditions called TP1 and TP2. Proving correctness of these transformation functions is very complex and error prone. In this paper, we show how a theorem prover can address this serious bottleneck. To validate our approach, we verifed correctness of state-of-art transformation functions de ned on strings of characters with surprising results. Counter-examples provided by the theorem prover helped us to design the tombstone transformation functions. These functions verify TP1 and TP2, preserve intentions and ensure multi-effect relationships.

Published
2005

Catalog

Books, media, physical & digital resources
See catalog results