It is revealed that the dynamic stability of 2-D recursive continuous-discrete systems with interval parameters involves the problem of robust Hurwitz-Schur stability of bivariate polynomials family. It is proved that...It is revealed that the dynamic stability of 2-D recursive continuous-discrete systems with interval parameters involves the problem of robust Hurwitz-Schur stability of bivariate polynomials family. It is proved that the Hurwitz-Schur stability of the denominator polynomials of the systems is necessary and sufficient for the asymptotic stability of the 2-D hybrid systems. The 2-D hybrid transformation, i. e. 2-D Laplace-Z transformation, has been proposed to solve the stability analysis of the 2-D continuous-discrete systems, to get the 2-D hybrid transfer functions of the systems. The edge test for the Hurwitz-Schur stability of interval bivariate polynomials is introduced. The Hurwitz-Schur stability of the interval family of 2-D polynomials can be guaranteed by the stability of its finite edge polynomials of the family. An algorithm about the stability test of edge polynomials is given.展开更多
This paper aims to study a new grey prediction approach and its solution for forecasting the main system variable whose accurate value could not be collected while the potential value set could be defined. Based on th...This paper aims to study a new grey prediction approach and its solution for forecasting the main system variable whose accurate value could not be collected while the potential value set could be defined. Based on the traditional nonhomogenous discrete grey forecasting model（NDGM）, the interval grey number and its algebra operations are redefined and combined with the NDGM model to construct a new interval grey number sequence prediction approach. The solving principle of the model is analyzed, the new accuracy evaluation indices, i.e. mean absolute percentage error of mean value sequence（MAPEM） and mean percent of interval sequence simulating value set covered（MPSVSC）, are defined and, the procedure of the interval grey number sequence based the NDGM（IG-NDGM） is given out. Finally, a numerical case is used to test the modelling accuracy of the proposed model. Results show that the proposed approach could solve the interval grey number sequence prediction problem and it is much better than the traditional DGM（1,1） model and GM（1,1） model.展开更多
The problem of passivity analysis for a class of discrete-time stochastic neural networks (DSNNs) with time-varying interval delay was investigated. The delay-dependent sufficient criteria were derived in terms of lin...The problem of passivity analysis for a class of discrete-time stochastic neural networks (DSNNs) with time-varying interval delay was investigated. The delay-dependent sufficient criteria were derived in terms of linear matrix inequalities (LMIs). The results are shown to be generalization of some previous results and are less conservative than the existing works. Meanwhile, the computational complexity of the obtained stability conditions is reduced because less variables are involved. A numerical example is given to show the effectiveness and the benefits of the proposed method.展开更多
It is being widely studied how to extract knowledge from a decision table based on rough set theory. The novel problem is how to discretize a decision table having continuous attribute. In order to obtain more reasona...It is being widely studied how to extract knowledge from a decision table based on rough set theory. The novel problem is how to discretize a decision table having continuous attribute. In order to obtain more reasonable discretization results, a discretization algorithm is proposed, which arranges half-global discretization based on the correlational coefficient of each continuous attribute while considering the uniqueness of rough set theory. When choosing heuristic information, stability is combined with rough entropy. In terms of stability, the possibility of classifying objects belonging to certain sub-interval of a given attribute into neighbor sub-intervals is minimized. By doing this, rational discrete intervals can be determined. Rough entropy is employed to decide the optimal cut-points while guaranteeing the consistency of the decision table after discretization. Thought of this algorithm is elaborated through Iris data and then some experiments by comparing outcomes of four discritized datasets are also given, which are calculated by the proposed algorithm and four other typical algorithras for discritization respectively. After that, classification rules are deduced and summarized through rough set based classifiers. Results show that the proposed discretization algorithm is able to generate optimal classification accuracy while minimizing the number of discrete intervals. It displays superiority especially when dealing with a decision table having a large attribute number.展开更多
基金This project was supported by National Natural Science Foundation of China (69971002).
文摘It is revealed that the dynamic stability of 2-D recursive continuous-discrete systems with interval parameters involves the problem of robust Hurwitz-Schur stability of bivariate polynomials family. It is proved that the Hurwitz-Schur stability of the denominator polynomials of the systems is necessary and sufficient for the asymptotic stability of the 2-D hybrid systems. The 2-D hybrid transformation, i. e. 2-D Laplace-Z transformation, has been proposed to solve the stability analysis of the 2-D continuous-discrete systems, to get the 2-D hybrid transfer functions of the systems. The edge test for the Hurwitz-Schur stability of interval bivariate polynomials is introduced. The Hurwitz-Schur stability of the interval family of 2-D polynomials can be guaranteed by the stability of its finite edge polynomials of the family. An algorithm about the stability test of edge polynomials is given.
基金supported by the National Natural Science Foundation of China(7090104171171113)the Aeronautical Science Foundation of China(2014ZG52077)
文摘This paper aims to study a new grey prediction approach and its solution for forecasting the main system variable whose accurate value could not be collected while the potential value set could be defined. Based on the traditional nonhomogenous discrete grey forecasting model（NDGM）, the interval grey number and its algebra operations are redefined and combined with the NDGM model to construct a new interval grey number sequence prediction approach. The solving principle of the model is analyzed, the new accuracy evaluation indices, i.e. mean absolute percentage error of mean value sequence（MAPEM） and mean percent of interval sequence simulating value set covered（MPSVSC）, are defined and, the procedure of the interval grey number sequence based the NDGM（IG-NDGM） is given out. Finally, a numerical case is used to test the modelling accuracy of the proposed model. Results show that the proposed approach could solve the interval grey number sequence prediction problem and it is much better than the traditional DGM（1,1） model and GM（1,1） model.
基金Projects(60874030,60835001,60574006)supported by the National Natural Science Foundation of ChinaProjects(07KJB510125,08KJD510008)supported by the Natural Science Foundation of Jiangsu Higher Education Institutions of ChinaProject supported by the Qing Lan Program,Jiangsu Province,China
文摘The problem of passivity analysis for a class of discrete-time stochastic neural networks (DSNNs) with time-varying interval delay was investigated. The delay-dependent sufficient criteria were derived in terms of linear matrix inequalities (LMIs). The results are shown to be generalization of some previous results and are less conservative than the existing works. Meanwhile, the computational complexity of the obtained stability conditions is reduced because less variables are involved. A numerical example is given to show the effectiveness and the benefits of the proposed method.
文摘It is being widely studied how to extract knowledge from a decision table based on rough set theory. The novel problem is how to discretize a decision table having continuous attribute. In order to obtain more reasonable discretization results, a discretization algorithm is proposed, which arranges half-global discretization based on the correlational coefficient of each continuous attribute while considering the uniqueness of rough set theory. When choosing heuristic information, stability is combined with rough entropy. In terms of stability, the possibility of classifying objects belonging to certain sub-interval of a given attribute into neighbor sub-intervals is minimized. By doing this, rational discrete intervals can be determined. Rough entropy is employed to decide the optimal cut-points while guaranteeing the consistency of the decision table after discretization. Thought of this algorithm is elaborated through Iris data and then some experiments by comparing outcomes of four discritized datasets are also given, which are calculated by the proposed algorithm and four other typical algorithras for discritization respectively. After that, classification rules are deduced and summarized through rough set based classifiers. Results show that the proposed discretization algorithm is able to generate optimal classification accuracy while minimizing the number of discrete intervals. It displays superiority especially when dealing with a decision table having a large attribute number.
