全文获取类型
收费全文 | 1960篇 |
免费 | 189篇 |
国内免费 | 122篇 |
专业分类
电工技术 | 347篇 |
综合类 | 167篇 |
化学工业 | 201篇 |
金属工艺 | 35篇 |
机械仪表 | 126篇 |
建筑科学 | 58篇 |
矿业工程 | 100篇 |
能源动力 | 44篇 |
轻工业 | 126篇 |
水利工程 | 51篇 |
石油天然气 | 98篇 |
武器工业 | 15篇 |
无线电 | 188篇 |
一般工业技术 | 121篇 |
冶金工业 | 63篇 |
原子能技术 | 15篇 |
自动化技术 | 516篇 |
出版年
2024年 | 7篇 |
2023年 | 21篇 |
2022年 | 42篇 |
2021年 | 56篇 |
2020年 | 54篇 |
2019年 | 56篇 |
2018年 | 41篇 |
2017年 | 69篇 |
2016年 | 56篇 |
2015年 | 75篇 |
2014年 | 108篇 |
2013年 | 114篇 |
2012年 | 150篇 |
2011年 | 144篇 |
2010年 | 121篇 |
2009年 | 124篇 |
2008年 | 108篇 |
2007年 | 130篇 |
2006年 | 136篇 |
2005年 | 93篇 |
2004年 | 84篇 |
2003年 | 70篇 |
2002年 | 58篇 |
2001年 | 64篇 |
2000年 | 48篇 |
1999年 | 39篇 |
1998年 | 26篇 |
1997年 | 29篇 |
1996年 | 22篇 |
1995年 | 20篇 |
1994年 | 15篇 |
1993年 | 16篇 |
1992年 | 14篇 |
1991年 | 6篇 |
1990年 | 11篇 |
1989年 | 3篇 |
1988年 | 9篇 |
1987年 | 5篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 5篇 |
1983年 | 7篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有2271条查询结果,搜索用时 15 毫秒
31.
We describe an efficient parallel algorithm for hidden-surface removal for terrain maps. The algorithm runs in O(log
4
n) steps on the CREW PRAM model with a work bound of O((n+k) \polylog ( n)) where n and k are the input and output sizes, respectively. In order to achieve the work bound we use a number of techniques, among which
our use of persistent data structures is somewhat novel in the context of parallel algorithms.
Received July 29, 1998; revised October 5, 1999. 相似文献
32.
M. Baioletti A. Capotorti S. Tulipani B. Vantaggi 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2000,4(2):81-88
In this paper we deal with the computational complexity problem of checking the coherence of a partial probability assessment
(called CPA). The CPA problem, like its analogous PSAT, is NP-complete so we look for an heuristic procedure to make tractable
reasonable instances of the problem. Starting from the characteristic feature of de Finetti's approach (i.e. the explicit
distinction between the probabilistic assessment and the logical relations among the sentences) we introduce several rules
for a sequential “elimination” of Boolean variables from the domain of the assessment. The procedure resembles the well-known
Davis-Putnam rules for the satisfiability, however we have, as a drawback, the introduction of constraints (among real variables)
whose satisfiability must be checked. In simple examples we test the efficiency of the procedure respect to the “traditional”
approach of solving a linear system with a huge coefficient matrix built from the atoms generated by the domain of the assessment. 相似文献
33.
Discusses the decision to eliminate the term "neurosis" from the DSM-III. The history of the term is traced; weaknesses of DSM-II pertaining to neurosis are presented; theoretical and political processes in the deletion procedure are described; and an overview is given of the current resolution as presented in DSM-III. Instead of neurosis, "neurotic disorder" and "neurotic process" were distinguished to reduce potential theoretical bias. The process may or may not be seen by the clinician as causal in the disorder, but those of all theoretical persuasions should be able to agree on what the disorder is. (13 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
34.
35.
《国际计算机数学杂志》2012,89(4):449-469
Two types of broadcast in algorithms are determined: (1) a data broadcast, where one data value is used for more than one computation and (2) a computational broadcast where one variable is computed in more then one computation. Both types of broadcast are preferred to be eliminated when a processor array implementation is desired by using VLSI technology. When the algorithm computes only one variable value for each index vector then the computational broadcast can be eliminated in a straight forward manner by introducing counter values resulting in a single assignment code. However in cases when the algorithm computes two or more variable values that are specified by a different computational broadcast, has not been considered. As far as is known it has been solved by deriving localized algorithms in single assignment code heuristically. In this paper we define this problem in terms of a system of affine recurrence equations and analyze the data dependencies introduced. Then we show a synthesis procedure that eliminates the computational broadcast and a few examples of implementation are shown. The QR decomposition algorithm is also presented in a localized single assignment code by using the proposed method and several different parallel implementations are discussed. 相似文献
36.
37.
38.
聚合物/无机纳米复合材料热点述评 总被引:13,自引:0,他引:13
介绍了纳米技术的发展概况,评述了这一领域的研究现状和发展趋势,并以纳米粘土复合材料为重点综述了聚合物/无机纳米复合材料的力学性能,以及阻隔、杀菌除臭、消烟阻燃等功能。 相似文献
39.
文章简介了空分设备气体放空时产生的噪声对周围环境的污染和伤害,并对放空气体噪声的控制与治理进行了分析对比;提出大型空分设备,特别是内压缩流程的空分设备,大流量低、中、高压气体放空,应采用消声塔集中排放,有效控制和治理气体放空噪声。 相似文献
40.
数字拍摄中所产生的噪波会影响质量。本文讨论了数字拍摄中噪波产生的原因,并针对性地提出了如何消除或减弱噪波的方法。 相似文献