ID 原文 译文
44756 并基于 Q-learning 机制设计跨域服务链构建请求分割算法进行优化求解。 A partitioning algorithm was designed to solve the problem based on Q-learning mechanism under this framework.
44757 仿真实验表明该方法在平均分割时间、平均映射开销和服务链构建请求接受率等方面相较传统方法具有更优的表现。 Simulation results show that the performances of this method are better than other traditional methods on average partition time, average mapping cost, and acceptance ratio of service chain mapping request.
44758 MIEBR 对消息重要性进行度量， MIEBR measures the importance of messages.
44759 并根据消息转发收益确定消息的转发顺序和路由。 It determines message forwarding order and routing by message forwarding profit.
44760 在节点缓存空间不足时，MIEBR 依据消息缓存价值进行缓存替换。 When cache space is insufficient, MIEBR performs cache replacement based on message cache value.
44761 实验结果表明，在缓存空间和能量受限的机会网络中，MIEBR均衡节点的能量消耗， Simulation results show that, in cache space and energy constrained networks, MIEBR balances energy consumption of nodes,and reduces the latency of important messages.
44762 降低了重要消息的传输延时，在投递成功率和延时等方面优于其他算法。 It outperforms other algorithms in delivery rate and latency.
44763 为适应基于通信的列车运行控制（CBTC, communication based train control）系统从车地模式向车车通信模式发展的趋势，针对多周期性应用并发的车载安全计算机的时间约束性，提出了基于时间 Petri 网的安全计算机时间约束性验证方法。 In order to adapt to the development trend of the communication based train control (CBTC) system from train-ground communication mode to train-to-train communication mode, a verification approach for time constraints of multi-period applications concurrence on-board safety computer based on time Petri net was proposed.
44764 以车载 2 乘 2 取 2 安全计算机为例，通过分析安全计算机多周期应用的并发性质， By taking the double 2 out of 2 on-board safety computer as an example, the multi-period applications concurrence nature of the safety computer was analyzed.
44765 采用时间 Petri 网（TPN, time Petri net）推算其时间可调度区间， Time Petri net (TPN) was utilized to calculate the time schedulable interval.