复合固体推进剂等效力学性能VCFEM细观预示方法

根据固体推进剂的细观结构特征,采用等圆最优装载方式生成代表性体积单元(Representative Volume Element,RVE)模型,并结合Voronoi单元有限元方法(Voronoi Cell Finite Element Method,VCFEM)和均匀化方法,发展了一种可预示固体推进剂等效力学性能的数值分析方法,从而得到体分比和组分材料对等效模量和等效泊松比的影响规律。为证明该方法的有效性,设计一个对称数值模型,通过对该方法和传统有限元方法的节点位移结果的比较,发现两者之间的相对误差小于5%,且VCFEM用少量单元就完成了分析,提高了计算效率。通过对不同细观结构下推进剂RVE模型的计算,发现随着夹杂体分比的增大,夹杂的颗粒增强效应越明显,基体材料的变化比夹杂材料对等效力学性能有着更加显著的影响。     

军事安全视角下的军队翻译能力建设

军队翻译能力是军队外语能力的组成部分。军队翻译能力的理论框架包含构成要素、存在形式和转换机制三个组成部分。新的安全形势对我军的翻译保障在广度和深度上都有了新的要求,而军队翻译能力供给相对不足。需要对军队翻译能力进行规划,加强翻译人力资源的储备与管理,提升翻译保障信息化水平。     

基于全寿命周期的舰船喷水推进装置综合保障技术研究

针对舰船喷水推进装置的保障需求，介绍了喷水推进装置的基本组成、技术特点，引入环境特征，使用特征因素，研究喷水推进装置从交装到服役期满的全寿命服役周期的综合保障技术，提出针对喷水推进装置在不同状态、不同时期的保障策略，建立喷水推进装置保障能力体系。     

微分对策界栅理论在舰艇作战能力评估中的应用

作战能力是表征战斗舰艇战术技术性能的一项重要指标,如何正确评价舰艇的作战能力一直是军事运筹研究的热点.利用定性微分对策的界栅理论研究了一类作战问题,通过构造捕获区面积和咽喉区域面积,并以此作为动态评估舰艇作战能力的衡量指标.研究结果可为综合评价舰艇作战能力提供一条新途径.     

潜艇的承载力与水下动力抗沉

阐明了潜艇承载力图谱的一种新算法,分析了危险舵卡的基本挽回方法及其衡准,论述了当前水下动力抗沉的实用方法及评价指标.     

论强化消防部队管理执行力

安全事故频发,引发部队管理危机,究其原因是多方面的,但是,管理中的＂三弱化＂是主因。如何提升管理中的执行力,应从四个方面入手,即强化培训式管理、走动式管理、数字化管理、问责制管理。夯实执行根基,提升执行监管,量化执行标准,重施执行奖惩,确保消防部队管理执行力的提升,是减少安全事故,确保部队高度安全稳定的根本途径。     

既有锈蚀RC梁剩余抗剪承载力试验

为了准确评估锈蚀RC梁的剩余抗剪承载力,在对6根既有纵筋、箍筋锈蚀都比较严重的混凝土抗弯构件进行了剩余抗剪承力试验研究的基础上,提出了锈蚀RC梁的剩余抗剪承载力计算公式.结果表明,既有锈蚀RC梁挠度曲线没有明显的开裂拐点;破坏时脆性明显,裂缝集中在某一处,间距较大,破坏荷载和屈服荷载接近,受剪破坏形态可能表现为加载点下垂直裂缝引起的破坏.所提出的既有锈蚀RC梁剩余抗剪承载力计算公式与试验结果吻合较好,可为锈蚀RC梁剩余抗剪承载力评估提供一定参考.     

辐射传热时活塞式气缸中加热气体的最大膨胀功

对热辐射传热定律q∝Δ(T4)下,给定初态内能、体积,末态体积以及过程时间时,加热气体膨胀的最优构型进行了研究,利用最优控制理论得出最大膨胀功输出时膨胀的最优构型由两个瞬时绝热分支和一个E-L分支组成的结论.给出了各分支之间转换点参数的求解方法及最优构型的数值算例,最后将线性唯象传热定律、牛顿传热定律、平方传热定律、立方传热定律和辐射传热定律下加热气体膨胀的最优构型进行了比较.结果显示,随着传热指数的增加,理想气体的内能呈现出明显的整体增加趋势,而体积则呈现出明显的整体减小趋势.     

Dynamic capacity reservation and due date quoting in a make‐to‐order system

We consider a make‐to‐order manufacturer facing random demand from two classes of customers. We develop an integrated model for reserving capacity in anticipation of future order arrivals from high priority customers and setting due dates for incoming orders. Our research exhibits two distinct features: (1) we explicitly model the manufacturer's uncertainty about the customers' due date preferences for future orders; and (2) we utilize a service level measure for reserving capacity rather than estimating short and long term implications of due date quoting with a penalty cost function. We identify an interesting effect (“t‐pooling”) that arises when the (partial) knowledge of customer due date preferences is utilized in making capacity reservation and order allocation decisions. We characterize the relationship between the customer due date preferences and the required reservation quantities and show that not considering the t‐pooling effect (as done in traditional capacity and inventory rationing literature) leads to excessive capacity reservations. Numerical analyses are conducted to investigate the behavior and performance of our capacity reservation and due date quoting approach in a dynamic setting with multiple planning horizons and roll‐overs. One interesting and seemingly counterintuitive finding of our analyses is that under certain conditions reserving capacity for high priority customers not only improves high priority fulfillment, but also increases the overall system fill rate. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008