It is significant to detect the fault type and assess the fault level as early as possible for avoiding catastrophic accidents.Due to diversity and complexity,the compound faults detection of rotating machinery under ...It is significant to detect the fault type and assess the fault level as early as possible for avoiding catastrophic accidents.Due to diversity and complexity,the compound faults detection of rotating machinery under non-stationary operation turns to be a challenging task.Multiwavelet with two or more base functions may match two or more features of compound faults,which may supply a possible solution to compound faults detection.However,the fixed basis functions of multiwavelet transform,which are not related with the vibration signal,may reduce the accuracy of compound faults detection.Moreover,the decomposition results of multiwavelet transform not being own time-invariant is harmful to extract the features of periodical impulses.Furthermore,multiwavelet transform only focuses on the multi-resolution analysis in the low frequency band,and may leave out the useful features of compound faults.To overcome these shortcomings,a novel method called adaptive redundant multiwavelet packet(ARMP) is proposed based on the two-scale similarity transforms.Besides,the relative energy ratio at the characteristic frequency of the concerned component is computed to select the sensitive frequency bands of multiwavelet packet coefficients.The proposed method was used to analyze the compound faults of rolling element bearing.The results showed that the proposed method could enhance the ability of compound faults detection of rotating machinery.展开更多
Linear programming is a method for solving linear optimization problems with constraints, widely met in real-world applications. In the vast majority of these applications, the number of constraints is significantly l...Linear programming is a method for solving linear optimization problems with constraints, widely met in real-world applications. In the vast majority of these applications, the number of constraints is significantly larger than the number of variables. Since the crucial subject of these problems is to detect the constraints that will be verified as equality in an optimal solution, there are methods for investigating such constraints to accelerate the whole process. In this paper, a technique named proximity technique is addressed, which under a proposed theoretical framework gives an ascending order to the constraints in such a way that those with low ranking are characterized of high priority to be binding. Under this framework, two new Linear programming optimization algorithms are introduced, based on a proposed Utility matrix and a utility vector accordingly. For testing the addressed algorithms firstly a generator of 10,000 random linear programming problems of dimension n with m constraints, where , is introduced in order to simulate as many as possible real-world problems, and secondly, real-life linear programming examples from the NETLIB repository are tested. A discussion of the numerical results is given. Furthermore, already known methods for solving linear programming problems are suggested to be fitted under the proposed framework.展开更多
基金supported by the National Natural Science Foundation of China (Grant Nos. 50975220 and 51035007)the National Basic Research Program of China ("973" Program) (Grant No. 2009CB724405)the Important National Science and Technology Specific Projects (Grant No.2010ZX04014-016)
文摘It is significant to detect the fault type and assess the fault level as early as possible for avoiding catastrophic accidents.Due to diversity and complexity,the compound faults detection of rotating machinery under non-stationary operation turns to be a challenging task.Multiwavelet with two or more base functions may match two or more features of compound faults,which may supply a possible solution to compound faults detection.However,the fixed basis functions of multiwavelet transform,which are not related with the vibration signal,may reduce the accuracy of compound faults detection.Moreover,the decomposition results of multiwavelet transform not being own time-invariant is harmful to extract the features of periodical impulses.Furthermore,multiwavelet transform only focuses on the multi-resolution analysis in the low frequency band,and may leave out the useful features of compound faults.To overcome these shortcomings,a novel method called adaptive redundant multiwavelet packet(ARMP) is proposed based on the two-scale similarity transforms.Besides,the relative energy ratio at the characteristic frequency of the concerned component is computed to select the sensitive frequency bands of multiwavelet packet coefficients.The proposed method was used to analyze the compound faults of rolling element bearing.The results showed that the proposed method could enhance the ability of compound faults detection of rotating machinery.
文摘Linear programming is a method for solving linear optimization problems with constraints, widely met in real-world applications. In the vast majority of these applications, the number of constraints is significantly larger than the number of variables. Since the crucial subject of these problems is to detect the constraints that will be verified as equality in an optimal solution, there are methods for investigating such constraints to accelerate the whole process. In this paper, a technique named proximity technique is addressed, which under a proposed theoretical framework gives an ascending order to the constraints in such a way that those with low ranking are characterized of high priority to be binding. Under this framework, two new Linear programming optimization algorithms are introduced, based on a proposed Utility matrix and a utility vector accordingly. For testing the addressed algorithms firstly a generator of 10,000 random linear programming problems of dimension n with m constraints, where , is introduced in order to simulate as many as possible real-world problems, and secondly, real-life linear programming examples from the NETLIB repository are tested. A discussion of the numerical results is given. Furthermore, already known methods for solving linear programming problems are suggested to be fitted under the proposed framework.
