弹性支座阶梯形连续梁弯曲计算的普遍方程

本文借助奇异函数,用阶梯函数表示阶梯形梁的抗弯刚度的倒数,在考虑支座沉陷影响的情况下,推导出了阶梯形连续梁在弹性支座支承下的弯曲计算普遍方程,给出了支座反力计算的矩阵方程。     

空域窗射击毁歼概率解析计算模型

为提高未来空域窗射击技术对空中机动目标的毁伤概率,需要根据目标机动幅度对未来空域窗的大小进行动态设定,故提出“自适应射击窗”的概念.空域窗大小设定的依据是使毁歼概率最优.可以采用解析法来在线计算该毁歼概率值.在分析空域窗射击误差的基础上,演绎了均匀分布法与高斯和法两种毁歼概率解析计算方法的公式.以毁歼概率蒙特卡罗法仿真数据为基准值,对两种解析法的计算精度进行了对比分析.仿真结果表明,高斯和法的计算精度显著优于均匀分布法,且满足实时计算要求,适于在线评估空域窗的射击效能.     

连续不间断高层建筑快速逃生装置的设计与应用研究

高层建筑数量增多的同时,其人员安全疏散问题日益凸显,研究高层建筑受困人员火灾情况下的自救逃生和连续疏散非常重要。结合国内外高层建筑逃生装置研究现状和存在的主要问题,研究设计了连续不间断高层建筑快速逃生装置的结构,分析了其结构设计特点,并与传统救援设备进行了性能对比分析。针对国内高层建筑火灾形势,探讨了该装置在高层建筑受困人员快速、多人连续逃生方面的优势和应用前景。     

不卸载时侧贴碳纤维布加固连续梁试验研究

为研究不同初始荷载作用下侧贴碳纤维布加固连续梁的受力与变形特性,以及初始荷载对加固效果的影响,对4根钢筋混凝土两跨连续梁（其中1根为未加固连续梁,其余3根为在不同初始荷载下侧贴碳纤维布加固连续梁）进行了试验研究。结果表明：侧贴碳纤维布加固连续梁不仅能提高加固梁的承载力,提高幅度达16%以上;还能提高加固梁的刚度,减少其挠度和裂缝宽度;加固效果受初始荷载影响,初始荷载越小,加固效果越好。     

《连续系统建模》的计算机辅助学习与考核系统

本文介绍了一个用于《连续系统建模》学习与考核的计算机辅助教学课件的功能和设计原理,重点介绍了系统动力学模型图的知识表达和建模行为的有效性度量的方法。     

反函数的导数定理的一个注记

给出反函数的导数定理的改进形式:若f(x),x∈(a,b)与φ(y),y(A,B)互为反函数,x0∈(a,b),y0=f(x0),φ(y)在点y0处可导且φ′(y)≠0,f(x)在点x0处连续,则f(x)在点x0处可导,且f′(x0)=1/φ′(y0).并说明,f(x)在点x0处连续这一条件不可去掉。     

Production‐inventory systems with imperfect advance demand information and updating

We consider a supplier with finite production capacity and stochastic production times. Customers provide advance demand information (ADI) to the supplier by announcing orders ahead of their due dates. However, this information is not perfect, and customers may request an order be fulfilled prior to or later than the expected due date. Customers update the status of their orders, but the time between consecutive updates is random. We formulate the production‐control problem as a continuous‐time Markov decision process and prove there is an optimal state‐dependent base‐stock policy, where the base‐stock levels depend upon the numbers of orders at various stages of update. In addition, we derive results on the sensitivity of the state‐dependent base‐stock levels to the number of orders in each stage of update. In a numerical study, we examine the benefit of ADI, and find that it is most valuable to the supplier when the time between updates is moderate. We also consider the impact of holding and backorder costs, numbers of updates, and the fraction of customers that provide ADI. In addition, we find that while ADI is always beneficial to the supplier, this may not be the case for the customers who provide the ADI. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Inventory control in divergent supply chains with time‐based dispatching and shipment consolidation

This article analyses a divergent supply chain consisting of a central warehouse and N nonidentical retailers. The focus is on joint evaluation of inventory replenishment and shipment consolidation effects. A time‐based dispatching and shipment consolidation policy is used at the warehouse in conjunction with real‐time point‐of‐sale data and centralized inventory information. This represents a common situation, for example, in various types of vendor managed inventory systems. The main contribution is the derivation of an exact recursive procedure for determining the expected inventory holding and backorder costs for the system, under the assumption of Poisson demand. Two heuristics for determining near optimal shipment intervals are also presented. The results are applicable both for single‐item and multiitem systems. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 59–71, 2011     

A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production

This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011