谈幼儿园的消防安全工作

幼儿园作为幼儿生活成长和接触社会的主要场所,其消防安全工作的好坏,直接关系到每个幼儿的健康成长,甚至关系到每个幼儿的生命安全,牵动着千家万户家长的心。因此,要加强幼儿园消防安全工作,提高幼儿园消防安全条件,切实保障幼儿的生命安全。阐述了幼儿园的消防安全现状及诱发火灾的主要原因,并从消防执法过程中遇到的问题出发,论述了要做好幼儿园的消防安全工作所要采取的措施。     

国际性大型活动消防安全保卫工作探析

在国际性大型活动中,消防安全环境通常十分复杂,消防安全保卫任务繁重,责任重大。结合奥运会主会场消防安全保卫工作经验,从火灾预防,构建网格化立体监督网络,制定方案、预案,强化实地实战演练,开展思想政治工作等方面,对如何做好国际性大型活动的消防安全保卫工作进行了分析和探讨。     

浅析老城区消防安全问题及对策

老城区建筑结构复杂,耐火等级低、火灾隐患多,消防安全工作更是任务重、难度大.为确保老城区的消防安全,针对老城区的特殊消防环境,火灾成因等若干问题进行了分析,提出了消除老城区火灾隐患,做好老城区消防工作的主要措施.     

加强城乡结合部消防管理工作的探讨

尽管全国火灾形势逐年呈下降趋势,但是城乡结合部的消防安全工作仍然不容乐观,因此加强和改进城乡结合部消防管理工作是公安消防部队必须面对和解决的问题.分析了城乡结合部的消防安全现状和影响城乡结合部消防安全的主要问题,探讨了改进城乡结合部消防安全工作的对策.     

玉树地震灾区恢复重建消防问题思考

做好玉树灾区重建过程中消防工作的意义重大,对重建中面临的消防问题进行分析,提出为保证灾区重建消防安全应注意以下问题：构建灾区防火监督网络、改善消防安全环境、确保消防专业规划的编制和实施、加强消防监督管理、做好灭火救援和抢险救灾准备、强化便民服务措施等。     

谈人口老龄化给消防工作带来的问题及对策

对老年人消防安全形势进行分析,结合两起老年人死亡的典型火灾案例,说明了老年人日常生活中火灾隐患的严峻形势,同时通过对我国社会老龄化趋势分析,阐明了必须大力加强老年人消防安全工作,并提出了加强老年人消防安全工作的建议。     

建筑工地消防安全监督检查探讨

针对建筑工地火灾隐患多,火灾事故频发,火灾损失重大的现状,从施工单位忽视消防安全工作的重要性、工作人员消防安全意识淡薄、消防监督执法不充分等几个方面分析建筑工地火灾事故多发的原因,提出了建筑工地消防安全工作对策。     

小型旅馆消防安全现状及管理对策探讨

近年来,各地小型旅馆发展迅速,但由于其小而散使消防安全监管难度增大,从业人员消防安全意识淡薄,自身消防安全隐患较多,极易发生群死群伤火灾事故.介绍了小型旅馆的特点,分析了小型旅馆存在的消防安全隐患及消防监督管理工作存在的问题,探讨了加强小型旅馆消防安全管理的措施.     

社区消防安全工作纵深发展探讨

通过对社区开展消防安全工作的探讨研究,提出加强社区消防安全工作的必要性,以及如何通过网络化管理、服务化管理加强对社区消防安全工作的管理,同时提出通过广泛开展社区消防宣传,依靠群众、发动群众,切实提高社区居民的消防安全意识,群防群治共同建设平安和谐的社区安全环境。     

对正确贯彻执行公安部61号令的思考

从<机关、团体、企业、事业单位消防安全管理规定>的重要性和必要性入手,提出强化单位对消防工作的自主管理应重点做好的几个方面的工作,并指出公安消防监督机构必须转变执法观念.     

Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach

This paper considers the two different flow shop scheduling problems that arise when, in a two machine problem, one machine is characterized by sequence dependent setup times. The objective is to determine a schedule that minimizes makespan. After establishing the optimally of permutation schedules for both of these problems, an efficient dynamic programming formulation is developed for each of them. Each of these formulations is shown to be comparable, from a computational standpoint, to the corresponding formulation of the traveling salesman problem. Then, the relative merits of the dynamic programming and branch and bound approaches to these two scheduling problems are discussed.     

浅议我国的生态旅游发展

本文阐述了生态旅游的内涵以及我国发展生态旅游的现状,提出了生态旅游发展中应注意的问题。     

The traveling salesman problem: An update of research

During the course of the last few years, attacks on the traveling salesman problem have resulted in a variety of often innovative and rather powerful computational procedures. In this article, we present a review of these results for problems defined on weighted and unweighted graphs. Some account of computational behavior for exact algorithms is provided; however, the primary coverage deals with the strategy of particular procedures. In addition, we include some aspects of nonexact algorithms with major interest confined to the establishment of worst-case bounds.     

Models and algorithms for shuffling problems in steel plants

In this article, we study item shuffling (IS) problems arising in the logistics system of steel production. An IS problem here is to optimize shuffling operations needed in retrieving a sequence of steel items from a warehouse served by a crane. There are two types of such problems, plate shuffling problems (PSP) and coil shuffling problems (CSP), considering the item shapes. The PSP is modeled as a container storage location assignment problem. For CSP, a novel linear integer programming model is formulated considering the practical stacking and shuffling features. Several valid inequalities are constructed to accelerate the solving of the models. Some properties of optimal solutions of PSP and CSP are also derived. Because of the strong NP‐hardness of the problems, we consider some special cases of them and propose polynomial time algorithms to obtain optimal solutions for these cases. A greedy heuristic is proposed to solve the general problems and its worst‐case performances on both PSP and CSP are analyzed. A tabu search (TS) method with a tabu list of variable length is proposed to further improve the heuristic solutions. Without considering the crane traveling distance, we then construct a rolling variable horizon heuristic for the problems. Numerical experiments show that the proposed heuristic algorithms and the TS method are effective. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

iSIGHT在多目标优化问题中的应用研究

在工程实际中,随着设计要求的日益提高,单一的设计目标已经不能满足设计者的要求。于是多目标设计优化问题在设计领域越来越占据主导地位。目前多目标优化设计方法种类繁多,各有优劣,重点介绍优化设计框架iSIGHT,并就iSIGHT在解决鱼雷壳体结构设计中的多目标优化设计问题中的应用情况进行研究,讨论iSIGHT在解决多目标优化问题中的可行性。     

The maximum collection problem with time-dependent rewards

We consider a routing problem where the objective is to maximize the sum of the rewards collected at the nodes visited. Node rewards are decreasing linear functions of time. Time is spent when traveling between pairs of nodes, and while visiting the nodes. We propose a penalty-based greedy (heuristic) algorithm and a branch-and-bound (optimal) algorithm for this problem. The heuristic is very effective in obtaining good solutions. We can solve problems with up to 20 nodes optimally on a microcomputer using the branch-and-bound algorithm. We report our computational experience with this problem. © 1996 John Wiley & Sons, Inc.     

我国东部沿海海上突出治安问题原因与对策

随着改革开放和经济建设的深入发展,我国东部沿海海上旅游、海上捕捞、养殖生产、贸易等经济活动日益扩大。这一方面带来了区域经济的大发展,另一方面也给海上治安和海洋管理带来了诸多新问题。为此,各相关部门应积极转变执法观念;建立高效、规范的海上防控体系;加强渔政建设,促进渔政管理体制的改革。从根本上预防和制止海上治安违法行为,维护上述海域的安全与稳定,促进该海域经济的可持续发展。     

Using decomposition in integer programming

When implicit enumeration algorithms are used for solving integer programs, a form of primal decomposition can be used to reduce the number of solutions which must be implicitly examined. If the problem has the proper structure, then under the proper decomposition a different enumeration tree can be defined for which the number of solutions which must be implicitly examined increases with a power of the number of variables rather then exponentially. The proper structure for this kind of decomposition is that the southwest and northeast corners of the constraint matrix be zero or equivalently that the matrix be decomposable except for linking columns. Many real traveling salesmen, plant location, production scheduling, and covering problems have this structure.     

二维运动目标纯方位系统的部分可观测性

针对二维空间作匀加速运动的目标,对等速直线运动的单观测站纯方位目标运动分析问题进行了讨论.此时系统是不完全可观测的.本文证明了目标部分运动参数是可估计的,即目标与观察者的相对航向Kr,相对速度与初距离之比Vr/D0,加速度与初距离之比a/D0是可以解算的,并对可估计参数的有解条件进行了分析.