The controllability and observability of networked control systems are studied. Aiming at the networked control system with time-varying delay, the sufficient and necessary conditions for complete controllability and ...The controllability and observability of networked control systems are studied. Aiming at the networked control system with time-varying delay, the sufficient and necessary conditions for complete controllability and complete observability of the system are presented, respectively. Because of Markov characteristic of the network-induced delay, in terms of stochastic theory, a sufficient and necessary condition for completely mean value controllability of networked control systems is obtained. Further, the conditions that the controllability and observability of networked control systems are equivalent to the initial time-invariant system are given. Controllability and observability realization indexes are also discussed, respectively. The numerical example demonstrates the effectiveness of the proposed theory.展开更多
A new threshold secret sharing scheme is constructed by introducing the concept of share vector, in which the number of shareholders can be adjusted by randomly changing the weights of them. This kind of scheme overco...A new threshold secret sharing scheme is constructed by introducing the concept of share vector, in which the number of shareholders can be adjusted by randomly changing the weights of them. This kind of scheme overcomes the limitation of the static weighted secret sharing schemes that cannot change the weights in the process of carrying out and the deficiency of low efficiency of the ordinary dynamic weighted sharing schemes for its resending process. Thus, this scheme is more suitable to the case that the number of shareholders needs to be changed randomly during the scheme is carrying out.展开更多
A more general form of projective synchronization, so called linear generalized synchronization （LGS） is proposed, which includes the generalized projective synchronization （GPS） and the hybrid projective synchron...A more general form of projective synchronization, so called linear generalized synchronization （LGS） is proposed, which includes the generalized projective synchronization （GPS） and the hybrid projective synchronization （HPS） as its special cases, Based on the adaptive technique and Lyapunov stability theory, a general method for achieving the LGS between two chaotic or hyperehaotic systems with uncertain parameters in any scaling matrix is presented. Some numerical simulations are provided to show the effectiveness and feasibility of the proposed synchronization method.展开更多
Chain length of closed circle DNA is equal. The same closed circle DNA＇s position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so clos...Chain length of closed circle DNA is equal. The same closed circle DNA＇s position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so closed circle DNA computing model is generalized. For change positive-weighted Hamilton circuit problem, closed circle DNA algorithm is put forward. First, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions are composed. Then, the feasible solutions are filtered out by using group detect experiment, and the optimization solutions are obtained by using group insert experiment and electrophoresis experiment. Finally, all optimization solutions are found by using detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Three dominances of the closed circle DNA algorithm are analyzed, and characteristics and dominances of group delete experiment are discussed.展开更多
A new method on the interval stability of networked control systems （NCSs） with random delay and data packet dropout is studied. Combining interval systems and NCSs, a graphic condition on judging interval stability...A new method on the interval stability of networked control systems （NCSs） with random delay and data packet dropout is studied. Combining interval systems and NCSs, a graphic condition on judging interval stability is presented in terms of the weighted diagraph theory in graph theory. Furthermore, utilizing the graph-theoretic algorithm, the delay-depended controller gains are obtained. Aiming at the same delay and data packed dropout, several controller gains are obtained, simultaneously. The example and simulation illustrate the effectiveness of the proposed method.展开更多
The H∞ output feedback control problem for uncertain discrete-time switched systems is reasearclled. A new characterization of stability and H∞ performance for the switched system under arbitrary switching is obtain...The H∞ output feedback control problem for uncertain discrete-time switched systems is reasearclled. A new characterization of stability and H∞ performance for the switched system under arbitrary switching is obtained by using switched Lyapunov function. Then, based on the characterization, a linear matrix inequality （LMI） approach is developed to design a switched output feedback controller which guarantees the stability and H∞ performance of the closed-loop system. A numerical example is presented to demonstrate the application of the proposed method.展开更多
In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multi...In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoe network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoe network environment. In this paler, we propose and evaluate Reliable Adaptive Multicast Protocol （RAMP） based on a relay node concept. Relay nodes are placed along the multieast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoe network by reducing the number of packet retransmissions. We compare RAMP with SRM （Scalable Reliable Multicast）. Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmsission.展开更多
Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology ch...Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. The multicast routing problem with multiple QoS constraints is discussed, which may deal with the delay, bandwidth and cost metrics, and describes a network model for researching the ad hoc networks QoS multicast routing problem. It presents a distributed QoS multicast routing protocol （DQMRP）. The proof of correctness and complenty analysis of the DQMRP are also given. Simulation results show that the multicast tree optimized by DQMRP is better than other protocols and is fitter for the network situations with frequently changed status and the realtime multimedia application. It is an available approach to multicast routing decision with multiple QoS constraints.展开更多
Ad hoe wireless networks consist of mobile nodes interconnected by multihop communication paths. Unlike conventional wireless networks, ad hoc networks have no fixed network infrastructure or administrative support. D...Ad hoe wireless networks consist of mobile nodes interconnected by multihop communication paths. Unlike conventional wireless networks, ad hoc networks have no fixed network infrastructure or administrative support. Due to bandwidth constraint and dynamic topology of mobile ad hoc networks, supporting Quality of Service （QoS） is an inherently complex, difficult issue and very important research issue. MAODV （Multicast Ad hoc Ondemand Distance Vector） routing protocol provides fast and efficient route establishment between mobile nodes that need to communicate with each other. MAODV has minimal control overhead and route acquisition latency. In addition to unicast routing, MAODV supports multicast and broadcast as well. The multicast routing problem with multiple QoS constraints, which may deal with the delay, bandwidth and packet loss measurements is discussed, and a network model for researching the ad hoc network QoS multicast routing problem is described. It presents a complete solution for QoS multicast routing based on an extension of the MAODV routing protocol that deals with delay, bandwidth and packet loss mesurements. The solution is based on lower layer specifics. Simulation results show that, with the proposed QoS multicast routing protocol, end-to-end delay, bandwidth and packet loss on a route can be improved in most of cases. It is an available approach to multicast routing decision with multiple QoS constraints.展开更多
To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, o...To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, optimum solutions are obtained by sequencing A small job shop scheduling problem is solved in DNA computing, and the ＂operations＂ of the computation were performed with standard protocols, as ligation, synthesis, electrophoresis etc. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.展开更多
基金supported by the National Natural Science Foundation of China(60574011).
文摘The controllability and observability of networked control systems are studied. Aiming at the networked control system with time-varying delay, the sufficient and necessary conditions for complete controllability and complete observability of the system are presented, respectively. Because of Markov characteristic of the network-induced delay, in terms of stochastic theory, a sufficient and necessary condition for completely mean value controllability of networked control systems is obtained. Further, the conditions that the controllability and observability of networked control systems are equivalent to the initial time-invariant system are given. Controllability and observability realization indexes are also discussed, respectively. The numerical example demonstrates the effectiveness of the proposed theory.
基金supported by the National Preeminent Youth Foundation(70225002)the Doctor Foundation of North China Electric Power University(200822029).
文摘A new threshold secret sharing scheme is constructed by introducing the concept of share vector, in which the number of shareholders can be adjusted by randomly changing the weights of them. This kind of scheme overcomes the limitation of the static weighted secret sharing schemes that cannot change the weights in the process of carrying out and the deficiency of low efficiency of the ordinary dynamic weighted sharing schemes for its resending process. Thus, this scheme is more suitable to the case that the number of shareholders needs to be changed randomly during the scheme is carrying out.
基金the National Natural Science Foundation of China (60574045 10661006).
文摘A more general form of projective synchronization, so called linear generalized synchronization （LGS） is proposed, which includes the generalized projective synchronization （GPS） and the hybrid projective synchronization （HPS） as its special cases, Based on the adaptive technique and Lyapunov stability theory, a general method for achieving the LGS between two chaotic or hyperehaotic systems with uncertain parameters in any scaling matrix is presented. Some numerical simulations are provided to show the effectiveness and feasibility of the proposed synchronization method.
基金supported by the National Natural Science Foundation of China(60574041)the Natural ScienceFoundation of Hubei Province(2007ABA407).
文摘Chain length of closed circle DNA is equal. The same closed circle DNA＇s position corresponds to different recognition sequence, and the same recognition sequence corresponds to different foreign DNA segment, so closed circle DNA computing model is generalized. For change positive-weighted Hamilton circuit problem, closed circle DNA algorithm is put forward. First, three groups of DNA encoding are encoded for all arcs, and deck groups are designed for all vertices. All possible solutions are composed. Then, the feasible solutions are filtered out by using group detect experiment, and the optimization solutions are obtained by using group insert experiment and electrophoresis experiment. Finally, all optimization solutions are found by using detect experiment. Complexity of algorithm is concluded and validity of DNA algorithm is explained by an example. Three dominances of the closed circle DNA algorithm are analyzed, and characteristics and dominances of group delete experiment are discussed.
基金partially supported by the National Natural Science Foundation of China (60574011).
文摘A new method on the interval stability of networked control systems （NCSs） with random delay and data packet dropout is studied. Combining interval systems and NCSs, a graphic condition on judging interval stability is presented in terms of the weighted diagraph theory in graph theory. Furthermore, utilizing the graph-theoretic algorithm, the delay-depended controller gains are obtained. Aiming at the same delay and data packed dropout, several controller gains are obtained, simultaneously. The example and simulation illustrate the effectiveness of the proposed method.
基金the National Natural Science Foundation of China (60574083)the Scientific Research Foundation for the Returned Overseas Chinese Scholars (SRF for ROCS),State Education Ministry of China.
文摘The H∞ output feedback control problem for uncertain discrete-time switched systems is reasearclled. A new characterization of stability and H∞ performance for the switched system under arbitrary switching is obtained by using switched Lyapunov function. Then, based on the characterization, a linear matrix inequality （LMI） approach is developed to design a switched output feedback controller which guarantees the stability and H∞ performance of the closed-loop system. A numerical example is presented to demonstrate the application of the proposed method.
文摘In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoe network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoe network environment. In this paler, we propose and evaluate Reliable Adaptive Multicast Protocol （RAMP） based on a relay node concept. Relay nodes are placed along the multieast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoe network by reducing the number of packet retransmissions. We compare RAMP with SRM （Scalable Reliable Multicast）. Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmsission.
基金This project was supported by the National Natural Science Foundation of China (60172035 ,90304018) NSF of HubeiProvince (2004ABA014) and Teaching Research Project of Higher Educational Institutions of Hubei Province (20040231)
文摘Quality of service （QoS） routing and multicasting protocols in ad hoc networks are face with the challenge of delivering data to destinations through multihop routes in the presence of node movements and topology changes. The multicast routing problem with multiple QoS constraints is discussed, which may deal with the delay, bandwidth and cost metrics, and describes a network model for researching the ad hoc networks QoS multicast routing problem. It presents a distributed QoS multicast routing protocol （DQMRP）. The proof of correctness and complenty analysis of the DQMRP are also given. Simulation results show that the multicast tree optimized by DQMRP is better than other protocols and is fitter for the network situations with frequently changed status and the realtime multimedia application. It is an available approach to multicast routing decision with multiple QoS constraints.
基金This project was supported by the National Natural Science Foundation of China (60172035 ,90304018) NSF of HubeiProvince (2004ABA014) and Teaching Research Project of Higher Educational Institutions of Hubei Province (20040231)
文摘Ad hoe wireless networks consist of mobile nodes interconnected by multihop communication paths. Unlike conventional wireless networks, ad hoc networks have no fixed network infrastructure or administrative support. Due to bandwidth constraint and dynamic topology of mobile ad hoc networks, supporting Quality of Service （QoS） is an inherently complex, difficult issue and very important research issue. MAODV （Multicast Ad hoc Ondemand Distance Vector） routing protocol provides fast and efficient route establishment between mobile nodes that need to communicate with each other. MAODV has minimal control overhead and route acquisition latency. In addition to unicast routing, MAODV supports multicast and broadcast as well. The multicast routing problem with multiple QoS constraints, which may deal with the delay, bandwidth and packet loss measurements is discussed, and a network model for researching the ad hoc network QoS multicast routing problem is described. It presents a complete solution for QoS multicast routing based on an extension of the MAODV routing protocol that deals with delay, bandwidth and packet loss mesurements. The solution is based on lower layer specifics. Simulation results show that, with the proposed QoS multicast routing protocol, end-to-end delay, bandwidth and packet loss on a route can be improved in most of cases. It is an available approach to multicast routing decision with multiple QoS constraints.
基金This Project was supported by the National Nature Science Foundation (60274026 ,30570431) China Postdoctoral Sci-ence Foundation Natural +1 种基金Science Foundation of Educational Government of Anhui Province of China Excellent Youth Scienceand Technology Foundation of Anhui Province of China (06042088) and Doctoral Foundation of Anhui University of Scienceand Technology
文摘To solve job shop scheduling problem, a new approach-DNA computing is used in solving job shop scheduling problem. The approach using DNA computing to solve job shop scheduling is divided into three stands. Finally, optimum solutions are obtained by sequencing A small job shop scheduling problem is solved in DNA computing, and the ＂operations＂ of the computation were performed with standard protocols, as ligation, synthesis, electrophoresis etc. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.
