一类微分多项式的值分布

讨论了微分多项式fnP(f)(n≥2)之导数的Picard例外集问题,在Picard例外集的意义之下推广了Anderson等人的结果。     

GF(q)上多元多项式与钟控序列

本文讨论了有限域GF(q)(q=p~α,p≥2为素数,α≥1为正整数)上多元多项式与钟控序列的周期和线性复杂度的关系。当前馈函数g(x_1,x_2,…,x_n)∈GF(q)[x_1,x_2,…x_n]为一次多项式时,我们给出了钟控序列到达最大周期与线性复杂度的充要条件。     

Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels

This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011     

面向飞参数据处理应用的数据平滑算法对比

对飞参原始记录数据进行预处理是有效利用飞参数据的基础。介绍了三种典型数据平滑算法的原理,建立仿真航线,并以飞参经度和纬度通道数据为例,对三种平滑算法的处理效果进行了对比研究。结果表明,当误差服从正态分布以及广义正态分布时,通过选取适当参数,Vondrak算法相对于滑动平均和加权局部多项式回归算法具有明显优势,从而为飞参原始记录数据的预处理算法选择提供了参考。     

非常余维数的未定向协边子群

本文在如下情况:(1)取定P(1≤P≤8),设K_i=8l_i P(i=1,…,l),k_2>9/4(k_1-1)>O;(2)取定整数q(l≤q≤4)式,设k_1=4t_1 q(i=1,…,l),k_2>5/2(k_1-1)>0满足时,决定了一些非常非常余维数的未定向协边子群J_n~(k_1…k_l).     

An FPTAS for scheduling a two‐machine flowshop with one unavailability interval

We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n⁵/ε⁴) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Some new results on the preservation of the NBUE and NWUE aging classes under the formation of coherent systems

We consider the classical problem of whether certain classes of lifetime distributions are preserved under the formation of coherent systems. Under the assumption of independent and identically distributed (i.i.d.) component lifetimes, we consider the NBUE (new better than used in expectation) and NWUE (new worse than used in expectation) classes. First, a necessary condition for a coherent system to preserve the NBUE class is given. Sufficient conditions are then obtained for systems satisfying this necessary condition. The sufficient conditions are satisfied for a collection of systems which includes all parallel systems, but the collection is shown to be strictly larger. We also prove that no coherent system preserves the NWUE class. As byproducts of our study, we obtain the following results for the case of i.i.d. component lifetimes: (a) the DFR (decreasing failure rate) class is preserved by no coherent systems other than series systems, and (b) the IMRL (increasing mean residual life) class is not preserved by any coherent systems. Generalizations to the case of dependent component lifetimes are briefly discussed.     

考虑扰动引力影响的弹道助推段误差传播解析计算方法

针对地球扰动引力对弹道导弹惯性导航精度影响日益突出这一问题,研究了沿弹道扰动引力的多项式拟合方法,并基于线性系统理论和弹道摄动思想推导了用于求解扰动引力对弹道助推段状态影响的完整解析表达式。同时考虑扰动引力影响与导弹视加速度之间的耦合特性,将扰动引力引起的视加速度偏差视为扰动引力影响的附加补偿项,并进行迭代修正。仿真结果表明:扰动引力拟合残差小于3×10~(-7)m/s~2,考虑耦合项修正的弹道误差传播解析模型计算残差减小为原有方法的1/3,计算时间仅为直接采用弹道积分求差法的1/10。     

基于相位恢复技术的二维相位解包络算法

介绍一种新型的二维相位解包络算法。该算法的原理是将被解包络的相位作为输入光场,通过光学衍射计算得到其远场衍射光场的光强分布,然后使用相位恢复算法进行优化计算,得到一组用于表达连续波面的最佳Zernike多项式参数。此算法的特点在于,结合已成熟的相位恢复算法,波面解包络的唯一性和准确性可得到充分的保证;同时利用光场衍射计算,可方便地通过对衍射光强的滤波实现对相位噪声的抑制。实验验证了该算法的有效性。     

手绘非规则军标图形的结构化识别方法

在基于草图的态势标绘系统中,线状和面状军标图形通常是依具体地形、战况、意图等标绘的,没有规则的形状,难以采用基于表观的方法进行识别。针对这类手绘非规则军标图形提出了一种结构化识别方法,基于非规则军标图形集的特点定义了9种图元和4种图元间空间结构关系,将图形表示为图元向量和图元结构关系矩阵,通过匹配图元向量和图元结构关系矩阵来识别图形类别,并估计未知图形与模板图形之间的图元对应关系。实验结果表明:本文方法能有效克服图形形状变化的影响,对手绘的常用非规则军标图形的类别和图元对应关系具有较高的识别正确率和识别速度。