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

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

Determining a threshold control policy for an imperfect production system with rework jobs

Consider a threshold control policy for an imperfect production system with only a work center handling both regular and rework jobs. An imperfect production system studied here, generates defect jobs by factors other than machine failures. A threshold control or (ω, s) policy sets the guideline for a work center to switch between regular and rework jobs. A production cycle begins with loading and processing of several batches of regular jobs with a lot size equal to s. The outcome of each completed regular job is an independent Bernoulli trial with three possibilities: good, rework, or scrap. Once the work center accumulates more than a threshold ω of rework jobs, it finishes the last batch of regular jobs and switches to rework jobs. The objective of this research is to find a threshold ω and a lot size s that maximize the average long‐term profit. The ultimate goal is to construct a simple algorithm to search for ω and s that can be implemented directly in production management systems, as a result of this work. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 273–301, 1999     

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

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

略论希波萨拉米海战中宗教、政治因素

萨拉米海战是希波战争中的关键之役,希腊舰队之所以能以弱胜强,除了统帅将领在军事上深谋远虑的决策、公民战士为保卫城邦浴血奋战之爱国主义的献身精神以及有利的地理环境等因素外,还有宗教信仰和民主政治这两大因素对战争的结局起着举足轻重的作用。     

军队政治工作信息化建设宏观指导的两个问题

军队政治工作信息化建设,应着眼加强思想政治建设和军事斗争准备需要,立足于信息化条件下提高政治工作质量和效率,更好发挥服务保证作用和作战功能,努力构建信息化体系,实现军队政治工作信息资源数字化、信息传递网络化、信息处理智能化、作战指挥一体化、办公政务自动化、教育训练模拟化。实现军队政治工作信息化,要坚持以观念更新为先导,以需求为牵引、以人才为本、重点突破、整体推进等基本原则。     

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

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

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

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

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

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.