基于HMM的FOPEN UWBSAR图像中的树干杂波抑制

树干杂波是叶簇穿透(FOPEN)超宽带合成孔径雷达(UWBSAR)图像中叶簇隐蔽目标检测的主要干扰,能否有效抑制树干杂波是目标检测成功与否的关键。利用UWBSAR的大积累角成像特性所提供的目标方向性信息,基于隐马尔可夫模型(HMM),提出了一种识别并抑制树干杂波的方法。试验结果表明,该方法可有效识别并抑制FOPENUWBSAR图像中的树干杂波,增强叶簇隐蔽目标检测性能。     

二阶中立型含逐段常滞量微分方程的伪概周期解的存在性

讨论下列中立型含逐段常滞量微分方程的伪概周期解d2dt2(x(t)+p(t)x(t-1))=qx(2[t+12])+g(t,x(t),x[t])采用不动点定理和构造伪概周期序列的方法,得到了此方程的伪概周期解的存在性,并推广了文献[5～8]中的有关结果。     

铝基水反应金属燃料性能初步研究

提出水反应金属燃料双反应区模型,结合化学反应过程对其进行了热力特性分析,初步研究了铝基水反应金属燃料配方等因素对发动机性能的影响。     

振动矩形机翼非线性绕流数值研究

发展了可用于模拟包含运动边界的非定常流动的数值方法。该方法采用非结构动网格技术并构造了一种MUSCL类型有限体积格式,求解考虑了动网格效应的三维非定常Euler方程。非结构网格的变形运动由弹簧近似技术实现。用上述方法计算了作正弦振动的矩形机翼非线性绕流,计算结果与实验结果吻合,得到了流体运动与固体运动耦合的非线性流动特性。计算表明,该数值方法具有较好的精度和可靠性,完全可用于气动弹性或其他流固耦合问题的数值模拟。     

三轴跟踪平台算法研究

为研究三轴跟踪平台的过顶问题,讨论了退化α型跟踪算法,提出了完全退化型算法和三步跟踪算法,并从理论上证明了所给出的算法可以解决过顶问题。对距离地球表面大约2000km星体,应用完全退化型算法进行计算机观测仿真,计算数据表明,运用完全退化型算法可以使三轴的转动角速度控制在0.56((°)s)以内。随后将三步跟踪算法应用到三轴自动跟踪平台试验,试验表明三步跟踪算法可以解决过顶跟踪问题。     

聚二甲基硅烷高压合成聚碳硅烷的组成与结构分析

以聚二甲基硅烷(PDMS)为原料,在高压釜内450℃下反应6h,制备了聚碳硅烷(PCS)先驱体。对其组成及结构进行了表征,推测了PCS的大致结构模型。研究表明,PCS分子包含Si CH3、Si CH2 Si、Si H组成的SiC4、SiC3H等结构单元,实验式为SiC1.87H7.13O0.03。与常压高温裂解制备的软化点相近的PCS相比,二者的元素组成基本一致,高压合成的PCS具有较高的分子量和硅氢含量,但支化度略高。     

履带车辆动力传动系统仿真与试验验证

基于EASY5软件平台,利用模块化的建模手段,建立了履带车辆动力传动系统动力学模型,并进行了加速过程仿真.通过实车试验验证了模型的有效性和仿真结果的正确性.结果表明,该建模手段可有效的应用于车辆性能分析及预测.     

液相色谱-质谱法测定2-氯乙烯胂酸

研究了用液相色谱-质谱两种电离技术测定路易氏剂1的降解产物2-氯乙烯胂酸,比较了在不同流动相中该化合物的响应情况,并且利用源内CID技术获得了丰富质谱碎片,对所鉴定的碎片进行了解释,用选择离子检测得到该化合物的检测限在APCI电离技术中为9ng,在ESI电离技术中为4ng．     

Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005