Bin Wu, Shuiguang Deng, Ying Li, Jian Wu, Jianwei Yin
With the number of available Web services is rapidly increasing, how to compose multiple Web services automatically to fulfill a given request has attracted much attention. This paper proposes a dedicated planner named AWSP (Automatic Web Service Planner) toward this problem. Compared with other AI planners for automatic Web service composition, AWSP is characterized by its two different heuristic functions to reduce the search space greatly. A series of experiments based on test sets generated by WSBen show that 1) AWSP performs well even when the scale of the test set expands significantly. 2) AWSP has a smaller search space and performs better when using the backward search strategy than using the forward search strategy, 3) AWSP with the A* heuristic function can get the solution with the shortest invocation path.
随着可用Web服务的数量迅速增加，如何自动组合多个Web服务来完成给定的请求引起了人们的广泛关注。针对这一问题，本文提出了一种专用的规划器AWSP (Automatic Web Service planner)。与其他用于Web服务自动组合的AI规划器相比，AWSP具有两种不同的启发式功能，大大减少了搜索空间。基于WSBen生成的测试集的一系列实验表明:1)当测试集的规模显著扩大时，AWSP仍然具有良好的性能。2) AWSP的搜索空间更小，使用后向搜索策略比使用前向搜索策略性能更好;3)采用a *启发式函数的AWSP可以得到调用路径最短的解。
{"title":"AWSP: An Automatic Web Service Planner Based on Heuristic State Space Search","authors":"Bin Wu, Shuiguang Deng, Ying Li, Jian Wu, Jianwei Yin","doi":"10.1109/ICWS.2011.20","DOIUrl":"https://doi.org/10.1109/ICWS.2011.20","url":null,"abstract":"With the number of available Web services is rapidly increasing, how to compose multiple Web services automatically to fulfill a given request has attracted much attention. This paper proposes a dedicated planner named AWSP (Automatic Web Service Planner) toward this problem. Compared with other AI planners for automatic Web service composition, AWSP is characterized by its two different heuristic functions to reduce the search space greatly. A series of experiments based on test sets generated by WSBen show that 1) AWSP performs well even when the scale of the test set expands significantly. 2) AWSP has a smaller search space and performs better when using the backward search strategy than using the forward search strategy, 3) AWSP with the A* heuristic function can get the solution with the shortest invocation path.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"68 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":"123795807","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}
Today, there is a huge amount of security services that can be used to implement different security requirements in Web Service based systems. For example, identity management services are required for authentication and authorization whereas message logging services are necessary to achieve non-repudiation. However, the deployment and configuration of these security services usually requires expert knowledge about the systems and expert knowledge about security requirements and implementations which a person can only learn by experience. Furthermore, today's Web Service based systems become increasingly complex. Thus, implementing security requirements is a complex and error prone task, even for experts. For this paper, we analysed several service-based implementations for identity management and their differences in the service orchestration. We present an approach to derive the needed security services, their configuration, and their connections to the functional services, based on defined security requirements for a Web Service based system. Therefore, we evaluate the UML use case model of the system and apply service security pattern derived during the analysis of the identity management implementations.
{"title":"Automated Security Service Orchestration for the Identity Management in Web Service Based Systems","authors":"Robert Warschofsky, Michael Menzel, C. Meinel","doi":"10.1109/ICWS.2011.41","DOIUrl":"https://doi.org/10.1109/ICWS.2011.41","url":null,"abstract":"Today, there is a huge amount of security services that can be used to implement different security requirements in Web Service based systems. For example, identity management services are required for authentication and authorization whereas message logging services are necessary to achieve non-repudiation. However, the deployment and configuration of these security services usually requires expert knowledge about the systems and expert knowledge about security requirements and implementations which a person can only learn by experience. Furthermore, today's Web Service based systems become increasingly complex. Thus, implementing security requirements is a complex and error prone task, even for experts. For this paper, we analysed several service-based implementations for identity management and their differences in the service orchestration. We present an approach to derive the needed security services, their configuration, and their connections to the functional services, based on defined security requirements for a Web Service based system. Therefore, we evaluate the UML use case model of the system and apply service security pattern derived during the analysis of the identity management implementations.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"15 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":"121869999","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}
This paper proposes a novel trust evaluation method for service choreography. Compared with current work towards this problem, it considers not only the trust for individual partner services and the explicit trust relation among partner services that have logical dependencies for each other, but also the implicit trust relation implied in data-dependencies among services. A serial of experiments, using the simulation tool Net Logo, are carried out to compare the evaluation results between the proposed method and the method without data-dependency consideration. The result shows that taking consideration of the data-dependency trust improves the accuracy of trust evaluation to a great extent.
{"title":"Data-Dependency Aware Trust Evaluation for Service Choreography","authors":"Longtao Huang, Shuiguang Deng, Ying Li, Jian Wu, Jianwei Yin","doi":"10.1109/ICWS.2011.57","DOIUrl":"https://doi.org/10.1109/ICWS.2011.57","url":null,"abstract":"This paper proposes a novel trust evaluation method for service choreography. Compared with current work towards this problem, it considers not only the trust for individual partner services and the explicit trust relation among partner services that have logical dependencies for each other, but also the implicit trust relation implied in data-dependencies among services. A serial of experiments, using the simulation tool Net Logo, are carried out to compare the evaluation results between the proposed method and the method without data-dependency consideration. The result shows that taking consideration of the data-dependency trust improves the accuracy of trust evaluation to a great extent.","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":"129568464","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}
In Service-Oriented Computing (SOC) environments, the trustworthiness of each service provider is critical for a service client when selecting one from a large pool of service providers. The trust value of a service provider is usually in the range of [0, 1] and is evaluated from the ratings given by service clients, which represent the subjective belief of service clients on the satisfaction of delivered services. So a trust value can be taken as a subjective probability, by which one party believes that another party can perform an action in a certain situation. Hence, subjective probability theory should be adopted in trust evaluation. In addition, in SOC environments, a service provider usually can invoke the services from other service providers forming a composite service. Thus, the global trust of a composite service should be evaluated based on both the subjective probability property of trust and complex invocation structures. In this paper, we first interpret the trust dependency caused by direct service invocations as conditional probability. Then, on the basis of trust dependency, we propose a Subjective probability based deductive (SELECTIVE) approach to evaluate the subjective global trustworthiness of a composite service. All these processes follow subjective probability theory and keep the subjective probability property of trust in evaluations. Our experimental results demonstrate that when compared with existing approaches our proposed SELECTIVE approach can yield more reasonable results.
{"title":"A Subjective Probability Based Deductive Approach to Global Trust Evaluation in Composite Services","authors":"Lei Li, Yan Wang","doi":"10.1109/ICWS.2011.28","DOIUrl":"https://doi.org/10.1109/ICWS.2011.28","url":null,"abstract":"In Service-Oriented Computing (SOC) environments, the trustworthiness of each service provider is critical for a service client when selecting one from a large pool of service providers. The trust value of a service provider is usually in the range of [0, 1] and is evaluated from the ratings given by service clients, which represent the subjective belief of service clients on the satisfaction of delivered services. So a trust value can be taken as a subjective probability, by which one party believes that another party can perform an action in a certain situation. Hence, subjective probability theory should be adopted in trust evaluation. In addition, in SOC environments, a service provider usually can invoke the services from other service providers forming a composite service. Thus, the global trust of a composite service should be evaluated based on both the subjective probability property of trust and complex invocation structures. In this paper, we first interpret the trust dependency caused by direct service invocations as conditional probability. Then, on the basis of trust dependency, we propose a Subjective probability based deductive (SELECTIVE) approach to evaluate the subjective global trustworthiness of a composite service. All these processes follow subjective probability theory and keep the subjective probability property of trust in evaluations. Our experimental results demonstrate that when compared with existing approaches our proposed SELECTIVE approach can yield more reasonable results.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"15 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":"129918552","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}
Xuanzhe Liu, Qi Zhao, Gang Huang, Hong Mei, Teng Teng
Spurred by Web 2.0 paradigm, there emerge large numbers of service mashups by composing readily accessible data and services. Mashups usually address solving situational problems and require quick and iterative development lifecyle. In this paper, we propose an approach to composing data driven mashups, based on tag-based semantics. The core principle is deriving semantic annotations from popular tags, and associating them with programmatic inputs and outputs data. Tag-based semantics promise a quick and simple comprehension of data capabilities. Mashup developers including end-users can intuitively search desired services with tags, and combine several services by means of data flows. Our approach takes a planning technique to retrieving the potentially relevant composition opportunities. With our graphical composition user interfaces, developers can iteratively modify, adjust and refine their mashups to be more satisfying.
{"title":"Composing Data-Driven Service Mashups with Tag-Based Semantic Annotations","authors":"Xuanzhe Liu, Qi Zhao, Gang Huang, Hong Mei, Teng Teng","doi":"10.1109/ICWS.2011.31","DOIUrl":"https://doi.org/10.1109/ICWS.2011.31","url":null,"abstract":"Spurred by Web 2.0 paradigm, there emerge large numbers of service mashups by composing readily accessible data and services. Mashups usually address solving situational problems and require quick and iterative development lifecyle. In this paper, we propose an approach to composing data driven mashups, based on tag-based semantics. The core principle is deriving semantic annotations from popular tags, and associating them with programmatic inputs and outputs data. Tag-based semantics promise a quick and simple comprehension of data capabilities. Mashup developers including end-users can intuitively search desired services with tags, and combine several services by means of data flows. Our approach takes a planning technique to retrieving the potentially relevant composition opportunities. With our graphical composition user interfaces, developers can iteratively modify, adjust and refine their mashups to be more satisfying.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"4 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":"130500865","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}
Rodrigo Amorim, Daniela Barreiro Claro, D. Lopes, Patrick Albers, A. Andrade
Service oriented Architecture (SOA) has been widely used in service computing applications and this fact has been encouraged the publication over the Web in a Web Service format. Whereas the number of Web services published on the Web is growing up, discovery techniques must be improved so as to retrieve more desirable services. Nowadays, the most commonly used technique is semantic filters based on ontological concepts. However, such mechanisms can leave out some important Web services of the matching process, because of their structural relationship not mentioned in an ontology. In order to overcome such problems, some authors have proposed a hybrid approach to combine traditional syntactic and semantic approaches. These proposals remain restricted especially with respect to complexity, precision and time of execution, thus making such solutions in most of cases unfeasible. In this paper, we combine semantic filters based on functional properties with a structural approach, analyzing each neighbor relationship in an ontology. The results showed a considerable improvement in terms of performance and a complexity reduction with respect to other existing techniques. Furthermore, we implement a tool called OWLS-S Discovery in order to simplify the use of our approach by developers.
{"title":"Improving Web Service Discovery by a Functional and Structural Approach","authors":"Rodrigo Amorim, Daniela Barreiro Claro, D. Lopes, Patrick Albers, A. Andrade","doi":"10.1109/ICWS.2011.14","DOIUrl":"https://doi.org/10.1109/ICWS.2011.14","url":null,"abstract":"Service oriented Architecture (SOA) has been widely used in service computing applications and this fact has been encouraged the publication over the Web in a Web Service format. Whereas the number of Web services published on the Web is growing up, discovery techniques must be improved so as to retrieve more desirable services. Nowadays, the most commonly used technique is semantic filters based on ontological concepts. However, such mechanisms can leave out some important Web services of the matching process, because of their structural relationship not mentioned in an ontology. In order to overcome such problems, some authors have proposed a hybrid approach to combine traditional syntactic and semantic approaches. These proposals remain restricted especially with respect to complexity, precision and time of execution, thus making such solutions in most of cases unfeasible. In this paper, we combine semantic filters based on functional properties with a structural approach, analyzing each neighbor relationship in an ontology. The results showed a considerable improvement in terms of performance and a complexity reduction with respect to other existing techniques. Furthermore, we implement a tool called OWLS-S Discovery in order to simplify the use of our approach by developers.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"43 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":"127836779","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}
We propose an integrated framework that extracts semantics from WSDL descriptions and constructs operation-level ontologies for Web services. The semantics mainly focus on the functional features of Web services, which facilitates the efficient usage of Web services, such as service discovery and service composition. We use service operations as the first class objects to define service functionalities. We first create service ontologies by measuring the relevance between service operations and clustering operations into functionally relevant groups. We then construct the structure of the service ontologies through a hierarchical clustering algorithm.
{"title":"Constructing Operation-Level Ontologies for Web Services","authors":"Xumin Liu, Hua Liu","doi":"10.1109/ICWS.2011.107","DOIUrl":"https://doi.org/10.1109/ICWS.2011.107","url":null,"abstract":"We propose an integrated framework that extracts semantics from WSDL descriptions and constructs operation-level ontologies for Web services. The semantics mainly focus on the functional features of Web services, which facilitates the efficient usage of Web services, such as service discovery and service composition. We use service operations as the first class objects to define service functionalities. We first create service ontologies by measuring the relevance between service operations and clustering operations into functionally relevant groups. We then construct the structure of the service ontologies through a hierarchical clustering algorithm.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"13 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":"121775416","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}
Time is an important parameter in modeling and analyzing Web services. A Web service can be presented by its behavior which can be described by a business protocol representing the possible sequences of message exchanges. Automated analyses of timed Web services such as compatibility checking are very difficult and in some cases are not possible with the presence of implicit transitions (internal transitions) based on time constraints. The semantics of the implicit transitions is the source of this difficulty because most of well known modeling tools do not express this semantics (e.g., epsilon transition on the timed automata has a different semantics). This paper presents an approach for removing complex implicit transitions of the timed business protocols before performing the interoperability analysis without changing the semantics of the protocols.
{"title":"Timed Web Services Analysis after Removing Complex Implicit Transitions","authors":"Emad Elabd, E. Coquery, Mohand-Said Hacid","doi":"10.1109/ICWS.2011.79","DOIUrl":"https://doi.org/10.1109/ICWS.2011.79","url":null,"abstract":"Time is an important parameter in modeling and analyzing Web services. A Web service can be presented by its behavior which can be described by a business protocol representing the possible sequences of message exchanges. Automated analyses of timed Web services such as compatibility checking are very difficult and in some cases are not possible with the presence of implicit transitions (internal transitions) based on time constraints. The semantics of the implicit transitions is the source of this difficulty because most of well known modeling tools do not express this semantics (e.g., epsilon transition on the timed automata has a different semantics). This paper presents an approach for removing complex implicit transitions of the timed business protocols before performing the interoperability analysis without changing the semantics of the protocols.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"17 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":"130196481","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}
Web service composition can make use of distributed services with various functions to accomplish a specific task. Service binding and composition become keywords to service computing. In the context of workflow management, service binding plays an important part in forming a concrete workflow after an abstract one is submitted. Existing research is devoted to selecting a set of servers to run the corresponding services in an application and achieving better QoS. Due to the data intensity of data flow, the communication between two server nodes may bring significant delay that can not be neglected when considering the performance of the whole application process. In this work, we consider not only the QoS on each server but also the transfer delay of data that affects the total latency. Algorithms are designed to determine a set of service candidates for web service workflow with different structural characteristics. We measure and utilize indispensable parameters to implement these algorithms. Further, we propose Lagrange and ARP algorithms to make comprehensive decisions when taking into account other QoS metrics besides latency.
{"title":"QoS-Aware Service Composition for Work?ow-Based Data-Intensive Applications","authors":"Yin Li, Chuang Lin","doi":"10.1109/ICWS.2011.18","DOIUrl":"https://doi.org/10.1109/ICWS.2011.18","url":null,"abstract":"Web service composition can make use of distributed services with various functions to accomplish a specific task. Service binding and composition become keywords to service computing. In the context of workflow management, service binding plays an important part in forming a concrete workflow after an abstract one is submitted. Existing research is devoted to selecting a set of servers to run the corresponding services in an application and achieving better QoS. Due to the data intensity of data flow, the communication between two server nodes may bring significant delay that can not be neglected when considering the performance of the whole application process. In this work, we consider not only the QoS on each server but also the transfer delay of data that affects the total latency. Algorithms are designed to determine a set of service candidates for web service workflow with different structural characteristics. We measure and utilize indispensable parameters to implement these algorithms. Further, we propose Lagrange and ARP algorithms to make comprehensive decisions when taking into account other QoS metrics besides latency.","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":"134512462","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 more and more Web services available on the Internet, many approaches have been proposed to help users discover and select desired services. However, existing approaches heavily rely on the information in UDDI repositories or WSDL files, which is quite limited in fact. The limitation of information weakens the effectiveness of existing approaches. In this paper, we present a novel Web services search engine named CoWS, which enriches Web services information using the information captured from the Internet to provide quality-aware Web services search. The information captured can be classified into two groups: functional descriptions and subjective feedbacks. We use the functional descriptions to enrich descriptions of Web services and the subjective feedbacks to calculate Web services' reputation. CoWS first ranks the services according to their functional similarities to a user's query, which are calculated using both descriptions in WSDL files and the enriched descriptions, and then refines and re-ranks the services with both objective quality constraints (QoS) and subjective quality constraints (reputation). The experiments on a large-scale dataset (including 31,129 Web services) show that CoWS can improve the effectiveness of both Web services discovery and selection comparing with existing approaches.
{"title":"CoWS: An Internet-Enriched and Quality-Aware Web Services Search Engine","authors":"Meng Li, Junfeng Zhao, Lijie Wang, Sibo Cai, Bing Xie","doi":"10.1109/ICWS.2011.49","DOIUrl":"https://doi.org/10.1109/ICWS.2011.49","url":null,"abstract":"With more and more Web services available on the Internet, many approaches have been proposed to help users discover and select desired services. However, existing approaches heavily rely on the information in UDDI repositories or WSDL files, which is quite limited in fact. The limitation of information weakens the effectiveness of existing approaches. In this paper, we present a novel Web services search engine named CoWS, which enriches Web services information using the information captured from the Internet to provide quality-aware Web services search. The information captured can be classified into two groups: functional descriptions and subjective feedbacks. We use the functional descriptions to enrich descriptions of Web services and the subjective feedbacks to calculate Web services' reputation. CoWS first ranks the services according to their functional similarities to a user's query, which are calculated using both descriptions in WSDL files and the enriched descriptions, and then refines and re-ranks the services with both objective quality constraints (QoS) and subjective quality constraints (reputation). The experiments on a large-scale dataset (including 31,129 Web services) show that CoWS can improve the effectiveness of both Web services discovery and selection comparing with existing approaches.","PeriodicalId":118512,"journal":{"name":"2011 IEEE International Conference on Web Services","volume":"12 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":"131466198","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
扫码关注我们
求助内容：
应助结果提醒方式：