双绝热近似下磁流体力学线性稳定性原理

本文得出了双绝热近似的磁流体力学能量积分关系式。分析表明这种磁流体力学系统是保守的,可以采用运动方程或能量原理方法分析系统的稳定性特性。本文从控制方程组出发讨论了线性稳定性的基本原理,指出纵向压力增值有助于系统的稳定性。     

The open shop scheduling problem with a given sequence of jobs on one machine

The paper considers the open shop scheduling problem to minimize the make-span, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not allowed, the problem is NP-hard in the strong sense if the number of machines is variable, and is NP-hard in the ordinary sense in the case of two machines. For the latter case we give a heuristic algorithm that runs in linear time and produces a schedule with the makespan that is at most 5/4 times the optimal value. We also show that the two-machine problem in the nonpreemptive case is solvable in pseudopolynomial time by a dynamic programming algorithm, and that the algorithm can be converted into a fully polynomial approximation scheme. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 705–731, 1998     

A nonparametric approach to accelerated life testing under multiple stresses

Accelerated life testing (ALT) is concerned with subjecting items to a series of stresses at several levels higher than those experienced under normal conditions so as to obtain the lifetime distribution of items under normal levels. A parametric approach to this problem requires two assumptions. First, the lifetime of an item is assumed to have the same distribution under all stress levels, that is, a change of stress level does not change the shape of the life distribution but changes only its scale. Second, a functional relationship is assumed between the parameters of the life distribution and the accelerating stresses. A nonparametric approach, on the other hand, assumes a functional relationship between the life distribution functions at the accelerated and nonaccelerated stress levels without making any assumptions on the forms of the distribution functions. In this paper, we treat the problem nonparametrically. In particular, we extend the methods of Shaked, Zimmer, and Ball [7] and Strelec and Viertl [8] and develop a nonparametric estimation procedure for a version of the generalized Arrhenius model with two stress variables assuming a linear acceleration function. We obtain consistent estimates as well as confidence intervals of the parameters of the life distribution under normal stress level and compare our nonparametric method with parametric methods assuming exponential, Weibull and lognormal life distributions using both real life and simulated data. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 629–644, 1998     

失效概率函数求解的高效算法

结合基于分数矩约束的极大熵方法和替代模型法,发展了一种失效概率函数求解的高效算法。所提算法的基本思路是利用自主学习的迭代Kriging方法来构造失效概率函数,即采用较少的训练样本来构造粗糙的失效概率函数,在此基础上通过添加新的违反学习函数约束的样本来更新失效概率函数,直到达到精度要求。对于每一个分布参数的训练样本点,所提方法采用分数矩约束的极大熵法来求解相应的失效概率样本。由于分数矩的计算采用了高效的降维积分,并且由于分数矩约束下极大熵法中优化策略高效地逼近了响应的概率密度函数,从而使得失效概率样本能够被高效高精度地估计出来。为了检验所提方法的精度及效率,给出了两个算例,对比了所提方法与已有的失效概率函数求解的Bayes公式法及Monte Carlo法等,结果表明,所提方法适用于求解复杂的功能函数问题,且在满足精度要求的基础上大大降低了计算量。     

对失控翻滚目标任意位置悬停的模糊控制

针对失控翻滚目标任意位置悬停的控制问题进行研究。在目标器轨道坐标系下建立任意偏心率的三维相对运动方程,并分析失控翻滚目标的姿态运动特性。将悬停问题解耦为三个通道的二维模糊控制问题,并以x通道为例进行Mamdani型模糊控制器设计。确定相应的模糊子集、隶属度函数以及模糊控制规则表,采用面积中心法解模糊化。通过数值仿真验证了模糊控制器的控制性能。     

论英语拟声词及其翻译

本文分析了英汉拟声词的语音关系和英语拟声词的语音修辞功能。在保留英语拟声词语音修辞效果前提下,分别从英汉拟声词的语音关系和英汉拟声词的声音发出者所承载的不同文化意象等角度探讨了相应的翻译方法。     

谈任职教育中图书馆的职能作用

任职教育是武警警官再学习的过程。图书馆要根据培训对象的流动性、培训类型的多样性、培训内容的需求性和培训方式的开放性等任职教育特点,在提高信息服务功能上、在树立“以人为本”的理念上、在开展个性化服务上下功夫。     

一类二阶微分方程Poincaré分岔极限环的不存在性

讨论一类二阶微分方程x¨+εf(x,x.)x.+g(x)=0的Poincar分岔极限环的不存在性,利用一阶Mel’nikov函数直接从整体上进行分析讨论,得出了若干充分条件和判别准则。     

广义Liénard方程Poincaré分岔极限环的唯一性和不存在性

讨论了一类广义Linard方程x¨+f1(x)x.2+εf2(x)x.+g(x)=0的Poincar分岔极限环的唯一性和不存在性。将不对Abel积分进行分项,而是利用一阶Mel′nikov函数直接从整体上进行分析讨论,得出了若干判别准则和充分条件。     

Transporting jobs through a two‐machine open shop

We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009