全文获取类型
收费全文 | 125836篇 |
免费 | 11448篇 |
国内免费 | 6892篇 |
专业分类
电工技术 | 9032篇 |
技术理论 | 10篇 |
综合类 | 9442篇 |
化学工业 | 19615篇 |
金属工艺 | 7241篇 |
机械仪表 | 8068篇 |
建筑科学 | 10573篇 |
矿业工程 | 3484篇 |
能源动力 | 3604篇 |
轻工业 | 8769篇 |
水利工程 | 2641篇 |
石油天然气 | 7108篇 |
武器工业 | 1135篇 |
无线电 | 14778篇 |
一般工业技术 | 14694篇 |
冶金工业 | 5235篇 |
原子能技术 | 1534篇 |
自动化技术 | 17213篇 |
出版年
2024年 | 586篇 |
2023年 | 2105篇 |
2022年 | 3849篇 |
2021年 | 5359篇 |
2020年 | 4089篇 |
2019年 | 3317篇 |
2018年 | 3574篇 |
2017年 | 4099篇 |
2016年 | 3776篇 |
2015年 | 4993篇 |
2014年 | 6470篇 |
2013年 | 7546篇 |
2012年 | 8704篇 |
2011年 | 9211篇 |
2010年 | 8213篇 |
2009年 | 7952篇 |
2008年 | 7923篇 |
2007年 | 7373篇 |
2006年 | 7200篇 |
2005年 | 5982篇 |
2004年 | 4206篇 |
2003年 | 3709篇 |
2002年 | 3784篇 |
2001年 | 3495篇 |
2000年 | 3046篇 |
1999年 | 2758篇 |
1998年 | 2012篇 |
1997年 | 1689篇 |
1996年 | 1488篇 |
1995年 | 1278篇 |
1994年 | 1038篇 |
1993年 | 751篇 |
1992年 | 604篇 |
1991年 | 462篇 |
1990年 | 394篇 |
1989年 | 306篇 |
1988年 | 233篇 |
1987年 | 152篇 |
1986年 | 127篇 |
1985年 | 86篇 |
1984年 | 59篇 |
1983年 | 36篇 |
1982年 | 53篇 |
1981年 | 35篇 |
1980年 | 28篇 |
1979年 | 10篇 |
1976年 | 2篇 |
1974年 | 1篇 |
1959年 | 6篇 |
1951年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 8 毫秒
81.
82.
83.
To efficiently perform morphological operations on neighborhood-processing-based parallel image computers, we need to decompose structuring elements larger than the neighborhood that can be directly handled into neighborhood subsets. In the special case that the structuring element is a convex polygon, there are known decomposition algorithms in the literature. In this paper, we give an algorithm for the optimal decomposition of arbitrarily shaped structuring elements, enabling an optimal implementation of morphological operations on neighborhood-connected parallel computers in the general case. 相似文献
84.
85.
Determination of the epitope of an inhibitory antibody to proliferating cell nuclear antigen 总被引:1,自引:0,他引:1
G Roos Y Jiang G Landberg NH Nielsen P Zhang MY Lee 《Canadian Metallurgical Quarterly》1996,226(1):208-213
We identified an expansion of the CAG trinucleotide repeat in the coding region of the Machado-Joseph disease gene in 7 of 24 American families diagnosed with autosomal dominant ataxia. All affected individuals were heterozygous for an expanded allele that ranged from 67 to more than 200 CAG repeats, whereas the normal allele had 14 to 33 repeats. In contrast to the Azorean-Portuguese origins of Machado-Joseph disease, the two largest American families were of German and Dutch-African descent. Clinical, pathologic, and genetic evaluations suggest that American families with spinocerebellar ataxia type 3 differ from those with Machado-Joseph disease by their ethnic origins, predominant spinopontine atrophy, lack of dystonic features, and larger CAG repeat expansion. 相似文献
86.
任怡 《电脑编程技巧与维护》2012,(18):45-47
每届足球世界杯都会受到无数人的关注,媒体和个人都很热衷比赛结果的预测。该程序根据世界杯比赛胜负出线规则对比赛结果进行预测。 相似文献
87.
Applied Intelligence - Personnel performance is a key factor to maintain core competitive advantages. Thus, predicting personnel future performance is a significant research domain in human... 相似文献
88.
Monodisperse silica particles of about 0.3m diameter are suspended in methacrylate monomer using a carefully selected dispersant. Many steric dispersants are hydrocarbon chains with a reactive end-group. These are not effective as dispersants for silica in moderately polar solvents, such as esters and the methacrylate monomers. Good dispersion was obtained with a methacrylate polymer terminated by a chlorosilane end group. Settling or centrifugation of these unagglomerated dispersions gives well-packed particle beds. Polymerization of the surrounding monomer produces composite materials with high packing fractions and a high degree of regularity. Moduli and strengths of these composites are reported. 相似文献
89.
Summary Byzantine Agreement is important both in the theory and practice of distributed computing. However, protocols to reach Byzantine Agreement are usually expensive both in the time required as well as in the number of messages exchanged. In this paper, we present a self-adjusting approach to the problem. The Mostly Byzantine Agreement is proposed as a more restrictive agreement problem that requires that in the consecutive attempts to reach agreement, the number of disagreements (i.e., failures to reach Byzantine Agreement) is finite. Fort faulty processes, we give an algorithm that has at mostt disagreements for 4t or more processes. Another algorithm is given forn3t+1 processes with the number of disagreements belowt
2/2. Both algorithms useO(n
3) message bits for binary value agreement.
Yi Zhao is currently working on his Ph.D. degree in Computer Science at University of Houston. His research interests include fault tolerance, distributed computing, parallel computation and neural networks. He obtained his M.S. from University of Houston in 1988 and B.S. from Beijing University of Aeronautics and Astronautics in 1984, both in computer science.
Farokh B. Bastani received the B. Tech. degree in electrical engineering from the Indian Institute of Technology, Bombay, India, and the M.S. and Ph.D. degrees in electrical engineering and computer science from the University of California, Berkeley. He joined the University of Houston in 1980, where he is currently an Associate Professor of Computer Science. His research interests include software design and validation techniques, distributed systems, and fault-tolerant systems. He is a member of the ACM and the IEEE and is on the editorial board of theIEEE Transactions on Software Engineering. 相似文献
90.
Qiu Jun Wang Yueting Wu Peng Jiang Shan Cui Kaibo Chen Guowei Liu Dongliang Cui Guangwen 《Journal of Porous Materials》2021,28(6):1675-1687
Journal of Porous Materials - The dynamics and thermodynamics of adsorption of hexadecyl ammonium with different numbers of carbon chains in montmorillonite (Mt) with different layer charge density... 相似文献