首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   24510篇
  免费   4986篇
  国内免费   4250篇
电工技术   1403篇
技术理论   2篇
综合类   2637篇
化学工业   886篇
金属工艺   325篇
机械仪表   839篇
建筑科学   570篇
矿业工程   133篇
能源动力   307篇
轻工业   319篇
水利工程   124篇
石油天然气   158篇
武器工业   90篇
无线电   2569篇
一般工业技术   1520篇
冶金工业   1940篇
原子能技术   29篇
自动化技术   19895篇
  2024年   596篇
  2023年   1972篇
  2022年   3150篇
  2021年   3050篇
  2020年   2442篇
  2019年   1630篇
  2018年   1149篇
  2017年   1003篇
  2016年   1045篇
  2015年   1030篇
  2014年   1415篇
  2013年   1232篇
  2012年   1252篇
  2011年   1503篇
  2010年   1232篇
  2009年   1227篇
  2008年   1238篇
  2007年   1132篇
  2006年   969篇
  2005年   890篇
  2004年   693篇
  2003年   590篇
  2002年   538篇
  2001年   407篇
  2000年   348篇
  1999年   287篇
  1998年   266篇
  1997年   222篇
  1996年   185篇
  1995年   149篇
  1994年   115篇
  1993年   113篇
  1992年   94篇
  1991年   46篇
  1990年   47篇
  1989年   45篇
  1988年   30篇
  1987年   28篇
  1986年   41篇
  1966年   14篇
  1965年   24篇
  1964年   25篇
  1963年   23篇
  1962年   12篇
  1961年   17篇
  1959年   15篇
  1958年   16篇
  1957年   22篇
  1956年   13篇
  1955年   23篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
111.
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.  相似文献   
112.
基于约束优化的联想记忆模型学习算法   总被引:1,自引:1,他引:0  
汪涛  俞瑞钊 《通信学报》1992,13(5):88-92
本文提出了一种对称互连神经元网络的学习策略,利用全局约束优化方法确定连接权。优化过程采用了梯度下降技术。这种学习算法可以保证训练样本成为系统的稳定吸引子,并且具有优化意义上的最大吸引域。本文讨论了网络的存储容量,训练样本的渐近稳定性和吸引域大小。计算机实验结果说明了学习算法的优越性。  相似文献   
113.
A novel hierarchical intelligent controller configuration is proposed using an artificial neural network as a control-mode classifier in the supervisory level and a set of pre-designed controllers in the lower level. Controller outputs are modified nonlinearly by the classifying signals in a structure resembling one artificial neuron with adaptively changed weights. The lower-level local controllers are implemented using neural networks. An illustrative example of this approach is based on the transient stabilization of a single-machine infinite-bus system studied in Flexible AC Transmission Systems (FACTS) research.  相似文献   
114.
A procedure and underlying algorithm for extracting knowledge from production and inventory databases to support engineering management activities is described. The process searches for, detects and isolates behaviour patterns inherent in the data. It relates these patterns to production irregularities, suggests connections with specific causes and helps propose possible corrective or preventive actions. The approach is based on a four-phase procedure: (1) the decision-maker focuses on the subject or difficulty at issue, represented by a target concept; (2) the KEDB algorithm, based on a machine learning approach, processes the relevant database and provides knowledge characterizing and classifying the target concept; (3) the output is interpreted in Pareto fashion as a series of possible circumstances explaining the target concept behaviour; and (4) based on these causes, the decision-maker decides on possible corrective actions to improve the situation, or preventive actions to forestall unfavourable conditions. A case study based on an actual quality control database is detailed.  相似文献   
115.
The Early Career Awards recognize the large number of excellent young psychologists. Recipients of this award may not have held a PhD for more than nine years. The areas considered in 1991 were animal learning and behavior, developmental, and personality. The winners for 1991 were Kent C. Berridge, Susan A. Gelman, and Randy J. Larsen. For each winner a citation, biography, and selected bibliography of their works are presented. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
116.
This is an outline of research in neural networks for feedback control done since the mid 1990s at the Automation and Robotics Research Institute (ARRI) of The University of Texas at Arlington (UTA). It shows how the developments of Intelligent Control Systems based on neural networks have followed three main generations. This statement provides a short, broad-brush perspective on the development of intelligent neural feedback controllers.  相似文献   
117.
Although increasing feedback specificity is generally beneficial for immediate performance, it can undermine certain aspects of the learning needed for later, more independent performance. The results of the present transfer experiment demonstrate that the effects of increasing feedback specificity on learning depended on what was to be learned, and these effects were partially mediated through the opportunities to learn how to respond to different task conditions during practice. More specific feedback was beneficial for learning how to respond to good performance and detrimental for learning how to respond to poor performance. The former relationship was partially mediated by feedback specificity's effect on learning opportunities during practice. The results have implications for designing feedback interventions and training to maximize the learning of various aspects of a task. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
118.
A learning event can be dissociated into 3 components: acquisition, storage, and recall. When the laboratory wild-type strain of Caenorhabditis elegans (N2 strain) is exposed to benzaldehyde in the absence of food, the worms display a reduction of their attractive response to this volatile odorant. This results from the association between benzaldehyde and a nutrient-deficient environment. Another wild-type isolate, the CB4856 strain, fails to display this decreased response to benzaldehyde after exposure to benzaldehyde in the absence of food. However, like the N2 strain, when tested to isoamyl alcohol after benzaldehyde conditioning, the CB4856 strain displays a decreased isoamyl alcohol response. Therefore, the CB4856 strain does not have an acquisition deficit, but it suffers from a recall deficit specific to benzaldehyde. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
119.
Learning a sequence of target locations when the sequence is uncorrelated with a sequence of responses and target location is not the response dimension (pure perceptual-based sequence learning) was examined. Using probabilistic sequences of target locations, the author shows that such learning can be implicit, is unaffected by distance between target locations, and is mostly limited to first-order transition probabilities. Moreover, the mechanism underlying learning affords processing of information at anticipated target locations and appears to be attention based. Implications for hypotheses of implicit sequence learning are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)  相似文献   
120.
In this paper we design a dynamic dictionary for the priced information model initiated by Charikar et al. Assume that a set S consisting of n elements is given such that each element has an associated price, a positive real number. The cost of performing an operation on elements of S is a function of their prices. The cost of an algorithm is the sum of the costs of all operations it performs. The objective is to design algorithms which incur low cost. In this model we propose a dynamic dictionary, supporting search, insert and delete, for keys drawn from a linearly ordered set. As an application we show that the dictionary can be used in computing the trapezoidal map of a set of line segments, a fundamental problem in computational geometry.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号