全文获取类型
收费全文 | 9817篇 |
免费 | 956篇 |
国内免费 | 653篇 |
专业分类
电工技术 | 386篇 |
综合类 | 1035篇 |
化学工业 | 1513篇 |
金属工艺 | 455篇 |
机械仪表 | 550篇 |
建筑科学 | 1176篇 |
矿业工程 | 425篇 |
能源动力 | 464篇 |
轻工业 | 409篇 |
水利工程 | 565篇 |
石油天然气 | 727篇 |
武器工业 | 104篇 |
无线电 | 451篇 |
一般工业技术 | 1327篇 |
冶金工业 | 382篇 |
原子能技术 | 145篇 |
自动化技术 | 1312篇 |
出版年
2024年 | 38篇 |
2023年 | 131篇 |
2022年 | 269篇 |
2021年 | 300篇 |
2020年 | 306篇 |
2019年 | 258篇 |
2018年 | 247篇 |
2017年 | 339篇 |
2016年 | 339篇 |
2015年 | 350篇 |
2014年 | 573篇 |
2013年 | 625篇 |
2012年 | 694篇 |
2011年 | 723篇 |
2010年 | 583篇 |
2009年 | 578篇 |
2008年 | 528篇 |
2007年 | 621篇 |
2006年 | 606篇 |
2005年 | 549篇 |
2004年 | 450篇 |
2003年 | 389篇 |
2002年 | 323篇 |
2001年 | 268篇 |
2000年 | 243篇 |
1999年 | 189篇 |
1998年 | 166篇 |
1997年 | 132篇 |
1996年 | 96篇 |
1995年 | 100篇 |
1994年 | 82篇 |
1993年 | 60篇 |
1992年 | 45篇 |
1991年 | 37篇 |
1990年 | 26篇 |
1989年 | 27篇 |
1988年 | 31篇 |
1987年 | 23篇 |
1986年 | 12篇 |
1985年 | 18篇 |
1984年 | 12篇 |
1983年 | 12篇 |
1982年 | 14篇 |
1981年 | 2篇 |
1980年 | 5篇 |
1979年 | 4篇 |
1977年 | 1篇 |
1976年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, one can achieve a very good performance improvement in the rendering phase by increasing the number of processors. This is because each processor can render images locally without communicating with other processors. However, in the compositing phase, a processor has to exchange local images with other processors. When the number of processors exceeds a threshold, the image compositing time becomes a bottleneck. In this paper, we propose three compositing methods to efficiently reduce the compositing time in parallel volume rendering. They are the binary-swap with bounding rectangle (BSBR) method, the binary-swap with run-length encoding and static load-balancing (BSLC) method, and the binary-swap with bounding rectangle and run-length encoding (BSBRC) method. The proposed methods were implemented on an SP2 parallel machine along with the binary-swap compositing method. The experimental results show that the BSBRC method has the best performance among these four methods. 相似文献
92.
A Unified Subdivision Scheme for Polygonal Modeling 总被引:10,自引:0,他引:10
Subdivision rules have traditionally been designed to generate smooth surfaces from polygonal meshes. In this paper we propose to employ subdivision rules as a polygonal modeling tool, specifically to add additional level of detail to meshes. However, existing subdivision schemes have several undesirable properties making them ill suited for polygonal modeling. In this paper we propose a general set of subdivision rules which provides users with more control over the subdivision process. Most existing subdivision schemes are special cases. In particular, we provide subdivision rules which blend approximating spline based schemes with interpolatory ones. Also, we generalize subdivision to allow any number of refinements to be performed in a single step. 相似文献
93.
Valence-Driven Connectivity Encoding for 3D Meshes 总被引:13,自引:0,他引:13
In this paper, we propose a valence-driven, single-resolution encoding technique for lossless compression of triangle mesh connectivity. Building upon a valence-based approach pioneered by Touma and Gotsman22 , we design a new valence-driven conquest for arbitrary meshes that always guarantees smaller compression rates than the original method. Furthermore, we provide a novel theoretical entropy study of our technique, hinting the optimality of the valence-driven approach. Finally, we demonstrate the practical efficiency of this approach (in agreement with the theoretical prediction) on a series of test meshes, resulting in the lowest compression ratios published so far, for both irregular and regular meshes, small or large. 相似文献
94.
提出了一种被遮挡单元的裁剪算法,以加速非规则数据场的体绘制过程。在基于一组平行切割平面的体绘制方法上,新算法通过对图像不透明度缓冲区中的值进行求平均操作,并将所计算的结果存储在一个与不透明度缓冲区间同样大小的平均不透明度缓冲区中,使得只需根据每一数据单元重心投影点在平均不透明度缓冲区中的值,就可得到此数据单元的可见性,从而有效裁剪掉被遮挡单元,降低需处理的数据量,加速体绘制过程。 相似文献
95.
An iteration procedure for solving Sylvester generalized matrix equation is proposed in this paper. The sufficient conditions
of stability of the iteration procedure for solving this equation are obtained.
Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 183–186, May–June, 2000. 相似文献
96.
A. Charnes W. W. Cooper S. Duffuaa M. Kress 《International journal of parallel programming》1980,9(6):483-506
Through key examples and constructs, exact and approximate, complexity, computability, and solution of linear programming systems are reexamined in the light of Khachian's new notion of (approximate) solution. Algorithms, basic theorems, and alternate representations are reviewed. It is shown that the Klee-Minty example hasnever been exponential for (exact) adjacent extreme point algorithms and that the Balinski-Gomory (exact) algorithm continues to be polynomial in cases where (approximate) ellipsoidal centered-cutoff algorithms (Levin, Shor, Khachian, Gacs-Lovasz) are exponential. By model approximation, both the Klee-Minty and the new J. Clausen examples are shown to be trivial (explicitly solvable) interval programming problems. A new notion of computable (approximate) solution is proposed together with ana priori regularization for linear programming systems. New polyhedral constraint contraction algorithms are proposed for approximate solution and the relevance of interval programming for good starts or exact solution is brought forth. It is concluded from all this that the imposed problem ignorance of past complexity research is deleterious to research progress on computability or efficiency of computation.This research was partly supported by Project NR047-071, ONR Contract N00014-80-C-0242, and Project NR047-021, ONR Contract N00014-75-C-0569, with the Center for Cybernetic Studies, The University of Texas at Austin. 相似文献
97.
98.
99.
《Ergonomics》2012,55(12):1175-1183
The effect of caffeine on circulation and metabolism was studied during a discontinuous maximal oxygen uptake (VO2 max) test on a bicycle ergometer. Eight male subjects were chosen for their minimal use of caffeine of which six normally did not ingest caffeinated beverages. Two caffeinated and two decaffeinated (control) trials were administered to each subject following double-blind and counterbalanced testing procedures. One hour before exercise, subjects ingested decaffeinated coffee with or without 350 mg of caffeine anhydrous added. Cardiac output (Q) was measured by a C02 rebreathing technique. Compared to control trials, caffeine increased the VO2 max by an average of 140ml min?1 (p <0-0·5)l. In addition, during caffeine trials, the average maximal heart rate (HR max) was elevated by 5 beats min?1 (p<0·01). There were no other statistically significant changes in metabolic (VO2 and R) and cardiovascular (Q, HR, SV and (a-v) 02 diff) variables during either submaximal or maximal exercise. Performance, as measured by total exercise time on the VO2 max test, was not significantly different (p>0·05). It was concluded that caffeine has a small physiological but a statistically significant effect on VQ2 max and HR max. During submaximal exercise, caffeine did not significantly effect the cardiovascular system. 相似文献
100.
为提高光线投射算法的绘制速度和图像绘制质量,提出了一种针对类球形对象的改进光线投射算法。该算法首先设置球形包围盒的方法剔除对最后绘图结果没有影响的光线投射,用快速求交的方法来提高获取采样点的速度,通过自适应采样的方法加入新的采样点来提高绘制图像的质量。实验结果表明该算法不仅比传统方法绘制出的图像质量清晰,并且提高了算法的执行速度。 相似文献