TCP (Transmission Control Protocol) is the most used transport protocol for wired and wireless networks. It provides many services (reliability, end to end delivery ...) to the applications running over the Internet, but to be able to manage traffics with a huge quantity of data, TCP must have robust congestion control mechanisms. Many researchers have agreed that despite the existence of some congestion control algorithms, TCP still suffers from disappointing performances for short and long flows. For that, researches are still launched by the network community in order to have the suitable mechanism ensuring fair and efficient bandwidth allocation. The works already carried out in this subject has elaborated several congestion control mechanisms. In this paper, we discuss, identify, analyze and compare the behavior of some congestion control mechanisms under congested wireless mech networks, in order to identify their advantages and their respective limits. For the simulation, we used the well known network simulator ns2. Simulation results show that TCP Tahoe, TCP Reno, TCP New Reno, Sack are loss-based, they are beneficial for latency-sensitive flows, while TCP Vegas which is delay-based, it is recommended for applications that don't endure the loss of information but suffers from fairness problems when sharing a bottleneck with competitive flows.
TCP(传输控制协议)是有线和无线网络中最常用的传输协议。它为运行在Internet上的应用程序提供了许多服务(可靠性、端到端交付……)，但是为了能够管理大量数据的流量，TCP必须具有健壮的拥塞控制机制。许多研究人员一致认为，尽管存在一些拥塞控制算法，但TCP在短流和长流方面的性能仍然令人失望。为此，网络学界仍在开展研究，以期有合适的机制保证公平高效的带宽分配。本课题已经开展的工作阐述了几种拥塞控制机制。在本文中，我们讨论，识别，分析和比较一些拥塞控制机制在拥塞无线机械网络下的行为，以确定它们的优势和各自的局限性。在模拟中，我们使用了著名的网络模拟器ns2。仿真结果表明，TCP Tahoe、TCP Reno、TCP New Reno、Sack是基于时延的，它们有利于延迟敏感的流，而TCP Vegas是基于时延的，适合于不存在信息丢失，但在与竞争流共享瓶颈时存在公平性问题的应用。
{"title":"Comparative analysis of TCP congestion control mechanisms","authors":"Kaoutar Bazi, B. Nassereddine","doi":"10.1145/3386723.3387832","DOIUrl":"https://doi.org/10.1145/3386723.3387832","url":null,"abstract":"TCP (Transmission Control Protocol) is the most used transport protocol for wired and wireless networks. It provides many services (reliability, end to end delivery ...) to the applications running over the Internet, but to be able to manage traffics with a huge quantity of data, TCP must have robust congestion control mechanisms. Many researchers have agreed that despite the existence of some congestion control algorithms, TCP still suffers from disappointing performances for short and long flows. For that, researches are still launched by the network community in order to have the suitable mechanism ensuring fair and efficient bandwidth allocation. The works already carried out in this subject has elaborated several congestion control mechanisms. In this paper, we discuss, identify, analyze and compare the behavior of some congestion control mechanisms under congested wireless mech networks, in order to identify their advantages and their respective limits. For the simulation, we used the well known network simulator ns2. Simulation results show that TCP Tahoe, TCP Reno, TCP New Reno, Sack are loss-based, they are beneficial for latency-sensitive flows, while TCP Vegas which is delay-based, it is recommended for applications that don't endure the loss of information but suffers from fairness problems when sharing a bottleneck with competitive flows.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129716606","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 features of multimedia contents impose additional requirements such as high bandwidth demand, more energy consumption and processing capabilities. Routing multimedia data in a resource constrained network is a challenge in Wireless multimedia Sensor networks (WMSNs), multipath routing technique is a relevant solution for transmitting multimedia data in wireless sensor networks to satisfy multimedia QoS requirements. This paper proposes an improved version of AGEM protocol based Triangle link quality metric (TLQM-AGEM) which finds multiple node-disjoint paths. This routing scheme selects forwarding node based on distance, a triangle link quality metric and remaining energy. Simulation results indicate that protocol optimizes overall performance and improves network lifetime as compared with state of the art GEAMS and AGEM schemes.
{"title":"AGEM-based Multipath Routing Protocol using Triangle Link Quality for Wireless Multimedia Sensor networks","authors":"Asma Chikh, M. Lehsaini","doi":"10.1145/3386723.3387855","DOIUrl":"https://doi.org/10.1145/3386723.3387855","url":null,"abstract":"The features of multimedia contents impose additional requirements such as high bandwidth demand, more energy consumption and processing capabilities. Routing multimedia data in a resource constrained network is a challenge in Wireless multimedia Sensor networks (WMSNs), multipath routing technique is a relevant solution for transmitting multimedia data in wireless sensor networks to satisfy multimedia QoS requirements. This paper proposes an improved version of AGEM protocol based Triangle link quality metric (TLQM-AGEM) which finds multiple node-disjoint paths. This routing scheme selects forwarding node based on distance, a triangle link quality metric and remaining energy. Simulation results indicate that protocol optimizes overall performance and improves network lifetime as compared with state of the art GEAMS and AGEM schemes.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116570644","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 development of digital tecnnologies nowadays assists people by suggesting opinion, choices, preferences and feelings. This opinion is useful for company's engagement to make certain analysis to know their potential users and personalized their need. However, the information needs extraction to make further analysis. Thus, sentiment analysis is used to extract opinion and others and transform it into meaningful data. During the process of analysis, feature selection method is required to select a subset which consists of relevant features to construct a predictive model. This process requires some conditions during the selection of feature subset. The required conditions for feature selection are that the selected feature subset must be small and relevant for a high dimensional dataset which considers the presence of noise plus there are no redundant features. However, some of the feature selection methods unable to fulfill all conditions. In this research, 40 papers were collected, classified and reviewed. We discussed on the feature selection methods in sentiment analysis based on its level of analysis and make comparison between these methods to know its limitation and advantages. The comparison made between methods are based on its accuracy and CPU performance. Finally, suggest the best/benchmark method for feature selection. The findings obtained from this research shows that hybrid methods obtain the best accuracy and CPU performance compared to the other methods.
{"title":"Feature Selection Methods in Sentiment Analysis: A Review","authors":"Nurilhami Izzatie Khairi, A. Mohamed, N. Yusof","doi":"10.1145/3386723.3387840","DOIUrl":"https://doi.org/10.1145/3386723.3387840","url":null,"abstract":"The development of digital tecnnologies nowadays assists people by suggesting opinion, choices, preferences and feelings. This opinion is useful for company's engagement to make certain analysis to know their potential users and personalized their need. However, the information needs extraction to make further analysis. Thus, sentiment analysis is used to extract opinion and others and transform it into meaningful data. During the process of analysis, feature selection method is required to select a subset which consists of relevant features to construct a predictive model. This process requires some conditions during the selection of feature subset. The required conditions for feature selection are that the selected feature subset must be small and relevant for a high dimensional dataset which considers the presence of noise plus there are no redundant features. However, some of the feature selection methods unable to fulfill all conditions. In this research, 40 papers were collected, classified and reviewed. We discussed on the feature selection methods in sentiment analysis based on its level of analysis and make comparison between these methods to know its limitation and advantages. The comparison made between methods are based on its accuracy and CPU performance. Finally, suggest the best/benchmark method for feature selection. The findings obtained from this research shows that hybrid methods obtain the best accuracy and CPU performance compared to the other methods.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"408 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122735356","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}
One of the challenges in many industrial activities is to analyze the products and investigate their dimensional properties, such as deformations. The digital speckle pattern interferometry technique offers several solutions for the measurement of wide range of parameters (deformations, displacements...) with high accuracy. Generally, there is a correlation between these parameters and the phase of the noisy reflected intensity images (also called correlation fringe patterns or correlograms) of the tested products. Thus, getting access to these parameters requires a good estimation of the phase information. To extract this phase, we propose a ridgelet transform based algorithm for the fringes demodulation, after have been denoised by a new variant of total variation denoising method. These algorithms provide an automatic estimation of the phase feature with high accuracy. Because of such advantages, this method is particularly suitable for real time analyzing of dynamic events even in perturbative environments.
{"title":"Speckled correlation fringes denoising and demodulation using directional total variation and ridgelet transform","authors":"Mustapha Bahich, Mohammed Bailich","doi":"10.1145/3386723.3387864","DOIUrl":"https://doi.org/10.1145/3386723.3387864","url":null,"abstract":"One of the challenges in many industrial activities is to analyze the products and investigate their dimensional properties, such as deformations. The digital speckle pattern interferometry technique offers several solutions for the measurement of wide range of parameters (deformations, displacements...) with high accuracy. Generally, there is a correlation between these parameters and the phase of the noisy reflected intensity images (also called correlation fringe patterns or correlograms) of the tested products. Thus, getting access to these parameters requires a good estimation of the phase information. To extract this phase, we propose a ridgelet transform based algorithm for the fringes demodulation, after have been denoised by a new variant of total variation denoising method. These algorithms provide an automatic estimation of the phase feature with high accuracy. Because of such advantages, this method is particularly suitable for real time analyzing of dynamic events even in perturbative environments.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121400858","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}
Free codes are investigated. It is illustrated that every free cyclic has some important proprieties and the minimal distance of every code depends upon its associated direct component.
研究免费代码。说明了每一个自由循环都有一些重要的性质，每一个码的最小距离取决于它所关联的直接分量。
{"title":"Some Properties of Free Cyclic Codes over Finite Chain Rings","authors":"M. Sabiri, Youssef Bensalih, A. Elbour","doi":"10.1145/3386723.3387856","DOIUrl":"https://doi.org/10.1145/3386723.3387856","url":null,"abstract":"Free codes are investigated. It is illustrated that every free cyclic has some important proprieties and the minimal distance of every code depends upon its associated direct component.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128639869","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}
Automatic classification of medical images especially of tissue images is an important task in computer aided diagnosis (CAD) systems. Deep learning methods such as convolutional networks (ConvNets) outperform other state of-the-art methods in images classification tasks. This article describes an accurate and efficient algorithms for this challenging problem, and aims to present different convolutional neural networks to classify the tissue images. first, we built a model that consist of feature extraction and the classification with simple CNN, the second model consist of a CNN as feature extractor by removing the classification layers and using the activations of the last fully connected layer to train Random Forest, and the last one using transfer learning --Fine-Tuning-- pre-trained CNN "DenseNet201". Finally, we have evaluated our models using three metrics: accuracy, Precision and F1 Score.
{"title":"An efficient Algorithm for medical image classification using Deep Convolutional Network: Case of Cancer Pathology","authors":"Dahdouh Yousra, A. Boudhir, M. Ahmed","doi":"10.1145/3386723.3387896","DOIUrl":"https://doi.org/10.1145/3386723.3387896","url":null,"abstract":"Automatic classification of medical images especially of tissue images is an important task in computer aided diagnosis (CAD) systems. Deep learning methods such as convolutional networks (ConvNets) outperform other state of-the-art methods in images classification tasks. This article describes an accurate and efficient algorithms for this challenging problem, and aims to present different convolutional neural networks to classify the tissue images. first, we built a model that consist of feature extraction and the classification with simple CNN, the second model consist of a CNN as feature extractor by removing the classification layers and using the activations of the last fully connected layer to train Random Forest, and the last one using transfer learning --Fine-Tuning-- pre-trained CNN \"DenseNet201\". Finally, we have evaluated our models using three metrics: accuracy, Precision and F1 Score.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131129535","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}
Sanaa Errahili, Asma Khabba, S. Ibnyaich, M. Hassani
In this paper, a new frequency reconfigurable patch antenna is proposed. The planned antenna is designed on the dielectric substrate of FR4-epoxy with 4.4 relative permittivity, with a compact volume of 25 × 21 × 1.67mm3. The proposed antenna is formed of a Positive Intrinsic Negative diode (PIN diode), placed at the radiating patch to achieve frequency reconfigurability. Based on the switching state of the PIN diode, the antenna is capable of operating at two different frequency ranges. The simulation of the proposed antenna is implemented using CST microwave studio, it was re-simulated in Ansys HFSS software to confirm the results obtained. The performance of the antenna is analysed from the reflection coefficient, the voltage standing wave ratio(VSWR), the surface current distribution and the radiation pattern. The antenna has two resonant frequencies: 3.44 GHz (Worldwide Interoperability for Microwave Access (WiMAX)) and 5.26 GHz (Wireless Local Area Network (WLAN)).
{"title":"New Frequency Reconfigurable Patch Antenna for Wireless Communication","authors":"Sanaa Errahili, Asma Khabba, S. Ibnyaich, M. Hassani","doi":"10.1145/3386723.3387879","DOIUrl":"https://doi.org/10.1145/3386723.3387879","url":null,"abstract":"In this paper, a new frequency reconfigurable patch antenna is proposed. The planned antenna is designed on the dielectric substrate of FR4-epoxy with 4.4 relative permittivity, with a compact volume of 25 × 21 × 1.67mm3. The proposed antenna is formed of a Positive Intrinsic Negative diode (PIN diode), placed at the radiating patch to achieve frequency reconfigurability. Based on the switching state of the PIN diode, the antenna is capable of operating at two different frequency ranges. The simulation of the proposed antenna is implemented using CST microwave studio, it was re-simulated in Ansys HFSS software to confirm the results obtained. The performance of the antenna is analysed from the reflection coefficient, the voltage standing wave ratio(VSWR), the surface current distribution and the radiation pattern. The antenna has two resonant frequencies: 3.44 GHz (Worldwide Interoperability for Microwave Access (WiMAX)) and 5.26 GHz (Wireless Local Area Network (WLAN)).","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122613567","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}
Digital image Watermarking is a way to achieve information security. In this paper, we present an algorithm for digital image watermarking based on 2-level Discrete Wavelet Transform (DWT), Discrete Cosine Transform (DCT) and QR decomposition. The watermark embedding process is performed on specific blocks of the host image according to its entropy values. The experimental results show that this algorithm has good features of imperceptibility and it is robust against different attacks.
{"title":"An Algorithm for Digital Image Watermarking using 2-Level DWT, DCT and QR Decomposition based on Optimal Blocks Selection","authors":"M. Zairi, T. Boujiha, Ouelli Abdelhaq","doi":"10.1145/3386723.3387863","DOIUrl":"https://doi.org/10.1145/3386723.3387863","url":null,"abstract":"Digital image Watermarking is a way to achieve information security. In this paper, we present an algorithm for digital image watermarking based on 2-level Discrete Wavelet Transform (DWT), Discrete Cosine Transform (DCT) and QR decomposition. The watermark embedding process is performed on specific blocks of the host image according to its entropy values. The experimental results show that this algorithm has good features of imperceptibility and it is robust against different attacks.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127850974","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 technological evolution and the immensity of the data produced, circulated into company makes these data, the real capital of the companies to the detriment of the customers. The erroneous data put the knockout to relationships with customers, the company must address this problem and identify the quality projects on which it must make an effort. In this article, we will present an approach based on qualitative and quantitative analysis to help the decision-makers to target data by its impacts and complexities of process improvement. The Qualitative study will be a survey and a quantitative to learn from survey data to decide the prediction and the completeness of data.
{"title":"Contribution of Artificial Neural Network in Predicting Completeness Through the Impact and Complexity of its Improvement","authors":"Jaouad Maqboul, Bouchaib Bounabat Jaouad","doi":"10.1145/3386723.3387850","DOIUrl":"https://doi.org/10.1145/3386723.3387850","url":null,"abstract":"The technological evolution and the immensity of the data produced, circulated into company makes these data, the real capital of the companies to the detriment of the customers. The erroneous data put the knockout to relationships with customers, the company must address this problem and identify the quality projects on which it must make an effort. In this article, we will present an approach based on qualitative and quantitative analysis to help the decision-makers to target data by its impacts and complexities of process improvement. The Qualitative study will be a survey and a quantitative to learn from survey data to decide the prediction and the completeness of data.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128963029","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}
Color interest point detection is an important research area in the field of image processing and computer vision. In general, the use of color increases the distinctiveness of interest points. In this article we propose to extend the detection of the color interest point to the temporal aspect. For color sequences, we propose an extension version of the Color interest point detector to detect what they call "Color Space- Time Interest Points detector" (CSTIP). To increase the robustness of CSTIP features extraction, we suggest a pre-processing step which is based on a dynamic decomposition model and can decomposes the video into the dynamic color texture component and the dynamic color structure component. We compute the new Color Space Time Interest Points (CSTIP) associated to the dynamic color texture (DCT) components by using the proposed algorithm of the detection of Color Space- Time Interest Points. Experimental results are obtained from very different types of videos, namely sport videos and animation movies.
{"title":"Motion Detection Using the Dynamic Color Texture","authors":"I. Bellamine, H. Silkan, A. Tmiri","doi":"10.1145/3386723.3387825","DOIUrl":"https://doi.org/10.1145/3386723.3387825","url":null,"abstract":"Color interest point detection is an important research area in the field of image processing and computer vision. In general, the use of color increases the distinctiveness of interest points. In this article we propose to extend the detection of the color interest point to the temporal aspect. For color sequences, we propose an extension version of the Color interest point detector to detect what they call \"Color Space- Time Interest Points detector\" (CSTIP). To increase the robustness of CSTIP features extraction, we suggest a pre-processing step which is based on a dynamic decomposition model and can decomposes the video into the dynamic color texture component and the dynamic color structure component. We compute the new Color Space Time Interest Points (CSTIP) associated to the dynamic color texture (DCT) components by using the proposed algorithm of the detection of Color Space- Time Interest Points. Experimental results are obtained from very different types of videos, namely sport videos and animation movies.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127463958","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
扫码关注我们
求助内容：
应助结果提醒方式：