一种改进的旋转CRC数据校验设计方法

旋转CRC同时使用两个生成多项式产生校验数据。之前的方法校验能力弱,报文丢失后的检错失效率很高。提出了一种新的旋转CRC设计方法,通过比较,选取合适的更高次的生成多项式组合,并且修改了检验生成与检测机制,形成MR-CRC。FPGA实现结果表明,这种方法能够在较低逻辑复杂度的基础上提高校验能力,从而改善数据通信的可靠性,而且对系统性能影响甚小。通过比较16位MR-CRC与32位传统CRC的实现数据发现,前者在所用资源减少10%的情况下,频率提高了25%。     

机动目标状态估计的最小均方误差界

基于多项式模型的各种自适应滤波算法被广泛应用于机动目标跟踪领域,但尚没有统一的评估标准来衡量这些跟踪算法的优劣。由于存在确定的时变未知输入,机动目标的状态估计实际为有偏估计。基于状态估计均方误差最小的准则,推导了多项式模型滤波的最小均方误差界计算方法,获得了使状态估计均方误差最小的过程噪声方差变化规律。该方法给出了各种基于多项式模型的机动目标跟踪算法的估计均方误差下限,也为机动目标跟踪中最优过程噪声方差的设定提供了依据。仿真结果验证了算法的有效性。     

The knapsack problem with a minimum filling constraint

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     

Production scheduling with history‐dependent setup times

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     

AFM探针针尖曲率半径显微测量方法

探针针尖曲率半径是影响原子力显微镜分析与观测精度的关键要素之一,微小光学零件采用的精密测量技术不适于分析非透明探针针尖曲率半径。以高分辨率扫描电子显微镜图像为分析对象,采用灰质化、滤波降噪等图像预处理和Canny边缘检测技术获取针尖轮廓,对轮廓坐标采样后利用非线性高阶多项式函数拟合轮廓曲线,根据扫描电镜图像的度量标尺换算得到针尖实际曲率半径。结果表明：该方法对AFM探针针尖曲率半径的测量偏差不超过15％,具有较高测试精度和广泛应用前景。     

基于中频数字化技术的塔康测角方法研究

随着软件无线电技术的发展,中频数字化技术不断趋于成熟。针对塔康设备传统的模拟式信号处理体制在实现方式及测量精度上的不足,提出了一种基于中频数字化技术的塔康测角方案,主要针对主辅基准定时点的准确选取和包络信号的快速提取进行了研究。最后给出了仿真测试结果,证明了方案的可行性。     

一类无穷次多项式系统极限环研究

利用平面自治系统的极限环理论和分支理论研究了一类无穷次多项式系统,并讨论了该系统极限环的存在性和唯一性。应用所得结论,推广并改进了前人的结果。     

基于排序的自适应遗传算法航空炸弹弹道拟合方法

提出了一种基于排序的自适应遗传算法的航空炸弹弹道的拟合方法.该方法在简单遗传算法的基础上,将每一代染色体的适应度排序,并添加了交叉率和变异率的自适应控制函数,既克服了简单遗传算法收敛速度慢,稳定性差的缺点,又改善了函数优化效果.算法应用于某型航空炸弹的弹道数据拟合,仿真结果表明,该算法的拟合精度高,拟合模型优化效果良好.     

非圆链轮分度线的样条拟合

非圆链传动中，两链轮分度线为非圆形，该曲线数学表达式是一个非线性函数方程组，严格求解这一函数方程组似乎毫无希望，但是依据动力学的方法可以构造此曲线的切线系，即一切线多边形。从而将这一问题转化为求与切线多边形每条边相切的逼近曲线。     

正切函数的契比协夫逼近及其系数的加速计算法

本文给出正切函数的有理展开和契比协夫展开式系数的加速计算方法;同时在YH-1机上进行了数值试验,结果表明:用现在的系数来计算正切函数,其精度比原来正切函数的精度可提高30%左右。