首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   8398篇
  免费   76篇
  国内免费   7篇
教育   5665篇
科学研究   1112篇
各国文化   36篇
体育   602篇
综合类   15篇
文化理论   148篇
信息传播   903篇
  2023年   34篇
  2022年   61篇
  2021年   98篇
  2020年   135篇
  2019年   232篇
  2018年   353篇
  2017年   426篇
  2016年   445篇
  2015年   294篇
  2014年   233篇
  2013年   1058篇
  2012年   328篇
  2011年   359篇
  2010年   237篇
  2009年   146篇
  2008年   167篇
  2007年   200篇
  2006年   136篇
  2005年   771篇
  2004年   548篇
  2003年   378篇
  2002年   197篇
  2001年   163篇
  2000年   109篇
  1999年   97篇
  1998年   68篇
  1997年   55篇
  1996年   66篇
  1995年   38篇
  1994年   42篇
  1993年   30篇
  1992年   52篇
  1991年   54篇
  1990年   44篇
  1989年   45篇
  1988年   38篇
  1987年   39篇
  1986年   40篇
  1985年   44篇
  1984年   42篇
  1983年   23篇
  1982年   36篇
  1981年   28篇
  1979年   38篇
  1978年   37篇
  1977年   27篇
  1976年   22篇
  1974年   23篇
  1972年   25篇
  1971年   20篇
排序方式: 共有8481条查询结果,搜索用时 46 毫秒
41.
42.
A paper read at the first regular meeting of the Osler Society of McGill University, October 19, 1921.  相似文献   
43.
44.
45.
46.
In Information Retrieval, since it is hard to identify users’ information needs, many approaches have been tried to solve this problem by expanding initial queries and reweighting the terms in the expanded queries using users’ relevance judgments. Although relevance feedback is most effective when relevance information about retrieved documents is provided by users, it is not always available. Another solution is to use correlated terms for query expansion. The main problem with this approach is how to construct the term-term correlations that can be used effectively to improve retrieval performance. In this study, we try to construct query concepts that denote users’ information needs from a document space, rather than to reformulate initial queries using the term correlations and/or users’ relevance feedback. To form query concepts, we extract features from each document, and then cluster the features into primitive concepts that are then used to form query concepts. Experiments are performed on the Associated Press (AP) dataset taken from the TREC collection. The experimental evaluation shows that our proposed framework called QCM (Query Concept Method) outperforms baseline probabilistic retrieval model on TREC retrieval.  相似文献   
47.
48.
The technical study of wall paintings from the Buddhist temple complex at Nako, Western Himalayas, was one of the basic preconditions required for designing an appropriate conservation strategy. The complex, composed of four temples from the eleventh–twelfth century, offered a unique possibility to carry out a comprehensive research of technology and painting materials used in early and later western Tibetan Buddhist wall paintings as well as a comparative assessment with murals from other sites in the Western Himalayas. The study was based on extensive fieldwork and an integrated analytical approach comprising a wide range of non-destructive and micro-destructive methods. Answering the question of the coevality of paintings in the smaller temples with other original murals, the precise characterisation of binding media, the detection of the yellow dye gamboge and natural minerals posnjakite and brochantite identified for the first time in Himalayan murals, the clarification of technology of metal decoration, and the making of raised elements are some of the most exciting results which emerged from the research.  相似文献   
49.
The current state of the Russian Science Citation Index is analyzed. Several areas for its further development identified by long-standing active users, such as data searching, refinement, and storage; current user alerts; data input with the Science Index license; patent information; and the application programming interface (API) are investigated.  相似文献   
50.
Automatic detection of source code plagiarism is an important research field for both the commercial software industry and within the research community. Existing methods of plagiarism detection primarily involve exhaustive pairwise document comparison, which does not scale well for large software collections. To achieve scalability, we approach the problem from an information retrieval (IR) perspective. We retrieve a ranked list of candidate documents in response to a pseudo-query representation constructed from each source code document in the collection. The challenge in source code document retrieval is that the standard bag-of-words (BoW) representation model for such documents is likely to result in many false positives being retrieved, because of the use of identical programming language specific constructs and keywords. To address this problem, we make use of an abstract syntax tree (AST) representation of the source code documents. While the IR approach is efficient, it is essentially unsupervised in nature. To further improve its effectiveness, we apply a supervised classifier (pre-trained with features extracted from sample plagiarized source code pairs) on the top ranked retrieved documents. We report experiments on the SOCO-2014 dataset comprising 12K Java source files with almost 1M lines of code. Our experiments confirm that the AST based approach produces significantly better retrieval effectiveness than a standard BoW representation, i.e., the AST based approach is able to identify a higher number of plagiarized source code documents at top ranks in response to a query source code document. The supervised classifier, trained on features extracted from sample plagiarized source code pairs, is shown to effectively filter and thus further improve the ranked list of retrieved candidate plagiarized documents.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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