德国高职教育发展文献综述

德国高等职业教育号称德国经济腾飞的“发动机”。德国高职教育发展的文献综述,有助于深刻了解德国高等职业教育的同时,为我国高等职业教育的发展提供借鉴。学者们对于德国高职教育发展的研究主要集中在教育思想、培养模式、师资建设、法律保障和专业课程等方面。     

国外图情学科研究领域演进分析

利用知识图谱工具,绘制国外图书情报学1951-1980年、1981-1998年和1999-2012年三个时段的文献共被引图谱,可视化分析国外图书情报学研究领域的演变过程。国外图书情报学研究重点经历了图书馆与文献、信息检索与信息系统,再到当前的信息技术与用户的演进过程。     

Education Statistics and Libraries

No abstract available for this article.     

Always Yes,Never No

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.     

Bridging the Gap Inside … Inside Document Delivery

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.     

我国特殊教育信息化研究现状述评

教育信息化是教育现代化的抓手和推动力,为了解我国特殊教育信息化发展的研究现状,文章界定了特殊教育信息化的涵义,从时间、研究内容、地域以及参考类型等多个维度对我国特殊教育信息化的学术研究文献进行分析和解读,从而整理出目前特殊教育信息化研究现状,并参考发达国家在该领域的经验提出未来的研究重点和方向,以期为其他特殊教育信息化研究提供参考和借鉴。     

Effective top-k computation with term-proximity support

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.).     

Using query expansion in graph-based approach for query-focused multi-document summarization

This paper presents a novel query expansion method, which is combined in the graph-based algorithm for query-focused multi-document summarization, so as to resolve the problem of information limit in the original query. Our approach makes use of both the sentence-to-sentence relations and the sentence-to-word relations to select the query biased informative words from the document set and use them as query expansions to improve the sentence ranking result. Compared to previous query expansion approaches, our approach can capture more relevant information with less noise. We performed experiments on the data of document understanding conference (DUC) 2005 and DUC 2006, and the evaluation results show that the proposed query expansion method can significantly improve the system performance and make our system comparable to the state-of-the-art systems.     

国内特种文献网络数据库导览

文章主要介绍了国内可以检索的五类特种文献网络数据库,为广大读者和科研工作者利用特种文献提供更准确更便捷的检索途径.     

Inter and intra-document contexts applied in polyrepresentation for best match IR

The principle of polyrepresentation offers a theoretical framework for handling multiple contexts in information retrieval (IR). This paper presents an empirical laboratory study of polyrepresentation in restricted mode of the information space with focus on inter and intra-document features. The Cystic Fibrosis test collection indexed in the best match system InQuery constitutes the experimental setting. Overlaps between five functionally and/or cognitively different document representations are identified. Supporting the principle of polyrepresentation, results show that in general overlaps generated by three or four representations of different nature have higher precision than those generated from two representations or the single fields. This result pertains to both structured and unstructured query mode in best match retrieval, however, with the latter query mode demonstrating higher performance. The retrieval overlaps containing search keys from the bibliographic references provide the best retrieval performance and minor MeSH terms the worst. It is concluded that a highly structured query language is necessary when implementing the principle of polyrepresentation in a best match IR system because the principle is inherently Boolean. Finally a re-ranking test shows promising results when search results are re-ranked according to precision obtained in the overlaps whilst re-ranking by citations seems less useful when integrated into polyrepresentative applications.