In this paper, we use the matrix measure technique to study stable fault-tolerance control of networked control systems. State feedback networked control systems with the network-induced delay, parameter uncertainties...In this paper, we use the matrix measure technique to study stable fault-tolerance control of networked control systems. State feedback networked control systems with the network-induced delay, parameter uncertainties, sensor failures and actuator failures are considered. State feedback gain K is designed for any invariant delay τ, and some theorems and sufficient conditions for stable fault-tolerance control are given. Example is presented to illustrate the effectiveness of these theorems.展开更多
This paper is concerned with delay dependent absolute stability for a class of uncertain Lur′e systems with multiple time-delays. By using a descriptor model transformation of the sys-tem and by applying a recent res...This paper is concerned with delay dependent absolute stability for a class of uncertain Lur′e systems with multiple time-delays. By using a descriptor model transformation of the sys-tem and by applying a recent result on bounding of cross products of vectors, a new type of Lya-punov-Krasovskii functional is constructed. Based on the new functional, delay-dependent suffi-cient conditions for absolute stability are derived in terms of linear matrix inequalities. These con-ditions do not require any parameter tuning, and can be solved numerically using the software LMI Lab. A numerical example is presented which shows that the proposed method can substantiallyimprove the delay bound for absolute stability of Lur′e system with time-delays, compared to theexisting ones.展开更多
This paper considers the guaranteed cost control problem for a class of uncertain linear systems with both state and input delays. By representing the time-delay system in the descriptor system form and using a recent...This paper considers the guaranteed cost control problem for a class of uncertain linear systems with both state and input delays. By representing the time-delay system in the descriptor system form and using a recent result on bounding of cross products of vectors, we obtain new delay-dependent sufficient conditions for the existence of the guaranteed cost controller in terms of linear matrix inequalities. Two examples are presented which show the effectiveness of our approach.展开更多
The stabilization using a stable compensator does not introduce additional unstable zeros into the closed-loop transfer function beyond those of the original plant, so it is a desirable compensator, the price is that ...The stabilization using a stable compensator does not introduce additional unstable zeros into the closed-loop transfer function beyond those of the original plant, so it is a desirable compensator, the price is that the compensator’s order will go up. This note considered the order of stable compensators for a class of time-delay systems. First, it is shown that for single-loop plants with at most one real right-half plane zero, a special upper bound for the minimal order of a strongly stabilizing compensator can be obtained in terms of the plant order; Second, it is shown that approximate unstable pole-zero cancellation does not occur, and the distances between distinct unstable zeroes are bounded below by a positive constant, then it is possible to find an upper bound for the minimal order of a strongly stabilizing compensator.展开更多
This study presented an off-line identification method of induction motor (IM) parameters. Before startup,the inverter drive performed automatically a modified DC test, a locked-rotor test, a no-load test and a step-v...This study presented an off-line identification method of induction motor (IM) parameters. Before startup,the inverter drive performed automatically a modified DC test, a locked-rotor test, a no-load test and a step-voltage test to identify all the parameters of an induction motor. No manual operation and speed signals were required in the process. In order to obtain effective messages and improve the accuracy of identification, the discrete fast Fourier transform (DFFT) and the least-squares were used to process the signals of currents and voltages. A phase-voltage measuring method for motors was also proposed, which measured directly the actual conducting time of three upper switches in the inverter without need for a dead-time compensator. The validity, reliability and accuracy of the presented methods have been verified by the experiments on a VSI-fed IM drive system.展开更多
This paper presents a new hybrid genetic algorithm for the vertex cover problems in which scan-repair and local improvement techniques are used for local optimization. With the hybrid approach, genetic algorithms are ...This paper presents a new hybrid genetic algorithm for the vertex cover problems in which scan-repair and local improvement techniques are used for local optimization. With the hybrid approach, genetic algorithms are used to perform global exploration in a population, while neighborhood search methods are used to perform local exploitation around the chromosomes. The experimental results indicate that hybrid genetic algorithms can obtain solutions of excellent quality to the problem instances with different sizes. The pure genetic algorithms are outperformed by the neighborhood search heuristics procedures combined with genetic algorithms.展开更多
Let G be a 3-connected graph with n vertices. The paper proves that if for each pair of vertices u and v of G, d(u,v)=2, has |N(u)∩N(v)|≤α(α is the minimum independent set number), and then max{d(u),d(v)}≥n+12,...Let G be a 3-connected graph with n vertices. The paper proves that if for each pair of vertices u and v of G, d(u,v)=2, has |N(u)∩N(v)|≤α(α is the minimum independent set number), and then max{d(u),d(v)}≥n+12, then G is a Hamilton connected graph.展开更多
Sticker model is one of the basic models in the DNA computer models.This model is coded with sin-gle-double stranded DNA molecules.It has the following ad-vantages that the operations require no strands extension and ...Sticker model is one of the basic models in the DNA computer models.This model is coded with sin-gle-double stranded DNA molecules.It has the following ad-vantages that the operations require no strands extension and use no enzymes; Whats more, the materials are reusable. Therefore it arouses attention and interest of scientists in many fields. In this paper, we will systematically analyze the theories and applications of the model,summarize other sci-entists contributions in this field,and propose our research results.This paper is the theoretical portion of the sticker model on DNA computer, which includes the introduction of the basic model of sticker computing. Firstly, we systemati-cally introduce the basic theories of classic models about sticker computing; Secondly, we discuss the sticker system which is an abstract computing model based on the sticker model and formal languages; Finally, extend and perfect the model,and present two types of models that are more exten-sive in the applications and more perfect in the theory than the past models: one is the so-called k-bit sticker model,the other is full-message sticker DNA computing model.展开更多
The relationships between artificial neural networks and graph theory are considered in detail. The applications of artificial neural networks to many difficult problems of graph theory, especially NP-complete problem...The relationships between artificial neural networks and graph theory are considered in detail. The applications of artificial neural networks to many difficult problems of graph theory, especially NP-complete problems, and the applications of graph theory to artificial neural networks are discussed. For example graph theory is used to study the pattern classification problem on the discrete type feedforward neural networks, and the stability analysis of feedback artificial neural networks etc.展开更多
An excellent introduction to the topic of poset matroids is due to M.Barnabei, G. Nicoletti and L. Pezzoli. On the basis of their work, we have obtained the global rankaxioms for poset matroids. In this paper, we stud...An excellent introduction to the topic of poset matroids is due to M.Barnabei, G. Nicoletti and L. Pezzoli. On the basis of their work, we have obtained the global rankaxioms for poset matroids. In this paper, we study the special integral function f and obtain a newclass of poset matroids from the old ones, and then we generalize this result according to theproperties of f. Almost all of these results can be regarded as the application of global rankaxioms for poset matroids. The main results in our paper have, indeed, investigated the restrictionof the basis of the poset matroid, and we give them the corresponding geometric interpretation.展开更多
An outpath of a vertex v in a digraph is a path starting at v such that vdominates the end vertex of the path only if the end vertex also dominates v. First we show thatletting D be a strongly connected semicomplete c...An outpath of a vertex v in a digraph is a path starting at v such that vdominates the end vertex of the path only if the end vertex also dominates v. First we show thatletting D be a strongly connected semicomplete c-partite digraph (c ≥ 3), and one of the partitesets of it consists of a single vertex, say v, then D has a c-pancyclic partial ordering from v,which generalizes a result about pancyclicity of multipartite tournaments obtained by Gutin in 1993.Then we prove that letting D be a strongly connected semicomplete c-partite digraph with c ≥ 3 andletting v be a vertex of D, then D has a (c - 1)-pan-outpath partly ordering from v. This resultimproves a theorem about outpaths in semicomplete multipartite digraphs obtained by Guo in 1999.展开更多
In this paper we prove that if T is a regular n-partite tournament with n ≥ 4, then each arc of T lies on a cycle whose vertices are from exactly k partite sets for k = 4, 5, . . . ,n. Our result, in a sense, general...In this paper we prove that if T is a regular n-partite tournament with n ≥ 4, then each arc of T lies on a cycle whose vertices are from exactly k partite sets for k = 4, 5, . . . ,n. Our result, in a sense, generalizes a theorem due to Alspach.展开更多
Using the relationship between the resistance, capacitance and current in Hopfield neural network, and the properties of sigmoid function, this paper gives the terse, explicit algebraical criteria of global exponentia...Using the relationship between the resistance, capacitance and current in Hopfield neural network, and the properties of sigmoid function, this paper gives the terse, explicit algebraical criteria of global exponential stability, global asymptotical stability and instability. Then this paper makes clear the essence of the stability that Hopfield defined, and provides a theoretical foundation for the design of a network.展开更多
In this paper, our main aim is to study the existence and uniqueness of the periodic solution of delayed Logistic equation and its asymptotic behavior. In case the coefficients are periodic, we give some sufficient co...In this paper, our main aim is to study the existence and uniqueness of the periodic solution of delayed Logistic equation and its asymptotic behavior. In case the coefficients are periodic, we give some sufficient conditions for the existence and uniqueness of periodic solution. Furthermore, we also study the effect of time-delay on the solution.展开更多
It's very important to dynamically assign the tasks to corresponding actors in workflow management system, especially in complex applications. This improves the flexibility of workflow systems. In this paper, a ro...It's very important to dynamically assign the tasks to corresponding actors in workflow management system, especially in complex applications. This improves the flexibility of workflow systems. In this paper, a role-based workflow model with fuzzy optimized intelligent assignment is proposed and applied in the investment management system. A groupware-based software model is also proposed.展开更多
基金Supported by National Natural Science Foundation of P. R. China (60274014)Specialized Research Fund for the Doctoral Program of Higher Education (20020487006)Education Ministry's Key Laboratory Foundation for Intelligent Manufacture Technology ( Imstsu-2002-03)
摘要In this paper, we use the matrix measure technique to study stable fault-tolerance control of networked control systems. State feedback networked control systems with the network-induced delay, parameter uncertainties, sensor failures and actuator failures are considered. State feedback gain K is designed for any invariant delay τ, and some theorems and sufficient conditions for stable fault-tolerance control are given. Example is presented to illustrate the effectiveness of these theorems.
摘要This paper is concerned with delay dependent absolute stability for a class of uncertain Lur′e systems with multiple time-delays. By using a descriptor model transformation of the sys-tem and by applying a recent result on bounding of cross products of vectors, a new type of Lya-punov-Krasovskii functional is constructed. Based on the new functional, delay-dependent suffi-cient conditions for absolute stability are derived in terms of linear matrix inequalities. These con-ditions do not require any parameter tuning, and can be solved numerically using the software LMI Lab. A numerical example is presented which shows that the proposed method can substantiallyimprove the delay bound for absolute stability of Lur′e system with time-delays, compared to theexisting ones.
基金This work was supported by the National Natural Science Foundation of China (No. 10461001).
摘要This paper considers the guaranteed cost control problem for a class of uncertain linear systems with both state and input delays. By representing the time-delay system in the descriptor system form and using a recent result on bounding of cross products of vectors, we obtain new delay-dependent sufficient conditions for the existence of the guaranteed cost controller in terms of linear matrix inequalities. Two examples are presented which show the effectiveness of our approach.
基金This work was supported by the National Natural Science Foundation(No.60274007)the Doctoral Foundation of Education Ministry(No.20010487005)the Academic Foundation of Naval University of Engineering(No.E988).
摘要The stabilization using a stable compensator does not introduce additional unstable zeros into the closed-loop transfer function beyond those of the original plant, so it is a desirable compensator, the price is that the compensator’s order will go up. This note considered the order of stable compensators for a class of time-delay systems. First, it is shown that for single-loop plants with at most one real right-half plane zero, a special upper bound for the minimal order of a strongly stabilizing compensator can be obtained in terms of the plant order; Second, it is shown that approximate unstable pole-zero cancellation does not occur, and the distances between distinct unstable zeroes are bounded below by a positive constant, then it is possible to find an upper bound for the minimal order of a strongly stabilizing compensator.
摘要This study presented an off-line identification method of induction motor (IM) parameters. Before startup,the inverter drive performed automatically a modified DC test, a locked-rotor test, a no-load test and a step-voltage test to identify all the parameters of an induction motor. No manual operation and speed signals were required in the process. In order to obtain effective messages and improve the accuracy of identification, the discrete fast Fourier transform (DFFT) and the least-squares were used to process the signals of currents and voltages. A phase-voltage measuring method for motors was also proposed, which measured directly the actual conducting time of three upper switches in the inverter without need for a dead-time compensator. The validity, reliability and accuracy of the presented methods have been verified by the experiments on a VSI-fed IM drive system.
基金This project was supported by the National Natural Science Foundation of China the Open Project Foundation of Comput-er Software New Technique National Key Laboratory of Nanjing University.
摘要This paper presents a new hybrid genetic algorithm for the vertex cover problems in which scan-repair and local improvement techniques are used for local optimization. With the hybrid approach, genetic algorithms are used to perform global exploration in a population, while neighborhood search methods are used to perform local exploitation around the chromosomes. The experimental results indicate that hybrid genetic algorithms can obtain solutions of excellent quality to the problem instances with different sizes. The pure genetic algorithms are outperformed by the neighborhood search heuristics procedures combined with genetic algorithms.
摘要Let G be a 3-connected graph with n vertices. The paper proves that if for each pair of vertices u and v of G, d(u,v)=2, has |N(u)∩N(v)|≤α(α is the minimum independent set number), and then max{d(u),d(v)}≥n+12, then G is a Hamilton connected graph.
摘要Sticker model is one of the basic models in the DNA computer models.This model is coded with sin-gle-double stranded DNA molecules.It has the following ad-vantages that the operations require no strands extension and use no enzymes; Whats more, the materials are reusable. Therefore it arouses attention and interest of scientists in many fields. In this paper, we will systematically analyze the theories and applications of the model,summarize other sci-entists contributions in this field,and propose our research results.This paper is the theoretical portion of the sticker model on DNA computer, which includes the introduction of the basic model of sticker computing. Firstly, we systemati-cally introduce the basic theories of classic models about sticker computing; Secondly, we discuss the sticker system which is an abstract computing model based on the sticker model and formal languages; Finally, extend and perfect the model,and present two types of models that are more exten-sive in the applications and more perfect in the theory than the past models: one is the so-called k-bit sticker model,the other is full-message sticker DNA computing model.
基金This work was partially supported by the National Natural Science Foundation of China (Grant No. 69971018).
摘要The relationships between artificial neural networks and graph theory are considered in detail. The applications of artificial neural networks to many difficult problems of graph theory, especially NP-complete problems, and the applications of graph theory to artificial neural networks are discussed. For example graph theory is used to study the pattern classification problem on the discrete type feedforward neural networks, and the stability analysis of feedback artificial neural networks etc.
基金Supported partially by the National Natural Science Foundation of China(Grant No.10371048)
摘要An excellent introduction to the topic of poset matroids is due to M.Barnabei, G. Nicoletti and L. Pezzoli. On the basis of their work, we have obtained the global rankaxioms for poset matroids. In this paper, we study the special integral function f and obtain a newclass of poset matroids from the old ones, and then we generalize this result according to theproperties of f. Almost all of these results can be regarded as the application of global rankaxioms for poset matroids. The main results in our paper have, indeed, investigated the restrictionof the basis of the poset matroid, and we give them the corresponding geometric interpretation.
摘要An outpath of a vertex v in a digraph is a path starting at v such that vdominates the end vertex of the path only if the end vertex also dominates v. First we show thatletting D be a strongly connected semicomplete c-partite digraph (c ≥ 3), and one of the partitesets of it consists of a single vertex, say v, then D has a c-pancyclic partial ordering from v,which generalizes a result about pancyclicity of multipartite tournaments obtained by Gutin in 1993.Then we prove that letting D be a strongly connected semicomplete c-partite digraph with c ≥ 3 andletting v be a vertex of D, then D has a (c - 1)-pan-outpath partly ordering from v. This resultimproves a theorem about outpaths in semicomplete multipartite digraphs obtained by Guo in 1999.
基金supported by Chinese Postdoctoral Science FoundationNational Natural Science Foundation of China(Grant Nos.60103021,10171062 and 19871040)Huazhong University of Science and Technology Foundation
摘要In this paper we prove that if T is a regular n-partite tournament with n ≥ 4, then each arc of T lies on a cycle whose vertices are from exactly k partite sets for k = 4, 5, . . . ,n. Our result, in a sense, generalizes a theorem due to Alspach.
摘要Using the relationship between the resistance, capacitance and current in Hopfield neural network, and the properties of sigmoid function, this paper gives the terse, explicit algebraical criteria of global exponential stability, global asymptotical stability and instability. Then this paper makes clear the essence of the stability that Hopfield defined, and provides a theoretical foundation for the design of a network.
摘要In this paper, our main aim is to study the existence and uniqueness of the periodic solution of delayed Logistic equation and its asymptotic behavior. In case the coefficients are periodic, we give some sufficient conditions for the existence and uniqueness of periodic solution. Furthermore, we also study the effect of time-delay on the solution.
摘要It's very important to dynamically assign the tasks to corresponding actors in workflow management system, especially in complex applications. This improves the flexibility of workflow systems. In this paper, a role-based workflow model with fuzzy optimized intelligent assignment is proposed and applied in the investment management system. A groupware-based software model is also proposed.