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

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

目标起伏特性对雷达威力性能的影响分析

介绍了典型雷达目标RCS起伏模型,阐述了起伏目标在实际中的应用,建立了目标损耗和雷达作用距离之间的关系,为不同目标的等效替代推算提供了理论依据.验证了雷达目标满足卡平方分布时发现概率和起伏因子之间的关系.并针对不同类型的起伏目标,建立了雷达探测距离和发现概率之间的关系,为雷达的威力检测和飞行目标的航线设计提供依据.     

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

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

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     

火灾微量物证的发现与提取方法研究

针对基层火灾调查人员在发现与提取火灾微量物证中存在的实际问题,从火灾微量物证的概念、特点和种类出发,归纳总结了火灾现场不同火灾微量物证的发现、提取与包装方法,给出了发现与提取火灾微量物证的基本要求和应注意的问题。     

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     

任职教育中案例教学方法探析——以《中国近现代史纲要》课程为例

案例教学法被逐步地引进任职教育的课堂,本文以《中国近现代史纲要》课程为例,探析了任职教育中案例教学法的应用。从教学目的、教学内容和教学对象三个方面分析了《中国近现代史纲要》课程运用案例教学的可行性。从《中国近现代史纲要》课程运用案例教学的意义可以看出,案例教学是作为该课程教学改革的最佳途径。运用案例教学时,在案例选取上兼顾真实性、针对性、时效性,在案例分析过程中注重教学主体和客体的双向交流,在案例总结时注重案例结论与讨论论点的区别。     

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

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

基于组合设计的软件可靠性测试方法

提出了将实验设计中的组合设计方法应用于软件可靠性测试。分析了组合设计方法在软件可靠性测试用例设计中应用的理论基础和基于组合设计的软件可靠性测试的一般方法。同时指出了利用软件操作剖面信息和失效数据进行可靠性评估的方法。     

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