Pub Date : 2020-10-05DOI: 10.1109/SIU49456.2020.9302280
Sümeye Nur Karahan, Aykut Kalaycioglu
The automatic modulation classification (AMC) process is used to determine the modulation format of the transmitted signal at the receiver side without any prior knowledge. Deep learning is a type of machine learning that consists of multiple layers in which raw data is taken as input. This study analyzes the AMC process with a deep learning approach. In this context, performances of LSTM (Long-Short Term Memory) and Bi-LSTM (Bidirectional LSTM) methods on the modulation classification problem are compared. Simulation results show that Bi-LSTM method has a higher performance than does the LSTM method.
{"title":"Deep Learning Based Automatic Modulation Classification With Long-Short Term Memory Networks","authors":"Sümeye Nur Karahan, Aykut Kalaycioglu","doi":"10.1109/SIU49456.2020.9302280","DOIUrl":"https://doi.org/10.1109/SIU49456.2020.9302280","url":null,"abstract":"The automatic modulation classification (AMC) process is used to determine the modulation format of the transmitted signal at the receiver side without any prior knowledge. Deep learning is a type of machine learning that consists of multiple layers in which raw data is taken as input. This study analyzes the AMC process with a deep learning approach. In this context, performances of LSTM (Long-Short Term Memory) and Bi-LSTM (Bidirectional LSTM) methods on the modulation classification problem are compared. Simulation results show that Bi-LSTM method has a higher performance than does the LSTM method.","PeriodicalId":312627,"journal":{"name":"2020 28th Signal Processing and Communications Applications Conference (SIU)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115368540","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 : 2020-10-05DOI: 10.1109/SIU49456.2020.9302114
Yasin Alptekin, Ismail San
Designing an hardware architectiire using a lowlevel hardware description language (Verilog, VHDL) is a difficult and time-consuming task especially when the application is a complex and memory intensive one. A high-level synthesis (HLS) tool, most recently and actively being researched in several research groups, automatically generates an RTL description of the hardware architecture from a high-level (C/C++) program. However, application to be accelerated on the hardware via an HLS tool needs to be written in order to decrease the overall memory access latency by simply rewriting the code so that the reformatted loop structure will have more locality. In this paper, we present two case studies to decrease the memory access latency by improving the locality of a given application by reorganizing the memory access pattern of the application being accelerated via HLS on hardware that has a cache. We also emphasize the importance of locality in performance of hardware accelerators with our empirical results on a Zynq-based SoC platform.
{"title":"On the Importance of Improving Cache Locality in Application-specific Accelerators via HLS","authors":"Yasin Alptekin, Ismail San","doi":"10.1109/SIU49456.2020.9302114","DOIUrl":"https://doi.org/10.1109/SIU49456.2020.9302114","url":null,"abstract":"Designing an hardware architectiire using a lowlevel hardware description language (Verilog, VHDL) is a difficult and time-consuming task especially when the application is a complex and memory intensive one. A high-level synthesis (HLS) tool, most recently and actively being researched in several research groups, automatically generates an RTL description of the hardware architecture from a high-level (C/C++) program. However, application to be accelerated on the hardware via an HLS tool needs to be written in order to decrease the overall memory access latency by simply rewriting the code so that the reformatted loop structure will have more locality. In this paper, we present two case studies to decrease the memory access latency by improving the locality of a given application by reorganizing the memory access pattern of the application being accelerated via HLS on hardware that has a cache. We also emphasize the importance of locality in performance of hardware accelerators with our empirical results on a Zynq-based SoC platform.","PeriodicalId":312627,"journal":{"name":"2020 28th Signal Processing and Communications Applications Conference (SIU)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115425412","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 : 2020-10-05DOI: 10.1109/SIU49456.2020.9302197
S. Karamzadeh, V. Rafiei
A new broadband metasurface (MTS) circularly polarized (CP) patch array utilizing a sequential-phase feeding network is presented. In this study, the MTS method is used to increase the 3-dB axial ratio (AR) and impedance bandwidths. The prototype of the proposed array has been fabricated to validate designed parameters. The measured S11<-10dB is 2.1 GHz (4.5-6.6 GHz), and the measured 3-dB AR bandwidth is 1.3 GHz (4.9-6.2 GHz). The measured peak gain is about 16.4dBic and the gain variation is less than 3 dB within the AR bandwidth.
{"title":"Circularly Polarized MTS Based Antenna Design for C Band Applications","authors":"S. Karamzadeh, V. Rafiei","doi":"10.1109/SIU49456.2020.9302197","DOIUrl":"https://doi.org/10.1109/SIU49456.2020.9302197","url":null,"abstract":"A new broadband metasurface (MTS) circularly polarized (CP) patch array utilizing a sequential-phase feeding network is presented. In this study, the MTS method is used to increase the 3-dB axial ratio (AR) and impedance bandwidths. The prototype of the proposed array has been fabricated to validate designed parameters. The measured S11<-10dB is 2.1 GHz (4.5-6.6 GHz), and the measured 3-dB AR bandwidth is 1.3 GHz (4.9-6.2 GHz). The measured peak gain is about 16.4dBic and the gain variation is less than 3 dB within the AR bandwidth.","PeriodicalId":312627,"journal":{"name":"2020 28th Signal Processing and Communications Applications Conference (SIU)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121043451","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 : 2020-10-05DOI: 10.1109/SIU49456.2020.9302476
Zýnnet Duygu Akþehýr, Selçuk Aslan
The particle swarm optimization algorithm is a population-based algorithm used to solve optimization problems. In recent years, a parallel version of the PSO algorithm has proposed to solve complex application problems, and the situation has become the focus of researchers. Communication in this approach is ensured by the migration of particles between sub-population. In the parallel version of the PSO algorithm, parameters such as migration strategy, migration period, the topological structure must be determined. In this study, it was analyzed in which periods it would be more appropriate to perform migration procedures. In this context, the maximum number of iterations of 10000 is divided into three period intervals: 1000-3000, 3000-6000 and 6000-9000. Then, for cases where the number of threads is 2 and 4, the migration process is analyzed over these periods.
{"title":"The Effect of The Migration Time on The Parallel Particle Swarm Optimization Algorithm","authors":"Zýnnet Duygu Akþehýr, Selçuk Aslan","doi":"10.1109/SIU49456.2020.9302476","DOIUrl":"https://doi.org/10.1109/SIU49456.2020.9302476","url":null,"abstract":"The particle swarm optimization algorithm is a population-based algorithm used to solve optimization problems. In recent years, a parallel version of the PSO algorithm has proposed to solve complex application problems, and the situation has become the focus of researchers. Communication in this approach is ensured by the migration of particles between sub-population. In the parallel version of the PSO algorithm, parameters such as migration strategy, migration period, the topological structure must be determined. In this study, it was analyzed in which periods it would be more appropriate to perform migration procedures. In this context, the maximum number of iterations of 10000 is divided into three period intervals: 1000-3000, 3000-6000 and 6000-9000. Then, for cases where the number of threads is 2 and 4, the migration process is analyzed over these periods.","PeriodicalId":312627,"journal":{"name":"2020 28th Signal Processing and Communications Applications Conference (SIU)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121089606","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 : 2020-10-05DOI: 10.1109/SIU49456.2020.9302251
A. Kartci, N. Herencsar, K. Salama
The impedance characteristics of three different type of fractional-order capacitors (FOCs) with an order of -0.74, -0.79, and -0.91 are analyzed. The used devices have excellent feature such as constant phase angle in the frequency range 10 MHz - 100 MHz. Their impedance data is fitted with second-order passive electrical model structures of Foster-I abd Foster-II using standard EIA-48 compliant component values phase error. The effect on phase and pseudo-capacitance using a detailed experimental study of series-, parallel-, and inter-connected FOCs is also shown.
{"title":"Reliable High-Frequency Fabricated Fractional-Order Capacitors and Their Passive Circuit Models","authors":"A. Kartci, N. Herencsar, K. Salama","doi":"10.1109/SIU49456.2020.9302251","DOIUrl":"https://doi.org/10.1109/SIU49456.2020.9302251","url":null,"abstract":"The impedance characteristics of three different type of fractional-order capacitors (FOCs) with an order of -0.74, -0.79, and -0.91 are analyzed. The used devices have excellent feature such as constant phase angle in the frequency range 10 MHz - 100 MHz. Their impedance data is fitted with second-order passive electrical model structures of Foster-I abd Foster-II using standard EIA-48 compliant component values phase error. The effect on phase and pseudo-capacitance using a detailed experimental study of series-, parallel-, and inter-connected FOCs is also shown.","PeriodicalId":312627,"journal":{"name":"2020 28th Signal Processing and Communications Applications Conference (SIU)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127450814","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 : 2020-10-05DOI: 10.1109/SIU49456.2020.9302081
Işılay Bozkurt, G. Ulutaş
The manipulation processes made by deleting frames on videos are the fastest and laborless method of video forgery. The process of misleading people is done by cutting the frames of the scene or object to be hidden from the related video. With this study, designing a fast-running algorithm to detect in which location the frame deletion forgery is aimed for localization the forgery location. The test of the algorithm's resistance against different compression formats and different compression qualities was carried out. Frame deletion forgeries were performed in random sizes and locations on the videos obtained from SULFA and TRACE LIBRARY databases which used frequently in the literature. Forgery location was detected with 100% accuracy at uncompressed videos. In MPEG4 and H264 compressed videos, accuracies are %85 and %90 respectively. Average processing time is 0.0007 second for frame. Experimental results show that the proposed method can detect the forgery location with high accuracy.
{"title":"The Localization of Deleted Frames in the Forged Videos","authors":"Işılay Bozkurt, G. Ulutaş","doi":"10.1109/SIU49456.2020.9302081","DOIUrl":"https://doi.org/10.1109/SIU49456.2020.9302081","url":null,"abstract":"The manipulation processes made by deleting frames on videos are the fastest and laborless method of video forgery. The process of misleading people is done by cutting the frames of the scene or object to be hidden from the related video. With this study, designing a fast-running algorithm to detect in which location the frame deletion forgery is aimed for localization the forgery location. The test of the algorithm's resistance against different compression formats and different compression qualities was carried out. Frame deletion forgeries were performed in random sizes and locations on the videos obtained from SULFA and TRACE LIBRARY databases which used frequently in the literature. Forgery location was detected with 100% accuracy at uncompressed videos. In MPEG4 and H264 compressed videos, accuracies are %85 and %90 respectively. Average processing time is 0.0007 second for frame. Experimental results show that the proposed method can detect the forgery location with high accuracy.","PeriodicalId":312627,"journal":{"name":"2020 28th Signal Processing and Communications Applications Conference (SIU)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124907392","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 : 2020-10-05DOI: 10.1109/SIU49456.2020.9302244
Önder Aydemir, Amir Naser, Mehmet Öztürk
Technological advances in medicine allow us to learn more about human physiology, anatomy, endocrinology and neurology. In this way, many diseases can be diagnosed early and treatment processes can be closely monitored. On the one hand, the advancing technology allows us to demonstrate how the human brain reacts to various environmental stimuli. In this study, electroencephalography (EEG) technique was used to record the reactions of the brain to the imagination of cloves and mint odors. The distinguishability of brain responses to these odors was tested using pixel means of gray-level images obtained from Burg-based color spectrogram images. By using pixel means as an attribute, a classification accuracy of 82.5% was obtained with k-nearest neighbor. The results showed that the EEG signals that can occur when the brain imagines different odors can be distinguished.
{"title":"Classification of EEG Signals Recorded While Imagining Odors with Effective Band Pass Filter Parameters","authors":"Önder Aydemir, Amir Naser, Mehmet Öztürk","doi":"10.1109/SIU49456.2020.9302244","DOIUrl":"https://doi.org/10.1109/SIU49456.2020.9302244","url":null,"abstract":"Technological advances in medicine allow us to learn more about human physiology, anatomy, endocrinology and neurology. In this way, many diseases can be diagnosed early and treatment processes can be closely monitored. On the one hand, the advancing technology allows us to demonstrate how the human brain reacts to various environmental stimuli. In this study, electroencephalography (EEG) technique was used to record the reactions of the brain to the imagination of cloves and mint odors. The distinguishability of brain responses to these odors was tested using pixel means of gray-level images obtained from Burg-based color spectrogram images. By using pixel means as an attribute, a classification accuracy of 82.5% was obtained with k-nearest neighbor. The results showed that the EEG signals that can occur when the brain imagines different odors can be distinguished.","PeriodicalId":312627,"journal":{"name":"2020 28th Signal Processing and Communications Applications Conference (SIU)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125102484","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 : 2020-10-05DOI: 10.1109/SIU49456.2020.9302174
Ege Orkun Gamgam, Guven Yenihayat, T. Numanoglu
Global Navigation Satellite Systems (GNSS) is widely used for timing and localization in many critical industrial and military applications. However, it is not a nationalized technology and also suffers from jamming and spoofing attacks which makes it unreliable for standalone use in military systems. In this study, an alternative localization solution based on radio communication is developed without GNSS. This solution utilizes the time synchronization algorithm which is needed for preserving the network functionality. Several localization algorithms based on propogation delay measurements, which are mutually shared by the time synchronization algorithm, are studied. Better performing algorithms are integrated into the embedded software while employing the underlying waveform capabilities as much as possible. Therefore, a solution with advanced protection against electronic warfare is developed which requires no additional hardware. Studied localization methods are extensively investigated for various system parameters along with their resulting localization performance.
{"title":"Tactical Field Localization without GNSS","authors":"Ege Orkun Gamgam, Guven Yenihayat, T. Numanoglu","doi":"10.1109/SIU49456.2020.9302174","DOIUrl":"https://doi.org/10.1109/SIU49456.2020.9302174","url":null,"abstract":"Global Navigation Satellite Systems (GNSS) is widely used for timing and localization in many critical industrial and military applications. However, it is not a nationalized technology and also suffers from jamming and spoofing attacks which makes it unreliable for standalone use in military systems. In this study, an alternative localization solution based on radio communication is developed without GNSS. This solution utilizes the time synchronization algorithm which is needed for preserving the network functionality. Several localization algorithms based on propogation delay measurements, which are mutually shared by the time synchronization algorithm, are studied. Better performing algorithms are integrated into the embedded software while employing the underlying waveform capabilities as much as possible. Therefore, a solution with advanced protection against electronic warfare is developed which requires no additional hardware. Studied localization methods are extensively investigated for various system parameters along with their resulting localization performance.","PeriodicalId":312627,"journal":{"name":"2020 28th Signal Processing and Communications Applications Conference (SIU)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125143457","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 : 2020-10-05DOI: 10.1109/SIU49456.2020.9302260
M. B. Dilaver, Furkan Çakmak, E. Uslu, M. Amasyali, S. Yavuz
One of the platforms that autonomous exploration applications can be used is micro aerial vehicles, which are used by robotic scientists, because of their high dynamic capabilities. A robot needs to do navigation in its surrounding environment to be able to do exploration. In outdoor and indoor environments with obstacles around, sensing an environment and creating its map to do navigation is a common practice in robotic studies. An aerial vehicle is able to reach to a target position without crashing into static and dynamic obstacles, with the help of costmaps created in navigation applications. To prevent an aerial vehicle, which is trying to find a path to a target position, from getting crashed into other vehicles in applications with multiple aerial vehicles, that aerial vehicle needs to take into account the paths that found by other vehicles. In this way it's possible to prevent aerial vehicles getting crashed into each other. In this work, a simultaneous navigation application is developed for aerial vehicles that can build concurrent 3D multi maps. Experiments have been done in Gazebo simulation environment of ROS framework.
{"title":"3D Mapping and Simultaneous Navigation for Multi Micro Aerial Vehicles in Indoor Environments","authors":"M. B. Dilaver, Furkan Çakmak, E. Uslu, M. Amasyali, S. Yavuz","doi":"10.1109/SIU49456.2020.9302260","DOIUrl":"https://doi.org/10.1109/SIU49456.2020.9302260","url":null,"abstract":"One of the platforms that autonomous exploration applications can be used is micro aerial vehicles, which are used by robotic scientists, because of their high dynamic capabilities. A robot needs to do navigation in its surrounding environment to be able to do exploration. In outdoor and indoor environments with obstacles around, sensing an environment and creating its map to do navigation is a common practice in robotic studies. An aerial vehicle is able to reach to a target position without crashing into static and dynamic obstacles, with the help of costmaps created in navigation applications. To prevent an aerial vehicle, which is trying to find a path to a target position, from getting crashed into other vehicles in applications with multiple aerial vehicles, that aerial vehicle needs to take into account the paths that found by other vehicles. In this way it's possible to prevent aerial vehicles getting crashed into each other. In this work, a simultaneous navigation application is developed for aerial vehicles that can build concurrent 3D multi maps. Experiments have been done in Gazebo simulation environment of ROS framework.","PeriodicalId":312627,"journal":{"name":"2020 28th Signal Processing and Communications Applications Conference (SIU)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123790061","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 : 2020-10-05DOI: 10.1109/SIU49456.2020.9302180
Ender Kurnaz, R. Ceylan
Pancreas is one of the most challenging organs in segmentation due to its different shape, position and size in each human being. With the development of machine learning, various deep learning methods are applied to segment the pancreas among organs in the abdominal region. In this study, pancreas segmentation is performed using the U-Net model, which is one of the convolutional neural networks (CNN) models. The results of pancreas segmentation performed on the Pancreas CT data set obtained from The Cancer Imaging Archive (TCIA) database containing computed tomography images of 82 patients are presented in detail. According to the results, Dice similarity coefficient and Jaccard similarity coefficient are found to be 0.78 and 0.66, respectively.
{"title":"Pancreas Segmentation in Abdominal CT Images with U-Net Model","authors":"Ender Kurnaz, R. Ceylan","doi":"10.1109/SIU49456.2020.9302180","DOIUrl":"https://doi.org/10.1109/SIU49456.2020.9302180","url":null,"abstract":"Pancreas is one of the most challenging organs in segmentation due to its different shape, position and size in each human being. With the development of machine learning, various deep learning methods are applied to segment the pancreas among organs in the abdominal region. In this study, pancreas segmentation is performed using the U-Net model, which is one of the convolutional neural networks (CNN) models. The results of pancreas segmentation performed on the Pancreas CT data set obtained from The Cancer Imaging Archive (TCIA) database containing computed tomography images of 82 patients are presented in detail. According to the results, Dice similarity coefficient and Jaccard similarity coefficient are found to be 0.78 and 0.66, respectively.","PeriodicalId":312627,"journal":{"name":"2020 28th Signal Processing and Communications Applications Conference (SIU)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125558117","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
扫码关注我们
求助内容：
应助结果提醒方式：