消防法实施细则制定的必要性

《消防法》是消防工作的基本法律，完善的消防法律体系应当由消防法律、消防行政法规、地方消防法规、部门消防规章和地方消防规章组成。而目前我国的消防法律体系中却没有专门的消防行政法规。因此，制定《消防法实施细则》是完善消防立法体系、细化《消防法》、落实政府消防法律职责、拓展消防部队职能和借鉴其他法律的需要。     

论公安现役本科院校基础课程设置

公安现役本科院校的基础课程,是根据边、消、警部队人才基本素质全面发展的培养目标要求而设定的。它既要满足国民高等学历教育的需要,又要适应部队人才需要和发展的要求,有其明显的职业指向性。因此,公安现役本科院校的基础课设置必须把公安现役高等教育的职业化特色与普通高等教育规范化要求有机结合,形成具有公安现役教育特色的基础课程体系。     

对构建新闻专业实践教学体系的思考

加强新闻专业实践教学是提高新闻专业教学质量的重要手段。本文以加强新闻人才培养过程中理论与实践的结合为研究出发点，从新闻实践教学各环节的把握、教学质量监控体系的探索、相关教学制度的保障入手，构建科学的新闻专业实践教学体系，以期为新闻专业实践教学提供一条将理论知识运用于新闻实践的途径。     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

现代机载探测系统多源信息融合算法

针对机载探测系统的特性,应用Dempster-Shafer(D-S)证据理论和主观Bayes的组合算法,对来自机载SAR雷达、机载前视红外搜索跟踪系统(IRS)、电子支援系统(ESM)等探测系统多次观测所获得的数据,以及来自地面的电子情报(ELINT)的不同信息进行实时融合、识别,进而确定攻击对象.通过实例进行仿真证明,这种组合算法适用于不同类传感器和不同格式信息间的融合,适合于复杂信号环境.     

模糊逻辑系统在船舶风险评估中的应用

为了合理进行船舶风险评估,提出了一种基于模糊逻辑系统的船舶风险评估方法.根据模糊逻辑系统的基本原理,建立了船舶风险评估的模糊逻辑模型;按照国家标准、规范,并结合经验建立了风险指标的模糊集合、风险矩阵及模糊规则,然后进行了模糊推理,得到了系统的风险等级,并制定了预防风险的措施.以某艇消防系统的风险评估为例,证明了其能够合理地评估出系统的风险,可为决策提供参考.     

基于模糊事件的入侵检测模型

对模糊入侵事件进行了描述，分析了模糊入侵事件间的相似性，提出了基于模糊ECA规则的入侵检测知识表示方法，并阐述了模糊ECA规则的分析过程，以解决入侵行为的不确定性。     

A sequential scheduling problem with impatient jobs

There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λ_i before departing the system. The service time of customer i has distribution F_i, and on completion of service of customer i a positive reward r_i is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015