全文获取类型
收费全文 | 556篇 |
免费 | 212篇 |
国内免费 | 31篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 5篇 |
2021年 | 19篇 |
2020年 | 18篇 |
2019年 | 11篇 |
2018年 | 8篇 |
2017年 | 31篇 |
2016年 | 41篇 |
2015年 | 26篇 |
2014年 | 39篇 |
2013年 | 57篇 |
2012年 | 38篇 |
2011年 | 46篇 |
2010年 | 25篇 |
2009年 | 48篇 |
2008年 | 42篇 |
2007年 | 41篇 |
2006年 | 41篇 |
2005年 | 48篇 |
2004年 | 32篇 |
2003年 | 29篇 |
2002年 | 20篇 |
2001年 | 18篇 |
2000年 | 17篇 |
1999年 | 19篇 |
1998年 | 23篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 6篇 |
1993年 | 5篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 18篇 |
1989年 | 2篇 |
排序方式: 共有799条查询结果,搜索用时 62 毫秒
51.
针对多径信道条件下,偏移正交幅度调制的正交频分复用(OQAM/OFDM)系统中采用导频序列方式进行信道估计时导频开销较大的问题,提出一种基于压缩感知的离散导频信道估计方法。该方法利用无线信道的稀疏特性,建立基于压缩感知的OQAM/OFDM系统信道估计模型,对离散导频结构进行了优化设计,使较少的导频符号随机分布在子载波上,在接收端利用信号恢复算法实现信道估计。该方法能够显著减少导频数量,并实现高精度信道估计性能,通过实验仿真对比验证了所提方法在慢时变和快时变的无线信道条件下的有效性。 相似文献
52.
直瞄射击方式是目前坦克采用的主要射击方式。直瞄射击方式受战场通视度及瞄准装置视距的影响,最大射击距离一般在5 km左右。间瞄射击方式不需要直接瞄准目标,不受战场通视度的影响,最大射击距离主要取决于火炮及弹药的性能,一般在10 km以上。未来坦克应具备直瞄射击与间瞄射击一体化能力。通过直瞄/间瞄射击火控技术的对比与分析,提出坦克直瞄/间瞄射击一体化火控方案。一体化火控具有新的技术特色,具有更强的综合作战能力,是未来坦克火控技术发展的一种趋势。 相似文献
53.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
54.
Sheldon M. Ross 《海军后勤学研究》2015,62(8):659-663
There are n customers that need to be served. Customer i will only wait in queue for an exponentially distributed time with rate λi before departing the system. The service time of customer i has distribution Fi, and on completion of service of customer i a positive reward ri is earned. There is a single server and the problem is to choose, after each service completion, which currently in queue customer to serve next so as to maximize the expected total return. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 659–663, 2015 相似文献
55.
56.
57.
基于STK/X的航天器悬停应用仿真技术 总被引:1,自引:0,他引:1
针对基于STK/Connect典型模式航天仿真时需要同时启动STK软件的局限,在对STK/X组件技术进行深入研究的基础上,采用基于STK/X的仿真模式,通过STK/X组件提供的接口函数和相关交互命令,将STK引擎集成至航天器悬停应用仿真中,从而实现应用程序对仿真场景的控制与调用,并通过分析处理单元对通过交互所获取的STK场景中仿真数据的处理,对航天器悬停应用仿真效能进行了分析。该集成不仅充分利用了STK强大的轨道仿真能力,还有效提高了仿真程序整体效率。 相似文献
58.
59.
采用固态粉压型Ag/AgC1电极对参数已知的水下低频交流电场进行探测.通过改变水中电场信号的特征参数进行对比实验,以检测电极对信号频率和幅值的响应特性.实验结果表明:发射信号在0~4 Hz、15~35 mV的范围内时,Ag/AgCl电极的探测灵敏度随发射信号幅值的增加而增强,并且探测信号能够真实地反映发射信号的频率特征.最后,提出了电场探测电极的响应性能的表征参数. 相似文献
60.
In scheduling problems with two competing agents, each one of the agents has his own set of jobs to be processed and his own objective function, and both share a common processor. In the single‐machine problem studied in this article, the goal is to find a joint schedule that minimizes the total deviation of the job completion times of the first agent from a common due‐date, subject to an upper bound on the maximum deviation of job completion times of the second agent. The problem is shown to be NP‐hard even for a nonrestrictive due‐date, and a pseudopolynomial dynamic program is introduced and tested numerically. For the case of a restrictive due‐date (a sufficiently small due‐date that may restrict the number of early jobs), a faster pseudopolynomial dynamic program is presented. We also study the multiagent case, which is proved to be strongly NP‐hard. A simple heuristic for this case is introduced, which is tested numerically against a lower bound, obtained by extending the dynamic programming algorithm. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 1–16, 2014 相似文献