首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   26621篇
  免费   362篇
  国内免费   14篇
教育   18907篇
科学研究   2186篇
各国文化   297篇
体育   2579篇
综合类   9篇
文化理论   256篇
信息传播   2763篇
  2021年   263篇
  2020年   420篇
  2019年   632篇
  2018年   836篇
  2017年   765篇
  2016年   749篇
  2015年   458篇
  2014年   622篇
  2013年   4971篇
  2012年   560篇
  2011年   616篇
  2010年   473篇
  2009年   500篇
  2008年   539篇
  2007年   500篇
  2006年   496篇
  2005年   431篇
  2004年   452篇
  2003年   368篇
  2002年   370篇
  2001年   496篇
  2000年   550篇
  1999年   476篇
  1998年   299篇
  1997年   287篇
  1996年   339篇
  1995年   271篇
  1994年   285篇
  1993年   253篇
  1992年   376篇
  1991年   398篇
  1990年   375篇
  1989年   401篇
  1988年   373篇
  1987年   358篇
  1986年   354篇
  1985年   394篇
  1984年   320篇
  1983年   334篇
  1982年   261篇
  1981年   264篇
  1980年   280篇
  1979年   383篇
  1978年   284篇
  1977年   259篇
  1976年   225篇
  1975年   196篇
  1974年   201篇
  1973年   197篇
  1971年   185篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
121.
Postgraduate education for medical librarians is approachable from several perspectives, including internships, certificate programs, and continuing education programs. The diverse population of medical library personnel calls for a varied yet coordinated system of postgraduate education involving the Medical Library Association, regional medical libraries, library schools, and the National Library of Medical, in addition to active participation by all librarians in the health sciences field. Basic philosophies for each of the major types of programs are discussed and recommendations for future training of health sciences librarians are provided.  相似文献   
122.
123.
124.
125.
126.
127.
128.
129.
Search facilitated with agglomerative hierarchical clustering methods was studied in a collection of Finnish newspaper articles (N = 53,893). To allow quick experiments, clustering was applied to a sample (N = 5,000) that was reduced with principal components analysis. The dendrograms were heuristically cut to find an optimal partition, whose clusters were compared with each of the 30 queries to retrieve the best-matching cluster. The four-level relevance assessment was collapsed into a binary one by (A) considering all the relevant and (B) only the highly relevant documents relevant, respectively. Single linkage (SL) was the worst method. It created many tiny clusters, and, consequently, searches enabled with it had high precision and low recall. The complete linkage (CL), average linkage (AL), and Ward's methods (WM) returned reasonably-sized clusters typically of 18–32 documents. Their recall (A: 27–52%, B: 50–82%) and precision (A: 83–90%, B: 18–21%) was higher than and comparable to those of the SL clusters, respectively. The AL and WM clustering had 1–8% better effectiveness than nearest neighbor searching (NN), and SL and CL were 1–9% less efficient that NN. However, the differences were statistically insignificant. When evaluated with the liberal assessment A, the results suggest that the AL and WM clustering offer better retrieval ability than NN. Assessment B renders the AL and WM clustering better than NN, when recall is considered more important than precision. The results imply that collections in the highly inflectional and agglutinative languages, such as Finnish, may be clustered as the collections in English, provided that documents are appropriately preprocessed.  相似文献   
130.
Searching online information resources using mobile devices is affected by small screens which can display only a fraction of ranked search results. In this paper we investigate whether the search effort can be reduced by means of a simple user feedback: for a screenful of search results the user is encouraged to indicate a single most relevant document. In our approach we exploit the fact that, for small display sizes and limited user actions, we can construct a user decision tree representing all possible outcomes of the user interaction with the system. Examining the trees we can compute an upper limit on relevance feedback performance. In this study we consider three standard feedback algorithms: Rocchio, Robertson/Sparck-Jones (RSJ) and a Bayesian algorithm. We evaluate them in conjunction with two strategies for presenting search results: a document ranking that attempts to maximize information gain from the user’s choices and the top-D ranked documents. Experimental results indicate that for RSJ feedback which involves an explicit feature selection policy, the greedy top-D display is more appropriate. For the other two algorithms, the exploratory display that maximizes information gain produces better results. We conducted a user study to compare the performance of the relevance feedback methods with real users and compare the results with the findings from the tree analysis. This comparison between the simulations and real user behaviour indicates that the Bayesian algorithm, coupled with the sampled display, is the most effective. Extended version of “Evaluating Relevance Feedback Algorithms for Searching on Small Displays, ” Vishwa Vinay, Ingemar J. Cox, Natasa Milic-Frayling, Ken Wood published in the proceedings of ECIR 2005, David E. Losada, Juan M. Fernández-Luna (Eds.), Springer 2005, ISBN 3-540-25295-9  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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