全文获取类型
收费全文 | 58070篇 |
免费 | 7483篇 |
国内免费 | 6164篇 |
专业分类
电工技术 | 4491篇 |
技术理论 | 2篇 |
综合类 | 5764篇 |
化学工业 | 2417篇 |
金属工艺 | 3626篇 |
机械仪表 | 7322篇 |
建筑科学 | 1537篇 |
矿业工程 | 1982篇 |
能源动力 | 775篇 |
轻工业 | 3137篇 |
水利工程 | 459篇 |
石油天然气 | 641篇 |
武器工业 | 352篇 |
无线电 | 4901篇 |
一般工业技术 | 3500篇 |
冶金工业 | 3439篇 |
原子能技术 | 97篇 |
自动化技术 | 27275篇 |
出版年
2024年 | 856篇 |
2023年 | 2506篇 |
2022年 | 3986篇 |
2021年 | 3941篇 |
2020年 | 3431篇 |
2019年 | 2388篇 |
2018年 | 1838篇 |
2017年 | 1929篇 |
2016年 | 2136篇 |
2015年 | 2298篇 |
2014年 | 3590篇 |
2013年 | 2939篇 |
2012年 | 3864篇 |
2011年 | 4183篇 |
2010年 | 3176篇 |
2009年 | 3173篇 |
2008年 | 2994篇 |
2007年 | 3500篇 |
2006年 | 3215篇 |
2005年 | 2797篇 |
2004年 | 2185篇 |
2003年 | 1879篇 |
2002年 | 1635篇 |
2001年 | 1365篇 |
2000年 | 1099篇 |
1999年 | 870篇 |
1998年 | 695篇 |
1997年 | 583篇 |
1996年 | 464篇 |
1995年 | 400篇 |
1994年 | 330篇 |
1993年 | 266篇 |
1992年 | 192篇 |
1991年 | 124篇 |
1990年 | 123篇 |
1989年 | 124篇 |
1988年 | 94篇 |
1987年 | 48篇 |
1986年 | 65篇 |
1985年 | 19篇 |
1983年 | 23篇 |
1982年 | 19篇 |
1965年 | 24篇 |
1964年 | 25篇 |
1963年 | 24篇 |
1961年 | 20篇 |
1959年 | 18篇 |
1958年 | 19篇 |
1957年 | 25篇 |
1955年 | 25篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
In the past few years many systems for learning decision rules from examples were developed. As different systems allow different types of answers when classifying new instances, it is difficult to appropriately evaluate the systems' classification power in comparison with other classification systems or in comparison with human experts. Classification accuracy is usually used as a measure of classification performance. This measure is, however, known to have several defects. A fair evaluation criterion should exclude the influence of the class probabilities which may enable a completely uninformed classifier to trivially achieve high classification accuracy. In this paper a method for evaluating the information score of a classifier's answers is proposed. It excludes the influence of prior probabilities, deals with various types of imperfect or probabilistic answers and can be used also for comparing the performance in different domains. 相似文献
32.
Self-knowledge is a concept that is present in several philosophies. In this article, we consider the issue of whether or not a learning algorithm can in some sense possess self-knowledge. The question is answered affirmatively. Self-learning inductive inference algorithms are taken to be those that learn programs for their own algorithms, in addition to other functions.
La connaissance de soi est un concept qui se retrouve dans plusieurs philosophies. Dans cet article, les auteurs s'interrogent à savoir si un algorithme d' apprentissage peut dans une certaine mesure posséder la connaissance de soi. lis apportent une reponse positive a cette question. Les algorithmes d'inference inductive autodidactes sont ceux qui font l'apprentissage de programmes pour leurs propres algorithmes, en plus d' autres fonctions. 相似文献
La connaissance de soi est un concept qui se retrouve dans plusieurs philosophies. Dans cet article, les auteurs s'interrogent à savoir si un algorithme d' apprentissage peut dans une certaine mesure posséder la connaissance de soi. lis apportent une reponse positive a cette question. Les algorithmes d'inference inductive autodidactes sont ceux qui font l'apprentissage de programmes pour leurs propres algorithmes, en plus d' autres fonctions. 相似文献
33.
34.
Udayan Nandkeolyar David P. Christy 《International Journal of Flexible Manufacturing Systems》1992,4(3-4):267-292
Evaluating the design of flexible manufacturing systems is complex. Developing a measure of performance useful for evaluating alternate designs continues to be interesting. Here, total productivity of the system is proposed as an appropriate measure. Specification of parameters based upon strategic considerations for this measure are discussed. Finally, the usefulness of the measure is demonstrated through an example. 相似文献
35.
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. 相似文献
36.
Michael Bowling 《Artificial Intelligence》2002,136(2):215-250
Learning to act in a multiagent environment is a difficult problem since the normal definition of an optimal policy no longer applies. The optimal policy at any moment depends on the policies of the other agents. This creates a situation of learning a moving target. Previous learning algorithms have one of two shortcomings depending on their approach. They either converge to a policy that may not be optimal against the specific opponents' policies, or they may not converge at all. In this article we examine this learning problem in the framework of stochastic games. We look at a number of previous learning algorithms showing how they fail at one of the above criteria. We then contribute a new reinforcement learning technique using a variable learning rate to overcome these shortcomings. Specifically, we introduce the WoLF principle, “Win or Learn Fast”, for varying the learning rate. We examine this technique theoretically, proving convergence in self-play on a restricted class of iterated matrix games. We also present empirical results on a variety of more general stochastic games, in situations of self-play and otherwise, demonstrating the wide applicability of this method. 相似文献
37.
基于约束优化的联想记忆模型学习算法 总被引:1,自引:1,他引:0
本文提出了一种对称互连神经元网络的学习策略,利用全局约束优化方法确定连接权。优化过程采用了梯度下降技术。这种学习算法可以保证训练样本成为系统的稳定吸引子,并且具有优化意义上的最大吸引域。本文讨论了网络的存储容量,训练样本的渐近稳定性和吸引域大小。计算机实验结果说明了学习算法的优越性。 相似文献
38.
H. Perez-Blanco 《International Journal of Refrigeration》1993,16(6):429-433
The search for high-efficiency, gas-fired cooling cycles has led to the development of dual-loop absorption machines with cooling coefficients of performance (COPs) in the 1.2 to 1.7 range. This increased performance may call for high generator temperatures, new working fluids or new materials of construction. In most cases, two different sets of working fluids are required. The conceptual design presented here is aimed at obtaining high efficiencies with relatively low temperatures, employing only one set of fluids. The concept consists of two loops coupled in a configuration aimed at minimizing the loss of thermodynamic availability incurred when transferring refrigerant between the loops. The working fluid pair is a solution of lithium bromide-water. The calculated COPs are of the order of 1.8. The cycle relies on an elaborate evaporator-absorber combination. The paper presents the conceptual design, the critical assumptions, and the performance calculations for the concept. 相似文献
39.
本文介绍了汉英机器翻译系统中从中间媒介语言生成英语的生成系统的词汇结构和功能,描述了生成系统各个层次之间的转换原理。为了说明清楚,在叙述中注意了列举从中间媒介中间媒介语言到目标语句的生成实例。 相似文献
40.