当前位置: X-MOL 学术arXiv.cs.DL › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Turing Number: How Far Are You to A. M. Turing Award?
arXiv - CS - Digital Libraries Pub Date : 2021-05-03 , DOI: arxiv-2105.00706
Feng Xia, Jiaying Liu, Jing Ren, Wei Wang, Xiangjie Kong

The ACM A.M. Turing Award is commonly acknowledged as the highest distinction in the realm of computer science. Since 1960s, it has been awarded to computer scientists who made outstanding contributions. The significance of this award is far-reaching to the laureates as well as their research teams. However, unlike the Nobel Prize that has been extensively investigated, little research has been done to explore this most important award. To this end, we propose the Turing Number (TN) index to measure how far a specific scholar is to this award. Inspired by previous works on Erdos Number and Bacon Number, this index is defined as the shortest path between a given scholar to any Turing Award Laureate. Experimental results suggest that TN can reflect the closeness of collaboration between scholars and Turing Award Laureates. With the correlation analysis between TN and metrics from the bibliometric-level and network-level, we demonstrate that TN has the potential of reflecting a scholar's academic influence and reputation.

中文翻译:

图灵号码:您距离图灵奖有多远?

ACM AM图灵奖是公认的计算机科学领域的最高奖项。自1960年代以来,它一直被授予做出杰出贡献的计算机科学家。该奖项的意义对于获奖者及其研究团队而言意义深远。但是,与获得广泛研究的诺贝尔奖不同,很少进行研究来探索这一最重要的奖项。为此,我们建议使用图灵数(TN)指数来衡量特定学者对该奖项的贡献程度。受先前关于鄂尔多斯数和培根数的著作的启发,该指数被定义为给定学者与任何图灵奖获得者之间的最短路径。实验结果表明,TN可以反映出学者与图灵奖获得者之间的紧密合作。
更新日期:2021-05-04
down
wechat
bug