Search

A Chinese resume information extraction system (CRIES) based on semi-structured text is designed and implemented to obtain formatted information by extracting text content of every field from resumes in different formats and update information automatically based on the web. Firstly, ideas to classify resumes, some constraints obtained by analyzing resume features and overall extraction strategy is introduced. Then two extraction algorithms for parsing resumes in different text formats are given. Consequently, the system was implemented by java programming. Finally, use the system to resolve the resume samples, and the statistical analysis and system optimization analysis are carried out according to the accuracy rate and recall rate of the extracted results.

This paper designs the distributed cooperative control algorithm that assure synchronous tracking and are globally optimal with respect to given cost functions. We consider multi-agent systems with identical discrete multi-integrator dynamics and undirected topology graph. The distributed cooperative control protocol and the interaction-free cost function are proposed firstly. With the given cost function, we derive the global optimal cooperative tracking control protocol with the optimal communication graph Laplacian matrix and the optimal pinning gain matrix though discrete LQR method. To achieve this result, we also propose the decomposability of nonsingular M-matrix and the connections between M-matrix and Laplacian matrix. The optimal control protocol requirements the communication graph is a complete graph. Otherwise, considering any symmetric graph Laplacian matrix and any pinning gain matrix, we can derive the corresponding cost function though inverse optimality. Finally, the validity of the result is illustrated through numerical examples.

This paper considers the controllability of switched linear systems. The largest controllable subspace, C, of a switched linear system is well known [6]. This paper shows that when the system is not completely controllable, C divides the state space into 2 or 3 path-wise connected invariant sub-manifolds. Then we consider whether each path-wise connected component is a controllable sub-manifold. Certain sufficient conditions are obtained for each sub-manifold to be a controllable sub-manifold. A few examples are given to demonstrate the result.