A. Bergmayr, M. Wimmer, G. Kappel, Michael Grossniklaus
Recently, several proposals towards a cloud modeling language have emerged. As they address the diversity of cloud environments, it is not surprising that these modeling languages support different scenarios. Using a by-example approach based on the scenario of software migration, we demonstrate their representational capabilities and review them according to characteristics common to all modeling languages as well as specific to the cloud computing domain. We report on our findings and present research guidelines for future efforts towards a better alignment of the different cloud modeling languages.
{"title":"Cloud Modeling Languages by Example","authors":"A. Bergmayr, M. Wimmer, G. Kappel, Michael Grossniklaus","doi":"10.1109/SOCA.2014.56","DOIUrl":"https://doi.org/10.1109/SOCA.2014.56","url":null,"abstract":"Recently, several proposals towards a cloud modeling language have emerged. As they address the diversity of cloud environments, it is not surprising that these modeling languages support different scenarios. Using a by-example approach based on the scenario of software migration, we demonstrate their representational capabilities and review them according to characteristics common to all modeling languages as well as specific to the cloud computing domain. We report on our findings and present research guidelines for future efforts towards a better alignment of the different cloud modeling languages.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114874957","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}
Yueshen Xu, Jianwei Yin, Zizheng Wu, Dongqing He, Yan Tan
The reliability prediction of service-oriented system is a key problem, and has become increasingly important along with the wide utilization of service-oriented architecture. In this paper, we aim to improve the prediction accuracy of reliability in a collaborative way. First, we estimate the failure probability of each component through two independent models extended from Matrix Factorization. For each service and user, we identify the similar neighbors through similarity computation. Then, we build the service neighborhood-based MF model (SN-MF) and user neighborhood-based MF model (UN-MF). In the two models, each unknown failure probability is learned out assisted by similar neighbors' historical failure records collaboratively. Further, we combine the two models together to build an ensemble model, and explicate the way of calculating the final failure probability of the whole system. Afterwards, the failure probability is mapped to reliability with a classical function. Finally, experiments conducted in a real-world dataset demonstrate the effectiveness of our models.
{"title":"Reliability Prediction for Service Oriented System via Matrix Factorization in a Collaborative Way","authors":"Yueshen Xu, Jianwei Yin, Zizheng Wu, Dongqing He, Yan Tan","doi":"10.1109/SOCA.2014.11","DOIUrl":"https://doi.org/10.1109/SOCA.2014.11","url":null,"abstract":"The reliability prediction of service-oriented system is a key problem, and has become increasingly important along with the wide utilization of service-oriented architecture. In this paper, we aim to improve the prediction accuracy of reliability in a collaborative way. First, we estimate the failure probability of each component through two independent models extended from Matrix Factorization. For each service and user, we identify the similar neighbors through similarity computation. Then, we build the service neighborhood-based MF model (SN-MF) and user neighborhood-based MF model (UN-MF). In the two models, each unknown failure probability is learned out assisted by similar neighbors' historical failure records collaboratively. Further, we combine the two models together to build an ensemble model, and explicate the way of calculating the final failure probability of the whole system. Afterwards, the failure probability is mapped to reliability with a classical function. Finally, experiments conducted in a real-world dataset demonstrate the effectiveness of our models.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125431313","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}
Bilateral multi-issue closed negotiation is an important class for real-life negotiations. Usually, negotiation problems have constraints such as a complex and unknown opponent's utility in real time, or time discounting. In the class of negotiation with some constraints, the effective automated negotiation agents can adjust their behavior depending on the characteristics of their opponents and negotiation scenarios. Recently, the attention of this study has focused on the interleaving learning with negotiation strategies from the past negotiation sessions. By analyzing the past negotiation sessions, agents can estimate the opponent's utility function based on exchanging bids. In this paper, we propose an automated agent that estimates the opponent's strategies based on the past negotiation sessions. Our agent tries to compromise to the estimated maximum utility of the opponent by the end of the negotiation. In addition, our agent can adjust the speed of compromise by judging the opponent's Thomas-Kilmann Conflict Mode and search for the pareto frontier using past negotiation sessions. In the experiments, we demonstrate that the proposed agent has better outcomes and greater search technique for the pareto frontier than existing agents in the linear and nonlinear utility functions.
{"title":"Efficient Strategy Adaptation for Complex Multi-times Bilateral Negotiations","authors":"K. Fujita","doi":"10.1109/SOCA.2014.13","DOIUrl":"https://doi.org/10.1109/SOCA.2014.13","url":null,"abstract":"Bilateral multi-issue closed negotiation is an important class for real-life negotiations. Usually, negotiation problems have constraints such as a complex and unknown opponent's utility in real time, or time discounting. In the class of negotiation with some constraints, the effective automated negotiation agents can adjust their behavior depending on the characteristics of their opponents and negotiation scenarios. Recently, the attention of this study has focused on the interleaving learning with negotiation strategies from the past negotiation sessions. By analyzing the past negotiation sessions, agents can estimate the opponent's utility function based on exchanging bids. In this paper, we propose an automated agent that estimates the opponent's strategies based on the past negotiation sessions. Our agent tries to compromise to the estimated maximum utility of the opponent by the end of the negotiation. In addition, our agent can adjust the speed of compromise by judging the opponent's Thomas-Kilmann Conflict Mode and search for the pareto frontier using past negotiation sessions. In the experiments, we demonstrate that the proposed agent has better outcomes and greater search technique for the pareto frontier than existing agents in the linear and nonlinear utility functions.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126224519","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}
There are strong demands to utilize multi-core computing resources effectively for large-scale and highly detailed multi-agent simulations. We have proposed a framework to assist parameter tuning process of multi-core programming for simulation developers to utilize many parallel cores in their simulation programs efficiently. However, due to its massive computation costs, it is not easy task to seek the sufficient compilation and execution parameters and analyze their performance characteristics for various execution settings. In this paper, we present a preliminary analysis of parameter optimization based on BLMAB by utilizing our framework. We show how our BLMAB-based approach can effectively be used on the parameter optimization process.
{"title":"A Preliminary Analysis on BLMAB-Based Approximate Optimization Support for Multi Agent Simulations on Multi-core and GPU-Based Computing Environment","authors":"Y. Sano, Yoshiaki Kadono, Naoki Fukuta","doi":"10.1109/SOCA.2014.37","DOIUrl":"https://doi.org/10.1109/SOCA.2014.37","url":null,"abstract":"There are strong demands to utilize multi-core computing resources effectively for large-scale and highly detailed multi-agent simulations. We have proposed a framework to assist parameter tuning process of multi-core programming for simulation developers to utilize many parallel cores in their simulation programs efficiently. However, due to its massive computation costs, it is not easy task to seek the sufficient compilation and execution parameters and analyze their performance characteristics for various execution settings. In this paper, we present a preliminary analysis of parameter optimization based on BLMAB by utilizing our framework. We show how our BLMAB-based approach can effectively be used on the parameter optimization process.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129454572","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}
Mohammad Allahbakhsh, Samira Samimi, H. M. Nezhad, B. Benatallah
Workers in online crowd sourcing systems have different levels of expertise, trustworthiness, incentives and motivations. Therefore, recruiting sufficient number of well-suited workers is always a challenge. Existing methods usually recruit workers through open calls, friendships relations, matching their profiles with task requirements or recruiting teams of workers. But there are still challenges that need more investigations, mainly all existing recruitment methods are highly vulnerable to collaborating misbehaviour, i.e., Collusion. %These groups are highly vulnerable to collusion attacks. In this paper, we propose a recruitment method which takes into account individual and social attributes of workers to find suitable workers. The method discovers indirect collaborations between workers to harness implicit teamwork knowledge in order to increase the quality of crowd sourcing tasks' outcome and in the same time prevent collusion attacks. The proposed method is implemented and tested using the simulated data, build based on a public data dump from Stack overflow. The evaluation results show the accuracy of the obtained results and superiority of our proposed method over the other related work.
{"title":"Harnessing Implicit Teamwork Knowledge to Improve Quality in Crowdsourcing Processes","authors":"Mohammad Allahbakhsh, Samira Samimi, H. M. Nezhad, B. Benatallah","doi":"10.1109/SOCA.2014.26","DOIUrl":"https://doi.org/10.1109/SOCA.2014.26","url":null,"abstract":"Workers in online crowd sourcing systems have different levels of expertise, trustworthiness, incentives and motivations. Therefore, recruiting sufficient number of well-suited workers is always a challenge. Existing methods usually recruit workers through open calls, friendships relations, matching their profiles with task requirements or recruiting teams of workers. But there are still challenges that need more investigations, mainly all existing recruitment methods are highly vulnerable to collaborating misbehaviour, i.e., Collusion. %These groups are highly vulnerable to collusion attacks. In this paper, we propose a recruitment method which takes into account individual and social attributes of workers to find suitable workers. The method discovers indirect collaborations between workers to harness implicit teamwork knowledge in order to increase the quality of crowd sourcing tasks' outcome and in the same time prevent collusion attacks. The proposed method is implemented and tested using the simulated data, build based on a public data dump from Stack overflow. The evaluation results show the accuracy of the obtained results and superiority of our proposed method over the other related work.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129519829","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}
Internet of Things (IoT) enables many physical devices to connect to Internet, including wearable devices, home appliances, ambient devices, etc. IoT application developers have created new services and applications to control actuators to make our lives easier. Since many applications may co-exist in a given environment, some of them may want to use an actuator at the same time, causing resource access conflicts. How to resolve resource conflicts is critical in IoT systems. We propose an auction-based mechanism to coordinate applications and resolve their resource access conflicts. The mechanism is supported in the WuKong IoT middleware. We also conduct simulations to show that our method is efficient and can achieve good performances.
{"title":"Auction-Based Resource Access Protocols in IoT Service Systems","authors":"Che-Wei Liang, Jane Yung-jen Hsu, Kwei-Jay Lin","doi":"10.1109/SOCA.2014.50","DOIUrl":"https://doi.org/10.1109/SOCA.2014.50","url":null,"abstract":"Internet of Things (IoT) enables many physical devices to connect to Internet, including wearable devices, home appliances, ambient devices, etc. IoT application developers have created new services and applications to control actuators to make our lives easier. Since many applications may co-exist in a given environment, some of them may want to use an actuator at the same time, causing resource access conflicts. How to resolve resource conflicts is critical in IoT systems. We propose an auction-based mechanism to coordinate applications and resolve their resource access conflicts. The mechanism is supported in the WuKong IoT middleware. We also conduct simulations to show that our method is efficient and can achieve good performances.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127273859","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}
Data is connected to the Internet with a sensor for understanding the property of the thing for which a two-dimensional code was used. Two-dimensional codes can play the role of connecting cyberspace to physical space, and can play a significant role in the so-called Internet of Things. Moreover, the advancement of machine vision is progressing with machine-to-machine communication. On the other hand, there is also private information, such as personal information, that should not be known by others. Current two-dimensional codes have become ubiquitous and express the cell using two colors: white and black. The cell expresses white or black in one bit, and there is no confidentiality available. In response to this, we propose an addition to the existing part that can be read with conventional equipment. We propose a "secrecy part" that cannot be read without a decryption key. Further, we propose a method for rendering these two-dimensional codes compatible with black-and-white codes. In order to generate the secrecy part, it is necessary to transform a cell into several bits. A multicolor method and a multiple-region method are used to transform the code into several bits. An evaluation of the multi-valued cells in the two-dimensional codes here proposed, with a read verification and compatibility along with the added secrecy part, was carried out using a smartphone with successful results.
{"title":"Evaluation of the Identity and Compatibility of Multi-valued Cells in Two-Dimensional Codes Using Smartphones","authors":"N. Teraura, K. Sakurai","doi":"10.1109/SOCA.2014.17","DOIUrl":"https://doi.org/10.1109/SOCA.2014.17","url":null,"abstract":"Data is connected to the Internet with a sensor for understanding the property of the thing for which a two-dimensional code was used. Two-dimensional codes can play the role of connecting cyberspace to physical space, and can play a significant role in the so-called Internet of Things. Moreover, the advancement of machine vision is progressing with machine-to-machine communication. On the other hand, there is also private information, such as personal information, that should not be known by others. Current two-dimensional codes have become ubiquitous and express the cell using two colors: white and black. The cell expresses white or black in one bit, and there is no confidentiality available. In response to this, we propose an addition to the existing part that can be read with conventional equipment. We propose a \"secrecy part\" that cannot be read without a decryption key. Further, we propose a method for rendering these two-dimensional codes compatible with black-and-white codes. In order to generate the secrecy part, it is necessary to transform a cell into several bits. A multicolor method and a multiple-region method are used to transform the code into several bits. An evaluation of the multi-valued cells in the two-dimensional codes here proposed, with a read verification and compatibility along with the added secrecy part, was carried out using a smartphone with successful results.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127884298","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}
J. Nakazawa, H. Tokuda, Yutaro Kyono, Takuro Yonezawa
The paper proposes vertical/horizontal smart city service orchestration in terms of networking, sensing and actuation across ground, air and space. Smart city services should support in both usual and emergency situations, however, the system requirements to the different situation differs because network availability and sensing/acting priority are different among the situations. To fulfil various requirements for smart city serves, we present vertical/horizontal service orchestration through Fujisawa field trials in Japan.
{"title":"Orchestration of Smart City Services across Ground, Air, and Space","authors":"J. Nakazawa, H. Tokuda, Yutaro Kyono, Takuro Yonezawa","doi":"10.1109/SOCA.2014.28","DOIUrl":"https://doi.org/10.1109/SOCA.2014.28","url":null,"abstract":"The paper proposes vertical/horizontal smart city service orchestration in terms of networking, sensing and actuation across ground, air and space. Smart city services should support in both usual and emergency situations, however, the system requirements to the different situation differs because network availability and sensing/acting priority are different among the situations. To fulfil various requirements for smart city serves, we present vertical/horizontal service orchestration through Fujisawa field trials in Japan.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130826141","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}
Hsin-Hsien Peng, Chi-Chung Lo, Tsung-Ching Lin, Y. Tseng
Wearable technologies have attracted considerable attention in mobile computing. This paper proposes a system for localization on wearable devices, such as the smart glasses. The existing approaches to localization, such as AoA, ToA, TDoA, GPS, and RF-based solutions, rely on auxiliary signals at set distances. This limitation constrains the availability of LBS when a mobile device is unable to receive the auxiliary signals. For example, GPS is not available in indoor environments. This paper proposes a system for "self-contained" localization, which refers to the capability of a device to determine its location without having to rely on auxiliary signals, and demonstrates the feasibility of using inertial measurement unit (IMU) and visual sensors in a smart phone to achieve this goal. Based on a concept called inertial sensor-assisted localization (ISAL), IMU sensors are triggered by user motions and visual cues are taken from existing objects. Using augmented reality (AR) techniques, objects captured by the smart phone camera are "tagged" manually or automatically by image processing tools. The angles of these objects relative to the user are then measured by IMU sensors. Based on these angles, we then develop an angulation algorithm to determine the location of the user.
{"title":"Self-Contained Localization without Auxiliary Signals on Smart Devices","authors":"Hsin-Hsien Peng, Chi-Chung Lo, Tsung-Ching Lin, Y. Tseng","doi":"10.1109/SOCA.2014.21","DOIUrl":"https://doi.org/10.1109/SOCA.2014.21","url":null,"abstract":"Wearable technologies have attracted considerable attention in mobile computing. This paper proposes a system for localization on wearable devices, such as the smart glasses. The existing approaches to localization, such as AoA, ToA, TDoA, GPS, and RF-based solutions, rely on auxiliary signals at set distances. This limitation constrains the availability of LBS when a mobile device is unable to receive the auxiliary signals. For example, GPS is not available in indoor environments. This paper proposes a system for \"self-contained\" localization, which refers to the capability of a device to determine its location without having to rely on auxiliary signals, and demonstrates the feasibility of using inertial measurement unit (IMU) and visual sensors in a smart phone to achieve this goal. Based on a concept called inertial sensor-assisted localization (ISAL), IMU sensors are triggered by user motions and visual cues are taken from existing objects. Using augmented reality (AR) techniques, objects captured by the smart phone camera are \"tagged\" manually or automatically by image processing tools. The angles of these objects relative to the user are then measured by IMU sensors. Based on these angles, we then develop an angulation algorithm to determine the location of the user.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116322343","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}
K. Aihara, Hajime Imura, A. Takasu, Yuzuru Tanaka, J. Adachi
This paper introduces the ongoing project that aims to develop a mobile sensing framework to collect sensor data reflecting personal-scale, or microscopic, roadside phenomena by crowd sourcing and also using social big data, such as traffic, climate, and contents of social network services like Twitter. To collect them, smartphone applications are provided. One of the typical applications is a driving recorder that collects not only sensor data, such as acceleration, gyro, compass, and speed, but also recorded videos from the driver's view. To extract specific roadside phenomena, collected data are integrated and analyzed at the service platform. The framework also provides tools for interactive analysis to support city administration.
{"title":"Crowdsourced Mobile Sensing for Smarter City Life","authors":"K. Aihara, Hajime Imura, A. Takasu, Yuzuru Tanaka, J. Adachi","doi":"10.1109/SOCA.2014.33","DOIUrl":"https://doi.org/10.1109/SOCA.2014.33","url":null,"abstract":"This paper introduces the ongoing project that aims to develop a mobile sensing framework to collect sensor data reflecting personal-scale, or microscopic, roadside phenomena by crowd sourcing and also using social big data, such as traffic, climate, and contents of social network services like Twitter. To collect them, smartphone applications are provided. One of the typical applications is a driving recorder that collects not only sensor data, such as acceleration, gyro, compass, and speed, but also recorded videos from the driver's view. To extract specific roadside phenomena, collected data are integrated and analyzed at the service platform. The framework also provides tools for interactive analysis to support city administration.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114219223","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
扫码关注我们
求助内容：
应助结果提醒方式：