全文获取类型
收费全文 | 4839篇 |
免费 | 298篇 |
国内免费 | 279篇 |
专业分类
电工技术 | 79篇 |
综合类 | 92篇 |
化学工业 | 49篇 |
金属工艺 | 197篇 |
机械仪表 | 585篇 |
建筑科学 | 111篇 |
矿业工程 | 27篇 |
能源动力 | 17篇 |
轻工业 | 33篇 |
水利工程 | 11篇 |
石油天然气 | 114篇 |
武器工业 | 12篇 |
无线电 | 659篇 |
一般工业技术 | 160篇 |
冶金工业 | 23篇 |
原子能技术 | 5篇 |
自动化技术 | 3242篇 |
出版年
2024年 | 13篇 |
2023年 | 100篇 |
2022年 | 138篇 |
2021年 | 170篇 |
2020年 | 158篇 |
2019年 | 104篇 |
2018年 | 117篇 |
2017年 | 146篇 |
2016年 | 197篇 |
2015年 | 190篇 |
2014年 | 309篇 |
2013年 | 238篇 |
2012年 | 266篇 |
2011年 | 351篇 |
2010年 | 238篇 |
2009年 | 273篇 |
2008年 | 213篇 |
2007年 | 290篇 |
2006年 | 263篇 |
2005年 | 265篇 |
2004年 | 222篇 |
2003年 | 225篇 |
2002年 | 166篇 |
2001年 | 113篇 |
2000年 | 122篇 |
1999年 | 113篇 |
1998年 | 113篇 |
1997年 | 67篇 |
1996年 | 56篇 |
1995年 | 33篇 |
1994年 | 21篇 |
1993年 | 27篇 |
1992年 | 11篇 |
1991年 | 5篇 |
1990年 | 9篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1986年 | 5篇 |
1985年 | 6篇 |
1984年 | 4篇 |
1983年 | 7篇 |
1982年 | 7篇 |
1981年 | 11篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 7篇 |
1977年 | 2篇 |
1976年 | 6篇 |
1974年 | 3篇 |
1973年 | 1篇 |
排序方式: 共有5416条查询结果,搜索用时 15 毫秒
51.
《Expert systems with applications》2014,41(13):5938-5947
In this paper, genetic algorithm oriented latent semantic features (GALSF) are proposed to obtain better representation of documents in text classification. The proposed approach consists of feature selection and feature transformation stages. The first stage is carried out using the state-of-the-art filter-based methods. The second stage employs latent semantic indexing (LSI) empowered by genetic algorithm such that a better projection is attained using appropriate singular vectors, which are not limited to the ones corresponding to the largest singular values, unlike standard LSI approach. In this way, the singular vectors with small singular values may also be used for projection whereas the vectors with large singular values may be eliminated as well to obtain better discrimination. Experimental results demonstrate that GALSF outperforms both LSI and filter-based feature selection methods on benchmark datasets for various feature dimensions. 相似文献
52.
《Expert systems with applications》2014,41(15):6755-6772
We present a novel hybrid algorithm for Bayesian network structure learning, called H2PC. It first reconstructs the skeleton of a Bayesian network and then performs a Bayesian-scoring greedy hill-climbing search to orient the edges. The algorithm is based on divide-and-conquer constraint-based subroutines to learn the local structure around a target variable. We conduct two series of experimental comparisons of H2PC against Max–Min Hill-Climbing (MMHC), which is currently the most powerful state-of-the-art algorithm for Bayesian network structure learning. First, we use eight well-known Bayesian network benchmarks with various data sizes to assess the quality of the learned structure returned by the algorithms. Our extensive experiments show that H2PC outperforms MMHC in terms of goodness of fit to new data and quality of the network structure with respect to the true dependence structure of the data. Second, we investigate H2PC’s ability to solve the multi-label learning problem. We provide theoretical results to characterize and identify graphically the so-called minimal label powersets that appear as irreducible factors in the joint distribution under the faithfulness condition. The multi-label learning problem is then decomposed into a series of multi-class classification problems, where each multi-class variable encodes a label powerset. H2PC is shown to compare favorably to MMHC in terms of global classification accuracy over ten multi-label data sets covering different application domains. Overall, our experiments support the conclusions that local structural learning with H2PC in the form of local neighborhood induction is a theoretically well-motivated and empirically effective learning framework that is well suited to multi-label learning. The source code (in R) of H2PC as well as all data sets used for the empirical tests are publicly available. 相似文献
53.
局部保持投影LPP(Locality Preserving Projection)是一种有效的非线性降维方法,能够使投影降维后的数据与原输入空间中的相似局部结构保持一致,但是该方法没有充分利用类间样本点的权重等重要信息。为了解决这个问题,提出基于Fisher准则的多流形判别分析FMMDA(Fisher Multi-Manifold Discriminant Analysis)方法。结合Fisher准则训练样本类内拉普拉斯图和样本均值类间拉普拉斯图,既保持了原样本的相似局部结构,又充分地利用了不同类别之间的权重。在ORL及Yale人脸库上验证了该方法的有效性。与其他几种最先进的方法相比,FMMDA方法取得了更好的识别效果。 相似文献
54.
Font recognition is useful for improving optical text recognition systems’ accuracy and time, and to restore the documents’ original formats. This paper addresses a need for Arabic font recognition research by introducing an Arabic font recognition database consisting of 40 fonts, 10 sizes (ranging from 8 to 24 points) and 4 styles (viz. normal, bold, italic, and bold–italic). The database is split into three sets (viz. training, validation, and testing). The database is freely available to researchers.1 Moreover, we introduce a baseline font recognition system for benchmarking purposes, and report identification rates on our KAFD database and the Arabic Printed Text Image (APTI) database with 20 and 10 fonts, respectively. The best recognition rates are achieved using log-Gabor filters. 相似文献
55.
In this paper, a simple technique is proposed for face recognition among many human faces. It is based on the polynomial coefficients, covariance matrix and algorithm on common eigenvalues. The main advantage of the proposed approach is that the identification of similarity between human faces is carried out without computing actual eigenvalues and eigenvectors. A symmetric matrix is calculated using the polynomial coefficients-based companion matrices of two compared images. The nullity of a calculated symmetric matrix is used as similarity measure for face recognition. The value of nullity is very small for dissimilar images and distinctly large for similar face images. The feasibility of the propose approach is demonstrated on three face databases, i.e., the ORL database, the Yale database B and the FERET database. Experimental results have shown the effectiveness of the proposed approach for feature extraction and classification of the face images having large variation in pose and illumination. 相似文献
56.
Cluster ensemble approaches make use of a set of clustering solutions which are derived from different data sources to gain a more comprehensive and significant clustering result over conventional single clustering approaches. Unfortunately, not all the clustering solutions in the ensemble contribute to the final result. In this paper, we focus on the clustering solution selection strategy in the cluster ensemble, and propose to view clustering solutions as features such that suitable feature selection techniques can be used to perform clustering solution selection. Furthermore, a hybrid clustering solution selection strategy (HCSS) is designed based on a proposed weighting function, which combines several feature selection techniques for the refinement of clustering solutions in the ensemble. Finally, a new measure is designed to evaluate the effectiveness of clustering solution selection strategies. The experimental results on both UCI machine learning datasets and cancer gene expression profiles demonstrate that HCSS works well on most of the datasets, obtains more desirable final results, and outperforms most of the state-of-the-art clustering solution selection strategies. 相似文献
57.
Multiset canonical correlation analysis (MCCA) is a powerful technique for analyzing linear correlations among multiple representation data. However, it usually fails to discover the intrinsic geometrical and discriminating structure of multiple data spaces in real-world applications. In this paper, we thus propose a novel algorithm, called graph regularized multiset canonical correlations (GrMCCs), which explicitly considers both discriminative and intrinsic geometrical structure in multiple representation data. GrMCC not only maximizes between-set cumulative correlations, but also minimizes local intraclass scatter and simultaneously maximizes local interclass separability by using the nearest neighbor graphs on within-set data. Thus, it can leverage the power of both MCCA and discriminative graph Laplacian regularization. Extensive experimental results on the AR, CMU PIE, Yale-B, AT&T, and ETH-80 datasets show that GrMCC has more discriminating power and can provide encouraging recognition results in contrast with the state-of-the-art algorithms. 相似文献
58.
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. 相似文献
59.
Due to the noise disturbance and limited number of training samples, within-set and between-set sample covariance matrices in canonical correlation analysis (CCA) usually deviate from the true ones. In this paper, we re-estimate within-set and between-set covariance matrices to reduce the negative effect of this deviation. Specifically, we use the idea of fractional order to respectively correct the eigenvalues and singular values in the corresponding sample covariance matrices, and then construct fractional-order within-set and between-set scatter matrices which can obviously alleviate the problem of the deviation. On this basis, a new approach is proposed to reduce the dimensionality of multi-view data for classification tasks, called fractional-order embedding canonical correlation analysis (FECCA). The proposed method is evaluated on various handwritten numeral, face and object recognition problems. Extensive experimental results on the CENPARMI, UCI, AT&T, AR, and COIL-20 databases show that FECCA is very effective and obviously outperforms the existing joint dimensionality reduction or feature extraction methods in terms of classification accuracy. Moreover, its improvements for recognition rates are statistically significant on most cases below the significance level 0.05. 相似文献
60.
提出一种基于统一计算设备架构(Compute Unified Device Architecture,CUDA)的快速鲁棒特征(Speed-up Robust Feature,SURF)图像匹配算法。分析了SURF算法的并行性,在图像处理单元(Graphics Processing Unit,GPU)的线程映射和内存模型方面对算法的构建尺度空间、特征点提取、特征点主方向的确定、特征描述子的生成及特征匹配5个步骤进行CUDA加速优化。实验表明,相比适用于CPU的SURF算法,文中提出的适用于GPU的SURF算法在处理30MB的图片时性能提高了33倍。适用于GPU的SURF算法拓展了SURF算法在遥感等领域的快速应用,尤其是大影像的快速配准。 相似文献