首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   39107篇
  免费   582篇
  国内免费   135篇
教育   27666篇
科学研究   4189篇
各国文化   324篇
体育   3018篇
综合类   28篇
文化理论   373篇
信息传播   4226篇
  2022年   240篇
  2021年   347篇
  2020年   568篇
  2019年   874篇
  2018年   1667篇
  2017年   1635篇
  2016年   1395篇
  2015年   669篇
  2014年   932篇
  2013年   6805篇
  2012年   961篇
  2011年   1162篇
  2010年   903篇
  2009年   812篇
  2008年   908篇
  2007年   949篇
  2006年   660篇
  2005年   721篇
  2004年   689篇
  2003年   650篇
  2002年   573篇
  2001年   673篇
  2000年   637篇
  1999年   580篇
  1998年   336篇
  1997年   348篇
  1996年   405篇
  1995年   387篇
  1994年   289篇
  1993年   325篇
  1992年   496篇
  1991年   483篇
  1990年   500篇
  1989年   522篇
  1988年   438篇
  1987年   491篇
  1986年   451篇
  1985年   512篇
  1984年   437篇
  1983年   396篇
  1982年   343篇
  1981年   320篇
  1980年   301篇
  1979年   467篇
  1978年   357篇
  1977年   329篇
  1976年   292篇
  1975年   254篇
  1974年   270篇
  1973年   248篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
52.
Quantum algorithms are a field of growing interest within the theoretical computer science as well as the physics community. Surprisingly, although the number of researchers working on the subject is ever-increasing, the number of quantum algorithms found so far is quite small. In fact, the task of designing new quantum algorithms has been proven to be extremely difficult. In this paper we give an overview of the known quantum algorithms and briefly describe the underlying ideas. Roughly, the algorithms presented are divided into hidden subgroup type algorithms and in amplitude amplification type algorithms. While the former deal with problems of group-theoretical nature and have the promise to yield strong separations of classical and quantum algorithms, the latter have been proved to be a prolific source of algorithms in which a polynomial speed-up as compared to classical algorithms can be achieved. We also discuss quantum algorithms which do not fall under these two categories and give a survey of techniques of general interest in quantum computing such as adiabatic computing, lower bounds for quantum algorithms, and quantum interactive proofs.  相似文献   
53.
Medicine has made increasing use of meta-analysis, largely as a quantitative procedure for combining results of clinical trials. Meta-analysis begins with a comprehensive review of the literature. The next step is a systematic analysis of the quality and content of each study. Finally, results are combined statistically and conclusions are drawn from this new overview of the data. This paper presents a brief historical perspective on the use of meta-analysis in medicine with emphasis on the medical library. The authors conclude that in the future, medical librarians will play a significant role in the application of this useful technique.  相似文献   
54.
Chaos theory, informational needs, and natural disasters   总被引:2,自引:0,他引:2  
This study applies chaos theory to a system-wide analysis of crisis communication in a natural disaster. Specifically, we analyze crisis communication during the 1997 Red River Valley flood in Minnesota and North Dakota. This flood, among the worst in modern American history, consumed entire metropolitan areas, displacing thousands of people. The conditions and decisions leading to the disaster, and the subsequent reactions are retraced. Communication related to river crest predictions (fractals), the shock at the magnitude of the crisis (cosmology episode), novel forms of reorganizing (self-organization), and agencies that aided in establishing a renewed order (strange attractors) are evaluated. Ultimately, we argue that preexisting sensemaking structures favoring rationalized, traditional views of a complex system led officials to make inappropriately unequivocal predictions and ultimately diminished the effectiveness of the region's crisis communication and planning.  相似文献   
55.
The purpose of this study was to determine test-retest reliability for the 1-mile, 3/4-mile, and 1/2-mile distance run/alk tests for children in Grades K-4. Fifty-one intact physical education classes were randomly assigned to one of the three distance run conditions. A total of 1,229 (621 boys, 608 girls) completed the test-retests in the fall (October), with 1,050 of these students (543 boys, 507 girls) repeating the tests in the spring (May). Results indicated that the 1-mile run/walk distance, as recommended for young children in most national test batteries, has acceptable intraclass reliability (.83 less than R less than .90) for both boys and girls in Grades 3 and 4, has minimal (fall) to acceptable (spring) reliability for Grade 2 students (.70 less than R less than .83), but is not reliable for children in Grades K and 1 (.34 less than R less than .56). The 1/2 mile was the only distance meeting minimal reliability standards for boys and girls in Grades K and 1 (.73 less than R less than .82). Results also indicated that reliability estimates remained fairly stable across gender and age groups from the fall to spring testing periods, with the exception of the noticeably improved values for Grade 2 students on the 1-mile run/walk test. Criterion-referenced reliability (P, percent agreement) was also estimated relative to Physical Best and Fitnessgram run/walk standards. Reliability coefficients for all age group standards were acceptable to high (.70 less than P less than .95), except for Fitnessgram standards for 5-year-old girls on the 1-mile test for both fall and spring and for 6-year-old boys and girls on the 1-mile test administered in the spring.  相似文献   
56.
57.
This article reviews the literature pertaining to the written composing ability of students with learning disabilities that was published primarily in the decade from 1980 to 1990. The papers included are either reports of research or discussions of instructional procedures that are based on research. The topics addressed include story composition, expository writing, training/intervention research, and rationales/procedures for instruction.  相似文献   
58.
59.
60.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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