中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页
机构
成果
学者
登录
注册
登陆
×
验证码:
换一张
忘记密码?
记住我
×
校外用户登录
CAS IR Grid
机构
长春光学精密机械与物... [3]
自动化研究所 [1]
采集方式
OAI收割 [4]
内容类型
会议论文 [3]
期刊论文 [1]
发表日期
2019 [1]
2012 [1]
2011 [1]
2007 [1]
学科主题
筛选
浏览/检索结果:
共4条,第1-4条
帮助
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
题名升序
题名降序
提交时间升序
提交时间降序
作者升序
作者降序
发表日期升序
发表日期降序
Neural Dynamics for Control of Industrial Agitator Tank With Rapid Convergence and Perturbations Rejection
期刊论文
OAI收割
IEEE ACCESS, 2019, 卷号: 7, 页码: 102941-102950
作者:
Duan, Wenhui
;
Xiao, Xiuchun
;
Fu, Dongyang
;
Yan, Jingwen
;
Liu, Mei
  |  
收藏
  |  
浏览/下载:34/0
  |  
提交时间:2019/12/16
Chemical industry
automatic control
control design
neural dynamics method
rapid convergence
perturbations rejection
A new algorithm for solving the best-fit sphere of optical aspherical surface (EI CONFERENCE)
会议论文
OAI收割
2nd International Conference on Advances in Materials and Manufacturing, ICAMMP 2011, December 16, 2011 - December 18, 2011, Guilin, China
作者:
Lin J.
;
Lu M.
收藏
  |  
浏览/下载:48/0
  |  
提交时间:2013/03/25
To solve the best-fit sphere (BFS) accurately is one of the technological keys for the generating and testing of optical aspherical surfaces. This paper presents a new algorithm for solving the BFS of aspherical surfaces to suppress some deficiencies in the existing BFS algorithms. In the proposed approach
it is not only suitable for the conic surface
a BFS is constructed
but also for higher order aspheres. The obtained asphericity and material removal function is more suitable for the machining and test. (2012) Trans Tech Publications
which passes through both sides of endpoints in the section o -?xy of the aspherical surfaces
Switzerland.
the center of the BFS is shifted along the x-axis
and its radius of curvature is automatically computed. The variable step size method is proposed to speed up the convergence of the iteration. Through numerically solving the BFS of conic and cubic surface
the advantages of the proposed approach are verified. The results show that the proposed approach is of rapid convergence
and high accuracy
Study on image real-time interpretation based on particle filter (EI CONFERENCE)
会议论文
OAI收割
2011 International Conference on Mechatronic Science, Electric Engineering and Computer, MEC 2011, August 19, 2011 - August 22, 2011, Jilin, China
作者:
Liu S.-J.
收藏
  |  
浏览/下载:35/0
  |  
提交时间:2013/03/25
In order to satisfy to the real-time requirement of image interpretation system in photoelectric measurement equipments
a kind of hardware acceleration system with MIMD distributed multi-processor architecture based on SOPC technology is designed. The particle filter algorithm is proposed to process image interpretation for state estimation problem of nonlinear and non-Gaussian system. This algorithm does not involve conventional linearization transform
and has approximated the posterior probability density by a set of discrete particles. Therefore the approximate optimum result is educed. It has a high accuracy and a rapid convergence. Experimental results show that the algorithm be adequate to real time
accuracy and robustness
meets the requirement of image interpretation and possesses practical significance for engineering applications. 2011 IEEE.
An improved discrete particle swarm optimization algorithm for TSP (EI CONFERENCE)
会议论文
OAI收割
2007 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2007, November 2, 2007 - November 5, 2007, Silicon Valley, CA, United states
作者:
Wang Y.
;
Wang Y.
;
Wang Y.
;
Wang Y.
;
Wang Y.
收藏
  |  
浏览/下载:35/0
  |  
提交时间:2013/03/25
An Improved discrete particle swarm optimization (DPSO)-based algorithm for the traveling salesman problem (TSP) is proposed. In order to overcome the problem of premature convergence
a novel depressor is proposed and a diversity measure to control the swarm is also introduced which can be used to switch between the attractor and depressor. The proposed algorithm has been applied to a set of benchmark problems and compared with the existing algorithms for solving TSP using swarm intelligence. The results show that it can prevent premature convergence to a high degree
but still keeps a rapid convergence like the basic DPSO. 2007 IEEE.