首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   25988篇
  免费   374篇
  国内免费   16篇
教育   18565篇
科学研究   2063篇
各国文化   275篇
体育   2655篇
综合类   8篇
文化理论   270篇
信息传播   2542篇
  2022年   157篇
  2021年   300篇
  2020年   471篇
  2019年   709篇
  2018年   944篇
  2017年   875篇
  2016年   812篇
  2015年   505篇
  2014年   619篇
  2013年   4813篇
  2012年   593篇
  2011年   608篇
  2010年   474篇
  2009年   503篇
  2008年   529篇
  2007年   490篇
  2006年   469篇
  2005年   402篇
  2004年   419篇
  2003年   345篇
  2002年   352篇
  2001年   479篇
  2000年   522篇
  1999年   455篇
  1998年   277篇
  1997年   262篇
  1996年   330篇
  1995年   262篇
  1994年   278篇
  1993年   238篇
  1992年   357篇
  1991年   382篇
  1990年   351篇
  1989年   383篇
  1988年   353篇
  1987年   338篇
  1986年   331篇
  1985年   375篇
  1984年   300篇
  1983年   309篇
  1982年   247篇
  1981年   257篇
  1980年   266篇
  1979年   358篇
  1978年   254篇
  1977年   218篇
  1976年   194篇
  1975年   172篇
  1974年   173篇
  1973年   166篇
排序方式: 共有10000条查询结果,搜索用时 812 毫秒
121.
122.
123.
124.
Technical term translations are important for cross-lingual information retrieval. In many languages, new technical terms have a common origin rendered with different spelling of the underlying sounds, also known as cross-lingual spelling variants (CLSV). To find the best CLSV in a text database index, we contribute a formulation of the problem in a probabilistic framework, and implement this with an instance of the general edit distance using weighted finite-state transducers. Some training data is required when estimating the costs for the general edit distance. We demonstrate that after some basic training our new multilingual model is robust and requires little or no adaptation for covering additional languages, as the model takes advantage of language independent transliteration patterns. We train the model with medical terms in seven languages and test it with terms from varied domains in six languages. Two test languages are not in the training data. Against a large text database index, we achieve 64–78 % precision at the point of 100% recall. This is a relative improvement of 22% on the simple edit distance.  相似文献   
125.
126.
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.  相似文献   
127.
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  相似文献   
128.
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.  相似文献   
129.
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.  相似文献   
130.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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