首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10203篇
  免费   329篇
  国内免费   5篇
  2020年   104篇
  2019年   144篇
  2018年   223篇
  2017年   227篇
  2016年   210篇
  2015年   164篇
  2014年   213篇
  2013年   986篇
  2012年   393篇
  2011年   380篇
  2010年   199篇
  2009年   225篇
  2008年   297篇
  2007年   339篇
  2006年   293篇
  2005年   248篇
  2004年   263篇
  2003年   229篇
  2002年   214篇
  2001年   277篇
  2000年   267篇
  1999年   213篇
  1998年   110篇
  1997年   95篇
  1996年   90篇
  1993年   97篇
  1992年   155篇
  1991年   148篇
  1990年   158篇
  1989年   127篇
  1988年   125篇
  1987年   128篇
  1986年   149篇
  1985年   145篇
  1984年   136篇
  1983年   124篇
  1981年   91篇
  1980年   88篇
  1979年   130篇
  1978年   110篇
  1977年   91篇
  1976年   90篇
  1975年   109篇
  1974年   134篇
  1973年   128篇
  1972年   99篇
  1970年   100篇
  1968年   123篇
  1967年   93篇
  1966年   99篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
161.
Book reviews     
Encyclopaedia of Linguistics, Information and Control. Edited by A. R. Meetham with the assistance of R. A. Hudson. Oxford: Pergamon Press. 1969. Pp. xiv + 718. 300s.

The Biological Basis of Personality. By H. J. Eysenck. Springfield: Thomas. 1968. Pp. xv + 399. $18.50.

Scientific Basis of Dvug Dependence. Biological Council Symposium. Edited by H. Steinberg. London: Churchill. 1969. Pp. 429. 100s.

Minnesota Symposia on Child Psychology, Vol. 2. Edited by John P. Hill. Minneapolis: University of Minnesota Press. 1969. Pp. viii + 172.

Memory and Attention: an introduction to human information processes. By Donald A. Norman. Chichester, Sussex: John Wiley. 1969. Pp. ix + 201. 84s. (cloth); 44s. (paper). Verbal Learning and Memory: selected readings. By Leo Postman and Geoffrey Keppel. Harmondsworth: Penguin Books. 1969. Pp. 501. 12s.

Handbuch der Kinderheilkunde. Edited by H. Opitz and F. Schmidt. Rand VIII/I: Neurologie-Psychologic-Psychiatrie. Redigiert von F. Schmidt und H. Asperger. Berlin: Springer Verlag. Pp. 1060. Price DM385, S96.25.

Digital Computing. By R. S. Lehman and D. E. Bailey. London: John Wiley & Sons Ltd. 1969. Pp. xxiv + 303. 79s.

Real-Time Computers. By W. R. Uttal. New York: Harper & Row. 1968. Pp. xiv + 338. 93s.  相似文献   
162.
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.  相似文献   
163.
164.
165.
166.
167.
168.
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.  相似文献   
169.
170.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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