面向多平台多目标协同跟踪的指派问题

针对多平台多目标协同跟踪中要求多个无人地面平台尽可能均匀地协同跟踪多个目标的特点,提出了改进的离散粒子群优化算法。首先采用连续型粒子群优化算法中的速度和位置迭代公式,然后对粒子位置进行离散编码,使粒子编码对应于可行的指派方案;其次,在优化算法中引入局部搜索,提高算法寻优性能。最后将所提算法应用于多平台多目标协同跟踪中的指派问题,并与未加入局部搜索的粒子群优化算法比较,仿真结果表明,加入局部搜索后的离散粒子群优化算法具有较好的寻优性能。     

武警学院研究生教育回顾与发展问题思考

武警学院研究生教育已开办六年,分析六年来研究生教育的基本情况、取得的成绩和存在的问题,对于今后一个时期的研究生教育具有现实指导作用。     

就业与社会稳定的关联性探析

就业与社会稳定的正相关：就业的保障功能的发挥、激励功能的发挥、融入功能的发挥、协作功能的发挥，都有助于实现社会稳定。就业存在的问题与社会稳定的负相关：失业人员大量存在、就业弱势群体大量存在、就业权益缺失，都影响着社会稳定。     

The one‐warehouse multiretailer problem with an order‐up‐to level inventory policy

We consider a two‐level system in which a warehouse manages the inventories of multiple retailers. Each retailer employs an order‐up‐to level inventory policy over T periods and faces an external demand which is dynamic and known. A retailer's inventory should be raised to its maximum limit when replenished. The problem is to jointly decide on replenishment times and quantities of warehouse and retailers so as to minimize the total costs in the system. Unlike the case in the single level lot‐sizing problem, we cannot assume that the initial inventory will be zero without loss of generality. We propose a strong mixed integer program formulation for the problem with zero and nonzero initial inventories at the warehouse. The strong formulation for the zero initial inventory case has only T binary variables and represents the convex hull of the feasible region of the problem when there is only one retailer. Computational results with a state‐of‐the art solver reveal that our formulations are very effective in solving large‐size instances to optimality. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

建立维和警察心理调控机制之我见

联合国维和警察是一个特殊的职业群体，所处的工作和生活环境艰苦、恶劣、危险。维和警察面对这种超出常规的精神压力，出现各种各样的心理问题是必然的。维和警察的心理问题仅仅依靠维和警察个人自我调节是远远不够的，必须建立一套有效的调控机制来预防和治疗其心理问题，维护好他们的心理健康。     

浅谈教师对数学学业不良生的影响

本文通过教师的信念、课堂教学、教师的问题意识三个方面的探讨，来论述教师对数学学业不良生的影响，希望通过教师的作用有效促进数学学业不良生的转化。     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

The stochastic joint replenishment problem: A new policy,analysis, and insights

In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a single‐location, N‐item setting. The replenishment decisions are based on both group reorder point‐group order quantity and the time since the last decision epoch. We derive the expressions for the key operating characteristics of the inventory system for both unit and compound Poisson demands. In a comprehensive numerical study, we compare the performance of the proposed policy with that of existing ones over a standard test bed. Our numerical results indicate that the proposed policy dominates the existing ones in 100 of 139 instances with comparably significant savings for unit demands. With batch demands, the savings increase as the stochasticity of demand size gets larger. We also observe that it performs well in environments with low demand diversity across items. The inventory system herein also models a two‐echelon setting with a single item, multiple retailers, and cross docking at the upper echelon. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

加强建筑消防设计审核工作之思考

结合自己的工作实践 ,分析建筑消防设计审核工作的重要性 ,并对如何加强建筑消防设计审核工作提出了看法。     

利用整帧翻转的SRAM型FPGA故障注入加速算法

不可恢复异常比特位(unrecoverable-sensitive bits, UR-SB)不能通过定时刷新修复,会造成卫星载荷在轨服务的长时间中断,是地面故障注入试验需要着重评估和改善的。但UR-SB占比极低,若采用传统逐位翻转故障注入方法,其测试耗时太长,效率极低。提出了一种基于整帧翻转的静态随机存取存储器型现场可编程门阵列的故障注入加速算法,其通过整帧翻转能够快速筛除不存在UR-SB的配置帧,并进一步用二分法对存在UR-SB的配置帧进行快速搜索,有效加速了UR-SB的精确定位过程。以在轨常用XQR2V3000器件为例,理论分析在较差情况下测试效率可提升207倍,信号生成载荷实测结果最高可提升949倍,理论分析和实测结果均验证了所提加速算法的有效性。