全文获取类型
收费全文 | 8127篇 |
免费 | 829篇 |
国内免费 | 362篇 |
专业分类
电工技术 | 560篇 |
综合类 | 363篇 |
化学工业 | 1404篇 |
金属工艺 | 387篇 |
机械仪表 | 386篇 |
建筑科学 | 442篇 |
矿业工程 | 178篇 |
能源动力 | 268篇 |
轻工业 | 626篇 |
水利工程 | 102篇 |
石油天然气 | 172篇 |
武器工业 | 74篇 |
无线电 | 1144篇 |
一般工业技术 | 1174篇 |
冶金工业 | 588篇 |
原子能技术 | 70篇 |
自动化技术 | 1380篇 |
出版年
2024年 | 60篇 |
2023年 | 149篇 |
2022年 | 287篇 |
2021年 | 438篇 |
2020年 | 295篇 |
2019年 | 230篇 |
2018年 | 311篇 |
2017年 | 309篇 |
2016年 | 281篇 |
2015年 | 331篇 |
2014年 | 399篇 |
2013年 | 561篇 |
2012年 | 508篇 |
2011年 | 507篇 |
2010年 | 488篇 |
2009年 | 449篇 |
2008年 | 471篇 |
2007年 | 421篇 |
2006年 | 325篇 |
2005年 | 323篇 |
2004年 | 230篇 |
2003年 | 231篇 |
2002年 | 182篇 |
2001年 | 152篇 |
2000年 | 148篇 |
1999年 | 119篇 |
1998年 | 142篇 |
1997年 | 104篇 |
1996年 | 82篇 |
1995年 | 87篇 |
1994年 | 58篇 |
1993年 | 62篇 |
1992年 | 46篇 |
1991年 | 58篇 |
1990年 | 58篇 |
1989年 | 50篇 |
1988年 | 39篇 |
1987年 | 35篇 |
1986年 | 28篇 |
1985年 | 36篇 |
1984年 | 24篇 |
1983年 | 15篇 |
1982年 | 26篇 |
1981年 | 24篇 |
1980年 | 12篇 |
1979年 | 18篇 |
1978年 | 11篇 |
1977年 | 16篇 |
1976年 | 16篇 |
1975年 | 11篇 |
排序方式: 共有9318条查询结果,搜索用时 15 毫秒
81.
82.
Silicon - In this article, the electrical behavior of short channel SiGe Heterostructure Junction-Less DG-MOSFET have been studied by incorporating the quantum mechanical effect and short channel... 相似文献
83.
84.
以硝酸锆和钛酸四丁酯为原料,采用共沉淀法制备Ti-Zr-O氧化物载体,采用浸渍法制备了Mn/Ti-Zr催化剂;采用XRD、N2物理吸附、H2-TPR、NH3-TPD和TG-DTA对Mn/Ti-Zr催化剂进行了表征,并考察了催化剂组成、结构和反应条件对苯甲酸甲酯(MB)加氢性能的影响,以及催化剂的长周期稳定性、失活和再生行为。结果表明:TiO2含量和Mn负载量分别为12% 和8% (二者均以Ti-Zr-O氧化物的质量为基准,下同)时制备的Mn/Ti-Zr催化剂性能最优,该催化剂在θ = 390 ℃, p = 1.0 MPa,n(H2)∶n(MB) = 9∶1和重时空速(WHSV)= 0.5 h-1的优化条件能够实现98.0% 的苯甲酸甲酯转化率和89.7%的苯甲醛和苯甲醇选择性;苯甲酸甲酯加氢反应的活性和选择性分别与Mn/Ti-Zr表面MnOx物种的氧化还原性和催化剂的酸性密切相关。此外,Mn/Ti-Zr催化剂具有良好的结构稳定性,在反应1000 h后仅因积碳而丧失11% 的活性,且轻微失活的催化剂可以通过焙烧恢复其初始活性和选择性。 相似文献
85.
Ce对共晶Mg-Al合金组织的影响 总被引:7,自引:7,他引:7
模拟AZ9l镁合金半固态液相凝固后期的成分,分析了共晶成分镁铝合金添加不同含量的稀土元素Ce后,铸态显微结构的变化。结果表明:Ce的加入改变了合金的组织,增加了初晶α相的含量,细化了β相并减少了β相的含量。随着稀土Ce加入量的增加,在Ce的加入量为0.6%时,所得的组织最好;在Ce含量大于0.6%时,随着Ce加入量的增加,细化效果反而变差。 相似文献
86.
87.
中国联合水泥公司3000t/d熟料生产线电气控制系统采用了法国施耐德公司的Quantum DCS系统,实现对全厂所有设备的工艺操作和控制。全面介绍了QuantumDCS系统的特点、功能系统构成网络,并详细总结了确保该系统稳定可靠运行的使用和维护的经验。 相似文献
88.
朗盛,作为全球领先的特殊化学品企业,每年以不同的形象亮相于中国国际涂料展。2007年,朗盛以一系列用于涂料行业的高品质颜料和杀菌剂亮相,以期助力中国涂料行业客户提升竞争力。期间,本刊特对朗盛无机颜料业务部亚太区负责人韩乐福博士及材料保护品大中华区负责人顾其峰就朗盛产品及市场方面进行了专访。 相似文献
89.
Given a set of points \(P \subset\mathbb{R}^{d}\) , the k-means clustering problem is to find a set of k centers \(C = \{ c_{1},\ldots,c_{k}\}, c_{i} \in\mathbb{R}^{d}\) , such that the objective function ∑ x∈P e(x,C)2, where e(x,C) denotes the Euclidean distance between x and the closest center in C, is minimized. This is one of the most prominent objective functions that has been studied with respect to clustering. D 2-sampling (Arthur and Vassilvitskii, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’07, pp. 1027–1035, SIAM, Philadelphia, 2007) is a simple non-uniform sampling technique for choosing points from a set of points. It works as follows: given a set of points \(P \subset\mathbb{R}^{d}\) , the first point is chosen uniformly at random from P. Subsequently, a point from P is chosen as the next sample with probability proportional to the square of the distance of this point to the nearest previously sampled point. D 2-sampling has been shown to have nice properties with respect to the k-means clustering problem. Arthur and Vassilvitskii (Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’07, pp. 1027–1035, SIAM, Philadelphia, 2007) show that k points chosen as centers from P using D 2-sampling give an O(logk) approximation in expectation. Ailon et al. (NIPS, pp. 10–18, 2009) and Aggarwal et al. (Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 15–28, Springer, Berlin, 2009) extended results of Arthur and Vassilvitskii (Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’07, pp. 1027–1035, SIAM, Philadelphia, 2007) to show that O(k) points chosen as centers using D 2-sampling give an O(1) approximation to the k-means objective function with high probability. In this paper, we further demonstrate the power of D 2-sampling by giving a simple randomized (1+?)-approximation algorithm that uses the D 2-sampling in its core. 相似文献
90.
Sarala Arunagiri Yipkei Kwok Patricia J. Teller Ricardo A. Portillo Seetharami R. Seelam 《International journal of parallel programming》2014,42(1):165-197
Providing differentiated service in a consolidated storage environment is a challenging task. To address this problem, we introduce FAIRIO, a cycle-based I/O scheduling algorithm that provides differentiated service to workloads concurrently accessing a consolidated RAID storage system. FAIRIO enforces proportional sharing of I/O service through fair scheduling of disk time. During each cycle of the algorithm, I/O requests are scheduled according to workload weights and disk-time utilization history. Experiments, which were driven by the I/O request streams of real and synthetic I/O benchmarks and run on a modified version of DiskSim, provide evidence of FAIRIO’s effectiveness and demonstrate that fair scheduling of disk time is key to achieving differentiated service in a RAID storage system. In particular, the experimental results show that, for a broad range of workload request types, sizes, and access characteristics, the algorithm provides differentiated storage throughput that is within 10% of being perfectly proportional to workload weights; and, it achieves this with little or no degradation of aggregate throughput. The core design concepts of FAIRIO, including service-time allocation and history-driven compensation, potentially can be used to design I/O scheduling algorithms that provide workloads with differentiated service in storage systems comprised of RAIDs, multiple RAIDs, SANs, and hypervisors for Clouds. 相似文献