一个快速的临界跟踪策略 VLSI故障模拟新方法

运用九故障信息标记（X,D,M,R,E,Q,T,P,U）,提出了加速扇出重汇聚引线临界性计算的一种故障模拟新方法,理论分析表明该方法是有效的。     

基于自由边控制流图的路径覆盖分析实现方法

针对路径覆盖测试,给出了一般循环结构的一种简化处理方案及把按此方案得到的控制流图转化为自由边控制流图方法,并探讨了基于自由边控制流图进行路径覆盖分析的实现方法和优点。     

多微机系统VME总线控制器的设计与实现

文中给出了一个机械人力反馈依从控制用多微机系统的VME总线控制器的基本结构,给出了采用循环选择(RRS)优先策略裁决器的设计细节,指出了在设计过程中遇到的问题及其解决办法,最后以MSI、SSI给出了总线控制器的具体实现。     

介质和介质覆盖的导电体散射场的计算方法

文中介绍了计算介质和介质覆盖的良导电体散射场的几种常用计算方法,说明了各种方法的发展现况和发展方向,并指出了它们各自的应用范围。     

密封包装弹药内部湿度变化规律测试研究

密封包袋内部湿度是影响弹药质量变化的主要因素。本文通过测定不同温度和湿度环境条件下包装内部湿度变化情况,分析确认了影响密封包装内部相对湿度变化的主要因素是包装材料的透湿性。     

软件可靠性评估技术研究

MTBF,初始故障数N,故障暴露率K,一次运行的成功率θ是软件可靠性的基本参数,也是反映软件可靠性的关键因素.在理论分析和工程应用实验基础上,给出了这些参数的计算方法.     

外挂物管理和武器模拟器仿真系统设计

介绍了一种基于两级1553B总线和以太网的外挂物管理和武器模拟器仿真系统的设计与实现。该系统采用全数字方法模拟了飞机外挂物管理的内容和功能。详细讨论了该仿真系统设计的系统结构、系统接口、系统数据流,然后给出了具体的硬件和实时仿真软件的实现方法。该系统可用于航空电子仿真系统中。     

Chance-constrained linear programming with location scale distributions

M. Kress, in 1984, studied the chance-constrained critical path problem. The author proved that if the project time random variables follow a class of location-scale probability distributions, then there exists a specific threshold confidence level, such that the critical path for the system remains the same for all higher confidence levels. The purpose of this article is to study the similar properties for a general chance-constrained linear programming (C²LP) problems with location-scale probability distributions. We present results for chance-constrained linear programming which parallel those in Kress's article. © 1992 John Wiley & Sons, Inc.     

美国科技动员发展的主要特点

科学技术作为构成战争实力的重要因素，已为越来越多的国家所认识，为保障战争对科学技术的需求，科技动员成为战争动员的重要内容。美国一贯十分重视科学技术力量在战争中的巨大作用，通过采取各种政策措施，有力地推动其科技动员向前发展。     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016