全文获取类型
收费全文 | 154篇 |
免费 | 76篇 |
国内免费 | 7篇 |
出版年
2023年 | 1篇 |
2022年 | 3篇 |
2021年 | 6篇 |
2020年 | 9篇 |
2019年 | 9篇 |
2018年 | 5篇 |
2017年 | 6篇 |
2016年 | 17篇 |
2015年 | 4篇 |
2014年 | 12篇 |
2013年 | 19篇 |
2012年 | 10篇 |
2011年 | 17篇 |
2010年 | 17篇 |
2009年 | 6篇 |
2008年 | 10篇 |
2007年 | 8篇 |
2006年 | 11篇 |
2005年 | 11篇 |
2004年 | 16篇 |
2003年 | 2篇 |
2002年 | 6篇 |
2001年 | 5篇 |
2000年 | 2篇 |
1999年 | 4篇 |
1998年 | 7篇 |
1997年 | 3篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 6篇 |
1993年 | 2篇 |
1990年 | 1篇 |
排序方式: 共有237条查询结果,搜索用时 31 毫秒
81.
GPS载体姿态测量中的整周模糊度的快速求解 总被引:1,自引:1,他引:0
全球定位系统 (GPS)的良好性能和便宜的价格为其在姿态测量领域的应用开辟了广阔的前景 ,GPS载体姿态测量技术也成为 GPS应用中的热门研究方向。以利用 GPS载波相位测量来确定载体姿态为背景 ,介绍了 GPS载波相位差分技术的基本原理 ,并针对其中的关键技术问题——载波相位整周模糊度的快速解算 ,叙述和建立了整周模糊度快速解算的具体方法。详细地介绍了载体姿态测量系统中基线的构置方案和求解载体姿态的基本算法 ,即利用基线长确定整周模糊度的初始解集 ,然后利用约束条件来剔除解集中的假解。 相似文献
82.
We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001 相似文献
83.
In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017 相似文献
84.
以太阳帆在20年内飞行至距离太阳200 AU以远进行星际探测为目标,研究太阳帆通过行星借力和太阳借力的轨道全局优化问题。建立太阳帆时间最优转移轨道数学模型,分析行星借力和太阳借力的约束条件,并用这些约束条件构造目标函数,从而将轨道优化的四点边值问题转化为求解无约束条件下的多变量优化问题。通过选取合理的约束权重,采用遗传算法获得大范围的粗略解,代入到序列二次规划算法中获得高精度解。仿真结果表明,虽然太阳帆通过太阳借力已获得相当大的加速度,但加上木星借力仍然可以节省相当多的飞行时间。提出的轨道优化思路,可以为太阳系逃逸任务轨道初步设计提供参考。 相似文献
85.
86.
对于高动态条件下GPS(global positioning system)接收机的抗干扰问题,研究等距线阵接收信号模型和基于协方差矩阵扩张的基本原理,并仿真分析了2种基于协方差矩阵扩张的经典抗干扰算法:Mailloux算法和Zatman算法在高动态环境下的作用效果。经过Matlab仿真,结果表明,相比与常规方法,Mailloux方法和Zatman方法在阵元是等距线阵时,都能有效地加宽从干扰方向上形成的零陷,能够提高在高动态环境下的抗干扰效果,使接收机能够捕获卫星信号。 相似文献
87.
Non‐preemptive scheduling of n independent jobs on m unrelated machines so as to minimize the maximal job completion time is considered. A polynomial algorithm with the worst‐case absolute error of min{(1 ? 1/m)pmax, p} is presented, where pmax is the largest job processing time and p is the mth element from the non‐increasing list of job processing times. This is better than the earlier known best absolute error of pmax. The algorithm is based on the rounding of acyclic multiprocessor distributions. An O(nm2) algorithm for the construction of an acyclic multiprocessor distribution is also presented. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
88.
We consider the problem of maximizing the number of on‐time jobs on two uniform parallel machines. We show that a straightforward extension of an algorithm developed for the simpler two identical parallel machines problem yields a heuristic with a worst‐case ratio bound of at least . We then show that the infusion of a “look ahead” feature into the aforementioned algorithm results in a heuristic with the tight worst‐case ratio bound of , which, to our knowledge, is the tightest worst‐case ratio bound available for the problem. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006 相似文献
89.
成礼智 《国防科技大学学报》1993,15(4):91-95
本文建立了运算量级为O(nlog_2m) 的多项式快速除法(其中,m,n分别为除式与被除式的多项式次数),把点数n+1为2的幂次的多项式快速插值推广到n+1为任意数情形,提出了运算量级为O (n log_2~2n) 的快速插值算法。 相似文献
90.
Kevin D. Stringer 《Small Wars & Insurgencies》2013,24(1):142-169
Given the nature of global counterinsurgency operations, the demands of military expansion, and the need for cultural, linguistic, and regional expertise, the United States Army should evaluate the establishment of US-led foreign troop units for its evolving force structure. This article proposes the creation of an American foreign legion based upon the recruitment of US-led, ethnically homogeneous tribal force units to meet the grist mill of counterinsurgency operations. This structured approach would be more beneficial than the current reliance on a de facto American Foreign Legion, represented by private military contractors (PMCs), many of them comprised of foreigners. These PMCs carry a number of oversight, accountability, and legal risks not found in a fully integrated, and US-officered foreign legion. The British Brigade of Gurkhas, the South-West African Police Counter-Insurgency Unit (Koevoet), and the Kit Carson Scouts serve as relevant historical examples where foreign troops were used to supplement national manpower resources. 相似文献