全文获取类型
收费全文 | 14436篇 |
免费 | 1678篇 |
国内免费 | 1109篇 |
专业分类
电工技术 | 324篇 |
技术理论 | 1篇 |
综合类 | 1345篇 |
化学工业 | 975篇 |
金属工艺 | 1552篇 |
机械仪表 | 1157篇 |
建筑科学 | 1144篇 |
矿业工程 | 281篇 |
能源动力 | 242篇 |
轻工业 | 407篇 |
水利工程 | 252篇 |
石油天然气 | 240篇 |
武器工业 | 153篇 |
无线电 | 1297篇 |
一般工业技术 | 2250篇 |
冶金工业 | 848篇 |
原子能技术 | 97篇 |
自动化技术 | 4658篇 |
出版年
2024年 | 58篇 |
2023年 | 193篇 |
2022年 | 262篇 |
2021年 | 380篇 |
2020年 | 422篇 |
2019年 | 408篇 |
2018年 | 399篇 |
2017年 | 463篇 |
2016年 | 491篇 |
2015年 | 464篇 |
2014年 | 747篇 |
2013年 | 936篇 |
2012年 | 903篇 |
2011年 | 1057篇 |
2010年 | 820篇 |
2009年 | 911篇 |
2008年 | 872篇 |
2007年 | 1080篇 |
2006年 | 879篇 |
2005年 | 777篇 |
2004年 | 705篇 |
2003年 | 599篇 |
2002年 | 520篇 |
2001年 | 435篇 |
2000年 | 370篇 |
1999年 | 335篇 |
1998年 | 265篇 |
1997年 | 217篇 |
1996年 | 203篇 |
1995年 | 165篇 |
1994年 | 145篇 |
1993年 | 106篇 |
1992年 | 96篇 |
1991年 | 67篇 |
1990年 | 62篇 |
1989年 | 59篇 |
1988年 | 35篇 |
1987年 | 19篇 |
1986年 | 12篇 |
1985年 | 31篇 |
1984年 | 34篇 |
1983年 | 34篇 |
1982年 | 34篇 |
1981年 | 25篇 |
1980年 | 32篇 |
1979年 | 32篇 |
1978年 | 12篇 |
1977年 | 6篇 |
1976年 | 12篇 |
1964年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 390 毫秒
41.
Abstract. In this paper we refer to the Temporal Precedence Problem on Pure Pointer Machines . This problem asks for the design of a data structure, maintaining a set of stored elements and supporting the following
two operations: insert and precedes . The operation insert (a) introduces a new element a in the structure, while the operation precedes (a,b) returns true iff element a was inserted before element b temporally. In [11] a solution was provided to the problem with worst-case time complexity O (log log n ) per operation and O(n log log n) space, where n is the number of elements inserted. It was also demonstrated that the precedes operation has a lower bound of Ω (log log n ) for the Pure Pointer Machine model of computation. In this paper we present two simple solutions with linear space and worst-case constant insertion
time. In addition, we describe two algorithms that can handle the precedes (a,b) operation in O (log log d ) time, where d is the temporal distance between the elements a and b . 相似文献
42.
基数排序由于其效率高而被广泛应用。通常,基数排序所用的基数是10,然而,如果求得一个基数r_(best),并且用r_(best)为基数进行基数排序使排序时间达到最小,则这将具有非常重要的意义。本文给出了求r_(best)的方法,分析了以r_(best)为基数进行基数排序的时间复杂度,提出了进一步提高效率的措施,并将以r_(best)为基数的基数排序速度与以10为基数的基数排序进行了比较。 相似文献
43.
本文针对我国机床工具产品色彩设计的现状,结合具体实例,对色彩造型的实质做了初步的探讨。分析了色彩造型和色彩装饰两种设计观和实践效果;以色彩与形状关系及作用的论证为引,论述色彩造型的三大功能作用。并提出可供机床工具产品色彩设计参考的具体设计方法和手段。 相似文献
44.
Motoharu Fujigaki In Hong Yang Yoshiharu Morimoto Eung Kyo Han 《NDT & E International》1996,29(4):197-203
There is no good method to measure the shape and the strain distributions of a structure changing with time. We have previously proposed the Fourier transform grid method (FTGM) to measure the three-dimensional shape and surface strain distributions of stationary objects by analysing the two-dimensional grating images recorded with two cameras. In the stereoscopic method, it is very important to determine the accurate geometric parameters of the camera system. In this paper, the positions and the directions of cameras are accurately determined using the FTGM applied to images of a reference object on which a two-dimensional grating is drawn. Applications for analysing shape and strain distributions of vibrating rubber plates and a moving human skin are shown. 相似文献
45.
Computational complexity of queries based on itemsets 总被引:1,自引:0,他引:1
Nikolaj Tatti 《Information Processing Letters》2006,98(5):183-187
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that despite the limitations our problems are also intractable, namely, we show that checking whether the maximal consistent frequency of a query is larger than a given threshold is NP-complete and that evaluating the Maximum Entropy estimate of a query is PP-hard. We also prove that checking consistency is NP-complete. 相似文献
46.
成形磨削中砂轮修整精度的研究 总被引:6,自引:1,他引:5
成形磨削一般采用金刚石笔来修整所需要的砂轮形状,金刚石笔在安装中的位置误差将影响被加工工件的精度,本文对此误差的大小进行了分析。 相似文献
47.
Porous NiTi shape memory alloy (SMA) is a novel biomedical material used for human hard tissue implant .The influence of elemental titanium powder characteristics such as powder morphology, particle size and specific surface area( SSA) on the minimal ignition temperature ,combustion temperature and final product of porous Ni-Ti SMA fabricated by combustion synthesis method was investigated in this paper by scanning electron microscopy (SEM) and laser diffraction.The preliminary data indicated that the titanium powder characteristics had a strong effect on combustion synthesis of porous NiTi SMA. 相似文献
48.
This paper deals with the problem of finding graph layerings restricted to a given maximal width. However, other than previous approaches for width-restricted layering, we take into account the space for dummy nodes, which are introduced by edges crossing a layer. The main result is that the problem of finding a width-restricted layering under consideration of dummy nodes is NP-complete even when all regular nodes have the same constant width and all dummy nodes have the same constant width. 相似文献
49.
Observation and Analysis of Gypsum Particleboard using SEM 总被引:2,自引:0,他引:2
冯谦 《武汉理工大学学报(材料科学英文版)》2007,22(1):44-47
The microstructures of gypsum board and gypsum particleboard were observed by SEM. The effects of retarder and waterproof agent on the shape and the average dimension of the gypsum crystal were discussed. The mechanism was investigated as well. Four typical instances, i e, the gypsum crystal shape, the gypsum combined with particles on the particles surface, the gypsum combined with particles on the wood cross section and the gypsum combined with particles inside the wood cell cavity were selected and observed. Furthermore, the agglomeration and cementation mechanism between gypsum and particle were studied. 相似文献
50.
Yong-Jik KimJames H. Anderson 《Information Processing Letters》2002,84(1):47-55
A simple code transformation is presented that reduces the space complexity of Yang and Anderson's local-spin mutual exclusion algorithm. In both the original and the transformed algorithm, only atomic read and write instructions are used; each process generates Θ(logN) remote memory references per lock request, where N is the number of processes. The transformed algorithm uses Θ(N) distinct variables, which is clearly optimal. 相似文献