Arrival and departure state distributions in the general bulk‐service queue

In this paper, we give an explicit relation between steady‐state probability distributions of the buffer occupancy at customer entrance and departure epochs, for the classical single‐server system G/G^[N]/1 with batch services and for the finite capacity case. The method relies on level‐crossing arguments. For the particular case of Poisson input, we also express the loss probability in terms of state probabilities at departure epochs, yielding probabilities observed by arriving customers. This work provides the “bulk queue” version of a result established by Burke, who stated the equality between probabilities at arrival and departure epochs for systems with “unit jumps.” © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 107–118, 1999     

抗滑短桩越顶问题的有限元验证

抗滑短桩是介于抗滑键与全长桩的一种特殊的抗滑桩,由于其较全长桩经济,已在实际工程中应用。云阳县太公沱至余家包库岸大咀段库岸因其下滑推力大、滑面埋深深,采用常规的抗滑桩极其不合理,通过方案比选此滑坡采用长12m的抗滑短桩进行支护。运用有限元强度折减法对设置抗滑短桩后,对滑面是否越过桩顶进行了验证。经计算设置抗滑短桩后滑坡稳定系数为1．25,说明滑坡采用抗滑短桩支护是可行的。     

A computationally efficient approach for determining inventory levels in a capacitated multiechelon production‐distribution system

The system under study is a single item, two‐echelon production‐inventory system consisting of a capacitated production facility, a central warehouse, and M regional distribution centers that satisfy stochastic demand. Our objective is to determine a system base‐stock level which minimizes the long run average system cost per period. Central to the approach are (1) an inventory allocation model and associated convex cost function designed to allocate a given amount of system inventory across locations, and (2) a characterization of the amount of available system inventory using the inventory shortfall random variable. An exact model must consider the possibility that inventories may be imbalanced in a given period. By assuming inventory imbalances cannot occur, we develop an approximation model from which we obtain a lower bound on the per period expected cost. Through an extensive simulation study, we analyze the quality of our approximation, which on average performed within 0.50% of the lower bound. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 377–398, 2000     

ASLR机制脆弱性自动分析方法

地址随机化是一种针对控制流劫持漏洞的防御机制。已有的漏洞自动分析与利用技术缺少对地址随机化机制影响的分析,导致生成的测试用例在实际环境中的运行效果受到极大限制。针对地址随机化的缺陷及其绕过技术的特点,提出了一种地址随机化脆弱性分析方法。该方法使用有限状态机描述程序运行路径中各关键节点的状态;针对常见的内存泄漏与控制流劫持场景建立约束条件;通过求解内存泄漏状态约束与控制流劫持状态约束的兼容性,分析地址随机化机制在特定场景下的脆弱性。实验结果表明,该方法可有效检测通过内存泄漏导致的地址随机化绕过及控制流劫持攻击,实现自动化的地址随机化脆弱性分析,提高针对软件安全性分析的效率。     

箭(弹)级间螺栓法兰连接结构冲击失效实验与数值仿真

基于火箭(导弹)级间螺栓法兰连接结构,简化设计并制作了一组原理性实验件,利用ABAQUS软件建立有限元模型,设计并进行了多次落锤冲击失效实验,其中包括轴向和横向两种工况,考虑了螺栓均布与非均布、螺栓直径和螺栓-栓孔间隙等不同结构特点。实验过程中采集了螺栓力时程响应数据、柱段关键点应变时程响应数据、锤头冲击力和冲击速度及连接界面开缝位移等多组数据。根据实验效果和实测数据,分析了连接结构冲击失效机理,并对比验证发现有限元模型数值模拟效果和精度与实验结果吻合较好。研究结论可为箭(弹)级间连接结构抗冲击设计提供参考。     

两种捆绑火箭弹性振动建模方法对比分析及其对姿控系统的影响

针对长助推和短助推两种类型捆绑火箭的不同模态特点,分析了两者弹性振动建模方法的区别和联系,在此基础上建立了某型固体捆绑火箭姿态动力学新模型,模型中基于有限元法导出了弹性振动方程,基于该模型对箭体复杂弹性振动引起的通道间耦合进行了研究,采用逆Nyquist阵列法进行设计。结果表明,该模型能更准确地反映捆绑火箭纵、横、扭耦合运动特性;新模型三通道之间存在弹性耦合,但耦合矩阵具有对角优势性质,采用逆Nyquist阵列法进行姿控系统设计是有效的,仿真结果表明设计的控制器可行,能够取得比较好的性能。     

计算机辅助加工工件变形分析方法研究

为迅速、准确、合理地确定切削加工的工艺参数 ,将有限元方法、人工神经网络和遗传算法运用于计算机辅助加工工件变形分析中。通过合理的系统设计 ,实现了对工件切削加工变形量的准确预报和对加工参数的正确优化。实际生产证明 ,采用本方法优化确定加工参数 ,达到了预期的迅速、准确、合理的目标 ,有效地降低生产成本 ,提高生产率     

利用MSC/DYTRAN程序仿真分析导弹战斗部立方体破片的侵彻威力

对反辐射导弹的破片杀伤战斗部中较为常见的立方体破片的 3种典型姿态侵彻 (尖端、棱边及正面侵彻 ) 4mm厚 94 5钢的侵彻过程进行仿真数值计算 .通过仿真计算 ,结合实验结果比较 ,得出结论 :不同初始侵彻姿态的立方体破片在侵彻过程中 ,由于旋转角速度的作用及稳定性的要求 ,破片的侵彻姿态将趋于正面侵彻 .不同姿态的侵彻 ,侵彻威力相差不大     

计算破损船舶稳性的表面元法

采用表面元法计算船舶的稳性 .这种方法是把船舶的表面分解成许多小的表面单元 ,然后计算在某一倾角下每个小单元所承受的静压力 ,对静压力进行积分就可得到浮力的大小、方向和作用线 ,从而算出某倾角下的回复力矩 .对实船的稳性计算结果表明 ,无论是破损船 ,还是未破损船 ,这种方法都适用     

Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N

Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003.