全文获取类型
收费全文 | 20705篇 |
免费 | 1662篇 |
国内免费 | 1477篇 |
专业分类
电工技术 | 1077篇 |
技术理论 | 2篇 |
综合类 | 3073篇 |
化学工业 | 932篇 |
金属工艺 | 303篇 |
机械仪表 | 1009篇 |
建筑科学 | 2514篇 |
矿业工程 | 457篇 |
能源动力 | 532篇 |
轻工业 | 562篇 |
水利工程 | 655篇 |
石油天然气 | 371篇 |
武器工业 | 120篇 |
无线电 | 1233篇 |
一般工业技术 | 2085篇 |
冶金工业 | 1029篇 |
原子能技术 | 114篇 |
自动化技术 | 7776篇 |
出版年
2024年 | 46篇 |
2023年 | 134篇 |
2022年 | 257篇 |
2021年 | 324篇 |
2020年 | 442篇 |
2019年 | 430篇 |
2018年 | 424篇 |
2017年 | 514篇 |
2016年 | 660篇 |
2015年 | 647篇 |
2014年 | 1401篇 |
2013年 | 1427篇 |
2012年 | 1576篇 |
2011年 | 1509篇 |
2010年 | 1273篇 |
2009年 | 1420篇 |
2008年 | 1438篇 |
2007年 | 1508篇 |
2006年 | 1339篇 |
2005年 | 1161篇 |
2004年 | 934篇 |
2003年 | 814篇 |
2002年 | 639篇 |
2001年 | 646篇 |
2000年 | 507篇 |
1999年 | 402篇 |
1998年 | 307篇 |
1997年 | 254篇 |
1996年 | 215篇 |
1995年 | 181篇 |
1994年 | 163篇 |
1993年 | 136篇 |
1992年 | 109篇 |
1991年 | 96篇 |
1990年 | 86篇 |
1989年 | 91篇 |
1988年 | 70篇 |
1987年 | 33篇 |
1986年 | 21篇 |
1985年 | 19篇 |
1984年 | 13篇 |
1983年 | 14篇 |
1982年 | 14篇 |
1981年 | 15篇 |
1964年 | 11篇 |
1963年 | 10篇 |
1961年 | 8篇 |
1959年 | 8篇 |
1957年 | 10篇 |
1955年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
41.
由于在机器人导航等领域新的图像装置不符合透视规则,无法运用传统的透视位置估计方法,采用吴氏零点分解方法,给出非透视3点问题的解析解.利用新图像装置的几何条件,建立了非透视3点方程系统. 相似文献
42.
Colzato Lorenza S.; Raffone Antonino; Hommel Bernhard 《Canadian Metallurgical Quarterly》2006,32(3):705
Four experiments were conducted to investigate the relationship between the binding of visual features (as measured by their aftereffects on subsequent binding) and the learning of feature-conjunction probabilities. Both binding and learning effects were obtained, but they did not interact. Interestingly, (shape-color) binding effects disappeared with increasing practice, presumably because of the fact that only 1 of the features involved was relevant to the task. However, this instability was only observed for arbitrary, not highly overlearned combinations of simple geometric features and not for real objects (colored pictures of a banana and strawberry), where binding effects were strong and resistant to practice. These findings suggest that learning has no direct impact on the strength or resistance of bindings or on speed with which features are bound; however, learning does affect the amount of attention particular feature dimensions attract, which again can influence which features are considered in binding. (PsycINFO Database Record (c) 2011 APA, all rights reserved) 相似文献
43.
Curry I. Guinn 《Knowledge》1994,7(4):277-278
Collaboration is more efficient when the most capable participant for each goal has initiative in directing the problem-solving for that goal. The paper describes a method for using a probabilistic analysis to create a mode-switching mechanism that selects which participant should control the collaborative problem solving so that efficiency is maximized. 相似文献
44.
针对铜鼓县小水电站联网时存在的问题及其不利影响进行了分析,井提出了改进途径,指出小水电站的联网改造应立足安全,争取效益。 相似文献
45.
This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented. 相似文献
46.
47.
48.
Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs. 相似文献
49.
We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n
2
log
n) toO(n log2
n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296. 相似文献
50.
陈金强 《数字社区&智能家居》2007,(9):1460-1461
中等职业学校一般开设VB、VC及数据库等涉及程序设计的计算机课程。本文拟就程序设计中一题多解的教学方法进行探讨。 相似文献