全文获取类型
收费全文 | 476743篇 |
免费 | 5631篇 |
国内免费 | 1572篇 |
专业分类
电工技术 | 9221篇 |
综合类 | 516篇 |
化学工业 | 68373篇 |
金属工艺 | 18242篇 |
机械仪表 | 14792篇 |
建筑科学 | 11477篇 |
矿业工程 | 1836篇 |
能源动力 | 12711篇 |
轻工业 | 39960篇 |
水利工程 | 4431篇 |
石油天然气 | 6540篇 |
武器工业 | 80篇 |
无线电 | 63224篇 |
一般工业技术 | 92250篇 |
冶金工业 | 90413篇 |
原子能技术 | 9518篇 |
自动化技术 | 40362篇 |
出版年
2021年 | 3883篇 |
2020年 | 2894篇 |
2019年 | 3640篇 |
2018年 | 6215篇 |
2017年 | 6306篇 |
2016年 | 6605篇 |
2015年 | 4232篇 |
2014年 | 7406篇 |
2013年 | 21303篇 |
2012年 | 11745篇 |
2011年 | 16167篇 |
2010年 | 12842篇 |
2009年 | 14572篇 |
2008年 | 15603篇 |
2007年 | 15487篇 |
2006年 | 13957篇 |
2005年 | 12507篇 |
2004年 | 12110篇 |
2003年 | 12214篇 |
2002年 | 11423篇 |
2001年 | 11850篇 |
2000年 | 11189篇 |
1999年 | 11736篇 |
1998年 | 29042篇 |
1997年 | 20404篇 |
1996年 | 15787篇 |
1995年 | 12146篇 |
1994年 | 10813篇 |
1993年 | 10703篇 |
1992年 | 7968篇 |
1991年 | 7576篇 |
1990年 | 7320篇 |
1989年 | 6891篇 |
1988年 | 6655篇 |
1987年 | 5777篇 |
1986年 | 5610篇 |
1985年 | 6379篇 |
1984年 | 5902篇 |
1983年 | 5476篇 |
1982年 | 5135篇 |
1981年 | 5082篇 |
1980年 | 4876篇 |
1979年 | 4646篇 |
1978年 | 4309篇 |
1977年 | 5206篇 |
1976年 | 6784篇 |
1975年 | 3863篇 |
1974年 | 3776篇 |
1973年 | 3773篇 |
1972年 | 3130篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
111.
JM Rumsey BC Donohue DR Brady K Nace JN Giedd P Andreason 《Canadian Metallurgical Quarterly》1997,54(12):1481-1489
The influence of ionic strength and composition on the binding and inhibition of human leukocyte elastase by glycosaminoglycans with variable degree and position of sulfation was investigated. The kinetic mechanism of inhibition had a hyperbolic, mixed-type character with a competitive component that was promoted by low ionic strength, reduced by phosphate ions, and which also depended on the substrate and glycosaminoglycan structure. Enzyme binding was a cooperative phenomenon that varied with ionic strength and composition. The inhibition patterns correlated with the cationic character of elastase and with the distribution of arginines on its molecular surface, most notably with residues located in the vicinity of the substrate binding region. The order of affinity for elastase binding was chondroitin 4-sulfate < chondroitin 6-sulfate < dermatan sulfate, iduronate-containing derivatives being superior with respect to the glucuronate-containing counterparts. Additional sulfation at both the 4- and 6- positions or at the N- and 4-positions of the N-acetylgalactosamine moiety decidedly improved the inhibitory efficiency. The results highlight a fundamental physiological role of enzyme-glycosaminoglycan interactions. In the azurophil granule of the human polymorphonuclear neutrophil, elastase and other enzymes are bound to a matrix of chondroitin 4-sulfate because this is the only glycosaminoglycan that simultaneously offers good binding for enzyme compartmentalization together with prompt release from the bound state at the onset of phagocytosis. 相似文献
112.
113.
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. 相似文献
114.
115.
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. 相似文献
116.
117.
We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations 相似文献
118.
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 相似文献
119.
We propose and evaluate a parallel “decomposite best-first” search branch-and-bound algorithm (dbs) for MIN-based multiprocessor systems. We start with a new probabilistic model to estimate the number of evaluated nodes for a serial best-first search branch-and-bound algorithm. This analysis is used in predicting the parallel algorithm speed-up. The proposed algorithm initially decomposes a problem into N subproblems, where N is the number of processors available in a multiprocessor. Afterwards, each processor executes the serial best-first search to find a local feasible solution. Local solutions are broadcasted through the network to compute the final solution. A conflict-free mapping scheme, known as the step-by-step spread, is used for subproblem distribution on the MIN. A speedup expression for the parallel algorithm is then derived using the serial best-first search node evaluation model. Our analysis considers both computation and communication overheads for providing realistic speed-up. Communication modeling is also extended for the parallel global best-first search technique. All the analytical results are validated via simulation. For large systems, when communication overhead is taken into consideration, it is observed that the parallel decomposite best-first search algorithm provides better speed-up compared to other reported schemes 相似文献
120.
Considers the applicability of algorithm based fault tolerance (ABET) to massively parallel scientific computation. Existing ABET schemes can provide effective fault tolerance at a low cost For computation on matrices of moderate size; however, the methods do not scale well to floating-point operations on large systems. This short note proposes the use of a partitioned linear encoding scheme to provide scalability. Matrix algorithms employing this scheme are presented and compared to current ABET schemes. It is shown that the partitioned scheme provides scalable linear codes with improved numerical properties with only a small increase in hardware and time overhead 相似文献