Pub Date : 2014-12-01DOI: 10.1109/CCIOT.2014.7062516
Y. Xiao, Shangping Zhong
Online multiple kernel classification(OMKC) algorithm is a promising algorithm in machine learning. Because of low error rate and relatively fast training time, it has been sucessfully applied to many real-world problems. However, in the phase of learning a single classifier for a given kernel, the OMKC adopts the perceptron algorithm, which significantly limits the performance of the algorithm. In this paper, we adopts the double updating online learning(DUOL) algorithm to learn the single classifier. Comparing to the perceptron algorithm, the DUOL algorithm not only assigns a weight to the misclassified example, but also updates the weight for one of the existing support vectors, which significantly improves the classification performance. Then we use the hedge algorithm to combines these classifiers. The experimental results show that the proposed algorithm is more effective than the OMKC algorithm, the state-of-the-art algorithms, and single kernel learning algorithm.
{"title":"An improved online multiple kernel classification algorithm based on double updating online learning","authors":"Y. Xiao, Shangping Zhong","doi":"10.1109/CCIOT.2014.7062516","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062516","url":null,"abstract":"Online multiple kernel classification(OMKC) algorithm is a promising algorithm in machine learning. Because of low error rate and relatively fast training time, it has been sucessfully applied to many real-world problems. However, in the phase of learning a single classifier for a given kernel, the OMKC adopts the perceptron algorithm, which significantly limits the performance of the algorithm. In this paper, we adopts the double updating online learning(DUOL) algorithm to learn the single classifier. Comparing to the perceptron algorithm, the DUOL algorithm not only assigns a weight to the misclassified example, but also updates the weight for one of the existing support vectors, which significantly improves the classification performance. Then we use the hedge algorithm to combines these classifiers. The experimental results show that the proposed algorithm is more effective than the OMKC algorithm, the state-of-the-art algorithms, and single kernel learning algorithm.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115368000","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}
Pub Date : 2014-12-01DOI: 10.1109/CCIOT.2014.7062528
H. Lv, X. Xia, Z. Hua, Yong-Lin Yu
Power distribution room is the key position of the power supply system, it is very important to monitor power distribution room and real time warning in order to ensure the normal power supply. A design of a detection system based on Zig Bee wireless sensor network, the hardware based on CC2530, software development based on Zig Bee. Designing a novel microstrip antenna because of the harmonic interference of power distribution room and serious reflection of equipment. The antenna has the characteristics of good omnidirectional, small echo loss, high gain, small volume etc. Experiments show that it can real time monitor every node which can effectively transmit and receive data.
{"title":"Researching the key technologies of wireless sensor network node in power distribution room status monitoring","authors":"H. Lv, X. Xia, Z. Hua, Yong-Lin Yu","doi":"10.1109/CCIOT.2014.7062528","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062528","url":null,"abstract":"Power distribution room is the key position of the power supply system, it is very important to monitor power distribution room and real time warning in order to ensure the normal power supply. A design of a detection system based on Zig Bee wireless sensor network, the hardware based on CC2530, software development based on Zig Bee. Designing a novel microstrip antenna because of the harmonic interference of power distribution room and serious reflection of equipment. The antenna has the characteristics of good omnidirectional, small echo loss, high gain, small volume etc. Experiments show that it can real time monitor every node which can effectively transmit and receive data.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131241677","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}
Pub Date : 2014-12-01DOI: 10.1109/CCIOT.2014.7062498
Zongmin Cui, Hong Zhu, Jing Yu
Existing key distribution scheme based on key derivation has security default in cloud scenarios. The scheme distributes decryption keys to users through tags stored on cloud server. If the tag is destroyed by cloud server intentionally or unintentionally, the key distribution is destroyed too. Besides the above case, if all related tags are stored on client operated by user, the storage burden is high. To eliminate the insecurity of key distribution, we propose a novel solution based on tag derivation. In our scheme, each user needs to manage a single key and tag. Through the two information, the user can compute all authorized keys without using any information stored on cloud server. That is, our key distribution scheme is unrelated to cloud server to enhance the security of key distribution. The experiment results show that the performance of our method is better than existing methods in key distribution and query.
{"title":"Secure management of key distribution in cloud scenarios","authors":"Zongmin Cui, Hong Zhu, Jing Yu","doi":"10.1109/CCIOT.2014.7062498","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062498","url":null,"abstract":"Existing key distribution scheme based on key derivation has security default in cloud scenarios. The scheme distributes decryption keys to users through tags stored on cloud server. If the tag is destroyed by cloud server intentionally or unintentionally, the key distribution is destroyed too. Besides the above case, if all related tags are stored on client operated by user, the storage burden is high. To eliminate the insecurity of key distribution, we propose a novel solution based on tag derivation. In our scheme, each user needs to manage a single key and tag. Through the two information, the user can compute all authorized keys without using any information stored on cloud server. That is, our key distribution scheme is unrelated to cloud server to enhance the security of key distribution. The experiment results show that the performance of our method is better than existing methods in key distribution and query.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133986880","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}
Pub Date : 2014-12-01DOI: 10.1109/CCIOT.2014.7062522
S. R. Bhagya Shree, H. S. Sheshadri
The number of people surviving in older age is more. This is mainly due to the developments that have taken place in the field of medicine. Theseold people are prone to many age related diseases. There are numerous neuro degenerative brain related diseases. Dementia is one among them. The people affected by Dementia will have lapse of memory. Alzheimer's disease is one of the types of dementia. Diagnosis of the disease is a time consuming task. To reduce the time needed for diagnosis the medical practitioners use system based approach. To help the practitioners researchers have developed various tools and techniques. In this paper the authors focus on classifications of subjects as diseased or not. Before doing classification the data has to be preprocessed. Preprocessing of data is done by applying techniques such as preparation of data, selection of attributes, balancing data, model evaluation and feature selection etc.The authors have collected the data of 466 subjects. The preprocessing techniques are applied on the data set. The subjects are classified using Naïve bayes and J48. The accuracy of the classifications are compared and Naïve bayes is found better.
{"title":"An approach to preprocess data in the diagnosis of Alzheimer's disease","authors":"S. R. Bhagya Shree, H. S. Sheshadri","doi":"10.1109/CCIOT.2014.7062522","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062522","url":null,"abstract":"The number of people surviving in older age is more. This is mainly due to the developments that have taken place in the field of medicine. Theseold people are prone to many age related diseases. There are numerous neuro degenerative brain related diseases. Dementia is one among them. The people affected by Dementia will have lapse of memory. Alzheimer's disease is one of the types of dementia. Diagnosis of the disease is a time consuming task. To reduce the time needed for diagnosis the medical practitioners use system based approach. To help the practitioners researchers have developed various tools and techniques. In this paper the authors focus on classifications of subjects as diseased or not. Before doing classification the data has to be preprocessed. Preprocessing of data is done by applying techniques such as preparation of data, selection of attributes, balancing data, model evaluation and feature selection etc.The authors have collected the data of 466 subjects. The preprocessing techniques are applied on the data set. The subjects are classified using Naïve bayes and J48. The accuracy of the classifications are compared and Naïve bayes is found better.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117222560","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}
Pub Date : 2014-12-01DOI: 10.1109/CCIOT.2014.7062509
A. T. Wan, S. Sankaranarayanan, Siti Nurafifah Binti Sait
Prepaid meter (PM) is getting very popular especially in developing countries. There are many advantages to use prepaid meter as opposed to postpaid meter both to the utility provider and to the consumer. Brunei Darussalam has adopted PM but it is not intelligent and not wireless enabled. Reading meters and topping up balance are still done manually. Utility provider does not have information on the usage statistics and has only limited functionalities in the grid control. So accordingly a novel software agent based wireless prepaid energy meter was developed using Java Agent Development Environment (JADE-LEAP) allowing agent from utility provider to query wireless energy meter for energy values of every household. These statistics can be used for statistical computation of the power consumed and for policy and future planning.
预付费电表(PM)在发展中国家越来越受欢迎。对于公用事业供应商和消费者来说，使用预付费电表与后付费电表相比有许多优点。文莱达鲁萨兰国已经采用了PM，但它不是智能的，也没有无线功能。读数仪表和补充平衡仍然是手动完成的。实用程序提供程序没有关于使用统计信息的信息，并且在网格控件中只有有限的功能。为此，利用Java agent Development Environment (JADE-LEAP)开发了一种新型的基于软件代理的无线预付费电能表，使公用事业单位的代理能够查询无线电能表中每户的电能值。这些统计数据可用于对所消耗的电力进行统计计算，并用于策略和未来规划。
{"title":"Smart agent based prepaid wireless energy meter","authors":"A. T. Wan, S. Sankaranarayanan, Siti Nurafifah Binti Sait","doi":"10.1109/CCIOT.2014.7062509","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062509","url":null,"abstract":"Prepaid meter (PM) is getting very popular especially in developing countries. There are many advantages to use prepaid meter as opposed to postpaid meter both to the utility provider and to the consumer. Brunei Darussalam has adopted PM but it is not intelligent and not wireless enabled. Reading meters and topping up balance are still done manually. Utility provider does not have information on the usage statistics and has only limited functionalities in the grid control. So accordingly a novel software agent based wireless prepaid energy meter was developed using Java Agent Development Environment (JADE-LEAP) allowing agent from utility provider to query wireless energy meter for energy values of every household. These statistics can be used for statistical computation of the power consumed and for policy and future planning.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115871208","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}
Pub Date : 2014-12-01DOI: 10.1109/CCIOT.2014.7062501
Shuang Jiang, Hao-peng Chen, Fei Hu
With the development of cloud computing technics, an increasing number of applications prefer to be deployed in cloud. Load balancing becomes the key technicfor cloud provider to control the resources and cost. But using load balancing with real time data cannot react in time towards workload peak or valley. Thus, workload forecasting is presented to let the cloud provider to get ready for a possible workload change. There are already many kinds of predicting methods. In this article, we study the workload of applications in cloud and propose a workload forecasting framework. This framework monitors workloads of applications in real time, processes the data, and provides feedback of the predicted workload value according to historical data,guiding the cloudprovider to allocate resources.
{"title":"Workload forecasting framework for applications in cloud","authors":"Shuang Jiang, Hao-peng Chen, Fei Hu","doi":"10.1109/CCIOT.2014.7062501","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062501","url":null,"abstract":"With the development of cloud computing technics, an increasing number of applications prefer to be deployed in cloud. Load balancing becomes the key technicfor cloud provider to control the resources and cost. But using load balancing with real time data cannot react in time towards workload peak or valley. Thus, workload forecasting is presented to let the cloud provider to get ready for a possible workload change. There are already many kinds of predicting methods. In this article, we study the workload of applications in cloud and propose a workload forecasting framework. This framework monitors workloads of applications in real time, processes the data, and provides feedback of the predicted workload value according to historical data,guiding the cloudprovider to allocate resources.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127647565","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}
Pub Date : 2014-12-01DOI: 10.1109/CCIOT.2014.7062520
Lin Zhu, Kai-Zhao Zheng
In distributed routing algorithms, Kademlia is the most widely used. Its slow routing table updating, load imbalance and weaknesses in network adapter has become increasingly evident. This paper introduces one type of Kademlia Algorithm based on Qos. Through simulation experiments, this algorithm is proved to be more efficient than the traditional algorithm in appropriate circumstance.
{"title":"An improved Kademlia algorithm based on Qos","authors":"Lin Zhu, Kai-Zhao Zheng","doi":"10.1109/CCIOT.2014.7062520","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062520","url":null,"abstract":"In distributed routing algorithms, Kademlia is the most widely used. Its slow routing table updating, load imbalance and weaknesses in network adapter has become increasingly evident. This paper introduces one type of Kademlia Algorithm based on Qos. Through simulation experiments, this algorithm is proved to be more efficient than the traditional algorithm in appropriate circumstance.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132315693","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}
Pub Date : 2014-12-01DOI: 10.1109/CCIOT.2014.7062512
Qiao Zhu, Li Miao
Hadoop has been successful at harnessing expansive data-centers resources for large-scale data analysis. However, their effect on data-centers energy efficiency has not scrutinized completely. The energy consumption of Hadoop Distributed File System in data-centers accounts for a great part of total cost of ownership and disk is the main storage media for clusters. Analysis of the interactions between clusters with disks when running a Hadoop application showed a disk idle time when shuffle to memory, which can be used to guide a simple green storage algorithm for Hadoop cluster. The algorithm simulation results with Terasort for 10G data in a cluster with 11 nodes can save 2.47WH.
{"title":"The realization of green storage in Hadoop","authors":"Qiao Zhu, Li Miao","doi":"10.1109/CCIOT.2014.7062512","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062512","url":null,"abstract":"Hadoop has been successful at harnessing expansive data-centers resources for large-scale data analysis. However, their effect on data-centers energy efficiency has not scrutinized completely. The energy consumption of Hadoop Distributed File System in data-centers accounts for a great part of total cost of ownership and disk is the main storage media for clusters. Analysis of the interactions between clusters with disks when running a Hadoop application showed a disk idle time when shuffle to memory, which can be used to guide a simple green storage algorithm for Hadoop cluster. The algorithm simulation results with Terasort for 10G data in a cluster with 11 nodes can save 2.47WH.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127105427","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}
Pub Date : 2014-12-01DOI: 10.1109/CCIOT.2014.7062502
A. A. Memon, Chengliang Wang, M. Naeem, Muhammad Aamir, M. Ayoob
The main responsibility and duty of government employees is to serve the nation. We have proposed a combination of cloud computing solution and data mining to the third world countries to better serve the nations. We have focused data/statistics gathered from Pakistan as exemplary data. There are four provincial governments of Pakistan headed by the Chief Ministers and ministries/departments are headed by the ministers/department heads. Having the up to date and accurate information on finger tips is headache for the stakeholders as the existing system is manual (Paper) work. The main objective of the proposed solution is to provide the up to date and accurate information (knowledge) to the stakeholders on their finger tips providing them a dashboard displaying the information with the drill down/up facility to get information of the own will. The proposed solution is intended to be used by the governments of third world countries to better serve the nations. However; the proposed solution is quite in general and can be easily adopted by the private organizations currently using individual information systems at different locations.
{"title":"Cloud government- a proposed solution to better serve the nation","authors":"A. A. Memon, Chengliang Wang, M. Naeem, Muhammad Aamir, M. Ayoob","doi":"10.1109/CCIOT.2014.7062502","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062502","url":null,"abstract":"The main responsibility and duty of government employees is to serve the nation. We have proposed a combination of cloud computing solution and data mining to the third world countries to better serve the nations. We have focused data/statistics gathered from Pakistan as exemplary data. There are four provincial governments of Pakistan headed by the Chief Ministers and ministries/departments are headed by the ministers/department heads. Having the up to date and accurate information on finger tips is headache for the stakeholders as the existing system is manual (Paper) work. The main objective of the proposed solution is to provide the up to date and accurate information (knowledge) to the stakeholders on their finger tips providing them a dashboard displaying the information with the drill down/up facility to get information of the own will. The proposed solution is intended to be used by the governments of third world countries to better serve the nations. However; the proposed solution is quite in general and can be easily adopted by the private organizations currently using individual information systems at different locations.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129236439","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}
Pub Date : 2014-12-01DOI: 10.1109/CCIOT.2014.7062525
Yabo Yuan, Yi Liu, Bin Wu
To solve the problem that the ant colony algorithm is easy to fall into local optimal solutions in solving the shortest path problem, improvements on the classical ant colony algorithm are provided in three aspects. Firstly, direction guiding is utilized in the initial pheromone concentration to speed up the initial convergence; secondly, the idea of pheromone redistribution is added to the pheromone partial renewal process in order to prevent the optimal path pheromone concentration from being over-damped by the path pheromone decay process; finally, a dynamic factor is invited to the global renewal process to adaptively update the pheromone concentration on the optimal path, in which way the global searching ability is improved. The results of the simulation experiment show that this modified algorithm can greatly increase the probability of finding the optimal path while guaranteeing the convergence speed.
{"title":"A modified ant colony algorithm to solve the shortest path problem","authors":"Yabo Yuan, Yi Liu, Bin Wu","doi":"10.1109/CCIOT.2014.7062525","DOIUrl":"https://doi.org/10.1109/CCIOT.2014.7062525","url":null,"abstract":"To solve the problem that the ant colony algorithm is easy to fall into local optimal solutions in solving the shortest path problem, improvements on the classical ant colony algorithm are provided in three aspects. Firstly, direction guiding is utilized in the initial pheromone concentration to speed up the initial convergence; secondly, the idea of pheromone redistribution is added to the pheromone partial renewal process in order to prevent the optimal path pheromone concentration from being over-damped by the path pheromone decay process; finally, a dynamic factor is invited to the global renewal process to adaptively update the pheromone concentration on the optimal path, in which way the global searching ability is improved. The results of the simulation experiment show that this modified algorithm can greatly increase the probability of finding the optimal path while guaranteeing the convergence speed.","PeriodicalId":255477,"journal":{"name":"Proceedings of 2014 International Conference on Cloud Computing and Internet of Things","volume":"579 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115222831","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
扫码关注我们
求助内容：
应助结果提醒方式：