Pub Date : 2018-11-01DOI: 10.1109/IEMCON.2018.8615055
Nabeeh Kandalaft, Padma Sandeep Kalidindi, S. Narra, Himadri Nath Saha
There is an increasing need to create robots for different situations and applications involving the medical field as well as other fields where human interaction is challenging and unsafe. Ease of control operation greatly impact their effective application. In this paper, a robotic arm controlled by gesture movements and voice commands is proposed and constructed using 3D printing. The gesture data is developed using an accelerometer with a pre-selected voice commands using voice recognition module based on a Bluetooth communication protocol for the microcontroller. The prototype has 3 degrees of freedom (DOF) and can perform predefined controlled robotic program operations. Performance evaluation was carried out through various experiments, with promising results for numerous medical applications.
{"title":"Robotic arm using voice and Gesture recognition","authors":"Nabeeh Kandalaft, Padma Sandeep Kalidindi, S. Narra, Himadri Nath Saha","doi":"10.1109/IEMCON.2018.8615055","DOIUrl":"https://doi.org/10.1109/IEMCON.2018.8615055","url":null,"abstract":"There is an increasing need to create robots for different situations and applications involving the medical field as well as other fields where human interaction is challenging and unsafe. Ease of control operation greatly impact their effective application. In this paper, a robotic arm controlled by gesture movements and voice commands is proposed and constructed using 3D printing. The gesture data is developed using an accelerometer with a pre-selected voice commands using voice recognition module based on a Bluetooth communication protocol for the microcontroller. The prototype has 3 degrees of freedom (DOF) and can perform predefined controlled robotic program operations. Performance evaluation was carried out through various experiments, with promising results for numerous medical applications.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114934139","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 : 2018-11-01DOI: 10.1109/IEMCON.2018.8615061
J. Leite, Paulo S. Martins, E. Ursini
This work presents six simulation case studies of AdHoc and IoT Networks, considering congested and uncongested nodes, messages with and without priorities, including routing optimization and message losses using the Two-ray as a propagation model and the RWP as the mobility model. The goal is to analyze the traffic of the mediator to estimate its capacity considering an ITS application. Specifically, we aim at determining the processor utilization and message delays. The proposed model and simulation tool may be used to plan and dimension the network. The results showed that routing optimization and prioritization of messages are relevant to the effective resource usage of the network.
{"title":"Analysis of an AdHoc Network in an Intelligent Transportation System","authors":"J. Leite, Paulo S. Martins, E. Ursini","doi":"10.1109/IEMCON.2018.8615061","DOIUrl":"https://doi.org/10.1109/IEMCON.2018.8615061","url":null,"abstract":"This work presents six simulation case studies of AdHoc and IoT Networks, considering congested and uncongested nodes, messages with and without priorities, including routing optimization and message losses using the Two-ray as a propagation model and the RWP as the mobility model. The goal is to analyze the traffic of the mediator to estimate its capacity considering an ITS application. Specifically, we aim at determining the processor utilization and message delays. The proposed model and simulation tool may be used to plan and dimension the network. The results showed that routing optimization and prioritization of messages are relevant to the effective resource usage of the network.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122333933","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 : 2018-11-01DOI: 10.1109/IEMCON.2018.8614941
Anirudha Bhaskar
State space seek is a procedure utilized as a part of the field of software engineering, including counterfeit consciousness (AI), in which progressive designs or conditions of an occasion are considered, with the objective of finding an objective state with a coveted property. In spite of the very fact that this enterprise has varied applications as well as those for movement arranging, trying with design information heuristics, AND/OR charts then on. This main objective of this paper is to run Multi-Heuristic Planner on a 3D Environment. This framework is build on this believe that multiple searches along with different in-admissible heuristics will guild the path of an object to its desired goal in a way that will preserve completeness and guarantees on suboptimality bounds.
{"title":"Multi-Heuristic State Space Search","authors":"Anirudha Bhaskar","doi":"10.1109/IEMCON.2018.8614941","DOIUrl":"https://doi.org/10.1109/IEMCON.2018.8614941","url":null,"abstract":"State space seek is a procedure utilized as a part of the field of software engineering, including counterfeit consciousness (AI), in which progressive designs or conditions of an occasion are considered, with the objective of finding an objective state with a coveted property. In spite of the very fact that this enterprise has varied applications as well as those for movement arranging, trying with design information heuristics, AND/OR charts then on. This main objective of this paper is to run Multi-Heuristic Planner on a 3D Environment. This framework is build on this believe that multiple searches along with different in-admissible heuristics will guild the path of an object to its desired goal in a way that will preserve completeness and guarantees on suboptimality bounds.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122398874","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 : 2018-11-01DOI: 10.1109/IEMCON.2018.8614806
Shengyao Zhou, Runtong Zhang, Jiayi Feng, Donghua Chen, Lei Chen
It is very important to strengthen the management of medical insurance and guarantee the steady operation of medical insurance fund. Data mining technology can provide an effective solution for medical aggregation behavior mining. It is helpful to find out the people who have the gathering behavior of medical treatment. In view of the aggregation behavior of medical insurance funds during operation, this study proposes the consistent behavior mining algorithm based on frequent pattern mining. Experiments show that this algorithm has better performance than Apriori and Eclat, can effectively detect the aggregation behavior of medical insurance, and has achieved remarkable results in the management and supervision of medical insurance.
{"title":"A Novel Method for Mining Abnormal Behaviors in Social Medical Insurance","authors":"Shengyao Zhou, Runtong Zhang, Jiayi Feng, Donghua Chen, Lei Chen","doi":"10.1109/IEMCON.2018.8614806","DOIUrl":"https://doi.org/10.1109/IEMCON.2018.8614806","url":null,"abstract":"It is very important to strengthen the management of medical insurance and guarantee the steady operation of medical insurance fund. Data mining technology can provide an effective solution for medical aggregation behavior mining. It is helpful to find out the people who have the gathering behavior of medical treatment. In view of the aggregation behavior of medical insurance funds during operation, this study proposes the consistent behavior mining algorithm based on frequent pattern mining. Experiments show that this algorithm has better performance than Apriori and Eclat, can effectively detect the aggregation behavior of medical insurance, and has achieved remarkable results in the management and supervision of medical insurance.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129494359","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 : 2018-11-01DOI: 10.1109/IEMCON.2018.8614862
Bin Sun, Dehui Kong, Shaofan Wang, Jinghua Li
Keyframe extraction is important for video retrieval. In order to realize frequency adaptive human motion sequence resampling and achieve high quality keyframe, we propose a new keyframe extraction method for human motion sequence. First, we define the inter-frame similarity metric based on the features of human body parts. Then, the keyframe extraction is realized by the affine propagation clustering algorithm. The proposed method starts from the information distribution of the video itself, adaptively searches for the optimal keyframe of the video, and the operation speed is fast. Finally, the evaluation of the sequence reconstruction based on keyframe is verified. A comparative experiment conducted on the CMU database verified the efficiency of our method.
{"title":"Keyframe extraction for human motion capture data based on affinity propagation","authors":"Bin Sun, Dehui Kong, Shaofan Wang, Jinghua Li","doi":"10.1109/IEMCON.2018.8614862","DOIUrl":"https://doi.org/10.1109/IEMCON.2018.8614862","url":null,"abstract":"Keyframe extraction is important for video retrieval. In order to realize frequency adaptive human motion sequence resampling and achieve high quality keyframe, we propose a new keyframe extraction method for human motion sequence. First, we define the inter-frame similarity metric based on the features of human body parts. Then, the keyframe extraction is realized by the affine propagation clustering algorithm. The proposed method starts from the information distribution of the video itself, adaptively searches for the optimal keyframe of the video, and the operation speed is fast. Finally, the evaluation of the sequence reconstruction based on keyframe is verified. A comparative experiment conducted on the CMU database verified the efficiency of our method.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129769875","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 dental treatment, we need modern diagnostic methods to accurately detect the cavities in the teeth. The optical-based methods like laser therapy appear nowadays as conventional approaches with a widespread use. Lasers have negligible danger of harming the pulp and soft textures comparing to rotative tools. The mechanism of removal is electrostatic so the laser is only absorbed in a small mass of tissue; therefore, first electrons and after that, ions are removed quickly. This, reduces the heat directed to the surrounding materials. However, by development of laser methods, a new hope is rising to manufacture efficient and useful equipment in the near future. In this paper, an overview of different traits of four laser methods is presented and compared. Finally, Hermit-Gaussian laser mode, Fraunhofer equation, absorbed dose of laser radiation on the occlusal surface and heat conduction toward the crown are simulated. Foresaid statements are significant, due to their impact on more precise, less destructive outcomes and progress in dentistry laser methods, are the absolute aim of the paper.
{"title":"Practical Assessment of Mathematical Methods for Treatment of Tooth Cavities Using Laser Based Approach","authors":"Vala Mehryar Alviri, Morteza Modarresi Asem, Alireza Nikbin","doi":"10.1109/IEMCON.2018.8614872","DOIUrl":"https://doi.org/10.1109/IEMCON.2018.8614872","url":null,"abstract":"In dental treatment, we need modern diagnostic methods to accurately detect the cavities in the teeth. The optical-based methods like laser therapy appear nowadays as conventional approaches with a widespread use. Lasers have negligible danger of harming the pulp and soft textures comparing to rotative tools. The mechanism of removal is electrostatic so the laser is only absorbed in a small mass of tissue; therefore, first electrons and after that, ions are removed quickly. This, reduces the heat directed to the surrounding materials. However, by development of laser methods, a new hope is rising to manufacture efficient and useful equipment in the near future. In this paper, an overview of different traits of four laser methods is presented and compared. Finally, Hermit-Gaussian laser mode, Fraunhofer equation, absorbed dose of laser radiation on the occlusal surface and heat conduction toward the crown are simulated. Foresaid statements are significant, due to their impact on more precise, less destructive outcomes and progress in dentistry laser methods, are the absolute aim of the paper.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128490901","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 : 2018-11-01DOI: 10.1109/IEMCON.2018.8614798
R. Andrade, Jenny Torres
Security specialists face complex situations where they need to make immediate decisions based on the analysis of large volumes of information, exceeding it their human capacity. Cognitive systems are proposed as an alternative to reduce this limitation, motivating us to investigate its use in the field of cybersecurity, known as cognitive security. Based on the review of the literature, we found different concepts of cognitive security with diverse approaches. Thus, our first contribution is to present a definition of cognitive security emphasizing the use of cognition for making decisions in real time and including the term self-awareness. Additionally, we investigated how to generate cognition in digital environments, including self-awareness adapted to computer systems. We propose self-awareness as an enabler to implement cognitive security, for which a second contribution in this paper is to generate the state of self-awareness from the cybersecurity approach using the contributions of autonomous computing, and establishing the technical and non-technical solutions for its implementation.
{"title":"Self-Awareness as an enabler of Cognitive Security","authors":"R. Andrade, Jenny Torres","doi":"10.1109/IEMCON.2018.8614798","DOIUrl":"https://doi.org/10.1109/IEMCON.2018.8614798","url":null,"abstract":"Security specialists face complex situations where they need to make immediate decisions based on the analysis of large volumes of information, exceeding it their human capacity. Cognitive systems are proposed as an alternative to reduce this limitation, motivating us to investigate its use in the field of cybersecurity, known as cognitive security. Based on the review of the literature, we found different concepts of cognitive security with diverse approaches. Thus, our first contribution is to present a definition of cognitive security emphasizing the use of cognition for making decisions in real time and including the term self-awareness. Additionally, we investigated how to generate cognition in digital environments, including self-awareness adapted to computer systems. We propose self-awareness as an enabler to implement cognitive security, for which a second contribution in this paper is to generate the state of self-awareness from the cybersecurity approach using the contributions of autonomous computing, and establishing the technical and non-technical solutions for its implementation.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124552322","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 : 2018-11-01DOI: 10.1109/IEMCON.2018.8615005
Norhan Buckla, M. Rehan, H. Fahmy
In this paper we propose a complete framework that enables big-data tools to execute sequential computer vision algorithms in a scalable and parallel mechanism with limited modifications. Our main objective is to parallelize the processing operation in order to speed up the required processing time. Most of the present big-data processing frameworks distribute the input data randomly across the available processing units to utilize them efficiently and preserve working load fairness. Therefore, the current big-data frameworks are not suitable for processing huge video data content due to the existence of interframe dependency. When processing such sequential computer vision algorithms on big-data tools, splitting the video frames and distributing them on the available cores will not yield the correct output and will lead to inefficient usage of underlying processing resources. Our proposed framework divides the input big-data video files into small chunks that can be processed in parallel without affecting the quality of the resulting output. An intelligent data grouping algorithm was developed to distribute these data chunks among the available processing resources and gather the results out of each chunk using Apache Storm. The proposed framework was evaluated against several computer vision algorithms and achieved a speedup from 2.6x up to 8x based on the algorithm.
{"title":"Distributed Chunk-Based Framework for Parallelization of Sequential Computer Vision Algorithms on Video Big-Data","authors":"Norhan Buckla, M. Rehan, H. Fahmy","doi":"10.1109/IEMCON.2018.8615005","DOIUrl":"https://doi.org/10.1109/IEMCON.2018.8615005","url":null,"abstract":"In this paper we propose a complete framework that enables big-data tools to execute sequential computer vision algorithms in a scalable and parallel mechanism with limited modifications. Our main objective is to parallelize the processing operation in order to speed up the required processing time. Most of the present big-data processing frameworks distribute the input data randomly across the available processing units to utilize them efficiently and preserve working load fairness. Therefore, the current big-data frameworks are not suitable for processing huge video data content due to the existence of interframe dependency. When processing such sequential computer vision algorithms on big-data tools, splitting the video frames and distributing them on the available cores will not yield the correct output and will lead to inefficient usage of underlying processing resources. Our proposed framework divides the input big-data video files into small chunks that can be processed in parallel without affecting the quality of the resulting output. An intelligent data grouping algorithm was developed to distribute these data chunks among the available processing resources and gather the results out of each chunk using Apache Storm. The proposed framework was evaluated against several computer vision algorithms and achieved a speedup from 2.6x up to 8x based on the algorithm.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130504091","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 : 2018-11-01DOI: 10.1109/IEMCON.2018.8614815
Jian Chen, Yao Shen, Riaz Ali
Current credit card detection methods usually utilize the idea of classification, requiring a balanced training dataset which should contain both positive and negative samples. However, we often get highly skewed datasets with very few frauds. In this paper, we want to apply deep learning techniques to help handle this situation. We firstly use sparse autoencoder (SAE) to obtain representations of normal transactions and then train a generative adversarial network (GAN) with these representations. Finally, we combine the SAE and the discriminator of GAN and apply them to detect whether a transaction is genuine or fraud. The experimental results show that our solution outperforms the other state-of-the-art one-class methods.
{"title":"Credit Card Fraud Detection Using Sparse Autoencoder and Generative Adversarial Network","authors":"Jian Chen, Yao Shen, Riaz Ali","doi":"10.1109/IEMCON.2018.8614815","DOIUrl":"https://doi.org/10.1109/IEMCON.2018.8614815","url":null,"abstract":"Current credit card detection methods usually utilize the idea of classification, requiring a balanced training dataset which should contain both positive and negative samples. However, we often get highly skewed datasets with very few frauds. In this paper, we want to apply deep learning techniques to help handle this situation. We firstly use sparse autoencoder (SAE) to obtain representations of normal transactions and then train a generative adversarial network (GAN) with these representations. Finally, we combine the SAE and the discriminator of GAN and apply them to detect whether a transaction is genuine or fraud. The experimental results show that our solution outperforms the other state-of-the-art one-class methods.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126895982","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 : 2018-11-01DOI: 10.1109/IEMCON.2018.8614984
Shauli Sarmin Sumi, W. Osborn
Nowadays, many mobile applications provide location-based services that allow users to access location-related information from anywhere, whenever they desire. A moving user can issue queries to access information about moving or static objects. Continuous spatial query processing systems are used for this type of application. We propose two continuous query processing strategies moving point sets. The objectives of our strategies are to reduce: (1) the server workload, (2) the data transmission cost and (3) the query response time, for location-based services while providing an answer for a continuous region query. We compare our strategies with a brute-force strategy. Results show that our strategies can significantly reduce the server workload, data transmission cost, and response time over the brute-force method in many cases.
{"title":"Strategies for Continuous Region Query Processing in Moving Point Sets","authors":"Shauli Sarmin Sumi, W. Osborn","doi":"10.1109/IEMCON.2018.8614984","DOIUrl":"https://doi.org/10.1109/IEMCON.2018.8614984","url":null,"abstract":"Nowadays, many mobile applications provide location-based services that allow users to access location-related information from anywhere, whenever they desire. A moving user can issue queries to access information about moving or static objects. Continuous spatial query processing systems are used for this type of application. We propose two continuous query processing strategies moving point sets. The objectives of our strategies are to reduce: (1) the server workload, (2) the data transmission cost and (3) the query response time, for location-based services while providing an answer for a continuous region query. We compare our strategies with a brute-force strategy. Results show that our strategies can significantly reduce the server workload, data transmission cost, and response time over the brute-force method in many cases.","PeriodicalId":368939,"journal":{"name":"2018 IEEE 9th Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123943091","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
扫码关注我们
求助内容：
应助结果提醒方式：