反舰导弹飞行仿真方法

为研究反舰导弹飞行仿真方法,依据导弹系统组成、各个部分相互作用关系和使用环境条件、使用方式,研究建立数学模型、仿真程序设计、计算方法,给出了导弹飞行仿真应注意的问题。飞行仿真可以精确地评估导弹的性能,减少飞行试验次数和导弹研制时间、费用。通过仿真可以暴露系统缺陷,增大飞行试验的成功率,获得更多的试验数据。     

气球载雷达在抗巡航导弹中的运用

巡航导弹在现代战争起着巨大的作用,如何尽早发现巡航导弹便成了当前的首要课题.为了提高对巡航导弹的防御能力,简单分析了巡航导弹的优势及劣势,阐述了气球载雷达的特点以及在探测巡航导弹方面相对与其他探测手段的优势.研究了如何针对巡航导弹的进攻特点,提出了利用气球载雷达与地面雷达网、预警飞机和天波超视距雷达的配合使用发现巡航导弹,能够有效地解决对巡航导弹的预警监视问题.     

基于Elman网络的火控系统传感器故障诊断方法研究

Elman动态递归神经网络具有很强的记忆能力,特别适用于火控系统传感器的故障诊断.提出了一种收敛速度快、精度高、可靠性好的PRP(Polak-Ribiere-Polyak)网络训练方法,增强网络在线学习能力.将该方法运用于Elman动态递归神经网络,并运用该网络对火控系统传感器量测信号进行预测和故障诊断.仿真实验和实际应用表明,提出的Elman动态递归神经网络火控系统传感器系统故障诊断方法有效性好,故障诊断率高.     

基于Vega的战术与火力协同作战视景仿真系统

为了评估战术与火力协同作战对抗效能,建立了分布式战术与火力协同作战对抗网络仿真系统,给出系统框架并介绍各节点功能,详细介绍了视景仿真系统的实现方法和关键技术。基于Vega仿真软件环境开发了战场中的各种复杂场景特效,解决了非视觉物理量的可视化问题;利用Visual C++开发了视景仿真程序,解决了视景驱动和自动视点切换等具体问题。仿真结果表明视景系统可以逼真演示战术与火力协同作战过程并给出作战效能的直观评估。     

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     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

一种能产生扇形波束的赋形抛物面天线

通过数值计算和实验发现:过抛物面顶点将抛物面平分成上下相等的两部分后,将下部分抛物面绕顶点向上旋转一小角度后形成的新天线(由上下两部分组成),可产生扇形波束.馈源方向图为cos3θ、口径半径为0.8m的赋形抛物面E、H平面的半功率宽度分别可达到1.2°、5.6°,而E、H平面的副瓣电平分别为-19.00 dB、-14.85 dB.     

基于IMM的估计算法对机动目标跟踪的比较

机动目标跟踪一直是倍受关注的问题,而交互式多模型方法(IMM)是解决这类问题的经典方法.由于传感器的发展或受某种客观条件的限制等,产生了各种基于IMM的算法.为此,介绍了IMM及基于IMM的几种经典估计算法,对它们进行比较研究,并通过机动目标跟踪的仿真算例说明各算法的适用条件、原理、异同点、性能及复杂性,对机动目标跟踪估计器的选择有重要参考价值.