This paper presents the teaching design for Computer Basic Course Group, according to lack of learning initiative in current universities computer basic teaching and weak independent study of students. The combination of "classroom, experiment, extracurricular" with the information network method using in teaching realizes the process of student-centered teacher-directed teaching practice. This paper also discusses about how to develop teaching design from three aspects, consists of curriculum, teaching model and teaching evaluation, under the concept of Blended Learning.

Traditional supervised multiple kernel learning (MKL) for dimensionality reduction is generally an extension of kernel discriminant analysis (KDA), which has some restrictive assumptions. In addition, they generally are based on graph embedding framework. A more general multiple kernel-based dimensionality reduction algorithm, called multiple kernel marginal Fisher analysis (MKL-MFA), is presented for supervised nonlinear dimensionality reduction combined with ratio-race optimization problem. MKL-MFA aims at relaxing the restrictive assumption that the data of each class is of a Gaussian distribution and finding an appropriate convex combination of several base kernels. To improve the efficiency of multiple kernel dimensionality reduction, the spectral regression frameworks are incorporated into the optimization model. Furthermore, the optimal weights of predefined base kernels can be obtained by solving a different convex optimization. Experimental results on benchmark datasets demonstrate that MKL-MFA outperforms the state-of-the-art supervised multiple kernel dimensionality reduction methods.

No abstract

No abstract

Sub-dimension particle swarm optimization(s-dPSO) is proposed based on basic particle swarm optimization (bPSO). Each dimension of particle in s-dPSO is updated in turn. The dimensions with poor diversity would be mutated that is initialized again to improve the diversity of population and get global optimal solution when the algorithm is in the local convergence. Most Benchmark function get good result with s-dPSO which ability of optimization is better than bPSO.