基于一类弱连续T-模的模糊Hopfield神经网络研究

基于一般的弱连续T-模与取大（V）模糊算子的复合,建立了具有一般意义的动态模糊神经网络——模糊Hopfield神经网络,并系统分析了该动态系统的性能：在Hamming距离意义下证明了该网络是稳定的,而且其平衡点（吸引子）具有全局Lyapunov稳定性。最后,提供了一种有效的学习算法。     

Capacitated warehouse location model with risk pooling

In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于熵权理想解法的炮兵C~4ISR系统效能评估

炮兵C4ISR系统的效能评估是我军信息化联合作战效能评估的重要研究内容.依据系统效能评估的需要,结合我军炮兵C4ISR系统的实际情况,提出了确立评价指标的3个重要原则,建立了炮兵C4ISR系统效能评价的指标体系,讨论了熵权理想解法的基本思想和主要步骤,并给出了炮兵指挥系统的评估案例.通过MATLAB编程实现,得到了各评价系统的优劣,速度快,精度高,弱化了主观因素,使得评价更令人信服,以便指导部队的日常训练和考核.     

Clifford分析中K超正则函数的Riemann边值问题

Clifford分析中的函数理论被广泛研究,得到的许多结果推广了经典复分析中解析函数的理论。文中研究了Clifford分析中K超正则函数的Riemann边值问题,得到它的一种表示式和Cauchy积分公式等一些性质,利用转化法和积分方程及不动点原理证明了它的一类Riemann边值问题O解的存在唯一性。     

分物问题的分法数计算

r个物品分配到n个盒子中,在不同的条件下会有不同的分法数。本文讨论了不同条件下,分法数的计算方法。     

球齿轮传动的齿面接触分析和应力分析

球齿轮是一种新型的二维齿轮传动机构.在建立了球齿轮数学模型的基础上,得到了球齿轮传动的啮合模型,并进行了齿面接触特性分析,通过解非线性方程组,可得到接触点在齿面的位置.分析了球齿轮齿面的结构特征,针对球齿轮传动的接触形式表现为轮齿凸面与马鞍面之间的点接触,对啮合齿面的接触椭圆进行了分析计算,总结出了球齿轮在任一偏摆平面内啮合传动时接触椭圆的变化规律:在轮齿根部和顶部啮合时,接触椭圆较小,因而接触应力较大;而在轮齿中部啮合时,接触椭圆较大,所以接触应力较小.采用有限元的方法对球齿轮轮齿进行了弯曲应力和接触应力分析,分析结果进一步验证了接触椭圆变化规律的正确性.以上结论对进一步研究球齿轮的传动理论与实际应用具有重要的指导意义.     

卫星数传调度模型研究

卫星数传调度问题是一个具有多时间窗口、多资源约束的优化问题。针对该问题,建立了卫星数传需求模型、任务模型和调度模型。在建模过程中,采用了框架模型形式,把问题中的主要约束封闭于每个数传任务中,这在降低调度模型复杂度的同时,也降低了调度算法设计难度。还提出了调度算法设计思想,并设计了一基于灵活度的调度算法。仿真表明,所建立的模型及算法对解决卫星数传调度问题是可行的。     

地球模型偏差对远程弹箭弹道仿真的影响及修正

针对地球模型精确度影响远程弹箭弹道仿真的问题,分析了地球模型偏差对弹道仿真精度的影响并加以修正。采用总的地球椭球系,在已有弹道模型的基础上,分析了垂线偏差的产生机理及其对定向定位参数的影响,并由此得出弹道几何偏移随定向偏差的变化规律,研究了引力加速度初值偏差对弹道的误差累积,并对由水准面不平行性造成的实际落点高差进行了理论推导。对比仿真算例表明,考虑地球模型偏差影响的仿真结果与不考虑的情况下差别较明显,在远程条件下对弹道仿真精度的影响不容忽视。     

飞航导弹故障飞行落点概率计算方法

针对飞航导弹故障飞行落点概率难以准确计算的问题,通过分析导弹的各个分系统的故障机理重新提出五种故障模式,依据逐系统串联的原理建立了故障模式的概率分配计算模型;在对发射、飞行和故障后坠落等阶段进行分析的基础上建立各故障模式的仿真模型;最后应用蒙特卡洛方法对某型导弹故障飞行落点的概率分布进行了仿真计算。     

Sensor placement in active multistatic sonar networks

The idea of deploying noncollocated sources and receivers in multistatic sonar networks (MSNs) has emerged as a promising area of opportunity in sonar systems. This article is one of the first to address point coverage problems in MSNs, where a number of points of interest have to be monitored in order to protect them from hostile underwater assets. We consider discrete “definite range” sensors as well as various diffuse sensor models. We make several new contributions. By showing that the convex hull spanned by the targets is guaranteed to contain optimal sensor positions, we are able to limit the solution space. Under a definite range sensor model, we are able to exclude even more suboptimal solutions. We then formulate a nonlinear program and an integer nonlinear program to express the sensor placement problem. To address the nonconvex single‐source placement problem, we develop the Divide Best Sector (DiBS) algorithm, which quickly provides an optimal source position assuming fixed receivers. Starting with a basic implementation of DiBS, we show how incorporating advanced sector splitting methods and termination conditions further improve the algorithm. We also discuss two ways to use DiBS to find multiple source positions by placing sensors iteratively or simultaneously. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 287–304, 2017