一种改进的卫星导航系统效能评估模型

建立卫星导航系统效能评估指标体系,在原有模糊综合评判法的基础上,引入定量指标的实际测量值,采用将评语集量化的方法,建立效能评估模型,并用实例验证该模型的可行性,给出系统综合效能评估值,避免了原有方法存在的问题,为卫星导航系统的效能评估和研制开发提供了一定的参考.     

层次分析法用于战术互联网路由协议选择

选择合适的路由协议是战术互联网建设的一个关键问题,目前的选择方法大多缺乏定量、系统的分析,无法对路由协议的整体性能进行很好的评价.建立了战术互联网路由协议性能评价层次模型,给出实例说明了利用层次分析法对战术互联网路由协议进行选择的方法.对结果的分析表明方法直观、有效,可以实现合理的决策,具有实用价值.     

Northern Ireland and minimum force: the refutation of a concept?

The debate over whether there exists a British counter-insurgency tradition of minimum force is one that has been thoroughly discussed. Is there anything left to say? This study suggests there is further insight to be attained if one explicitly evaluates the concept of minimum force in relation to the conduct of the security forces in the years of the Northern Ireland conflict. Through an examination of three key periods in the conflict, it will be shown that while there was invariably an awareness of the need to act with restraint among senior officers at the strategic level, this was often difficult to apply at the tactical level in the heat of confrontation. The argument demonstrates that the British Army, and other instruments of the state, rarely acted in a manner that could be described as ‘minimal’. Instead, it was the broader liberal values of the British state that explains largely the degrees of restraint exhibited by the government and security forces.     

Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date

We consider a single-machine scheduling problem in which all jobs have the same due date and penalties are assessed for both early and late completion of jobs. However, earliness and tardiness are penalized at different rates. The scheduling objective is to minimize either the weighted sum of absolute deviations (WSAD) or the weighted sum of squared deviations (WSSD). For each objective we consider two versions of the problem. In the unconstrained version an increase in the due date does not yield any further decrease in the objective function. We present a constructive algorithm for the unconstrained WSAD problem and show that this problem is equivalent to the two-parallel, nonidentical machine, mean flow-time problem. For the unconstrained WSSD and the constrained WSAD and WSSD problems we propose implicit enumeration procedures based on several dominance conditions. We also report on our computational experience with the enumeration procedures.     

On the use of lexicographic min cost flows in evacuation modeling

Building evacuation problems can be represented as dynamic network-flow problems [3]. The underlying network structure of a building evolves through time yielding a time-expanded network (a dynamic network). Usually in such evacuation problems involving time, more than one objective function is appropriate. For example, minimizing the total evacuation time and evacuating a portion of the building as early as possible are two such objectives. In this article we show that lexicographical optimization is applicable in handling such multiple objectives. Minimizing the total evacuation time while avoiding cyclic movements in a building and “priority evacuation” are treated as lexicographical min cost flow problems.     

全垫升式气垫船水压场数值模拟

提出了任意分布的气垫压力所产生的水压场的计算方法 ,对椭圆域上均匀分布的气垫压力产生的水压场进行了数值模拟 ,并将计算结果与实验进行了比较 .结果表明 ,用数值模拟的方法研究全垫升式气垫船水压场是可行的     

Capacity improvement,penalties, and the fixed charge transportation problem

Capacity improvement and conditional penalties are two computational aides for fathoming subproblems in a branch‐and‐bound procedure. In this paper, we apply these techniques to the fixed charge transportation problem (FCTP) and show how relaxations of the FCTP subproblems can be posed as concave minimization problems (rather than LP relaxations). Using the concave relaxations, we propose a new conditional penalty and three new types of capacity improvement techniques for the FCTP. Based on computational experiments using a standard set of FCTP test problems, the new capacity improvement and penalty techniques are responsible for a three‐fold reduction in the CPU time for the branch‐and‐bound algorithm and nearly a tenfold reduction in the number of subproblems that need to be evaluated in the branch‐and‐bound enumeration tree. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 341–355, 1999     

战术数据链性能评估方法研究

性能评估是战术数据链武器装备论证的重要内容,是战术数据链编制体制确定与评估的重要依据。给出了战术数据链性能评估的关键指标并分析了评估的难点,在此基础上提出了战术数据链性能评估的解析方法并对美军11号数据链进行了实例分析。研究结果表明该方法简单、有效,可供决策部门借鉴使用。     

The timing of third-party intervention in social conflict

This paper analyzes how the equilibrium outcome of social conflict between factions is strategically altered by third-party intervention. We consider an intervening third party that commits financial support to one of two contending factions for reducing its cost in conflict. Within the framework of three-player sequential-move games, we investigate the questions as follows. What is the optimal intervention intensity in terms of the third party’s financial support? Is there a first-mover advantage in conflict when there is third-party intervention? Fighting against all odds, will the unsupported faction have a chance to prevail when its opponent receives third-party support? What is the optimal timing of third-party intervention? The analysis in the paper has implications for the conditions under which the strategic intervention of a third party may or may not break a conflict between factions.     

Rare‐event component importance for the consecutive‐k system

Various indices of component importance with respect to system reliability have been proposed. The most popular one is the Birnbaum importance. In particular, a special case called uniform Birnbaum importance in which all components have the same reliability p has been widely studied for the consecutive‐k system. Since it is not easy to compare uniform Birnbaum importance, the literature has looked into the case p = ½, p → 1, or p ≥ ½. In this paper, we look into the case p → 0 to complete the spectrum of examining Birnbaum importance over the whole range of p. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 159–166, 2002; DOI 10.1002/nav.10001