自动喷水灭火系统湿式报警阀设置问题探讨

湿式报警阀是自动喷水灭火系统的重要组成部分。针对湿式报警阀的设置问题,重点探讨了自动喷水灭火系统是否都要设置湿式报警阀;湿式报警阀集中设置还是分散设置;湿式报警阀是底层设置还是楼层设置;湿式报警阀后所带喷头数目等几个问题,以真正发挥湿式报警阀的作用和自动喷水灭火系统的灭火效能。     

关于民用建筑中湿式喷水灭火系统设置与管理的探讨

随着建筑业的快速发展及消防法规的逐步完善,自动喷水灭火系统也得到了广泛的应用.但在实际配置使用过程中,各级消防监督管理部门也发现了一些新的问题,为充分发挥自动喷水灭火系统的功效,保护人民生命财产安全,就民用建筑中湿式自动喷水灭火系统设置与管理提出了一些建议.     

建筑设计消防审核常见技术问题探析

针对建筑设计消防审核工作中容易出现的技术问题,从消防车道与建筑中人行通道的设置、自动喷水灭火系统末端试水装置与试水阀的设置、特殊场所快速响应喷头的选用、标准喷头的设置、自动喷水灭火系统集热板的应用、室内消火栓系统阀门的设置以及防火卷帘两侧火灾探测器组与警报装置的设置等方面解读了相关消防技术规范的规定,系统分析了建筑设计消防审核中的常见错误与问题,提出了有关技术规范规定的合理解释和使用建议。     

自动喷水灭火系统成本效益分析

自动喷水灭火系统在我国一直存在质量不高、管理不当的现象，严重威胁人们的生命财产安全。产生这种现象的一个重要原因就在于投资者和业主不了解自动喷水灭火系统所能产生的经济效益，从而对设置该系统不够重视，甚至持反对的态度。针对这种情况，提出了一种定量评估设置自动喷水灭火系统的成本和效益的模型及具体计算方法，并结合工程实例验证了该模型的可行性。     

论多层商住楼室内消防给水系统的设置

结合基层实际情况,对多层商住楼室内消防给水系统设置从其现状、弊端出发,探讨多层商住楼中设置干式消防竖管和不带消火栓箱的DN65的室内消火栓及简易自动喷水灭火系统(即局部应用系统)的必要性和可行性,有较强的现实指导意义。     

自动喷水灭火系统水源设施检验应注意的问题

自动喷水灭火系统投入运行后,系统的可靠性则依赖于运行管理,运行管理质量的好坏,决定了自动喷水灭火系统在规定的条件下和规定的时间内完成设计赋予的规定功能的能力。介绍了自动喷水灭火系统水源设施,即消防水池、消防水箱和水泵接合器日常的检验维护,为保证自动喷水灭火系统的正常运行提供了简便可行的方法。     

自动消防系统在大型物流仓库中的应用

在分析物流仓库结构和功能的基础上,总结了物流仓库的火灾特点。通过对不同自动灭火系统的分析,认为自动喷水灭火系统是最适宜保护物流仓库的固定灭火系统。根据三种类型的自动喷水灭火系统的特点,讨论了湿式系统、ESFR系统和预作用系统的选用条件,阐述了系统进行设计时应注意的问题,最后列举出自动喷水灭火系统的应用实例。     

局部自动喷水灭火系统的现状及发展方向

局部自动喷水灭火系统的出现,是总结了十几年来自动喷水灭火系统技术发展和工程设计积累的宝贵经验的成果,也切合了当前经济和社会协调发展的需求.针对局部自动喷水灭火系统在应用过程中出现的问题,指明该系统的改进对策和发展方向.     

简易自动喷水灭火系统常见问题探讨

根据国家现行规范及技术标准,对简易自动喷水灭火系统的特点以及适用性进行了讨论,对系统中的过滤器、报警阀、水箱等在设计和施工中容易出现的问题进行了分析,并结合工程实践提出了相应的纠正措施。     

大空间建筑消防设计探讨

大空间建筑消防设计过程中，需要根据不同的外界条件以及消防系统特点来选择灭火系统。结合部分工程设计，分析对比了不同类型消防灭火设施的特点，并总结了其性能化设计中消火栓系统、自动喷水灭火系统、消防水炮系统应注意的问题，同时简要说明了消防用水量的计算方法。     

大系统递阶协调的自校正控制方法

本文基于大系统理论和递阶离散系统辨识方法的思想,提出了大系统递阶协调自校正控制算法,并用仿真实例验证了算法的可行性。     

一类不匹配不确定非线性系统鲁棒变结构控制

针对一类具有不匹配非参数化不确定性的非线性系统 ,设计出一种鲁棒变结构控制器。该控制器能够保证当时间 t趋于无穷时 ,闭环控制系统的输出跟踪误差趋于零。仿真实例说明了该控制器具有满意的控制效果     

基于任意分布随机Petri网的装备维修保障建模与分析

通过将任意分布随机Petri网的基本理论和算法应用到装备维修保障的建模与分析,建立了维修保障系统的任意随机Petri网模型,实现了随机Petri网中变换概率服从指数分布的限制.根据实际系统中相关数据的统计分析和经验估计,以便为利用矩姆函数分析方法对维修保障系统的性能进行分析,为维修保障决策层提供参考,获得了一些有价值的性能指标信息.     

基于逆传系统法的动态载荷识别研究

在载荷识别研究中,时域内载荷识别在其逆传系统载荷识别的研究,目前一般停留在最小相位可逆系统上,基于时间序列模型的逆传系统法系统动态载荷识别理论,提出了一种新的研究方法,克服了传统载荷识别方法对结构的边界条件仅仅局限于可逆系统,并利用计算机仿真验证了该方法不但适用于可逆系统,而且对不可逆系统的载荷识别同样有效.     

Two novel critical shock models based on Markov renewal processes

In this paper, we investigate systems subject to random shocks that are classified into critical and noncritical categories, and develop two novel critical shock models. Classical extreme shock models and run shock models are special cases of our developed models. The system fails when the total number of critical shocks reaches a predetermined threshold, or when the system stays in an environment that induces critical shocks for a preset threshold time, corresponding to failure mechanisms of the developed two critical shock models respectively. Markov renewal processes are employed to capture the magnitude and interarrival time dependency of environment-induced shocks. Explicit formulas for systems under the two critical shock models are derived, including the reliability function, the mean time to failure and so on. Furthermore, the two critical shock models are extended to the random threshold case and the integrated case where formulas of the reliability indexes of the systems are provided. Finally, a case study of a lithium-ion battery system is conducted to illustrate the proposed models and the obtained results.     

Bounds on parallel-processing of queues with multiple-phase jobs

Currently, both the hardware and software designs of many large computing systems aim at improved system performance through exploitation of parallelism in multiprocessor systems. In studying these systems, mathematical modelling and analysis constitute an important step towards providing design tools that can be used in building such systems. With this view the present paper describes a queueing model of a multiprocessor system operating in a job-shop environment in which arriving jobs consist of a random number of segments (sub-jobs). Two service disciplines are considered: one assumes that the sub-jobs of a given job are capable of parallel operation on different processors while the other assumes that the same sub-jobs must be operated in a strictly serial sequ'snce. The results (in particular, the mean number in the system and waiting time in queue) obtained for these two disciplines are shown to be bounds for more general job structures.     

On the equivalence of three approximate continuous review inventory models

This paper considers the problem of computing reorder points and order quantities for continuous review inventory systems subject to either a service level constraint or a constraint on the average fraction of time out of stock. It is demonstrated that three apparently distinct models are equivalent under these circumstances. Using this equivalence, streamlined algorithms for computed lot sizes and recorder points are developed.     

非线性耦合反应扩散系统解的存在性与脉冲同步

研究了耦合反应扩散系统整体解的存在性,并对其进行了证明。在此基础上,进一步加入脉冲条件,首次提出该系统脉冲同步的稳定性准则,得出脉冲误差系统是全局拟吸引的结论。     

Use of discounted force arrivals in static force comparisons

In traditional static comparisons of two opposing forces, weapons systems on each side are added together after weighting them according to a weapon scoring system. The scoring system does not reflect the availability times of the weapon systems in a perceived conflict. In this paper it is suggested how availability times can be incorporated by introducing the net present value of force arrival patterns. The concept is extended to include the case where uncertainty concerning warning time is reflected through a probability distribution for the time of outbreak of hostilities.     

A comparison of waiting time approximations in series queueing systems

The determination of steady-state characteristics in systems of tandem queues has been left to computer simulation because of the lack of exact solutions in all but the simplest newtorks. In this paper, several methods developed for approximating the average waiting time in single-server queues are extended to systems of queues in series. Three methods, due to Fraker, Page, and Marchal, are compared along with results gathered through GPSS simulation. Various queueing networks with Erlangian service distributions are investigated.