English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Collaborative editing consists in editing a common document shared by severalindependent sites. This may give rise to conficts when two different usersperform simultaneous uncompatible operations. Centralized systems solve thisproblem by using locks that prevent some modifications to occur and leave theresolution of confict to users. On the contrary, peer to peer (P2P) editingdoesn't allow locks and the optimistic approach uses a IntegrationTransformation IT that reconciliates the conficting operations and ensuresconvergence (all copies are identical on each site). Two properties TP1 andTP2, relating the set of allowed operations Op and the transformation IT, havebeen shown to ensure the correctness of the process. The choice of the set Opis crucial to define an integration operation that satisfies TP1 and TP2. Manyexisting algorithms don't satisfy these properties and are indeed incorrecti.e. convergence is not guaranteed. No algorithm enjoying both properties isknown for strings and little work has been done for XML trees in a pure P2Pframework (that doesn't use time-stamps for instance). We focus on editingunranked unordered labeled trees, so-called XML-like trees that are consideredfor instance in the Harmony pro ject. We show that no transformation satisfyingTP1 and TP2 can exist for a first set of operations but we show that TP1 andTP2 hold for a richer set of operations. We show how to combine our approachwith any convergent editing process on strings (not necessarily based onintegration transformation) to get a convergent process.

Peer to Peer Optimistic Collaborative Editing on XML-like trees