带混合误差的Ishikawa迭代格式

将Ishikawa型迭代格式的收敛性问题推广到带混合误差的Ishikawa型迭代格式的情形 ,同时所用的证明方法和技巧有所改进     

Generating Pareto‐optimal boundary points in multiparty negotiations using constraint proposal method

In this paper a constraint proposal method is developed for computing Pareto‐optimal solutions in multiparty negotiations over continuous issues. Constraint proposal methods have been previously studied in a case where the decision set is unconstrained. Here we extend the method to situations with a constrained decision set. In the method the computation of the Pareto‐optimal solutions is decentralized so that the DMs do not have to know each others' value functions. During the procedure they have to indicate their optimal solutions on different sets of linear constraints. When the optimal solutions coincide, the common optimum is a candidate for a Pareto‐optimal point. The constraint proposal method can be used to generate either one Pareto‐optimal solution dominating the status quo solution or several Pareto‐optimal solutions. In latter case a distributive negotiation among the efficient points can be carried out afterwards. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 210–225, 2001     

后方油库整体生存概率分析计算

针对我军后方油库特点,探讨了油库整体生存概率计算的基本思路和方法,分析了各类分项目标生存概率的计算方法,采用层次分析对后方油库各分项目标权值进行了详细分析计算,可为后方油库伪装防护效能评估提供依据。     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

稳健局部线性嵌入方法

针对局部线性嵌入方法对于噪声的敏感性,从分析噪声对数据集局部特性的影响入手,提出了稳健局部线性嵌入方法。通过与局部线性嵌入方法的理论分析和实例对比,表明稳健局部线性嵌入方法不仅对噪声影响不敏感,而且对邻域的选择有较好的适应性,可更好地挖掘数据集的本征特性,具有更强的数据可视化能力。     

数值模拟类升力体外形高超声速粘性绕流

采用空间二阶精度的交替方向隐式分解的NND格式求解完全气体假定下的非定常薄层近似Navier Stokes方程 ,并采用抛物化的椭圆型方程生成复杂带翼外形的空间网格。最后给出了类升力体外形在M∞ =8 0 ,α =2 0°下的流场计算结果。     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

试论对抗模拟的基本原理

对抗模拟是作战模拟中的一种重要方法,文章就其基本原理作了系统深入的探讨.通过中外专家的论述,阐述了对抗模拟概念的关键要素.通过对信息流动的分析,进一步剖析了对抗模拟的内涵.对抗模拟这种作战模拟形式具有仿真性、拟剧性、博弈性和不可重复性等特征.按照层次、信息提供的方式、结果评价的方式、实施的方式、运用的工具以及地域等区分了不同类型的对抗模拟.对抗模拟需要的关键仿真技术包括分布交互仿真、人工智能、虚拟现实以及信息网格等方面.     

军用安全模型扩展及其应用

在分析基于格理论的信息流控制军用安全模型在实际应用中存在的不足的基础上,从安全类定义和信息流控制策略两个方面对原模型进行了理论扩展和安全性分析.扩展模型安全类在作为对象和主体时具有相同的表达方式,以及在保持原模型信息流关系情况下,允许同职权等级用户交流他们共知的信息,以及高职权等级用户访问低职权等级用户他们之间共知的信息.以数字文档安全管理系统为例对扩展模型应用进行了描述.实例表明扩展模型更适合实际系统对信息流控制的要求.