Evasion costs and the theory Of conscription

This paper examines the trade and military relationship between two countries which have a common military enemy. The paper explains how the former two countries, which are military allies and trading partners, share the burden of defence against the third country. It demonstrates how the defence production of a country may hurt its ally because the latter country's terms of trade can be deteriorated. Whether or not a smaller ally spends less on defence is analyzed. Also analyzed is the effects of the reactions of the enemy country on the trade between the two allies and their welfare.     

多层DSS体系结构研究

在设计和部署DSS时,由于对DSS体系结构认识不清,常常不能做出正确的选择.而对DSS体系结构的正确选择正是成功实施DSS的关键.详细地分析了第一、二代DSS模型在具体实施和运行过程中存在的问题,提出了一种综合的多层DSS模型,并设计了软件体系结构.该模型综合了数据仓库和数据集市的优点,解决了第一、二代DSS模型存在的不足,对规划和部署DSS具有一定的指导意义.     

A self‐adapting genetic algorithm for project scheduling under resource constraints

This papers deals with the classical resource‐constrained project scheduling problem (RCPSP). There, the activities of a project have to be scheduled subject to precedence and resource constraints. The objective is to minimize the makespan of the project. We propose a new heuristic called self‐adapting genetic algorithm to solve the RCPSP. The heuristic employs the well‐known activity list representation and considers two different decoding procedures. An additional gene in the representation determines which of the two decoding procedures is actually used to compute a schedule for an individual. This allows the genetic algorithm to adapt itself to the problem instance actually solved. That is, the genetic algorithm learns which of the alternative decoding procedures is the more successful one for this instance. In other words, not only the solution for the problem, but also the algorithm itself is subject to genetic optimization. Computational experiments show that the mechanism of self‐adaptation is capable to exploit the benefits of both decoding procedures. Moreover, the tests show that the proposed heuristic is among the best ones currently available for the RCPSP. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 433–448, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10029     

双正激ZVT-PWM开关电源充电机

介绍了一种双正激电路的软开关拓扑,分析了其软开关的工作原理,推导了实现软开关的关键技术参数的计算公式并采用该技术开发了１．８ｋＷ的充电电源。     

基于静止标量磁强计的运动舰船定位问题的研究

建立了静止标量磁强计对运动舰船定位的模型,并给出了用遗传算法求全局较优解、然后用单纯形法进行精确局部搜索的求解参数的方法.仿真实验表明这种方法有效、可行.     

On the asymptotic optimality of algorithms for the flow shop problem with release dates

We consider the nonpermutation flow shop problem with release dates, with the objective of minimizing the sum of the weighted completion times on the final machine. Since the problem is NP‐hard, we focus on the analysis of the performance of several approximation algorithms, all of which are related to the classical Weighted Shortest Processing Time Among Available Jobs heuristic. In particular, we perform a probabilistic analysis and prove that two online heuristics and one offline heuristic are asymptotically optimal. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

HLA的雷达目标跟踪算法验证系统

构建了一个基于HLA的雷达目标跟踪分布式仿真系统。采用组件设计思想,实现目标跟踪组件和滤波组件,并将这两套组件嵌入到目标跟踪分布式仿真系统中。实践结果表明:基于组件思想构建的目标跟踪和滤波算法能够很好嵌入到分布式雷达目标跟踪系统中,从而为跟踪算法的合理选择、算法参数的优化设计,以及实际系统的研制提供有力支撑。     

基于RWC的机载SAR斜视成像仿真

通过建立机载合成孔径雷达的工作模型,介绍了SAR的基本成像原理,并针对机载SAR在斜视条件下,因距离走动量较大,对地面目标的成像受到严重影响的情况,详细分析了距离走动产生的原因。在傅里叶变换之前使用对距离走动进行校正的CS算法对经典的CS算法作出了改进,重点推导了改进后算法的实现过程,并通过Matlab仿真模拟地面目标物实现了CS算法在不同条件下的成像结果,证明使用改进后的算法在斜视角情况下成像质量有较大的改善。     

基于复杂性的战场损伤定位流程评价模型研究

损伤定位流程制定的合理与否是衡量一个评估员水平高低的重要指标之一。对损伤定位流程的评价涉及到所用时间、工具、操作的难度等指标都可以用其复杂性来表示,目前鲜有关于损伤定位流程评价的研究,因此提出战场损伤定位流程的复杂性,并借鉴软件工程领域的程序复杂性量化方法——图熵法对其进行量化。经过数据验证,复杂性与评估时间之间存在较好的拟合关系,并用实例说明了模型的应用效果。     

Reliability of a 2‐dimensional k‐within‐consecutive‐r × s‐out‐of‐m × n:F system

A 2‐dimensional rectangular (cylindrical) k‐within‐consecutive‐r × s‐out‐of‐m × n:F system is the rectangular (cylindrical) m × n‐system if the system fails whenever k components in a r × s‐submatrix fail. This paper proposes a recursive algorithm for the reliability of the 2‐dimensional k‐within‐consecutive‐r × s‐out‐m × n:F system, in the rectangular case and the cylindrical case. This algorithm requires min ( O (mk^r(n?s)), O (nk^s(m?r))), and O (mk^rn) computing time in the rectangular case and the cylindrical case, respectively. The proposed algorithm will be demonstrated and some numerical examples will be shown. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 625–637, 2001.