The distributed leader-following consensus for nonlinear multi-agent systems in strict-feedback forms is investigated under directed topology. Firstly, each follower node is modeled by an integrator incorporating with...The distributed leader-following consensus for nonlinear multi-agent systems in strict-feedback forms is investigated under directed topology. Firstly, each follower node is modeled by an integrator incorporating with nonlinear dynamics. The leader node is modeled as an autonomous nonlinear system which sends its information to one or more followers. Then, a simple and novel distributed protocol is proposed based only on the state feedback, under which the states of the followers ultimately synchronize to the leader. By using Lyapunov stability theorem and matrix theory, it is proved that the distributed leader-following consensus of nonlinear multi-agent systems with strict-feedback form is guaranteed by Lipschitz continuous control laws. Finally, some numerical simulations are provided to show the effectiveness of the developed method.展开更多
The key problem of securing multieast is to generate, distribute and update Session Encryption Key（SEK）. Polynomial expansion with multi-seed （MPE） scheme is an approach which is based on Polynomial expansion （PE...The key problem of securing multieast is to generate, distribute and update Session Encryption Key（SEK）. Polynomial expansion with multi-seed （MPE） scheme is an approach which is based on Polynomial expansion （PE） scheme and overcomes PE＇s shortage. Its operation is demonstrated by using multi-seed, the group member is partitioned to many subgroups. While updating the SEK, computation is needed only in one of subgroups, the other of them will use the computation history to update their SEK. The key problems to design a MPE scheme application includes to find a feasible one way function as well as to generate a Strict Prime Number （SPN）. Those technologies with multi-seed and computation history concepts make MPE as a good choice in practical applications. A prototype test system is designed and solutions of all above mentioned problems are included in this proposed paper.展开更多
In the light of multi-continued fraction theories, we make a classification and counting for multi-strict continued fractions, which are corresponding to multi-sequences of multiplicity m and length n. Based on the ab...In the light of multi-continued fraction theories, we make a classification and counting for multi-strict continued fractions, which are corresponding to multi-sequences of multiplicity m and length n. Based on the above counting, we develop an iterative formula for computing fast the linear complexity distribution of multi-sequences. As an application, we obtain the linear complexity distributions and expectations of multi-sequences of any given length n and multiplicity m less than 12 by a personal computer. But only results of m=3 and 4 are given in this paper.展开更多
基金National Natural Science Foundation of China(No.61374024)
文摘The distributed leader-following consensus for nonlinear multi-agent systems in strict-feedback forms is investigated under directed topology. Firstly, each follower node is modeled by an integrator incorporating with nonlinear dynamics. The leader node is modeled as an autonomous nonlinear system which sends its information to one or more followers. Then, a simple and novel distributed protocol is proposed based only on the state feedback, under which the states of the followers ultimately synchronize to the leader. By using Lyapunov stability theorem and matrix theory, it is proved that the distributed leader-following consensus of nonlinear multi-agent systems with strict-feedback form is guaranteed by Lipschitz continuous control laws. Finally, some numerical simulations are provided to show the effectiveness of the developed method.
基金Supported by the National Natural Science Foun-dation of China (60473072)
文摘The key problem of securing multieast is to generate, distribute and update Session Encryption Key（SEK）. Polynomial expansion with multi-seed （MPE） scheme is an approach which is based on Polynomial expansion （PE） scheme and overcomes PE＇s shortage. Its operation is demonstrated by using multi-seed, the group member is partitioned to many subgroups. While updating the SEK, computation is needed only in one of subgroups, the other of them will use the computation history to update their SEK. The key problems to design a MPE scheme application includes to find a feasible one way function as well as to generate a Strict Prime Number （SPN）. Those technologies with multi-seed and computation history concepts make MPE as a good choice in practical applications. A prototype test system is designed and solutions of all above mentioned problems are included in this proposed paper.
基金the National Natural Science Foundation of China (Grants Nos. 60173016 and 90604011)
文摘In the light of multi-continued fraction theories, we make a classification and counting for multi-strict continued fractions, which are corresponding to multi-sequences of multiplicity m and length n. Based on the above counting, we develop an iterative formula for computing fast the linear complexity distribution of multi-sequences. As an application, we obtain the linear complexity distributions and expectations of multi-sequences of any given length n and multiplicity m less than 12 by a personal computer. But only results of m=3 and 4 are given in this paper.
