使用DBLP(database systems and logic programming)提供的文献索引作为原始数据,对计算机及其相关领域合作发表论文形成的科研合作网络进行了研究.通过解析xml元数据,构建DBL,P科研合作网络拓扑并计算其网络拓扑常规参数,分析了若干参数的统计特征,发现DBLP科研合作网络是小世界网络,但无标度特性不明显;该科研合作网络的中心与边缘拓扑反映不同的科研合作模式;DBLP复杂网络的k核与科学家的h-指数并无强相关性.最后使用观察结果讨论了复杂网络的研究发展及本实验室在计算机相关领域的学术定位情况.
In order to transfer large les and provide high-quality services in the IoV(Internet of Vehicles),intelligent routing and scheduling are indispensable for fast transfers and effcient network utilization,particularly when multi-path routing is allowed in the wired-transfer.Thus,a network administrator must select a set of feasible paths over which the transfer can be conducted.We consider a TBTS(Time-constrained Big-le Transfer Scheduling)problem in this paper.We prove that TBTS problem is NP-hard and that the TBTS problem can be solved by addressing a corresponding maximum ow over time problem with multi-path routing technique.We then propose both a heuristic algorithm(TBTS-H)and an exact algorithm(TBTS-A)to solve the TBTS problem.Although both of the proposed approaches can solve the TBTS problem,the heuristic runs more effciently by trading accuracy for delay,while the exact algorithm can achieve high accuracy for delay,at the cost of increased running-time.The corresponding simulation results illustrate this trade-o.Additionally,we conduct some comparisons between our proposed approaches and a traditional single-path routing scheme.
