全文获取类型
收费全文 | 496篇 |
免费 | 176篇 |
国内免费 | 38篇 |
出版年
2024年 | 3篇 |
2023年 | 3篇 |
2022年 | 20篇 |
2021年 | 18篇 |
2020年 | 27篇 |
2019年 | 9篇 |
2018年 | 15篇 |
2017年 | 14篇 |
2016年 | 14篇 |
2015年 | 27篇 |
2014年 | 29篇 |
2013年 | 48篇 |
2012年 | 46篇 |
2011年 | 55篇 |
2010年 | 49篇 |
2009年 | 51篇 |
2008年 | 55篇 |
2007年 | 31篇 |
2006年 | 28篇 |
2005年 | 30篇 |
2004年 | 30篇 |
2003年 | 7篇 |
2002年 | 9篇 |
2001年 | 10篇 |
2000年 | 11篇 |
1999年 | 14篇 |
1998年 | 11篇 |
1997年 | 4篇 |
1996年 | 3篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 8篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1982年 | 1篇 |
排序方式: 共有710条查询结果,搜索用时 62 毫秒
41.
在频率步进雷达中,通常使用逆快速傅里叶变换方法进行高分辨成像。由于逆快速傅里叶变换的距离旁瓣高,有可能造成强散射点旁瓣掩盖附近弱散射点或者弱小目标情况,限制了其在强杂波环境下的使用。为了抑制高距离旁瓣,近年来提出一种基于最小均方误差准则的自适应脉冲压缩方法。基于自适应脉冲压缩算法原理,推导了频率步进雷达距离旁瓣抑制算法。针对静止和运动目标场景,分析自适应脉冲压缩算法的旁瓣抑制性能。仿真结果表明,与逆快速傅里叶变换和加窗逆快速傅里叶变换处理比较,自适应脉冲压缩算法具有更好的旁瓣抑制效果,能够更好地检测强散射点附近的弱散射点或者弱小目标。 相似文献
42.
43.
As a complex system with multiple components usually deteriorates with age, preventive maintenance (PM) is often performed to keep the system functioning in a good state to prolong its effective age. In this study, a nonhomogeneous Poisson process with a power law failure intensity is used to describe the deterioration of a repairable system, and the optimal nonperiodic PM schedule can be determined to minimize the expected total cost per unit time. However, since the determination of such optimal PM policies may involve numerous uncertainties, which typically make the analyses difficult to perform because of the scarcity of data, a Bayesian decision model, which utilizes all available information effectively, is also proposed for determining the optimal PM strategies. A numerical example with a real failure data set is used to illustrate the effectiveness of the proposed approach. The results show that the optimal schedules derived by Bayesian approach are relatively more conservative than that for non‐Bayesian approach because of the uncertainty of the intensity function, and if the intensity function are updated using the collected data set, which indicates more severe deterioration than the prior belief, replacing the entire system instead of frequent PM activities before serious deterioration is suggested. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
44.
This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
45.
46.
47.
48.
49.
国防动员作为一个重大的战略问题,必须适应未来战争和时代需求不断发展变化。本文重点从发展方向、基本平台、主要途径、功能拓展和组织模式上,以灵敏的视角、创新的思维,对全面推进国防动员创新发展进行了较为系统的阐述。 相似文献
50.