模糊熵在地铁车辆平轮故障诊断中的应用研究

为实现地铁车辆走行部关键部件的不解体检测诊断,采用过车轨道振动来分析车辆平轮故障。试验采集了正常情况、剥离故障及擦伤故障等3种工况下的振动信号。首先对信号进行集合经验模态分解;然后,用相关系数法筛选分解产生的本征模态函数分量,再计算主分量的模糊熵熵值作为故障特征向量;最后,输入到由遗传算法优化的支持向量机分类器进行故障识别。试验结果表明,该方法可以实现地铁车辆平轮故障的准确识别。     

浅谈CRH_5型动车组转向架三级检修分解工艺

本文主要介绍CRH_5型动车组转向架在三级检修过程中的分解工序及工艺布局。     

复合函数的几个问题

复合函数是高等数学的重点和难点之一,是学习导数的基础.文章结合该部分知识的特点,对复合函数的分解、运算、定义域的确定、复合函数的极限求解等进行了探讨.     

多品种供应的多供应商选择模型及分解算法

为解决供应链中多品种供应的多供应商选择问题，建立了以供应综合成本最低为目标函数、满足多个约束条件的组合优化模型．为解决求解的困难，采用变换分解算法，将原模型转换为整数规划问题．根据不同迭代方式，给出了2种基本运算步骤．在算例中运用模型和算法，得到了多物资供应环境下多供应商的最优任务分派．新方法克服了常规供应商的选择评价方法只针对单一物资供应过程和面向单一供应商选择过程的局限性．     

用一个Perron补计算非负矩阵的Perron特征向量问题

对于一个具有谱半径ρ的非负不可约矩阵Ａ，Ｍｅｙｅｒ引进了Ｐｅｒｒｏｎ补的概念法解决Ａ的Ｐｅｒｒｏｎ向量问题，Ｍｅｙｅｒ的方法是个典型的Ｄｉｖｉｄｅ－ａｎｄ－Ｃｏｎｑｕｅｒ（“分而制之”）的方法。本文的算法只用一个Ｐｅｒｒｏｎ补就可以计算出Ａ的Ｐｅｒｒｏｎ向量。     

基于特征正交分解的空间变异地震动模拟

结合模态截断技术，导出了特征正交分解型谱表示法的随机模拟公式．给出了空间变异地震动的随机描述，并通过引入对地震动谱矩阵的预分解，导出了用于平稳空间变异地震动随机模拟的简化计算公式，避免了较耗时的对复矩阵求特征值的运算．简化公式同样可用快速傅立叶变换算法加速，较之原有模拟方法具有较高的计算效率．最后，模拟了龙潭河特大桥桥址处的空间变异地震动，说明了所推导的方法是正确的，同时形象地说明了地震动特征正交分解模态的物理意义．     

噪声背景下提取调制信息的改进奇异值分解技术

在介绍现有奇异值分离技术基本原理及其在故障诊断中的应用的基础上，研究了利用信号时间序列重构的吸引子轨迹矩阵奇异值分布特征与信号特征的关系，引入自相关函数定量计算重构矩阵的延时步长，改进了现有算法，使得吸引子轨迹矩阵的重构更加合理。研究表明该方法能在强噪声背景下提取出所需的调制信号，并成功用于齿轮箱调制故障信号的提取。     

基于SVM和小波边缘检测的车型图像识别

在基于小波边缘检测和SMO算法的基础上进行车型图像识别,首先将待识别目标进行二维小波分解,获取不同尺度下的小波系数,然后对其进行主元分析,得到的主元作为支持向量机的特征量输入.实验结果表明,该方法具有良好的分类性能.     

AN EXPERIMENTAL STUDY ON REMOVAL OF NOx IN FLUE GAS AT THENONEQUILIBRIUM PLASMA

Removal of nitrogen oxides (NOx) in flue gas by means of nonequilibrium plasma technology is a very prospect and attractive method. As the nonequilibrium plasma micro discharges can generate a powerful energy flux, imparted to the flue gas, the molecules and atoms of pollutants are motivated and decomposed, and then NOx in the flue gas are decomposed and conversed in the particular conditions. Based on nonequilibrium plasma in combination with catalytic principle, an experimental investigation on NOx decomposition and conversion with AI2 03 catalysts was carriedout and the NOx removal rate up to 95% was obtained. The NOx decomposition and conversion principle with AI2O3 catalysts was also discussed.     

Network Decomposition and Maximum Independent Set Part Ⅱ：Application Research

According to the researches on theoretic basis in part I of the paper，the spanning tree algorithms solving the maximum independent set both in even network and in odd network have been developed in this part，part Ⅱ of the paper．The algorithms trans form first the general network into the pair sets network，and then decompose the pair sets network into a series of pair subsets by use of the characteristic of maximum flow passing through the pair sets network．As for the even network，the algorithm requires only one time of trans formation and decomposition，the maximum independent set can be gained without any iteration processes，and the time complexity of the algorithm is within the bound of O(｜V｜^3)．However，as for the odd network，the algorithm consists of two stages．In the first stage，the general odd network is transformed and decomposed into the pseudo-negative envelope graphs and generalized reverse pseudo-negative envelope graphs alternately distributed at first；then the algorithm turns to the second stage，searching for the negative envelope graphs within the pseudo-negative envelope graphs only．Each time as a negative envelope graphhas been found．renew the pair sets network by iteration at once．and then tum back to the first stage．So both stages form a circulation process up to the optimum．Two available methods，the adjusting search and the picking-off search are specially developed to deal with the problems resulted from the odd network．Both of them link up with each other harmoniously and are embedded together in the algorithm．Analysis and study indicate that the time complexity of this algorithm is within the bound of O(｜V｜^5)．