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.     

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

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

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距离。从仿真结果可以看出:具有较高的匹配精度。     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

改进遗传算法在传声器阵列优化中的应用

规则平面阵列因其结构周期性,在进行波束综合时存在主瓣宽、旁瓣电平高等问题。对此,提出一种基于改进遗传算法的阵列优化方法。设计平面栅格传声器阵列,以满足阵元间距的要求,并构造以主瓣宽度为约束条件、以全局旁瓣电平为适应度的目标函数,对常规遗传算法进行改进,采取个体间自由交叉、随机的阵元数量强制变异的策略来增大种群的搜索范围。通过仿真,得到多个优化阵列,与几种规则平面阵列相比,在不同的信噪比输入下,经过改进遗传算法优化得到的随机阵列均有更好的表现。而相比于几种常规的优化算法,改进的遗传算法具有更强的搜索能力,得到数量更多、性能更优的随机阵列,由此证明了所提方法的可行性。     

修正的响应面方法优化螺栓法兰连接结构几何参数

采用响应面法对螺栓法兰连接进行优化设计时,考虑到经典响应面模型的局限性,在获得结构优化参数与响应指标内在联系的基础上,提出了修正响应面模型;设计了数值试验并对比了数值试验值与前述两种响应面模型预测值,结果表明修正响应面模型的预测值不仅误差相对比较均匀,且最大误差绝对值要明显小于经典响应面模型的相应值。采用遗传算法对修正响应面模型进行了以法兰质量最轻为优化目标的参数优化,取得了比较理想的优化结果。     

基于数据冗余的BDS长报文传输机制改进算法?

北斗卫星导航系统（ Beidou Satellite Navigation System,BDS）只能传输字节受限的短报文,对于长报文需要通过分包和多次重传改善报文传输的成功率,这样会造成系统平台数据发送延误和网络拥塞。提出一种基于数据冗余的数据分包传输机制,该传输机制以数据包为处理对象,采用异或运算得到冗余包,编码简单,编码解码速度快。通过Matlab仿真,证明基于冗余编码机制比无冗余编码单次发送机制的数据接收成功率高15％以上,两次发送对多包的数据接收成功率有较大提高。     

基于不同能量值特征优选的水声目标识别

采用Bartlet平均周期图、小波变换和经验模态分解方法分别提取信号的频段能量值特征、IMF能量值特征,重点对IMF能量值特征进行特征优选。通过设计BP神经网络分类器,对实测的四类舰船目标的辐射噪声信号进行测试,取得了较好的识别效果。     

一种通用型舰载防空硬武器火力优化算法?

针对当前武器优化分配算法缺少通用性,难以兼顾效率和时间的问题,提出了一种通用型舰载防空硬武器火力优化算法。该算法首先提取各舰载武器能够攻击的目标集合,然后对各武器的目标集合逐一进行时间分配,并计算对目标的毁伤概率,最终完成所有武器的分配。计算表明,该算法具有很好的通用性和实时性,可适用于较大规模舰载防空硬武器的火力优化分配问题。