全文获取类型
收费全文 | 25811篇 |
免费 | 5250篇 |
国内免费 | 4387篇 |
专业分类
电工技术 | 1454篇 |
技术理论 | 2篇 |
综合类 | 2745篇 |
化学工业 | 1049篇 |
金属工艺 | 342篇 |
机械仪表 | 882篇 |
建筑科学 | 687篇 |
矿业工程 | 146篇 |
能源动力 | 326篇 |
轻工业 | 587篇 |
水利工程 | 162篇 |
石油天然气 | 164篇 |
武器工业 | 100篇 |
无线电 | 2614篇 |
一般工业技术 | 1668篇 |
冶金工业 | 2121篇 |
原子能技术 | 30篇 |
自动化技术 | 20369篇 |
出版年
2024年 | 616篇 |
2023年 | 2001篇 |
2022年 | 3260篇 |
2021年 | 3151篇 |
2020年 | 2545篇 |
2019年 | 1715篇 |
2018年 | 1227篇 |
2017年 | 1079篇 |
2016年 | 1136篇 |
2015年 | 1108篇 |
2014年 | 1532篇 |
2013年 | 1321篇 |
2012年 | 1334篇 |
2011年 | 1575篇 |
2010年 | 1306篇 |
2009年 | 1304篇 |
2008年 | 1315篇 |
2007年 | 1187篇 |
2006年 | 1011篇 |
2005年 | 919篇 |
2004年 | 734篇 |
2003年 | 609篇 |
2002年 | 569篇 |
2001年 | 424篇 |
2000年 | 348篇 |
1999年 | 292篇 |
1998年 | 275篇 |
1997年 | 230篇 |
1996年 | 193篇 |
1995年 | 152篇 |
1994年 | 121篇 |
1993年 | 116篇 |
1992年 | 100篇 |
1991年 | 48篇 |
1990年 | 52篇 |
1989年 | 49篇 |
1988年 | 34篇 |
1987年 | 29篇 |
1986年 | 43篇 |
1966年 | 17篇 |
1965年 | 27篇 |
1964年 | 28篇 |
1963年 | 25篇 |
1962年 | 12篇 |
1961年 | 18篇 |
1959年 | 19篇 |
1958年 | 21篇 |
1957年 | 22篇 |
1956年 | 15篇 |
1955年 | 28篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
Colzato Lorenza S.; Raffone Antonino; Hommel Bernhard 《Canadian Metallurgical Quarterly》2006,32(3):705
Four experiments were conducted to investigate the relationship between the binding of visual features (as measured by their aftereffects on subsequent binding) and the learning of feature-conjunction probabilities. Both binding and learning effects were obtained, but they did not interact. Interestingly, (shape-color) binding effects disappeared with increasing practice, presumably because of the fact that only 1 of the features involved was relevant to the task. However, this instability was only observed for arbitrary, not highly overlearned combinations of simple geometric features and not for real objects (colored pictures of a banana and strawberry), where binding effects were strong and resistant to practice. These findings suggest that learning has no direct impact on the strength or resistance of bindings or on speed with which features are bound; however, learning does affect the amount of attention particular feature dimensions attract, which again can influence which features are considered in binding. (PsycINFO Database Record (c) 2011 APA, all rights reserved) 相似文献
92.
The Design of Discrimination Experiments 总被引:1,自引:0,他引:1
Experimentation plays a fundamental role in scientific discovery. Scientists experiment to gather data, investigate phenomena, measure quantities, and test theories. In this article, we address the problem of designing experiments to discriminate between two completing theories. Given an initial situation for which the two theories make the same prediction, the experiment design problem is to determine how to modify the situation such that the two theories make different predictions for the modified situation. The modified situation is called a discrimination experiment. We present a knowledge-intensive method called DEED for designing discrimination experiments. The method analyzes the differences in the two theories' explanations of the prediction for the initial situation. Based on this analysis, it determines modifications to the initial situation that will result in a discrimination experiment. We illustrate the method with the design of experiments to discriminate between several pairs of qualitative theories in the fluids domain. 相似文献
93.
We present our machine learning system, that uses inductive logic programming techniques to learn how to identify transmembrane
domains from amino acid sequences. Our system facilitates the use of operators such as ‘contains’, that act on entire sequences,
rather than on individual elements of a sequence. The prediction accuracy of our new system is around 93%, and this compares
favourably with earlier results.
This work was carried out with the support of a research grant from ISIS, Fujitsu Laboratories. 相似文献
94.
本文对示例式学习的ID5R算法进行了深入的研究并作了进一步的改进,提高了其计算效率.并提出一种适合于增量式学习的抗干扰机制,拓广了算法的适用范围. 相似文献
95.
96.
In executing classical plans in the real world, small discrepancies between a planner's internal representations and the real world are unavoidable. These can conspire to cause real-world failures even though the planner is sound and, therefore, proves that a sequence of actions achieves the goal. Permissive planning, a machine learning extension to classical planning, is one response to this difficulty. This paper describes the permissive planning approach and presents GRASPER, a permissive planning robotic system that learns to robustly pick up novel objects. 相似文献
97.
98.
A novel successive learning algorithm based on a Test Feature Classifier is proposed for efficient handling of sequentially provided training data. The fundamental characteristics of the successive learning are considered. In the learning, after recognition of a set of unknown data by a classifier, they are fed into the classifier in order to obtain a modified performance. An efficient algorithm is proposed for the incremental definition of prime tests which are irreducible combinations of features and capable of classifying training patterns into correct classes. Four strategies for addition of training patterns are investigated with respect to their precision and performance using real pattern data. A real-world problem of classification of defects on wafer images has been dealt with by the proposed classifier, obtaining excellent performance even through efficient addition strategies. 相似文献
99.
Dynamic web sites commonly return information in the form of lists and tables. Although hand crafting an extraction program for a specific template is time-consuming but straightforward, it is desirable to automatically generate template extraction programs from examples of lists and tables in html documents. Supervised approaches have been shown to achieve high accuracy, but they require manual labelling of training examples, which is also time consuming. Fully unsupervised approaches, which extract rows and columns by detecting regularities in the data, cannot provide sufficient accuracy for practical domains. We describe a novel technique, Post-supervised Learning, which exploits unsupervised learning to avoid the need for training examples, while minimally involving the user to achieve high accuracy. We have developed unsupervised algorithms to extract the number of rows and adopted a dynamic programming algorithm for extracting columns. Our method achieves high performance with minimal user input compared to fully supervised techniques. 相似文献
100.