作战实体概念模型结构研究

本文将动态的作战实体视为智能实体,运用系统六元抽象方法对作战实体概念模型构成要素进行分析,明确了要素之间的相互关系,并从作战实体内部的状态、结构、行为出发,提出了一种以知识系统为中心的作战实体的概念模型结构。     

用伴随方程研究烟幕施放的优化问题

从描述烟幕扩散的基本方程出发,提出了一类烟幕施放的优化问题．文中指出,这类问题由于约束条件为复杂的偏微分方程,计算量很大,难以直接求解．为了解决这一问题,引入了一种伴随方法以降低计算量．推导了三维非平坦地形下大气平流一扩散方程的伴随方程,利用伴随方程和原方程的关系,对优化问题进行了等价变形,大大降低了计算量．最后通过一个算例,对这一方法的有效性进行了演示。     

作战分队武器系统的作战效能

战斗分队是未来联合作战中系统对抗的基本单元,以仿生学原理和系统工程理论为指导,建立了分队武器系统作战效能指标体系,并运用层次分析法建立了相应评估模型.最后以两组装甲步兵分队为例,分别评估了其在进攻(对峙)和防御中的作战效能,验证了该指标体系和评估模型的科学性和实用性.为指导员进行科学决策提供了理论依据.     

美军军事转型及其启示(下)

三、美国军事转型的主要特性(一)顶层设计,追求“跨越一代”的规划效果美国军事转型的最显著特点就是谋求跨越时代的超前性,这种谋求超前性的强烈欲望,一方面来自美国人强烈的时代感和机遇意识,另一方面来自他们居安思危的忧患意识。信息技术群的迅猛发展,深刻改变着社会生活的     

试论抗大办学治校的成功经验

抗大在历时9年的办学历程中,坚决贯彻执行“坚定正确的政治方向,艰苦朴素的工作作风,灵活机动的战略战术”的教育方针和“团结、紧张、严肃、活泼”的校训,为八路军、新四军等人民抗日武装培养输送了10多万名军政人才,为夺取抗日民族解放战争的伟大胜利作出了重要贡献,为人民军队院校建设积累了宝贵经验。     

德国顾问团参与中国抗战活动之剖析

在20世纪30年代,受聘于国民政府的德国顾问团参与了中国人民抗击日本法西斯侵略的伟大斗争,为中国反法西斯斗争的胜利作出了重要贡献。他们的到来既是以蒋介石为首的国民党维护其统治的需要,也是德国垄断巨头为实现其战略利益而在中国“押的宝”。     

坚持用科学发展观指导空军转型建设

坚持用科学发展观指导空军转型建设,必须牢牢把握“发展”这一主题,用新的发展思路实现空军更快更好发展;深入贯彻“统筹兼顾,协调发展”的方针,走出一条中国特色空军发展之路;始终坚持“以人为本”这个核心,以人才转型为先导带动空军转型建设全面发展。     

Capacity allocation with traditional and Internet channels

In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Vertically restrictive pricing in supply chains with price‐dependent demand

We examine the behavior of a manufacturer and a retailer in a decentralized supply chain under price‐dependent, stochastic demand. We model a retail fixed markup (RFM) policy, which can arise as a form of vertically restrictive pricing in a supply chain, and we examine its effect on supply chain performance. We prove the existence of the optimal pricing and replenishment policies when demand has a linear additive form and the distribution of the uncertainty component has a nondecreasing failure rate. We numerically compare the relative performance of RFM to a price‐only contract and we find that RFM results in greater profit for the supply chain than the price‐only contract in a variety of scenarios. We find that RFM can lead to Pareto‐improving solutions where both the supplier and the retailer earn more profit than under a price‐only contract. Finally, we compare RFM to a buyback contract and explore the implications of allowing the fixed markup parameter to be endogenous to the model. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

In this paper, we study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel‐level and the berth‐level models. With the same berth‐level model, two heuristic methods are developed using different vessel‐level models. Computational experiments show that the proposed approach is effective and efficient. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006