Along with the development of Internet, Web Services technology is a new branch of Web application program, and it has become a hotspot in computer science. However, it has not made great progress in research on Web S...Along with the development of Internet, Web Services technology is a new branch of Web application program, and it has become a hotspot in computer science. However, it has not made great progress in research on Web Services security. Traditional security solutions cannot satisfy the Web Services security require of selective protection, end-to-end security and application layer security. Web Services technology needs a solution integrated in Web Services framework to realize end-to-end security. Based on cryptography and Web Services technology and according to W3C, XML encryption specification, XML digital Signature specification and WS-Security, which proposed by IBM and Microsoft, a new Web services security model based on message layer is put forward in this paper. The message layer is composed of message handlers. It is inserted into the message processing sequence and provides transparent security services for Web Services. To verify the model, a Web Services security system is realized on, net platform. The implementation version of the model can provide various security services, and has advantages such as security, scalability, security controllability and end-to-end security in message level. Key words Web services - Web services security - message layer CLC number TP 393.08 Biography: WANG Cui-ru (1954-), female, Professor, research direction: database and information management system.展开更多
FL-Online(http://fanlab.ac.cn) is an out-of-box modern web service featuring a user-friendly interface and simplified parameters, providing academic users with access to a series of online programs for biomolecular cr...FL-Online(http://fanlab.ac.cn) is an out-of-box modern web service featuring a user-friendly interface and simplified parameters, providing academic users with access to a series of online programs for biomolecular crystallography, including SAPI-online, OASIS-online, C-IPCAS-online and a series of upcoming software releases. Meanwhile, it is a highly scalable and maintainable web application framework that provides a powerful and flexible solution for academic web development needs. All the codes are open-source under MIT licenses in GitHub.展开更多
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 co...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 algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.展开更多
In order to solve the problem that the current matchmaking methods for semantic web service mainly focus on the matchmaking of IO (inputs, outputs) descriptions which may result in one-sidedness, a description-logic...In order to solve the problem that the current matchmaking methods for semantic web service mainly focus on the matchmaking of IO (inputs, outputs) descriptions which may result in one-sidedness, a description-logic-based IOPE (inputs, outputs, preconditions, effects) description and matchmaking method is proposed for semantic web service. The description logic concept is used to annotate service IO and the description logic assertion is employed to describe service PE(preconditions, effects). TBox subsumption checking is used to measure the subsumption relationship between IO descriptions of service request and advertising; ABox consistency checking is used for checking the logical implication between PE descriptions of service request and advertising. Based upon the logical implication, four kinds of PE matching degrees are proposed to measure and compare the pros and cons of the results of matchmaking. They are the exact, perfect, side-effect and common match. Experiments show that the method has a higher precision rate under the same recall rate compared with the existing method.展开更多
Services discovery based on syntactic matching cannot adapt to the open and dynamic environment of the web. To select the proper one from the web services candidate set provided by syntactic matching, a service select...Services discovery based on syntactic matching cannot adapt to the open and dynamic environment of the web. To select the proper one from the web services candidate set provided by syntactic matching, a service selection method based on semantic similarity is proposed. First, this method defines a web services ontology including QoS and context as semantic supporting, which also provides a set of terms to describe the interfaces of web services. Secondly, the similarity degree of two web services is evaluated by computing the semantic distances of those terms used to describe interfaces. Compared with existing methods, interfaces of web services can be interpreted under ontology, because it provides a formal and semantic specification of conceptualization. Meanwhile, efficiency and accuracy of services selection are improved.展开更多
In order to formally reason and verify web services composition described by web services choreography specification WS-CDL,a typed formal model named typed Abstract WS-CDL(web services choreography description langu...In order to formally reason and verify web services composition described by web services choreography specification WS-CDL,a typed formal model named typed Abstract WS-CDL(web services choreography description language)for WS-CDL specifications is proposed.In typed Abstract WS-CDL,the syntax of type and session,typing rules and operational semantics are formalized;the collaborations of web services are formally described by sessions;the operational semantics of a session can help to formally reason the execution of the choreography;the typing rules can help to formally check the data type consistency of exchanged information between web services and capture run-time errors due to type mismatches.Particularly,the concepts of type assumption set extension and type assumption set compatibility are proposed,and the merging algorithm of type assumption sets is defined so as to eliminate type assumption conflict.Based on the formal model,typed mapping rules for mapping web services choreography to orchestration is also defined.With the typed mapping rules,orchestration stubs and their type assumption sets can be generated from a given choreography; thus, web services composition can be verified at choreography and orchestration levels,respectively.The model is proved to have properties of type safety,and how the model can help to reason and verify web services composition is illustrated through a case study.展开更多
In order to increase the effectiveness and the reliability of web services flow, the ~r-calculus formal method is introduced as a development language for web services flow. The π-calculus overcomes inabilities of we...In order to increase the effectiveness and the reliability of web services flow, the ~r-calculus formal method is introduced as a development language for web services flow. The π-calculus overcomes inabilities of web service flow languages in demonstrating the consistency, validating the correctness and so on. The π- calculus analysis and modeling of web services flow is presented, the dynamic actions and basic activities of WS-BPEL with π-calculus formally are described, and the mapping from π-calculus expression to WS-BPEL is built. The basic construction of web services flow with the π-calculus method after the analysis of the syntax of WS-BPEL and inter-description between WS-BPEL and π-calculus is expressed. Also discussed are the approaches to web services flow by modeling from different views, and the proposed approaches through the development and modeling of an e-commerce web service flow application are illustrated.展开更多
Parallel kinematics machine (PKM) is advantageous over the serial machine tools in processing the complex-surface products. A manufacturing service system for PKM is developed to provide the services of the complex-...Parallel kinematics machine (PKM) is advantageous over the serial machine tools in processing the complex-surface products. A manufacturing service system for PKM is developed to provide the services of the complex-surface machining for potential geographically-dispersed manufacturing enterprises. In order to easily in- tegrate the external system, Web services are used to encapsulate post-processing functions of PKM legacy sys- tems, including compilation, workspace calculation, interfere calibration, and kinematics transformation. A ser- vice-oriented architecture(SOA) is proposed for the cooperative work between the PKM system and its client. The workflow and the function module of this manufacturing service system are presented. An example shows that as a result of SOA and loose coupling, such a Web service-based manufacturing service system is easier to in- tegrate and interoperate with its client. Meanwhile, the system decreases the manufacturing cost and improves the efficiency than its former kind of distributed system.展开更多
To address the problem of web services selection based on quality, an approach of multi-attribute group decision making algorithm is proposed. Based on the Borda social choice function, the group decision making algor...To address the problem of web services selection based on quality, an approach of multi-attribute group decision making algorithm is proposed. Based on the Borda social choice function, the group decision making algorithm aggregates the results of multiple methods with different principles which are used to obtain constantly changing quality of service, thus increasing the confidence to select the most appropriate web service for a special task. The experimental results indicate that the proposed approach has better scalability and can be applied to large-scale distributed service computing environments. It is also shown that the proposed group decision making approach can effectively optimize the services selection and outperforms the random and robin policies. By using this approach, it can extend a method to obtain constantly changing quality of service and construct a synthetic information entity with multi-level knowledge, which guarantees the accuracy of services selection.展开更多
In order to realize flexible, adaptable, extensible, efficient, and user-friendly service composition, we propose a service design oriented Web Service composite platform (SDOWSCP) and a service composition mechanis...In order to realize flexible, adaptable, extensible, efficient, and user-friendly service composition, we propose a service design oriented Web Service composite platform (SDOWSCP) and a service composition mechanism called composed-service-requestor-orient ed service composition (OBSDOSC). SDOWSCP imports ontology into UDDI to define and annotate services in a flexible and intuitive manner and employs a concept of bond as a solution to the process heterogeneity. OBSDOSC is proposed in order to do some efforts to overcome some defects which current design tools usually have such as not user friendly and too professional. This paper proposes a pattern which describes the basic features of semi-automatic composite mode, discusses the whole lifetime of composed service and highlights how to lessen the descriptive heterogeneity and process heterogeneity and how to facilitate the design of composing a service.展开更多
This paper proposes a dynamic Web service trust (WS Trust) model, and somecorresponding trust metric evaluation algorithms. The main goal is to evaluate the trustworthinessand predict the future bchaxiors of entities ...This paper proposes a dynamic Web service trust (WS Trust) model, and somecorresponding trust metric evaluation algorithms. The main goal is to evaluate the trustworthinessand predict the future bchaxiors of entities in oeder to help users find trustworthy Web serviceproviders and prevent users from providing unfair ratings against service providers.展开更多
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.展开更多
For the problem of dynamic optimization in Web services composition, this paper presents a novel approach for selecting optimum Web services, which is based on the longest path method of weighted multistage graph. We ...For the problem of dynamic optimization in Web services composition, this paper presents a novel approach for selecting optimum Web services, which is based on the longest path method of weighted multistage graph. We propose and implement an Immune Algorithm for global optimization to construct composed Web services. Results of the experimentation illustrates that the algorithm in this paper has a powerful capability and can greatly improve the efficiency and veracity in service selection.展开更多
文摘Along with the development of Internet, Web Services technology is a new branch of Web application program, and it has become a hotspot in computer science. However, it has not made great progress in research on Web Services security. Traditional security solutions cannot satisfy the Web Services security require of selective protection, end-to-end security and application layer security. Web Services technology needs a solution integrated in Web Services framework to realize end-to-end security. Based on cryptography and Web Services technology and according to W3C, XML encryption specification, XML digital Signature specification and WS-Security, which proposed by IBM and Microsoft, a new Web services security model based on message layer is put forward in this paper. The message layer is composed of message handlers. It is inserted into the message processing sequence and provides transparent security services for Web Services. To verify the model, a Web Services security system is realized on, net platform. The implementation version of the model can provide various security services, and has advantages such as security, scalability, security controllability and end-to-end security in message level. Key words Web services - Web services security - message layer CLC number TP 393.08 Biography: WANG Cui-ru (1954-), female, Professor, research direction: database and information management system.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.32371280 and T2350011)。
文摘FL-Online(http://fanlab.ac.cn) is an out-of-box modern web service featuring a user-friendly interface and simplified parameters, providing academic users with access to a series of online programs for biomolecular crystallography, including SAPI-online, OASIS-online, C-IPCAS-online and a series of upcoming software releases. Meanwhile, it is a highly scalable and maintainable web application framework that provides a powerful and flexible solution for academic web development needs. All the codes are open-source under MIT licenses in GitHub.
基金The National Natural Science Foundation of China(No.60773217)Free Exploration Project(985 Project of Renmin University of China)(No.21361231)
文摘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 algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.
文摘In order to solve the problem that the current matchmaking methods for semantic web service mainly focus on the matchmaking of IO (inputs, outputs) descriptions which may result in one-sidedness, a description-logic-based IOPE (inputs, outputs, preconditions, effects) description and matchmaking method is proposed for semantic web service. The description logic concept is used to annotate service IO and the description logic assertion is employed to describe service PE(preconditions, effects). TBox subsumption checking is used to measure the subsumption relationship between IO descriptions of service request and advertising; ABox consistency checking is used for checking the logical implication between PE descriptions of service request and advertising. Based upon the logical implication, four kinds of PE matching degrees are proposed to measure and compare the pros and cons of the results of matchmaking. They are the exact, perfect, side-effect and common match. Experiments show that the method has a higher precision rate under the same recall rate compared with the existing method.
基金The National Natural Science Foundation of China(No.70471090,70472005),the Natural Science Foundation of Jiangsu Province(No.BK2004052,BK2005046).
文摘Services discovery based on syntactic matching cannot adapt to the open and dynamic environment of the web. To select the proper one from the web services candidate set provided by syntactic matching, a service selection method based on semantic similarity is proposed. First, this method defines a web services ontology including QoS and context as semantic supporting, which also provides a set of terms to describe the interfaces of web services. Secondly, the similarity degree of two web services is evaluated by computing the semantic distances of those terms used to describe interfaces. Compared with existing methods, interfaces of web services can be interpreted under ontology, because it provides a formal and semantic specification of conceptualization. Meanwhile, efficiency and accuracy of services selection are improved.
基金The National Natural Science Foundation of China(No.60403027,60773191,70771043)the National High Technology Research and Development Program of China(863 Program)(No.2007AA01Z403)
文摘In order to formally reason and verify web services composition described by web services choreography specification WS-CDL,a typed formal model named typed Abstract WS-CDL(web services choreography description language)for WS-CDL specifications is proposed.In typed Abstract WS-CDL,the syntax of type and session,typing rules and operational semantics are formalized;the collaborations of web services are formally described by sessions;the operational semantics of a session can help to formally reason the execution of the choreography;the typing rules can help to formally check the data type consistency of exchanged information between web services and capture run-time errors due to type mismatches.Particularly,the concepts of type assumption set extension and type assumption set compatibility are proposed,and the merging algorithm of type assumption sets is defined so as to eliminate type assumption conflict.Based on the formal model,typed mapping rules for mapping web services choreography to orchestration is also defined.With the typed mapping rules,orchestration stubs and their type assumption sets can be generated from a given choreography; thus, web services composition can be verified at choreography and orchestration levels,respectively.The model is proved to have properties of type safety,and how the model can help to reason and verify web services composition is illustrated through a case study.
文摘In order to increase the effectiveness and the reliability of web services flow, the ~r-calculus formal method is introduced as a development language for web services flow. The π-calculus overcomes inabilities of web service flow languages in demonstrating the consistency, validating the correctness and so on. The π- calculus analysis and modeling of web services flow is presented, the dynamic actions and basic activities of WS-BPEL with π-calculus formally are described, and the mapping from π-calculus expression to WS-BPEL is built. The basic construction of web services flow with the π-calculus method after the analysis of the syntax of WS-BPEL and inter-description between WS-BPEL and π-calculus is expressed. Also discussed are the approaches to web services flow by modeling from different views, and the proposed approaches through the development and modeling of an e-commerce web service flow application are illustrated.
文摘Parallel kinematics machine (PKM) is advantageous over the serial machine tools in processing the complex-surface products. A manufacturing service system for PKM is developed to provide the services of the complex-surface machining for potential geographically-dispersed manufacturing enterprises. In order to easily in- tegrate the external system, Web services are used to encapsulate post-processing functions of PKM legacy sys- tems, including compilation, workspace calculation, interfere calibration, and kinematics transformation. A ser- vice-oriented architecture(SOA) is proposed for the cooperative work between the PKM system and its client. The workflow and the function module of this manufacturing service system are presented. An example shows that as a result of SOA and loose coupling, such a Web service-based manufacturing service system is easier to in- tegrate and interoperate with its client. Meanwhile, the system decreases the manufacturing cost and improves the efficiency than its former kind of distributed system.
文摘To address the problem of web services selection based on quality, an approach of multi-attribute group decision making algorithm is proposed. Based on the Borda social choice function, the group decision making algorithm aggregates the results of multiple methods with different principles which are used to obtain constantly changing quality of service, thus increasing the confidence to select the most appropriate web service for a special task. The experimental results indicate that the proposed approach has better scalability and can be applied to large-scale distributed service computing environments. It is also shown that the proposed group decision making approach can effectively optimize the services selection and outperforms the random and robin policies. By using this approach, it can extend a method to obtain constantly changing quality of service and construct a synthetic information entity with multi-level knowledge, which guarantees the accuracy of services selection.
基金Supported by the National Key Technologies Re-search and Development Programming in the 10th Five-Year(2004BA721A05)
文摘In order to realize flexible, adaptable, extensible, efficient, and user-friendly service composition, we propose a service design oriented Web Service composite platform (SDOWSCP) and a service composition mechanism called composed-service-requestor-orient ed service composition (OBSDOSC). SDOWSCP imports ontology into UDDI to define and annotate services in a flexible and intuitive manner and employs a concept of bond as a solution to the process heterogeneity. OBSDOSC is proposed in order to do some efforts to overcome some defects which current design tools usually have such as not user friendly and too professional. This paper proposes a pattern which describes the basic features of semi-automatic composite mode, discusses the whole lifetime of composed service and highlights how to lessen the descriptive heterogeneity and process heterogeneity and how to facilitate the design of composing a service.
基金Supported by the National Key Basic Research andDevelopment Program (973 Program G20000263)
文摘This paper proposes a dynamic Web service trust (WS Trust) model, and somecorresponding trust metric evaluation algorithms. The main goal is to evaluate the trustworthinessand predict the future bchaxiors of entities in oeder to help users find trustworthy Web serviceproviders and prevent users from providing unfair ratings against service providers.
基金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.
基金Supported by the National Key Technologies Re-search and Development Programinthe 10th Five-Year Plan of China(2004BA721A05)
文摘For the problem of dynamic optimization in Web services composition, this paper presents a novel approach for selecting optimum Web services, which is based on the longest path method of weighted multistage graph. We propose and implement an Immune Algorithm for global optimization to construct composed Web services. Results of the experimentation illustrates that the algorithm in this paper has a powerful capability and can greatly improve the efficiency and veracity in service selection.