全文获取类型
收费全文 | 260150篇 |
免费 | 3424篇 |
国内免费 | 822篇 |
专业分类
电工技术 | 5132篇 |
综合类 | 330篇 |
化学工业 | 37253篇 |
金属工艺 | 10252篇 |
机械仪表 | 8488篇 |
建筑科学 | 6107篇 |
矿业工程 | 1076篇 |
能源动力 | 6392篇 |
轻工业 | 22861篇 |
水利工程 | 2562篇 |
石油天然气 | 3908篇 |
武器工业 | 68篇 |
无线电 | 34743篇 |
一般工业技术 | 50086篇 |
冶金工业 | 46725篇 |
原子能技术 | 5419篇 |
自动化技术 | 22994篇 |
出版年
2021年 | 2036篇 |
2019年 | 2036篇 |
2018年 | 3469篇 |
2017年 | 3533篇 |
2016年 | 3729篇 |
2015年 | 2322篇 |
2014年 | 4048篇 |
2013年 | 11291篇 |
2012年 | 6566篇 |
2011年 | 8877篇 |
2010年 | 6987篇 |
2009年 | 7850篇 |
2008年 | 8681篇 |
2007年 | 8617篇 |
2006年 | 7804篇 |
2005年 | 7143篇 |
2004年 | 6891篇 |
2003年 | 6736篇 |
2002年 | 6375篇 |
2001年 | 6472篇 |
2000年 | 6172篇 |
1999年 | 6257篇 |
1998年 | 14291篇 |
1997年 | 10289篇 |
1996年 | 8132篇 |
1995年 | 6417篇 |
1994年 | 5720篇 |
1993年 | 5591篇 |
1992年 | 4556篇 |
1991年 | 4215篇 |
1990年 | 4051篇 |
1989年 | 3787篇 |
1988年 | 3624篇 |
1987年 | 3172篇 |
1986年 | 3073篇 |
1985年 | 3617篇 |
1984年 | 3387篇 |
1983年 | 3032篇 |
1982年 | 2855篇 |
1981年 | 2954篇 |
1980年 | 2763篇 |
1979年 | 2651篇 |
1978年 | 2502篇 |
1977年 | 2952篇 |
1976年 | 3585篇 |
1975年 | 2317篇 |
1974年 | 2315篇 |
1973年 | 2322篇 |
1972年 | 1855篇 |
1971年 | 1745篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
181.
182.
A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation
from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond
to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite
system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems
in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC
program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving
termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort,
merge-sort, merge, split, fair-split and append, etc., can be proved.
This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687
Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074.
M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in
the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs
from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer
science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für
Informatik, Saarbrücken until January 1997.
Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas
of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer
vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from
MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief
of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on
Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science.
R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in
the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and
verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a
faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological
University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of
Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International
Conferences and has been on the Editorial Committees. 相似文献
183.
184.
185.
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. 相似文献
186.
187.
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. 相似文献
188.
189.
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 相似文献
190.
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 相似文献