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.     

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.     

A Recursive Frequency Estimator Using Linear Prediction and a Kalman-Filter-Based Iterative Algorithm

This paper proposes a new Kalman-filter-based recursive frequency estimator for discrete-time multicomponent sinusoidal signals whose frequencies may be time-varying. The frequency estimator is based on the linear prediction approach and it employs the Kalman filter to track the linear prediction coefficients (LPCs) recursively. Frequencies of the sinusoids can then be computed using the estimated LPCs. Due to the coloredness of the linear prediction error, an iterative algorithm is employed to estimate the covariance matrix of the prediction error and the LPCs alternately in the Kalman filter in order to improve the tracking performance. Simulation results show that the proposed Kalman-filter-based iterative frequency estimator can achieve better tracking results than the conventional recursive least-squares-based estimators.     

Scene-Change Aware Dynamic Bandwidth Allocation for Real-Time VBR Video Transmission Over IEEE 802.15.3 Wireless Home Networks

IEEE 802.15.3, an emerging wireless technology, was designed to provide high-quality multimedia services at home. Dynamic bandwidth allocation for a multimedia connection should be considered in order to achieve higher channel utilization, less buffer and less delay, especially for variable bit rate (VBR) multimedia connections. For real-time VBR videos, the bandwidth requirement should be predicted adaptively for effective channel-time requests. Previously, the adaptive least-mean square (LMS) algorithm with fixed step size was applied to predict channel time requirements due to its simplicity and relatively good performance. However, the performance might degrade when scene changes occurred. In this paper, we modify the variable step-size LMS algorithm and apply it as our predictor (VSSNLMS) so that the prediction errors on scene changes can be effectively reduced. Using the prediction results of VSSNLMS, we propose a dynamic bandwidth-allocation scheme that is scene-change aware and can guarantee the delay bound of real-time VBR videos. Simulation results show that the VSSNLMS predictor is superior to previous LMS-type predictors in performance, and the proposed scheme has better performance in channel utilization, buffer usage, and packet loss     

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