采用VXI总线研制电路板故障诊断系统

利用VXI总线技术研制了电路板故障诊断系统 ,并就其硬件和软件的组成进行了较详细的探讨 ,建立软件核心部分的测试诊断数据库时采用了一种全新的方法———离散事件系统法     

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.     

多人多任务动态决策建模的环境

就人的组队如何解决多任务环境中具有不定性情况下分布式资源管理等问题 ,在微机上采用具有音响—图形功能的 Turbo pascal程序语言 ,建立了一个可以控制的实验环境 ,经分析得出 :在此环境中 ,可以模拟、产生 C3分布系统方面基本的决策制作问题 ,且能充分适应于复杂性的逐步引入 ,可用作建立多人多任务动态决策模型的载体 ,开发组队决策的规范—描述理论。     

增强导弹武器系统电磁兼容性的方法研究

以系统内和系统间的EMC设计、分析与预测技术为基础 ,利用有关武器系统EMC的历史数据、现场报告和理论分析结论 ,对在执行任务中的导弹武器系统进行电磁环境兼容分析预测 ,识别和测试系统中的潜在干扰发射 /响应设备对 ,并进行电磁干扰控制和电磁加固 ,以增强实际训练、作战中导弹武器系统的电磁兼容性能。该方法也可推广应用到其它复杂武器系统如多军、兵种联合行动中武器系统的EMC分析和电磁加固实践中 ,以有效地减小或消除各友邻武器系统相互之间的EMI影响。     

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     

Distribution free bounds for service constrained (Q,r) inventory systems

A classical and important problem in stochastic inventory theory is to determine the order quantity (Q) and the reorder level (r) to minimize inventory holding and backorder costs subject to a service constraint that the fill rate, i.e., the fraction of demand satisfied by inventory in stock, is at least equal to a desired value. This problem is often hard to solve because the fill rate constraint is not convex in (Q, r) unless additional assumptions are made about the distribution of demand during the lead‐time. As a consequence, there are no known algorithms, other than exhaustive search, that are available for solving this problem in its full generality. Our paper derives the first known bounds to the fill‐rate constrained (Q, r) inventory problem. We derive upper and lower bounds for the optimal values of the order quantity and the reorder level for this problem that are independent of the distribution of demand during the lead time and its variance. We show that the classical economic order quantity is a lower bound on the optimal ordering quantity. We present an efficient solution procedure that exploits these bounds and has a guaranteed bound on the error. When the Lagrangian of the fill rate constraint is convex or when the fill rate constraint does not exist, our bounds can be used to enhance the efficiency of existing algorithms. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 635–656, 2000     

Planning gamma accelerated degradation tests with two accelerating variables

Gamma accelerated degradation tests (ADT) are widely used to assess timely lifetime information of highly reliable products with degradation paths that follow a gamma process. In the existing literature, there is interest in addressing the problem of deciding how to conduct an efficient, ADT that includes determinations of higher stress‐testing levels and their corresponding sample‐size allocations. The existing results mainly focused on the case of a single accelerating variable. However, this may not be practical when the quality characteristics of the product have slow degradation rates. To overcome this difficulty, we propose an analytical approach to address this decision‐making problem using the case of two accelerating variables. Specifically, based on the criterion of minimizing the asymptotic variance of the estimated q quantile of lifetime distribution of the product, we analytically show that the optimal stress levels and sample‐size allocations can be simultaneously obtained via a general equivalence theorem. In addition, we use a practical example to illustrate the proposed procedure.     

交互式Pareto前沿可视化决策

针对现有高维多目标可视化技术不能有效显示决策偏好信息这一难题,提出一种基于径向轴图的交互式Pareto前沿可视化决策方法。进行标准化适应度函数处理,消除量纲差距;根据交互更新的轴向量矩阵建立最小二乘问题模型,通过Moore-Penrose广义逆矩阵方法求解投影点,从而获得Pareto前沿分布图。该方法能够有效显示目标各维度信息,直观呈现决策偏好,动态表现目标性能趋势。通过实验与传统可视化技术对比分析,验证了该方法的有效性和实用性。     

美军智能化武器装备体系发展

智能化武器装备体系是军事智能化的基础和前提。智能化武器装备体系的集约高效发展,首先需做到找准定位,精准聚焦。本文针对美军的智能化武器装备体系,梳理了其发展,总结了其在各作战领域的典型作战运用,并分析了其下一步的发展趋势。     

基于Floyd算法的常规导弹连续波次作战运输规划

为提高常规导弹连续波次作战效能,对常规导弹连续波次作战运输规划问题进行研究。以Floyd算法为基础,首先生成了作战机动区域的交通网络最短路径、距离矩阵;其次将常规导弹连续波次作战运输过程分解为不同阶段,以运输过程中的整体暴露时间最短为目标,构建了初始规划方案0-1整数规划模型;然后考虑道路通行量及地域容量限制,对初始规划方案中存在的地域容量超过限制及单行道路中会车、超车情况进行逐步循环优化,以得到最佳运输规划方案;最后选择了一个作战案例想定,通过Matlab编程对案例进行了求解,得到了针对此案例的最佳运输规划方案,验证了模型的正确性和算法的有效性。