酸性条件下几种锅炉炉管钢腐蚀性能分析

研究了几种锅炉炉管钢在 p H=3的 H2 SO4 溶液中腐蚀速率的差异 .电化学测试结果表明 :炉管钢的腐蚀速率与钢中合金元素的种类和含量有一定关系 ;含铬、钼量较高的钢种腐蚀速率较低 .由此可见 ,铬元素是抑制炉管钢在酸性介质中发生腐蚀的最主要的合金元素 ,其他元素如钼、镍等对炉管钢的腐蚀性能也有重要影响     

灭火力量部署的计算机图形标识

灭火兵力部署的计算机图形标识旨在用计算机图形标识的方法模拟消防力量部署。本文通过程序设计对图标进行选择、移动、删除、位置记录等操作 ,将灭火力量标识到火场的适当位置 ,从而实现对消防力量决策、消防兵力实时部署的计算机模拟 ,可应用于计算机灭火指挥模拟训练系统中。     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

气体化学反应速率的 DSMC 方法

为预报化学反应过程,应用ＤＳＭＣ方法研究了双原子分子的离解反应,讨论了高温情况下（Ｔ～Ｅａ／ｋ）采用由实验测定得到的反应速率与气体温度间Ａｒｒｈｅｎｉｕｓ经验关系式的可靠性问题,分析了振动热非平衡效应对于离解反应速率的影响,给出了由ＤＳＭＣ方法得到的离解反应速率与气体温度的关系曲线。     

基于D-S理论的多传感器空中目标识别

针对当前空中目标识别的特点,探讨基于D-S理论的多传感器空中目标识别方法.设计了一套多传感器空中目标识别算法.详细推导了该算法,对"未知度"的概念进行了扩充,让其涵盖了部分不可求的逆命题,并结合具体实例对其应用进行了验证和分析.分析表明,该算法能够较好地识别空中目标.灵活确定"未知度",适当扩充"未知度"的概念,可使一些复杂问题简单化,通过较少地运算达到预定效果.     

抗战中我军瓦解日军的历史经验

瓦解敌军是我军政治工作三大原则之一。抗战中瓦解敌军的工作,得到了极大的丰富和发展。其主要经验和启示是:客观分析作战对象特点,确定瓦解敌军工作的新方针;建立健全各级组织,加强瓦解敌军工作的统一领导;广泛深入开展宣传,发动瓦解敌军的政治攻势;实行优待俘虏政策,增强瓦解敌军工作的效果。     

履带车辆动力传动系统仿真与试验验证

基于EASY5软件平台,利用模块化的建模手段,建立了履带车辆动力传动系统动力学模型,并进行了加速过程仿真.通过实车试验验证了模型的有效性和仿真结果的正确性.结果表明,该建模手段可有效的应用于车辆性能分析及预测.     

液相色谱-质谱法测定2-氯乙烯胂酸

研究了用液相色谱-质谱两种电离技术测定路易氏剂1的降解产物2-氯乙烯胂酸,比较了在不同流动相中该化合物的响应情况,并且利用源内CID技术获得了丰富质谱碎片,对所鉴定的碎片进行了解释,用选择离子检测得到该化合物的检测限在APCI电离技术中为9ng,在ESI电离技术中为4ng．     

Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005