全文获取类型
收费全文 | 262389篇 |
免费 | 3290篇 |
国内免费 | 829篇 |
专业分类
电工技术 | 5140篇 |
综合类 | 331篇 |
化学工业 | 37592篇 |
金属工艺 | 10274篇 |
机械仪表 | 8527篇 |
建筑科学 | 6232篇 |
矿业工程 | 1087篇 |
能源动力 | 6425篇 |
轻工业 | 23264篇 |
水利工程 | 2574篇 |
石油天然气 | 3923篇 |
武器工业 | 68篇 |
无线电 | 34829篇 |
一般工业技术 | 50346篇 |
冶金工业 | 47144篇 |
原子能技术 | 5423篇 |
自动化技术 | 23329篇 |
出版年
2021年 | 2082篇 |
2019年 | 2077篇 |
2018年 | 3508篇 |
2017年 | 3574篇 |
2016年 | 3771篇 |
2015年 | 2355篇 |
2014年 | 4111篇 |
2013年 | 11464篇 |
2012年 | 6644篇 |
2011年 | 9015篇 |
2010年 | 7097篇 |
2009年 | 7944篇 |
2008年 | 8799篇 |
2007年 | 8732篇 |
2006年 | 7908篇 |
2005年 | 7232篇 |
2004年 | 6965篇 |
2003年 | 6808篇 |
2002年 | 6453篇 |
2001年 | 6514篇 |
2000年 | 6218篇 |
1999年 | 6296篇 |
1998年 | 14280篇 |
1997年 | 10310篇 |
1996年 | 8152篇 |
1995年 | 6441篇 |
1994年 | 5759篇 |
1993年 | 5621篇 |
1992年 | 4572篇 |
1991年 | 4222篇 |
1990年 | 4078篇 |
1989年 | 3808篇 |
1988年 | 3647篇 |
1987年 | 3193篇 |
1986年 | 3094篇 |
1985年 | 3632篇 |
1984年 | 3411篇 |
1983年 | 3054篇 |
1982年 | 2864篇 |
1981年 | 2966篇 |
1980年 | 2771篇 |
1979年 | 2657篇 |
1978年 | 2509篇 |
1977年 | 2959篇 |
1976年 | 3565篇 |
1975年 | 2327篇 |
1974年 | 2318篇 |
1973年 | 2322篇 |
1972年 | 1851篇 |
1971年 | 1747篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
81.
82.
83.
84.
ME Sutherlin I Nishimori T Caffrey EP Bennett H Hassan U Mandel D Mack T Iwamura H Clausen MA Hollingsworth 《Canadian Metallurgical Quarterly》1997,57(21):4744-4748
The levels of mRNA expression of three UDP-N-acetyl-alpha-D-galactosamine:polypeptide GalNAc N-acetylgalactosaminyltransferases (GalNAc-transferases) were quantified for human adenocarcinoma cell lines from pancreas, colon, stomach, and breast. Two of the GalNAc-transferases, GalNAc-T1 and GalNAc-T2, were expressed constitutively and at low levels in most or all cell lines examined. A third GalNAc-transferase, GalNAc-T3, was differentially expressed. Well-differentiated adenocarcinoma cell lines expressed high levels and moderately differentiated cell lines expressed lower levels of GalNAc-T3. Cell lines classified as poorly differentiated failed to express GalNAc-T3 mRNA at levels that could be detected by Northern blot analysis. Differential expression of the GalNAc-T3 protein was confirmed in these cell lines by Western blotting. We propose that glycosylation in tumor cell lines may be regulated in part by differential expression of GalNAc-transferases, and we suggest that GalNAc-T3 gene expression may be a molecular indicator of differentiated adenocarcinoma. 相似文献
85.
86.
CL Mesh BL Cmolik DW Van Heekeren JH Lee D Whittlesey LM Graham AS Geha SJ Bowlin 《Canadian Metallurgical Quarterly》1997,11(6):612-619
A premise of cardiac risk stratification is that the added risk of coronary artery bypass grafting (CABG) is offset by the improved safety of subsequent vascular reconstruction (VR). We questioned if elective CABG is patients with severe peripheral vascular disease (PVD) is a relatively high-risk procedure. A cohort study of 680 elective CABG patients from January 1993 to December 1994 was performed using three mutually exclusive outcomes of complication-free survival, morbidity, and mortality. Patient characteristic, operative, and outcome data were prospectively collected. Retrospective review determined that 58 patients had either a standard indication for or a history of VR. Overall CABG mortality was 2.5%, with statistically similar but relatively higher rates for PVD as compared to non-PVD patients. In contrast, major morbidity occurred at rates 3.6-fold higher in PVD patients (39.7%) than in disease-free patients (16.7%) after adjustment for the effects of patient and operative variables (odds ratio [OR] 3.67, 95% confidence interval [CI] 1.93-6.99). CABG morbidity in the PVD patient was most likely in those patients with aortoiliac (OR 9.51, CI 3.20-28.27) and aortic aneurysmal (OR 5.24, CI 1.28-21.41) disease types. CABG in PVD patients is associated with significant major morbidity. Such morbidity may preclude or alter the timing of subsequent VR. 相似文献
87.
88.
Graefe G. Linville A. Shapiro L.D. 《Knowledge and Data Engineering, IEEE Transactions on》1994,6(6):934-944
Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g. intersections, joins, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are often considered generally superior to sort-based algorithms such as merge-join. In this article, we compare the concepts behind sort- and hash-based query-processing algorithms and conclude that (1) many dualities exist between the two types of algorithms, (2) their costs differ mostly by percentages rather than by factors, (3) several special cases exist that favor one or the other choice, and (4) there is a strong reason why both hash- and sort-based algorithms should be available in a query-processing system. Our conclusions are supported by experiments performed using the Volcano query execution engine 相似文献
89.
Arguello F. Bruguera J.D. Doallo R. Zapata E.L. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(10):1091-1099
We present an unified parallel architecture for four of the most important fast orthogonal transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier (RFFT), Hartley (FHT), and Cosine (FCT). Out of these, only the CFFT has a data flow coinciding with the one generated by the successive doubling method, which can be transformed on a constant geometry flow using perfect unshuffle or shuffle permutations. The other three require some type of hardware modification to guarantee the constant geometry of the successive doubling method. We have defined a generalized processing section (PS), based on a circular CORDIC rotator, for the four transforms. This PS section permits the evaluation of the CFFT and FCT transforms in n data recirculations and the RFFT and FHT transforms in n-1 data recirculations, with n being the number of stages of a transform of length N=rn. Also, the efficiency of the partitioned parallel architecture is optimum because there is no cycle loss in the systolic computation of all the butterflies for each of the four transforms 相似文献
90.
Ju D.-C.R. Chuan-Lin Wu Carini P. 《Parallel and Distributed Systems, IEEE Transactions on》1994,5(10):1113-1120
We present a classification scheme for array language primitives that quantifies the variation in parallelism and data locality that results from the fusion of any two primitives. We also present an algorithm based on this scheme that efficiently determines when it is beneficial to fuse any two primitives. Experimental results show that five LINPACK routines report 50% performance improvement from the fusion of array operators 相似文献