全文获取类型
收费全文 | 19370篇 |
免费 | 3470篇 |
国内免费 | 2503篇 |
专业分类
电工技术 | 1231篇 |
技术理论 | 2篇 |
综合类 | 2209篇 |
化学工业 | 487篇 |
金属工艺 | 622篇 |
机械仪表 | 1798篇 |
建筑科学 | 828篇 |
矿业工程 | 427篇 |
能源动力 | 356篇 |
轻工业 | 334篇 |
水利工程 | 206篇 |
石油天然气 | 559篇 |
武器工业 | 379篇 |
无线电 | 3875篇 |
一般工业技术 | 1426篇 |
冶金工业 | 413篇 |
原子能技术 | 79篇 |
自动化技术 | 10112篇 |
出版年
2024年 | 146篇 |
2023年 | 374篇 |
2022年 | 761篇 |
2021年 | 741篇 |
2020年 | 812篇 |
2019年 | 661篇 |
2018年 | 643篇 |
2017年 | 810篇 |
2016年 | 898篇 |
2015年 | 1035篇 |
2014年 | 1357篇 |
2013年 | 1344篇 |
2012年 | 1644篇 |
2011年 | 1604篇 |
2010年 | 1389篇 |
2009年 | 1363篇 |
2008年 | 1368篇 |
2007年 | 1463篇 |
2006年 | 1265篇 |
2005年 | 1103篇 |
2004年 | 790篇 |
2003年 | 770篇 |
2002年 | 540篇 |
2001年 | 437篇 |
2000年 | 363篇 |
1999年 | 299篇 |
1998年 | 234篇 |
1997年 | 210篇 |
1996年 | 165篇 |
1995年 | 139篇 |
1994年 | 120篇 |
1993年 | 89篇 |
1992年 | 64篇 |
1991年 | 58篇 |
1990年 | 57篇 |
1989年 | 45篇 |
1988年 | 21篇 |
1987年 | 8篇 |
1986年 | 19篇 |
1985年 | 18篇 |
1984年 | 26篇 |
1983年 | 22篇 |
1982年 | 13篇 |
1981年 | 9篇 |
1980年 | 4篇 |
1979年 | 10篇 |
1978年 | 8篇 |
1977年 | 5篇 |
1976年 | 7篇 |
1975年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
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. 相似文献
102.
《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. 相似文献
103.
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. 相似文献
104.
The prototyping of complex sheet metal parts using single point incremental forming (SPIF) requires the generation of optimal tool paths and/or tool path sequences that ensure that the formed part is within geometric design specifications. The presence of a multitude of features on complex parts leads to multiple inaccuracy inducing phenomena occurring simultaneously due to interactions between the features. This paper proposes a network analysis methodology using topological conceptual graphs to capture the effects of different phenomena on the final accuracy of a sheet metal part manufactured by SPIF. Using this framework optimized tool paths can be generated that compensate for the inaccuracy inducing behavior. Tool path generation algorithms to create partial tool paths that account for the accuracy of specific features in the part based on the proposed framework are also presented. Finally, the creation of integrated tool paths maintaining complementarity between tool paths and desired continuity behavior using non-uniform cubic B-splines is illustrated. A number of case studies demonstrating the applicability of the integrated framework are discussed, where the maximum deviations in the part are significantly reduced and the average absolute deviations for the complete part are brought down to less than 0.5 mm. 相似文献
105.
106.
This paper presents the trajectory tracking control of an autonomous underwater vehicle(AUV). To cope with parametric uncertainties owing to the hydrodynamic effect, an adaptive control law is developed for the AUV to track the desired trajectory. This desired state-dependent regressor matrix-based controller provides consistent results under hydrodynamic parametric uncertainties.Stability of the developed controller is verified using the Lyapunov s direct method. Numerical simulations are carried out to study the efficacy of the proposed adaptive controller. 相似文献
107.
108.
用无向网表示学校的平面图,设计了该平面图的存储结构,并应用最短路径算法实现了查询图中各景点的相关信息,以及查询图中任意两个景点间的最短路径的功能;应用克鲁斯卡尔算法构造该平面图的最小生成树,求出可以连通所有景点的最短路径。该系统为新生熟悉校园环境提供了方便。 相似文献
109.
针对移动机器人路径规划问题,提出一种基于QPSO算法的路径规划方法,并用概率论的方法分析了移动机器人路径规划的收敛性,阐明了该方法随均匀分布和正态分布的参数关系和收敛区间;然后根据移动机器人的运动特征提出一种改进的轨迹规划方法。移动机器人平台的实验结果表明了该方法在移动机器人路径规划中的有效性和可行性。 相似文献
110.
在时空数据中有一类表示用户在某一时间到达某一地点的数据——到达数据,到达数据可以是社交网站的签到数据、轨迹数据中的停留点及公共交通中乘客抵达的位置数据,这些数据的聚簇可以反映用户的聚集行为.基于到达数据,提出一类新的时空数据查询——时空异常聚簇发现.将到达数据进行周期性划分,通过时空聚类算法对一个时间段的数据进行聚类,比较不同时间段内聚簇的差异度,发现具有最大簇异常度的前k个簇.通过该查询发现的时空异常聚簇可以应用于城市安全管理、基于位置的服务和交通调度等方面.定义了异常簇查询模型,提出了针对任意形状聚簇的簇差异度度量,将异常簇查询转化为二分图最大匹配问题,对二分图构建与匹配进行了优化并提出了高效的查询算法.利用真实数据集进行了充分实验,验证了查询结果的实际意义,评估了所提出的各查询算法在不同参数设置下的查询效率. 相似文献