As the Internet develops faster and faster, resources are becoming more and more abundant. It is more and more difficult for people to retrieve the information they need from a large number of resources. The professional information retrieval system came into being. However, the current system can not retrieve resources to meet the user's requirements. In this paper, I propose a new TF-IDF information retrieval improved algorithm, which makes the resources retrieved by the information retrieval system more professional and presents people with a more accurate result. The experimental results show that the TF-IDF improved algorithm can achieve higher precision P and Recall R.
{"title":"Research on an Improved Algorithm of Professional Information Retrieval System","authors":"Huajia Wang, R. Hu, Hong Xu","doi":"10.1145/3316551.3316574","DOIUrl":"https://doi.org/10.1145/3316551.3316574","url":null,"abstract":"As the Internet develops faster and faster, resources are becoming more and more abundant. It is more and more difficult for people to retrieve the information they need from a large number of resources. The professional information retrieval system came into being. However, the current system can not retrieve resources to meet the user's requirements. In this paper, I propose a new TF-IDF information retrieval improved algorithm, which makes the resources retrieved by the information retrieval system more professional and presents people with a more accurate result. The experimental results show that the TF-IDF improved algorithm can achieve higher precision P and Recall R.","PeriodicalId":300199,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Digital Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116299211","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}
Data compression can efficiently utilize the storage capacity. Especially for mobile devices, they have limited resources such as a CPU (Central Processing Unit) operation clock and a power source, so hardware designed compression method is required. Most adaptive dictionary-based compression methods have their root in Lempel-Ziv algorithm. LZ4 is one of the fastest compression algorithms. In this paper, we propose an advanced algorithm and hardware architecture with improved compression ratio and speed. In order to achieve a higher compression ratio, the proposed algorithm has a variable length format while LZ4 has a fixed length format. Experimental results show that the proposed architecture can achieve compression throughput up to 3.84Gbps and compression ratio up to 4. In this way, our hardware-based architecture improves memory performance and battery life of mobile devices with low power consumption.
{"title":"Hardware-accelerated Fast Lossless Compression Based on LZ4 Algorithm","authors":"Jee-hong Kim, Jundong Cho","doi":"10.1145/3316551.3316564","DOIUrl":"https://doi.org/10.1145/3316551.3316564","url":null,"abstract":"Data compression can efficiently utilize the storage capacity. Especially for mobile devices, they have limited resources such as a CPU (Central Processing Unit) operation clock and a power source, so hardware designed compression method is required. Most adaptive dictionary-based compression methods have their root in Lempel-Ziv algorithm. LZ4 is one of the fastest compression algorithms. In this paper, we propose an advanced algorithm and hardware architecture with improved compression ratio and speed. In order to achieve a higher compression ratio, the proposed algorithm has a variable length format while LZ4 has a fixed length format. Experimental results show that the proposed architecture can achieve compression throughput up to 3.84Gbps and compression ratio up to 4. In this way, our hardware-based architecture improves memory performance and battery life of mobile devices with low power consumption.","PeriodicalId":300199,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Digital Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122297683","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}
Sijie Long, Chengfeng Zheng, Canliu Wu, T. Qi, Xiaojie Li, Yongsheng Zhu, Jingyi Liu, Jinwei Li, Jia Shuai, Zefeng Xie, Zhongyuan Chen, Hang Du
The basic features extracted by the basic LBP operator are not complete. It only analyzes the symbolic values of local differences. How to improve the features extracted by the LBP operator and how to effectively express the information that the basic LBP operator fails to express to achieve a better recognition rate has not yet been solved. By selecting FP-tree, the grey value of the image is frequently analyzed, and then the feature of LBP is used to extract features, so as to obtain a more comprehensive local feature of the extracted facial image.
{"title":"Face Recognition Based on FP-Growth Improved LBP Operator","authors":"Sijie Long, Chengfeng Zheng, Canliu Wu, T. Qi, Xiaojie Li, Yongsheng Zhu, Jingyi Liu, Jinwei Li, Jia Shuai, Zefeng Xie, Zhongyuan Chen, Hang Du","doi":"10.1145/3316551.3318235","DOIUrl":"https://doi.org/10.1145/3316551.3318235","url":null,"abstract":"The basic features extracted by the basic LBP operator are not complete. It only analyzes the symbolic values of local differences. How to improve the features extracted by the LBP operator and how to effectively express the information that the basic LBP operator fails to express to achieve a better recognition rate has not yet been solved. By selecting FP-tree, the grey value of the image is frequently analyzed, and then the feature of LBP is used to extract features, so as to obtain a more comprehensive local feature of the extracted facial image.","PeriodicalId":300199,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Digital Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121125344","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 order to provide an about real-world rescue environment for marine rescue simulation training, meteorological marine environment modeling becomes more and more important. In the modeling of meteorological ocean environment, the modeling method of complex environment is becoming more and more mature and the models are becoming more sophisticated, while the climate background models are often overlooked. How to provide real and accurate data-based climate background modeling for marine rescue simulation training has become an urgent problem to be solved. Based on the seasonal-trend decomposition procedure based on Loess (STL) and statistical feature modeling method, a modeling method for constructing dynamic climate background modeling using climate time series is proposed. For different climate model simulation application and the specific characteristics of climate change, our method builds the dynamic climate background model for different sea areas and different months accordingly, while considering the changing of climatic factors at different time scales. The dynamic climate background model is composed of four climate trend models with different time periods, namely, the annual variation trend of climate elements, the daily mean anomaly variation trend, the daily variation trend and the random perturbation. This modeling method of climate background model is not just a way to reflect the trends of climate change, but also to provide a dynamic and numerical climate background information for simulation training. As a result, providing this information to the commander or the rescue equipment can further improve the effectiveness of maritime rescue drill.
{"title":"Study on the Drill of Maritime Rescue Oriented Modeling Method of Climate Background Environment","authors":"Shan Chang, Xuyun Zhao, Bingnan Song, Yu Wang","doi":"10.1145/3316551.3316577","DOIUrl":"https://doi.org/10.1145/3316551.3316577","url":null,"abstract":"In order to provide an about real-world rescue environment for marine rescue simulation training, meteorological marine environment modeling becomes more and more important. In the modeling of meteorological ocean environment, the modeling method of complex environment is becoming more and more mature and the models are becoming more sophisticated, while the climate background models are often overlooked. How to provide real and accurate data-based climate background modeling for marine rescue simulation training has become an urgent problem to be solved. Based on the seasonal-trend decomposition procedure based on Loess (STL) and statistical feature modeling method, a modeling method for constructing dynamic climate background modeling using climate time series is proposed. For different climate model simulation application and the specific characteristics of climate change, our method builds the dynamic climate background model for different sea areas and different months accordingly, while considering the changing of climatic factors at different time scales. The dynamic climate background model is composed of four climate trend models with different time periods, namely, the annual variation trend of climate elements, the daily mean anomaly variation trend, the daily variation trend and the random perturbation. This modeling method of climate background model is not just a way to reflect the trends of climate change, but also to provide a dynamic and numerical climate background information for simulation training. As a result, providing this information to the commander or the rescue equipment can further improve the effectiveness of maritime rescue drill.","PeriodicalId":300199,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Digital Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131561925","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}
L. Rosales-Roldan, Angelina Espejel Trujillo, M. Nakano-Miyatake, J. Chao
In a smart city environment, a huge amount of data is monitored in real time every day by the interconnection between Information and Communication Technologies (ICT's) and Internet of the Things (IoT). However, this increases the vulnerabilities and risks of the acquired data. Most of these data is private information and in order to preserve its ownership protection, authentication, and secret communication we propose our Color Watermarking based on DCT and YCbCr Color Space for Privacy Preservation. The results of experiments show that our method is robust against JPEG and JPEG2000 compression, as well as it has high imperceptibility. Due to its characteristics is ideal to be used in smart cities environments.
{"title":"Color Watermarking based on DCT and YCbCr Color Space for Privacy Preservation in Smart Cities","authors":"L. Rosales-Roldan, Angelina Espejel Trujillo, M. Nakano-Miyatake, J. Chao","doi":"10.1145/3316551.3316556","DOIUrl":"https://doi.org/10.1145/3316551.3316556","url":null,"abstract":"In a smart city environment, a huge amount of data is monitored in real time every day by the interconnection between Information and Communication Technologies (ICT's) and Internet of the Things (IoT). However, this increases the vulnerabilities and risks of the acquired data. Most of these data is private information and in order to preserve its ownership protection, authentication, and secret communication we propose our Color Watermarking based on DCT and YCbCr Color Space for Privacy Preservation. The results of experiments show that our method is robust against JPEG and JPEG2000 compression, as well as it has high imperceptibility. Due to its characteristics is ideal to be used in smart cities environments.","PeriodicalId":300199,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Digital Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125407400","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}
Image segmentation technology is one of the important topics in the field of digital image research. However, there is no uniform standard for existing image segmentation methods, and the traditional image segmentation method is only suitable for some specific occasions. Therefore, it is very urgent to research and develop new theories and methods of image segmentation technology. Genetic algorithm is a method for calculating the optimal solution by simulating the biological evolution process in the natural selection and genetic mechanism of biological evolution. It has strong robustness, parallelism, adaptability and fast convergence. It can be applied in image segmentation technology to determine the segmentation threshold. Therefore, this paper studies the image segmentation based on genetic algorithm, and compares different image segmentation algorithms. The experimental results show that the image segmentation effect based on genetic algorithm is better than the traditional image segmentation.
{"title":"Image Segmentation Technology Based on Genetic Algorithm","authors":"Chong Tan, Ying Sun, Gongfa Li, Bo Tao, Shuang Xu, Fei Zeng","doi":"10.1145/3316551.3318229","DOIUrl":"https://doi.org/10.1145/3316551.3318229","url":null,"abstract":"Image segmentation technology is one of the important topics in the field of digital image research. However, there is no uniform standard for existing image segmentation methods, and the traditional image segmentation method is only suitable for some specific occasions. Therefore, it is very urgent to research and develop new theories and methods of image segmentation technology. Genetic algorithm is a method for calculating the optimal solution by simulating the biological evolution process in the natural selection and genetic mechanism of biological evolution. It has strong robustness, parallelism, adaptability and fast convergence. It can be applied in image segmentation technology to determine the segmentation threshold. Therefore, this paper studies the image segmentation based on genetic algorithm, and compares different image segmentation algorithms. The experimental results show that the image segmentation effect based on genetic algorithm is better than the traditional image segmentation.","PeriodicalId":300199,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Digital Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129815930","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}
The proposed fixed-point radix-2 decimation-in-time Fast Fourier Transform (R2DIT FFT) processor is implemented by the series-parallel mixed structure. The 64-point FFT is decomposed into 8-channel 8-point FFT structure. Each channel is a serial 8-point FFT which uses an 8-point full-parallel structure. The vertical 8-channel 8-point FFT is calculated, then the result is multiplied by WNn1k2. After that, the horizontal 8-channel 8-point FFT is calculated. In this way, the 64-point FFT calculation is decomposed into two full-parallel 8-point FFT calculations. The processing of the 64-point FFT calculation takes about 1.96 μs at 100 MHz based on EP2S130F1020C3 chip. And the output from the first data to the last data spends about 0.76 μs. Then, the 64-point FFT is simplified to the 16-point FFT with the same series-parallel mixed structure and downloaded to the EP2C35F-672C6 chip of the DE2 FPGA development board. Then the signal is extracted with the SignalTap II tool. Experimental values are compared with theoretical values calculated by Matlab. After converting them to decimal fractions, the absolute error is less than 0.2. In addition, it takes about 9.8 μs from the data input to the first data output at 100 MHz. And the total output from the first data output to the last data output is about 3 μs. Compared with the full-parallel FFT, the series-parallel mixed structure scheme achieves an effective solution for the contradiction between speeds and resource utilizations based on FPGA.
{"title":"A Series-parallel Mixed Structure FFT Processor","authors":"Hua Jiang, Wenkai Xu","doi":"10.1145/3316551.3316570","DOIUrl":"https://doi.org/10.1145/3316551.3316570","url":null,"abstract":"The proposed fixed-point radix-2 decimation-in-time Fast Fourier Transform (R2DIT FFT) processor is implemented by the series-parallel mixed structure. The 64-point FFT is decomposed into 8-channel 8-point FFT structure. Each channel is a serial 8-point FFT which uses an 8-point full-parallel structure. The vertical 8-channel 8-point FFT is calculated, then the result is multiplied by WNn1k2. After that, the horizontal 8-channel 8-point FFT is calculated. In this way, the 64-point FFT calculation is decomposed into two full-parallel 8-point FFT calculations. The processing of the 64-point FFT calculation takes about 1.96 μs at 100 MHz based on EP2S130F1020C3 chip. And the output from the first data to the last data spends about 0.76 μs. Then, the 64-point FFT is simplified to the 16-point FFT with the same series-parallel mixed structure and downloaded to the EP2C35F-672C6 chip of the DE2 FPGA development board. Then the signal is extracted with the SignalTap II tool. Experimental values are compared with theoretical values calculated by Matlab. After converting them to decimal fractions, the absolute error is less than 0.2. In addition, it takes about 9.8 μs from the data input to the first data output at 100 MHz. And the total output from the first data output to the last data output is about 3 μs. Compared with the full-parallel FFT, the series-parallel mixed structure scheme achieves an effective solution for the contradiction between speeds and resource utilizations based on FPGA.","PeriodicalId":300199,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Digital Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124679183","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 the current digital age, where people are commonly connected within the Internet of Things (IoT) and Internet of People (IoP) environments, videos are easily shared on social media and mobile messaging Apps, so there is a need to determine the ownership of these videos so that they are not illegally distributed without acknowledging the source. Robust video watermarking schemes are commonly applied to solve these copyright ownership problems. These types of robust schemes need to withstand modification attacks attempted on the watermark embedded within the videos. In this paper, we focus on two recent watermarking schemes and analyse their robustness. We present attacks that enable malicious buyers to modify the watermarks embedded by the owner.
{"title":"Robustness Attacks on Video Watermarking Using Singular Value Decomposition","authors":"G. C. Ting, B. Goi, S. Lee","doi":"10.1145/3316551.3316555","DOIUrl":"https://doi.org/10.1145/3316551.3316555","url":null,"abstract":"In the current digital age, where people are commonly connected within the Internet of Things (IoT) and Internet of People (IoP) environments, videos are easily shared on social media and mobile messaging Apps, so there is a need to determine the ownership of these videos so that they are not illegally distributed without acknowledging the source. Robust video watermarking schemes are commonly applied to solve these copyright ownership problems. These types of robust schemes need to withstand modification attacks attempted on the watermark embedded within the videos. In this paper, we focus on two recent watermarking schemes and analyse their robustness. We present attacks that enable malicious buyers to modify the watermarks embedded by the owner.","PeriodicalId":300199,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Digital Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126181430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A method which combines a new image detection operator with one dimensional subsection histogram equalization(NIDO-ODSHE) is proposed to deal with the problem that the target cannot be better detected on the time recording due to the influence of environmental noise, disturbance and so on. Firstly, slide detections of a target trajectory is carried out based on beam data using the new image detection operator. Then the detected data is processed by the adaptive subsection histogram equalization, and the new time recording is finally obtained. After such a treatment, the processed image gets better gain, the image clarity is obviously improved, and the weak target trajectory is significantly enhanced. Moreover, the NIDO-ODSHE method does not need parameter setting and the computational amount is small. Simulation and experimental results on a time recording of and comparisons with the histogram equalization show that the NIDO-ODSHE method can enhance the weak target on a time recording and improve the artificial/automatic detection ability of weak targets, the proposed method obviously improves the image, and increases the mean squared error ratio and the image clarity more than 12% and 6%, respectively.
{"title":"A Weak Target Enhancement Method in the Bearing Time Recording","authors":"Jianfeng Tao","doi":"10.1145/3316551.3316552","DOIUrl":"https://doi.org/10.1145/3316551.3316552","url":null,"abstract":"A method which combines a new image detection operator with one dimensional subsection histogram equalization(NIDO-ODSHE) is proposed to deal with the problem that the target cannot be better detected on the time recording due to the influence of environmental noise, disturbance and so on. Firstly, slide detections of a target trajectory is carried out based on beam data using the new image detection operator. Then the detected data is processed by the adaptive subsection histogram equalization, and the new time recording is finally obtained. After such a treatment, the processed image gets better gain, the image clarity is obviously improved, and the weak target trajectory is significantly enhanced. Moreover, the NIDO-ODSHE method does not need parameter setting and the computational amount is small. Simulation and experimental results on a time recording of and comparisons with the histogram equalization show that the NIDO-ODSHE method can enhance the weak target on a time recording and improve the artificial/automatic detection ability of weak targets, the proposed method obviously improves the image, and increases the mean squared error ratio and the image clarity more than 12% and 6%, respectively.","PeriodicalId":300199,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Digital Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126991470","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}
We propose a pointwise P-Norm based nonparametric image deconvolution method. In our algorithm, a pointwise p-norm based regular term is used to deal with the different types of regions in a blurry image such as edges, texture and smooth areas. A new hyper-parameter updating method is also adopted to improve the effectiveness and robustness of the proposed algorithm. The experimental results show that the quality of our restored images can outperform the results derived by other algorithms. In addition, our algorithm has a wide adaptation to different blur kernels.
{"title":"An Adaptive Pointwise P-norm Regularization for Image Deconvolution","authors":"Binbin Ma, Xiyuan Hu, Silong Peng","doi":"10.1145/3316551.3316563","DOIUrl":"https://doi.org/10.1145/3316551.3316563","url":null,"abstract":"We propose a pointwise P-Norm based nonparametric image deconvolution method. In our algorithm, a pointwise p-norm based regular term is used to deal with the different types of regions in a blurry image such as edges, texture and smooth areas. A new hyper-parameter updating method is also adopted to improve the effectiveness and robustness of the proposed algorithm. The experimental results show that the quality of our restored images can outperform the results derived by other algorithms. In addition, our algorithm has a wide adaptation to different blur kernels.","PeriodicalId":300199,"journal":{"name":"Proceedings of the 2019 3rd International Conference on Digital Signal Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123939593","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
扫码关注我们
求助内容：
应助结果提醒方式：