To overcome the limitation that complex data types with noun attributes cannot be processed by rank learning algorithms, a new rank learning algorithm is designed. In the learning algorithm based on the decision tree,...To overcome the limitation that complex data types with noun attributes cannot be processed by rank learning algorithms, a new rank learning algorithm is designed. In the learning algorithm based on the decision tree, the splitting rule of the decision tree is revised with a new definition of rank impurity. A new rank learning algorithm, which can be intuitively explained, is obtained and its theoretical basis is provided. The experimental results show that in the aspect of average rank loss, the ranking tree algorithm outperforms perception ranking and ordinal regression algorithms and it also has a faster convergence speed. The rank learning algorithm based on the decision tree is able to process categorical data and select relative features.展开更多
In this paper we investigate a variant of the scheduling problem on two uniform machines with speeds 1 and s. For this problem, we are given two potential uniform machines to process a sequence of independent jobs. Ma...In this paper we investigate a variant of the scheduling problem on two uniform machines with speeds 1 and s. For this problem, we are given two potential uniform machines to process a sequence of independent jobs. Machines need to be activated before starting to process, and each machine activated incurs a fixed machine activation cost. No machines are initially activated, and when a job is revealed, the algorithm has the option to activate new machines. The objective is to minimize the sum of the makespan and the machine activation cost. We design optimal online algorithms with competitive ratio of (2s+1)/(s+1) for every s≥1.展开更多
A geometrical parameters optimization and reducers selection method was proposed for robotic manipulators design. The Lagrangian approach was employed in deriving the dynamic model of a two-DOF manipulator. The flexib...A geometrical parameters optimization and reducers selection method was proposed for robotic manipulators design. The Lagrangian approach was employed in deriving the dynamic model of a two-DOF manipulator. The flexibility of links and joints was taken into account in the mechanical structure dimensions optimization and reducers selection, in which Timoshenko model was used to discretize the hollow links. Two criteria, i.e. maximization of fundamental frequency and minimization of self-mass/load ratio, were utilized to optimize the manipulators. The NSGA-II (fast elitist nondominated sorting genetic algorithms) was employed to solve the multi-objective optimization problem. How the joints flexibility affects the manipulators design was analyzed and shown in the numerical analysis example. The results indicate that simultaneous consideration of the joints and the links flexibility is very necessary for manipulators optimal design. Finally, several optimal combinations were provided. The effectiveness of the optimization method was proved by comparing with ADAMS simulation results. The self-mass/load ratio error of the two methods is within 10%. The maximum error of the natural frequency by the two methods is 23.74%. The method proposed in this work provides a fast and effective pathway for manipulator design and reducers selection.展开更多
Lexicalized reordering models are very important components of phrasebased translation systems.By examining the reordering relationships between adjacent phrases,conventional methods learn these models from the word a...Lexicalized reordering models are very important components of phrasebased translation systems.By examining the reordering relationships between adjacent phrases,conventional methods learn these models from the word aligned bilingual corpus,while ignoring the effect of the number of adjacent bilingual phrases.In this paper,we propose a method to take the number of adjacent phrases into account for better estimation of reordering models.Instead of just checking whether there is one phrase adjacent to a given phrase,our method firstly uses a compact structure named reordering graph to represent all phrase segmentations of a parallel sentence,then the effect of the adjacent phrase number can be quantified in a forward-backward fashion,and finally incorporated into the estimation of reordering models.Experimental results on the NIST Chinese-English and WMT French-Spanish data sets show that our approach significantly outperforms the baseline method.展开更多
基金The Planning Program of Science and Technology of Hunan Province (No05JT1039)
文摘To overcome the limitation that complex data types with noun attributes cannot be processed by rank learning algorithms, a new rank learning algorithm is designed. In the learning algorithm based on the decision tree, the splitting rule of the decision tree is revised with a new definition of rank impurity. A new rank learning algorithm, which can be intuitively explained, is obtained and its theoretical basis is provided. The experimental results show that in the aspect of average rank loss, the ranking tree algorithm outperforms perception ranking and ordinal regression algorithms and it also has a faster convergence speed. The rank learning algorithm based on the decision tree is able to process categorical data and select relative features.
基金Project (No. Y605316) supported by the Natural Science Foundationof Zhejiang Province, China and the Natural Science Foundation of the Education Department of Zhejiang Province (No. 20060578), China
文摘In this paper we investigate a variant of the scheduling problem on two uniform machines with speeds 1 and s. For this problem, we are given two potential uniform machines to process a sequence of independent jobs. Machines need to be activated before starting to process, and each machine activated incurs a fixed machine activation cost. No machines are initially activated, and when a job is revealed, the algorithm has the option to activate new machines. The objective is to minimize the sum of the makespan and the machine activation cost. We design optimal online algorithms with competitive ratio of (2s+1)/(s+1) for every s≥1.
基金Project(2009AA04Z216) supported by the National High-Tech Research and Development Program (863 Program) of ChinaProject(2009ZX04013-011) supported by the National Science and Technology Major Project of ChinaProject supported by the HIT Oversea Talents Introduction Program,China
文摘A geometrical parameters optimization and reducers selection method was proposed for robotic manipulators design. The Lagrangian approach was employed in deriving the dynamic model of a two-DOF manipulator. The flexibility of links and joints was taken into account in the mechanical structure dimensions optimization and reducers selection, in which Timoshenko model was used to discretize the hollow links. Two criteria, i.e. maximization of fundamental frequency and minimization of self-mass/load ratio, were utilized to optimize the manipulators. The NSGA-II (fast elitist nondominated sorting genetic algorithms) was employed to solve the multi-objective optimization problem. How the joints flexibility affects the manipulators design was analyzed and shown in the numerical analysis example. The results indicate that simultaneous consideration of the joints and the links flexibility is very necessary for manipulators optimal design. Finally, several optimal combinations were provided. The effectiveness of the optimization method was proved by comparing with ADAMS simulation results. The self-mass/load ratio error of the two methods is within 10%. The maximum error of the natural frequency by the two methods is 23.74%. The method proposed in this work provides a fast and effective pathway for manipulator design and reducers selection.
基金supported by the National Natural Science Foundation of China（No.61303082） the Research Fund for the Doctoral Program of Higher Education of China（No.20120121120046）
文摘Lexicalized reordering models are very important components of phrasebased translation systems.By examining the reordering relationships between adjacent phrases,conventional methods learn these models from the word aligned bilingual corpus,while ignoring the effect of the number of adjacent bilingual phrases.In this paper,we propose a method to take the number of adjacent phrases into account for better estimation of reordering models.Instead of just checking whether there is one phrase adjacent to a given phrase,our method firstly uses a compact structure named reordering graph to represent all phrase segmentations of a parallel sentence,then the effect of the adjacent phrase number can be quantified in a forward-backward fashion,and finally incorporated into the estimation of reordering models.Experimental results on the NIST Chinese-English and WMT French-Spanish data sets show that our approach significantly outperforms the baseline method.
