You Ma, Shangguang Wang, Qibo Sun, Hua Zou, Fangchun Yang
The previous Quality of Service (QoS) measure method for Web services are not accurate as they often focused on the ambiguity of user preferences but neglected its one-sidedness (i.e., user preferences cannot realize the data distribution characteristics of services set). This paper first points out that user preferences are not only ambiguous but also one-sided. QoS measure should be a co-action of both user preferences and services set, and therefore neglecting the data distribution characteristics of services set have weakened the accuracy of measure results. We present in this paper a novel QoS measure algorithm for Web services employing the subjective and objective weight. The subjective weight is used to quantify ambiguous user preferences and the objective weight is used to correct the one-sidedness of user preference. The two used weights guarantee the measure results can both conform to user preference and reflect the overall performance precisely. The validation of theoretical analysis and experiments based on the QWS real data sets confirmed the efficiency of proposed algorithm.
{"title":"Web Services QoS Measure Based on Subjective and Objective Weight","authors":"You Ma, Shangguang Wang, Qibo Sun, Hua Zou, Fangchun Yang","doi":"10.1109/SCC.2013.10","DOIUrl":"https://doi.org/10.1109/SCC.2013.10","url":null,"abstract":"The previous Quality of Service (QoS) measure method for Web services are not accurate as they often focused on the ambiguity of user preferences but neglected its one-sidedness (i.e., user preferences cannot realize the data distribution characteristics of services set). This paper first points out that user preferences are not only ambiguous but also one-sided. QoS measure should be a co-action of both user preferences and services set, and therefore neglecting the data distribution characteristics of services set have weakened the accuracy of measure results. We present in this paper a novel QoS measure algorithm for Web services employing the subjective and objective weight. The subjective weight is used to quantify ambiguous user preferences and the objective weight is used to correct the one-sidedness of user preference. The two used weights guarantee the measure results can both conform to user preference and reflect the overall performance precisely. The validation of theoretical analysis and experiments based on the QWS real data sets confirmed the efficiency of proposed algorithm.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125490768","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}
New value-added business, generated by Web service composition in BPEL, provides more powerful and flexible features. SOAP-based web services invoked in BPEL are heavy with redundant information and lower performance. RESTful Web service is brought forward to new value-added business as an alternative solution. However, it's a big challenge to compose RESTful Web services with SOAP-based Web Services in SOA BPEL business processes. BPEL is not designed to use RESTful Web services because these types of services do not use WSDL to describe themselves. This paper proposes a novel approach for integrating RESTful Web services and SOAP-based Web services in business processes described in BPEL. The approach is applied to a practical multimedia conference BPEL process, and the experimental data show the stability of the new RESTful BPEL process with a higher performance.
{"title":"Integrating RESTful Service into BPEL Business Process on Service Generation System","authors":"Budan Wu, Rongheng Lin, Junliang Chen","doi":"10.1109/SCC.2013.70","DOIUrl":"https://doi.org/10.1109/SCC.2013.70","url":null,"abstract":"New value-added business, generated by Web service composition in BPEL, provides more powerful and flexible features. SOAP-based web services invoked in BPEL are heavy with redundant information and lower performance. RESTful Web service is brought forward to new value-added business as an alternative solution. However, it's a big challenge to compose RESTful Web services with SOAP-based Web Services in SOA BPEL business processes. BPEL is not designed to use RESTful Web services because these types of services do not use WSDL to describe themselves. This paper proposes a novel approach for integrating RESTful Web services and SOAP-based Web services in business processes described in BPEL. The approach is applied to a practical multimedia conference BPEL process, and the experimental data show the stability of the new RESTful BPEL process with a higher performance.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121592079","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}
I. Kumara, Jun Han, A. Colman, Tuan-Anh Nguyen, Malinda Kapuruge
A single-instance multi-tenant (SIMT) SaaS application enables a SaaS provider to achieve economies of scale through runtime sharing. However, runtime sharing can make tenant-specific variations difficult to achieve in such an application. In this paper, we propose an approach to realizing SIMT SaaS applications, which is based on Dynamic Software Product Lines (DSPL) and supports runtime sharing and variation. With the collaboration among a subset of services as the unit of composition, the commonality among the tenants' requirements is realized in the DSPL architecture by sharing collaboration units, and their variability is realized by composing different collaboration units, all at runtime. In addition, we adopt a feature-based high-level representation of the commonality and variability between the tenants' requirements to facilitate the runtime creation and reconfiguration of their application variants. We compare our approach with two alternative approaches in terms of development effort and degree of sharing. We further quantify the runtime overhead incurred by our multi-tenancy support.
{"title":"Sharing with a Difference: Realizing Service-Based SaaS Applications with Runtime Sharing and Variation in Dynamic Software Product Lines","authors":"I. Kumara, Jun Han, A. Colman, Tuan-Anh Nguyen, Malinda Kapuruge","doi":"10.1109/SCC.2013.30","DOIUrl":"https://doi.org/10.1109/SCC.2013.30","url":null,"abstract":"A single-instance multi-tenant (SIMT) SaaS application enables a SaaS provider to achieve economies of scale through runtime sharing. However, runtime sharing can make tenant-specific variations difficult to achieve in such an application. In this paper, we propose an approach to realizing SIMT SaaS applications, which is based on Dynamic Software Product Lines (DSPL) and supports runtime sharing and variation. With the collaboration among a subset of services as the unit of composition, the commonality among the tenants' requirements is realized in the DSPL architecture by sharing collaboration units, and their variability is realized by composing different collaboration units, all at runtime. In addition, we adopt a feature-based high-level representation of the commonality and variability between the tenants' requirements to facilitate the runtime creation and reconfiguration of their application variants. We compare our approach with two alternative approaches in terms of development effort and degree of sharing. We further quantify the runtime overhead incurred by our multi-tenancy support.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125645012","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}
Availability of high quality technical documentation is a critical enabler for users to fully take advantage of service capabilities, such as Cloud-based offerings where clients interact with the service via a portal and have no direct access to a service support. Technical writers are relying on the input from subject matter experts (SMEs) to create usable portal content. This disrupts service operation and reduces the productivity of the entire service offering team. While technical documentation may include contributions from a large distributed team, it often results in disconnected content with different writing styles. In this paper, we describe Scribe Crowd, a service for managing the process of composition of technical documents. Based on the principles of crowdsourcing, where a task may be outsources to many qualified agents, Scribe Crowd manages the distributed process of documentation and assigns incomplete pieces of write-up to appropriate experts. We present how Scribe Crowd has been used to engage over 120 business consultants to efficiently create content for 450 documents as part of an enterprise learning portal that serves information about banking, insurance and financial markets.
{"title":"Crowd-Enabled Technical Writing Services","authors":"M. Vukovic, V. Salapura, Sriram Rajagopal","doi":"10.1109/SCC.2013.84","DOIUrl":"https://doi.org/10.1109/SCC.2013.84","url":null,"abstract":"Availability of high quality technical documentation is a critical enabler for users to fully take advantage of service capabilities, such as Cloud-based offerings where clients interact with the service via a portal and have no direct access to a service support. Technical writers are relying on the input from subject matter experts (SMEs) to create usable portal content. This disrupts service operation and reduces the productivity of the entire service offering team. While technical documentation may include contributions from a large distributed team, it often results in disconnected content with different writing styles. In this paper, we describe Scribe Crowd, a service for managing the process of composition of technical documents. Based on the principles of crowdsourcing, where a task may be outsources to many qualified agents, Scribe Crowd manages the distributed process of documentation and assigns incomplete pieces of write-up to appropriate experts. We present how Scribe Crowd has been used to engage over 120 business consultants to efficiently create content for 450 documents as part of an enterprise learning portal that serves information about banking, insurance and financial markets.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134442164","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}
One of the most typical models of service market is a reverse auction, where service providers offer their services at a certain price and a user selects a combination of the services. In the first price auction, however, a service which is cheaper and has better quality is not necessarily selected. This causes unstable outcomes which are undesirable both for a user and service providers. A possible solution to this is the VCG (Vickrey-Clarke-Groves) mechanism, where the dominant strategy for a service provider is to report true cost of his service. In spite of this desirable property, implementing the VCG mechanism for service composition suffers from its computational cost. Calculation of payments to service providers based on the VCG mechanism requires iterative service selection, although each service selection can be NP- hard. Approximation algorithms cannot be applied because approximate solutions do not assure the desirable property of the VCG mechanism. Thus, we propose a dynamic programming (DP) based algorithm for service selection and VCG payment calculation. The proposed algorithm solves service selection in quasi-polynomial time and gives an exact solution. Moreover, we extend the algorithm to reuse matrix which is built during DP. This largely improves the performance of VCG payment calculation. Our experiment shows that the proposed algorithm can solve practical scale service composition.
{"title":"An Efficient Algorithm for Strategy-Proof Service Composition","authors":"Masahiro Tanaka, Yohei Murakami","doi":"10.1109/SCC.2013.100","DOIUrl":"https://doi.org/10.1109/SCC.2013.100","url":null,"abstract":"One of the most typical models of service market is a reverse auction, where service providers offer their services at a certain price and a user selects a combination of the services. In the first price auction, however, a service which is cheaper and has better quality is not necessarily selected. This causes unstable outcomes which are undesirable both for a user and service providers. A possible solution to this is the VCG (Vickrey-Clarke-Groves) mechanism, where the dominant strategy for a service provider is to report true cost of his service. In spite of this desirable property, implementing the VCG mechanism for service composition suffers from its computational cost. Calculation of payments to service providers based on the VCG mechanism requires iterative service selection, although each service selection can be NP- hard. Approximation algorithms cannot be applied because approximate solutions do not assure the desirable property of the VCG mechanism. Thus, we propose a dynamic programming (DP) based algorithm for service selection and VCG payment calculation. The proposed algorithm solves service selection in quasi-polynomial time and gives an exact solution. Moreover, we extend the algorithm to reuse matrix which is built during DP. This largely improves the performance of VCG payment calculation. Our experiment shows that the proposed algorithm can solve practical scale service composition.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"285 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132367110","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}
Lei Wang, A. Wombacher, L. F. Pires, M. V. Sinderen, Chihung Chi
With the possibility of system crashes and network failures, the design of robust client/server interactions for collaborative process execution is a challenge. If a business process changes state, it sends messages to relevant processes to inform about this change. However, server crashes and network failures may result in loss of messages. In this case, the state change is performed by one party, resulting in state/behavior inconsistencies and possibly deadlocks. Our basic idea to solve this problem is to cache the response (in a synchronous interaction) if the state of the process instance has changed by the request message. The possible state inconsistencies are recognized and compensated by state-caching and retrying failed interactions. By doing this work, we have learnt the possible failures caused by system crashes and network failures. Our results make it possible to build robust interactions by using cached-based process transformations.
{"title":"Robust Client/Server Shared State Interactions of Collaborative Process with System Crash and Network Failures","authors":"Lei Wang, A. Wombacher, L. F. Pires, M. V. Sinderen, Chihung Chi","doi":"10.1109/SCC.2013.39","DOIUrl":"https://doi.org/10.1109/SCC.2013.39","url":null,"abstract":"With the possibility of system crashes and network failures, the design of robust client/server interactions for collaborative process execution is a challenge. If a business process changes state, it sends messages to relevant processes to inform about this change. However, server crashes and network failures may result in loss of messages. In this case, the state change is performed by one party, resulting in state/behavior inconsistencies and possibly deadlocks. Our basic idea to solve this problem is to cache the response (in a synchronous interaction) if the state of the process instance has changed by the request message. The possible state inconsistencies are recognized and compensated by state-caching and retrying failed interactions. By doing this work, we have learnt the possible failures caused by system crashes and network failures. Our results make it possible to build robust interactions by using cached-based process transformations.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132865097","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}
SOA brought significant progress in information systems development, but the full exploitation of its advantages is sometimes hindered by specific problems. One of them is concerned with paradigm of Model Driven Development (MDD), where it is necessary to control correctness of the whole design within many models on different levels of abstraction. This is the place, where we would like to contribute. We propose a new approach to application of SOA design patterns in the development process. Patterns are transformed into a machine acceptable form using category theory and attributed graphs. This form is language independent, leads up to automated detection of pattern or antipattern in the description/model of SOA based system and in the future can facilitate also correctness checking.
{"title":"SOA Design Patterns -- Can They Improve the Process of Model Driven Development?","authors":"Roman Selmeci, Viera Rozinajová","doi":"10.1109/SCC.2013.117","DOIUrl":"https://doi.org/10.1109/SCC.2013.117","url":null,"abstract":"SOA brought significant progress in information systems development, but the full exploitation of its advantages is sometimes hindered by specific problems. One of them is concerned with paradigm of Model Driven Development (MDD), where it is necessary to control correctness of the whole design within many models on different levels of abstraction. This is the place, where we would like to contribute. We propose a new approach to application of SOA design patterns in the development process. Patterns are transformed into a machine acceptable form using category theory and attributed graphs. This form is language independent, leads up to automated detection of pattern or antipattern in the description/model of SOA based system and in the future can facilitate also correctness checking.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132997657","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}
Y. Belhoul, Mohammed Haddad, A. Gater, Daniela Grigori, H. Kheddouci, M. Bouzeghoub
In this paper, we propose a novel approach for graph based web service matching. Our approach is inspired by spectral graph matching methods, in particular, by eigen-based projections. We introduce new mechanisms to perform the matchmaking at both structural and semantic levels. These mechanisms are based on algebraic graph techniques that make them run fast and thus suitable for large scale web service matching problems. Experimentation is provided to show the performance of the proposed approach.
{"title":"Spectral Graph Approach for Process Model Matchmaking","authors":"Y. Belhoul, Mohammed Haddad, A. Gater, Daniela Grigori, H. Kheddouci, M. Bouzeghoub","doi":"10.1109/SCC.2013.27","DOIUrl":"https://doi.org/10.1109/SCC.2013.27","url":null,"abstract":"In this paper, we propose a novel approach for graph based web service matching. Our approach is inspired by spectral graph matching methods, in particular, by eigen-based projections. We introduce new mechanisms to perform the matchmaking at both structural and semantic levels. These mechanisms are based on algebraic graph techniques that make them run fast and thus suitable for large scale web service matching problems. Experimentation is provided to show the performance of the proposed approach.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"348 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133009447","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, the majority of solution development is completed under a fixed-price contract. Due to the inherent uncertainty of executing a project with many unpredictable factors, the solution developer bears significant risk in terms of cost, delivery time and quality. Compared to a variable-price (time-and-materials) contract, a fixed-price contract shifts most of the development risk from clients to developers. Therefore, it is important for developers to understand the level of risk inherent in a project and take the proper steps to mitigate risks. From the analysis of custom application development projects using service-oriented architecture methods, we observe that extension of the project duration utilizing a smaller development team can help to reduce the project effort (working hours) and therefore reduce the development cost. We characterize the relationship between deterioration in team performance and the increase in project team size through multivariate regression. We also provide a method to adjust the results of standard project estimation methods to take into account client-side risks. We then propose simple client and developer utility functions to quantify these trade-offs. This serves as an initial framework to identify choices that can be made during the bidding process to reduce development risks.
{"title":"Toward a Flexible Bidding Strategy with Preference Analysis","authors":"N. Zhou, Wesley M. Gifford, K. Ratakonda","doi":"10.1109/SCC.2013.20","DOIUrl":"https://doi.org/10.1109/SCC.2013.20","url":null,"abstract":"Today, the majority of solution development is completed under a fixed-price contract. Due to the inherent uncertainty of executing a project with many unpredictable factors, the solution developer bears significant risk in terms of cost, delivery time and quality. Compared to a variable-price (time-and-materials) contract, a fixed-price contract shifts most of the development risk from clients to developers. Therefore, it is important for developers to understand the level of risk inherent in a project and take the proper steps to mitigate risks. From the analysis of custom application development projects using service-oriented architecture methods, we observe that extension of the project duration utilizing a smaller development team can help to reduce the project effort (working hours) and therefore reduce the development cost. We characterize the relationship between deterioration in team performance and the increase in project team size through multivariate regression. We also provide a method to adjust the results of standard project estimation methods to take into account client-side risks. We then propose simple client and developer utility functions to quantify these trade-offs. This serves as an initial framework to identify choices that can be made during the bidding process to reduce development risks.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131191774","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}
Nowadays many software services are hosted in the Cloud. When there are more requests on these services, there are also more queries sent to the underlying database. In order to keep up with the increasing workload, it is necessary to have multiple servers hosting the data. Some cloud providers offer the full data replication solution. However, this solution only works when the load mainly consists of the read requests, and when the number of write requests increases, it does not scale well. Although data decomposition has been widely used in data-intensive web sites, not much study has been done on how to decompose the underlying data of software services for the purpose of data replication. In this paper, we propose a data-decomposition-based partial replication model for software services. We devise an automatic algorithm for data decomposition under the constraint of the capacity limit of the host machines. We evaluate our approach from two aspects: scalability and performance, using two benchmarks: RUBiS and TPC-W. In the experiment, we test the algorithm using different workload inputs, and also compare our approach with the full data replication approach.
{"title":"Data Decomposition Based Partial Replication Model for Software Services","authors":"Shuo Chen, Chi-Hung Chi, Chen Ding, R. Wong","doi":"10.1109/SCC.2013.83","DOIUrl":"https://doi.org/10.1109/SCC.2013.83","url":null,"abstract":"Nowadays many software services are hosted in the Cloud. When there are more requests on these services, there are also more queries sent to the underlying database. In order to keep up with the increasing workload, it is necessary to have multiple servers hosting the data. Some cloud providers offer the full data replication solution. However, this solution only works when the load mainly consists of the read requests, and when the number of write requests increases, it does not scale well. Although data decomposition has been widely used in data-intensive web sites, not much study has been done on how to decompose the underlying data of software services for the purpose of data replication. In this paper, we propose a data-decomposition-based partial replication model for software services. We devise an automatic algorithm for data decomposition under the constraint of the capacity limit of the host machines. We evaluate our approach from two aspects: scalability and performance, using two benchmarks: RUBiS and TPC-W. In the experiment, we test the algorithm using different workload inputs, and also compare our approach with the full data replication approach.","PeriodicalId":370898,"journal":{"name":"2013 IEEE International Conference on Services Computing","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128036132","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
扫码关注我们
求助内容：
应助结果提醒方式：