宿舍文化研究的文献计量分析(1991-2013)

本文以计量学为基础,采取回溯性文献检索方法,以《CNKI中国期刊全文数据库》(1991-2013年3月)为数据源,建立国内宿舍文化文献数据库。通过对527篇关于高校宿舍文化的文献进行年度分布、被引频次、期刊分布、主要发文单位、文献研究主题进行计量分析,以期了解国内关于宿舍文化的研究水平和发展趋势,把握研究重点和热点,旨在为后续相关研究提供参考和借鉴。     

拉波夫的叙事分析模式在语篇分析教学中的应用研究——以语篇《Face to Face with Guns》为例

拉波夫的叙事分析模式包括点题、指向、进展、评议、结果或结局和回应六个部分。本文从语篇分析教学的角度,运用拉波夫的叙事分析模式对（Face to Face with Guns）一文的叙事结构进行了讨论,指出该分析模式在语篇分析教学中对读写教学具有一定的指导意义。     

中美四所大学章程文本分析及启示

本文选取了耶鲁大学、康奈尔大学、吉林大学和石河子大学的章程作为研究样本,从大学章程的文本结构、章程的制定与完善、章程规定的内部治理结构以及章程规定的外部治理结构等方面进行比较分析,得出两国大学章程之间的差异并进行了相关分析,最后提出关于如何完善大学章程的相关建议。     

高重合度人字齿轮轮齿最佳修形优化设计

基于斜齿轮轮齿接触分析技术,建立了考虑人字齿轮典型安装误差的抛物线人字齿轮轮齿接触分析方法。综合考虑人字齿轮的传动误差与啮合特性,采用带精英策略的快速非支配排序遗传算法对高重合度人字齿轮的传动性能进行了多目标优化设计,该算法克服了优化结果的局部收敛,获得了人字齿轮最佳的齿廓、齿向抛物线修形参数。通过实例表明,修形优化后的齿面啮合印痕与传动误差较优化之前得到了明显的改善,有效地改善了高重合度人字齿轮的齿面偏载现象,降低了齿轮传动过程中的啮合冲击。对加工的人字齿轮在减振降噪试验台上进行带载试验,对比优化前后的噪音分贝值,进一步验证了该优化方法对人字齿轮副减振降噪具有一定作用。     

有人机/无人机协同空地攻击效能评估的综合指数模型

研究了未来有人机/无人机协同空地攻击的典型作战模式,然后根据混合编队的作战过程和特点,提出了一种建立有人机/无人机协同空地攻击效能评估的综合指数模型;同时确定了综合指数模型中各分系统和分项能力的评估模型。最后以6种有人机和6种无人机的协同空地攻击效能评估为例计算并检验了模型的可用性。     

基于立方体理论的MFTA软件设计与实现

本文报道的MFTA(Multi-stateFaultTreeAnalysis)软件为可靠性工程师分析多状态系统提供一种计算机辅助分析工具。我们设计了友好的Windows95用户交互界面 ,采用树视图组件实现逻辑树结构框架的输入 ,采用字符串表格组件实现判定表的直接输入 (立方体形式的 0 -1序列 ) ,还实现了多态单调关联典型结构函数到立方体形式判定表的转化。以标准模板库 (StandardTemplateLibrary)为基础 ,采用面向对象程序设计方法构建了立方体类库 ;然后 ,实现了以立方体理论为核心的MFTA定性定量分析算法 ,完成了软件的研制。     

阶比谱分析与汽车起动电机故障的实时诊断

本文主要论述阶比谱分析方法及其在汽车起动电机故障实时诊断中的应用。首先阐述了阶比谱分析的原理以及阶比采样中混迭与泄漏的产生及其抑制方法,然后讨论了如何在起动电机运行过程短、升速快的情况下获取感兴趣的噪声信号,进而采用阶比谱分析方法从信号中提取故障特征信息,最后利用阀值判别法起动电机的故障进行实时诊断。     

高超声速飞行器的弹道优化评估方法

高超声速飞行器弹道优化算法的综合评估对选取最优的弹道优化算法具有重要的参考意义。根据高超声速飞行器的特性,将其弹道分解为上升段、巡航段及俯冲段三个阶段,分别给出了各阶段的性能评价指标和对各阶段性能评价指标赋权的典型方法,并结合灰色关联度分析理论提出了弹道优化算法的综合评估方法。评估实例表明,该方法能定量地对多种弹道优化方法所生成的弹道进行综合性能评估,并能对备选优化方法的优劣进行排序。     

Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility

In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Waypoint analysis for command and control

Command and Control (C2) in a military setting can be epitomized in battles‐of‐old when commanders would seek high ground to gain superior spatial‐temporal information; from this vantage point, decisions were made and relayed to units in the field. Although the fundamentals remain, technology has changed the practice of C2; for example, enemy units may be observed remotely, with instruments of varying positional accuracy. A basic problem in C2 is the ability to track an enemy object in the battlespace and to forecast its future position; the (extended) Kalman filter provides a straightforward solution. The problem changes fundamentally if one assumes that the moving object is headed for an (unknown) location, or waypoint. This article is concerned with the new problem of estimation of such a waypoint, for which we use Bayesian statistical prediction. The computational burden is greater than an ad hoc regression‐based estimate, which we also develop, but the Bayesian approach has a big advantage in that it yields both a predictor and a measure of its variability. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004