Seog-Chan Oh, Ju-Yeon Lee, Seon-Hwa Cheong, Soo-min Lim, Min-Woo Kim, Sang-Seok Lee, Jin-Bum Park, S. Noh, Mye M. Sohn
When there are a large number of web services in use, it is non-trivial to quickly find web services satisfying the given request. Furthermore, when no single web service satisfies the given request fully, one needs to “compose” multiple web services to fulfill the goal. It is important to have a wise decision on underlying web-service composition framework because the search space for such a composition problem is in general exponentially increasing. Furthermore, if semantic and QoS issues are concerned, the composition problems become easily intractable. Toward this problem, in this paper, we present WSPR* - Web-Service PlanneR augmented with A* algorithm (a Label Correcting variation algorithm) to compose web services effectively.
当使用大量web服务时，快速找到满足给定请求的web服务是非常重要的。此外，当没有单个web服务完全满足给定请求时，需要“组合”多个web服务来实现目标。对底层web服务组合框架做出明智的决策非常重要，因为针对此类组合问题的搜索空间通常呈指数级增长。此外，如果涉及语义和QoS问题，则组合问题很容易变得棘手。针对这一问题，本文提出了WSPR* - web - service PlanneR，增强了A*算法(一种标签纠错算法)来有效地组合web服务。
{"title":"WSPR*: Web-Service Planner Augmented with A* Algorithm","authors":"Seog-Chan Oh, Ju-Yeon Lee, Seon-Hwa Cheong, Soo-min Lim, Min-Woo Kim, Sang-Seok Lee, Jin-Bum Park, S. Noh, Mye M. Sohn","doi":"10.1109/CEC.2009.13","DOIUrl":"https://doi.org/10.1109/CEC.2009.13","url":null,"abstract":"When there are a large number of web services in use, it is non-trivial to quickly find web services satisfying the given request. Furthermore, when no single web service satisfies the given request fully, one needs to “compose” multiple web services to fulfill the goal. It is important to have a wise decision on underlying web-service composition framework because the search space for such a composition problem is in general exponentially increasing. Furthermore, if semantic and QoS issues are concerned, the composition problems become easily intractable. Toward this problem, in this paper, we present WSPR* - Web-Service PlanneR augmented with A* algorithm (a Label Correcting variation algorithm) to compose web services effectively.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116952218","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 present Time-BPMN which is an extension to the current version of the Business Process Modeling Notation (BPMN). Time-BPMN captures the temporal perspective of business processes. This extension deals with the various temporal constraints and dependencies that may occur while characterizing real world business processes. Time-BPMN allows for the specification and depiction of temporal constraints and dependencies within a BPMN diagram. It not only extends, but also simplifies certain existing temporal BPMN constructs. With our extension, BPMN becomes expressive enough to account for a very large set of real world business processes that are time dependent.
{"title":"Time-BPMN","authors":"D. Gagné, A. Trudel","doi":"10.1109/CEC.2009.71","DOIUrl":"https://doi.org/10.1109/CEC.2009.71","url":null,"abstract":"We present Time-BPMN which is an extension to the current version of the Business Process Modeling Notation (BPMN). Time-BPMN captures the temporal perspective of business processes. This extension deals with the various temporal constraints and dependencies that may occur while characterizing real world business processes. Time-BPMN allows for the specification and depiction of temporal constraints and dependencies within a BPMN diagram. It not only extends, but also simplifies certain existing temporal BPMN constructs. With our extension, BPMN becomes expressive enough to account for a very large set of real world business processes that are time dependent.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114241639","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 this paper our focus is on issues and challengesfaced in monitoring energy consumption in thedomestic sector and way forward to deal with thesechallenges. Implementing a sensor network to monitorenergy consumption of household appliances in ameaningful way requires sophisticated network design.Such network has to deal with large amount rawsensor data coming from multiple sources. Thechallenge is how to collect necessary data and store itfor producing intelligent advice on economical energyusage for household. One way of dealing with thischallenge is to have smart sensor devices embedded inhome appliances, however currently a vast majority ofdomestic appliances do not have even dumb sensordevices to enable access to their energy consumptiondata. In a typical home environment we can expectsensing devices with various capabilities ranging frompassive device to intelligent and proactive devices.Raw data streams received from these devices need tonormalised and represented in semanticallyequivalence manners.
{"title":"Monitoring Appliances Sensor Data in Home Environment: Issues and Challanges","authors":"N. Shah, Chen-Fang Tsai, K. Chao","doi":"10.1109/CEC.2009.65","DOIUrl":"https://doi.org/10.1109/CEC.2009.65","url":null,"abstract":"In this paper our focus is on issues and challengesfaced in monitoring energy consumption in thedomestic sector and way forward to deal with thesechallenges. Implementing a sensor network to monitorenergy consumption of household appliances in ameaningful way requires sophisticated network design.Such network has to deal with large amount rawsensor data coming from multiple sources. Thechallenge is how to collect necessary data and store itfor producing intelligent advice on economical energyusage for household. One way of dealing with thischallenge is to have smart sensor devices embedded inhome appliances, however currently a vast majority ofdomestic appliances do not have even dumb sensordevices to enable access to their energy consumptiondata. In a typical home environment we can expectsensing devices with various capabilities ranging frompassive device to intelligent and proactive devices.Raw data streams received from these devices need tonormalised and represented in semanticallyequivalence manners.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123791999","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 main requirement for virtual organizations are shortterm collaborations between business partners to provide efficient and individualized services to customers. The MOVE project targets at a methodology and a software framework to support such flexible collaborations based on process oriented design and communication by Web services. MOVEs framework supports the graphical design and verification of business processes, the execution and supervision of processes in transaction-oriented environment, and the dynamic composition and optimization of processes. A business process may be composed from a set of Web services, deployed itself as Web service and executed in the framework. The automated composition of processes from Web services is implemented with methods from AI-planning. We map Web service descriptions, domain knowledge and customer requests into PDDL, an input language of AI-planners. We show the performance of our program with one typical AI planning system and give some implementation details. Finally we conclude with some remarks about further research.
{"title":"MOVE: A Generic Service Composition Framework for Service Oriented Architectures","authors":"A. Rainer, J. Dorn","doi":"10.1109/CEC.2009.56","DOIUrl":"https://doi.org/10.1109/CEC.2009.56","url":null,"abstract":"One main requirement for virtual organizations are shortterm collaborations between business partners to provide efficient and individualized services to customers. The MOVE project targets at a methodology and a software framework to support such flexible collaborations based on process oriented design and communication by Web services. MOVEs framework supports the graphical design and verification of business processes, the execution and supervision of processes in transaction-oriented environment, and the dynamic composition and optimization of processes. A business process may be composed from a set of Web services, deployed itself as Web service and executed in the framework. The automated composition of processes from Web services is implemented with methods from AI-planning. We map Web service descriptions, domain knowledge and customer requests into PDDL, an input language of AI-planners. We show the performance of our program with one typical AI planning system and give some implementation details. Finally we conclude with some remarks about further research.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132045990","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 elaborates the application areas of web-based process portals supporting the continuous business process management initiatives. Within the document specific examples are demonstrated where a web-based process portal can support the work of the different relevant stakeholders within an integrated business process management approach. As an example the ADONIS Process Portal is described with its provided functionality.
{"title":"Web-Based Process Portals: Powering Business Process Management within Large Organisations","authors":"R. Strobl, Thomas Müllner, Tobias Rausch","doi":"10.1109/CEC.2009.88","DOIUrl":"https://doi.org/10.1109/CEC.2009.88","url":null,"abstract":"This paper elaborates the application areas of web-based process portals supporting the continuous business process management initiatives. Within the document specific examples are demonstrated where a web-based process portal can support the work of the different relevant stakeholders within an integrated business process management approach. As an example the ADONIS Process Portal is described with its provided functionality.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"55 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114039076","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}
Collaborative filtering (CF) is currently the most popular technique used in commercial recommender systems. Algorithms of this type derive personalized product propositions for customers by exploitingstatistics derived from vast amounts of transaction data.Traditionally, basic CF algorithms have exploited a single category of ratings despite the fact that on many platforms a variety of different forms of user feedback are available for personalization and recommendation. In this paper we explore a collaborative feature-combination algorithm that concurrently exploits multiple aspects of the user model like clickstream data, sales transactions and explicit user requirements to overcome some known shortcomingsof CF like the cold-start problem for new users. We validate our contribution by evaluating it against the standard user-to-user CF algorithm using a dataset from a commercial Web shop. Evaluation results indicate considerable improvements in terms of user coverageand accuracy.
{"title":"Collaborative Feature-Combination Recommender Exploiting Explicit and Implicit User Feedback","authors":"M. Zanker, M. Jessenitschnig","doi":"10.1109/CEC.2009.84","DOIUrl":"https://doi.org/10.1109/CEC.2009.84","url":null,"abstract":"Collaborative filtering (CF) is currently the most popular technique used in commercial recommender systems. Algorithms of this type derive personalized product propositions for customers by exploitingstatistics derived from vast amounts of transaction data.Traditionally, basic CF algorithms have exploited a single category of ratings despite the fact that on many platforms a variety of different forms of user feedback are available for personalization and recommendation. In this paper we explore a collaborative feature-combination algorithm that concurrently exploits multiple aspects of the user model like clickstream data, sales transactions and explicit user requirements to overcome some known shortcomingsof CF like the cold-start problem for new users. We validate our contribution by evaluating it against the standard user-to-user CF algorithm using a dataset from a commercial Web shop. Evaluation results indicate considerable improvements in terms of user coverageand accuracy.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123615781","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}
Experience during e-Commerce activities will greatly influence people’s buying behavior. In this paper, thekey points of doing commerce over 3D virtual world arestudied, a systematic method of designing e-commerceexperience in 3D virtual world is designed which is named C2V (Commerce to Virtual Worlds). A commerce scenario isdecomposed into roles and scenes, and then captured byPerformative Structure graph. The Performative Structuregraph is then transformed into rectangular dualization layout through Rectangular Dualization algorithm. By using a real use case (1st World Youth Olympic Game to be hosted by Singapore) to apply the designed method, the feasibility of our new method is proved.
电子商务活动中的体验会极大地影响人们的购买行为。本文研究了在三维虚拟世界中进行电子商务的关键点，设计了一种系统的三维虚拟世界电子商务体验设计方法，称为C2V (commerce to virtual Worlds)。将商业场景分解为角色和场景，然后通过性能结构图捕获。然后通过矩形二元化算法将性能结构图转换为矩形二元化布局。通过一个实际用例(即将在新加坡举办的第一届世界青奥会)来应用所设计的方法，证明了新方法的可行性。
{"title":"Designing Social Commerce Experience in 3D Virtual World","authors":"Zhi-Cong Fang, Hong Cai","doi":"10.1109/CEC.2009.30","DOIUrl":"https://doi.org/10.1109/CEC.2009.30","url":null,"abstract":"Experience during e-Commerce activities will greatly influence people’s buying behavior. In this paper, thekey points of doing commerce over 3D virtual world arestudied, a systematic method of designing e-commerceexperience in 3D virtual world is designed which is named C2V (Commerce to Virtual Worlds). A commerce scenario isdecomposed into roles and scenes, and then captured byPerformative Structure graph. The Performative Structuregraph is then transformed into rectangular dualization layout through Rectangular Dualization algorithm. By using a real use case (1st World Youth Olympic Game to be hosted by Singapore) to apply the designed method, the feasibility of our new method is proved.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129776122","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}
Reputation systems have been popular in several online market places involving anonymous players as it can provide crucial information on the trustworthiness of an object or individual player to combat selfish and deceptive behaviors from peers. Individual feedbacks on the quality of past association are the fundamental building blocks of reputation systems. Careful consideration in aggregating feedbacks from different sources is in fact very important in computing a reliable value for trust worthiness to facilitate decision making in a social dilemma situation like that of online market places. In this paper we are considering a possible improvement to a reputation model like that of eBay, with our interest lying on investigating how the cooperativeness and population of cooperators would evolve if the weight of the feedback source was assigned on the basis of past association between players. We categorize the feedback source as direct source, gray source and opposition friendly source to define an aggregation method for trustworthiness assessment that considers applying a dynamically computed weight to each source of feedback. Our result shows that breaking feedback sources on the basis of acquaintance and assigning weight accordingly favors the evolution of cooperativeness in the player society as compared to models which do not classify the feedback sources. A genetic algorithm based spatial iterated prisoner’s dilemma (SIPD) environment has been used to simulate the experiments.
{"title":"Evolution of Cooperativeness in a Business Game Relying on Acquaintance Based Trustworthiness Assessment","authors":"S. Bista, K. Dahal, P. Cowling, B. M. Tuladhar","doi":"10.1109/CEC.2009.52","DOIUrl":"https://doi.org/10.1109/CEC.2009.52","url":null,"abstract":"Reputation systems have been popular in several online market places involving anonymous players as it can provide crucial information on the trustworthiness of an object or individual player to combat selfish and deceptive behaviors from peers. Individual feedbacks on the quality of past association are the fundamental building blocks of reputation systems. Careful consideration in aggregating feedbacks from different sources is in fact very important in computing a reliable value for trust worthiness to facilitate decision making in a social dilemma situation like that of online market places. In this paper we are considering a possible improvement to a reputation model like that of eBay, with our interest lying on investigating how the cooperativeness and population of cooperators would evolve if the weight of the feedback source was assigned on the basis of past association between players. We categorize the feedback source as direct source, gray source and opposition friendly source to define an aggregation method for trustworthiness assessment that considers applying a dynamically computed weight to each source of feedback. Our result shows that breaking feedback sources on the basis of acquaintance and assigning weight accordingly favors the evolution of cooperativeness in the player society as compared to models which do not classify the feedback sources. A genetic algorithm based spatial iterated prisoner’s dilemma (SIPD) environment has been used to simulate the experiments.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115741575","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}
Negotiation is required before invoking a service in order to identify how the invocation must occur in terms of functional and non-functional criteria. This process is possible when all the involved parties agree on the same negotiation protocol (e.g., bilateral negotiations). Considering a Service Oriented Architecture (SOA), this negotiation protocol cannot be predefined, but it must be selected by considering the negotiation capabilities of the involved services.In this work, we propose a semantic-based framework for supporting the negotiation in SOA. Specifically, the framework allows to express the negotiation capabilities of service requesters and providers and proposes a mechanism for discovering the negotiation protocols that can be enacted when a negotiation is required. To improve the flexibility of the framework, the concept of delegation is introduced to deal with the situation in which a party, that is not able to support the negotiation protocol, wants to participate in a negotiation. In this case, the negotiation can be fully or partially delegated to one or more other parties that, instead, are able to support the negotiation protocol.
{"title":"A Semantic Based Framework for Supporting Negotiation in Service Oriented Architectures","authors":"M. Comuzzi, K. Kritikos, P. Plebani","doi":"10.1109/CEC.2009.17","DOIUrl":"https://doi.org/10.1109/CEC.2009.17","url":null,"abstract":"Negotiation is required before invoking a service in order to identify how the invocation must occur in terms of functional and non-functional criteria. This process is possible when all the involved parties agree on the same negotiation protocol (e.g., bilateral negotiations). Considering a Service Oriented Architecture (SOA), this negotiation protocol cannot be predefined, but it must be selected by considering the negotiation capabilities of the involved services.In this work, we propose a semantic-based framework for supporting the negotiation in SOA. Specifically, the framework allows to express the negotiation capabilities of service requesters and providers and proposes a mechanism for discovering the negotiation protocols that can be enacted when a negotiation is required. To improve the flexibility of the framework, the concept of delegation is introduced to deal with the situation in which a party, that is not able to support the negotiation protocol, wants to participate in a negotiation. In this case, the negotiation can be fully or partially delegated to one or more other parties that, instead, are able to support the negotiation protocol.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115816691","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}
Tao Yu, Qiming Chen, Qinghu Li, R. Liu, Weihong Wang, W. Liu
The convergence of mashup and Service Oriented Architecture (SOA) enables the enterprise to deliver composite and situational applications by integrating information across internal and external sources. In this paper, we propose an approach that takes ideas from mashup and extend it to deliver real-time interactive visual analysis application on spatial-temporal datasets over the Internet. Four aspects of the approach are discussed: temporal data mashup based on continuous queries, template driven and materialized mashup view for providing personalized services, real-time data transmission using Web Service Notification (WSN), geo-visualization mashup for visual synthesis, presentation and analysis. A prototype system has been built up for supporting hydrologic information observation and analysis, such as flood prediction, inundated area estimation, etc. Our preliminary findings will be beneficial to others to create Business Intelligence (BI) mashups for real-time visualization and business logic analysis.
{"title":"A System for Web-Based Interactive Real-Time Data Visualization and Analysis","authors":"Tao Yu, Qiming Chen, Qinghu Li, R. Liu, Weihong Wang, W. Liu","doi":"10.1109/CEC.2009.26","DOIUrl":"https://doi.org/10.1109/CEC.2009.26","url":null,"abstract":"The convergence of mashup and Service Oriented Architecture (SOA) enables the enterprise to deliver composite and situational applications by integrating information across internal and external sources. In this paper, we propose an approach that takes ideas from mashup and extend it to deliver real-time interactive visual analysis application on spatial-temporal datasets over the Internet. Four aspects of the approach are discussed: temporal data mashup based on continuous queries, template driven and materialized mashup view for providing personalized services, real-time data transmission using Web Service Notification (WSN), geo-visualization mashup for visual synthesis, presentation and analysis. A prototype system has been built up for supporting hydrologic information observation and analysis, such as flood prediction, inundated area estimation, etc. Our preliminary findings will be beneficial to others to create Business Intelligence (BI) mashups for real-time visualization and business logic analysis.","PeriodicalId":384060,"journal":{"name":"2009 IEEE Conference on Commerce and Enterprise Computing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131952044","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
扫码关注我们
求助内容：
应助结果提醒方式：