利用遗传算法求解整周模糊度

建立了一种基于简单遗传算法的改进模糊度搜索方法求解载波相位测量中的整周模糊度。首先采用UDUT 和LDLT 分解对整周模糊度进行整数高斯变换以降低各整周模糊度之间的相关性 ,然后利用遗传算法进行整周模糊度搜索。在种群个体较少的情况下 ,为了避免早熟使搜索陷入局部最优 ,提出两种变异算子 ,保持个体的多样性。仿真结果表明改进后的算法较使用简单遗传算法具有更快的搜索速度和鲁棒性。     

一类二阶奇异Hamiltonian系统的非碰撞解

运用变分原理,拓扑度理论以及微局部分析技巧相结合的方法,作者讨论了一类二阶奇异Hamiltonian系统的时滞周期解之存在性。     

各向异性稳态渗流复级数解析分析法

提出一种求解二阶线性椭圆形偏微分方程过值问题的新型复级数展开法,并用于求解二维各向异性稳态渗流问题,首先得到了各向异性稳态渗流矩形域、圆形域一般解析解,而且给出数值算例。     

整数变换及其在H.263中的应用

针对H.263视频编码标准的DCT变换有运算量大、截尾误差等特点,在提升格式的基础上,采用整数变换代替浮点DCT,并且对相应的量化器加以调整,设计了一种适宜于H.263的整数变换。并将这种整数DCT、浮点DCT和定点DCT在结构和性能上进行比较分析,证实其具有消除浮点运算、减少运算量的特点,并且有很好的压缩效果。     

“逆解”与“顺解”标准值之再认识

从火控系统论证和动态精度检验需要出发,对火控系统动态误差应该用“逆解”还是“顺解”求取标准值问题,提出了已被否定的“顺解法”有再研讨、认识之必要。     

圆锥壳方程的二次渐近解

本文由旋转壳的一对二阶常微分方程得出圆锥壳的复变量方程,利用渐近积分法推导出方程的一次近似解和二次近似解。二次近似解达到薄壳理论所具有的精度,一次近似解也具有足够精度。对于所取算例,本文解的计算结果与已有的Kelvin函数解的结果符合良好。但本文解为有限形式的简单表达式,便于计算应用。     

Radar pulse interleaving for multi‐target tracking

In a multifunction radar, the maximum number of targets that can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead‐times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the capacity of the system. The problem of interleaving N targets involves a search among N! possibilities, and suboptimal solutions are usually employed to satisfy the real‐time constraints of the radar system. In this paper, we present new tight 0–1 integer programming models for the radar pulse interleaving problem and develop effective solution methods based on Lagrangian relaxation techniques. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

非晶态Ni-P合金化学镀镀液的稳定性研究

采用PdCl2溶液的稳定性试验方法,对非晶态Ni-P合金化学镀镀液(ZFHN防腐蚀镀液)的稳定性和试验条件进行了关系曲线测试及分析.规定和提出了其试验条件和最佳控制参数;试验镀液中PdCl2的最佳浓度是2.4 mg/L、可靠的pH值范围为4.0～5.0.温度、搅拌、PdCl2用量、镀液pH值是决定镀液稳定时间的重要试验条件和试验偏差大的主要因素.研究镀液的稳定性高、组分协同稳定性好,稳定试验时间大于3 min.     

基于逼近理想解排序法的导弹保障性评价研究

保障性评价是实现导弹综合保障目标的重要手段。根据保障性评价指标模型建立了决策判断矩阵,采用层次分析法确定各指标权重,利用逼近理想解排序法对导弹保障性评价进行了定量分析。通过实例分析,这种方法计算简便,可操作性强,有实际应用价值。     

Models and algorithms for shuffling problems in steel plants

In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012