全文获取类型
收费全文 | 14731篇 |
免费 | 2403篇 |
国内免费 | 1649篇 |
专业分类
电工技术 | 893篇 |
综合类 | 1823篇 |
化学工业 | 546篇 |
金属工艺 | 316篇 |
机械仪表 | 1238篇 |
建筑科学 | 1071篇 |
矿业工程 | 320篇 |
能源动力 | 286篇 |
轻工业 | 244篇 |
水利工程 | 148篇 |
石油天然气 | 503篇 |
武器工业 | 326篇 |
无线电 | 3027篇 |
一般工业技术 | 1054篇 |
冶金工业 | 333篇 |
原子能技术 | 75篇 |
自动化技术 | 6580篇 |
出版年
2024年 | 81篇 |
2023年 | 189篇 |
2022年 | 413篇 |
2021年 | 431篇 |
2020年 | 450篇 |
2019年 | 438篇 |
2018年 | 433篇 |
2017年 | 559篇 |
2016年 | 628篇 |
2015年 | 714篇 |
2014年 | 1007篇 |
2013年 | 961篇 |
2012年 | 1212篇 |
2011年 | 1210篇 |
2010年 | 1057篇 |
2009年 | 1071篇 |
2008年 | 1054篇 |
2007年 | 1155篇 |
2006年 | 992篇 |
2005年 | 883篇 |
2004年 | 662篇 |
2003年 | 597篇 |
2002年 | 442篇 |
2001年 | 369篇 |
2000年 | 316篇 |
1999年 | 251篇 |
1998年 | 225篇 |
1997年 | 198篇 |
1996年 | 127篇 |
1995年 | 113篇 |
1994年 | 104篇 |
1993年 | 72篇 |
1992年 | 66篇 |
1991年 | 52篇 |
1990年 | 48篇 |
1989年 | 35篇 |
1988年 | 30篇 |
1987年 | 12篇 |
1986年 | 16篇 |
1985年 | 14篇 |
1984年 | 18篇 |
1983年 | 21篇 |
1982年 | 10篇 |
1981年 | 9篇 |
1980年 | 3篇 |
1979年 | 9篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 7篇 |
1959年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
52.
本文分析了柳州、云浮、宣化三厂预分解系统粘结堵塞、难以稳定生产和不能“达产达标”的原因,逐一介绍了三厂预分解系统技术改进的措施和效果,并就其技改工程经验进行了分析总结和探索思考. 相似文献
53.
为了改进Zernike矩边缘检测方法对非直线边缘检测精度低的弱点,提出了一种改进的基于Zernike矩方法和Sigmoid拟合法的边缘检测方法。用Zernike矩边缘检测方法检测边缘,然后用Sigmoid拟合方法检测边缘,根据边缘类型对两种方法检测的边缘结果进行加权求和,所得结果为边缘位置。分别利用理想图像和实际工业CT图像进行了实验验证,实验结果表明对非直线边缘的检测,该方法检测精度相对于Zernike矩方法提高了一个数量级。 相似文献
54.
多尺度空间特征提取的脊柱图像拼接算法 总被引:1,自引:0,他引:1
针对脊柱图像视野有限,提出一种基于优化MSFE的脊柱图像自动拼接算法。设计出一种基于尺度因子变化的高斯卷积模板尺寸自适应调整以及双向配对办法;相似性度量采用城市距离;利用RANSAC算法去除错配,从而确定待拼接图像之间的变换参数,最后利用加权平均对图像融合。对实际取得的多幅脊柱图像拼接结果表明该算法具有很好的实时性和鲁棒性。 相似文献
55.
Simulation of swirling combustion and NO formation using a USM turbulence-chemistry model 总被引:1,自引:0,他引:1
A unified second-order moment (USM) turbulence-chemistry model is used to simulate methane-air swirling combustion and NO formation for different swirl numbers. The simulation results are compared with those using the EBU-Arrhenius (E-A) combustion model, the simplified PDF model of NO formation in turbulent flows and the corresponding experimental results. The comparison indicates that the USM model is obviously better than the E-A model and the simplified PDF model. The E-A model cannot reasonably simulate the finite-rate kinetics, while the simplified PDF model, using a product of two single-variable PDF's instead of a joint PDF, remarkably under-predicts the NO reaction rate. The USM model gives the best agreement with the experimental results. Predictions show that as the swirl number increases the total NO formation at first decreases and then increases, which is in agreement with the experimental results. 相似文献
56.
A hierarchical scheme for elastic graph matching applied to hand gesture recognition is proposed. The proposed algorithm exploits the relative discriminatory capabilities of visual features scattered on the images, assigning the corresponding weights to each feature. A boosting algorithm is used to determine the structure of the hierarchy of a given graph. The graph is expressed by annotating the nodes of interest over the target object to form a bunch graph. Three annotation techniques, manual, semi-automatic, and automatic annotation are used to determine the position of the nodes. The scheme and the annotation approaches are applied to explore the hand gesture recognition performance. A number of filter banks are applied to hand gestures images to investigate the effect of using different feature representation approaches. Experimental results show that the hierarchical elastic graph matching (HEGM) approach classified the hand posture with a gesture recognition accuracy of 99.85% when visual features were extracted by utilizing the Histogram of Oriented Gradient (HOG) representation. The results also provide the performance measures from the aspect of recognition accuracy to matching benefits, node positions correlation and consistency on three annotation approaches, showing that the semi-automatic annotation method is more efficient and accurate than the other two methods. 相似文献
57.
《Pattern recognition》2014,47(2):588-602
Fingerprint matching has emerged as an effective tool for human recognition due to the uniqueness, universality and invariability of fingerprints. Many different approaches have been proposed in the literature to determine faithfully if two fingerprint images belong to the same person. Among them, minutiae-based matchers highlight as the most relevant techniques because of their discriminative capabilities, providing precise results. However, performing a fingerprint identification over a large database can be an inefficient task due to the lack of scalability and high computing times of fingerprint matching algorithms.In this paper, we propose a distributed framework for fingerprint matching to tackle large databases in a reasonable time. It provides a general scheme for any kind of matcher, so that its precision is preserved and its time of response can be reduced.To test the proposed system, we conduct an extensive study that involves both synthetic and captured fingerprint databases, which have different characteristics, analyzing the performance of three well-known minutiae-based matchers within the designed framework. With the available hardware resources, our distributed model is able to address up to 400 000 fingerprints in approximately half a second. Additional details are provided at http://sci2s.ugr.es/ParallelMatching. 相似文献
58.
This paper addresses the problem of reinforcing the ability of the k-NN classification of handwritten characters via distortion-tolerant template matching techniques with a limited quantity of data. We compare three kinds of matching techniques: the conventional simple correlation, the tangent distance, and the global affine transformation (GAT) correlation. Although the k-NN classification method is straightforward and powerful, it consumes a lot of time. Therefore, to reduce the computational cost of matching in k-NN classification, we propose accelerating the GAT correlation method by reformulating its computational model and adopting efficient lookup tables. Recognition experiments performed on the IPTP CDROM1B handwritten numerical database show that the matching techniques of the simple correlation, the tangent distance, and the accelerated GAT correlation achieved recognition rates of 97.07%, 97.50%, and 98.70%, respectively. The computation time ratios of the tangent distance and the accelerated GAT correlation to the simple correlation are 26.3 and 36.5 to 1.0, respectively. 相似文献
59.
In this article, we consider a receding horizon control of discrete-time state-dependent jump linear systems, a particular kind of stochastic switching systems, subject to possibly unbounded random disturbances and probabilistic state constraints. Due to the nature of the dynamical system and the constraints, we consider a one-step receding horizon. Using inverse cumulative distribution function, we convert the probabilistic state constraints to deterministic constraints, and obtain a tractable deterministic receding horizon control problem. We consider the receding horizon control law to have a linear state-feedback and an admissible offset term. We ensure mean square boundedness of the state variable via solving linear matrix inequalities off-line, and solve the receding horizon control problem on-line with control offset terms. We illustrate the overall approach applied on a macroeconomic system. 相似文献
60.
在时空数据中有一类表示用户在某一时间到达某一地点的数据——到达数据,到达数据可以是社交网站的签到数据、轨迹数据中的停留点及公共交通中乘客抵达的位置数据,这些数据的聚簇可以反映用户的聚集行为.基于到达数据,提出一类新的时空数据查询——时空异常聚簇发现.将到达数据进行周期性划分,通过时空聚类算法对一个时间段的数据进行聚类,比较不同时间段内聚簇的差异度,发现具有最大簇异常度的前k个簇.通过该查询发现的时空异常聚簇可以应用于城市安全管理、基于位置的服务和交通调度等方面.定义了异常簇查询模型,提出了针对任意形状聚簇的簇差异度度量,将异常簇查询转化为二分图最大匹配问题,对二分图构建与匹配进行了优化并提出了高效的查询算法.利用真实数据集进行了充分实验,验证了查询结果的实际意义,评估了所提出的各查询算法在不同参数设置下的查询效率. 相似文献