Pub Date : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377371
K. Shin, Dong Min Lee, J. Jeon
This paper is a research finding on the inspection of the camera module assembled in the camera module automation line and automation of the adjustment process. Parts such as camera modules, where foreign particles of several micrometers might cause defects in sensor pixel should be produced with facilities with clean areas to prevent contamination. When managing workers, production by automated robots is essential to prevent defects caused by foreign objects and human mistakes due to monotonous and repetitive tasks. In order to cope with the production process where products are produced through several processes and changes, flexibility with the product production, an automatic sorting system that is available for line reconfiguration and inline production is required. Recently, as the need to produce parts in a clean area increases, a sorting system that can produce small products as well as camera modules and can be used continuously or alone is needed.
{"title":"Development of Robotic Sorting System for Small Parts Using SCARA Robot","authors":"K. Shin, Dong Min Lee, J. Jeon","doi":"10.1109/IMCOM51814.2021.9377371","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377371","url":null,"abstract":"This paper is a research finding on the inspection of the camera module assembled in the camera module automation line and automation of the adjustment process. Parts such as camera modules, where foreign particles of several micrometers might cause defects in sensor pixel should be produced with facilities with clean areas to prevent contamination. When managing workers, production by automated robots is essential to prevent defects caused by foreign objects and human mistakes due to monotonous and repetitive tasks. In order to cope with the production process where products are produced through several processes and changes, flexibility with the product production, an automatic sorting system that is available for line reconfiguration and inline production is required. Recently, as the need to produce parts in a clean area increases, a sorting system that can produce small products as well as camera modules and can be used continuously or alone is needed.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125529291","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377404
Weidong Deng, Yun Liu
Information extraction (IE) plays a crucial role in natural language processing, which extracts structured facts like entities, attributes, relations and events from unstructured text. The results of information extraction can be applied in many fields including information retrieval, intelligent QA system, to name a few. We define a pair of entities and their relation from a sentence as a triple. Different from most relation extraction tasks, which only extract one relation from a sentence of known entities, we achieved that extracting both relation and entities(a triple, as defined above), from a plain sentence. Until now, there are so many methods proposed to solve information extraction problem and deep learning has made great progress last several years. Among the field of deep learning, the pre-trained model BERT has achieved greatly successful results in a lot of NLP tasks. So we divide our triple extraction task into two sub-tasks, relation classification and entity tagging, and design two models based on BERT for these two sub-tasks, including a CNN-BERT and a Simple BERT. We experimented our models on DuIE Chinese dataset and achieved excellent results.
{"title":"Chinese Triple Extraction Based on BERT Model","authors":"Weidong Deng, Yun Liu","doi":"10.1109/IMCOM51814.2021.9377404","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377404","url":null,"abstract":"Information extraction (IE) plays a crucial role in natural language processing, which extracts structured facts like entities, attributes, relations and events from unstructured text. The results of information extraction can be applied in many fields including information retrieval, intelligent QA system, to name a few. We define a pair of entities and their relation from a sentence as a triple. Different from most relation extraction tasks, which only extract one relation from a sentence of known entities, we achieved that extracting both relation and entities(a triple, as defined above), from a plain sentence. Until now, there are so many methods proposed to solve information extraction problem and deep learning has made great progress last several years. Among the field of deep learning, the pre-trained model BERT has achieved greatly successful results in a lot of NLP tasks. So we divide our triple extraction task into two sub-tasks, relation classification and entity tagging, and design two models based on BERT for these two sub-tasks, including a CNN-BERT and a Simple BERT. We experimented our models on DuIE Chinese dataset and achieved excellent results.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123149240","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377422
Hakjun Lee, Jihyeon Ryu, Youngsook Lee, Dongho Won
With the development of IT technology and the generalization of the Internet of Things, smart grid systems combining IoT for efficient power grid construction are being widely deployed. As a form of development for this, edge computing and blockchain technology are being combined with the smart grid. Wang et al. proposed a user authentication scheme to strengthen security in this environment. In this paper, we describe the scheme proposed by Wang et al. and security faults. The first is that it is vulnerable to a side-channel attack, an impersonation attack, and a key material change attack. In addition, their scheme does not guarantee the anonymity of a participant in the smart grid system.
{"title":"Security Analysis of Blockchain-based User Authentication for Smart Grid Edge Computing Infrastructure","authors":"Hakjun Lee, Jihyeon Ryu, Youngsook Lee, Dongho Won","doi":"10.1109/IMCOM51814.2021.9377422","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377422","url":null,"abstract":"With the development of IT technology and the generalization of the Internet of Things, smart grid systems combining IoT for efficient power grid construction are being widely deployed. As a form of development for this, edge computing and blockchain technology are being combined with the smart grid. Wang et al. proposed a user authentication scheme to strengthen security in this environment. In this paper, we describe the scheme proposed by Wang et al. and security faults. The first is that it is vulnerable to a side-channel attack, an impersonation attack, and a key material change attack. In addition, their scheme does not guarantee the anonymity of a participant in the smart grid system.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116512121","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 : 2021-01-04DOI: 10.1109/imcom51814.2021.9377384
{"title":"[Copyright notice]","authors":"","doi":"10.1109/imcom51814.2021.9377384","DOIUrl":"https://doi.org/10.1109/imcom51814.2021.9377384","url":null,"abstract":"","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133980570","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377381
Amir Altaf, W. Abbas, M. Seo
A miniaturized on-chip substrate integrated waveguide (SIW) bandpass filter (BPF) and diplexer are designed in a 65nm CMOS process. The miniaturization of 42% is achieved by carving slots in the top layer of the SIW cavity. The designed two pole bandpass filter has a simulated 3 dB bandwidth of 11.1% around 70 GHz, while the diplexer has 3-dB bandwidths of 15.3% GHz and 14.86% around 71 and 90.9 GHz, respectively. Moreover, the isolation between two output ports of the diplexer is greater than -27.3 dB.
{"title":"Design of Miniaturized On-chip SIW Cavity Filter and Diplexer in 65nm CMOS Process","authors":"Amir Altaf, W. Abbas, M. Seo","doi":"10.1109/IMCOM51814.2021.9377381","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377381","url":null,"abstract":"A miniaturized on-chip substrate integrated waveguide (SIW) bandpass filter (BPF) and diplexer are designed in a 65nm CMOS process. The miniaturization of 42% is achieved by carving slots in the top layer of the SIW cavity. The designed two pole bandpass filter has a simulated 3 dB bandwidth of 11.1% around 70 GHz, while the diplexer has 3-dB bandwidths of 15.3% GHz and 14.86% around 71 and 90.9 GHz, respectively. Moreover, the isolation between two output ports of the diplexer is greater than -27.3 dB.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133256331","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377423
Naveed Javaid, Kifayat-Ullah Khan, A. Khattak, Waqas Nawaz
Community search is a well studied problem in literature to find similar and strongly connected vertices in a graph for a give set of query vertices. It can assist in finding similar structures in a large graph and has many potential applications in different domains, such as molecular biology, data science, and sociology. However, it is non-trivial to identify analogous communities in a large multi-attributed graph for a given query graph due to complex structure of underlying network. Majority of the existing approaches either focus on structural or attributed aspect of the network for community search in a multi-attributed graph, while other are computation intensive. Therefore, we introduce a simple and efficient approach to find communities for a given query graph using collaborative similarity measure (CSM) and representation selection strategy. We apply an incremental clustering approach to determine k sets of nodes from the original graph based on structural and attribute similarity. Afterwards, we find representative and most relevant vertices in each cluster using PageRank approach. In order to get optimal communities, we perform clustering coefficient based pruning on the resultant communities. The experimental analysis on various real-world graphs shows the effectiveness and efficiency of our approach in terms of execution time and results accuracy.
{"title":"Community Search in a Multi-Attributed Graph using Collaborative Similarity Measure and Node Filtering","authors":"Naveed Javaid, Kifayat-Ullah Khan, A. Khattak, Waqas Nawaz","doi":"10.1109/IMCOM51814.2021.9377423","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377423","url":null,"abstract":"Community search is a well studied problem in literature to find similar and strongly connected vertices in a graph for a give set of query vertices. It can assist in finding similar structures in a large graph and has many potential applications in different domains, such as molecular biology, data science, and sociology. However, it is non-trivial to identify analogous communities in a large multi-attributed graph for a given query graph due to complex structure of underlying network. Majority of the existing approaches either focus on structural or attributed aspect of the network for community search in a multi-attributed graph, while other are computation intensive. Therefore, we introduce a simple and efficient approach to find communities for a given query graph using collaborative similarity measure (CSM) and representation selection strategy. We apply an incremental clustering approach to determine k sets of nodes from the original graph based on structural and attribute similarity. Afterwards, we find representative and most relevant vertices in each cluster using PageRank approach. In order to get optimal communities, we perform clustering coefficient based pruning on the resultant communities. The experimental analysis on various real-world graphs shows the effectiveness and efficiency of our approach in terms of execution time and results accuracy.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121878250","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377437
Fuead Ali, Mohamad Firdaus Hafifi Saidi
This work aims to extract the individual water meter flow consumption's reading automatically using the water flow reading and upload the extracted water flow data to the cloud platform using the internet connection for analysis and data visualization for monitoring. The study also aims to notify residential owner of any excessive water usage from the cloud platform's analysis. The method implementation for this work is based on the prototyping model where a device of automatic meter reading that read the water flow using the water flow reading and water meter reading on an actual water meter. The extracted water flow reading then uploaded to cloud platform for analysis via internet connection. This device consists of Raspberry Pi 4 as the brain, Pi camera as the image capturing mechanism and YF-S201 water flow sensor as water flow reader. This work has the ability to allow early detection of water leakage due to constant analysis and therefore is able to detect any water leakage accurately from the analysis and provide an alert to the residential owner. (Abstract)
{"title":"Water Leakage Detection based on Automatic Meter Reading","authors":"Fuead Ali, Mohamad Firdaus Hafifi Saidi","doi":"10.1109/IMCOM51814.2021.9377437","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377437","url":null,"abstract":"This work aims to extract the individual water meter flow consumption's reading automatically using the water flow reading and upload the extracted water flow data to the cloud platform using the internet connection for analysis and data visualization for monitoring. The study also aims to notify residential owner of any excessive water usage from the cloud platform's analysis. The method implementation for this work is based on the prototyping model where a device of automatic meter reading that read the water flow using the water flow reading and water meter reading on an actual water meter. The extracted water flow reading then uploaded to cloud platform for analysis via internet connection. This device consists of Raspberry Pi 4 as the brain, Pi camera as the image capturing mechanism and YF-S201 water flow sensor as water flow reader. This work has the ability to allow early detection of water leakage due to constant analysis and therefore is able to detect any water leakage accurately from the analysis and provide an alert to the residential owner. (Abstract)","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122144240","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377434
Junhyung Moon, Jongpil Jeong
In this paper, Deep Q-Network (DQN) was adopted to solve the Job shop Scheduling Problem (JSP) in the smart factory process. On the other hand, cloud computing has sensitive issues in the manufacturing process such as communication delay time and security problems. Research on various aspects of introducing an edge computing system to replace it has been conducted. We propose cooperative scheduling among edge devices in a Multi access Edge Computing (MEC) structure for scheduling without the help of a cloud center in a smart factory edge computing environment. Moreover, efficient DQN is used for experiments based on transfer learning data, and the proposed framework is compared and analyzed with existing frameworks from the perspective of provider a smart factory service.
{"title":"Smart Manufacturing Scheduling System: DQN based on Cooperative Edge Computing","authors":"Junhyung Moon, Jongpil Jeong","doi":"10.1109/IMCOM51814.2021.9377434","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377434","url":null,"abstract":"In this paper, Deep Q-Network (DQN) was adopted to solve the Job shop Scheduling Problem (JSP) in the smart factory process. On the other hand, cloud computing has sensitive issues in the manufacturing process such as communication delay time and security problems. Research on various aspects of introducing an edge computing system to replace it has been conducted. We propose cooperative scheduling among edge devices in a Multi access Edge Computing (MEC) structure for scheduling without the help of a cloud center in a smart factory edge computing environment. Moreover, efficient DQN is used for experiments based on transfer learning data, and the proposed framework is compared and analyzed with existing frameworks from the perspective of provider a smart factory service.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125570981","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377359
Jiaxing Li, Luna Wang, Yiming Sun, Guojiang Shen, Ivan Lee, Xiangjie Kong
Exploring new scientific concepts and imparting knowledge are important roles of universities. Up to now, most information management study on institutional research output focuses on the number and excellence of paper. This paper proposes a new characterization method from the perspective of output and complexity to extract academic information. Top-ranked universities are selected to identify different performance through research production and complexity. The production indicator of different universities is calculated based on the annual number of research paper produced in each university. The complexity indicator of different universities is obtained according to weighted revealed comparative advantage over different research disciplines. By using an unsupervised competitive learning algorithm that considers four indicators simultaneously, we construct a coherent framework to seize the nature of universities' research output. As a key finding, we discover that university research complexity has a positive relationship with research production and a different cluster of universities has a different rate of rising of the positive relationship.
{"title":"More Complex More Productive: Characterizing Top Universities Based on Research Publications","authors":"Jiaxing Li, Luna Wang, Yiming Sun, Guojiang Shen, Ivan Lee, Xiangjie Kong","doi":"10.1109/IMCOM51814.2021.9377359","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377359","url":null,"abstract":"Exploring new scientific concepts and imparting knowledge are important roles of universities. Up to now, most information management study on institutional research output focuses on the number and excellence of paper. This paper proposes a new characterization method from the perspective of output and complexity to extract academic information. Top-ranked universities are selected to identify different performance through research production and complexity. The production indicator of different universities is calculated based on the annual number of research paper produced in each university. The complexity indicator of different universities is obtained according to weighted revealed comparative advantage over different research disciplines. By using an unsupervised competitive learning algorithm that considers four indicators simultaneously, we construct a coherent framework to seize the nature of universities' research output. As a key finding, we discover that university research complexity has a positive relationship with research production and a different cluster of universities has a different rate of rising of the positive relationship.","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126270544","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 : 2021-01-04DOI: 10.1109/IMCOM51814.2021.9377325
Desong Qin, Zhenjiang Zhang
With the rapid development of 5G, the Internet of Things (IoT) and edge computing technologies dramatically improve smart industries' efficiency, such as healthcare, smart agriculture, and smart city. IoT is a data-driven system in which many smart devices generate and collect a massive amount of user privacy data, which may be used to improve users' efficiency. However, these data tend to leak personal privacy when people send it to the Internet. Differential privacy (DP) provides a method for measuring privacy protection and a more flexible privacy protection algorithm. In this paper, we study an estimation problem and propose a new frequency estimation algorithm named MFEA that redesigns the publish process. The algorithm maps a finite data set to an integer range through a hash function, then initializes the data vector according to the mapped value and adds noise through the randomized response. The frequency of all interference data is estimated with maximum likelihood. Compared with the current traditional frequency estimation, our approach achieves better algorithm complexity and error control while satisfying differential privacy protection (LDP).
{"title":"A Frequency Estimation Algorithm under Local Differential Privacy","authors":"Desong Qin, Zhenjiang Zhang","doi":"10.1109/IMCOM51814.2021.9377325","DOIUrl":"https://doi.org/10.1109/IMCOM51814.2021.9377325","url":null,"abstract":"With the rapid development of 5G, the Internet of Things (IoT) and edge computing technologies dramatically improve smart industries' efficiency, such as healthcare, smart agriculture, and smart city. IoT is a data-driven system in which many smart devices generate and collect a massive amount of user privacy data, which may be used to improve users' efficiency. However, these data tend to leak personal privacy when people send it to the Internet. Differential privacy (DP) provides a method for measuring privacy protection and a more flexible privacy protection algorithm. In this paper, we study an estimation problem and propose a new frequency estimation algorithm named MFEA that redesigns the publish process. The algorithm maps a finite data set to an integer range through a hash function, then initializes the data vector according to the mapped value and adds noise through the randomized response. The frequency of all interference data is estimated with maximum likelihood. Compared with the current traditional frequency estimation, our approach achieves better algorithm complexity and error control while satisfying differential privacy protection (LDP).","PeriodicalId":275121,"journal":{"name":"2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126446347","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
扫码关注我们
求助内容：
应助结果提醒方式：