Comprehensiveness and uniqueness of commercial databases and open access systems

Scientometrics - In this study, scholarly communication systems provided by commercial services and open access systems are examined on the basis of the comprehensiveness and uniqueness of their...     

Assessing stem cell research productivity

Honour Index (HoI), a method to evaluate research performance within different research fields, was derived from the impact factor (IF). It can be used to rate and compare different categories of journals. HoI was used in this study to determine the scientific productivity of stem cell research in the Asian Four Dragons (Hong Kong, Singapore, South Korea and Taiwan) from 1981 to 2001. The methodology applied in this study represents a synthesis of universal indicator studies and bibliometric analyses of subfields at the micro-level. We discuss several comparisons, and conclude the developmental trend in stem cell research for two decades. This revised version was published online in August 2006 with corrections to the Cover Date.     

不断发展的小型显示器

今天的液晶显示器(LCD)所达到的性能和图像质量在仅仅几年之前还是梦想,LCD显示器在几个相关的前沿领域不断发展.小型LCD体现得比其他任何领域都更为真切.手机行业的激烈竞争和螺旋式上升的用户需求正在驱动显示技术去满足融合的需要,即移动通信与移动计算和/或移动娱乐的融合.     

Learning concepts in parallel based upon the strategy of versionspace

Applies the technique of parallel processing to concept learning. A parallel version-space learning algorithm based upon the principle of divide-and-conquer is proposed. Its time complexity is analyzed to be O(k log₂n) with n processors, where n is the number of given training instances and k is a coefficient depending on the application domains. For a bounded number of processors in real situations, a modified parallel learning algorithm is then proposed. Experimental results are then performed on a real learning problem, showing that our parallel learning algorithm works, and being quite consistent with the results of theoretical analysis. We conclude that when the number of training instances is large, it is worth learning in parallel because of its faster execution     

Dynamic bandwidth allocation for multimedia traffic with rate guarantee and fair access in WCDMA systems

Packet scheduling in a WCDMA system poses a new challenge due to its nature of variable bit rates and location-dependent, time-varying channel conditions. In this work, three new downlink scheduling algorithms for a WCDMA base station are proposed to support multimedia transmissions. Using a credit management and a compensation mechanism, our algorithms provide rate guarantee and fair access to mobile terminals. In particular, we propose to allow a user to simultaneously use multiple OVSF codes in a time-sharing manner, which we call a multicode, shared model. Using multiple codes allows us to compensate those users suffering from bad communication quality or even errors. The proposed schemes can tolerate a multistate link condition (compared to the typically assumed two-state, or good-or-bad, link condition) by adjusting the number of OVSF codes and the spreading factor of each code. Simulation results show that the proposed schemes do achieve higher bandwidth utilization while keeping transmission delay low.     

3D velocity from 3D Doppler radial velocity

We present local least squares and regularization frameworks for computing 3D velocity (3D optical flow) from 3D radial velocity measured by a Doppler radar. We demonstrate the performance of our algorithms quantitatively on synthetic radial velocity data and qualitatively on real radial velocity data, obtained from the Doppler radar at Kurnell Radar station, Botany Bay, New South Wales, Australia. Radial velocity can be used to predict the future positions of storms in sequences of Doppler radar datasets.© 2005 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 15, 189–198, 2005     

Harmonic broadcasting for video-on-demand service

Using conventional broadcasting, if we want to support a 120-minute popular movie every 10 minutes, we need 12 video channels. Assuming the set-top box at the client end can buffer portions of the playing video on a disk, pyramid broadcasting schemes can reduce the bandwidth requirements to 5.7 channels. We present a new scheme which only needs 3.2 channels. For a movie with length D minutes, if we want to reduce the viewer waiting time to D/N minutes, we only need to allocate H(N) video channels to broadcast the movie periodically, where H(N) is the harmonic number of N, H(N)=1+1/2+…+1/N. In order to support video-on-demand service for a popular movie, the new scheme greatly reduces the bandwidth requirements