全文获取类型
收费全文 | 507篇 |
免费 | 161篇 |
国内免费 | 33篇 |
出版年
2024年 | 2篇 |
2023年 | 5篇 |
2022年 | 3篇 |
2021年 | 9篇 |
2020年 | 10篇 |
2019年 | 20篇 |
2018年 | 7篇 |
2017年 | 25篇 |
2016年 | 26篇 |
2015年 | 17篇 |
2014年 | 28篇 |
2013年 | 42篇 |
2012年 | 39篇 |
2011年 | 52篇 |
2010年 | 33篇 |
2009年 | 48篇 |
2008年 | 24篇 |
2007年 | 45篇 |
2006年 | 37篇 |
2005年 | 31篇 |
2004年 | 34篇 |
2003年 | 16篇 |
2002年 | 22篇 |
2001年 | 22篇 |
2000年 | 21篇 |
1999年 | 24篇 |
1998年 | 12篇 |
1997年 | 10篇 |
1996年 | 1篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 7篇 |
1992年 | 6篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 2篇 |
排序方式: 共有701条查询结果,搜索用时 31 毫秒
191.
提出了一种应用准静态技术,结合快速多级子算法计算任意形状的运动目标多普勒信号的方法,对目标的几种典型的微动多普勒信号进行了仿真,并应用高分辨时频分析算法对仿真得到的微多普勒信号进行了分析,提取出了微多普勒瞬时频率,并与相应微动规律的点目标微多普勒瞬时频率进行对比。结果表明,二者具有相同的变化规律,从而证明本文提出的方法是有效的。 相似文献
192.
星地时间同步是卫星导航系统的关键技术,星地双向时间比对能有效提高星地时间同步的精度。在分析了星地距离变化对星地双向时间比对可引起百纳秒量级误差后,提出了前后历元观测数据差分改正方法,通过数学仿真验证该方法能达到纳秒量级精度。 相似文献
193.
张梅 《中国人民武装警察部队学院学报》2010,26(3):80-82
调查外语受蚀时间对语言学习策略使用频率的影响。调查发现,学习者学习策略的使用频率,特别是记忆策略、认知策略和补偿策略的使用频率,随着受蚀时间的增加逐渐降低。 相似文献
194.
室内装饰织物因其容易点燃、燃烧速度快、蔓延迅速等燃烧特性,对室内火灾的发展蔓延及火灾危害都有重要影响。运用锥形量热仪对棉麻、涤纶、帆布、泡纱、条绒等5种室内装饰织物的燃烧性能进行了实验研究,测量了室内装饰织物在不同热辐射条件下的燃烧特性,并对实验数据进行图像拟合,通过具体的实验数据和图像分析比较了5种室内装饰织物在不同热辐射条件下的点燃时间、热释放速率、质量损失速率、比消光面积及CO生成量。最后得出了各种织物的火灾危险性相对大小。 相似文献
195.
Within a reasonable life‐testing time, how to improve the reliability of highly reliable products is one of the great challenges to today's manufacturers. By using a resolution III experiment together with degradation test, Tseng, Hamada, and Chiao (1995) presented an interesting case study of improving the reliability of fluorescent lamps. However, in conducting such an experiment, they did not address the problem of how to choose the optimal settings of variables, such as sample size, inspection frequency, and termination time for each run, which are influential to the correct identification of significant factors and the experimental cost. Assuming that the product's degradation paths satisfy Wiener processes, this paper proposes a systematic approach to the aforementioned problem. First, an intuitively appealing identification rule is proposed. Next, under the constraints of a minimum probability of correct decision and a maximum probability of incorrect decision of the proposed identification rule, the optimum test plan (including the determinations of inspection frequency, sample size, and termination time for each run) can be obtained by minimizing the total experimental cost. An example is provided to illustrate the proposed method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 514–526, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10024 相似文献
196.
A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λi. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λi's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051 相似文献
197.
In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039 相似文献
198.
199.
200.