Faced with a huge user base, cloud computing need to be addressed with the amount of tasks and data. The resource scheduling scheme for cloud computing environment, that provides QoS(Quality of Service) guarantees, is presented in this paper based on improved Electromagnetism-like Mechanism algorithm(EM). To update force equation and the introduction of tabu search ideas, so as to control the global and local search as far as possible to avoid falling into local optimum. The experimental results in CloudSim platform show that the algorithm is efficient.
面对庞大的用户群，云计算需要处理大量的任务和数据。提出了一种基于改进的类电磁机制算法(EM)的云计算环境下提供QoS(Quality of Service)保证的资源调度方案。更新力方程，引入禁忌搜索思想，尽可能控制全局和局部搜索，避免陷入局部最优。在CloudSim平台上的实验结果表明，该算法是有效的。
{"title":"Guaranteed QoS Resource Scheduling Scheme Based on Improved Electromagnetism-Like Mechanism Algorithm in Cloud Environment","authors":"S. Yun","doi":"10.1109/INCoS.2013.66","DOIUrl":"https://doi.org/10.1109/INCoS.2013.66","url":null,"abstract":"Faced with a huge user base, cloud computing need to be addressed with the amount of tasks and data. The resource scheduling scheme for cloud computing environment, that provides QoS(Quality of Service) guarantees, is presented in this paper based on improved Electromagnetism-like Mechanism algorithm(EM). To update force equation and the introduction of tabu search ideas, so as to control the global and local search as far as possible to avoid falling into local optimum. The experimental results in CloudSim platform show that the algorithm is efficient.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"39 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126215595","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, we present a new solution, BaitAlarm, to detect phishing attack using features that are hard to evade. The intuition of our approach is that phishing pages need to preserve the visual appearance the target pages. We present an algorithm to quantify the suspicious ratings of web pages based on similarity of visual appearance between the web pages. Since CSS is the standard technique to specify page layout, our solution uses the CSS as the basis for detecting visual similarities among web pages. We prototyped our approach as a Google Chrome extension and used it to rate the suspiciousness of web pages. The prototype shows the correctness and accuracy of our approach with a relatively low performance overhead.
{"title":"BaitAlarm: Detecting Phishing Sites Using Similarity in Fundamental Visual Features","authors":"Jian Mao, Pei Li, Kun Li, Tao Wei, Zhenkai Liang","doi":"10.1109/INCoS.2013.151","DOIUrl":"https://doi.org/10.1109/INCoS.2013.151","url":null,"abstract":"In this paper, we present a new solution, BaitAlarm, to detect phishing attack using features that are hard to evade. The intuition of our approach is that phishing pages need to preserve the visual appearance the target pages. We present an algorithm to quantify the suspicious ratings of web pages based on similarity of visual appearance between the web pages. Since CSS is the standard technique to specify page layout, our solution uses the CSS as the basis for detecting visual similarities among web pages. We prototyped our approach as a Google Chrome extension and used it to rate the suspiciousness of web pages. The prototype shows the correctness and accuracy of our approach with a relatively low performance overhead.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126221177","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 the provision of software infrastructure to support new types of pedagogically augmented collaborative learning resources by means of an innovative software platform called Virtualized Collaborative Sessions (VCS). The VCS approach helps meet challenging pedagogical requirements in online collaborative learning, such as increasing student's engagement and learning performance during the collaboration. In turn, the systematic application of the VCS platform enriched with semantic technologies enables e-learning developers to embed successful collaborative learning experiences from external learning tools in a software reuse fashion. The platform is prototyped and successfully tested in real environments, thus showing the software reuse capability and the pedagogical benefits of the VCS approach.
{"title":"Towards Software Infrastructure for the Systematic Virtualization of Collaborative Learning Sessions","authors":"D. Gañán, S. Caballé, J. Conesa","doi":"10.1109/INCOS.2013.79","DOIUrl":"https://doi.org/10.1109/INCOS.2013.79","url":null,"abstract":"This paper proposes the provision of software infrastructure to support new types of pedagogically augmented collaborative learning resources by means of an innovative software platform called Virtualized Collaborative Sessions (VCS). The VCS approach helps meet challenging pedagogical requirements in online collaborative learning, such as increasing student's engagement and learning performance during the collaboration. In turn, the systematic application of the VCS platform enriched with semantic technologies enables e-learning developers to embed successful collaborative learning experiences from external learning tools in a software reuse fashion. The platform is prototyped and successfully tested in real environments, thus showing the software reuse capability and the pedagogical benefits of the VCS approach.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125880171","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}
Jinbo Xiong, Zhiqiang Yao, Jianfeng Ma, Ximeng Liu, Qi Li
With the rapid emerging of the novelty Web services and cloud services, it becomes more and more easily to expose a user's sensitive documents into the cloud. In this paper, we combine identity-based encryption (IBE) algorithm with distributed hash table (DHT) network and propose an IBE-based secure document self-destruction (ISDS) scheme to protect the privacy security of past, archived sensitive documents, and make sure that all copies of those documents become unreadable by making them utomatically destructed after a predefined time without any human intervention. Comprehensive analysis shows that the ISDS scheme is able to resist not only traditional cryptanalysis and brute-force attack, but also Sybil attacks (e.g., hopping attack and sniffer attack) in the DHT network. More significantly, our ISDS scheme can also provide fine-grained access control during the lifetime of the sensitive documents, which is not guaranteed in other existing schemes.
{"title":"A Secure Document Self-Destruction Scheme with Identity Based Encryption","authors":"Jinbo Xiong, Zhiqiang Yao, Jianfeng Ma, Ximeng Liu, Qi Li","doi":"10.1109/INCoS.2013.42","DOIUrl":"https://doi.org/10.1109/INCoS.2013.42","url":null,"abstract":"With the rapid emerging of the novelty Web services and cloud services, it becomes more and more easily to expose a user's sensitive documents into the cloud. In this paper, we combine identity-based encryption (IBE) algorithm with distributed hash table (DHT) network and propose an IBE-based secure document self-destruction (ISDS) scheme to protect the privacy security of past, archived sensitive documents, and make sure that all copies of those documents become unreadable by making them utomatically destructed after a predefined time without any human intervention. Comprehensive analysis shows that the ISDS scheme is able to resist not only traditional cryptanalysis and brute-force attack, but also Sybil attacks (e.g., hopping attack and sniffer attack) in the DHT network. More significantly, our ISDS scheme can also provide fine-grained access control during the lifetime of the sensitive documents, which is not guaranteed in other existing schemes.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114901432","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}
P2P technologies have been considered as one of the most disruptive Internet technologies in achieving fully decentralized and efficient communication in distributed systems. Indeed, the nature of the direct communication among peers in the system, being these machines or people, makes possible to overcome the limitations of the flat communications through email, newsgroups and other forum-based communication forms. In fact, the usefulness of P2P paradigm has been shown not only in the development of stand alone P2P applications, but also in using its features in other Internet-based systems and paradigms such as Mobile Adhoc Networks (MANETs), Groupware systems, Mobile teamwork and in a broader sense in distributed systems that need coordination, replication, awareness and synchronization. In this paper we analyse the use of the P2P technologies in collaborative teamwork with a special emphasis on the mobile collaborative teams. A mobile team is a group of people that are geographically distributed and collaborate together work for the accomplishment of a project. Mobile teamwork has become an important paradigm of the today workforce especially in Small and Medium size Enterprises to cover many fields such as field work, journalism, online collaborative learning, disaster management scenarios and businesses. As a result of our analysis, we show how P2P technology as well as the core P2P functions and protocols can enhance the collaborative teamwork of various forms, including mobile teamwork.
{"title":"Analysis of P2P Communications in Online Collaborative Teamwork Settings","authors":"Vladi Koliçi, F. Xhafa, L. Barolli","doi":"10.1109/INCOS.2013.163","DOIUrl":"https://doi.org/10.1109/INCOS.2013.163","url":null,"abstract":"P2P technologies have been considered as one of the most disruptive Internet technologies in achieving fully decentralized and efficient communication in distributed systems. Indeed, the nature of the direct communication among peers in the system, being these machines or people, makes possible to overcome the limitations of the flat communications through email, newsgroups and other forum-based communication forms. In fact, the usefulness of P2P paradigm has been shown not only in the development of stand alone P2P applications, but also in using its features in other Internet-based systems and paradigms such as Mobile Adhoc Networks (MANETs), Groupware systems, Mobile teamwork and in a broader sense in distributed systems that need coordination, replication, awareness and synchronization. In this paper we analyse the use of the P2P technologies in collaborative teamwork with a special emphasis on the mobile collaborative teams. A mobile team is a group of people that are geographically distributed and collaborate together work for the accomplishment of a project. Mobile teamwork has become an important paradigm of the today workforce especially in Small and Medium size Enterprises to cover many fields such as field work, journalism, online collaborative learning, disaster management scenarios and businesses. As a result of our analysis, we show how P2P technology as well as the core P2P functions and protocols can enhance the collaborative teamwork of various forms, including mobile teamwork.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121552832","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}
A multi-bit somewhat homomorphic encryption scheme based on Learning With Errors over Rings (RLWE) assumption is provided, which use canonical embedding to transform elements over a ring into vectors, thus the operation of polynomial multiplication can be performed within O(nlog n) scalar operations, and cipher text size is reduced as well. CPA security of this scheme can be reduced into RLWE assumption. Moreover, an efficient private information retrieval protocol that employs this scheme is presented.
{"title":"RLWE-Based Homomorphic Encryption and Private Information Retrieval","authors":"Wei Zhang, Shuguang Liu, Xiaoyuan Yang","doi":"10.1109/INCoS.2013.100","DOIUrl":"https://doi.org/10.1109/INCoS.2013.100","url":null,"abstract":"A multi-bit somewhat homomorphic encryption scheme based on Learning With Errors over Rings (RLWE) assumption is provided, which use canonical embedding to transform elements over a ring into vectors, thus the operation of polynomial multiplication can be performed within O(nlog n) scalar operations, and cipher text size is reduced as well. CPA security of this scheme can be reduced into RLWE assumption. Moreover, an efficient private information retrieval protocol that employs this scheme is presented.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114275323","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 Vehicular communication networks, a robust access mechanism is essential for the successful information exchange between vehicles and roadside unit, which keeps the vehicles being aware of surroundings thus improving driving safety and reduce traffic jam. In this paper, we first analyze the drawbacks of explicit GTS (Guaranteed Time Slots) allocation suggested by IEEE 802.15.4 draft and show the importance of a wise assignment scheme and efficient scheduler especially for high dynamic vehicular environment. Then, for a given number of vehicles requesting to access the roadside unit, we propose a Time-Sensitive Weighted Round Robin scheduler (TS-WRR) considering different service delay requirements, packets arrival rates and vehicles' mobility levels. We also show the elaborate implementation procedure of TS-WRR by pseudocode. Numerical results show that our TS-WRR scheduler outperforms FCFS and WRR on the performance of transactions delay requirements guarantee and GTS utilization ratio in Vehicular Sensor Networks.
{"title":"A Delay Sensitive Time Slots Scheduling in Vehicular Sensor Networks","authors":"Chen Chen, Xiaolu Wei, Yanan Jin, Shengjin Ge","doi":"10.1109/INCoS.2013.84","DOIUrl":"https://doi.org/10.1109/INCoS.2013.84","url":null,"abstract":"In Vehicular communication networks, a robust access mechanism is essential for the successful information exchange between vehicles and roadside unit, which keeps the vehicles being aware of surroundings thus improving driving safety and reduce traffic jam. In this paper, we first analyze the drawbacks of explicit GTS (Guaranteed Time Slots) allocation suggested by IEEE 802.15.4 draft and show the importance of a wise assignment scheme and efficient scheduler especially for high dynamic vehicular environment. Then, for a given number of vehicles requesting to access the roadside unit, we propose a Time-Sensitive Weighted Round Robin scheduler (TS-WRR) considering different service delay requirements, packets arrival rates and vehicles' mobility levels. We also show the elaborate implementation procedure of TS-WRR by pseudocode. Numerical results show that our TS-WRR scheduler outperforms FCFS and WRR on the performance of transactions delay requirements guarantee and GTS utilization ratio in Vehicular Sensor Networks.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"41 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129880666","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}
Grid computing is an interesting kind of distributed computing. It has been applied to biological science, medical science, Military science, and many other fields. The participant cheating problem has been a hot topic in grid computing. However, in the existing deceptive detection schemes, the computing power of the supervisor has not been classified and discussed based on the characteristics of the computational task. Hence, these deception schemes are not very suitable for the practical applications. According to the task publisher's computing power, we will classify the deceptive detection schemes into two categories, and then analyze the security of deceptive detection schemes based on the characteristics of computational task function. On the basis of double check, we proposed an improved scheme at the cost of time sacrifice called the secondary allocation scheme of double check. In our scheme, the security of double check has been greatly strengthened. Finally, we analyzed the common problem of High-value rare Events, improved the deceptive detection scheme due to Du et al. [1], and then put forward a new deceptive detection scheme with better security and efficiency.
{"title":"Deceptive Detection and Security Reinforcement in Grid Computing","authors":"Jianhua Yu, Y. Luo, Xueli Wang","doi":"10.1109/INCoS.2013.30","DOIUrl":"https://doi.org/10.1109/INCoS.2013.30","url":null,"abstract":"Grid computing is an interesting kind of distributed computing. It has been applied to biological science, medical science, Military science, and many other fields. The participant cheating problem has been a hot topic in grid computing. However, in the existing deceptive detection schemes, the computing power of the supervisor has not been classified and discussed based on the characteristics of the computational task. Hence, these deception schemes are not very suitable for the practical applications. According to the task publisher's computing power, we will classify the deceptive detection schemes into two categories, and then analyze the security of deceptive detection schemes based on the characteristics of computational task function. On the basis of double check, we proposed an improved scheme at the cost of time sacrifice called the secondary allocation scheme of double check. In our scheme, the security of double check has been greatly strengthened. Finally, we analyzed the common problem of High-value rare Events, improved the deceptive detection scheme due to Du et al. [1], and then put forward a new deceptive detection scheme with better security and efficiency.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128127611","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}
Based signatures (ABS for short) allow an entity to sign messages with a fine-grained control over identity information. The signature attests not to the identity of the individual who endorsed a message, but instead to a claim regarding the attributes he/she holds. ABS has been well investigated since its introduction but little has been done on the revocation in ABS. In this paper, we divide ABS revocation as fine-grained attribute-revocation and coarse-grained user-revocation. The latter is the focus of this paper, and we present a concrete design-to address the issue of coarse-grained user-revocation in ABS without the need of any other third parties.
{"title":"Attribute-Based Signatures with Efficient Revocation","authors":"Yanling Lian, Li Xu, Xinyi Huang","doi":"10.1109/INCoS.2013.106","DOIUrl":"https://doi.org/10.1109/INCoS.2013.106","url":null,"abstract":"Based signatures (ABS for short) allow an entity to sign messages with a fine-grained control over identity information. The signature attests not to the identity of the individual who endorsed a message, but instead to a claim regarding the attributes he/she holds. ABS has been well investigated since its introduction but little has been done on the revocation in ABS. In this paper, we divide ABS revocation as fine-grained attribute-revocation and coarse-grained user-revocation. The latter is the focus of this paper, and we present a concrete design-to address the issue of coarse-grained user-revocation in ABS without the need of any other third parties.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114636013","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, Navigation systems have become very popular and necessary for travelers from all around the world. Navigation systems give travelers all the information they need and guide them quickly and comfortably to get to the destination. Pre-trip planning regarding road and traffic conditions can enhance driver's knowledge of the situation in road networks and can assist in drivers' decisions concerning routes and departure times. Many factors such as the route density, traffic volume, departure time, destination, workday, working time, holiday period, tournaments and events are important to find the best route under the criterion. In this paper presented two new models with the purpose of recommending travelers the best route to destination. These two models are the multivariate class exploration and route guidance models. The multivariate class exploration model analyzes the network-flow patterns in order to investigate some important factors such as demand conditions, compliance with information, speed and variance of travel-time and calculate a travel-time reduction. A route guidance model was used to find efficient routes (minimizing travel time) for traveling. This paper conducted experiments on a real-world dataset collected from the OpenStreetMap. The accuracy of the proposed model's predictions was determined. The results show that the predictions given by the models are accurate and can be used in real-life situations.
{"title":"Simulation of the Adaptive Multivariate Exploration for Routes Guidance","authors":"W. Romsaiyud","doi":"10.1109/INCoS.2013.19","DOIUrl":"https://doi.org/10.1109/INCoS.2013.19","url":null,"abstract":"Nowadays, Navigation systems have become very popular and necessary for travelers from all around the world. Navigation systems give travelers all the information they need and guide them quickly and comfortably to get to the destination. Pre-trip planning regarding road and traffic conditions can enhance driver's knowledge of the situation in road networks and can assist in drivers' decisions concerning routes and departure times. Many factors such as the route density, traffic volume, departure time, destination, workday, working time, holiday period, tournaments and events are important to find the best route under the criterion. In this paper presented two new models with the purpose of recommending travelers the best route to destination. These two models are the multivariate class exploration and route guidance models. The multivariate class exploration model analyzes the network-flow patterns in order to investigate some important factors such as demand conditions, compliance with information, speed and variance of travel-time and calculate a travel-time reduction. A route guidance model was used to find efficient routes (minimizing travel time) for traveling. This paper conducted experiments on a real-world dataset collected from the OpenStreetMap. The accuracy of the proposed model's predictions was determined. The results show that the predictions given by the models are accurate and can be used in real-life situations.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117242277","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
扫码关注我们
求助内容：
应助结果提醒方式：