大学生体像与认知偏差、期望偏差的关系

[目的]了解大学生体像与认知偏差、期望偏差的关系,为大学生心理健康教育提供依据.[方法]采用《体像烦恼问卷》和《体像量表》对石河子大学300名大一至大四的学生进行了调查.[结果]体像烦恼在性别、年级、专业上差异显著(P＜0.01);33％的大学生体重指数异常,其中偏瘦人群79.07％为女性;大学生的期望偏差在性别上差异显著(t=-5.37,P＜0.01).[结论]大学生体像烦恼现象较为普遍,对自己的形体存在认知偏差和期望偏差.     

乡村教师培训策略探析——以“送教下乡”为例

乡村教师的培训,一方面,根据教育部“诊断示范、研课磨课、成果展示、总结提升”的指导思想,在深度调研的基础上,结合受训教师实际,通过创新培训内容和形式,进行行之有效的培训,切实提升乡村教师课堂教学能力;另一方面,基于培训,加强基层培训团队的组建,加强教师培训与乡村学校校本教研的整合;最后,重视教师培训的可持续发展,基于培训习得的经验和模式,促进乡村教师自主和基于同伴互助的专业成长和发展.     

军事管理革命的源流和历史经验

世界新军事变革不仅是一场军事技术和军队组织体制的革命,也是一场军事管理的革命.在人类历史上,伴随着军事变革的兴起与发展,发生过多次军事管理革命,使世界各国的军事管理体系发生了根本性的变革.从中我们可以总结出很多有益的经验教训,对顺利推进当前我国面临的军事管理革命,具有重要的借鉴和启发作用.     

系统能力集成与开发的SCFP模型

基于能力的装备系统规划使装备系统的发展更好地适应未来战争.阐明了系统能力集成与开发的相关概念;在提出系统能力-功能-性能(SCFP)模型的基础上,研究了基于SCFP模型进行系统能力集成与开发的方法,该方法的核心是研究系统CFP各层次之间的映射关系;给出了系统能力集成与开发的一般过程,并以侦查卫星应用系统示例,简要说明了基于SCFP模型进行系统能力集成的实现过程.     

Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

中程空空导弹冲淡式干扰模型

中程空空导弹的末制导主动雷达一方面提高了中程空空导弹作战效能和载机的生成概率,另一方面也为对中程空空导弹实施冲淡式干扰提供了机会。基于冲淡式干扰的基本原理建立了中程空空导弹的冲淡式电子干扰模型,分析了各种不同攻防对策下的冲淡式干扰的效果及其变化趋势,在此基础上讨论了对抗双方在冲淡式电子对抗中的最优对策。     

基于雷达网作战能力的目标分配模型

雷达网目标分配是联合作战中合理区分作战任务的重要组成部分,根据雷达网的作战特点,分析了雷达网遂行侦察监视任务的探测能力、数据融合能力以及“四抗”能力,在此基础上构建了雷达网目标分配模型。     

基于排队论的舰空导弹武器系统反导射击效能模型

舰空导弹是当前海上防空的主要装备。因此,评估舰空导弹武器系统的射击效能,使舰空导弹击毁目标概率达到最大化,是防御中所要考虑的核心问题。运用了排队论的方法,建立了在目标单方向和多方向等情况下的射击效能模型,并通过统计运算得到了某型舰空导弹武器系统在各种条件下相对全面的射击效能数据,解决了各型舰空导弹武器系统射击效能评估的问题,对舰空导弹武器系统的作战使用有一定的参考价值。     

层次聚类算法和基于图的分割算法相融合的图像分割算法

基于图的分割算法（Graph-Based Segmentation,GBS）算法）是由Felzenszwalb和Huttenlocher提出的经典的图像分割算法之一,但其分割结果中存在明显的欠分割现象。为此,在GBS算法的基础上引入层次聚类（Hierarchical Clustering,HC）算法,构造出一种解决GBS算法欠分割的方法,同时采用多线程并行处理数据的方式,有效改善了传统层次聚类算法的处理速度。该方法在RGB彩色空间中使用GBS算法得到图像中每个像素点的初始分割结果,并提取出每一类区域中的像素值,对其进行层次聚类,得到每一类区域中像素值的类别标签,根据层次聚类所得到的类别标签和预设的类别范围,修改每个像素点的初始分割结果。最后根据区域合并准则,生成一个新的分割图。经实验表明,该方法与Kmeans-SLIC(simple linear iterative clustering)算法和GBS算法等相比,很好地解决了欠分割现象,并产生了分割精度较高的语义分割图。     

Machine scheduling with an availability constraint and job delivery coordination

In this paper we study the scheduling problem that considers both production and job delivery at the same time with machine availability considerations. Only one vehicle is available to deliver jobs in a fixed transportation time to a distribution center. The vehicle can load at most K jobs as a delivery batch in one shipment due to the vehicle capacity constraint. The objective is to minimize the arrival time of the last delivery batch to the distribution center. Since machines may not always be available over the production period in real life due to preventive maintenance, we incorporate machine availability into the models. Three scenarios of the problem are studied. For the problem in which the jobs are processed on a single machine and the jobs interrupted by the unavailable machine interval are resumable, we provide a polynomial algorithm to solve the problem optimally. For the problem in which the jobs are processed on a single machine and the interrupted jobs are nonresumable, we first show that the problem is NP‐hard. We then propose a heuristic with a worst‐case error bound of 1/2 and show that the bound is tight. For the problem in which the jobs are processed on either one of two parallel machines, where only one machine has an unavailable interval and the interrupted jobs are resumable, we propose a heuristic with a worst‐case error bound of 2/3. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007