ID 原文 译文
21085 最后，利用Rényi散度作为传感器控制的评价指标，以最大威胁度目标的信息增益最大化为准则进行最终控制方案的求解。 Finally, the Rényi divergence is used as theevaluation index in sensor control, and the final control policy is solved with the maximum information gain asthe criterion.
21086 仿真实验验证了该方法的实用性和有效性。 The simulation results verify the feasibility and effectiveness of the proposed method.
21087 针对无线接入网络切片虚拟资源分配优化问题，该文提出基于受限马尔可夫决策过程(CMDP)的网络切片自适应虚拟资源分配算法。 An adaptive virtual resource allocation algorithm is proposed based on Constrained Markov Decision Process (CMDP) for wireless access network slice virtual resource allocation.
21088 首先，该算法在非正交多址接入(NOMA)系统中以用户中断概率和切片队列积压为约束，切片的总速率作为回报，运用受限马尔可夫决策过程理论构建资源自适应问题的动态优化模型； First of all, this algorithm in theNon-Orthogonal Multiple Access (NOMA) system, uses the user outage probability and the slice queues asconstraints, uses the total rate of slices as a reward to build a resource adaptive problem using the CMDPtheory.
21089 其次定义后决策状态，规避最优值函数中的期望运算； Secondly, the post-decision state is defined to avoid the expectation operation in the optimal valuefunction.
21090 进一步地，针对马尔科夫决策过程(MDP)的“维度灾难”问题，基于近似动态规划理论，定义关于分配行为的基函数，替代决策后状态空间，减少计算维度； Furthermore, aiming at the problem of “dimensionality disaster” of MDP, based on the approximatedynamic programming theory, a basis function for the assignment behavior is designed to replace the post-decision state space and to reduce the computational dimension.
21091 最后设计了一种自适应虚拟资源分配算法，通过与外部环境的不断交互学习，动态调整资源分配策略，优化切片性能。 Finally, an adaptive virtual resource allocation algorithm is designed to optimize the slicing performance.
21092 仿真结果表明，该算法可以较好地提高系统的性能，满足切片的服务需求。 The simulation results show that the algorithm can improve the performance of the system and meet the service requirements of slicing.
21093 高吞吐浮点可灵活重构的快速傅里叶变换(FFT)处理器可满足尖端雷达实时成像和高精度科学计算等多种应用需求。 In the advanced applications of real-time radar imaging and high-precision scientific computing systems, the design of high throughput and reconfigurable Floating-Point (FP) FFT accelerator is significant.
21094 与定点FFT相比，浮点运算复杂度更高，使得浮点型FFT的运算吞吐率与其实现面积、功耗之间的矛盾问题尤为突出。 Achieving high throughput FP FFT with low area and power cost poses a greater challenge due to highcomplexity of FP operations in comparison to fixed-point implementations.