首页> 外文会议>Computer supported cooperative work >A Sequence Transformation Algorithm for Supporting Cooperative Work on Mobile Devices
【24h】

A Sequence Transformation Algorithm for Supporting Cooperative Work on Mobile Devices

机译:支持移动设备上协同工作的序列转换算法

获取原文
获取原文并翻译 | 示例

摘要

Operational transformation (OT) is a promising technique for supporting collaboration using mobile devices because it allows users to work on local data replicas even in a disconnected mode. However, as work goes mobile, a large number of operations may accumulate, defying the capacity of current OT algorithms that are mostly designed for real-time group editing. Since their assumption is that operations are propagated frequently, they generally only address how to integrate one remote operation at a time. As a consequence, most algorithms take O(|H|~2) to integrate one operation and thus O(|H|~3) to integrate a long sequence, where H is the operation history. This paper proposes a novel algorithm that provides optimized transformation of long sequences, improving the time complexity to O(|H|). Our experiments will show that it takes 59 minutes in a recent algorithm versus 1.5 seconds in this work to integrate two long sequences on a mobile device. The performance improvement is critical towards achieving desired responsiveness and group productivity in a class of mobile collaborative applications.
机译:运营转换(OT)是一种支持使用移动设备进行协作的有前途的技术,因为它允许用户即使在断开连接的模式下也可以处理本地数据副本。但是,随着工作的移动,可能会积累大量操作,这与当前主要用于实时组编辑的OT算法的能力大相径庭。由于他们的假设是操作会频繁传播,因此它们通常仅解决如何一次集成一个远程操作的问题。结果,大多数算法使用O(| H |〜2)进行一个操作的积分,然后使用O(| H |〜3)进行长序列的积分,其中H是操作历史。本文提出了一种新颖的算法,该算法可提供长序列的优化转换,从而改善了O(| H |)的时间复杂度。我们的实验将显示,在最新算法中,将两个长序列整合到移动设备上需要59分钟,而这项工作需要1.5秒。性能改进对于在一类移动协作应用程序中实现所需的响应能力和团队生产力至关重要。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号