基于微分平坦的高超声速滑翔飞行器轨迹规划

针对高超声速滑翔飞行器再入轨迹规划问题,提出了一种基于微分平坦理论的三自由度轨迹生成方法。在分析纵向运动简化模型的微分平坦属性基础上,将纵向参考轨迹规划问题映射到平坦输出空间,消除微分动力学约束的同时降低系统设计的维数,进而提高求解效率;采用全局插值多项式参数化平坦输出函数,将问题转换为非线性规划问题求解;设计比例-微分反馈控制律跟踪纵向参考轨迹,同时采用航向角误差走廊控制侧向运动,实现三自由度轨迹生成。仿真分析表明所提出的方法能够较快生成满足多种约束且性能优化的飞行轨迹。     

多项式输出中相关变量的结构贡献和相关贡献分析

以二次不含交叉项的多项式为例,解析推导了正态相关输入变量对输出响应量方差贡献的结构贡献部分和相关贡献部分。通过算例验证了解析结果的正确性。将所研究的指标和已有的进行对比,归纳出结构贡献部分和相关贡献部分的侧重与统一。解析解可直接用于极限状态函数不超过两次且不含交叉项的结构和相关贡献的识别,为其他新的数值算法提供了参考对照。     

复杂线型小水线面双体船兴波阻力数值计算方法研究

将分段幂多项式拟合方法与线性兴波阻力理论相结合,提出一种针对复杂线型小水线面双体船的兴波阻力数值计算方法,该方法应用于常规小水线面双体船的兴波阻力计算,表明该方法能在常规的幂多项式拟合方法的基础上进一步提高计算精度,同时也验证了该方法的正确性,将该方法的计算结果与复杂线型小水线面双体船剩余阻力的试验结果相比,两者吻合较好,证明了该方法用于复杂线型小水线面双体船的兴波阻力计算是可行的。     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

联合补充博弈的费用分摊

就一个仓库、多个零售商,对联合订货费用函数的模型进行分析,给出了一个求解最佳订货周期的多项式时间的算法,且算法的时间复杂性为O（nlogn）。利用文献[8]中的技巧,给出了该库存博弈的核。     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

一种改进的旋转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     

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

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

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

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