摘要：In order to achieve adaptive and efficient service composition, a task-oriented algorithm for discovering services is proposed. The traditional process of service composition is divided into semantic discovery and functional matching and makes tasks be operation objects. Semantic similarity is used to discover services matching a specific task and then generate a corresponding task-oriented web service composition （TWC） graph. Moreover, an algorithm for the new service is designed to update the TWC. The approach is applied to the composition model, in which the TWC is searched to obtain an optimal path and the final service composition is output. Also, the model can implement realtime updating with changing environments. Experimental results demonstrate the feasibility and effectiveness of the algorithm and indicate that the maximum searching radius can be set to 2 to achieve an equilibrium point of quality and quantity.

摘要：Main goal of this paper is to discuss specific problem which is occurring during the creation of modem complex soRware systems, particularly at the design stage. Many of modem architectural styles are promoting building composite software systems compounded with reusable and flexible units. Because of high speed of contemporary software system evolution which is related to initial process changes, it is very significant to have ability to do related refactoring tasks. Sometimes, when structure if software system is monolithic, modification process takes a long time and in worse cases it is impossible. On the other hand flexible composite systems are easy to govern. Our work is related to complex process decomposition into small simple sub-processes at the architectural level of designing stage.

摘要：In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the *** results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service *** algorithm produces near optimum solution with much less computation cost.