全文获取类型
收费全文 | 658篇 |
免费 | 12篇 |
国内免费 | 52篇 |
专业分类
教育 | 81篇 |
科学研究 | 140篇 |
体育 | 5篇 |
综合类 | 12篇 |
文化理论 | 1篇 |
信息传播 | 483篇 |
出版年
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 4篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 8篇 |
2017年 | 2篇 |
2016年 | 7篇 |
2015年 | 5篇 |
2014年 | 26篇 |
2013年 | 37篇 |
2012年 | 40篇 |
2011年 | 72篇 |
2010年 | 36篇 |
2009年 | 34篇 |
2008年 | 52篇 |
2007年 | 57篇 |
2006年 | 74篇 |
2005年 | 53篇 |
2004年 | 40篇 |
2003年 | 39篇 |
2002年 | 37篇 |
2001年 | 28篇 |
2000年 | 27篇 |
1999年 | 9篇 |
1998年 | 10篇 |
1997年 | 10篇 |
1994年 | 1篇 |
排序方式: 共有722条查询结果,搜索用时 15 毫秒
121.
真德秀评点中的公文本体论与文体论 总被引:1,自引:0,他引:1
王婵 《河南师范大学学报(哲学社会科学版)》2006,33(6):173-175
真德秀《文章正宗》所收文章中公文所占的分量极大,而且在其评点中还隐含了大量的公文思想。它首先论述到了公文本体方面的各种问题。还论述了公文中主要文种的概念,并先后对“对”、“谏”、“论”等文体进行过全方位的考察,使后学者真正了解这些实用公文文体的特性。由真氏对“议论”这类公文文体的评语,可见其在公文文体理论史上的地位。真氏评点中的公文理论值得我们深入探讨。 相似文献
122.
版本区分是当同种文献具有多个版本时所做的进一步划分,而版次区分则是对同种文献(只有一个版本时)或同种文献的同一个版本(具有多个版本时)所做的深度划分。二者区分的目的在于使同种文献的不同版本与版次彼此之间泾渭分明、排列有序,便于识别和选择。参考文献8。 相似文献
123.
肖景 《图书馆工作与研究》2012,(4):66-68
本文根据CASHL近3年文献传递优惠月活动的举办情况,分析了CASHL文献传递优惠活动的作用,并提出了充分发挥CASHL文献传递优惠活动作用的措施。 相似文献
124.
读者参与现场采购是图书馆实行人本服务的一项举措,有利于促进图书馆与公众和读者的交流,可以减轻采购馆员的工作压力,具有直观性、针对性和时效性较强等优点。图书馆推广读者现场采购活动要克服思想障碍,加强组织协调,激发读者兴趣,综合利用多种手段克服其不足。 相似文献
125.
126.
利用知识图谱工具,绘制国外图书情报学1951-1980年、1981-1998年和1999-2012年三个时段的文献共被引图谱,可视化分析国外图书情报学研究领域的演变过程。国外图书情报学研究重点经历了图书馆与文献、信息检索与信息系统,再到当前的信息技术与用户的演进过程。 相似文献
127.
No abstract available for this article. 相似文献
128.
ABSTRACT The “difficult” requests submitted by the research library users prove document delivery vendors could hardly replace interlibrary loan librarians. “Difficult” requests ask for the “grey literature” not traded commercially and not kept in libraries. They require the special attention and professional knowledge of the interlibrary loan librarian. Besides usual bibliographic and reference tools, the Internet, e-mail, and the search engines have to be employed to solve them. The help of those responsible for the production of the literature in question is significant. In tackling “difficult” requests, interlibrary loan librarians may further add value to their services by facilitating sharing between scholars or researchers. Five actual cases are presented to illustrate how the “difficult” requests were tackled and solved. 相似文献
129.
《Journal Of Access Services》2013,10(1):151-177
Abstract Librarians today are faced with many choices when acquiring information and directing their users to the sources they need. This is most evident with serials. The choices have become more confusing with new options requiring libraries to determine what a full text purchase actually buys, how to be sure users can identify the material needed, and then how to acquire the actual material in the most appropriate media. Providing access by the piece is a valid solution that can help lead to the transition to full text online journals. This article critiques the use of the British Library Document Supply Centre's “inside” service and its use at the University of Illinois at Urbana-Champaign Library (UIUC). The article concludes with a review of the components of a good document delivery system. 相似文献
130.
Modern web search engines are expected to return the top-k results efficiently. Although many dynamic index pruning strategies have been proposed for efficient top-k computation, most of them are prone to ignoring some especially important factors in ranking functions, such as term-proximity (the distance relationship between query terms in a document). In our recent work [Zhu, M., Shi, S., Li, M., & Wen, J. (2007). Effective top-k computation in retrieving structured documents with term-proximity support. In Proceedings of 16th CIKM conference (pp. 771–780)], we demonstrated that, when term-proximity is incorporated into ranking functions, most existing index structures and top-k strategies become quite inefficient. To solve this problem, we built the inverted index based on web page structure and proposed the query processing strategies accordingly. The experimental results indicate that the proposed index structures and query processing strategies significantly improve the top-k efficiency. In this paper, we study the possibility of adopting additional techniques to further improve top-k computation efficiency. We propose a Proximity-Probe Heuristic to make our top-k algorithms more efficient. We also test the efficiency of our approaches on various settings (linear or non-linear ranking functions, exact or approximate top-k processing, etc.). 相似文献