Pub Date : 2012-09-01DOI: 10.1109/INTECH.2012.6457754
Maryem Rhanoui, B. E. Asri
Service Component Architecture (SCA) is a recent approach and an industry standard for developing complex and distributed systems. Despite the growing research work it still lacks a formal basis for handling trust and reliability of quality-driven systems. In this paper we present main techniques and models for assuring quality and trustworthiness of component-based systems in general, and then we present and justify the choice of the design by contract approach that we adopted for the following of our research about SCA-based systems. Design by Contract is an approach of software design that aims to address reliability and quality issues in software development by expressing a set of its properties and constraints.
{"title":"Towards contract-based approach for quality-driven Service Component Architecture","authors":"Maryem Rhanoui, B. E. Asri","doi":"10.1109/INTECH.2012.6457754","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457754","url":null,"abstract":"Service Component Architecture (SCA) is a recent approach and an industry standard for developing complex and distributed systems. Despite the growing research work it still lacks a formal basis for handling trust and reliability of quality-driven systems. In this paper we present main techniques and models for assuring quality and trustworthiness of component-based systems in general, and then we present and justify the choice of the design by contract approach that we adopted for the following of our research about SCA-based systems. Design by Contract is an approach of software design that aims to address reliability and quality issues in software development by expressing a set of its properties and constraints.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"603 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123221782","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457780
A. Amirat, A. Menasria, M. A. Oubelli, N. Younsi
Formal verification of UML diagram is the act of proving or disproving the correctness of intended algorithms underlying a system with respect to a certain formal specification or property, using formal methods of mathematics. The most widely used techniques for system or software verification are: simulation and testing, deductive verification and Model checking. Model checking is a formal verification technique, in which an abstract model of a system is testing automatically to verify whether this model meets a given specification. SPIN Model checker is a popular open-source software tool used for the formal verification of distributed software systems. This article proposes a method for converting UML sequence diagrams with imbricate combined fragment automatically to PROMELA code to simulate the execution and to verify properties written in Linear Temporal Logic (LTL) with SPIN Model checker.
{"title":"Automatic generation of PROMELA code from sequence diagram with imbricate combined fragments","authors":"A. Amirat, A. Menasria, M. A. Oubelli, N. Younsi","doi":"10.1109/INTECH.2012.6457780","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457780","url":null,"abstract":"Formal verification of UML diagram is the act of proving or disproving the correctness of intended algorithms underlying a system with respect to a certain formal specification or property, using formal methods of mathematics. The most widely used techniques for system or software verification are: simulation and testing, deductive verification and Model checking. Model checking is a formal verification technique, in which an abstract model of a system is testing automatically to verify whether this model meets a given specification. SPIN Model checker is a popular open-source software tool used for the formal verification of distributed software systems. This article proposes a method for converting UML sequence diagrams with imbricate combined fragment automatically to PROMELA code to simulate the execution and to verify properties written in Linear Temporal Logic (LTL) with SPIN Model checker.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123270427","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457752
N. Taghezout, Amina Saidi, Imène Bessedik
Entreprise collaboration is being enhanced by virtual communities that leverage social linking and tagging tools (like tools for social networking, social book marking and social search), user-contributed content management platforms (like entreprise Wikis, blogs and forums,) tools that leverage user opinions, etc. In this paper, we envisage a combination of Software agents and Web 2.0 technologies within a platform of a Web-Based Decision Support System. This paper develops a simple framework to help understand the collaboration that is afforded by Web 2.0 applications. The proposed framework is used to examine how production agents can create, share and exchange experiences on diagnosis and resources failures with each other to have new ideas or useful information for the decision-making process. ALFATRON electronics industry is selected as an application domain in this study.
{"title":"Web 2.0 integration in a Web-Based Decision Support System: Effect study of social networking on decision-making","authors":"N. Taghezout, Amina Saidi, Imène Bessedik","doi":"10.1109/INTECH.2012.6457752","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457752","url":null,"abstract":"Entreprise collaboration is being enhanced by virtual communities that leverage social linking and tagging tools (like tools for social networking, social book marking and social search), user-contributed content management platforms (like entreprise Wikis, blogs and forums,) tools that leverage user opinions, etc. In this paper, we envisage a combination of Software agents and Web 2.0 technologies within a platform of a Web-Based Decision Support System. This paper develops a simple framework to help understand the collaboration that is afforded by Web 2.0 applications. The proposed framework is used to examine how production agents can create, share and exchange experiences on diagnosis and resources failures with each other to have new ideas or useful information for the decision-making process. ALFATRON electronics industry is selected as an application domain in this study.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123865920","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457774
El Hassan El Mimouni, Mohammed Karim
The QRS detection is the entry point for almost all the ECG applications. This paper presents a new simple and efficient FPGA-Based implementation of the well-known Pan and Tompkins QRS detection algorithm. The design is implemented using Xilinx design tool, System Generator for DSP. In the authors' view, the specific features, that is simplicity, efficiency and authenticity, of the proposed model lies in the fact that the threshold value is updated for the next peak detection, from the previous smallest peak; in addition, the model is entirely designed simply with MCode blocks. The hardware design is tested with five 30 minutes data records obtained from the MIT-BIH Arrhythmia database. Its accuracy exceeds 96%, knowing that four records among the five represent the worst cases in the database.
{"title":"Novel simple decision stage of Pan & Tompkins QRS detector and its FPGA-Based implementation","authors":"El Hassan El Mimouni, Mohammed Karim","doi":"10.1109/INTECH.2012.6457774","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457774","url":null,"abstract":"The QRS detection is the entry point for almost all the ECG applications. This paper presents a new simple and efficient FPGA-Based implementation of the well-known Pan and Tompkins QRS detection algorithm. The design is implemented using Xilinx design tool, System Generator for DSP. In the authors' view, the specific features, that is simplicity, efficiency and authenticity, of the proposed model lies in the fact that the threshold value is updated for the next peak detection, from the previous smallest peak; in addition, the model is entirely designed simply with MCode blocks. The hardware design is tested with five 30 minutes data records obtained from the MIT-BIH Arrhythmia database. Its accuracy exceeds 96%, knowing that four records among the five represent the worst cases in the database.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128663681","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457758
H. Touil, Y. Fakhri, M. Benattou
The Wireless Multimedia Sensor Networks (WMSN) are confronted with two basic constraints that are the strong constraint of the energy consumption, and the strong constraint of the traffic performance (Delay, Throughput, etc.). To try to satisfy these two constraints, the IEEE 802.11e Enhanced Distributed Channel Access (EDCA) has been used at the MAC layer in the WMSN. The EDCA access method maintains four MAC queues of type Drop-Tail which corresponds to four Access Categories (AC). Knowing that WMSN are limited in terms of memory, the size of these four MAC queues must be well adjusted to avoid wasting memory space, and at the same time for not increasing the packet delay to ensure better traffic performance. In this paper we will not try to find the optimum value of these four MAC queues of type Drop-Tail used by EDCA. By against, we study the existence or absence of influence of the size of these four queues on energy consumption. The results show that the size of these four queues has a very low impact (negligible) on energy consumption, but directly influences the delay, with a small increase in Packet Delivery Rate (PDR) and a variation of the throughput.
{"title":"MAC queue size and energy-efficient of IEEE 802.11e EDCA in Wireless Multimedia Sensor Networks","authors":"H. Touil, Y. Fakhri, M. Benattou","doi":"10.1109/INTECH.2012.6457758","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457758","url":null,"abstract":"The Wireless Multimedia Sensor Networks (WMSN) are confronted with two basic constraints that are the strong constraint of the energy consumption, and the strong constraint of the traffic performance (Delay, Throughput, etc.). To try to satisfy these two constraints, the IEEE 802.11e Enhanced Distributed Channel Access (EDCA) has been used at the MAC layer in the WMSN. The EDCA access method maintains four MAC queues of type Drop-Tail which corresponds to four Access Categories (AC). Knowing that WMSN are limited in terms of memory, the size of these four MAC queues must be well adjusted to avoid wasting memory space, and at the same time for not increasing the packet delay to ensure better traffic performance. In this paper we will not try to find the optimum value of these four MAC queues of type Drop-Tail used by EDCA. By against, we study the existence or absence of influence of the size of these four queues on energy consumption. The results show that the size of these four queues has a very low impact (negligible) on energy consumption, but directly influences the delay, with a small increase in Packet Delivery Rate (PDR) and a variation of the throughput.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130054835","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457802
M. Aldwairi, Y. Flaifel
Spam has evolved in terms of contents, methods, delivery networks and volume. Reports indicate that up to 90% of the World Wide Web email traffic is spam [1]. The contents are covering a wider range and are deviating from the conventional pharmaceuticals and adult content into more formal marketing campaigns. This illegal advertising is evolving into an underground market for bot masters who rent or sell spam agents. Progressively, spam campaigns engage new methods to ensure efficient mass delivery and dodge conventional spam detectors. They employ very complicated and vast infrastructure of Botnets and Fast Flux Networks to deliver as many emails as possible. The main concerns for spam detection process are detection and misclassification accuracies, and those remain a challenge because of the evolving techniques employed by spammers. In this paper we propose a bit-parallel string matching spam filtering system based on the improved Baeza-Yates and Navarro approximate string matching algorithm. This method has a low computational cost, is easy to implement, and has the potential to catch misspelled keywords. The proposed approach achieves 97.2% overall accuracy with a simple Naive Bayes classifier.
{"title":"Baeza-Yates and Navarro approximate string matching for spam filtering","authors":"M. Aldwairi, Y. Flaifel","doi":"10.1109/INTECH.2012.6457802","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457802","url":null,"abstract":"Spam has evolved in terms of contents, methods, delivery networks and volume. Reports indicate that up to 90% of the World Wide Web email traffic is spam [1]. The contents are covering a wider range and are deviating from the conventional pharmaceuticals and adult content into more formal marketing campaigns. This illegal advertising is evolving into an underground market for bot masters who rent or sell spam agents. Progressively, spam campaigns engage new methods to ensure efficient mass delivery and dodge conventional spam detectors. They employ very complicated and vast infrastructure of Botnets and Fast Flux Networks to deliver as many emails as possible. The main concerns for spam detection process are detection and misclassification accuracies, and those remain a challenge because of the evolving techniques employed by spammers. In this paper we propose a bit-parallel string matching spam filtering system based on the improved Baeza-Yates and Navarro approximate string matching algorithm. This method has a low computational cost, is easy to implement, and has the potential to catch misspelled keywords. The proposed approach achieves 97.2% overall accuracy with a simple Naive Bayes classifier.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125517566","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457798
S. Belhia, A. Gafour
In this paper, we propose the fusion of two uni-modal biométric verification systems, based on face and offline signature. The extraction of Gabor filter parameters is studied in two ways. A new paradigm is proposed in machine learning as the spiking neuron network) called Liquid State Machine, strategy at fusion feature vector is used and tested. The experiment is performed on a multimodal database consisting of 400 images of 80 subjects (i.e. five images per subject,), three images are used for training and two are used for testing. Good performance is obtained by merging: the contribution of multi-modality is confirmed. This preliminary study confirms the feasibility of a robust and reliable multimodal biométrie system.
在本文中，我们提出了两种基于人脸和离线签名的单模态生物身份验证系统的融合。研究了两种方法提取Gabor滤波器参数。提出了一种新的机器学习范式——脉冲神经元网络——液态机(Liquid State machine)，并对融合特征向量的策略进行了测试。实验在一个多模态数据库上进行，该数据库由80个受试者的400张图像组成(即每个受试者5张图像)，其中3张用于训练，2张用于测试。通过合并获得了良好的性能，证实了多模态的贡献。这一初步研究证实了一个健壮可靠的多模态生物交换系统的可行性。
{"title":"Feature level fusion in multimodal biometrie identification","authors":"S. Belhia, A. Gafour","doi":"10.1109/INTECH.2012.6457798","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457798","url":null,"abstract":"In this paper, we propose the fusion of two uni-modal biométric verification systems, based on face and offline signature. The extraction of Gabor filter parameters is studied in two ways. A new paradigm is proposed in machine learning as the spiking neuron network) called Liquid State Machine, strategy at fusion feature vector is used and tested. The experiment is performed on a multimodal database consisting of 400 images of 80 subjects (i.e. five images per subject,), three images are used for training and two are used for testing. Good performance is obtained by merging: the contribution of multi-modality is confirmed. This preliminary study confirms the feasibility of a robust and reliable multimodal biométrie system.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"10 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120995482","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457757
B. Ahmed, Z. Ouadoudi, R. Mohamed, O. Mohamed
In the standard AODV protocol, the shortest path is always selected. But this shortest path is the easiest broken one. In this paper, we propose an improvement of AODV protocol called AMAODV(Adaptative Mobility aware AODV). This protocol is based on considering the distance and relative velocity between each node and one hop neighbor. Which permits to avoid losing route. Through the simulation, it is confirmed that this improvement has higher package delivery fraction than basic AODV protocol.
{"title":"Enhancements in AODV routing using velocity and distance","authors":"B. Ahmed, Z. Ouadoudi, R. Mohamed, O. Mohamed","doi":"10.1109/INTECH.2012.6457757","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457757","url":null,"abstract":"In the standard AODV protocol, the shortest path is always selected. But this shortest path is the easiest broken one. In this paper, we propose an improvement of AODV protocol called AMAODV(Adaptative Mobility aware AODV). This protocol is based on considering the distance and relative velocity between each node and one hop neighbor. Which permits to avoid losing route. Through the simulation, it is confirmed that this improvement has higher package delivery fraction than basic AODV protocol.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125533814","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457806
B. E. Ghali, A. E. Qadi, M. Ouadou, D. Aboutajdine
A plenty of Query Expansion techniques have been proposed to solve the problems of information retrieval systems, but new challenges has been introduced for these methods of expansion of user queries because of the rapid growth of the size of the Web collection. In this paper we have focused our attention on the improvement of the precision of the user query by a Probabilistic Query Expansion Method. Our approach consists on the use of information contained in query logs, which includes past user queries and their clicked documents, for providing high-level recommendations. The experiment results shows that the precision of the short queries increases even if we add a few terms, but the same number of terms added don't affect the long queries precision as much as for the short queries.
{"title":"Probabilistic Query Expansion method using recommended past user queries","authors":"B. E. Ghali, A. E. Qadi, M. Ouadou, D. Aboutajdine","doi":"10.1109/INTECH.2012.6457806","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457806","url":null,"abstract":"A plenty of Query Expansion techniques have been proposed to solve the problems of information retrieval systems, but new challenges has been introduced for these methods of expansion of user queries because of the rapid growth of the size of the Web collection. In this paper we have focused our attention on the improvement of the precision of the user query by a Probabilistic Query Expansion Method. Our approach consists on the use of information contained in query logs, which includes past user queries and their clicked documents, for providing high-level recommendations. The experiment results shows that the precision of the short queries increases even if we add a few terms, but the same number of terms added don't affect the long queries precision as much as for the short queries.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115483470","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 : 2012-09-01DOI: 10.1109/INTECH.2012.6457762
N. Zhar, M. A. Ali, M. Eleuldj
In this paper we identify the requirements of a design tool for the implementation of image and video processing algorithms in hardware platforms such as FPGA or ASIC. We discuss the advantages and weaknesses of some existing design languages. Finally, we propose our solution, in compliance with specified requirements, which intends to bypass the shortcomings of existing languages by providing a high-level of abstraction through two kinds of diagrams; structural diagram and filter edition diagram. It also allows a formal verification and automatic code generation for an ASIC or a FPGA implementation.
{"title":"Toward a graphical tool for image and video processing embedded systems design","authors":"N. Zhar, M. A. Ali, M. Eleuldj","doi":"10.1109/INTECH.2012.6457762","DOIUrl":"https://doi.org/10.1109/INTECH.2012.6457762","url":null,"abstract":"In this paper we identify the requirements of a design tool for the implementation of image and video processing algorithms in hardware platforms such as FPGA or ASIC. We discuss the advantages and weaknesses of some existing design languages. Finally, we propose our solution, in compliance with specified requirements, which intends to bypass the shortcomings of existing languages by providing a high-level of abstraction through two kinds of diagrams; structural diagram and filter edition diagram. It also allows a formal verification and automatic code generation for an ASIC or a FPGA implementation.","PeriodicalId":369113,"journal":{"name":"Second International Conference on the Innovative Computing Technology (INTECH 2012)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115254821","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
扫码关注我们
求助内容：
应助结果提醒方式：