舰炮目标毁伤判定与毁伤效果仿真研究

舰炮对目标毁伤的判定与毁伤效果仿真是舰载作战系统仿真训练的重要组成部分,作为连接舰炮射击与目标毁伤的中间环节,它实现了对目标毁伤状态的判定,以及目标毁伤效果的仿真反馈,从而仿真训练系统中其他仿真成员,以及各型侦察模拟设备可以发现并判定目标毁伤状态,为作战指挥人员进行作战指挥决策提供目标毁伤信息,为参训职手提供更为实战化的仿真训练环境。在简述舰载作战系统仿真训练系统的基础上,重点探讨了基于毁伤概率表和弹目交会的舰炮毁伤判定方法,并简述了目标毁伤效果仿真方法。     

一阶非线性脉冲边值问题解的存在性

研究一阶非线性脉冲周期边值问题，应用微分不等式和Schaefer不动点定理，得到了脉冲边值问题解存在的充分性判据，并给出了相应的Green函数。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

泥沙传输方程广义初边值问题的解析解与差分解比较

Cheng提出了泥沙传输问题的广义底边界条件并导出了具有复杂形式的解析解 ,解析解的求解过程中还需求解两个超越方程。本文一方面分析了解析解的复杂性 ,简化了超越方程根的搜索区间 ,另一方面 ,通过数值试验 ,得到了一类稳定的差分格式 ,格式参数为 0 .48≤Θ ≤ 1 ,数值例子表明 :对于稳定的差分格式 ,差分数值解具有很好的逼近效果。     

高炮火控系统模拟训练及综合评价系统

提出了一种新型的基于计算机及计算技术的高炮火控系统仿真模拟训练及综合评价系统的设计方案。这一方案不仅注重了系统实现仿真训练的基本功能,同时还利用计算机仿真优势,强调了对训练效果的评估及对训练模式的总结。提出了实时决策支持的新概念     

多目标决策的特殊坐标系求解方法

在多目标决策问题中,满意解常常要在非劣解中寻找。一般来讲,对于两个目标(二维)的解的判别并不困难,但遇到多个目标(n维),且有多个可行解时,对非劣解的判别就显得有些繁复了。因此,采用直观容易的特殊坐标系来判别"非劣解",从而给出求解多目标决策问题满意解的方法。     

二维时变电磁场第一边值初值问题广义解的存在与唯一性

在频率为１０１０以下的情况下,给出了由正弦交变电流引起的二维时变电磁场所对应的偏微分方程,并用非线性算子半群理论及单调算子理论证明了相应偏微分方程第一边值初值问题广义解的存在与唯一性．     

一类拟线性周期抛物边值问题

研究了一类带有小扩散系数的拟线性周期抛物混合边值问题。给出当扩散系数趋于零时其非平凡解的渐近性。     

含非线性半群的微分包含

研究了形如X＇（t）∈-Ax（t）＋F（t,x（t））,0≤t≤T,X（0）＝x0的微分包含解的存在的局部性和整体性的结果,并在某种条件下研究了解的稳定性。     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011