属性约简方法在威胁因素选择中的应用

分析了影响对空威胁判断的威胁因素,确定了各属性值离散化的处理标准,构建了基于粗糙集理论的对空威胁判断决策信息表;通过基于属性重要性的约简方法和基于正区域的约简方法对威胁因素进行了约简,确定了水面舰艇对空威胁判断的威胁因素,最后用Matlab仿真技术验证结论的正确性。     

直觉层次模糊评价法的航材逆向物流效益评估

在分析影响航材逆向物流效益因素的基础上,构建了航材逆向物流效益指标体系,提出了一种新的效益评估方法,这种方法将直觉模糊熵权法与层次分析法有效地结合起来,共同确定指标权重,再通过模糊综合评价法对航材逆向物流效益进行评估,提高了评估的科学性和准确性,为航材部门完善物流环节、提高物流效益提供了一定的参考。     

联合作战自同步指挥问题探析

研究联合作战自同步指挥问题。本文从自同步指挥的概念入手,阐述了自同步指挥的特点、实现基础和运行机理,分析自同步指挥的应用与发展前景。     

空袭目标流威胁评估与排序模型研究

结合现代防空作战的特点和指挥自动化系统的工作过程,对影响目标威胁评估的各种因素进行了分析,利用模糊综合评价等理论和方法,给出了进行威胁评估的因素集和评价集,建立了相应的数学模型,叙述了进行威胁评估与排序的方法、步骤和一般准则.     

Warehouse sizing to minimize inventory and storage costs

This paper considers a warehouse sizing problem whose objective is to minimize the total cost of ordering, holding, and warehousing of inventory. Unlike typical economic lot sizing models, the warehousing cost structure examined here is not the simple unit rate type, but rather a more realistic step function of the warehouse space to be acquired. In the cases when only one type of stock‐keeping unit (SKU) is warehoused, or when multiple SKUs are warehoused, but, with separable inventory costs, closed form solutions are obtained for the optimal warehouse size. For the case of multi‐SKUs with joint inventory replenishment cost, a heuristic with a provable performance bound of 94% is provided. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 299–312, 2001     

TBM模型的目标综合识别算法

利用电子支援措施(ESM)和光学成像传感器等不同类型传感器进行目标综合识别,是现代综合电子战中的一个重要研究课题。TBM是D-S证据理论的一个扩展模型,它研究了D-S证据理论的动态部分,从数据融合的角度来看,它是一种层次化的递进模型,尤其适用于需要逐层进行数据、特征或决策级融合的融合系统。提出了一种基于TBM模型的异类传感器目标综合识别算法,充分利用了电子侦察和光学成像侦察提供的独立、互补的信息,获得了对目标的有效识别。仿真结果证明了这种算法的有效性。     

Workload distribution of discrete‐time parallel queues with two servers

We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000     

具有节点失效的网络可靠度的信息交互算法

提出了一种用于计算具有节点失效的网络可靠度的新计算方法。该算法依据不交化代数及协同计算的思想,采用节点信息义互的方法直接获得网络的不交化最小路集。算法简便易行,具有分布计算的特点,为大型网络系统的可靠性度计算提供了一种新的途径。     

Discrete equal‐capacity p‐median problem

This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000.     

基于集对分析与粗糙集理论的综合评价模型

传统评价方法在处理评估问题时的基本思路是设法把随机不确定性和模糊不确定性在一定条件下转化为确定性,然后用处理变量的数学方法来处理这些不确定性,忽视了不确定性在一定范围内不确定的信息。尝试应用集对分析和粗糙集的基本概念和理论,建立综合评价模型,试图避免或化解传统评估方法的许多缺憾。最后,以一实例证明了利用这种综合评价模型对问题进行评估时,保留了问题的不确定信息,可在一定程度上客观、合理地反映出问题的本质。