您的位置: 专家智库 > >

国家自然科学基金(60273007)

作品数:2 被引量:5H指数:1
相关作者:陈文光林皎郑纬民更多>>
相关机构:清华大学更多>>
发文基金:国家自然科学基金更多>>
相关领域:自动化与计算机技术更多>>

文献类型

  • 2篇中文期刊文章

领域

  • 2篇自动化与计算...

主题

  • 1篇图划分
  • 1篇全基因组
  • 1篇基因
  • 1篇基因组
  • 1篇P2P
  • 1篇PEER-T...
  • 1篇AMONG
  • 1篇COOPER...
  • 1篇INCENT...
  • 1篇BULK

机构

  • 1篇清华大学

作者

  • 1篇郑纬民
  • 1篇林皎
  • 1篇陈文光

传媒

  • 1篇计算机研究与...
  • 1篇Tsingh...

年份

  • 2篇2006
2 条 记 录,以下是 1-2
排序方式:
B^3A: Prompting Cooperation Among Rational Participants in P2P Bulk File Sharing Environments
2006年
Peer-to-peer (P2P) file sharing systems assume that their users download files in proportion to their sharing. Unfortunately, users are unlikely to do so without an incentive mechanism. Previous solutions to the problem required some types of centralized control, which strays from the spirit of P2P to provide long-term incentives. This paper presents the balance-based bandwidth allocation, B^3A, an incentive framework to inspire participants to share files. In the B^3A framework, each peer keeps the differences between the amount of data it has received from each peer and the amount it has sent to that one. When receiving simultaneous requests from various peers, the peer prefers to allocate its limited upload bandwidth to those peers with larger differences. Therefore, the downloading bandwidth perceived by a peer is positively related to its contributions to others, consequently stimulating it to share more files. The B^3A framework is fully decentralized, scalable, and secure.
陈明杨广文刘学铮郑纬民
关键词:INCENTIVE
基于图划分的全基因组并行拼接算法被引量:5
2006年
提出了一种基于图划分的全基因组并行拼接算法·该算法巧妙地将数据划分问题转化成图划分的问题,解决了传统数据划分算法中存在的节点负载不平衡的问题·同时,算法在建立关系图时有效地利用了WGS测序中所提供reads之间的长度信息和配对信息,使reads关系图能更准确地反映出数据之间的关系特性,从而提高了数据划分的准确性·实验结果表明,该算法可以准确地划分各种模拟数据、真实数据的数据集,相对于传统数据划分算法划分质量有了明显改善·
林皎陈文光栗强郑纬民张益民
关键词:图划分
共1页<1>
聚类工具0