SPECIAL ISSUE： DISTRIBUTION OF NATIONAL INCOME IN A TRANSITIONAL ECONOMY Labor income shares （LIS） in economic development： an empirical study based on China＇s sectoral-level data

从产业角度对中国劳动收入占比的变化进行实证研究,可以发现,产业结构变化和不同产业劳动收入占比以正相关性同时变化,均加剧了劳动收入占比的波动。基于产业数据对劳动收入占比变化进行分解,可以发现：相对于1993年,1996年劳动收入占比上升主要是由第二产业劳动收入占比提高造成的;相对于1996年,2003年劳动收入占比下降主要与第一产业比重下降有关;2004年的情况比较特殊,这一年劳动收入占比剧烈下降主要源于统计口径变化,造成第二、三产业劳动收入占比大幅减少。劳动收入占比在地区之间存在巨大差异,但是随着时间的推移,该差异在逐渐缩小,这与产业结构和产业内劳动收入占比的变化也密切相关。     

学科馆员-图情教授的协同服务模式

高校图书馆“学科馆员图情教授”协同服务是一种新的管理理念和服务模式,具有独特的优势特征,其产生有着极为现实的背景。然而,从高校图书馆的操作实践来看,这一服务模式尚待进一步完善。     

Finding longest increasing and common subsequences in streaming data

We present algorithms and lower bounds for the Longest Increasing Subsequence (LIS) and Longest Common Subsequence (LCS) problems in the data-streaming model. To decide if the LIS of a given stream of elements drawn from an alphabet αbet has length at least k, we discuss a one-pass algorithm using O(k log αbetsize) space, with update time either O(log k) or O(log log αbetsize); for αbetsize = O(1), we can achieve O(log k) space and constant-time updates. We also prove a lower bound of Ω(k) on the space requirement for this problem for general alphabets αbet, even when the input stream is a permutation of αbet. For finding the actual LIS, we give a ⌈log (1 + 1/ɛ)-pass algorithm using O(k^1+ɛlog αbetsize) space, for any ɛ > 0. For LCS, there is a trivial Θ(1)-approximate O(log n)-space streaming algorithm when αbetsize = O(1). For general alphabets αbet, the problem is much harder. We prove several lower bounds on the LCS problem, of which the strongest is the following: it is necessary to use Ω(n/ρ²) space to approximate the LCS of two n-element streams to within a factor of ρ, even if the streams are permutations of each other. A preliminary version of this paper appears in the Proceedings of the 11th International Computing and Combinatorics Conference (COCOON'05), August 2005, pp. 263–272.