基于FRFT的FMCW SAR成像

调频连续波合成孔径雷达(FMCW SAR)结合调频连续波与合成孔径成像技术,具有体积小、重量轻、成本低、分辨率高等一系列优点,是新近提出来的一种成像雷达体制。由于FMCW SAR的差频信号在方位向可以转化为调频信号,据此提出了一种基于分数阶傅立叶变换(FRFT)的FMCW SAR成像算法。仿真结果表明,该算法与RD算法相比较,方位向主瓣压缩和旁瓣抑制效果非常明显。     

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     

战场空间本体构建方法研究

从构建战场空间知识基础设施,进而形成一体化的知识处理平台、获取知识优势出发,将本体思想引入战场空间知识建模领域,提出了战场空间本体体系,即战场空间本体包括上层本体、领域本体、应用本体;并重点研究了一种战场空间领域本体的构建方法BOC,包括基于上层本体BUO的领域本体构建方法,基于上层本体BUO的领域本体合并方法.基于本体的战场空间知识建模从根本上解决了战场空间中知识系统之间的知识共享和重用问题,便于知识系统的集成.     

某型无人机发动机动力学建模与仿真

无人机飞控系统是无人机模拟训练系统的一个重要组成部分.基于某型无人机实飞参数,解出发动机推力,建立了发动机动力学模型,并结合无人机六自由度模型建立了无人机飞行仿真模型,对该型无人机模拟训练系统飞控系统的研制具有重要意义.最后在MATLAB/SIMULINK环境下进行了仿真,结果表明该建模方法是正确的.     

新混合智能计算法在 UCAV 航路规划中的应用

无人作战飞机(UCAV)出航执行对地攻击(或侦察)任务,若事先针对敌方防御区内的威胁部署和目标的分布情况,就飞行航路进行整体规划设计,则可以综合减小被敌方发现和反击的可能性,最大限度地降低耗油量,从而显著提高其执行任务的成功率.在对进化算法研究的基础上.将用于解决旅行商问题(TSP)的进化算法加以改进,引入优秀个体保护法和模拟退火的策略思想,借以克服进化算法固有的易陷于局部最优的早熟现象,然后运用于UCAV的航路规划.实验结果表明,改进的混合智能计算方法简易而有效,寻优效果明显优于常规进化算法,规划出的航路能够满足UCAV飞行任务规划的综合需要.     

A decision support system for the procurement of military equipment

The use of life-cycle costs in procurement is limited by the accuracy of cost estimates and assessments of availability risks under the conditions generating costs. Critical to these problems are the needs and responses of equipment to maintenance and repair. Using transition probabilities to define the relationships between serviceability and maintenance and repairs, this article develops a comprehensive decision support system for military procurement. It uses a dynamic programming model to determine the least-cost set of maintenance and repair decisions, where adjustments are included for warranty conditions, time value of money, the opportunity costs of equipment failure, and the end-of-cycle salvage values or disposal costs. The system allows users to define working and failed states, create their own rules or indicators of availability from estimates of state probabilities and establish thresholds of risk acceptability.     

废气涡轮增压柴油机动态模型研究

研究了废气涡轮增压柴油机作为转速控制对象时的动态数学模型 ,并在此基础上建立了数字式电子调速器仿真系统 .