全文获取类型
收费全文 | 13299篇 |
免费 | 2136篇 |
国内免费 | 1528篇 |
专业分类
电工技术 | 1121篇 |
综合类 | 1721篇 |
化学工业 | 1256篇 |
金属工艺 | 143篇 |
机械仪表 | 674篇 |
建筑科学 | 399篇 |
矿业工程 | 169篇 |
能源动力 | 468篇 |
轻工业 | 156篇 |
水利工程 | 158篇 |
石油天然气 | 193篇 |
武器工业 | 318篇 |
无线电 | 2671篇 |
一般工业技术 | 1299篇 |
冶金工业 | 325篇 |
原子能技术 | 138篇 |
自动化技术 | 5754篇 |
出版年
2024年 | 76篇 |
2023年 | 233篇 |
2022年 | 403篇 |
2021年 | 421篇 |
2020年 | 524篇 |
2019年 | 512篇 |
2018年 | 487篇 |
2017年 | 593篇 |
2016年 | 647篇 |
2015年 | 695篇 |
2014年 | 939篇 |
2013年 | 1060篇 |
2012年 | 1041篇 |
2011年 | 1057篇 |
2010年 | 863篇 |
2009年 | 885篇 |
2008年 | 851篇 |
2007年 | 938篇 |
2006年 | 767篇 |
2005年 | 684篇 |
2004年 | 559篇 |
2003年 | 430篇 |
2002年 | 367篇 |
2001年 | 366篇 |
2000年 | 282篇 |
1999年 | 227篇 |
1998年 | 192篇 |
1997年 | 158篇 |
1996年 | 124篇 |
1995年 | 98篇 |
1994年 | 77篇 |
1993年 | 62篇 |
1992年 | 55篇 |
1991年 | 40篇 |
1990年 | 25篇 |
1989年 | 39篇 |
1988年 | 12篇 |
1987年 | 11篇 |
1986年 | 7篇 |
1985年 | 17篇 |
1984年 | 20篇 |
1983年 | 20篇 |
1982年 | 17篇 |
1981年 | 9篇 |
1980年 | 16篇 |
1979年 | 17篇 |
1978年 | 10篇 |
1976年 | 5篇 |
1959年 | 6篇 |
1951年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
中国先进研究堆导流箱流场的数值模拟 总被引:1,自引:1,他引:0
采用目前国内普遍使用的计算流体力学 (CFD)软件PHOENICS 3 2对中国先进研究堆不同结构的导流箱的三维流场进行数值模拟计算。结果表明 :导流箱入口导流板和导流筒能显著改善导流箱入口冷却剂的流动状况 ,获得入口冷却剂沿周向均匀分流的效果 ,达到显著减缓入口冷却剂对垂直辐照孔道导管及安全棒导管直接的横向水力冲刷的设计目的 相似文献
32.
本文介绍了一种采用圆周阵对目标声源进行被动定位和跟踪的方法,与线阵不同,圆四可对目标进行全方位跟踪,且测距精度不受目标方位变化的影响,文中给出了圆周阵的测距,测向公式,并从理论上分析了测距性能,计算机仿真结果验证了理论分析的正确性。 相似文献
33.
通过对某型杀伤枪榴弹引信所发生的三次弹道炸的原因进行分析,提出用延期索替代延期药盘,并对有关机构进行再设计的对策。 相似文献
34.
35.
文中对影响煤矿许用毫秒延期电雷管沼气安全性与延期时间精度的因素进行了研究。应用正交设计研制了新的延期药配方,确定了合理的雷管结构及装配工艺参数,产品性能达到GB8031《工业电雷管》的规定。 相似文献
36.
37.
Wei Hui 《Frontiers of Computer Science in China》2007,1(3):361-372
Almost all applications of Artificial Neural Networks (ANNs) depend mainly on their memory ability. The characteristics of
typical ANN models are fixed connections, with evolved weights, globalized representations, and globalized optimizations,
all based on a mathematical approach. This makes those models to be deficient in robustness, efficiency of learning, capacity,
anti-jamming between training sets, and correlativity of samples, etc. In this paper, we attempt to address these problems
by adopting the characteristics of biological neurons in morphology and signal processing. A hierarchical neural network was
designed and realized to implement structure learning and representations based on connected structures. The basic characteristics
of this model are localized and random connections, field limitations of neuron fan-in and fan-out, dynamic behavior of neurons,
and samples represented through different sub-circuits of neurons specialized into different response patterns. At the end
of this paper, some important aspects of error correction, capacity, learning efficiency, and soundness of structural representation
are analyzed theoretically. This paper has demonstrated the feasibility and advantages of structure learning and representation.
This model can serve as a fundamental element of cognitive systems such as perception and associative memory. 相似文献
38.
Xiaoming Zhou Martin Jacobsson Henk Uijterwaal Piet Van Mieghem 《International Journal of Communication Systems》2008,21(6):643-663
Although packet delay and loss are two important parameters of the Internet performance, to the best of our knowledge, the evolution of large‐scale IPv6 delay and loss performance has previously not been studied. In this paper, we analyze more than 600 end‐to‐end IPv6 paths between about 26 testboxes of RIPE Network Coordination Centre over two years, and compare the delay and loss performance over time with their IPv4 counterparts. We present and discuss the measurement methodologies and show that IPv6 paths have a higher delay and loss than their IPv4 counterparts. The main reason for the worse performance stems from IPv6‐in‐IPv4 tunnels rather than from native IPv6 paths and such tunnels are still widely used today. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
39.
A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs 总被引:1,自引:0,他引:1
We consider the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a setup time. A job completes when all of its operations have been processed. The objective is to minimize the number of tardy jobs. In the literature, this problem has been proved to be strongly NP-hard for arbitrary due-dates. We show in this paper that the problem remains strongly NP-hard even when the due-dates are common and all jobs have the same processing time. 相似文献
40.
It has been reported that it is harder to switch to a strong, well-practiced task from a weaker, less-practiced task than vice versa. Three experiments replicated this surprising asymmetry and investigated how it is affected by a reduction in interference between tasks. Experiment 1 progressively delayed the onset of the stimulus attribute associated with the stronger task. Experiments 2 and 3 separated the response sets of the tasks. Both manipulations reduced, without eliminating, interference of the stronger with the weaker task but reversed the asymmetry of switch costs, resulting in a larger cost of switching to the weaker task. The results are interpreted in terms of a model of the interactions between control input, task strength, and task priming. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献