首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4581篇
  免费   57篇
  国内免费   10篇
教育   3434篇
科学研究   241篇
各国文化   43篇
体育   405篇
综合类   3篇
文化理论   62篇
信息传播   460篇
  2022年   26篇
  2021年   44篇
  2020年   59篇
  2019年   112篇
  2018年   141篇
  2017年   151篇
  2016年   146篇
  2015年   99篇
  2014年   118篇
  2013年   939篇
  2012年   131篇
  2011年   128篇
  2010年   149篇
  2009年   136篇
  2008年   146篇
  2007年   144篇
  2006年   109篇
  2005年   95篇
  2004年   99篇
  2003年   82篇
  2002年   96篇
  2001年   66篇
  2000年   108篇
  1999年   75篇
  1998年   74篇
  1997年   63篇
  1996年   73篇
  1995年   57篇
  1994年   68篇
  1993年   63篇
  1992年   49篇
  1991年   70篇
  1990年   53篇
  1989年   48篇
  1988年   37篇
  1987年   45篇
  1986年   46篇
  1985年   47篇
  1984年   47篇
  1983年   40篇
  1982年   31篇
  1981年   35篇
  1980年   30篇
  1979年   25篇
  1978年   32篇
  1977年   39篇
  1976年   27篇
  1975年   23篇
  1974年   23篇
  1972年   15篇
排序方式: 共有4648条查询结果,搜索用时 15 毫秒
181.
182.
The article gives an update on the progress with COUNTER to May 2005. In particular it describes the draft Code of Practice for books and reference works and the results of actual use of COUNTER‐compliant data in the journals area.  相似文献   
183.
184.
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing attention recently. Many industrial and scientific applications call for solutions of the RkNN problem in arbitrary metric spaces where the data objects are not Euclidean and only a metric distance function is given for specifying object similarity. Usually, these applications need a solution for the generalized problem where the value of k is not known in advance and may change from query to query. In addition, many applications require a fast approximate answer of RkNN-queries. For these scenarios, it is important to generate a fast answer with high recall. In this paper, we propose the first approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our approach uses the advantages of existing metric index structures but proposes to use an approximation of the nearest-neighbor-distances in order to prune the search space. We show that our method scales significantly better than existing non-approximative approaches while producing an approximation of the true query result with a high recall.  相似文献   
185.
This article analyzes the utility of policy principles advanced by professional associations.  相似文献   
186.
187.
188.
189.
190.
The aim of the present study was to examine the factorial validity of the Test of Performance Strategies (TOPS; Thomas et al., 1999) among adolescent athletes using confirmatory factor analysis. The TOPS was designed to assess eight psychological strategies used in competition (i.e. activation, automaticity, emotional control, goal-setting, imagery, negative thinking, relaxation and self-talk,) and eight used in practice (the same strategies except negative thinking is replaced by attentional control). National-level athletes (n = 584) completed the 64-item TOPS during training camps. Fit indices provided partial support for the overall measurement model for the competition items (robust comparative fit index = 0.92, Tucker-Lewis index = 0.88, root mean square error of approximation = 0.05) but minimal support for the training items (robust comparative fit index = 0.86, Tucker-Lewis index = 0.81, root mean square error of approximation = 0.06). For the competition items, the automaticity, goal-setting, relaxation and self-talk scales showed good fit, whereas the activation, emotional control, imagery and negative thinking scales did not. For the practice items, the attentional control, emotional control, goal-setting, imagery and self-talk scales showed good fit, whereas the activation, automaticity and relaxation scales did not. Overall, it appears that the factorial validity of the TOPS for use with adolescents is questionable at present and further development is required.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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