全文获取类型
收费全文 | 71829篇 |
免费 | 13458篇 |
国内免费 | 9680篇 |
专业分类
电工技术 | 8586篇 |
技术理论 | 1篇 |
综合类 | 9113篇 |
化学工业 | 1421篇 |
金属工艺 | 1292篇 |
机械仪表 | 5409篇 |
建筑科学 | 1260篇 |
矿业工程 | 969篇 |
能源动力 | 1423篇 |
轻工业 | 688篇 |
水利工程 | 1121篇 |
石油天然气 | 797篇 |
武器工业 | 1271篇 |
无线电 | 12620篇 |
一般工业技术 | 4571篇 |
冶金工业 | 690篇 |
原子能技术 | 272篇 |
自动化技术 | 43463篇 |
出版年
2024年 | 516篇 |
2023年 | 1246篇 |
2022年 | 2444篇 |
2021年 | 2628篇 |
2020年 | 2905篇 |
2019年 | 2451篇 |
2018年 | 2422篇 |
2017年 | 2914篇 |
2016年 | 3358篇 |
2015年 | 4038篇 |
2014年 | 5198篇 |
2013年 | 5083篇 |
2012年 | 6279篇 |
2011年 | 6556篇 |
2010年 | 5315篇 |
2009年 | 5482篇 |
2008年 | 5833篇 |
2007年 | 6223篇 |
2006年 | 4868篇 |
2005年 | 4031篇 |
2004年 | 3218篇 |
2003年 | 2545篇 |
2002年 | 1909篇 |
2001年 | 1515篇 |
2000年 | 1278篇 |
1999年 | 964篇 |
1998年 | 786篇 |
1997年 | 627篇 |
1996年 | 487篇 |
1995年 | 344篇 |
1994年 | 293篇 |
1993年 | 228篇 |
1992年 | 214篇 |
1991年 | 110篇 |
1990年 | 137篇 |
1989年 | 100篇 |
1988年 | 70篇 |
1987年 | 27篇 |
1986年 | 39篇 |
1985年 | 39篇 |
1984年 | 26篇 |
1983年 | 32篇 |
1982年 | 38篇 |
1981年 | 23篇 |
1980年 | 31篇 |
1979年 | 15篇 |
1978年 | 15篇 |
1977年 | 12篇 |
1975年 | 16篇 |
1959年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
181.
Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans 总被引:14,自引:0,他引:14
A mobile robot exploring an unknown environment has no absolute frame of reference for its position, other than features it detects through its sensors. Using distinguishable landmarks is one possible approach, but it requires solving the object recognition problem. In particular, when the robot uses two-dimensional laser range scans for localization, it is difficult to accurately detect and localize landmarks in the environment (such as corners and occlusions) from the range scans.In this paper, we develop two new iterative algorithms to register a range scan to a previous scan so as to compute relative robot positions in an unknown environment, that avoid the above problems. The first algorithm is based on matching data points with tangent directions in two scans and minimizing a distance function in order to solve the displacement between the scans. The second algorithm establishes correspondences between points in the two scans and then solves the point-to-point least-squares problem to compute the relative pose of the two scans. Our methods work in curved environments and can handle partial occlusions by rejecting outliers. 相似文献
182.
183.
对溢洪闸门自动监控系统中几个问题的探讨 总被引:1,自引:1,他引:0
结合某水电站介绍了溢洪闸门自动监控系统的结构、功能,讨论了该研制过程中的几个问题的解决办法. 相似文献
184.
185.
Ibrahim H. Osman Nicos Christofides 《International Transactions in Operational Research》1994,1(3):317-336
The capacitated clustering problem (CCP) is the problem in which a given set of weighted objects is to be partitioned into clusters so that the total weight of objects in each cluster is less than a given value (cluster ‘capacity’). The objective is to minimize the total scatter of objects from the ‘centre’ of the cluster to which they have been allocated. A simple constructive heuristic, a R-interchange generation mechanism, a hybrid simulated annealing (SA) and tabu search (TS) algorithm which has computationally desirable features using a new non-monotonic cooling schedule, are developed. A classification of the existing SA cooling schedules is presented. The effects on the final solution quality of the initial solutions, the cooling schedule parameters and the neighbourhood search strategies are investigated. Computational results on randomly generated problems with size ranging from 50 to 100 customers indicate that the hybrid SA/TS algorithm out-performs previous simulated annealing algorithms, a simple tabu search and local descent algorithms. 相似文献
186.
187.
188.
在讨论MPT1327信令的集群移动通信系统与国内No.7信令的PSTN网间互连,帝现两种信令配合中,研究了集群系统的仿真模型和模拟算法,同时模拟出整个集群系统的工作情况,运行结果证实了所提方案的可行性与准确性。 相似文献
189.
190.
ßBarrels are widespread and well-studied featuresof a great many protein structures. In this paper an unsuper-visedmethod for the detection of P-barrels is developed based ontechniques from graph theory. The hydrogen bonded connectivityof ß-sheets is derived using standard pattern recognitiontechniques and expressed as a graph. Barrels correspond to topologicalrings in these connectivity graphs and can thus be identifiedusing ring perception algorithms. Following from this, the characteristictopological structure of a barrel can be expressed using a novelform of reduced nomenclature that counts sequence separationsbetween successive members of the ring set These techniquesare tested by applying them to the detection of barrels in anon-redundant subset of the Brookhaven database. Results indicatethat topological rings do seem to correspond uniquely to ß-barrelsand that the technique, as implemented, finds the majority ofbarrels present in the dataset. 相似文献