从卫星SAR海洋图像中检测船目标

船在卫星ＳＡＲ海洋图像中一般是以亮点的形式出现。本文先简要地介绍了船目标在卫星ＳＡＲ海洋图像中的成像原理，在此基础上介绍了三种检测船目标的方法——窗口滤波方法、自适应阈值法、概率密度函数法，并运用实际的卫星ＳＡＲ海洋图像对这三种算法进行了测试。测试结果表明，后两种方法效果比较好。     

显示界面复杂目标辨认研究

为了使作战人员更快速地辨认武器系统显示界面目标,研究人对不同复杂程度及大小的目标符号辨认情况,为武器系统显示界面的目标编码设计提供依据。提出目标符号复杂度的定义,建立复杂度计算公式,对符号的复杂程度进行量化。通过测定被试完成搜寻特定目标的时间,建立反应时间和符号复杂度与大小、高复杂度目标数量与大小的线性回归模型。提取被试辨认不同复杂度目标的脑电信号,分析脑负荷。结果表明符号复杂度越低或尺寸越大,目标越容易辨认;当大小一定时,人对复杂度3以下的目标辨认情况较好,对复杂度3以上的目标辨认绩效明显下降;脑负荷随着目标复杂度的增大而增大。结论为武器系统显示界面的符号复杂度应设计在3以下,高复杂度目标符号使用时应合理调整其大小。     

舰载反潜直升机吊放声纳区域反潜策略建模

为提高舰载反潜直升机吊放声纳区域反潜搜索作战效能,对舰载反潜直升机吊放声纳区域反潜搜索策略问题进行了建模。根据潜艇目标位置信息的不确定性,研究了潜艇目标位置信息的概率分布函数,采用Markov状态转移概率矩阵描述了潜艇目标位置信息变化的方法。其次,给出了基于贝叶斯理论的潜艇目标信息概率分布函数更新公式。再次,推导了舰载反潜直升机吊放声纳区域反潜最优策略,给出了舰载直升机吊放声纳区域反潜搜索算法。最后给出了典型案例,验证了反潜搜索策略的有效性。研究成果可为舰载反潜直升机吊放声纳区域反潜提供决策依据。     

基于SVPWM的军用储能电源双闭环模糊控制

传统整流器的接入会给电网带来大量谐波和无功污染,为了削减电网侧的电压谐波分量,提高军用储能电源充电系统的功率因数,提出一种基于空间电压矢量PWM的新型闭环控制方法。在建立三相电压型PWM整流器的数学模型的基础上,分析了储能电源整流环节的双闭环控制结构,引用模糊逻辑对双闭环控制方法进行改进,利用模糊比例积分(PI)控制算法设计电流内环,系统可以实现PI参数的自适应调整。通过仿真验证了该方法的有效性,采用双闭环模糊PI控制的PWM整流器可以实现单位功率因数运行,保证输出的直流电压稳定,抗干扰能力强,具有良好的动态响应。     

An index policy for a stochastic scheduling model with improving/deteriorating jobs

We consider stochastic scheduling models which have the natural character that jobs improve while being processed, but deteriorate (and may possibly leave the system altogether) while processing is diverted elsewhere. Such restless bandit problems are shown to be indexable in the sense of Whittle. A numerical study which elucidates the strong performance of the resulting index policy is complemented by a theoretical study which demonstrates the optimality of the index policy under given conditions and which develops performance guarantees for the index heuristic more generally. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 706–721, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10036     

Continuous accumulation games on discrete locations

In an accumulation game, a HIDER attempts to accumulate a certain number of objects or a certain quantity of material before a certain time, and a SEEKER attempts to prevent this. In a continuous accumulation game the HIDER can pile material either at locations $1, 2, …, n, or over a region in space. The HIDER will win (payoff 1) it if accumulates N units of material before a given time, and the goal of the SEEKER will win (payoff 0) otherwise. We assume the HIDER can place continuous material such as fuel at discrete locations i = 1, 2, …, n, and the game is played in discrete time. At each time k > 0 the HIDER acquires h units of material and can distribute it among all of the locations. At the same time, k, the SEEKER can search a certain number s < n of the locations, and will confiscate (or destroy) all material found. After explicitly describing what we mean by a continuous accumulation game on discrete locations, we prove a theorem that gives a condition under which the HIDER can always win by using a uniform distribution at each stage of the game. When this condition does not hold, special cases and examples show that the resulting game becomes complicated even when played only for a single stage. We reduce the single stage game to an optimization problem, and also obtain some partial results on its solution. We also consider accumulation games where the locations are arranged in either a circle or in a line segment and the SEEKER must search a series of adjacent locations. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 60–77, 2002; DOI 10.1002/nav.1048     

钢弦测功仪的智能化改造研究与实现

将过去传统的钢弦式测功仪用计算机技术进行数据采集与处理 ,从而提高了其测量速度及测试精度 ,数据更为准确、稳定 ,可在 1台仪器上同时连续高速动态显示被测主轴的转速、功率、扭矩 ,并自动保存数据 .人机界面强 ,智能化程度高 ,具有很强的数据后处理及文件形成功能 .     

Multi‐item capacitated lot‐sizing problems with setup times and pricing decisions

We study a multi‐item capacitated lot‐sizing problem with setup times and pricing (CLSTP) over a finite and discrete planning horizon. In this class of problems, the demand for each independent item in each time period is affected by pricing decisions. The corresponding demands are then satisfied through production in a single capacitated facility or from inventory, and the goal is to set prices and determine a production plan that maximizes total profit. In contrast with many traditional lot‐sizing problems with fixed demands, we cannot, without loss of generality, restrict ourselves to instances without initial inventories, which greatly complicates the analysis of the CLSTP. We develop two alternative Dantzig–Wolfe decomposition formulations of the problem, and propose to solve their relaxations using column generation and the overall problem using branch‐and‐price. The associated pricing problem is studied under both dynamic and static pricing strategies. Through a computational study, we analyze both the efficacy of our algorithms and the benefits of allowing item prices to vary over time. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于两阶段感染过程分析的蠕虫传播模型SSI

合理的蠕虫传播模型可以准确地描述蠕虫类恶意代码在网络中的传播行为,有助于在开展蠕虫防护、检测和抑制技术的研究时更深入地分析蠕虫的传播机制。通过引入和分析蠕虫的感染时间这个在经典的传染病模型研究中被忽略的重要因素,使用确定性建模分析方法推导得出SSI蠕虫传播模型,合理地反映网络中的脆弱性主机在蠕虫传播时可能的状态转换。模拟仿真表明,SSI模型可以相对准确地描述蠕虫类恶意代码在网络中的传播过程。