首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6171篇
  免费   184篇
  国内免费   3篇
  2019年   57篇
  2018年   126篇
  2017年   100篇
  2016年   107篇
  2015年   78篇
  2014年   88篇
  2013年   477篇
  2012年   182篇
  2011年   175篇
  2010年   86篇
  2009年   103篇
  2008年   144篇
  2007年   164篇
  2006年   142篇
  2005年   130篇
  2004年   128篇
  2003年   109篇
  2002年   121篇
  2001年   217篇
  2000年   211篇
  1999年   146篇
  1998年   58篇
  1997年   54篇
  1996年   62篇
  1993年   54篇
  1992年   119篇
  1991年   121篇
  1990年   118篇
  1989年   100篇
  1988年   90篇
  1987年   100篇
  1986年   112篇
  1985年   107篇
  1984年   95篇
  1983年   82篇
  1979年   95篇
  1978年   71篇
  1977年   62篇
  1976年   54篇
  1975年   67篇
  1974年   93篇
  1973年   100篇
  1972年   72篇
  1971年   70篇
  1970年   80篇
  1969年   75篇
  1968年   106篇
  1967年   83篇
  1966年   93篇
  1958年   62篇
排序方式: 共有6358条查询结果,搜索用时 15 毫秒
121.
Average evoked brain responses were computed from four simultaneous recordings during binaural tone stimulation at 10 intensity levels. Amplitudes and latencies were measured for the prominent components, and linear regression coefficients were computed. The results indicate that the sensitivity of the evoked response to stimulus intensity is dependent upon the selection of the appropriate measure. Linear amplitude functions were demonstrated. Additional research relating these responses to psychophysical measures is suggested.  相似文献   
122.
123.
In two separate experiments, 40 Ss were presented with recorded sentences during each of which a click occurred. Ss had to depress a key as soon as they heard the click. RTs were f aster when the click was located at the major syntactic break of the sentence compared with RTs to clicks not at a break. This confirmed the hypothesis that processing load is a function of the surface structure of sentences, although the role of minor breaks was not clear. A second finding was that RTs were slower when the click was in the first rather than in the second half of the sentence. This can also be explained in terms of differential processing loads.  相似文献   
124.
125.
Conditioned eyelid responses in phobic patients   总被引:1,自引:0,他引:1  
  相似文献   
126.
127.
Three groups of pigeons were trained on a red-green discrimination in which the stimuli were alternately presented in a multiple schedule of reinforcement. The discrimination was reversed 24 times. Groups were given 1, 2, or 4 hr of training on each discrimination. Increasing the length of training had two principal effects on reversal performance: it increased the rate of extinction of responding to one of the stimuli and increased the rate of reacquisition of responding to the other. The latter effect involved both an increase in reacquisition of responding to a positive stimulus within reversals and an increase in recovery of responding to the previous negative stimulus between reversals. Improvements in performance of each group over the series of reversals were qualitatively similar to the two effects of length of training on each discrimination, and were analogous to effects obtained in other studies involving overtraining and successive reversals of simultaneous discriminations.  相似文献   
128.
129.
130.
The quartimax and varimax algorithms for orthogonal rotation attempt to maximize particular simplicity criteria by a sequence of two-factor rotations. Derivations of these algorithms have been fairly complex. A simple general theory for obtaining two factor at a time algorithms for any polynomial simplicity criteria satisfying a natural symmetry condition is presented. It is shown that the degree of any symmetric criterion must be a multiple of four. A basic fourth degree algorithm, which is applicable to all symmetric fourth degree criteria, is derived and applied using a variety of criteria. When used with the quartimax and varimax criteria the algorithm is mathematically identical to the standard algorithms for these criteria. A basic eighth degree algorithm is also obtained and applied using a variety of eighth degree criteria. In general the problem of writing a basic algorithm for all symmetric criteria of any specified degree reduces to the problem of maximizing a trigonometric polynomial of degree one-fourth that of the criteria.This research was supported by the Bell Telephone Laboratories, Murray Hill, New Jersey and NIH Grant FR-3.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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