首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1篇
  国内免费   1篇
  完全免费   3篇
  自动化技术   5篇
  2018年   1篇
  2008年   1篇
  2006年   1篇
  2005年   2篇
排序方式: 共有5条查询结果,搜索用时 109 毫秒
1
1.
Chua电路全局同步的新结果   总被引:1,自引:0,他引:1       下载免费PDF全文
Some new results on global exponential synchronization and global synchronization for Chua‘s circuit are derived by means of Lyapunov functions and some other mathematic methods,which improve the existing results in the literatures. A strict and complete proof of the result is also given as a complement to the relevant literature where the proof was incomplete. The paper offer ssome new approaches for studying chaos synchronization for Chua‘s circuit.  相似文献
2.
Some new results on global exponential synchronization and global synchronization for Chua's circuit are derived by means of Lyapunov functions and some other mathematic methods, which improve the existing results in the literatures. A strict and complete proof of the result is also given as a complement to the relevant literature where the proof was incomplete. The paper offers some new approaches for studying chaos synchronization for Chua's circuit.  相似文献
3.
彭华  邓亚平 《计算机工程与设计》2006,27(21):4022-4024,4032
TCP Westwood(TCPW)和Vegas都是基于测量的TCP增强算法。TCPW针对ACK流估算可用带宽,在无线网络领域已经表现出了较为明显的优越性,但是TCPW在慢启动和线性递增部分依然采用传统Reno的盲目递增的机制,导致发送端较为频繁的重传。通过对这两种算法的研究,提出一种增强算法,可以明显减少分组重传,提高有效吞吐量,去除TCP全局同步现象,更有效的利用瓶颈带宽。并通过网络仿真工具NS2验证了其在吞吐量,丢失率等方面的增强性能。  相似文献
4.
采用单向耦合同步法,利用Lyapunov稳定性定理、全局同步法及最大Lyapunov指数法分别对Lorenz系统、变形耦合发电机系统及超混沌Chen系统的自同步进行了研究.为适用于混沌保密通信,使用单路信号实现了驱动系统与响应系统的同步,并给出将超混沌Chen系统的自同步用于混沌掩盖保密通信的具体例子.数值模拟验证了所给方案的有效性.  相似文献
5.
This paper studies semiglobal and global state synchronization of homogeneous multiagent systems with partial‐state coupling (ie, agents are coupled through part of their states) via a static protocol. We consider 2 classes of agents, ie, G‐passive and G‐passifiable via input feedforward, which are subjected to input saturation. The proposed static protocol is purely decentralized, ie, without an additional channel for the exchange of controller states. For semiglobal synchronization, a static protocol is designed for an a priori given set of network graphs with a directed spanning tree. In other words, the static protocol only needs rough information on the network graph, ie, a lower bound for the real part and an upper bound for the modulus, of the nonzero eigenvalues of the corresponding Laplacian matrix. Whereas for global synchronization, only strongly connected and detailed balanced network graphs are considered. In this case, for G‐passive agents, the static protocol does not need any network information, whereas for G‐passifiable agents via input feedforward, the static protocol only needs an upper bound for the modulus of the eigenvalues of the corresponding Laplacian matrix.  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号