An FPTAS for scheduling a two‐machine flowshop with one unavailability interval

We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n⁵/ε⁴) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Proactive release procedures for just‐in‐time job shop environments,subject to machine failures

In this paper, we consider just‐in‐time job shop environments (job shop problems with an objective of minimizing the sum of tardiness and inventory costs), subject to uncertainty due to machine failures. We present techniques for proactive uncertainty management that exploit prior knowledge of uncertainty to build competitive release dates, whose execution improves performance. These techniques determine the release dates of different jobs based on measures of shop load, statistical data of machine failures, and repairs with a tradeoff between inventory and tardiness costs. Empirical results show that our methodology is very promising in comparison with simulated annealing and the best of 39 combinations of dispatch rules & release policies, under different frequencies of breakdowns. We observe that the performance of the proactive technique compared to the other two approaches improves in schedule quality (maximizing delivery performance while minimizing costs) with increase in frequency of breakdowns. The proactive technique presented here is also computationally less expensive than the other two approaches. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

基于遗传算法与支持向量机的火炮内膛疵病分类方法研究

支持向量机能够较好解决小样本、非线性数据特征的多分类问题,适用于火炮内膛疵病的分类,但其性能依赖于其参数的选取;对基本遗传算法进行改进,使用自适应的交叉算子和变异算子,并应用于支持向量机参数优化;通过对火炮内膛疵病分类精度的对比研究,改进的遗传算法确定支持向量机优化参数的方法取得了良好的效果,验证了该方法对疵病分类的有效性。     

具有集值H-半-伪单调映射的广义向量变分不等式解的存在性

首先推广向量集值半一单调映射到向量集值H-半-伪单调映射,然后利用Kakutani—Fan—Glicksberg不动点定理,研究了具有集值H-半-伪单调映射的广义向量t变分不等式问题,在自反Banach空间中得到了两个存在性结果。     

基于BP神经网络的防空C3I人机交互性能评估

阐述了BP神经网络的相关原理,建立了防空武器指挥自动化系统人机交互性能评估的指标体系,对应用人工神经网络解决防空武器指挥自动化系统人机交互性能评估的方法问题进行了探讨,并且给出了神经网络的评估模型及算法.通过实例证明该方法是可行的.     

自动装弹机开放式自动测试系统的设计研究

针对自动装弹机故障难以检测、现有检测方法重复开发和利用效率不高等现象, 提出了自动装弹机开放式自动测试系统的概念, 分析了检测系统硬件和软件构成, 详细讨论了通用检测平台的功能组成, 为军用和民用产品的检测提供了一种新方法。     

大口径机枪结构动力学建模方法研究

总结了我国近年来关于大口径机枪结构动力学建模方法研究的主要成果,分析了目前建模方法上存在的某些问题以及对武器装备研制的影响,进一步介绍了边界条件的确定、模型正确性判别和载荷识别等方面的新技术。     

笼型转子无刷双馈电机d-q模型与控制特性仿真

无刷双馈电机是一种新型的适于变频调速系统使用的电机,其结构型式和工作原理与传统交流电机相比具有较大的区别.针对转子结构为笼型短路绕组的无刷双馈电机,建立了其在转子旋转坐标轴下的d-q数学模型,导出了电磁转矩表达式,并应用该模型对该类电机的控制特性进行了仿真研究,仿真结果验证了模型的正确性.     

用错误围堵策略建立可生存的网络安全设备内核

提出在IBM虚拟机器的架构上,使用错误围堵策略建立可生存的网络安全设备内核的思想。建立有效的资源管理器,分割、调度机器资源,把物理资源提供给虚拟机器,平衡错误围堵与其它的性能要求。利用软件和硬件错误围堵技术制约对系统攻击引起的错误,防止一个错误引起整个系统的崩溃。用以上策略建立了内核模型,给它加上大负荷,正常和异常的工作。实验结果显示:即使在系统中某些部分出错的情况下,依然不影响系统的整体性能,并且错误围堵的开销几乎可以忽略不计。     

半无限大海水空间中水平电流元产生的电磁场计算

提出一种根据经典的Summerfield赫兹矢量来计算空气和海水中水平直流电流元在半无限大海水空间中所产生的电磁场的简单方法,并用J．R．Wait, P．R．Bannister和R．L．Dube的方法验证了用该方法推导出的电磁场表达式是正确的。