首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   22篇
  免费   0篇
化学工业   2篇
无线电   2篇
一般工业技术   1篇
冶金工业   1篇
自动化技术   16篇
  2015年   1篇
  2014年   2篇
  2013年   2篇
  2012年   2篇
  2008年   1篇
  2007年   1篇
  2003年   1篇
  1999年   1篇
  1995年   1篇
  1984年   1篇
  1983年   1篇
  1981年   2篇
  1978年   1篇
  1976年   1篇
  1974年   1篇
  1972年   2篇
  1969年   1篇
排序方式: 共有22条查询结果,搜索用时 15 毫秒
21.
This paper proposes new stability analysis and convergence results applied to the Iterative Feedback Tuning (IFT) of a class of Takagi–Sugeno–Kang proportional-integral-fuzzy controllers (PI-FCs). The stability analysis is based on a convenient original formulation of Lyapunov’s direct method for discrete-time systems dedicated to discrete-time input affine Single Input-Single Output (SISO) systems. An IFT algorithm which sets the step size to guarantee the convergence is suggested. An inequality-type convergence condition is derived from Popov’s hyperstability theory considering the parameter update law as a nonlinear dynamical feedback system in the parameter space and iteration domain. The IFT-based design of a low-cost PI-FC is applied to a case study which deals with the angular position control of a direct current servo system laboratory equipment viewed as a particular case of input affine SISO system. A comparison of the performance of the IFT-based tuned PI-FC and the performance of the PI-FC tuned by an evolutionary-based optimization algorithm shows the performance improvement and advantages of our IFT approach to fuzzy control. Real-time experimental results are included.  相似文献   
22.
We previously proved that almost all words of length n over a finite alphabet A with m letters contain as factors all words of length k(n) over A as n→∞, provided limsupn→∞ k(n)/log n<1/log m.

In this note it is shown that if this condition holds, then the number of occurrences of any word of length k(n) as a factor into almost all words of length n is at least s(n), where limn→∞ log s(n)/log n=0. In particular, this number of occurrences is bounded below by C log n as n→∞, for any absolute constant C>0.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

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