In order to extract froth morphological feature,a bubble image adaptive segmentation method was proposed.Considering the image's low contrast and weak froth edges,froth image was coarsely segmented by using fuzzy ...In order to extract froth morphological feature,a bubble image adaptive segmentation method was proposed.Considering the image's low contrast and weak froth edges,froth image was coarsely segmented by using fuzzy c means(FCM) algorithm. Through the attributes of size and shape pattern spectrum,the optimal morphological structuring element was determined.According to the optimal parameters,some image noises were removed with an improved area opening and closing by reconstruction operation,which consist of image regional markers,and the bubbles were finely separated from each other by watershed transform.The experimental results show that the structural element can be determined adaptively by shape and size pattern spectrum,and the froth image is segmented accurately.Compared with other froth image segmentation method,the proposed method achieves much high accuracy,based on which,the bubble size and shape features are extracted effectively.展开更多
Based on the problem that the service entity only has the partial field of vision in the network environment,a trust evolvement method of the macro self-organization for Web service combination was proposed.In the met...Based on the problem that the service entity only has the partial field of vision in the network environment,a trust evolvement method of the macro self-organization for Web service combination was proposed.In the method,the control rule of the trust degree in the Dempster-Shafer(D-S)rule was utilized based on the entity network interactive behavior,and a proportion trust control rule was put up.The control rule could make the Web service self-adaptively study so as to gradually form a proper trust connection with its cooperative entities and to improve the security performance of the whole system.The experimental results show that the historical successful experience is saved during the service combination alliance,and the method can greatly improve the reliability and success rate of Web service combination.展开更多
As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of c...As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of closed-loop supply chain was selected as fitness function, and a unique and tidy coding mode was adopted in the proposed algorithm. Then, some mutation and crossover operators were introduced to achieve discrete optimization of RCSCN structure. The simulation results show that the proposed algorithm can gain global optimal solution with good convergent performance and rapidity. The computing speed is only 22.16 s, which is shorter than those of the other optimization algorithms.展开更多
Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services sele...Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.展开更多
To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this...To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this method, the image segmentation was converted into an optimization problem. The fitness function containing neighbor information was set up based on the gray information and the neighbor relations between the pixels described by the improved two-dimensional histogram. By making use of the global searching ability of the predator-prey particle swarm optimization, the optimal cluster center could be obtained by iterative optimization, and the image segmentation could be accomplished. The simulation results show that the segmentation accuracy ratio of the proposed method is above 99%. The proposed algorithm has strong anti-noise capability, high clustering accuracy and good segment effect, indicating that it is an effective algorithm for image segmentation.展开更多
The problem of the stability analysis and controller design which the network-induced delays and data dropout problems network-induced delays are assumed to be time-varying and bounded, for Lurie networked control sys...The problem of the stability analysis and controller design which the network-induced delays and data dropout problems network-induced delays are assumed to be time-varying and bounded, for Lurie networked control systems （NCSs） is investigated, in are simultaneously considered. By considering that the and analyzing the relationship between the delay and its upper bound, employing a Lyapunov-Krasovskii function and an integral inequality approach, an improved stability criterion for NCSs is proposed. Furthermore, the resulting condition is extended to design a less conservative state feedback controller by employing an improved cone complementary linearization （ICCL） algorithm. Numerical examples are provided to show the effectiveness of the method.展开更多
基金Projects(60634020,60874069) supported by the National Natural Science Foundation of ChinaProject(2009AA04Z137) supported by the National High-Tech Research and Development Program of China
文摘In order to extract froth morphological feature,a bubble image adaptive segmentation method was proposed.Considering the image's low contrast and weak froth edges,froth image was coarsely segmented by using fuzzy c means(FCM) algorithm. Through the attributes of size and shape pattern spectrum,the optimal morphological structuring element was determined.According to the optimal parameters,some image noises were removed with an improved area opening and closing by reconstruction operation,which consist of image regional markers,and the bubbles were finely separated from each other by watershed transform.The experimental results show that the structural element can be determined adaptively by shape and size pattern spectrum,and the froth image is segmented accurately.Compared with other froth image segmentation method,the proposed method achieves much high accuracy,based on which,the bubble size and shape features are extracted effectively.
基金Project(60673169)supported by the National Natural Science Foundation of China
文摘Based on the problem that the service entity only has the partial field of vision in the network environment,a trust evolvement method of the macro self-organization for Web service combination was proposed.In the method,the control rule of the trust degree in the Dempster-Shafer(D-S)rule was utilized based on the entity network interactive behavior,and a proportion trust control rule was put up.The control rule could make the Web service self-adaptively study so as to gradually form a proper trust connection with its cooperative entities and to improve the security performance of the whole system.The experimental results show that the historical successful experience is saved during the service combination alliance,and the method can greatly improve the reliability and success rate of Web service combination.
基金Project(2011ZK2030)supported by the Soft Science Research Plan of Hunan Province,ChinaProject(2010ZDB42)supported by the Social Science Foundation of Hunan Province,China+1 种基金Projects(09A048,11B070)supported by the Science Research Foundation of Education Bureau of Hunan Province,ChinaProjects(2010GK3036,2011FJ6049)supported by the Science and Technology Plan of Hunan Province,China
文摘As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of closed-loop supply chain was selected as fitness function, and a unique and tidy coding mode was adopted in the proposed algorithm. Then, some mutation and crossover operators were introduced to achieve discrete optimization of RCSCN structure. The simulation results show that the proposed algorithm can gain global optimal solution with good convergent performance and rapidity. The computing speed is only 22.16 s, which is shorter than those of the other optimization algorithms.
基金Project(70631004)supported by the Key Project of the National Natural Science Foundation of ChinaProject(20080440988)supported by the Postdoctoral Science Foundation of China+1 种基金Project(09JJ4030)supported by the Natural Science Foundation of Hunan Province,ChinaProject supported by the Postdoctoral Science Foundation of Central South University,China
文摘Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.
基金Project(06JJ50110) supported by the Natural Science Foundation of Hunan Province, China
文摘To solve the problem of poor anti-noise performance of the traditional fuzzy C-means (FCM) algorithm in image segmentation, a novel two-dimensional FCM clustering algorithm for image segmentation was proposed. In this method, the image segmentation was converted into an optimization problem. The fitness function containing neighbor information was set up based on the gray information and the neighbor relations between the pixels described by the improved two-dimensional histogram. By making use of the global searching ability of the predator-prey particle swarm optimization, the optimal cluster center could be obtained by iterative optimization, and the image segmentation could be accomplished. The simulation results show that the segmentation accuracy ratio of the proposed method is above 99%. The proposed algorithm has strong anti-noise capability, high clustering accuracy and good segment effect, indicating that it is an effective algorithm for image segmentation.
基金Project(61025015)supported by the National Natural Science Foundation of China for Distinguished Young ScholarsProject (IRT1044)supported by the Program for Changjiang Scholars and Innovative Research Team in University of China+2 种基金Projects(61143004,61203136,61074067,61273185)supported by the National Natural Science Foundation of ChinaProjects(12JJ4062,11JJ2033)supported by the Natural Science Foundation of Hunan Province,ChinaProject(12C0078)supported by Hunan Provincial Department of Education,China
文摘The problem of the stability analysis and controller design which the network-induced delays and data dropout problems network-induced delays are assumed to be time-varying and bounded, for Lurie networked control systems （NCSs） is investigated, in are simultaneously considered. By considering that the and analyzing the relationship between the delay and its upper bound, employing a Lyapunov-Krasovskii function and an integral inequality approach, an improved stability criterion for NCSs is proposed. Furthermore, the resulting condition is extended to design a less conservative state feedback controller by employing an improved cone complementary linearization （ICCL） algorithm. Numerical examples are provided to show the effectiveness of the method.
