运用多作战策略打击多类型目标的效能分析

基于一体化联合作战要求,对武器装备体系中射击效力评估、优化模型进行了研究.首先推导了Gauss-Legendre法计算点目标被毁伤的概率公式,之后建立了射击效能评估模型.在此基础上,改进传统的优化算法,并提出具体的优化步骤.仿真计算表明,射击效力评估、优化模型能够为作战决策提供技术支持.     

Optimal outbound dispatch policies: Modeling inventory and cargo capacity

In this paper, we present an optimization model for coordinating inventory and transportation decisions at an outbound distribution warehouse that serves a group of customers located in a given market area. For the practical problems which motivated this paper, the warehouse is operated by a third party logistics provider. However, the models developed here may be applicable in a more general context where outbound distribution is managed by another supply chain member, e.g., a manufacturer. We consider the case where the aggregate demand of the market area is constant and known per period (e.g., per day). Under an immediate delivery policy, an outbound shipment is released each time a demand is realized (e.g., on a daily basis). On the other hand, if these shipments are consolidated over time, then larger (hence more economical) outbound freight quantities can be dispatched. In this case, the physical inventory requirements at the third party warehouse (TPW) are determined by the consolidated freight quantities. Thus, stock replenishment and outbound shipment release policies should be coordinated. By optimizing inventory and freight consolidation decisions simultaneously, we compute the parameters of an integrated inventory/outbound transportation policy. These parameters determine: (i) how often to dispatch a truck so that transportation scale economies are realized and timely delivery requirements are met, and (ii) how often, and in what quantities, the stock should be replenished at the TPW. We prove that the optimal shipment release timing policy is nonstationary, and we present algorithms for computing the policy parameters for both the uncapacitated and finite cargo capacity problems. The model presented in this study is considerably different from the existing inventory/transportation models in the literature. The classical inventory literature assumes that demands should be satisfied as they arrive so that outbound shipment costs are sunk costs, or else these costs are covered by the customer. Hence, the classical literature does not model outbound transportation costs. However, if a freight consolidation policy is in place then the outbound transportation costs can no longer be ignored in optimization. Relying on this observation, this paper models outbound transportation costs, freight consolidation decisions, and cargo capacity constraints explicitly. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 531–556, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10030     

“过渡衔接词语”在大学英语短文写作中的作用

短文写作是大学英语四级考试的一个重要组成部分 ,短文写作的成功与否将直接影响到是否通过四级。本文将从三个方面归纳、分析三段式短文中常用的过渡衔接词语在英语短文写作中的“闪光”点作用。旨在帮助学生认识过渡衔接词语的重要性 ,从而提高写作水平     

关于奥运临时用房消防设计问题的技术探讨

由于奥运临时用房项目建设的临时性、特殊性、紧迫性，导致了部分项目的消防设计存在难以满足现行规范的问题。笔者作为消防设计审核人员，以“为建筑内人员提供安全保障；为消防人员提供消防条件，保障其生命安全；尽量减少财产损失；保护结构安全；尽量减少对正常营运的干扰。”为安全目标，利用消防性能化设计，完善了消防设计中的火灾防控技术措施。     

自适应蚁群算法的多机协同空战目标分配方法

对目标超视距空战将是今后空战的主要形式和发展趋势,多机协同多目标攻击中的关键问题是空战决策.首先建立了空战态势评估方法,结合蚁群算法思想,提出了一种新型的目标分配算法模型,并进行了算法实验.实验结果表明基于自适应蚁群算法解决多机协同空战的目标分配问题是有效的,特别是问题规模较大时更显示出其较快的收敛速度和较高的精度.     

一个通用数据库管理工具的研究与实现

目前我国行业信息化建设已经跨越了初级阶段,但在许多行业的信息化应用中还存在着烟囱效应和信息孤岛效应。为了将行业信息化引向深入,需要对原有系统进行数据集成。文中首先对数据集成的基本概念进行了探讨,并进一步对数据集成的一个重要工具——通用数据库管理工具的功能及实现方法进行了研究。文中所讨论的通用数据库管理工具与其他工具的区别在于:能够对物理上分布的、异构的多个数据库进行管理,还能够在更高的层次上对多个数据库中的数据进行逻辑上的重新组织。文中所讨论的通用数据库管理工具是为最终用户服务的,而不是一个开发工具。     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

师范院校物理化学实验教学中的几个关键问题

物理化学实验是师范院校化学系的基础课程。在教学中应注意指导学生做好预习,注意用“探究式”教学法培养学生,帮助学生建立科学严谨的态度,并在教学中应紧密联系中学化学教学。     

垂直线列阵无源定位精度分析

提出了一种基于垂直线阵的系统,给出了定位模型,并简要介绍了其定位原理.利用由时延引入的距离、高低角和观测得到的方位角信息,建立了三维坐标系下的状态方程和观测方程.通过理论分析和仿真计算,讨论了声速测量误差、时延估计误差和阵元位置误差对系统定位精度的影响,给出了时延估计误差的克拉美-罗下界.综合时延估计、基线横纵扰动、三类误差的影响,在一定条件下,对目标距离估计的相对误差可控制在20%以内.     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010