论高校共青团组织开展民族团结教育的优势地位

本文结合高校共青团组织的性质,论述了高校共青团在开展民族团结教育活动中具有的政治优势、组织优势、实践优势三大独特优势。同时结合当前形势,阐明了加强大学生民族团结教育的重要性,有针对性的提出了高校共青团组织在开展民族团结教育方面的相关建议。     

论加强党风建设对促进高校发展的作用

该文从加强和改进党的作风建设对高校校风建设的重要性和紧迫性为出发点,分析了高校在党风建设上存在的突出问题,并对如何切实加强党的作风建设,营造以党风促教风,以教风带学风的良好氛围提出了切实有效的措施。     

论石鲁根植于传统文化的中国画绘画笔墨辨证观

以中国传统文化思想为切入点,从墨色关系、虚实关系和“多少、繁简”关系三个方面探讨石鲁中国画画论中的笔墨观,得出石鲁的笔墨观不但根植于中国传统文化,又融合了唯物辨证法思想和二十世纪中国绘画新成果．由微见著说明石鲁的中国画绘画思想来源于中国传统文化与唯物辨证法及现代绘酒成果的结合。     

XMSF下新兴开放标准的集成和验证

建模与仿真领域中实现资源重用、共享和互操作的基本途径是标准化。诸多开放互操作标准的提出和应用成功解决了各自领域的互操作问题,推动了仿真技术的发展。关于这些开放标准的讨论及应用情况都已有相当数量的文献予以介绍,但具体涉及同一框架下各标准之间相互作用或影响情况却鲜有提及。依托XMSF框架,选取了MDA、BOM、SRML、MSDL、C-BML五种主流的新兴开放标准,通过XMSF案例对这些标准在XMSF中的集成应用进行了详细研究,评估它们在一起时可能为仿真领域带来的影响和能力。     

直接力/气动力复合作用动能拦截弹姿态控制方法

针对直接力/气动力复合作用动能拦截弹的姿态控制问题,建立了拦截弹俯仰-偏航通道短周期运动模型;利用线性二次型最优跟踪控制理论结合姿控固体小火箭点火逻辑设计了复合控制系统,通过分析非线性容限得出了该系统对直接力偏差具有强鲁棒性的结论;姿控回路仿真表明系统具有快速响应特性及良好的跟踪性能,考虑侧喷干扰效应等实际条件的六自由度弹道仿真表明所设计的控制系统能够满足拦截末段直接碰撞要求。     

极化域-空域联合估计在反辐射导弹抗诱偏中的应用研究

提出了将极化阵列应用到反辐射导引头上,导引头利用目标与诱饵的极化差异,采用极化域-空域联合估计方法抗诱偏。首先,利用波达方向矩阵法,估算出雷达与诱饵的空间二维到达角和极化参数,将估算出来的二维到达角信息为反辐射导引头提供导引,极化参数用来鉴别雷达与诱饵,从而达到抗诱偏的目的。然后,结合导弹运动方程及导引方程对反辐射导弹抗三点源诱偏进行了全弹道数字仿真,并且采用Monte-Carlo方法对全弹道仿真进行了多次实验,仿真结果证明了将极化域-空域联合估计应用于反辐射导引头抗诱偏的可行性。     

基于粒度计算的指控系统效能测度的探索性建模方法

分析了探索性分析模型的粒度原理,建立了基于粒度计算的指控系统效能测度的探索性分析模型,重点研究了探索性分析模型的建立,属性函数的构造和探索因子集的粒度获取方法,并结合多兵种联合作战案例,对使命完成时间测度进行了探索性分析,实验表明,基于粒度计算的探索性建模方法能够通过粒度的转换降低问题的复杂度,并在不同粒度层次上实现对问题描述的一致性。     

星地距离变化对星地双向时间比对的影响及改正

星地时间同步是卫星导航系统的关键技术,星地双向时间比对能有效提高星地时间同步的精度。在分析了星地距离变化对星地双向时间比对可引起百纳秒量级误差后,提出了前后历元观测数据差分改正方法,通过数学仿真验证该方法能达到纳秒量级精度。     

Fully sequential procedures for comparing constrained systems via simulation

We consider the problem of finding the system with the best primary performance measure among a finite number of simulated systems in the presence of a stochastic constraint on a single real‐valued secondary performance measure. Solving this problem requires the identification and removal from consideration of infeasible systems (Phase I) and of systems whose primary performance measure is dominated by that of other feasible systems (Phase II). We use indifference zones in both phases and consider two approaches, namely, carrying out Phases I and II sequentially and carrying out Phases I and II simultaneously, and we provide specific example procedures of each type. We present theoretical results guaranteeing that our approaches (general and specific, sequential and simultaneous) yield the best system with at least a prespecified probability, and we provide a portion of an extensive numerical study aimed at evaluating and comparing the performance of our approaches. The experimental results show that both new procedures are useful for constrained ranking and selection, with neither procedure showing uniform superiority over the other.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Path optimization for the resource‐constrained searcher

We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010