排序方式: 共有111条查询结果,搜索用时 753 毫秒
61.
旋转CRC同时使用两个生成多项式产生校验数据。之前的方法校验能力弱,报文丢失后的检错失效率很高。提出了一种新的旋转CRC设计方法,通过比较,选取合适的更高次的生成多项式组合,并且修改了检验生成与检测机制,形成MR-CRC。FPGA实现结果表明,这种方法能够在较低逻辑复杂度的基础上提高校验能力,从而改善数据通信的可靠性,而且对系统性能影响甚小。通过比较16位MR-CRC与32位传统CRC的实现数据发现,前者在所用资源减少10%的情况下,频率提高了25%。 相似文献
62.
We study a knapsack problem with an additional minimum filling constraint, such that the total weight of selected items cannot be less than a given threshold. The problem has several applications in shipping, e‐commerce, and transportation service procurement. When the threshold equals the knapsack capacity, even finding a feasible solution to the problem is NP‐hard. Therefore, we consider the case when the ratio α of threshold to capacity is less than 1. For this case, we develop an approximation scheme that returns a feasible solution with a total profit not less than (1 ‐ ε) times the total profit of an optimal solution for any ε > 0, and with a running time polynomial in the number of items, 1/ε, and 1/(1‐α). © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
63.
基于多项式模型的各种自适应滤波算法被广泛应用于机动目标跟踪领域,但尚没有统一的评估标准来衡量这些跟踪算法的优劣。由于存在确定的时变未知输入,机动目标的状态估计实际为有偏估计。基于状态估计均方误差最小的准则,推导了多项式模型滤波的最小均方误差界计算方法,获得了使状态估计均方误差最小的过程噪声方差变化规律。该方法给出了各种基于多项式模型的机动目标跟踪算法的估计均方误差下限,也为机动目标跟踪中最优过程噪声方差的设定提供了依据。仿真结果验证了算法的有效性。 相似文献
64.
65.
结合弹道跟踪数据建模和数据处理的实践 ,提出了几个有典型应用价值的测量数据模型 ,在应用这些数学模型解决实际问题时 ,涉及统计、优化、函数逼近等几方面的理论和计算问题。这些问题和模型的研究 ,对解决许多相关的实际问题有重要意义。 相似文献
66.
本文给出正切函数的有理展开和契比协夫展开式系数的加速计算方法;同时在YH-1机上进行了数值试验,结果表明:用现在的系数来计算正切函数,其精度比原来正切函数的精度可提高30%左右。 相似文献
67.
影响坦克操纵力的因素很多.本文利用正交试验法,对影响操纵力的主要因素进行试验,得出转向操纵装置组装工艺的最优方案.对制定维修工艺过程、工艺标准、要求有一定的指导意义. 相似文献
68.
69.
We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012 相似文献
70.
利用平面自治系统的极限环理论和分支理论研究了一类无穷次多项式系统,并讨论了该系统极限环的存在性和唯一性。应用所得结论,推广并改进了前人的结果。 相似文献