成功移交放火嫌疑案件应注意的几个问题

公安机关消防机构向刑侦部门移交放火嫌疑案件是个难题,结合法规规定和工作实践,指出为提高案件移交率应在第一时间把握放火嫌疑特征、第一时间通知刑侦部门参与、规范协作办案中的关键环节、善于运用法规规定和自身积累的办案经验等方面应注意的问题,提出了共同询问、共同勘验、共同提取和送检物证等见解。     

Multiple subset sum with inclusive assignment set restrictions

In a traditional multiple subset sum problem (MSSP), there is a given set of items and a given set of bins (or knapsacks) with identical capacities. The objective is to select a subset of the items and pack them into the bins such that the total weight of the selected items is maximized. However, in many applications of the MSSP, the bins have assignment restrictions. In this article, we study the subset sum problem with inclusive assignment set restrictions, in which the assignment set of one item (i.e., the set of bins that the item may be assigned to) must be either a subset or a superset of the assignment set of another item. We develop an efficient 0.6492‐approximation algorithm and test its effectiveness via computational experiments. We also develop a polynomial time approximation scheme for this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

扎实推进任职教育中的案例教学

案例教学是一种适应任职教育需要的实践性教学方式,能够培养学员问题意识、激发学员认知潜能、促进学员能力生成。扎实推进案例教学,要求教员掌握组织实施案例教学的程序方法,要求院校更新教学理念、提高教员水平、建设高质量案例库。     

基于遗传算法的嵌入式软件测试用例生成系统研究

综合考虑了嵌入式软件的特点,将遗传算法应用于搜索全面覆盖软件特殊路径的测试用例生成的问题,合理构建了嵌入式软件测试用例自动生成系统,给出了系统流程图,改进了部分算子,使搜索效果得以加强,并分析了交叉率、变异率等参数的取值范围,通过改变不同的参数值得到对比图,以确定适合该系统的最佳参数值,并针对实际汇编语言编写的嵌入式软件指定路径进行仿真测试,从理论和实践上证明了该思路的正确性和可行性。     

On‐line algorithms for minimizing makespan on batch processing machines

We consider problem of scheduling jobs on‐line on batch processing machines with dynamic job arrivals to minimize makespan. A batch machine can handle up to B jobs simultaneously. The jobs that are processed together from a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is given by the longest processing time of any job in the batch. Each job becomes available at its arrival time, which is unknown in advance, and its processing time becomes known upon its arrival. In the first part of this paper, we address the single batch processing machine scheduling problem. First we deal with two variants: the unbounded model where B is sufficiently large and the bounded model where jobs have two distinct arrival times. For both variants, we provide on‐line algorithms with worst‐case ratio (the inverse of the Golden ratio) and prove that these results are the best possible. Furthermore, we generalize our algorithms to the general case and show a worst‐case ratio of 2. We then consider the unbounded case for parallel batch processing machine scheduling. Lower bound are given, and two on‐line algorithms are presented. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 241–258, 2001     

行政法治下的火灾调查工作——也谈火灾事故责任认定的行政可诉性

火灾事故责任认定是否可诉的问题一直是行政司法实践争论的焦点之一。本文认为是否为具体行政行为不应成为火灾事故责任认定行为可诉与否的概括性标准 ,火灾事故责任认定仍应纳入行政诉讼的监督之下。     

新冠肺炎动态病死率分析与疫情预测方法研究【专题】

新型冠状病毒感染的肺炎防控是国家安全体系的重要“战场”,疫情趋势预测是开展疫情科学防控和精准防控的重要基础。本文阐述了疫情动态病死率概念,分析了疫情动态病死率函数和时间曲线,提出了动态病死率发展的3个重要拐点,从动态病死率和新增确诊病人数两个维度,构建了拟合曲线函数,并对疫情发展趋势进行了预测。研究发现,截至2月10日,本次疫情动态病死率已经经过了第3个拐点,趋于稳定;预计到2月16日左右,新增确诊人数达到第3个拐点,进入缓慢下降期;预计2月底底至3月初,每日新增确诊人数将在1000人以内,全国最终的“病死率”将在2%～4%左右。该预测方法是一种运用系统外部特征信息来研判疫情发展规律的较为简便快捷的方法,对于科学预测疫情发展趋势具有一定的参考借鉴价值。     

语义对等网中资源元数据混合索引策略研究

面向对等网络信息资源语义共享问题,首先提出了一种基于多本体的资源元数据描述框架,将资源元数据分为核心和扩展两部分,在此基础上重点对资源元数据索引策略进行了研究,提出了一种混合索引机制,针对资源核心元数据采用一种社区策略来进行组织索引,针对扩展元数据采取DHT和语义关联相结合的方式进行组织索引,其中结合了本地索引和全局索引的特点,并在此基础上对资源发现流程和负载均衡方法进行了设计。与现有相关系统相比,本索引体系有效地提高了对等网络环境下资源定位的效率和系统的可扩展能力。     

固体火箭发动机复合材料壳体裙黏接性能分析

采用数值计算方法研究复合材料壳体裙连接结构的黏接性能。通过建立纤维缠绕壳体的有限元模型,采用内聚力模型定义裙黏接面的接触关系,引入黏接界面的损伤失效准则,模拟黏接界面的脱黏行为,以此预测裙连接结构的极限承载。同时,研究壳体的轴向和环向应变及黏接面上的剪应力分布情况,以及弹性层的弹性模量与黏接长度对黏接性能的影响。数值算例表明,计算结果与实验数据相吻合,验证了该方法的正确性。所提方法可用于裙连接结构的优化设计中。