全文获取类型
收费全文 | 4090篇 |
免费 | 915篇 |
国内免费 | 689篇 |
专业分类
电工技术 | 280篇 |
综合类 | 520篇 |
化学工业 | 323篇 |
金属工艺 | 36篇 |
机械仪表 | 188篇 |
建筑科学 | 68篇 |
矿业工程 | 49篇 |
能源动力 | 78篇 |
轻工业 | 538篇 |
水利工程 | 31篇 |
石油天然气 | 56篇 |
武器工业 | 36篇 |
无线电 | 575篇 |
一般工业技术 | 279篇 |
冶金工业 | 36篇 |
原子能技术 | 39篇 |
自动化技术 | 2562篇 |
出版年
2024年 | 49篇 |
2023年 | 89篇 |
2022年 | 154篇 |
2021年 | 181篇 |
2020年 | 203篇 |
2019年 | 195篇 |
2018年 | 190篇 |
2017年 | 220篇 |
2016年 | 250篇 |
2015年 | 252篇 |
2014年 | 336篇 |
2013年 | 318篇 |
2012年 | 395篇 |
2011年 | 402篇 |
2010年 | 310篇 |
2009年 | 316篇 |
2008年 | 328篇 |
2007年 | 338篇 |
2006年 | 289篇 |
2005年 | 212篇 |
2004年 | 171篇 |
2003年 | 121篇 |
2002年 | 91篇 |
2001年 | 47篇 |
2000年 | 38篇 |
1999年 | 42篇 |
1998年 | 21篇 |
1997年 | 20篇 |
1996年 | 21篇 |
1995年 | 10篇 |
1994年 | 17篇 |
1993年 | 12篇 |
1992年 | 12篇 |
1991年 | 9篇 |
1990年 | 5篇 |
1989年 | 6篇 |
1988年 | 2篇 |
1987年 | 5篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1977年 | 1篇 |
1974年 | 1篇 |
1959年 | 1篇 |
1951年 | 1篇 |
排序方式: 共有5694条查询结果,搜索用时 0 毫秒
51.
最近几年,由于在线客户评论信息飞快地增长。如何把这些信息分类为正向和负向情感是一个迫切需要解决的问题。提出了一种细粒度级别(句子级别)的情感分类方法,该方法在SVM分类器中使用了树核和复合核函数来进行句子级别情感的分类。实验结果表明在句子级别的情感分类中树核和复合核的方法比线性核具有更佳的性能。 相似文献
52.
在现有的基于傅里叶描绘子的CBIR系统中,为了提高检索速度,一般需要舍去物体轮廓经傅里叶变换后的大部分高频分量.当物体轮廓在细节部分具有较高能量时,此方法不具备有效性.为尽可能保证检索准确率并兼顾检索速度,在原有傅里叶描绘子上进行扩展,避免直接舍去高频分量,引入Fisher判别分析法将描绘子映射到子空间进行降维,并保证... 相似文献
53.
A novel approach for analog fault diagnosis based on neural networks and improved kernel PCA 总被引:2,自引:0,他引:2
We have developed a neural-network-based fault diagnosis approach of analog circuits using maximal class separability based kernel principal components analysis (MCSKPCA) as preprocessor. The proposed approach can detect and diagnose faulty components efficiently in the analog circuits by analyzing their time responses. First, using wavelet transform to preprocess the time responses obtains the essential and reduced candidate features of the corresponding response signals. Then, the second preprocessing by MCSKPCA further reduces the dimensionality of candidate features so as to obtain the optimal features with maximal class separability as inputs to the neural networks. This simplifies the architectures reasonably and reduces the computational burden of neural networks drastically. The simulation results show that our resulting diagnostic system can classify the faulty components of analog circuits under test effectively and achieves a competitive classification performance. 相似文献
54.
The Gaussian kernel function implicitly defines the feature space of an algorithm and plays an essential role in the application of kernel methods. The parameter of Gaussian kernel function is a scalar that has significant influences on final results. However, until now, it is still unclear how to choose an optimal kernel parameter. In this paper, we propose a novel data-driven method to optimize the Gaussian kernel parameter, which only depends on the original dataset distribution and yields a simple solution to this complex problem. The proposed method is task irrelevant and can be used in any Gaussian kernel-based approach, including supervised and unsupervised machine learning. Simulation experiments demonstrate the efficacy of the obtained results. A user-friendly online calculator is implemented at: www.csbio.sjtu.edu.cn/bioinf/kernel/ for public use. 相似文献
55.
56.
Jie Wang Author Vitae Author Vitae K.N. Plataniotis Author Vitae Author Vitae 《Pattern recognition》2009,42(7):1237-1247
This paper presents a novel algorithm to optimize the Gaussian kernel for pattern classification tasks, where it is desirable to have well-separated samples in the kernel feature space. We propose to optimize the Gaussian kernel parameters by maximizing a classical class separability criterion, and the problem is solved through a quasi-Newton algorithm by making use of a recently proposed decomposition of the objective criterion. The proposed method is evaluated on five data sets with two kernel-based learning algorithms. The experimental results indicate that it achieves the best overall classification performance, compared with three competing solutions. In particular, the proposed method provides a valuable kernel optimization solution in the severe small sample size scenario. 相似文献
57.
Jie Ouyang Author Vitae Author Vitae Ishwar Sethi Author Vitae 《Pattern recognition》2009,42(9):1786-1794
The decision tree-based classification is a popular approach for pattern recognition and data mining. Most decision tree induction methods assume training data being present at one central location. Given the growth in distributed databases at geographically dispersed locations, the methods for decision tree induction in distributed settings are gaining importance. This paper describes one such method that generates compact trees using multifeature splits in place of single feature split decision trees generated by most existing methods for distributed data. Our method is based on Fisher's linear discriminant function, and is capable of dealing with multiple classes in the data. For homogeneously distributed data, the decision trees produced by our method are identical to decision trees generated using Fisher's linear discriminant function with centrally stored data. For heterogeneously distributed data, a certain approximation is involved with a small change in performance with respect to the tree generated with centrally stored data. Experimental results for several well-known datasets are presented and compared with decision trees generated using Fisher's linear discriminant function with centrally stored data. 相似文献
58.
59.
60.
针对L1范数多核学习方法产生核权重的稀疏解时可能会导致有用信息的丢失和泛化性能退化,Lp范数多核学习方法产生核权重的非稀疏解时会产生很多冗余信息并对噪声敏感,提出了一种通用稀疏多核学习方法。该算法是基于L1范数和Lp范数(p>1) 混合的网状正则化多核学习方法,不仅能灵活的调整稀疏性,而且鼓励核权重的组效应,L1范数和Lp范数多核学习方法可以认为是该方法的特例。该方法引进的混合约束为非线性约束,故对此约束采用二阶泰勒展开式近似,并使用半无限规划来求解该优化问题。实验结果表明,改进后的方法在动态调整稀疏性的前提下能获得较好的分类性能,同时也支持组效应,从而验证了改进后的方法是有效可行的。 相似文献