全文获取类型
收费全文 | 45358篇 |
免费 | 5066篇 |
国内免费 | 3354篇 |
专业分类
电工技术 | 3849篇 |
综合类 | 4166篇 |
化学工业 | 5994篇 |
金属工艺 | 3054篇 |
机械仪表 | 3212篇 |
建筑科学 | 3468篇 |
矿业工程 | 1606篇 |
能源动力 | 1242篇 |
轻工业 | 4501篇 |
水利工程 | 1346篇 |
石油天然气 | 2024篇 |
武器工业 | 477篇 |
无线电 | 5248篇 |
一般工业技术 | 4452篇 |
冶金工业 | 1798篇 |
原子能技术 | 600篇 |
自动化技术 | 6741篇 |
出版年
2024年 | 305篇 |
2023年 | 754篇 |
2022年 | 1670篇 |
2021年 | 2119篇 |
2020年 | 1565篇 |
2019年 | 1211篇 |
2018年 | 1244篇 |
2017年 | 1525篇 |
2016年 | 1227篇 |
2015年 | 1879篇 |
2014年 | 2457篇 |
2013年 | 2897篇 |
2012年 | 3375篇 |
2011年 | 3463篇 |
2010年 | 3362篇 |
2009年 | 3236篇 |
2008年 | 3330篇 |
2007年 | 3287篇 |
2006年 | 3030篇 |
2005年 | 2580篇 |
2004年 | 1817篇 |
2003年 | 1304篇 |
2002年 | 1283篇 |
2001年 | 1096篇 |
2000年 | 992篇 |
1999年 | 585篇 |
1998年 | 404篇 |
1997年 | 343篇 |
1996年 | 311篇 |
1995年 | 252篇 |
1994年 | 204篇 |
1993年 | 134篇 |
1992年 | 107篇 |
1991年 | 85篇 |
1990年 | 71篇 |
1989年 | 67篇 |
1988年 | 51篇 |
1987年 | 29篇 |
1986年 | 18篇 |
1985年 | 15篇 |
1984年 | 12篇 |
1983年 | 9篇 |
1982年 | 13篇 |
1981年 | 17篇 |
1980年 | 14篇 |
1979年 | 7篇 |
1959年 | 4篇 |
1958年 | 2篇 |
1956年 | 2篇 |
1951年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
71.
72.
73.
铝合金电火花线切割加工工艺研究 总被引:2,自引:0,他引:2
通过对铝合金高速走丝电火花线切割加工的工艺设计,探讨了其加工的工艺特点,分析了不同的进给速度、工作液及电参数对加工工艺指标的影响,并提出了改善铝合金高速走丝线切割加工工艺性能的措施。 相似文献
74.
75.
The iron rhenate was compounded by chemical method, which may be generated during wear process of Fe-Re alloys at elevated
temperature. The friction coefficient of iron rhenate has been determined by a pin-on-disc device. The results show that iron
rhenate plays role of lubricating at RT-600 °C. The lubricating behavior is related to the matching pairs. The hardness of
the materials of matching pairs, compatibility of iron rhenate with materials of matching pairs and surface roughness of disc
affect the lubricating behavior of iron rhenate mostly. The principle of matching pairs is proposed.
Project supported by the National Natural Science Foundation of China
Synopsis of the first author Xiong Dangsheng. associated professor, born in 1960. Current research fields include high-temperature self-lubricating alloys
and tribological properties of material. 相似文献
76.
It is stated in the above-mentioned comment that the main result of the paper Xiong, Zhang, et al. [(2006). Performance evaluation of UKF-based nonlinear filtering. Automatica 42(2), 261-270] can be extended to a class of filters, such as the extended Kalman filter (EKF). As we show here, this belief can be justified in a rigorous way, even for the nonlinear stochastic system with a nonlinear measurement equation. 相似文献
77.
从机车驾驶座椅设计的人机工程学原则出发,对TZY1型驾驶座椅的主要技术参数选择进行了详细的论述,同时还对TZY1型驾驶座椅关键部件的结构设计进行了分析。 相似文献
78.
通过分析甲壳素纤维各项性能,将其引入山羊绒产品中,对双层织物的设计进行探讨,并经过纺纱和织物试制,提出了设计与生产中应注意的问题,开发出了具有永久抗菌性的表层为羊绒、里层为甲壳素与改性羊毛混纺的系列产品. 相似文献
79.
Zixiang Xiong Ramchandran K. Herley C. Orchard M.T. 《Signal Processing, IEEE Transactions on》1997,45(2):333-345
Addresses the problem of finding the best time-varying filter bank tree-structured representation for a signal. The tree is allowed to vary at regular intervals, and the spacing of these changes can be arbitrarily short. The question of how to choose tree-structured representations of signals based on filter banks is considered. Wavelets and their adaptive version, known as wavelet packets, represent one approach that is popular. Wavelet packets are subband trees where the tree is chosen to match the characteristics of the signal. Variations where the tree varies over time have been proposed as the double tree and the time-frequency tree algorithms. Time-variation adds a further level of adaptivity. In all of the approaches proposed so far, the tree must be either fixed for the whole duration of the signal or fixed for its dyadic subintervals. The solution that we propose, as it allows more flexible variation, is an advance on the wavelet packet algorithm, the double tree algorithm, and the recently proposed time-frequency tree algorithm. Our solution is based on casting it in a dynamic programming (DP) setting. Focusing on compression applications, we use a Lagrangian cost of distortion +λ×rate as the objective function and explain our algorithm in detail, pointing out its relation to existing approaches to the problem. We demonstrate that the new algorithm indeed searches a larger library of representations than previously possible and that overcoming the constraint of dyadic time segmentations gives a significant improvement in practice 相似文献
80.