Notice of RetractionA dynamic priority scheduling algorithm based on interestingness evaluation

Notice of Retraction

After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.

We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.

The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.

Supporting multiple applications is a development trend for the consumer electronics devices. In order to improve the quality of user experience under the multi-application operating environment, a novel dynamic priority scheduling algorithm based on applications´ interestingness evaluation is proposed. An interestingness evaluation model is proposed first, and the user-application interestingness matrix is generated. Then, CF-based interestingness prediction is utilized to amend the matrix´s extremely sparse feature. Finally, a dynamic priority scheduling algorithm in line with the interestingness and an implementation strategy are presented, and an experimental simulation is given subsequently. Analysis shows that this algorithm is more suitable for the resource constrained consumer electronics devices than the traditional ones.