检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Zhang ZHANG Xinjun MAO Chao ZHANG Yao LU
出 处:《Frontiers of Computer Science》2022年第2期1-15,共15页中国计算机科学前沿(英文版)
基 金:This work was supported by the National Key Research and Development Program of China(2018YFB1004202).
摘 要:Pull-based development has become an important paradigm for distributed software development.In this model,each developer independently works on a copied repository(i.e.,a fork)from the central repository.It is essential for developers to maintain awareness of the state of other forks to improve collaboration efficiency.In this paper,we propose a method to automatically generate a summary of a fork.We first use the random forest method to generate the label of a fork,i.e.,feature implementation or a bug fix.Based on the information of the fork-related commits,we then use the TextRank algorithm to generate detailed activity information of the fork.Finally,we apply a set of rules to integrate all related information to construct a complete fork summary.To validate the effectiveness of our method,we conduct 30 groups of manual experiment and 77 groups of case studies on Github.We propose Fea_(avg)to evaluate the performance of Fea_(avg)the generated fork summary,considering the content accuracy,content integrity,sentence fluency,and label extraction accuracy.The results show that the average of of the fork summary generated by this method is 0.672.More than 63%of project maintainers and the contributors believe that the fork summary can improve development efficiency.
关 键 词:open source software pull-based development fork summary distributed cooperative development
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222