有源诱饵弹对抗毫米波制导武器仿真分析

有源诱饵弹是对抗毫米波制导武器的一种重要手段。根据毫米波雷达制导导弹波束窄的特点,采用投放多枚诱饵弹以组成诱饵阵的对抗方法。初步建立了对抗过程仿真的数学模型,并通过该模型对对抗过程进行了仿真分析。分析表明,如果依据形势合理布放诱饵,将会对目标起到很好的保护作用。     

刍议GJB 1371与GJB 3837的关系

在新装备的研制过程中,需要有效地开展保障性分析工作,同时会产生大量的信息,GJB 3837便是为有效地存储这些信息而制定的标准。为明确GJB 3837与保障性分析工作之间的对应关系,本文对GJB 1371与GJB 3837进行了简要介绍,并对二者之间的对应关系展开研究,以期为GJB 1371和GJB 3837的工程化应用奠定基础。     

对加强产品标准化大纲实用性的思考和建议

当前在武器装备研制生产过程中,普遍存在着产品标准化大纲编写太笼统、单一及缺乏实用性等问题,本文分析了这一问题存在的现状及产生的原因,并进行深入思考,提出了几点建议,以使产品标准化大纲在型号研制工作中真正起到承上启下、承前启后的指导作用。     

基于MT方法的雷达波束可视化实现

复杂电磁环境可视化是目前军事仿真领域的难点和热点.以雷达天线方向图函数为基础,通过科学计算可视化领域中绘制等值面的Marching Tetrahedral方法,绘制出雷达波束在三维空间的形态及其动态扫描效果,并在Matlab环境下验证了绘制出的雷达波束形态的正确性.对生成雷达波束的计算过程进行了优化处理,使之能够应用于实时模拟训练环境.在D3D9.0和VC6.0环境下实现结果表明,生成的雷达波束显示效果逼真、流畅,能够为受训人员提供直观、动态的画面.     

基于模糊层次分析法的高层建筑火灾风险评估

火灾风险评估是降低火灾损失的有效方法。利用模糊层次分析法,建立了高层建筑火灾风险评估体系,并应用于具体高层建筑的火灾风险评估中。评估结果与实际情况取得了较好的一致性,从而为高层建筑火灾风险评估提供了一种简便可行的方法。     

基于本体的信息与信息空间及其代数结构

实现特定信息环境下基于信息组织的信息资源服务,需要对信息、信息空间有更合适的、形式化的描述。文章基于本体层次对信息、信息的运算、信息之间的关系以及信息空间给出了数学描述并对其代数结构进行了研究。从而为特定信息环境下的信息资源服务提供理论支撑。     

基于组态软件的装甲装备发电系统综合检测平台

针对装甲装备发电系统的检测要求,利用组态软件作为平台,设计了一种新型的发电系统综合检测平台。介绍了由工控机、组态王、编码器、数据采集卡组成的实时数据采集和控制系统,分析了基于组态王的模糊PID控制器的实现和组成、控制策略和实现算法。该平台可视化地控制电机的运行并实时显示和保存实验数据。实验结果表明:系统的可控性好、鲁棒性与抗干扰能力强,具有一定的推广价值。     

Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008