QQ客服 官方微博 反馈留言

浏览/检索结果: 共7条，第1-7条 帮助 限定条件 专题：长春光学精密机械与物理研究所    第一署名单位    第一作者单位    通讯作者单位     已选(0)清除 条数/页：5101520253035404550556065707580859095100   排序方式：请选择作者升序作者降序题名升序题名降序发表日期升序发表日期降序提交时间升序提交时间降序 Robust disturbance observer-based fast maneuver method for attitude control of optical remote sensing satellites 期刊论文 Acta Astronautica, 2022, 卷号: 201, 页码: 83-93 作者:  Y. Y. Qu;  X. Zhong;  F. Zhang;  X. Tong;  L. D. Fan and L. Dai 收藏  |  浏览/下载：2/0  |  提交时间：2023/06/14 Construction of the Evaluation Index System of Physical Education Teaching in Colleges and Universities Based on Scientific Knowledge Graph 期刊论文 Mobile Information Systems, 2022, 卷号: 2022, 页码: 11 作者:  C. Wang and S. S. Xu 收藏  |  浏览/下载：0/0  |  提交时间：2023/06/14 光刻投影物镜像质分析及补偿研究 学位论文 博士: 中国科学院大学, 2015 作者:  杨旺 收藏  |  浏览/下载：28/0  |  提交时间：2015/11/30 光学设计  光刻投影物镜  波像差  畸变  杂散光   Establishment of image model for on-board space camera 期刊论文 Guangxue Jingmi Gongcheng/Optics and Precision Engineering, 2015, 卷号: 23, 期号: 7, 页码: 1852-1858 作者:  Li, X.-S.;  J.-Y. Ren;  J.-W. Ren;  X.-X. Zhang and C.-X. Xue 收藏  |  浏览/下载：10/0  |  提交时间：2016/08/24 An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE) 会议论文 2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China Yang Q.; Zhang C.; Wang C. 收藏  |  浏览/下载：12/0  |  提交时间：2013/03/25 Task Assignment Problems (TAPs) in distributed computer system are general NP-hard and usually modeled as integer programming discrete problems. Many algorithms are proposed to resolve those problems. Discrete particle swarm algorithm (DPS) is a newly developed method to solve constraint satisfaction problem (CSP) which has advantage on search capacity and can find more solutions. We proposed an improved DPS to solve TAP in this paper. DPS has a special operator namely coefficient multiplying speed  which is designed for CSP but does not exist in other discrete problems. Thus we redefined a coefficient multiplying speed operator with probability selection. We analyzed the speed and position updating formula then we derived a refined position updating formula. Several experiments are carried out to test our DPS. Experimental results show that our algorithm has more efficient search capacity  higher success rate  less running time and more robust.   A comparative study of discrete differential evolution on binary constraint satisfaction problems (EI CONFERENCE) 会议论文 2008 IEEE Congress on Evolutionary Computation, CEC 2008, June 1, 2008 - June 6, 2008, Hong Kong, China Yang Q. 收藏  |  浏览/下载：57/0  |  提交时间：2013/03/25 There are some variants and applications of the discretization of differential evolution. Performances of discrete differential evolution algorithms on random binary constraint satisfaction problem are studied in this paper  and a novel discrete differential evolution algorithm based on exchanging elements is proposed. We compare the proposed discrete differential evolution  evolutionary algorithms and discrete particle swarm optimization on random binary constraint satisfaction problems. Experimental results indicate though the proposed algorithm is simpler  it is competitive with other evolutionary algorithms solving constraint satisfaction problems. 2008 IEEE.   A Comparative Study of Discrete Differential Evolution on Binary Constraint Satisfaction Problems 会议论文 2008 Yang Q. Y.; Ieee 收藏  |  浏览/下载：5/0  |  提交时间：2013/03/28