首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   71篇
  免费   0篇
教育   55篇
科学研究   12篇
文化理论   1篇
信息传播   3篇
  2020年   2篇
  2018年   1篇
  2017年   1篇
  2016年   1篇
  2013年   12篇
  2007年   1篇
  2006年   2篇
  2002年   2篇
  2000年   1篇
  1995年   1篇
  1994年   1篇
  1991年   4篇
  1986年   1篇
  1985年   1篇
  1984年   1篇
  1983年   2篇
  1982年   1篇
  1981年   1篇
  1980年   2篇
  1979年   1篇
  1977年   1篇
  1973年   1篇
  1970年   1篇
  1969年   3篇
  1967年   1篇
  1965年   2篇
  1955年   4篇
  1954年   6篇
  1935年   1篇
  1934年   2篇
  1924年   2篇
  1919年   1篇
  1915年   2篇
  1866年   1篇
  1845年   2篇
  1844年   1篇
  1843年   1篇
排序方式: 共有71条查询结果,搜索用时 703 毫秒
1.
Post-war growth of higher education has attracted the interest of national governments. They are properly concerned with higher education's contribution to economic success and equity, and the efficient and effective use of public funds. They can intervene by means of legislation (which is unwieldy), exhortation (which is ineffective), or funding incentives. Funding councils must operate within a social and political context which determines the balance between planning and the market, central and local direction, public and private funding. They have only four strategies to choose from: deficiency-, formula-, contract-, and core-funding. The first was nearly fatal; the last is the preferred option for the future.
There are two issues: the merging of the two funding councils (PCFC and UFC), and the ending of the binary system. The first could produce a welcome single guiding intelligence for UK higher education, and economies of scale. The second raises the question of the funding of fundamental research. The merging of PCFC and UFC and the reorganisation of research-funding is a two-headed nettle. It must be grasped soon.  相似文献   
2.
3.
4.
5.
6.
7.
8.
9.
10.
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.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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