全文获取类型
收费全文 | 2286篇 |
免费 | 610篇 |
国内免费 | 174篇 |
出版年
2024年 | 8篇 |
2023年 | 9篇 |
2022年 | 25篇 |
2021年 | 38篇 |
2020年 | 33篇 |
2019年 | 40篇 |
2018年 | 31篇 |
2017年 | 122篇 |
2016年 | 127篇 |
2015年 | 84篇 |
2014年 | 160篇 |
2013年 | 204篇 |
2012年 | 220篇 |
2011年 | 229篇 |
2010年 | 117篇 |
2009年 | 150篇 |
2008年 | 128篇 |
2007年 | 137篇 |
2006年 | 143篇 |
2005年 | 163篇 |
2004年 | 152篇 |
2003年 | 118篇 |
2002年 | 83篇 |
2001年 | 86篇 |
2000年 | 82篇 |
1999年 | 59篇 |
1998年 | 45篇 |
1997年 | 51篇 |
1996年 | 40篇 |
1995年 | 30篇 |
1994年 | 32篇 |
1993年 | 31篇 |
1992年 | 30篇 |
1991年 | 33篇 |
1990年 | 16篇 |
1989年 | 8篇 |
1988年 | 4篇 |
1987年 | 2篇 |
排序方式: 共有3070条查询结果,搜索用时 15 毫秒
381.
382.
383.
线性调频 (LFM)信号体制的超宽带雷达 (UWBR)系统的相位误差 ,会影响雷达系统脉冲压缩的结果。本文提出的相位梯度 (PG)算法 ,能够有效地估计系统相位误差 ,改善脉冲压缩的性能。 相似文献
384.
R.E. Lillo 《海军后勤学研究》2001,48(3):201-209
An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001 相似文献
385.
两点源干扰是干扰被动雷达导引头 (PRS)的有效手段。但在实际应用中 ,两点源的功率不可能完全相等 ,这就为PRS对抗两点源的干扰提供了契机。通过理论分析和仿真实验证明 ,当两点源偏离导引头的电轴方向不大的情况下 ,只要保证足够的积累点数 ,导引头进行数据积累取均值 ,其结果并不指向两源的“重心”或“质心”而是指向两源中功率较大者 ,并给出了确定积累点数的解析表达式 相似文献
386.
BTT控制系统半实物仿真试验以BTT试验器为背景,配合BTT控制技术研究可全面验证导弹控制系统设计。给出了半实物仿真试验方案、方法及试验结果分析,试验结果表明BTT控制系统设计满足最小侧滑(近似零侧滑角)倾斜转弯的技术指标要求,半实物仿真试验方法正确。 相似文献
387.
复杂热动力装置计算机监控系统设计 总被引:1,自引:0,他引:1
给出了一般复杂热动力装置计算机监控系统的结构方案 ,讨论了系统硬件结构及配置 ,分析了系统软件结构及特点 ,阐述了复杂系统状态参数采集处理的方法以及串行数据通信的实现 ,展望了系统的应用前景和发展趋势 相似文献
388.
采用分层介质膜的等效模型 ,计算了均匀光纤光栅及线性啁啾光栅的反射谱、透射谱及反射相位跃变 ,结果与采用耦合模理论计算的结果相吻合 ,表明这是分析光纤光栅的光反射特性的一种有效的新方法 . 相似文献
389.
Fangruo Chen 《海军后勤学研究》2000,47(5):422-439
Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000 相似文献
390.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献