全文获取类型
收费全文 | 12563篇 |
免费 | 26篇 |
国内免费 | 3篇 |
专业分类
教育 | 9748篇 |
科学研究 | 1264篇 |
各国文化 | 16篇 |
体育 | 403篇 |
文化理论 | 400篇 |
信息传播 | 761篇 |
出版年
2023年 | 10篇 |
2022年 | 31篇 |
2021年 | 30篇 |
2020年 | 45篇 |
2019年 | 70篇 |
2018年 | 2245篇 |
2017年 | 2135篇 |
2016年 | 1638篇 |
2015年 | 147篇 |
2014年 | 167篇 |
2013年 | 295篇 |
2012年 | 266篇 |
2011年 | 724篇 |
2010年 | 860篇 |
2009年 | 463篇 |
2008年 | 670篇 |
2007年 | 1174篇 |
2006年 | 95篇 |
2005年 | 413篇 |
2004年 | 460篇 |
2003年 | 368篇 |
2002年 | 142篇 |
2001年 | 18篇 |
2000年 | 32篇 |
1999年 | 1篇 |
1998年 | 9篇 |
1997年 | 18篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 7篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1977年 | 1篇 |
1976年 | 3篇 |
1972年 | 2篇 |
1971年 | 2篇 |
1966年 | 1篇 |
1964年 | 2篇 |
1962年 | 1篇 |
1961年 | 1篇 |
1960年 | 1篇 |
1933年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
951.
Features for image retrieval: an experimental comparison 总被引:6,自引:0,他引:6
952.
Negation recognition in medical narrative reports 总被引:1,自引:0,他引:1
Substantial medical data, such as discharge summaries and operative reports are stored in electronic textual form. Databases
containing free-text clinical narratives reports often need to be retrieved to find relevant information for clinical and
research purposes. The context of negation, a negative finding, is of special importance, since many of the most frequently
described findings are such. When searching free-text narratives for patients with a certain medical condition, if negation
is not taken into account, many of the documents retrieved will be irrelevant. Hence, negation is a major source of poor precision
in medical information retrieval systems. Previous research has shown that negated findings may be difficult to identify if
the words implying negations (negation signals) are more than a few words away from them. We present a new pattern learning
method for automatic identification of negative context in clinical narratives reports. We compare the new algorithm to previous
methods proposed for the same task, and show its advantages: accuracy improvement compared to other machine learning methods,
and much faster than manual knowledge engineering techniques with matching accuracy. The new algorithm can be applied also
to further context identification and information extraction tasks.
相似文献
Lior RokachEmail: |
953.
Document length is widely recognized as an important factor for adjusting retrieval systems. Many models tend to favor the
retrieval of either short or long documents and, thus, a length-based correction needs to be applied for avoiding any length
bias. In Language Modeling for Information Retrieval, smoothing methods are applied to move probability mass from document
terms to unseen words, which is often dependant upon document length. In this article, we perform an in-depth study of this
behavior, characterized by the document length retrieval trends, of three popular smoothing methods across a number of factors,
and its impact on the length of documents retrieved and retrieval performance. First, we theoretically analyze the Jelinek–Mercer,
Dirichlet prior and two-stage smoothing strategies and, then, conduct an empirical analysis. In our analysis we show how Dirichlet
prior smoothing caters for document length more appropriately than Jelinek–Mercer smoothing which leads to its superior retrieval
performance. In a follow up analysis, we posit that length-based priors can be used to offset any bias in the length retrieval
trends stemming from the retrieval formula derived by the smoothing technique. We show that the performance of Jelinek–Mercer
smoothing can be significantly improved by using such a prior, which provides a natural and simple alternative to decouple
the query and document modeling roles of smoothing. With the analysis of retrieval behavior conducted in this article, it
is possible to understand why the Dirichlet Prior smoothing performs better than the Jelinek–Mercer, and why the performance
of the Jelinek–Mercer method is improved by including a length-based prior.
相似文献
Leif AzzopardiEmail: |
954.
Evan Schnittman 《Publishing Research Quarterly》2008,24(2):139-142
Search engine discoverability programs have changed the fundamentals of book marketing by enabling content inside the book
to be used as the source of marketing itself via search results inside books. The internet trifecta of search, browse, buy
is the end game but the complexities of making this work is explored along with an in-depth overview of the potential upside
and difficulties of online content purchase models. 相似文献
955.
Experimentation and Innovation in U.S. Publishing Today: Findings from the Book Industry Study Group
Michael Healy 《Publishing Research Quarterly》2008,24(4):233-239
In February 2008 the Book Industry Study Group (BISG) conducted a survey of U.S. publishers to determine the extent of technology-driven
innovation and experimentation. The survey findings were published alongside a set of 10 case studies in May 2008 as “From
experimentation to innovation in the digital age—case studies from the North American Book Industry 2008”. This article, written
by Michael Healy, Executive Director of the BISG, summarizes the circumstances that led to the survey and shares the key findings. 相似文献
956.
This article addresses the trajectory of Archival Science in Brazil, its extracurricular characteristics and its particular relationship with Information Science within academics, its institutional associations, and some considerations regarding current training for archivists in Brazil. The methodological procedures used included analyzing documents from the National Archive Fonds of Brazil, reviewing archive literature, and interviewing people involved in consolidating Archival Science. This study concludes that Archival Science research is taking place in graduate programs throughout public Brazilian universities and points out that people working with archives now have more advanced training, such as undergraduate degrees in Archival Science or other. This study also focuses on archives as information units, while presenting and reflecting on the demands of training archivists who are faced with the challenges of the working world and the era of information and knowledge—challenges that go beyond merely technical procedures and encompass dynamic planning and orientation activities. 相似文献
957.
A compressed full-text self-index for a text T, of size u, is a data structure used to search for patterns P, of size m, in T, that requires reduced space, i.e. space that depends on the empirical entropy (H
k
or H
0) of T, and is, furthermore, able to reproduce any substring of T. In this paper we present a new compressed self-index able to locate the occurrences of P in O((m + occ)log u) time, where occ is the number of occurrences. The fundamental improvement over previous LZ78 based indexes is the reduction of the search
time dependency on m from O(m
2) to O(m). To achieve this result we point out the main obstacle to linear time algorithms based on LZ78 data compression and expose
and explore the nature of a recurrent structure in LZ-indexes, the suffix tree. We show that our method is very competitive in practice by comparing it against other state of the art compressed
indexes.
相似文献
Arlindo L. OliveiraEmail: |
958.
959.
Venkatesan Sundaresan 《Resonance》2017,22(2):163-176
Gary Ruvkun is a winner of the 2015 Breakthrough Prize in Life Sciences. He is a co-discoverer of microRNAs (with Victor Ambros, University of Massachusetts), regarded as one of the seminal discoveries of 21st century molecular biology. In addition to the Breakthrough Prize, Ruvkun and Ambros have received the Warren Triennial Prize, the Laskar Foundation Award, and numerous other awards and prizes. Professor Ruvkun obtained his PhD from Harvard University, did his postdoctoral research at MIT, and subsequently accepted a faculty position at Harvard, where he is currently Professor of Genetics. His laboratory conducts research on basic cellular processes, using the worm C. elegans as a model system. 相似文献
960.
V Rajaraman 《Resonance》2017,22(12):1175-1192
Multi-core microprocessor is an interconnected set of independent processors called cores integrated on a single silicon chip. These processing cores communicate and cooperate with one another to execute one or more programs faster than a single core processor. In this article we describe how and why these types of processors evolved. We also describe the basics of how multi-core microprocessors are programmed. 相似文献