全文获取类型
收费全文 | 9624篇 |
免费 | 128篇 |
国内免费 | 11篇 |
专业分类
教育 | 6653篇 |
科学研究 | 1185篇 |
各国文化 | 72篇 |
体育 | 680篇 |
综合类 | 4篇 |
文化理论 | 69篇 |
信息传播 | 1100篇 |
出版年
2022年 | 61篇 |
2021年 | 117篇 |
2020年 | 142篇 |
2019年 | 198篇 |
2018年 | 330篇 |
2017年 | 296篇 |
2016年 | 307篇 |
2015年 | 180篇 |
2014年 | 313篇 |
2013年 | 1670篇 |
2012年 | 220篇 |
2011年 | 260篇 |
2010年 | 219篇 |
2009年 | 206篇 |
2008年 | 255篇 |
2007年 | 216篇 |
2006年 | 196篇 |
2005年 | 174篇 |
2004年 | 189篇 |
2003年 | 144篇 |
2002年 | 152篇 |
2001年 | 204篇 |
2000年 | 212篇 |
1999年 | 194篇 |
1998年 | 104篇 |
1997年 | 145篇 |
1996年 | 117篇 |
1995年 | 89篇 |
1994年 | 109篇 |
1993年 | 82篇 |
1992年 | 173篇 |
1991年 | 138篇 |
1990年 | 127篇 |
1989年 | 157篇 |
1988年 | 136篇 |
1987年 | 109篇 |
1986年 | 113篇 |
1985年 | 122篇 |
1984年 | 88篇 |
1983年 | 116篇 |
1982年 | 77篇 |
1981年 | 82篇 |
1980年 | 67篇 |
1979年 | 115篇 |
1978年 | 78篇 |
1977年 | 74篇 |
1976年 | 57篇 |
1975年 | 57篇 |
1974年 | 69篇 |
1973年 | 64篇 |
排序方式: 共有9763条查询结果,搜索用时 15 毫秒
931.
932.
Gary E. Bingham Margaret F. Quinn Kyla McRoy Xiao Zhang Hope K. Gerde 《Early Childhood Education Journal》2018,46(6):601-611
Despite the importance of early writing development to children’s school success, research documents that early childhood teachers spend little time actively supporting children’s writing development in preschool classrooms. This article provides a framework for integrating writing experiences across the early childhood curriculum. Practical examples are given regarding how writing opportunities can be incorporated into existing activities and play settings. The metaphor of backgrounding and foregrounding writing experiences is used to illustrate ways that teachers can set writing rich environments and activities in a manner that makes it easier for teachers to bring these experiences into everyday learning opportunities. Attention is given to how teachers can bring writing to the foreground of the curriculum by drawing attention to writing materials, making natural connections with children’s interest and play, and scaffolding children’s early writing attempts and experiences. 相似文献
933.
934.
935.
936.
937.
佛教中的体验与“家庭相似性”关联何在,为之辩护的论题包括两部分:(1)与其他方式相比,把皈依概念和神迹概念纳入体验概念可以使我们对佛教体验形成一种更为恰当的观点,而这一观点能够表明佛教的宣称与科学的经验主义的宣称之间的区别(前提1-10);(2)关于界定体验之所是的“家族相似性”理念,本文结论是,皈依与神迹是对佛教中的体验所作出的非实在论的“家族相似性”定义中的两个要素(前提11-13). 相似文献
938.
939.
Alcohol-related posts on social-networking sites (SNS) can damage college students’ reputations and relationships and contribute to risky behavior. However, little is known about how college drinkers engage in privacy management involving alcohol content. Through 48 interviews and a Communication Privacy Management lens, this study uncovered criteria on which students relied to develop relatively impermeable boundaries around alcohol posts, the ways they collectively negotiated privacy with peers, and how participants implicitly and explicitly communicatively negotiated privacy turbulence. Findings suggest important connections between the co-occurrence of online privacy management and identity management, including how facework is involved in remediating privacy breaches and the co-opting of privacy. Findings also inform efforts to educate college drinkers about on-and-offline strategies to manage alcohol-related SNS content. 相似文献
940.
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. 相似文献