全文获取类型
收费全文 | 8448篇 |
免费 | 1044篇 |
国内免费 | 787篇 |
专业分类
电工技术 | 375篇 |
技术理论 | 1篇 |
综合类 | 296篇 |
化学工业 | 216篇 |
金属工艺 | 643篇 |
机械仪表 | 1550篇 |
建筑科学 | 282篇 |
矿业工程 | 150篇 |
能源动力 | 128篇 |
轻工业 | 320篇 |
水利工程 | 38篇 |
石油天然气 | 53篇 |
武器工业 | 38篇 |
无线电 | 1032篇 |
一般工业技术 | 324篇 |
冶金工业 | 79篇 |
原子能技术 | 16篇 |
自动化技术 | 4738篇 |
出版年
2024年 | 22篇 |
2023年 | 181篇 |
2022年 | 273篇 |
2021年 | 328篇 |
2020年 | 279篇 |
2019年 | 198篇 |
2018年 | 196篇 |
2017年 | 220篇 |
2016年 | 268篇 |
2015年 | 328篇 |
2014年 | 486篇 |
2013年 | 487篇 |
2012年 | 604篇 |
2011年 | 756篇 |
2010年 | 504篇 |
2009年 | 530篇 |
2008年 | 519篇 |
2007年 | 656篇 |
2006年 | 608篇 |
2005年 | 452篇 |
2004年 | 388篇 |
2003年 | 327篇 |
2002年 | 282篇 |
2001年 | 206篇 |
2000年 | 196篇 |
1999年 | 168篇 |
1998年 | 151篇 |
1997年 | 132篇 |
1996年 | 96篇 |
1995年 | 101篇 |
1994年 | 73篇 |
1993年 | 54篇 |
1992年 | 41篇 |
1991年 | 38篇 |
1990年 | 30篇 |
1989年 | 28篇 |
1988年 | 17篇 |
1987年 | 7篇 |
1986年 | 3篇 |
1985年 | 6篇 |
1984年 | 5篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 6篇 |
1980年 | 3篇 |
1977年 | 2篇 |
1976年 | 4篇 |
1974年 | 2篇 |
1973年 | 3篇 |
1959年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
1.
Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms. 相似文献
2.
The load applied to a machine tool feed drive changes during the machining process as material is removed. This load change alters the Coulomb friction of the feed drive. Because Coulomb friction accounts for a large part of the total friction the friction compensation control accuracy of the feed drives is limited if this nonlinear change in the applied load is not considered. This paper presents a new friction compensation method that estimates the machine tool load in real time and considers its effect on friction characteristics. A friction observer based on a Kalman filter with load estimation is proposed for friction compensation control considering the applied load change. A specially designed feed drive testbed that enables the applied load to be modified easily was constructed for experimental verification. Control performance and friction estimation accuracy are demonstrated experimentally using the testbed. 相似文献
3.
Chih-Ming Chen Hahn-Ming Lee Chia-Chen Tan 《Engineering Applications of Artificial Intelligence》2006,19(8):967-978
The explosion of on-line information has given rise to many manually constructed topic hierarchies (such as Yahoo!!). But with the current growth rate in the amount of information, manual classification in topic hierarchies results in an immense information bottleneck. Therefore, developing an automatic classifier is an urgent need. However, classifiers suffer from enormous dimensionality, since the dimensionality is determined by the number of distinct keywords in a document corpus. More seriously, most classifiers are either working slowly or they are constructed subjectively without any learning ability. In this paper, we address these problems with a fair feature-subset selection (FFSS) algorithm and an adaptive fuzzy learning network (AFLN) for classification. The FFSS algorithm is used to reduce the enormous dimensionality. It not only gives fair treatment to each category but also has ability to identify useful features, including both positive and negative features. On the other hand, the AFLN provides extremely fast learning ability to model the uncertain behavior for classification so as to correct the fuzzy matrix automatically. Experimental results show that both FFSS algorithm and the AFLN lead to a significant improvement in document classification, compared to alternative approaches. 相似文献
4.
文章给出将神经网络与矢量量化相结合的两种编码方法,介绍了其原理和实现的算法。经计算机模拟表明,在比特率低于0.3bpp时仍可得到高质量的编码图象。 相似文献
5.
采用单片机开发大把捆远程维护仪,通过电话线,维护仪远程拨叫维护中心,远程采集机器运行状态,远程调整参数,使机器处于最佳状态运行;维修中心专家远程判断故障点,远程维护或远程指导维护,节省维护成本和人力资源。 相似文献
6.
With increasing globalization, communication across language and cultural boundaries is becoming an essential requirement
of doing business, delivering education, and providing public services. Due to the considerable cost of human translation
services, only a small fraction of text documents and an even smaller percentage of spoken encounters, such as international
meetings and conferences, are translated, with most resorting to the use of a common language (e.g. English) or not taking
place at all. Technology may provide a potentially revolutionary way out if real-time, domain-independent, simultaneous speech
translation can be realized. In this paper, we present a simultaneous speech translation system based on statistical recognition
and translation technology. We discuss the technology, various system improvements and propose mechanisms for user-friendly
delivery of the result. Over extensive component and end-to-end system evaluations and comparisons with human translation
performance, we conclude that machines can already deliver comprehensible simultaneous translation output. Moreover, while
machine performance is affected by recognition errors (and thus can be improved), human performance is limited by the cognitive
challenge of performing the task in real time. 相似文献
7.
Three perspectives of data mining 总被引:2,自引:0,他引:2
Zhi-Hua Zhou 《Artificial Intelligence》2003,143(1):139-146
This paper reviews three recent books on data mining written from three different perspectives, i.e., databases, machine learning, and statistics. Although the exploration in this paper is suggestive instead of conclusive, it reveals that besides some common properties, different perspectives lay strong emphases on different aspects of data mining. The emphasis of the database perspective is on efficiency because this perspective strongly concerns the whole discovery process and huge data volume. The emphasis of the machine learning perspective is on effectiveness because this perspective is heavily attracted by substantive heuristics working well in data analysis although they may not always be useful. As for the statistics perspective, its emphasis is on validity because this perspective cares much for mathematical soundness behind mining methods. 相似文献
8.
GIS中矢量图形的结构分析与VC++中的实现 总被引:2,自引:0,他引:2
简要讨论了GIS各类矢量图形元素间的空间拓朴结构及基位置关系 ,并用VC 6 . 0及MFC具体分析了圆弧与多边形区域的相交关系及实现。为利用VC开发专用图形软件提供了有用帮助。 相似文献
9.
运动估计块匹配两级搜索算法 总被引:2,自引:0,他引:2
根据视频图像相邻块在空间上具有很大的相关性,吸收了矢量预测块匹配的核心思想,提出一种两级块匹配运动估计算法,在第一级中,首先根据矢量预测确定一个小区域,然后在此区域内进行快速搜索,如果在第一级中没有搜索到匹配块则进行第二级搜索,该算法可大大提高搜索速度. 相似文献
10.
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
We consider the problem of PAC-learning distributions over strings, represented by probabilistic deterministic finite automata (PDFAs). PDFAs are a probabilistic model for the generation of strings of symbols, that have been used in the context of speech and handwriting recognition, and bioinformatics. Recent work on learning PDFAs from random examples has used the KL-divergence as the error measure; here we use the variation distance. We build on recent work by Clark and Thollard, and show that the use of the variation distance allows simplifications to be made to the algorithms, and also a strengthening of the results; in particular that using the variation distance, we obtain polynomial sample size bounds that are independent of the expected length of strings. 相似文献