广义Liénard方程Poincaré分岔极限环的唯一性和不存在性

讨论了一类广义Linard方程x¨+f1(x)x.2+εf2(x)x.+g(x)=0的Poincar分岔极限环的唯一性和不存在性。将不对Abel积分进行分项,而是利用一阶Mel′nikov函数直接从整体上进行分析讨论,得出了若干判别准则和充分条件。     

一种分析广义脊形传输器件的新型数值方法

利用Compact 2-D频域有限差分(FDFD)法分析广义脊形传输器件特性,得到的本征方程只涉及4个横向场分量,与同时处理6个场分量的本征问题相比,大大降低了CPU时间,同时由给定的工作频率f求解相移常数β,易于实际应用.针对广义脊形传输器件的复杂结构,本文划分了不同的子区.几种代表性的脊形波导传输结构分析结果与其他方法一致,表明了本文分析思路的可行性.     

基于模糊指派的阵地选址决策

给出了一种混合部署的多个导弹营的阵地多要素选址决策方法,运用了模糊关系合成矩阵,将各种情况下的多要素导弹阵地选址问题转化为模糊指派问题,并运用了匈牙利算法进行求解,最后给出了实际算例.     

装备修理任务最优分配模型

装备修理是我军一项计划性强、涉及面广和费用颇高的系统工作。本文首先系统分析了装备修理的组织过程。在此基础上,建立了适用于总部、军区等上下各级装备修理任务分配的数学规划模型,并对模型进行了讨论,同时对模型中目标函数的获取提供了一条可行的技术途径。最后,举例说明了该模型的应用。     

离散随机系统的一类综合控制

研究离散线性随机系统在方差约束下的综合控制设计问题,即设计期望的静态输出反馈控制器,使闭环极点位于单位圆内的一个环形区域内。同时,每个稳态状态方差都满足给定的上界约束,从而使闭环系统具有良好的稳定特性和动态性能。本文利用修正的代数Ｌｙａｐｕｎｏｖ方程,推导出控制器存在的充分条件和解集刻划,并提供了说明性的数值算例。文中所得结果具有形式简洁、易于工程实现的特点     

Petri网在防空C~3I系统建模与分析中的应用

针对野战防空系统中的火力分配问题,首先为旅营两级防空系统建立了Ｐｅｔｒｉ网模型,并运用时间Ｐｅｔｒｉ网理论对其进行了时延分析,论述了为野战防空火力分配建立辅助决策系统的重要性。最后利用谓词Ｐｅｔｒｉ网描述了火力分配的推理过程,为有效分析战术决策的正确性提供了依据和思路     

ER2MD：一种ER模型到多维模型的转换算法

多维模型是数据仓库概念设计不可缺少的工具,将传统数据库实体关系模型直接转换到多维模型,势必在很大程度上缩短数据仓库系统的开发周期.针对数据仓库概念设计需求,在传统数据库基础上,提出一种面向多维模型的转换算法ER2MD.该算法可将满足一定条件的实体关系模型转换到多维模型,产生的多维模型符合广义多维范式,能够确保多维数据库分析计算的有效性,进而有利于物理数据库的设计.     

评估C4ISR系统的目标分配质量

分析了影响防空C4ISR系统目标分配质量的主要因素,并以此定义了5个基本指标.利用线性加权法给出了一架歼击机对一架目标机的分配能力的计算方法,以此为基础提出了不同机场的多类歼击机对多批目标的分配能力的算法.最后通过实例计算验证了模型的正确性和实用性.     

Due‐window assignment with unit processing‐time jobs

In due‐window assignment problems, jobs completed within a designated time interval are regarded as being on time, whereas early and tardy jobs are penalized. The objective is to determine the location and size of the due‐window, as well as the job schedule. We address a common due‐window assignment problem on parallel identical machines with unit processing time jobs. We show that the number of candidate values for the optimal due‐window starting time and for the optimal due‐window completion time are bounded by 2. We also prove that the starting time of the first job on each of the machines is either 0 or 1, thus introducing a fairly simple, constant‐time solution for the problem. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network

Scheduling IT projects and assigning the project work to human resources are an important and common tasks in almost any IT service company. It is particularly complex because human resources usually have multiple skills. Up to now only little work has considered IT‐specific properties of the project structure and human resources. In this article, we present an optimization model that simultaneously schedules the activities of multiple IT projects with serial network structures and assigns the project work to multiskilled internal and external human resources with different efficiencies. The goal is to minimize costs. We introduce a metaheuristic that decomposes the problem into a binary scheduling problem and a continuous staffing problem where the latter is solved efficiently by exploiting its underlying network structure. For comparison, we solve the mixed–binary linear program with a state–of–the–art commercial solver. The impacts of problem parameters on computation time and solution gaps between the metaheuristic and the solver are assessed in an experimental study. Our results show that the metaheuristic provides very favorable results in considerable less time than the solver for midsize problems. For larger problems, it shows a similar performance while the solver fails to return feasible solutions. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 111–127, 2012