全文获取类型
收费全文 | 3438篇 |
免费 | 834篇 |
国内免费 | 590篇 |
专业分类
电工技术 | 258篇 |
综合类 | 471篇 |
化学工业 | 284篇 |
金属工艺 | 29篇 |
机械仪表 | 174篇 |
建筑科学 | 50篇 |
矿业工程 | 27篇 |
能源动力 | 72篇 |
轻工业 | 484篇 |
水利工程 | 25篇 |
石油天然气 | 44篇 |
武器工业 | 32篇 |
无线电 | 473篇 |
一般工业技术 | 232篇 |
冶金工业 | 15篇 |
原子能技术 | 37篇 |
自动化技术 | 2155篇 |
出版年
2024年 | 30篇 |
2023年 | 78篇 |
2022年 | 137篇 |
2021年 | 155篇 |
2020年 | 167篇 |
2019年 | 170篇 |
2018年 | 166篇 |
2017年 | 177篇 |
2016年 | 217篇 |
2015年 | 218篇 |
2014年 | 279篇 |
2013年 | 266篇 |
2012年 | 341篇 |
2011年 | 347篇 |
2010年 | 258篇 |
2009年 | 266篇 |
2008年 | 290篇 |
2007年 | 294篇 |
2006年 | 249篇 |
2005年 | 179篇 |
2004年 | 148篇 |
2003年 | 99篇 |
2002年 | 84篇 |
2001年 | 39篇 |
2000年 | 35篇 |
1999年 | 36篇 |
1998年 | 20篇 |
1997年 | 17篇 |
1996年 | 18篇 |
1995年 | 9篇 |
1994年 | 17篇 |
1993年 | 8篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 5篇 |
1989年 | 4篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1974年 | 1篇 |
1959年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有4862条查询结果,搜索用时 31 毫秒
101.
102.
杨立博 《网络安全技术与应用》2013,(8):129-130
近几年来随着计算机虚拟化技术的迅速发展,基于完全虚拟化技术的安全监控应运而生,它不仅能确保监控工具的有效性、牢固性,而且监控技术易于实现.本文将从安全监控架构中内核、内核可加戢模块两个方面存在的问题对基于完全虚拟化的安全监控技术进行探析. 相似文献
103.
Suk-Hwan Lee Ki-Ryong Kwon Won-Joo Hwang V. Chandrasekar 《Digital Signal Processing》2013,23(5):1505-1522
Multimedia-based hashing is considered an important technique for achieving authentication and copy detection in digital contents. However, 3D model hashing has not been as widely used as image or video hashing. In this study, we develop a robust 3D mesh-model hashing scheme based on a heat kernel signature (HKS) that can describe a multi-scale shape curve and is robust against isometric modifications. We further discuss the robustness, uniqueness, security, and spaciousness of the method for 3D model hashing. In the proposed hashing scheme, we calculate the local and global HKS coefficients of vertices through time scales and 2D cell coefficients by clustering HKS coefficients with variable bin sizes based on an estimated L2 risk function, and generate the binary hash through binarization of the intermediate hash values by combining the cell values and the random values. In addition, we use two parameters, bin center points and cell amplitudes, which are obtained through an iterative refinement process, to improve the robustness, uniqueness, security, and spaciousness further, and combine them in a hash with a key. By evaluating the robustness, uniqueness, and spaciousness experimentally, and through a security analysis based on the differential entropy, we verify that our hashing scheme outperforms conventional hashing schemes. 相似文献
104.
Manuel V.C. Vieira 《Optimization methods & software》2013,28(3):581-599
In this paper, we generalize polynomial-time primal–dual interior-point methods for symmetric optimization based on a class of kernel functions, which is not coercive. The corresponding barrier functions have a finite value at the boundary of the feasible region. They are not exponentially convex and also not strongly convex like many usual barrier functions. Moreover, we analyse the accuracy of the algorithm for this class of functions and we obtain an upper bound for the accuracy which depends on a parameter of the class. 相似文献
105.
The sparsity driven classification technologies have attracted much attention in recent years, due to their capability of providing more compressive representations and clear interpretation. Two most popular classification approaches are support vector machines (SVMs) and kernel logistic regression (KLR), each having its own advantages. The sparsification of SVM has been well studied, and many sparse versions of 2-norm SVM, such as 1-norm SVM (1-SVM), have been developed. But, the sparsification of KLR has been less studied. The existing sparsification of KLR is mainly based on L 1 norm and L 2 norm penalties, which leads to the sparse versions that yield solutions not so sparse as it should be. A very recent study on L 1/2 regularization theory in compressive sensing shows that L 1/2 sparse modeling can yield solutions more sparse than those of 1 norm and 2 norm, and, furthermore, the model can be efficiently solved by a simple iterative thresholding procedure. The objective function dealt with in L 1/2 regularization theory is, however, of square form, the gradient of which is linear in its variables (such an objective function is the so-called linear gradient function). In this paper, through extending the linear gradient function of L 1/2 regularization framework to the logistic function, we propose a novel sparse version of KLR, the 1/2 quasi-norm kernel logistic regression (1/2-KLR). The version integrates advantages of KLR and L 1/2 regularization, and defines an efficient implementation scheme of sparse KLR. We suggest a fast iterative thresholding algorithm for 1/2-KLR and prove its convergence. We provide a series of simulations to demonstrate that 1/2-KLR can often obtain more sparse solutions than the existing sparsity driven versions of KLR, at the same or better accuracy level. The conclusion is also true even in comparison with sparse SVMs (1-SVM and 2-SVM). We show an exclusive advantage of 1/2-KLR that the regularization parameter in the algorithm can be adaptively set whenever the sparsity (correspondingly, the number of support vectors) is given, which suggests a methodology of comparing sparsity promotion capability of different sparsity driven classifiers. As an illustration of benefits of 1/2-KLR, we give two applications of 1/2-KLR in semi-supervised learning, showing that 1/2-KLR can be successfully applied to the classification tasks in which only a few data are labeled. 相似文献
106.
一个有效的核方法通常取决于选择一个合适的核函数。目前研究核方法的热点是从数据中自动地进行核学习。提出基于最优分类标准的核学习方法,这个标准类似于线性鉴别分析和核Fisher判别式。并把此算法应用于模糊支持向量机多类分类器设计上,在ORL人脸数据集和Iris数据集上的实验验证了该算法的可行性。 相似文献
107.
108.
提出了一种综合多特征的句子相似度计算方法,该方法分别从句子的句法、词汇语义、词形三个方面来度量句子的相似度,最后将这三个方面加权整合计算得到句子的相似度。本方法综合考虑了句子的深层和表层信息,并对句子进行了词汇扩展,从而使句子相似度计算更加准确。 相似文献
109.
主要研究在Windows系统内核模式中开发过滤驱动,以实现文件透明加解密功能并实现了对内网安全中信息防泄漏系统的设计。系统对网络安全域内所有计算机上的重要信息的存储和传输实施访问控制、数据保护和日志记录,提供集中管理控制机制、安全策略生命周期管理方法和审计分析报告,防止内部网络重要信息被泄漏和破坏。 相似文献
110.
首先,对车牌图像进行预处理,针对不同的字符样本采用不同特征提取方法;然后,用提取的特征训练SVM分类器。结果表明,在训练样本较少的情况下,该系统具有较高的识别率和识别速度,并具有很好的分类推广能力。 相似文献