Nowadays, mining approximate frequent itemsets from noisy data has attracted much attention in real applications. However, there is not widely accepted algorithm at present to solve the problem under noisy databases, which dues to two key issues. Firstly, the anti-monotonicity property does not hold which is used to prune candidate itemsets efficiently. And secondly, the computation of support counting turns out to be NP-hard. In this paper, we propose a novel model which is based on rough set theory and capable to recover the noise-tolerant frequent itemsets from "reduced itemsets". The novel model applies depth-first growing method to generate candidate itemsets and exerts effective pruning strategies, which narrows the searching space and mines indeed meaningful noise-tolerant frequent itemsets efficiently.
{"title":"A Model of Mining Noise-Tolerant Frequent Itemset in Transactional Databases","authors":"Xiaomei Yu, Hong Wang, Xiangwei Zheng, Shuang Liu","doi":"10.1109/INCoS.2015.87","DOIUrl":"https://doi.org/10.1109/INCoS.2015.87","url":null,"abstract":"Nowadays, mining approximate frequent itemsets from noisy data has attracted much attention in real applications. However, there is not widely accepted algorithm at present to solve the problem under noisy databases, which dues to two key issues. Firstly, the anti-monotonicity property does not hold which is used to prune candidate itemsets efficiently. And secondly, the computation of support counting turns out to be NP-hard. In this paper, we propose a novel model which is based on rough set theory and capable to recover the noise-tolerant frequent itemsets from \"reduced itemsets\". The novel model applies depth-first growing method to generate candidate itemsets and exerts effective pruning strategies, which narrows the searching space and mines indeed meaningful noise-tolerant frequent itemsets efficiently.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122399420","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}
Chosen ciphertext security (CCA security) is a very important security notion for public key encryption. Until now, there are numerous ways to construct CCA secure public key encryption (PKE) or key encapsulation mechanism (KEM) schemes. In this paper, we propose a new CCA secure Elgmal scheme, which is proved secure in the random oracle based on the CDH assumption, has almost no additional overhead compared with the traditional IND-CPA secure Elgamal scheme, except one more modular exponentiation for the decryption. To the best of our knowledge, this is the first scheme which runs almost like the basic Elgsmal scheme but with CCA security.
{"title":"New Compact CCA Secure Elgamal Scheme in the Random Oracle Model","authors":"Xu An Wang, Jianfeng Ma, Xiaoyuan Yang","doi":"10.1109/INCoS.2015.41","DOIUrl":"https://doi.org/10.1109/INCoS.2015.41","url":null,"abstract":"Chosen ciphertext security (CCA security) is a very important security notion for public key encryption. Until now, there are numerous ways to construct CCA secure public key encryption (PKE) or key encapsulation mechanism (KEM) schemes. In this paper, we propose a new CCA secure Elgmal scheme, which is proved secure in the random oracle based on the CDH assumption, has almost no additional overhead compared with the traditional IND-CPA secure Elgamal scheme, except one more modular exponentiation for the decryption. To the best of our knowledge, this is the first scheme which runs almost like the basic Elgsmal scheme but with CCA security.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122672070","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}
Problems associated with seeking the lowest cost vehicle routes to deliver demand to customers are called Vehicle Routing Problems (VRPs). Over the last decades, increasing research efforts are being dedicated to handle the VRPs. Most of the solution approaches have been metaheuristics, such as the evolutionary algorithms (EAs). This paper proposes a new EA (EAPX) based on Partition Crossover (PX), a recombination operator proposed by Whitley et al., which demonstrated very good performance in solving the Traveling Salesman Problem (TSP). PX strength lies in the characteristic of tunneling between local optima: if the parents are both local optima, with a high probability PX will generate two local optima offspring. Experimentations show that EAPX is competitive with the existing solution approaches.
{"title":"Evolutionary Algorithm Based on Partition Crossover (EAPX) for the Vehicle Routing Problem","authors":"Takwa Tlili, F. Chicano, S. Krichen, E. Alba","doi":"10.1109/INCoS.2015.89","DOIUrl":"https://doi.org/10.1109/INCoS.2015.89","url":null,"abstract":"Problems associated with seeking the lowest cost vehicle routes to deliver demand to customers are called Vehicle Routing Problems (VRPs). Over the last decades, increasing research efforts are being dedicated to handle the VRPs. Most of the solution approaches have been metaheuristics, such as the evolutionary algorithms (EAs). This paper proposes a new EA (EAPX) based on Partition Crossover (PX), a recombination operator proposed by Whitley et al., which demonstrated very good performance in solving the Traveling Salesman Problem (TSP). PX strength lies in the characteristic of tunneling between local optima: if the parents are both local optima, with a high probability PX will generate two local optima offspring. Experimentations show that EAPX is competitive with the existing solution approaches.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115330905","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 discuss a method to define semi-automatically fuzzy partition rules to provide a powerful and accurate insight into cardiac arrhythmia. As suggested by our evaluation, this provide a robust, scalable, and accurate system, which can successfully tackle the challenges posed by the utilization of big data in the medical sector.
{"title":"Fuzzy Partition Rules for Heart Arrhythmia Detection","authors":"Omar Behadada","doi":"10.1109/INCoS.2015.50","DOIUrl":"https://doi.org/10.1109/INCoS.2015.50","url":null,"abstract":"In this paper, we discuss a method to define semi-automatically fuzzy partition rules to provide a powerful and accurate insight into cardiac arrhythmia. As suggested by our evaluation, this provide a robust, scalable, and accurate system, which can successfully tackle the challenges posed by the utilization of big data in the medical sector.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121886602","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 presents a concept of an extended iBeacon system for indoor navigation and guidance. iBeacon is a proximal wireless notification service proposed by Apple, Inc. This service uses beacon modules emitting radio waves based on Bluetooth Low Energy technology and provides automatic triggering of a single notification from a beacon module to multiple smartphones at proximity. In usual iBeacon systems, there is one-to-one correspondence between notification and beacon module. However, if we introduce a memory to remember the history of iBeacon detection, iBeacon systems can be extended to handle multiple notifications by multiple beacon modules with awareness of some contexts of pedestrians' moving directions, which enables a guide, for example, to the exit of buildings. We explain this idea for indoor route guidance using iBeacon and discuss its implementation with our simple experiment and performance evaluation.
{"title":"Proposing an Extended iBeacon System for Indoor Route Guidance","authors":"A. Fujihara, Takuma Yanagizawa","doi":"10.1109/INCoS.2015.72","DOIUrl":"https://doi.org/10.1109/INCoS.2015.72","url":null,"abstract":"This paper presents a concept of an extended iBeacon system for indoor navigation and guidance. iBeacon is a proximal wireless notification service proposed by Apple, Inc. This service uses beacon modules emitting radio waves based on Bluetooth Low Energy technology and provides automatic triggering of a single notification from a beacon module to multiple smartphones at proximity. In usual iBeacon systems, there is one-to-one correspondence between notification and beacon module. However, if we introduce a memory to remember the history of iBeacon detection, iBeacon systems can be extended to handle multiple notifications by multiple beacon modules with awareness of some contexts of pedestrians' moving directions, which enables a guide, for example, to the exit of buildings. We explain this idea for indoor route guidance using iBeacon and discuss its implementation with our simple experiment and performance evaluation.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"511 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115343906","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}
M. Gaeta, Antonio Marzano, Sergio Miranda, K. Sandkuhl
In public and local administration contexts, the organizational structures depend on bureaucratic aspects. This often implies that people are engaged in offices and their allocation come from emergencies and political factors instead of rational motivations related to knowledge, competences and profiles. In most cases, such situations become gangrenous and generate dissatisfaction and low productivity. The objective of our work is applying competence management, skill gap analysis and a study of the existing organizational structures to point out the functional unit with the most critical situation in terms of allocated employees and to suggest a solution according to the complex laws, internal regulation for the staff management and trade-union influences. The proposed approach identifies the real gaps that create inefficiencies and suggests the people to engage in learning programs by focusing exactly on what the organizations need with respect to what the employees have. It happens by elaborating a priority scale on the base of existing hierarchies, relationships, logistic constraints and other aspects with the aim, above all, of enhancing the identified unit and the local administration itself.
{"title":"A Smart Competence-Based Prioritisation for Learning Programmes","authors":"M. Gaeta, Antonio Marzano, Sergio Miranda, K. Sandkuhl","doi":"10.1109/INCoS.2015.61","DOIUrl":"https://doi.org/10.1109/INCoS.2015.61","url":null,"abstract":"In public and local administration contexts, the organizational structures depend on bureaucratic aspects. This often implies that people are engaged in offices and their allocation come from emergencies and political factors instead of rational motivations related to knowledge, competences and profiles. In most cases, such situations become gangrenous and generate dissatisfaction and low productivity. The objective of our work is applying competence management, skill gap analysis and a study of the existing organizational structures to point out the functional unit with the most critical situation in terms of allocated employees and to suggest a solution according to the complex laws, internal regulation for the staff management and trade-union influences. The proposed approach identifies the real gaps that create inefficiencies and suggests the people to engage in learning programs by focusing exactly on what the organizations need with respect to what the employees have. It happens by elaborating a priority scale on the base of existing hierarchies, relationships, logistic constraints and other aspects with the aim, above all, of enhancing the identified unit and the local administration itself.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122604680","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}
Shaimaa A. El-said, T. Gaber, A. Tharwat, A. Hassanien, V. Snás̃el
Starting from the last century, animals identification became important for several purposes, e.g. tracking, controlling livestock transaction, and illness control. Invasive and traditional ways used to achieve such animal identification in farms or laboratories. To avoid such invasiveness and to get more accurate identification results, biometric identification methods have appeared. This paper presents an invariant biometric-based identification system to identify cattle based on their muzzle print images. This system makes use of Speeded Up Robust Feature (SURF) features extraction technique along with with minimum distance and Support Vector Machine (SVM) classifiers. The proposed system targets to get best accuracy using minimum number of SURF interest points, which minimizes the time needed for the system to complete an accurate identification. It also compares between the accuracy gained from SURF features through different classifiers. The experiments run 217 muzzle print images and the experimental results showed that our proposed approach achieved an excellent identification rate compared with other previous works.
{"title":"Muzzle-Based Cattle Identification Using Speed up Robust Feature Approach","authors":"Shaimaa A. El-said, T. Gaber, A. Tharwat, A. Hassanien, V. Snás̃el","doi":"10.1109/INCoS.2015.60","DOIUrl":"https://doi.org/10.1109/INCoS.2015.60","url":null,"abstract":"Starting from the last century, animals identification became important for several purposes, e.g. tracking, controlling livestock transaction, and illness control. Invasive and traditional ways used to achieve such animal identification in farms or laboratories. To avoid such invasiveness and to get more accurate identification results, biometric identification methods have appeared. This paper presents an invariant biometric-based identification system to identify cattle based on their muzzle print images. This system makes use of Speeded Up Robust Feature (SURF) features extraction technique along with with minimum distance and Support Vector Machine (SVM) classifiers. The proposed system targets to get best accuracy using minimum number of SURF interest points, which minimizes the time needed for the system to complete an accurate identification. It also compares between the accuracy gained from SURF features through different classifiers. The experiments run 217 muzzle print images and the experimental results showed that our proposed approach achieved an excellent identification rate compared with other previous works.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124715191","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 presents a system able to generate an abstraction framework over a RDF-based, semantic triplestore, offering Object-Oriented Application Programming Interfaces to be made available for external applications. The system only requires a well-defined RDF schema and a minimal supervision by the user, and is able to produce all of the components of the API framework at their different layers, ranging from data source classes up to higher-level modules in terms of web service interfaces, in order to provide CRUD operations over the underlying semantic data. The system is sufficiently generic to accept any RDF repository with its schema as input, and can be easily configured to fine-tune the automatic generation of the API components to suit the needs of specific applications. The system has been deployed and tested on top of a large semantic repository featuring a schema where multiple real-world conceptualizations are defined, including one representing a learning model specifically designed for advanced e-learning management platforms.
{"title":"Semi-automatic Generation of an Object-Oriented API Framework over Semantic Repositories","authors":"Daniele Toti, Marco Rinelli","doi":"10.1109/INCoS.2015.22","DOIUrl":"https://doi.org/10.1109/INCoS.2015.22","url":null,"abstract":"This paper presents a system able to generate an abstraction framework over a RDF-based, semantic triplestore, offering Object-Oriented Application Programming Interfaces to be made available for external applications. The system only requires a well-defined RDF schema and a minimal supervision by the user, and is able to produce all of the components of the API framework at their different layers, ranging from data source classes up to higher-level modules in terms of web service interfaces, in order to provide CRUD operations over the underlying semantic data. The system is sufficiently generic to accept any RDF repository with its schema as input, and can be easily configured to fine-tune the automatic generation of the API components to suit the needs of specific applications. The system has been deployed and tested on top of a large semantic repository featuring a schema where multiple real-world conceptualizations are defined, including one representing a learning model specifically designed for advanced e-learning management platforms.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124812626","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}
T. Gaber, A. Tharwat, Abdelhameed Ibrahim, V. Snás̃el, A. Hassanien
This paper proposes a human thermal face recognitionapproach with two variants based on Random linearOracle (RLO) ensembles. For the two approaches, the Segmentation-based Fractal Texture Analysis (SFTA) algorithmwas used for extracting features and the RLO ensembleclassifier was used for recognizing the face from its thermalimage. For the dimensionality reduction, one variant (SFTALDA-RLO) was used the technique of Linear DiscriminantAnalysis (LDA) while the other variant (SFTA-PCA-RLO) wasused the Principal Component Analysis (PCA). The classifier'smodel was built using the RLO classifier during the trainingphase and in the testing phase then this model was usedto identify the unknown sample images. The two variantswere evaluated using the Terravic Facial IR Database and theexperimental results showed that the two variants achieved agood recognition rate at 94.12% which is better than related work.
{"title":"Human Thermal Face Recognition Based on Random Linear Oracle (RLO) Ensembles","authors":"T. Gaber, A. Tharwat, Abdelhameed Ibrahim, V. Snás̃el, A. Hassanien","doi":"10.1109/INCoS.2015.67","DOIUrl":"https://doi.org/10.1109/INCoS.2015.67","url":null,"abstract":"This paper proposes a human thermal face recognitionapproach with two variants based on Random linearOracle (RLO) ensembles. For the two approaches, the Segmentation-based Fractal Texture Analysis (SFTA) algorithmwas used for extracting features and the RLO ensembleclassifier was used for recognizing the face from its thermalimage. For the dimensionality reduction, one variant (SFTALDA-RLO) was used the technique of Linear DiscriminantAnalysis (LDA) while the other variant (SFTA-PCA-RLO) wasused the Principal Component Analysis (PCA). The classifier'smodel was built using the RLO classifier during the trainingphase and in the testing phase then this model was usedto identify the unknown sample images. The two variantswere evaluated using the Terravic Facial IR Database and theexperimental results showed that the two variants achieved agood recognition rate at 94.12% which is better than related work.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133445265","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}
With the rapid popularization of mobile smartphone and its built-in location-aware devices, people are possible to establish trust relationships with each other by matching their interests, hobbies, experiences, or spatiotemporal profiles. However, the contradiction between the possibility of personal sensitive information leaking and the growing privacy concerns of users restricts the widespread use of direct matching schemes. To addressthis problem, lots of privacy-preserving matching schemes were proposed recently years. These schemes ensure users find the perfect matcher(s) without revealing extra unnecessary personal information. And yet, at the same time, it is inevitable that they produce more computation amount and communication traffic compare with former direct matching schemes. For mobile application scenarios, it is a heavy burden since power is limited. Particularly, for spatiotemporal matching, the situation is much worse due to the number of elements in users' spatiotemporal profiles will be very large as time goes on. Another outstanding issue in spatiotemporal matching is that how to define two users are neighboring. So, how to achieve an efficient and exactly privacy-preserving spatiotemporal matching remains an open question. In this paper, we propose a fine-grained privacypreserving spatiotemporal matching in Mobile Social Networks. Our scheme decreases the spatiotemporal matching error, as well as promotes the efficiency of matchmaking. Thorough security analysis and evaluation results indicate that our scheme is effective and efficient.
{"title":"Fine-Grained Privacy-Preserving Spatiotemporal Matching in Mobile Social Networks","authors":"Xiuguang Li, Kai Yang, Hui Li","doi":"10.1109/INCoS.2015.73","DOIUrl":"https://doi.org/10.1109/INCoS.2015.73","url":null,"abstract":"With the rapid popularization of mobile smartphone and its built-in location-aware devices, people are possible to establish trust relationships with each other by matching their interests, hobbies, experiences, or spatiotemporal profiles. However, the contradiction between the possibility of personal sensitive information leaking and the growing privacy concerns of users restricts the widespread use of direct matching schemes. To addressthis problem, lots of privacy-preserving matching schemes were proposed recently years. These schemes ensure users find the perfect matcher(s) without revealing extra unnecessary personal information. And yet, at the same time, it is inevitable that they produce more computation amount and communication traffic compare with former direct matching schemes. For mobile application scenarios, it is a heavy burden since power is limited. Particularly, for spatiotemporal matching, the situation is much worse due to the number of elements in users' spatiotemporal profiles will be very large as time goes on. Another outstanding issue in spatiotemporal matching is that how to define two users are neighboring. So, how to achieve an efficient and exactly privacy-preserving spatiotemporal matching remains an open question. In this paper, we propose a fine-grained privacypreserving spatiotemporal matching in Mobile Social Networks. Our scheme decreases the spatiotemporal matching error, as well as promotes the efficiency of matchmaking. Thorough security analysis and evaluation results indicate that our scheme is effective and efficient.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132671194","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
扫码关注我们
求助内容：
应助结果提醒方式：