全文获取类型
收费全文 | 11491篇 |
免费 | 3篇 |
专业分类
教育 | 8893篇 |
科学研究 | 1206篇 |
体育 | 338篇 |
文化理论 | 383篇 |
信息传播 | 674篇 |
出版年
2022年 | 1篇 |
2019年 | 8篇 |
2018年 | 2171篇 |
2017年 | 2076篇 |
2016年 | 1564篇 |
2015年 | 106篇 |
2014年 | 111篇 |
2013年 | 74篇 |
2012年 | 217篇 |
2011年 | 687篇 |
2010年 | 830篇 |
2009年 | 427篇 |
2008年 | 638篇 |
2007年 | 1146篇 |
2006年 | 68篇 |
2005年 | 390篇 |
2004年 | 443篇 |
2003年 | 355篇 |
2002年 | 127篇 |
2001年 | 4篇 |
2000年 | 21篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 14篇 |
1996年 | 1篇 |
1991年 | 6篇 |
1990年 | 1篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1972年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 23 毫秒
951.
952.
Simulation and analysis have shown that selective search can reduce the cost of large-scale distributed information retrieval. By partitioning the collection into small topical shards, and then using a resource ranking algorithm to choose a subset of shards to search for each query, fewer postings are evaluated. In this paper we extend the study of selective search into new areas using a fine-grained simulation, examining the difference in efficiency when term-based and sample-based resource selection algorithms are used; measuring the effect of two policies for assigning index shards to machines; and exploring the benefits of index-spreading and mirroring as the number of deployed machines is varied. Results obtained for two large datasets and four large query logs confirm that selective search is significantly more efficient than conventional distributed search architectures and can handle higher query rates. Furthermore, we demonstrate that selective search can be tuned to avoid bottlenecks, and thus maximize usage of the underlying computer hardware. 相似文献
953.
Zeyang Liu Jiaxin Mao Chao Wang Qingyao Ai Yiqun Liu Jian-Yun Nie 《Information Retrieval》2017,20(1):53-80
User interactions in Web search, in particular, clicks, provide valuable hints on document relevance; but the signals are very noisy. In order to better understand user click behaviors and to infer the implied relevance, various click models have been proposed, each relying on some hypotheses and involving different hidden events (e.g. examination). In almost all the existing click models, it is assumed that clicks are the only observable evidence and the examinations of documents are deduced from it. However, with an increasing number of embedded heterogeneous components (e.g. verticals) on Search Engine Result Pages, click information is not sufficient to draw a complete picture of process of user examination, especially in federated search scenario. In practice, we can also collect mouse movement information, which has proven to have a strong correlation with examination. In this paper, we propose to incorporate mouse movement information into existing click models to enhance the estimation of examination. The enhanced click models are shown to have a better ability to predict both user clicks and document relevance, than the original models. The collection of mouse movement information has been implemented in a commercial search engine, showing the feasibility of the approach in practice. 相似文献
954.
Travis Gagie Aleksi Hartikainen Kalle Karhu Juha Kärkkäinen Gonzalo Navarro Simon J. Puglisi Jouni Sirén 《Information Retrieval》2017,20(3):253-291
Most of the fastest-growing string collections today are repetitive, that is, most of the constituent documents are similar to many others. As these collections keep growing, a key approach to handling them is to exploit their repetitiveness, which can reduce their space usage by orders of magnitude. We study the problem of indexing repetitive string collections in order to perform efficient document retrieval operations on them. Document retrieval problems are routinely solved by search engines on large natural language collections, but the techniques are less developed on generic string collections. The case of repetitive string collections is even less understood, and there are very few existing solutions. We develop two novel ideas, interleaved LCPs and precomputed document lists, that yield highly compressed indexes solving the problem of document listing (find all the documents where a string appears), top-k document retrieval (find the k documents where a string appears most often), and document counting (count the number of documents where a string appears). We also show that a classical data structure supporting the latter query becomes highly compressible on repetitive data. Finally, we show how the tools we developed can be combined to solve ranked conjunctive and disjunctive multi-term queries under the simple \({\textsf{tf}}{\textsf{-}}{\textsf{idf}}\) model of relevance. We thoroughly evaluate the resulting techniques in various real-life repetitiveness scenarios, and recommend the best choices for each case. 相似文献
955.
Christie Kodama Beth St. Jean Mega Subramaniam Natalie Greene Taylor 《Information Retrieval》2017,20(5):403-432
Although youth are increasingly going online to fulfill their needs for information, many youth struggle with information and digital literacy skills, such as the abilities to conduct a search and assess the credibility of online information. Ideally, these skills encompass an accurate and comprehensive understanding of the ways in which a system, such as a Web search engine, functions. In order to investigate youths’ conceptions of the Google search engine, a drawing activity was conducted with 26 HackHealth after-school program participants to elicit their mental models of Google. The findings revealed that many participants personified Google and emphasized anthropomorphic elements, computing equipment, and/or connections (such as cables, satellites and antennas) in their drawings. Far fewer participants focused their drawings on the actual Google interface or on computer code. Overall, their drawings suggest a limited understanding of Google and the ways in which it actually works. However, an understanding of youths’ conceptions of Google can enable educators to better tailor their digital literacy instruction efforts and can inform search engine developers and search engine interface designers in making the inner workings of the engine more transparent and their output more trustworthy to young users. With a better understanding of how Google works, young users will be better able to construct effective queries, assess search results, and ultimately find relevant and trustworthy information that will be of use to them. 相似文献
956.
In view of the risk of E-commerce and the response of the insurance industry to it, this paper is aimed at one important point of insurance, that is, estimation of financial loss ratio, which is one of the most difficult problems facing the E-insurance industry. This paper proposes a quantitative analyzing model for estimating E-insurance financial loss ratio. The model is based on gross income per enterprise and CSI/FBI computer crime and security survey. The analysis results presented are reasonable and valuable for both insurer and the insured and thus can be accepted by both of them. What we must point out is that according to our assumption, the financial loss ratio varied very little, 0.233% in 1999 and 0.236% in 2000 although there was much variation in the main data of the CSI/FBI survey. 相似文献
957.
This article is concerned with the extended homogeneous balance method for studying the abundant lacalized solution structure of the (2 1)-dimensional asymmetric Nizhnik-novikov-Veselov equation.A Baecklund transformation was first obtained.and then the richness of the localized coherent structures was found,which was caused by the entrance of two variable-separated arbitrary functions,in the model.For some spectial choices of the arbitrary functions,it is shown that the localized structures of the model may be dromions,lumps,and rinmg solitons. 相似文献
958.
Noise affects most of the activities. The term noise is used to describe fluctuations about the mean deterministic stationary value of a physical quantity. Noise is generally associated, for example, with inaccuracies in measurements or impurities in signals such as musical notes and hence is undesirable. However, its essential role in physical processes was pointed out in the beginning the last century by Smoluchowski and others. It is only in the last two decades or so that the positive (active) aspects of its role has come to light and is being subjected to intense scrutiny. It is now being increasingly realised that noise is an important ingredient to bring order in dynamical processes. Though it appears counterintuitive, noise seems to help in directing transport processes in biological systems at the molecular level. 相似文献
959.
960.