Microsoft Academic Graph (MAG) is a large heterogeneous graph containing entities such as authors, papers, journals, conferences and relations between them. Microsoft provides Academic Knowledge API for this contest. The Entity attributes are defined here.
m$搞了一套学术数据库的API的理论呀.
Participants are supposed to provide a REST service endpoint that can find all the 1-hop, 2-hop, and 3-hop graph paths connecting a given pair of entity identifiers in MAG. The given pair of entity identifiers could be [Id, Id], [Id, AA.AuId], [AA.AuId, Id], [AA.AuId, AA.AuId]. Each node of a path should be one of the following identifiers: Id, F.Fid, J.JId, C.CId, AA.AuId, AA.AfId. Possible edges (a pair of adjacent nodes) of a path are:
你们要给他搞一个REST服务呀，对给定的点对呀，寻找所有的1-hop, 2-hop, 3-hop路径呀。给定的点对关系可能是这样的呀[Id, Id], [Id, AA.AuId], [AA.AuId, Id], [AA.AuId, AA.AuId], 而你的路径上可以涵盖这些点Id, F.Fid, J.JId, C.CId, AA.AuId, AA.AfId
而两个点之间连边的要求是呀
- Id1 -> Id2 当且仅当它们的Rid相等呀
- Id1 -> F.Fid2 当且仅当Id1的F.Fid等于F.Fid2呀
... 以此类推呀, 自己去看原文哒吖, 没什么翻译的必要的呀
For each test case, the REST service endpoint will receive a JSON array via HTTP with a pair of entity identifiers, where the identifiers are 64-bit integers, e.g. [123, 456]. The service endpoint needs to respond with a JSON array within 300 seconds. The response JSON array consists of a list of graph paths in the form of [path1, path2, …, pathn], where each path is an array of entity identifiers. For example, if your program finds one 1-hop paths, two 2-hop paths, and one 3-hop paths, the results may look like this: [[123,456], [123,2,456], [123,3,456], [123,4,5,456]]. For a path such as [123,4,5,456], the integers are the identifiers of the entities on the path. After receiving the response, the evaluator will wait for a random period of time before sending the next requests.
对于每组输入，REST会通过HTTP apply 一个JSON数组，比如[123, 456]呢。 你要在300s内呢，给它这个算出之前说的这些路径呢。每个路径就是一堆的他这个标识符呢。然后你要得到呀这个数组就是上面说的这个样子啊。每个路径的数组里面就是他经过的点的编号（点可以是很多类型的呢）呀。之后呢，你会有一个随机的时间，等待下一组输入呢！
The REST service must be deployed to a Standard_A3 virtual machine for the final test. There are no constraints on the programming language you can use.
你们搞的这个东西呢，会在SA3的标准上跑，这个玩意呢，一句话就是辣鸡呀。对了呀， 你过你没用过啊卒死呢，我可以给你做一个报告啊，就是说它这个网络还是起飞的，就是硬盘啊…… 连香港记者都不如呢。
The test cases are not available before the final evaluation. When the evaluation starts, the evaluator system sends test cases to the REST endpoint of each team individually. Each team will receive 10 test cases (Q1to Q10). The response time for test case Qi is recorded as Ti(1≤i≤10). The final score is calculated using:
最终测试之前测试用例肯定不告诉你辣。测试开始的时候，每个队伍分别收到10个点，每个点它呀有这个Qi呢。然后我们就用这个式子，考虑一下你运行的努力和测试点行程算分咯。
where Ni is the size of the solution (the total number of correct paths) for Qi , Ki is the total number of paths returned by the REST service, Mi is the number of distinct correct paths returned by the REST service.
Ni是正确路径的个数，Ki是你算出路径个数，Mi是算出正确路径个数哒吖。