机构

• 长春光学精密机械与物... [1]
• 武汉物理与数学研究所 [1]
• 中国科学院大学 [1]
• 云南天文台 [1]

采集方式

• OAI收割 [3]
• iSwitch采集 [1]

内容类型

• 期刊论文 [3]
• 会议论文 [1]

发表日期

• 2023 [1]
• 2016 [1]
• 2009 [2]

学科主题

• 天文学 [1]
• 天文学::天体测量学 [1]

筛选

浏览/检索结果: 共4条，第1-4条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序提交时间升序提交时间降序作者升序作者降序发表日期升序发表日期降序 Space Debris Laser Ranging with range-gate-free Superconducting Nanowire Single-Photon Detector 期刊论文  OAI收割 JOURNAL OF THE EUROPEAN OPTICAL SOCIETY-RAPID PUBLICATIONS, 2023, 卷号: 19, 期号: 1 作者:  Zhang HT(张海涛);  Li YQ(李语强);  Li ZL(李祝莲);  Pi XY(皮晓宇);  Yang YZ(杨永章)   |  收藏  |  浏览/下载：53/0  |  提交时间：2023/03/13 Space Debris Laser Ranging  The success probability of DLR  Range-gate-free mode  Superconducting Nanowire Single-Photon Detector   On the modes of the negative binomial distribution of order k 期刊论文  iSwitch采集 Journal of applied statistics, 2016, 卷号: 43, 期号: 11, 页码: 2131-2149 作者:  Shao, Jiguang;  Fu, Sheng 收藏  |  浏览/下载：34/0  |  提交时间：2019/05/09 Negative binomial distribution of order k  Success run  Fibonacci sequence  Transition probability flow graphs  Probability-generating function  Mode   Unconventional Geometric Quantum Computation in a Dissipative Cavity QED System Without the Heating 期刊论文  OAI收割 INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2009, 卷号: 48, 期号: 10, 页码: 2928-2937 作者:  Chen, Chang-Yong;  Kang, Shuai;  Feng, Mang 收藏  |  浏览/下载：18/0  |  提交时间：2015/06/26 Geometric quantum phase gate  Fidelity  Success probability   An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE) 会议论文  OAI收割 2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China 作者:  Wang C. 收藏  |  浏览/下载：14/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.