J. Damasceno, F. Lins, Robson W. A. Medeiros, Bruno Silva, Andre R. R. Souza, David Aragão, P. Maciel, N. Rosa, Bryan Stephenson, Jun Yu Li
The design, deployment and execution of business process models and their associated security models is expensive and time consuming. This is because these activities usually involve multiple stakeholders that include business domain experts, security experts, web service developers and IT operations teams, and there is no streamlined development environment to allow these stakeholders to work collaboratively on a business process. We have developed a cloud-based model-driven development and execution environment called SSC4Cloud to provide a shared business process modeling workspace and a business process execution environment. More specifically, with the shared modeling workspace, business process models can be developed, refined and shared. Within the shared execution environment, a business process model is translated into a WS-BPEL based executable model, which is then assigned for execution in a virtual machine container from a shared machine cluster. The common model execution environment supports both business process execution and enforcement of the security requirements attached to the business process models.
{"title":"Modeling and Executing Business Processes with Annotated Security Requirements in the Cloud","authors":"J. Damasceno, F. Lins, Robson W. A. Medeiros, Bruno Silva, Andre R. R. Souza, David Aragão, P. Maciel, N. Rosa, Bryan Stephenson, Jun Yu Li","doi":"10.1109/ICWS.2011.78","DOIUrl":"https://doi.org/10.1109/ICWS.2011.78","url":null,"abstract":"The design, deployment and execution of business process models and their associated security models is expensive and time consuming. This is because these activities usually involve multiple stakeholders that include business domain experts, security experts, web service developers and IT operations teams, and there is no streamlined development environment to allow these stakeholders to work collaboratively on a business process. We have developed a cloud-based model-driven development and execution environment called SSC4Cloud to provide a shared business process modeling workspace and a business process execution environment. More specifically, with the shared modeling workspace, business process models can be developed, refined and shared. Within the shared execution environment, a business process model is translated into a WS-BPEL based executable model, which is then assigned for execution in a virtual machine container from a shared machine cluster. The common model execution environment supports both business process execution and enforcement of the security requirements attached to the business process models.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115048733","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Service retrieval holds a central role during the development of Web services and Service-Based Applications (SBAs). The higher the number of available services, the more complex it becomes to locate the service closer to the developer needs. The complexity increases further with the number of available service versions that could also be suitable for this purpose. Existing approaches on service retrieval use a similarity measure between service interfaces to identify potentially relevant services. In this work we focus on introducing information about the compatibility of services while calculating their similarity as the means for providing more suitable results. For this purpose we update and extend an existing Web services matchmaker called UDDI Registry by Example (URBE).
{"title":"Retrieving Compatible Web Services","authors":"V. Andrikopoulos, P. Plebani","doi":"10.1109/ICWS.2011.24","DOIUrl":"https://doi.org/10.1109/ICWS.2011.24","url":null,"abstract":"Service retrieval holds a central role during the development of Web services and Service-Based Applications (SBAs). The higher the number of available services, the more complex it becomes to locate the service closer to the developer needs. The complexity increases further with the number of available service versions that could also be suitable for this purpose. Existing approaches on service retrieval use a similarity measure between service interfaces to identify potentially relevant services. In this work we focus on introducing information about the compatibility of services while calculating their similarity as the means for providing more suitable results. For this purpose we update and extend an existing Web services matchmaker called UDDI Registry by Example (URBE).","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132229346","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Identity delegation is an act whereby an entity delegates his or her authority to use identity information to another entity. It has most often been implemented in enterprise environments, but previous studies have focused little on the dynamic data and access management model as well as the design from a practical viewpoint. An identity delegation framework is described for using access tokens across security domains. The framework enables fine-grained access control with limited overhead cost for access management and permission assignment for delegated access.
{"title":"Dynamic Identity Delegation Using Access Tokens in Federated Environments","authors":"Hidehito Gomi","doi":"10.1109/ICWS.2011.30","DOIUrl":"https://doi.org/10.1109/ICWS.2011.30","url":null,"abstract":"Identity delegation is an act whereby an entity delegates his or her authority to use identity information to another entity. It has most often been implemented in enterprise environments, but previous studies have focused little on the dynamic data and access management model as well as the design from a practical viewpoint. An identity delegation framework is described for using access tokens across security domains. The framework enables fine-grained access control with limited overhead cost for access management and permission assignment for delegated access.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128735317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Marios Fokaefs, Rimon Mikhaiel, Nikolaos Tsantalis, Eleni Stroulia, Alex Lau
The service-oriented architecture paradigm prescribes the development of systems through the composition of services, i.e., network-accessible components, specified by (and invoked through) their WSDL interface descriptions. Systems thus developed need to be aware of changes in, and evolve with, their constituent services. Therefore, accurate recognition of changes in the WSDL specification of a service is an essential functionality in the context of the software lifecycle of service-oriented systems. In this work, we present the results of an empirical study on WSDL evolution analysis. In the first part, we empirically study whether VTracker, our algorithm for XML differencing, can precisely recognize changes in WSDL documents by applying it to the task of comparing 18 versions of the Amazon EC2 web service. Second, we analyze the changes that occurred between the subsequent versions of various web-services and discuss their potential effects on the maintainability of service systems relying on them.
{"title":"An Empirical Study on Web Service Evolution","authors":"Marios Fokaefs, Rimon Mikhaiel, Nikolaos Tsantalis, Eleni Stroulia, Alex Lau","doi":"10.1109/ICWS.2011.114","DOIUrl":"https://doi.org/10.1109/ICWS.2011.114","url":null,"abstract":"The service-oriented architecture paradigm prescribes the development of systems through the composition of services, i.e., network-accessible components, specified by (and invoked through) their WSDL interface descriptions. Systems thus developed need to be aware of changes in, and evolve with, their constituent services. Therefore, accurate recognition of changes in the WSDL specification of a service is an essential functionality in the context of the software lifecycle of service-oriented systems. In this work, we present the results of an empirical study on WSDL evolution analysis. In the first part, we empirically study whether VTracker, our algorithm for XML differencing, can precisely recognize changes in WSDL documents by applying it to the task of comparing 18 versions of the Amazon EC2 web service. Second, we analyze the changes that occurred between the subsequent versions of various web-services and discuss their potential effects on the maintainability of service systems relying on them.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132906608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Automation of web service composition is one of the most interesting challenges facing the semantic web today. Despite approaches which are able to infer partial order on services, data flow (i.e., the way data is exchanged among services) remains implicit and difficult to be inferred and automatically generated. Since web services have been enhanced with formal semantic descriptions, it becomes conceivable to exploit and reason on their semantic links (i.e., semantic matching between their functional output and input parameters) to infer data flow. Our approach has been directed to meet the main challenges facing the latter problem i.e., how to effectively i) guarantee whether a data flow is well-formed and ii) infer data flow between services based on their Description Logics (DL) descriptions. To this end, we apply constructive DL reasoning abduction, contraction and introduce the non standard DL reasoning join to model and infer data flow in compositions. The preliminary evaluation results showed high efficiency and effectiveness of the proposed approach.
{"title":"Inferring Data Flow in Semantic Web Service Composition","authors":"F. Lécué","doi":"10.1109/ICWS.2011.13","DOIUrl":"https://doi.org/10.1109/ICWS.2011.13","url":null,"abstract":"Automation of web service composition is one of the most interesting challenges facing the semantic web today. Despite approaches which are able to infer partial order on services, data flow (i.e., the way data is exchanged among services) remains implicit and difficult to be inferred and automatically generated. Since web services have been enhanced with formal semantic descriptions, it becomes conceivable to exploit and reason on their semantic links (i.e., semantic matching between their functional output and input parameters) to infer data flow. Our approach has been directed to meet the main challenges facing the latter problem i.e., how to effectively i) guarantee whether a data flow is well-formed and ii) infer data flow between services based on their Description Logics (DL) descriptions. To this end, we apply constructive DL reasoning abduction, contraction and introduce the non standard DL reasoning join to model and infer data flow in compositions. The preliminary evaluation results showed high efficiency and effectiveness of the proposed approach.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125914713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
With the convenient connection to network, more and more individual information including sensitive information, such as contact list in Mobile Phone or PDA, can be delegated to the professional third service provider to manage and maintain. The benefit of this paradigm is, on one hand to avoid the sensitive information leakage when individual devices failed or lost, on the other hand to make only the authorized users access and share the delegated information online anytime and anywhere. However, in this paradigm the critical problems to be resolved are to guarantee both the privacy of delegated individual information and the privacy of authorized users, and what is more important to afford the owners of communication devices to have high level of control and power to create their own particular access control policies. In this paper, we present an approach to implement the personalized access control at third service provider in a privacy preserving way. Our approach implements the critical problems above in this paradigm by using selective encryption, blind signature and the combination of role based access control and discretionary access control.
{"title":"Privacy Preserving Personalized Access Control Service at Third Service Provider","authors":"Xiuxia Tian, Chaofeng Sha, Xiaoling Wang, Aoying Zhou","doi":"10.1109/ICWS.2011.46","DOIUrl":"https://doi.org/10.1109/ICWS.2011.46","url":null,"abstract":"With the convenient connection to network, more and more individual information including sensitive information, such as contact list in Mobile Phone or PDA, can be delegated to the professional third service provider to manage and maintain. The benefit of this paradigm is, on one hand to avoid the sensitive information leakage when individual devices failed or lost, on the other hand to make only the authorized users access and share the delegated information online anytime and anywhere. However, in this paradigm the critical problems to be resolved are to guarantee both the privacy of delegated individual information and the privacy of authorized users, and what is more important to afford the owners of communication devices to have high level of control and power to create their own particular access control policies. In this paper, we present an approach to implement the personalized access control at third service provider in a privacy preserving way. Our approach implements the critical problems above in this paradigm by using selective encryption, blind signature and the combination of role based access control and discretionary access control.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121813112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Due to the increase in Web services, many recent studies have been addressing the service selection problem based on non-functional or quality aspects. Our study incorporates combinational use of functionally-equivalent services into the problem to compose an application of higher quality or with additional value. However, when such combinational use is introduced, computational cost for the service selection becomes much higher. In this work, we propose a set of methods that reduce the additional cost for the QoS (Quality of Service)-based service selection considering combinational use. This approach achieves low cost by considering only effective combinations. The experimental results show that it can reduce computational cost regardless of the number of services and whatever their QoS values are while keeping the effectiveness of combinational use.
{"title":"Service Selection with Combinational Use of Functionally-Equivalent Services","authors":"Nobuaki Hiratsuka, F. Ishikawa, S. Honiden","doi":"10.1109/ICWS.2011.33","DOIUrl":"https://doi.org/10.1109/ICWS.2011.33","url":null,"abstract":"Due to the increase in Web services, many recent studies have been addressing the service selection problem based on non-functional or quality aspects. Our study incorporates combinational use of functionally-equivalent services into the problem to compose an application of higher quality or with additional value. However, when such combinational use is introduced, computational cost for the service selection becomes much higher. In this work, we propose a set of methods that reduce the additional cost for the QoS (Quality of Service)-based service selection considering combinational use. This approach achieves low cost by considering only effective combinations. The experimental results show that it can reduce computational cost regardless of the number of services and whatever their QoS values are while keeping the effectiveness of combinational use.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127738311","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As REST architectural style gains popularity in the web service community, there is a growing concern and debate on how to design Restful web services (REST API) in a proper way. We attribute this problem to lack of a standard model and language to describe a REST API that respects all the REST constraints. As a result, many web services that claim to be REST API are not hypermedia driven as prescribed by REST. This situation may lead to REST APIs that are not as scalable, extensible, and interoperable as promised by REST. To address this issue, this paper proposes REST Chart as a model and language to design and describe REST API without violating the REST constraints. REST Chart models a REST API as a special type of Colored Petri Net whose topology defines the REST API and whose token markings define the representational state space of user agents using that API. We demonstrate REST Chart with an example REST API. We also show how REST Chart can support efficient content negotiation and reuse hybrid representations to broaden design choices. Furthermore, we argue that the REST constraints, such as hypermedia driven and statelessness, can either be enforced naturally or checked automatically in REST Chart.
{"title":"Design and Describe REST API without Violating REST: A Petri Net Based Approach","authors":"Li Li, W. Chou","doi":"10.1109/ICWS.2011.54","DOIUrl":"https://doi.org/10.1109/ICWS.2011.54","url":null,"abstract":"As REST architectural style gains popularity in the web service community, there is a growing concern and debate on how to design Restful web services (REST API) in a proper way. We attribute this problem to lack of a standard model and language to describe a REST API that respects all the REST constraints. As a result, many web services that claim to be REST API are not hypermedia driven as prescribed by REST. This situation may lead to REST APIs that are not as scalable, extensible, and interoperable as promised by REST. To address this issue, this paper proposes REST Chart as a model and language to design and describe REST API without violating the REST constraints. REST Chart models a REST API as a special type of Colored Petri Net whose topology defines the REST API and whose token markings define the representational state space of user agents using that API. We demonstrate REST Chart with an example REST API. We also show how REST Chart can support efficient content negotiation and reuse hybrid representations to broaden design choices. Furthermore, we argue that the REST constraints, such as hypermedia driven and statelessness, can either be enforced naturally or checked automatically in REST Chart.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121137612","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hua Xiao, Bipin Upadhyaya, Foutse Khomh, Ying Zou, J. Ng, Alex Lau
Process knowledge, such as tasks involved in a process and the control flow and data flow among tasks, is critical for designing business processes. Such process knowledge enables service composition which integrates different services to implement business processes. In the current state of practice, business processes are primarily designed by experienced business analysts who have extensive process knowledge. It is challenging for novice business analysts and non-professional end-users to identify a complete set of services to orchestrate a well-defined business process due to the lack of process knowledge. In this paper, we propose an approach to extract process knowledge from existing commercial applications on the Web. Our approach uses a Web search engine to find websites containing process knowledge on the Internet. By analyzing the content and the structure of relevant websites, we extract the process knowledge from various websites and merge the process knowledge to generate an integrated ontology with rich process knowledge. We conduct a case study to compare our approach with a tool that extracts ontologies from textual sources. The result of the case study shows that our approach can extract process knowledge from online applications with higher precision and recall comparing to the ontology learning tool.
{"title":"An Automatic Approach for Extracting Process Knowledge from the Web","authors":"Hua Xiao, Bipin Upadhyaya, Foutse Khomh, Ying Zou, J. Ng, Alex Lau","doi":"10.1109/ICWS.2011.85","DOIUrl":"https://doi.org/10.1109/ICWS.2011.85","url":null,"abstract":"Process knowledge, such as tasks involved in a process and the control flow and data flow among tasks, is critical for designing business processes. Such process knowledge enables service composition which integrates different services to implement business processes. In the current state of practice, business processes are primarily designed by experienced business analysts who have extensive process knowledge. It is challenging for novice business analysts and non-professional end-users to identify a complete set of services to orchestrate a well-defined business process due to the lack of process knowledge. In this paper, we propose an approach to extract process knowledge from existing commercial applications on the Web. Our approach uses a Web search engine to find websites containing process knowledge on the Internet. By analyzing the content and the structure of relevant websites, we extract the process knowledge from various websites and merge the process knowledge to generate an integrated ontology with rich process knowledge. We conduct a case study to compare our approach with a tool that extracts ontologies from textual sources. The result of the case study shows that our approach can extract process knowledge from online applications with higher precision and recall comparing to the ontology learning tool.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115268196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zachary J. Oster, Ganesh Ram Santhanam, Samik Basu
For a Web service composition to satisfy a user's needs, it must not only provide the desired functionality, but also have nonfunctional properties (e.g., reliability, availability, cost) that are acceptable to the user. In the recent past, several techniques have been developed and deployed to identify a composite service that conforms to the functional requirements and is also optimal with respect to the user-defined preferences over non-functional properties. However, these composition techniques are limited to using one formalism for specifying the required functionality, in short, the existing techniques cannot identify optimal (w.r.t. non-functional properties) composite services that are required to satisfy functional requirements described in multiple formalisms. We have previously proposed a meta-framework for service composition that involves decomposing the required functionality into a boolean combination of atomic requirements, which are expressed using different formalisms. This meta-framework supports the use of multiple formalisms and their corresponding composition algorithms within a single scenario. In this paper, we integrate support for unconditional preferences over nonfunctional requirements into this composition meta-framework. We show that for a large class of problems, local selection of preferred service(s) can yield the most preferred composite service that satisfies the desired functional requirements.
{"title":"Identifying Optimal Composite Services by Decomposing the Service Composition Problem","authors":"Zachary J. Oster, Ganesh Ram Santhanam, Samik Basu","doi":"10.1109/ICWS.2011.110","DOIUrl":"https://doi.org/10.1109/ICWS.2011.110","url":null,"abstract":"For a Web service composition to satisfy a user's needs, it must not only provide the desired functionality, but also have nonfunctional properties (e.g., reliability, availability, cost) that are acceptable to the user. In the recent past, several techniques have been developed and deployed to identify a composite service that conforms to the functional requirements and is also optimal with respect to the user-defined preferences over non-functional properties. However, these composition techniques are limited to using one formalism for specifying the required functionality, in short, the existing techniques cannot identify optimal (w.r.t. non-functional properties) composite services that are required to satisfy functional requirements described in multiple formalisms. We have previously proposed a meta-framework for service composition that involves decomposing the required functionality into a boolean combination of atomic requirements, which are expressed using different formalisms. This meta-framework supports the use of multiple formalisms and their corresponding composition algorithms within a single scenario. In this paper, we integrate support for unconditional preferences over nonfunctional requirements into this composition meta-framework. We show that for a large class of problems, local selection of preferred service(s) can yield the most preferred composite service that satisfies the desired functional requirements.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131444509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：