首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   31745篇
  免费   436篇
  国内免费   19篇
教育   22258篇
科学研究   2891篇
各国文化   588篇
体育   2846篇
综合类   10篇
文化理论   269篇
信息传播   3338篇
  2021年   305篇
  2020年   476篇
  2019年   696篇
  2018年   921篇
  2017年   893篇
  2016年   866篇
  2015年   530篇
  2014年   697篇
  2013年   5740篇
  2012年   659篇
  2011年   706篇
  2010年   565篇
  2009年   592篇
  2008年   687篇
  2007年   642篇
  2006年   588篇
  2005年   514篇
  2004年   560篇
  2003年   421篇
  2002年   426篇
  2001年   578篇
  2000年   661篇
  1999年   567篇
  1998年   330篇
  1997年   326篇
  1996年   370篇
  1995年   305篇
  1994年   317篇
  1993年   301篇
  1992年   454篇
  1991年   490篇
  1990年   464篇
  1989年   498篇
  1988年   422篇
  1987年   419篇
  1986年   410篇
  1985年   512篇
  1984年   395篇
  1983年   402篇
  1982年   330篇
  1981年   315篇
  1980年   332篇
  1979年   459篇
  1978年   336篇
  1977年   322篇
  1976年   266篇
  1975年   248篇
  1974年   256篇
  1973年   244篇
  1971年   240篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
152.
This paper describes the procedures used at the Library of the College of Physicians of Philadelphia to divide its ninety-year-old dictionary card catalog. The division was necessitated by overcrowding, obsolete subject headings, and lack of a complete authority list which resulted in like materials being scattered throughout the catalog under several headings. Two catalogs were created: the historical-biographical catalog, representing all works published before 1950 and all works of historical or biographical nature; and the current catalog, containing all works published from 1950 on, excepting historical or biographical materials. The 1950- catalog was further divided into name and subject catalogs, and the subject section was revised according to MeSH. The project was completed in about two years. As a result, searching time has been much reduced, and the library is able to take advantage of the annual revisions of MeSH to update the subject catalog.  相似文献   
153.
A computer-generated catalog of nonprint media is described. Examples are given of four access points to the data base: (1) main entry, (2) title, (3) MeSH terms, and (4) broad subject categories. The data input procedure is summarized. The AV catalog as the basis for a union list is evaluated, and finally, the catalog in relation to certain local problems is discussed.  相似文献   
154.
155.
156.
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.  相似文献   
157.
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  相似文献   
158.
In 2001, the Regenstrief Institute for Health Care and the Indiana University School of Medicine (IUSM) began an IAIMS planning effort to create a vision and a tactical plan for the first Integrated Advanced Information Management Systems (IAIMS) implementation to cross a large area and include unaffiliated institutions. A number of elements made this planning effort unique. Among these elements were the existence of a network infrastructure that supported the Indianapolis Network for Patient Care, the existence of a mature medical informatics program at the Regenstrief Institute, and the existence of a wide-area knowledge network fostered by the IUSM libraries. However, the leadership for a strong information technology role in the IUSM that could promote collaboration in support of education and research across the diverse Indianapolis hospital systems had been lacking. By bringing together various groups, each with a commitment to improve health care quality and public health across the Indianapolis metropolitan area, regardless of individual institutional affiliation, the strategic directions for I3-Indianapolis IAIMS Initiative have been defined and the foundations for a third generation IAIMS construct have been laid in Indianapolis, Indiana.  相似文献   
159.
OBJECTIVES: This paper explores the potential of multinomial logistic regression analysis to perform Web usage mining for an academic health sciences library Website. METHODS: Usage of database-driven resource gateway pages was logged for a six-month period, including information about users' network addresses, referring uniform resource locators (URLs), and types of resource accessed. RESULTS: It was found that referring URL did vary significantly by two factors: whether a user was on-campus and what type of resource was accessed. CONCLUSIONS: Although the data available for analysis are limited by the nature of the Web and concerns for privacy, this method demonstrates the potential for gaining insight into Web usage that supplements Web log analysis. It can be used to improve the design of static and dynamic Websites today and could be used in the design of more advanced Web systems in the future.  相似文献   
160.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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