基于LDA算法的一维距离像特征提取

在线性分辨分析(LDA)基础上,通过遗传算法寻找Fisher准则下最优的线性映射中心和相应的最优映射,使不同模式在特征空间内具有最大的可分离性,并将该算法用于雷达目标一维距离像特征提取与识别中。实验表明,和原算法相比,新算法在特征提取性能和目标正确识别率上有较大提高,说明了算法的有效性。     

基于自适应遗传算法的目标优化分配方法

提出了基于自适应遗传算法的目标优化分配模型,阐述了自适应遗传算法在目标优化分配中的应用,通过在计算机上仿真运行实例得出了目标优化分配方案。本方法对地面防空目标优化分配决策研究具有一定的参考价值。     

一种针对基因识别的GHMM简化算法

广义隐Markov模型是计算机基因识别的一种重要模型,它克服了传统隐Markov模型的状态段长成几何分布的缺陷,更加适合于计算机基因识别。其缺点在于计算量大,需要采用有效的简化算法。利用基因的结构特点,在不附加额外限制条件的情况下,提出了一种新的简化算法,其计算复杂度是序列长度的线性函数。对实际生物序列数据的测试结果表明了此简化算法的有效性。     

An experiment evaluating how the tiny mass eccentricities in spin-stabilized projectiles affect the position of impact points

This study investigates and quantifies some possible sources affecting the position of impact points of small caliber spin-stabilized projectiles (such as 12.7 mm bullets). A comparative experiment utilizing the control variable method was designed to figure out the influence of tiny eccentric centroids on the projectiles. The study critically analyzes data obtained from characteristic parameter measurements and precision trials. It also combines Sobol's algorithm with an artificial intelligence algorithm—Adaptive Neuro-Fuzzy Inference Systems (ANFIS)—in order to conduct global sensitivity analysis and determine which parameters were most influential. The results indicate that the impact points of projectiles with an entry angle of 0° deflected to the left to that of projectiles with an entry angle of 90°. The difference of the mean coordinates of impact points was about 12.61 cm at a target range of 200 m. Variance analysis indicated that the entry angle — i.e. the initial position of mass eccentricity — had a notable influence. After global sensitivity analysis, the significance of the effect of mass eccentricity was confirmed again and the most influential factors were determined to be the axial moment and transverse moment of inertia (Izz Iyy), the mass of a projectile (m), the distance between nose and center of mass along the symmetry axis for a projectile (Lm), and the eccentric distance of the centroid (Lr). The results imply that the control scheme by means of modifying mass center (moving mass or mass eccentricity) is promising for designing small-caliber spin-stabilized projectiles.     

基于遗传算法的整周模糊度OTF解算

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

基于遗传算法的通信网络可靠性优化设计

在可靠性条件约束下 ,使网络成本最低是网络规划NP hard问题 .文章提出一种基于遗传算法的优化方法解决了这类问题 .仿真结果表明这种算法是有效的 .     

单静止站纯方位系统的可观测性与目标参数估计算法

分析了目标参数Vmx/Do,Vmy/Do 可观测的条件 ,给出了估计这对参数的一种递推算法 .     

Distribution free bounds for service constrained (Q,r) inventory systems

A classical and important problem in stochastic inventory theory is to determine the order quantity (Q) and the reorder level (r) to minimize inventory holding and backorder costs subject to a service constraint that the fill rate, i.e., the fraction of demand satisfied by inventory in stock, is at least equal to a desired value. This problem is often hard to solve because the fill rate constraint is not convex in (Q, r) unless additional assumptions are made about the distribution of demand during the lead‐time. As a consequence, there are no known algorithms, other than exhaustive search, that are available for solving this problem in its full generality. Our paper derives the first known bounds to the fill‐rate constrained (Q, r) inventory problem. We derive upper and lower bounds for the optimal values of the order quantity and the reorder level for this problem that are independent of the distribution of demand during the lead time and its variance. We show that the classical economic order quantity is a lower bound on the optimal ordering quantity. We present an efficient solution procedure that exploits these bounds and has a guaranteed bound on the error. When the Lagrangian of the fill rate constraint is convex or when the fill rate constraint does not exist, our bounds can be used to enhance the efficiency of existing algorithms. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 635–656, 2000     

具有节点失效的网络可靠度的信息交互算法

提出了一种用于计算具有节点失效的网络可靠度的新计算方法。该算法依据不交化代数及协同计算的思想,采用节点信息义互的方法直接获得网络的不交化最小路集。算法简便易行,具有分布计算的特点,为大型网络系统的可靠性度计算提供了一种新的途径。     

一种基于Hausdorff距离的景象匹配算法

Hausdorff距离是一种比较点集的最大的最小距离。以边缘信息为特征点,给出了一种基于Hausdorff距离的景象匹配算法,它利用模板来简化计算Hausdorff距离。从仿真结果可以看出:具有较高的匹配精度。