阻燃剂的包覆研究

本文对溴系阻燃剂三（２,３－二溴丙基）异三聚氰酸酯（ＴＢＣ）进行了较深入的包覆研究,对包覆ＴＢＣ进行了热分析、电镜扫描和阻燃性能测试,并将包覆ＴＢＣ用于阻燃聚乙烯,在提高材料氧指数上优于未包覆者。     

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     

拉压异性材料具有圆孔的无限大薄板的极限分析

利用莫尔屈服准则,对拉压异性材料具有圆孔的无限大薄板进行了极限分析。计算结果表明,材料的拉压异性对结构的极限承载能力和弹塑性状态都有明显的影响。考虑了材料拉压异性的影响,分析结果更具一般性。     

国外火炮定位雷达的现状和发展趋势

主要描述了国外火炮定位雷达的研制现状,对美国研制的Firefinder系列雷达,俄罗斯研制的Zoopark-1雷达,英、法、德等国联合研制的COBRA雷达以及瑞典和挪威联合研制的AR THUR雷达等几种火炮定位雷达的特点、主要技术指标及市场销售情况做了简要的介绍,最后总结了国外火炮定位雷达的最新发展趋势。     

发电机并网测频方法综合比较

发电机并网发电时,应保证发电机与电网的频率相等。综合比较了发电机并 网时常用的几种数字式测频方法:直接测频法、测周法、多周期同步法、基于CROSS算法的 测频、三点拟合法、基于傅立叶变换的测频法、基于神经网络的测频法,对各种方法的测频误 差进行分析,比较其最佳适用范围,为实际应用提供了一定的指导。     

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     

CsLiB6O10晶体Ⅰ型光参量过程中角度调谐研究

根据三波耦合过程中的能量动量守恒,基于非线性晶体的相位匹配理论,利用CsLiB6O10(CLBO)晶体的Sellmeier方程,详细分析了Ⅰ型共线及非共线参变过程中CLBO晶体的角度调谐特性.这对于激光脉冲的激光参量过程的优化具有重要的意义.     

关于加强“4＋1”模式学员军事素质基础培养的研究

现代战争对军人的军事素质提出了更高的要求,而优良的军事素质,是靠平时严格、艰苦的训练来实现的.我院高度重视培养提高学员的军事素质,主要通过3个途径实现培养目标.这里重点阐述了我院对学员军事素质培养的实践经验及效果,对军事工程院校学员军事素质基础的提高,具有一定的指导作用和参考价值.     

谈公安边防部队缉毒情报侦查信息网络建设

当前和今后一个时期,国际、国内毒潮将持续冲击我国社会,禁毒斗争将是一场持久战。针对当前缉毒情报侦查网络建设中存在的主要问题,公安边防部队应从适应信息化条件下缉毒工作的需要出发,建好缉毒情报侦查信息网络,为边防缉毒工作提供有力的情报保障。     

Scheduling with centralized and decentralized batching policies in concurrent open shops

This article considers batch scheduling with centralized and decentralized decisions. The context of our study is concurrent open shop scheduling where the jobs are to be processed on a set of independent dedicated machines, which process designated operations of the jobs in batches. The batching policy across the machines can be centralized or decentralized. We study such scheduling problems with the objectives of minimizing the maximum lateness, weighted number of tardy jobs, and total weighted completion time, when the job sequence is determined in advance. We present polynomial time dynamic programming algorithms for some cases of these problems and pseudo‐polynomial time algorithms for some problems that are NP‐hard in the ordinary sense. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 17–27, 2011