全文获取类型
收费全文 | 7622篇 |
免费 | 1368篇 |
国内免费 | 1424篇 |
专业分类
电工技术 | 452篇 |
综合类 | 1166篇 |
化学工业 | 133篇 |
金属工艺 | 93篇 |
机械仪表 | 544篇 |
建筑科学 | 149篇 |
矿业工程 | 115篇 |
能源动力 | 67篇 |
轻工业 | 92篇 |
水利工程 | 73篇 |
石油天然气 | 62篇 |
武器工业 | 97篇 |
无线电 | 937篇 |
一般工业技术 | 418篇 |
冶金工业 | 82篇 |
原子能技术 | 12篇 |
自动化技术 | 5922篇 |
出版年
2024年 | 161篇 |
2023年 | 381篇 |
2022年 | 526篇 |
2021年 | 472篇 |
2020年 | 330篇 |
2019年 | 254篇 |
2018年 | 253篇 |
2017年 | 280篇 |
2016年 | 287篇 |
2015年 | 349篇 |
2014年 | 415篇 |
2013年 | 438篇 |
2012年 | 567篇 |
2011年 | 570篇 |
2010年 | 454篇 |
2009年 | 485篇 |
2008年 | 517篇 |
2007年 | 495篇 |
2006年 | 464篇 |
2005年 | 387篇 |
2004年 | 317篇 |
2003年 | 292篇 |
2002年 | 209篇 |
2001年 | 211篇 |
2000年 | 175篇 |
1999年 | 171篇 |
1998年 | 130篇 |
1997年 | 139篇 |
1996年 | 96篇 |
1995年 | 98篇 |
1994年 | 84篇 |
1993年 | 64篇 |
1992年 | 59篇 |
1991年 | 48篇 |
1990年 | 45篇 |
1989年 | 37篇 |
1988年 | 35篇 |
1987年 | 10篇 |
1986年 | 11篇 |
1985年 | 13篇 |
1984年 | 17篇 |
1983年 | 8篇 |
1982年 | 11篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 4篇 |
1976年 | 8篇 |
1975年 | 4篇 |
1974年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Luca Pietrobon Lorenzo Fallarino Andreas Berger Andrey Chuvilin Flix Casanova Luis E. Hueso 《Small (Weinheim an der Bergstrasse, Germany)》2015,11(47):6295-6301
Graphene has been predicted to develop a magnetic moment by proximity effect when placed on a ferromagnetic film, a promise that could open exciting possibilities in the fields of spintronics and magnetic data recording. In this work, the interplay between the magnetoresistance of graphene and the magnetization of an underlying ferromagnetic insulating film is studied in detail. A clear correlation between both magnitudes is observed but through a careful modeling of the magnetization and the weak localization measurements, that such correspondence can be explained by the effects of the magnetic stray fields arising from the ferromagnetic insulator is found. The results emphasize the complexity arising at the interface between magnetic and 2D materials. 相似文献
2.
本文在分析了双眼立体视觉面临的本质困难之后,提出了用金字塔图法匹配特征基元的三眼立体视觉方法,这种方法由于建筑在透视投影几何原理的稳固基础上,无须任何先验限制,也不以图象相似性为基础,故可较好地解决精度与匹配难度的矛盾,且运用金字塔图法进行匹配传播使在保证精度的基础上,匹配速度大大提高,对计算机人工图象的匹配结果表明,误匹配率几乎为零,且有较高的匹配速度和精度。 相似文献
3.
A system for person-independent classification of hand postures against complex backgrounds in video images is presented. The system employs elastic graph matching, which has already been successfully applied for object and face recognition. We use the bunch graph technique to model variance in hand posture appearance between different subjects and variance in backgrounds. Our system does not need a separate segmentation stage but closely integrates finding the object boundaries with posture classification. 相似文献
4.
本文基于静态相关性分析和动态调整相结合的方法,提出了一种逻辑程序的执行模型,它不仅开发了“与“并行,同进也开发了一定的“或“并行,从而有效地加速了逻辑程序的执行。 相似文献
5.
It seems clear that, for whatever reasons, the dementia of the Alzheimer type patient group (as well as other patient groups) exhibits behavior that is different from the normal control group. G. Storms, T. Dirikx, J. Saerens, S. Verstraeten, and P. P. De Deyn (2003) rightfully argue that the observed behavior (similarity judgments) does not tell us the source (cause) of the differences between the 2 groups. Rather, the focus of the study should be placed more on finding the ways the 2 groups are different. They also point out various methodological problems in some of the previous attempts to characterize the nature of the differences. Further methodological issues in G. Storms et al.'s study are examined. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
6.
7.
GIS中矢量图形的结构分析与VC++中的实现 总被引:2,自引:0,他引:2
简要讨论了GIS各类矢量图形元素间的空间拓朴结构及基位置关系 ,并用VC 6 . 0及MFC具体分析了圆弧与多边形区域的相交关系及实现。为利用VC开发专用图形软件提供了有用帮助。 相似文献
8.
A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the “sliding window” technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes’ numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity—O(n), where n denotes the number of nodes. 相似文献
9.
10.