Add: 1) Mapping functions (between the resource request for each SVM and the number of SVM as well as the original resource request) designed based on the fitting from data already obtained; 2) Greedy algorithm as the comparison.

Simulation results: The primal-dual based algorithm perform almost as well as what the Greedy algorithm has done. In addition, its performance depends on the set of weights, which makes it sensitive to the number of resource request for each SVM.