全文获取类型
| 收费全文 | 35647篇 |
| 免费 | 574篇 |
| 国内免费 | 151篇 |
专业分类
| 教育 | 25264篇 |
| 科学研究 | 3798篇 |
| 各国文化 | 313篇 |
| 体育 | 2765篇 |
| 综合类 | 44篇 |
| 文化理论 | 300篇 |
| 信息传播 | 3888篇 |
出版年
| 2022年 | 200篇 |
| 2021年 | 307篇 |
| 2020年 | 535篇 |
| 2019年 | 753篇 |
| 2018年 | 1053篇 |
| 2017年 | 1083篇 |
| 2016年 | 1047篇 |
| 2015年 | 629篇 |
| 2014年 | 834篇 |
| 2013年 | 6555篇 |
| 2012年 | 816篇 |
| 2011年 | 896篇 |
| 2010年 | 674篇 |
| 2009年 | 657篇 |
| 2008年 | 737篇 |
| 2007年 | 733篇 |
| 2006年 | 674篇 |
| 2005年 | 623篇 |
| 2004年 | 593篇 |
| 2003年 | 560篇 |
| 2002年 | 592篇 |
| 2001年 | 632篇 |
| 2000年 | 615篇 |
| 1999年 | 621篇 |
| 1998年 | 342篇 |
| 1997年 | 362篇 |
| 1996年 | 420篇 |
| 1995年 | 367篇 |
| 1994年 | 327篇 |
| 1993年 | 320篇 |
| 1992年 | 484篇 |
| 1991年 | 481篇 |
| 1990年 | 523篇 |
| 1989年 | 523篇 |
| 1988年 | 471篇 |
| 1987年 | 432篇 |
| 1986年 | 437篇 |
| 1985年 | 529篇 |
| 1984年 | 458篇 |
| 1983年 | 428篇 |
| 1982年 | 360篇 |
| 1981年 | 356篇 |
| 1980年 | 311篇 |
| 1979年 | 452篇 |
| 1978年 | 383篇 |
| 1977年 | 359篇 |
| 1976年 | 295篇 |
| 1975年 | 245篇 |
| 1974年 | 261篇 |
| 1973年 | 265篇 |
排序方式： 共有10000条查询结果，搜索用时 15 毫秒
51.
52.
53.
54.
55.
W. A. HART 《Journal of Philosophy of Education》1993,27(1):17-27
The project of studying children in order to understand them, which lies at the heart of contemporary thinking about children and their education, is misconceived. It rests, jrst of all, upon a false belief that we can only come to know something properly by deliberately and systematically pursuing knowledge of it. Secondly, it offers a paradigm of knowing children which justifies parents and teachers in not giving themselves to children. By re-interpreting the problems that adults experience with children as technical, as arising from lack of information about them, it ignores the personal and moral dimension of adults' relations with children and thus further alienates them from one another. 相似文献
56.
57.
58.
59.
Martin R?tteler 《Informatik - Forschung und Entwicklung》2006,55(3):3-20
Quantum algorithms are a field of growing interest within the theoretical computer science as
well as the physics community. Surprisingly, although the number of researchers working on the subject
is ever-increasing, the number of quantum algorithms found so far is quite small. In fact, the task of
designing new quantum algorithms has been proven to be extremely difficult. In this paper we give an overview
of the known quantum algorithms and briefly describe the underlying ideas. Roughly, the algorithms presented
are divided into hidden subgroup type algorithms and in amplitude amplification type algorithms. While
the former deal with problems of group-theoretical nature and have the promise to yield strong separations
of classical and quantum algorithms, the latter have been proved to be a prolific source of algorithms
in which a polynomial speed-up as compared to classical algorithms can be achieved. We also discuss
quantum algorithms which do not fall under these two categories and give a survey of techniques of
general interest in quantum computing such as adiabatic computing, lower bounds for quantum algorithms,
and quantum interactive proofs. 相似文献
60.
This article discusses the changing relationships of authors and publishers, the current trends and challenges they face, and the direction of these relationships in the future. As the STM publishing industry finds itself in the midst of significant technological and economic changes, this article provides background to these changes and looks at the key elements, including open access business development, institutional repository trends, and emerging public financing policies in the future. 相似文献