首页> 外文会议>International Conference on Future Information Technology >Solving the Subgraph Isomorphism Problem Using Harmony Search
【24h】

Solving the Subgraph Isomorphism Problem Using Harmony Search

机译:使用和声搜索解决子图同构问题

获取原文

摘要

The active usage of open source software contributes many areas. However, there are many problems like ignoring license or intellectual properties infringement which can lead litigation. In this paper, we try to find original open source software by using similarity of source code. Source code similarity analyze resembles plagiarism detection problem, and using program dependence graph can be handled as a subgraph isomorphism problem which is one of NP-complete. In this paper, we apply harmony search, one of a metaheuristic algorithm, to solve the problem efficiently.
机译:开源软件的主动用法贡献了许多领域。但是,有许多可能导致诉讼的许可证或知识产权侵权问题。在本文中,我们尝试使用源代码的相似性找到原始开源软件。源代码相似性分析类似于抄袭检测问题,并且使用程序依赖性图可以作为NP-Tression之一处理作为子图同样问题。在本文中,我们应用了和声搜索,其中一个成群质算法,有效地解决了问题。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号