Thermodynamics and performance of Al/CuO nanothermite with different storage time

The storage stability of energetic materials is important for its application. Here, the storage stability of Al/CuO nanothermite, which was prepared by electrospray method and stored with different storage time, was systematically researched. The activation energy of Al/CuO nanothermite was calculated by differential scanning calorimetry (DSC). The ignition temperature and the curve pressure history of Al/CuO nanothermite was measured using ignition temperature measuring device and constant-volume pressurization tests, respectively. Further, the thermites were characterized by X-ray Diffractometer (XRD), X-ray photoelectron spectroscopy (XPS), scanning electron microscope (SEM) and Transmission electron microscopy (TEM). The results show that the morphology of the thermites did not change significantly. The activation energy was decreased from 254.1 kJ/mol to 181.8 kJ/mol after storage for 13 months. When stored for 0, 7 and 13 months, the peak pressures of Al/CuO nanothermite were 685.8 kPa, 626.3 kPa and 625.5 kPa, respectively. In addition to the ignition temperature, it was 775 ℃, 739 ℃ and 754 ℃, respectively. This result indicated that the ignition and combustion properties of Al/CuO nano-thermite are obviously reduced when stored for a long time, at room temperature.     

铺层方式对碳/环氧管层间剪应力影响的有限元分析

利用有限元程序ANSYS7.0对软模膨胀成型制备的碳/环氧管件在轴向载荷下的层间剪应力进行了分析。表明铺层的不对称性会显著导致环向层间剪应力增大,增幅在0.43～1.14倍,但对轴向层间剪应力影响很小;碳/环氧管的轴向铺层和环向铺层的比例对轴向层间剪应力和环向层间剪应力有显著影响,其比例在7∶3～4∶1时可以有效降低碳/环氧管的层间应力。     

A generalization of the weighted set covering problem

We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

PIP工艺制备的C/SiC复合材料的氧化行为

PIP工艺制备的C/SiC复合材料中SiC基体富碳,因此增强体和基体均容易氧化。碳纤维和无涂层保护C/SiC复合材料试样在400~1300℃的氧化速率随温度升高而加快,低温为反应控制,高温为扩散控制。CVD-SiC涂层保护C/SiC复合材料和由CVD-SiC层、自愈合层、CVD-SiC层三层涂层保护C/SiC复合材料在400~1300℃的氧化先随温度升高而加快,然后减慢。三层涂层在800~1300℃有非常好的保护效果。扫描电镜照片显示自愈合层的玻璃态物质进入涂层裂纹中,填充裂纹且阻挡氧的通过,从而有良好的抗氧化保护效果。     

一种具有优先级的MAC协议性能分析

在移动通信中,为了满足高动态终端对接入的高要求,设计了一种带有优先级的随机预约/按需分配相结合的MAC协议RRDAMA-P(random reserve/demand assignment multiple access protocol with priority),并利用Opnet软件进行了建模仿真,仿真结果表明,RRDAMA-P协议不仅可以满足终端的优先级要求,而且实现了更好的吞吐量和时延性能。     

Production/distribution system design with inventory considerations

This study addresses the design of a three‐stage production/distribution system where the first stage includes the set of established retailers and the second and third stages include the sets of potential distribution centers (DCs) and potential capacitated suppliers, respectively. In this problem, in addition to the fixed location/operating costs associated with locating DCs and suppliers, we consider the coordinated inventory replenishment decisions at the located DCs and retailers along with the appropriate inventory costs explicitly. In particular, we account for the replenishment and holding costs at the retailers and selected DCs, and the fixed plus distance‐based transportation costs between the selected plants and their assigned DCs, and between the selected DCs and their respective retailers, explicitly. The resulting formulation is a challenging mixed‐integer nonlinear programming model for which we propose efficient heuristic solution approaches. Our computational results demonstrate the performance of the heuristic approaches as well as the value of integrated decision‐making by verifying that significant cost savings are realizable when the inventory decisions and costs are incorporated in the production distribution system design. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 172–195, 2012     

栅格数据处理中邻域型算法的并行优化方法

随着并行计算的成熟,众多数据密集型的栅格处理算法亟需利用并行计算来缩减执行时间.针对其中一类邻域型算法,构建了用于估计是时间代价的串行/并行时域模型,分析了各个组成的代价影响因素,提出了降低数据I/O代价的并行I/O方法和降低数据通信代价的光圈预测方法.实验证明,所提的两个优化方法可以使邻域型栅格处理算法的并行程序更加充分地利用并行计算资源,进而在一般并行化的基础上进一步提升其并行性能.     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

聚钛碳硅烷的新合成法及其研究

从聚硅烷(PS)与钛酸丁酯。(Ti(OBu)_4)出发,不采用任何反应促进剂直接合成了含钛碳化硅纤维的先驱体聚钛碳硅烷(PTC)。在这一反应中,PS 首先裂解成含Si—C 骨架与Si—H 键的低分子聚硅烷(LPS)。然后,由LPS 中的Si—H 键与Ti(OBu)_4的反应以及LPS 的Si—Si 骨架裂解转化为Si—C 骨架的反应制得了PTC.本文对这种新合成法所涉及的反应过程进行了研究,并比较了新旧两法得到的PTC—1与PTC—Ⅱ的结构异同,报告了以新法制得的PTC—Ⅱ为先驱体得到的含钛碳化硅纤维的优良性能。     

有人/无人平台协同技术与行动模式研究

无人平台已广泛用于军用和民用市场,并在反恐、维稳、排爆,侦察等领域发挥了极其重要的作用。目前已形成了有人/无人平台共同协作完成任务的工作模式,大大地提高了工作的时效性、适应性、作战效能等。为了提高有人/无人平台的协同作战能力,本文研究有人/无人平台的协同作战技术体系以及作战模式,以解决在协同侦察、搜救、监视等应急任务中遇到的各种问题。此外,提出了一套完整的协同作战想定,可用于有效验证相关的协同技术。