接触碰撞模型的弹管耦合问题

基于弹塑性力学、多体动力学与接触碰撞问题的有限元法,分别建立了火箭武器发射过程中定向管与火箭弹刚性约束和弹塑性约束的有限元模型,运用非线性动力学方法模拟两种情况的弹管碰撞过程。对比分析两种模型的仿真结果表明:弹管刚性约束对火箭弹的起始扰动的影响更大,弹塑性约束的弹管碰撞系统更能真实描述火箭弹和定向管之间的接触碰撞过程。仿真结果为火箭武器的设计和分析提供了一定的参考价值。     

社会管理视角下的诚信文化建设研究

社会管理具有不可替代的诚信文化建设功能,加强社会管理能够扩大诚信规范约束的边际、减少失信成本低廉的问题、降低不诚信的公众容忍度.然而,在当前社会管理中,诚信信息管理不够健全,诚信奖惩管理不够严肃,诚信仪式活动不够神圣.为此,应促进诚信信息管理的系统化,维持诚信奖惩管理的严肃性,强化诚信仪式活动的神圣感,从而发挥好社会管理的诚信文化建设功能.     

自由飘浮空间机器人准刚性分解运动轨迹控制与仿真

研究轨道空间机器人操作时,基座处于自由飘浮状态的手爪准刚性运动直角坐标轨迹的分解运动控制,重点分析了广义雅可比矩阵的计算,并进行了空间单手３—ＤＯＦ的仿真,该方法可相应推广到开链多手。     

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

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

NICALON SiC/Al 预制丝热膨胀特性研究

本文研究了NICALON SiC束丝纤维增强铝预制丝在15～400℃温度区间内的热膨胀特性。研究表明预制丝两次热循环后得到的膨胀曲线不一致,该曲线在15～400℃范围的平均热膨胀系数分别为3.2×10~(-6)℃~(-1)、4.1×10~(-6)℃~(-1)。本文对预制丝的热膨胀行为进行了理论分析和探讨,计算值和实验值较为符合。     

H∞滤波的广义平方根算法

研究H∞广义平方根滤波.引入非定矩阵的广义平方根分解,给出了使矩阵三角化的双曲变换矩阵的存在性判别及其求取方法,从而使H∞滤波的存在性判别以及H∞广义平方根滤波的算法得以实现.     

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.     

A note on scheduling parallel machines subject to breakdown and repair

In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ C_j, the makespan C_max, and the maximum lateness L_max. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.