Pub Date : 2012-12-01DOI: 10.1109/ICCSII.2012.6454297
A. Khadidja, B. Nadjia, O. Saliha
The rapid development of computer tools allows the computer system to stoke very large amount of data with many parameters such as electronic payment systems, sensors and monitoring systems and other. We talk about large data bases along both dimensions: number of recordings and number of dimensions "attribute, variable". Analysis of these data becomes very important and difficult in the same time. The visual data analysis has great potential applications because it facilitates the analysis, interpretation, validation and also increases the cognitive aspect among analysts. However, the traditional techniques of visualization of multidimensional data, such as parallel coordinates, glyphs, and scatter plot matrices, do not scale well to a very large data set. The increasing size and complexity of data sets is a new challenge and a key motivation for our works. In this article, we present our proposal approach VSCDR (Visual Single Cluster Dimension Reduction Approach) that can handle with big data.
计算机工具的迅速发展使计算机系统能够存储大量具有许多参数的数据，如电子支付系统、传感器和监控系统等。我们从两个维度来讨论大型数据库:记录的数量和“属性、变量”的维度数量。同时，对这些数据的分析也变得非常重要和困难。可视化数据分析具有很大的应用潜力，因为它方便了分析、解释、验证，也增加了分析人员之间的认知方面。然而，传统的多维数据可视化技术，如平行坐标、字形和散点图矩阵，不能很好地扩展到非常大的数据集。数据集的规模和复杂性的增加是一个新的挑战，也是我们工作的关键动力。在本文中，我们提出了一种可以处理大数据的方法VSCDR (Visual Single Cluster Dimension Reduction approach)。
{"title":"Visual Single Cluster of multidimensional data","authors":"A. Khadidja, B. Nadjia, O. Saliha","doi":"10.1109/ICCSII.2012.6454297","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454297","url":null,"abstract":"The rapid development of computer tools allows the computer system to stoke very large amount of data with many parameters such as electronic payment systems, sensors and monitoring systems and other. We talk about large data bases along both dimensions: number of recordings and number of dimensions \"attribute, variable\". Analysis of these data becomes very important and difficult in the same time. The visual data analysis has great potential applications because it facilitates the analysis, interpretation, validation and also increases the cognitive aspect among analysts. However, the traditional techniques of visualization of multidimensional data, such as parallel coordinates, glyphs, and scatter plot matrices, do not scale well to a very large data set. The increasing size and complexity of data sets is a new challenge and a key motivation for our works. In this article, we present our proposal approach VSCDR (Visual Single Cluster Dimension Reduction Approach) that can handle with big data.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132509319","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-12-01DOI: 10.1109/iccsii.2012.6454604
A. Azadeh, S. M. Haghighi, H. Saedi
In this study, an integrated Simulation-Data Envelopment Analysis (DEA) approach is presented to deal with a job shop facility layout design problem for an Iranian gas company. In this workshop, it is considered that the some parts of production equipment fail to operate and it is necessary to repair them, as soon as possible. The process of repairing these parts includes different operations on different facilities and the optimal layout of facilities in maintenance shop can reduce the process time. The layout problem in this system involves determining the location of all maintenance shop facilities. Layout optimization plays a crucial role in this type of problems in terms of increasing the efficiency of the main production line. To do so, different types of layout is considered including U-shaped, S-shaped, W-shaped, Z-shaped, and straight line layouts. First, the system is modeled with discrete-event-simulation as a powerful tool for analyzing complex systems. Time in system (TIS), average waiting time (AWT), average machine utilization (AMU), average availability (AA) of facilities, average length queue of facilities (AL) and average operator utilization (AOU) are obtained from simulation as key performance indicators (KPIs). Also, safety is considered as another KPI in this article. Finally, a unified non-radial Data Envelopment Analysis approach is presented with respect to the set of comprehensive indicators obtained in previous steps in order to rank all proposed layouts to find the best configuration of facilities.
{"title":"An integrated simulation-DEA algorithm for layout optimization","authors":"A. Azadeh, S. M. Haghighi, H. Saedi","doi":"10.1109/iccsii.2012.6454604","DOIUrl":"https://doi.org/10.1109/iccsii.2012.6454604","url":null,"abstract":"In this study, an integrated Simulation-Data Envelopment Analysis (DEA) approach is presented to deal with a job shop facility layout design problem for an Iranian gas company. In this workshop, it is considered that the some parts of production equipment fail to operate and it is necessary to repair them, as soon as possible. The process of repairing these parts includes different operations on different facilities and the optimal layout of facilities in maintenance shop can reduce the process time. The layout problem in this system involves determining the location of all maintenance shop facilities. Layout optimization plays a crucial role in this type of problems in terms of increasing the efficiency of the main production line. To do so, different types of layout is considered including U-shaped, S-shaped, W-shaped, Z-shaped, and straight line layouts. First, the system is modeled with discrete-event-simulation as a powerful tool for analyzing complex systems. Time in system (TIS), average waiting time (AWT), average machine utilization (AMU), average availability (AA) of facilities, average length queue of facilities (AL) and average operator utilization (AOU) are obtained from simulation as key performance indicators (KPIs). Also, safety is considered as another KPI in this article. Finally, a unified non-radial Data Envelopment Analysis approach is presented with respect to the set of comprehensive indicators obtained in previous steps in order to rank all proposed layouts to find the best configuration of facilities.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127032561","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-12-01DOI: 10.1109/ICCSII.2012.6454318
F. Merrikh-Bayat, F. Merrikh-Bayat, Nafiseh Mirebrahimi
Memristor is the fourth fundamental passive circuit element which has potential applications in development of analog memristive memories, neuroscience, and brain simulation. In all of these applications the memristance of the device should be adjusted to the desired value, which is currently performed by trial and error. The aim of this paper is to propose a new method and develop a circuit for automatic adjustment of the memristance of memristive devices. The proposed method is based on the sliding mode control and numerical simulations show that it can be used for tuning the memristance of such devices with a high accuracy.
{"title":"A method for automatic tuning the memristance of memristive devices with the capacity of applying to memristive memories","authors":"F. Merrikh-Bayat, F. Merrikh-Bayat, Nafiseh Mirebrahimi","doi":"10.1109/ICCSII.2012.6454318","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454318","url":null,"abstract":"Memristor is the fourth fundamental passive circuit element which has potential applications in development of analog memristive memories, neuroscience, and brain simulation. In all of these applications the memristance of the device should be adjusted to the desired value, which is currently performed by trial and error. The aim of this paper is to propose a new method and develop a circuit for automatic adjustment of the memristance of memristive devices. The proposed method is based on the sliding mode control and numerical simulations show that it can be used for tuning the memristance of such devices with a high accuracy.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126686213","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-12-01DOI: 10.1109/ICCSII.2012.6454440
A. Mohajer, F. A. Niasar, M. Nabipour, A. A. Ghadikolayi
Cooperative spectrum sensing taking into account the error effect on the sensing information reporting and increase in efficiency is studied. Employing the relay, a novel cooperative spectrum sensing algorithm based on network coding is proposed by correcting the received sensing information. In this paper we study the performance of network coding in presence of opportunistic relay selection. We conjecture that relay selection schemes should be aware of, and account for, the network coding operation in case of its presence. The efficiency of the algorithm and the method of relay selection are given. Based on system level simulation results, it is demonstrated that such an awareness provides considerable capacity gains as compared to its traditional opportunistic counterparts, in addition to increased fairness among the encoded sources.
{"title":"Efficient code-based relay algorithm for reliable cognitive radio systems","authors":"A. Mohajer, F. A. Niasar, M. Nabipour, A. A. Ghadikolayi","doi":"10.1109/ICCSII.2012.6454440","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454440","url":null,"abstract":"Cooperative spectrum sensing taking into account the error effect on the sensing information reporting and increase in efficiency is studied. Employing the relay, a novel cooperative spectrum sensing algorithm based on network coding is proposed by correcting the received sensing information. In this paper we study the performance of network coding in presence of opportunistic relay selection. We conjecture that relay selection schemes should be aware of, and account for, the network coding operation in case of its presence. The efficiency of the algorithm and the method of relay selection are given. Based on system level simulation results, it is demonstrated that such an awareness provides considerable capacity gains as compared to its traditional opportunistic counterparts, in addition to increased fairness among the encoded sources.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123822934","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-12-01DOI: 10.1109/ICCSII.2012.6454486
A. Azizi
This is a cryptographical application inspired from the Moroccan's history of sciences, based on Al Khalil Models of poetry and the numerical coding of the Arabic letters in Morocco. This method is based on the position of letters in a given poetry written in grid.
{"title":"Java cryptographycal application based on Arabic poetry","authors":"A. Azizi","doi":"10.1109/ICCSII.2012.6454486","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454486","url":null,"abstract":"This is a cryptographical application inspired from the Moroccan's history of sciences, based on Al Khalil Models of poetry and the numerical coding of the Arabic letters in Morocco. This method is based on the position of letters in a given poetry written in grid.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123920244","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-12-01DOI: 10.1109/ICCSII.2012.6454620
I. Chakraborty, M. Hussain
Routing and scheduling in wireless multi-hop networks is challenging, particularly when there are large number of nodes. Simple route construction algorithm becomes attractive as it requires fewer computations. In this paper, a novel routing and scheduling algorithm is proposed, which can be implemented in centralized or distributed way. In this algorithm when the user node (U) tries to reach the base station (BS) through intermediate nodes (IMs), it draws a reference line to the BS, chooses the intermediate node at minimum angle with the reference line, from its neighboring nodes within one transmission range. The other links of the route to the BS through the IMs are also found in the same way. We call it minimum angle (MA) routing and distributed scheduling (DS), MA-DS. The minimum angle (MA) routing and centralized scheduling (CS) is initiated by the BS using the same principle to reach the user node (U), we call it MA-CS. The algorithm requires only the position (x-y co-ordinate) information and the burst profile of the nodes.
{"title":"A simple joint routing and scheduling algorithm for a multi-hop wireless network","authors":"I. Chakraborty, M. Hussain","doi":"10.1109/ICCSII.2012.6454620","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454620","url":null,"abstract":"Routing and scheduling in wireless multi-hop networks is challenging, particularly when there are large number of nodes. Simple route construction algorithm becomes attractive as it requires fewer computations. In this paper, a novel routing and scheduling algorithm is proposed, which can be implemented in centralized or distributed way. In this algorithm when the user node (U) tries to reach the base station (BS) through intermediate nodes (IMs), it draws a reference line to the BS, chooses the intermediate node at minimum angle with the reference line, from its neighboring nodes within one transmission range. The other links of the route to the BS through the IMs are also found in the same way. We call it minimum angle (MA) routing and distributed scheduling (DS), MA-DS. The minimum angle (MA) routing and centralized scheduling (CS) is initiated by the BS using the same principle to reach the user node (U), we call it MA-CS. The algorithm requires only the position (x-y co-ordinate) information and the burst profile of the nodes.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122107589","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-12-01DOI: 10.1109/ICCSII.2012.6454582
A. Karmouche, Y. Salih-Alj
RFID technology is amongst the most revolutionary technologies that will shape tomorrow's pervasive retail sales. This technology offers an important set of opportunities which improve the shopping experience of customers when visiting any self-service store. Indeed, this technology is increasingly promising to the extent of a potential replacement the barcode system as new low cost RFID tag manufacturing procedures have emerged. This paper presents a novel and cost efficient approach to the application of RFID technology in pervasive retail sales, by shifting from cart level to aisle-level scanning, using new event management procedures at the level of the RFID middleware. These procedures include the use of localization and clustering algorithms in order to form purchase contexts. The motivation behind such approach is the reduction of RFID reader deployment and maintenance cost, its transparency to the customers, and its robustness.
{"title":"Aisle-level scanning for pervasive RFID-based shopping applications","authors":"A. Karmouche, Y. Salih-Alj","doi":"10.1109/ICCSII.2012.6454582","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454582","url":null,"abstract":"RFID technology is amongst the most revolutionary technologies that will shape tomorrow's pervasive retail sales. This technology offers an important set of opportunities which improve the shopping experience of customers when visiting any self-service store. Indeed, this technology is increasingly promising to the extent of a potential replacement the barcode system as new low cost RFID tag manufacturing procedures have emerged. This paper presents a novel and cost efficient approach to the application of RFID technology in pervasive retail sales, by shifting from cart level to aisle-level scanning, using new event management procedures at the level of the RFID middleware. These procedures include the use of localization and clustering algorithms in order to form purchase contexts. The motivation behind such approach is the reduction of RFID reader deployment and maintenance cost, its transparency to the customers, and its robustness.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133999362","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-12-01DOI: 10.1109/ICCSII.2012.6454365
N. Ibrahim, Ismail Khalil
A service composition consists of multiple interacting Web Services that provide a functionality to meet a specific set of requirements. It is essential to verify that the functional behavior of the service composition meets the published functionality of the service. Instead of defining a new verification tool to verify the service composition we follow a transformation approach. In this approach, a service composition can be automatically transformed into a model understood by an available verification tool that can then be used to perform the formal verification. The goal in our research is to use different verification tools in order to verify a wide range of properties and target different kinds of systems. This is because different verification tools differ in their requirements and abilities. In this paper, we define the transformation rules to generate a model that can be verified using UPPAAL [1] model checking tool.
{"title":"Verifying Web Services compositions using UPPAAL","authors":"N. Ibrahim, Ismail Khalil","doi":"10.1109/ICCSII.2012.6454365","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454365","url":null,"abstract":"A service composition consists of multiple interacting Web Services that provide a functionality to meet a specific set of requirements. It is essential to verify that the functional behavior of the service composition meets the published functionality of the service. Instead of defining a new verification tool to verify the service composition we follow a transformation approach. In this approach, a service composition can be automatically transformed into a model understood by an available verification tool that can then be used to perform the formal verification. The goal in our research is to use different verification tools in order to verify a wide range of properties and target different kinds of systems. This is because different verification tools differ in their requirements and abilities. In this paper, we define the transformation rules to generate a model that can be verified using UPPAAL [1] model checking tool.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124615256","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-12-01DOI: 10.1109/ICCSII.2012.6454312
M. Badri, N. Drouin, Fadel Touré
Software systems need to continually evolve during their life cycle. It is, therefore, important to monitor how their quality evolves so that quality assurance activities can be properly planned. In this paper, we analyze empirically the quality evolution of an open source software system (Apache Tomcat). We address software quality from an external perspective. We used the number of defects as a quality indicator. We wanted to investigate if the Qi (Quality Assurance Indicator) metric, which we proposed in a previous work, can be used to observe how quality, measured in terms of defects, evolves in the presence of changes. We performed an empirical analysis using historical data collected from the subject system covering a period of more than seven years (thirty-one versions). Results are reported and discussed in the paper.
{"title":"On understanding software quality evolution from a defect perspective: A case study on an open source software system","authors":"M. Badri, N. Drouin, Fadel Touré","doi":"10.1109/ICCSII.2012.6454312","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454312","url":null,"abstract":"Software systems need to continually evolve during their life cycle. It is, therefore, important to monitor how their quality evolves so that quality assurance activities can be properly planned. In this paper, we analyze empirically the quality evolution of an open source software system (Apache Tomcat). We address software quality from an external perspective. We used the number of defects as a quality indicator. We wanted to investigate if the Qi (Quality Assurance Indicator) metric, which we proposed in a previous work, can be used to observe how quality, measured in terms of defects, evolves in the presence of changes. We performed an empirical analysis using historical data collected from the subject system covering a period of more than seven years (thirty-one versions). Results are reported and discussed in the paper.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114833471","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-12-01DOI: 10.1109/ICCSII.2012.6454522
M. Aldayel
The discovery of knowledge form criminal evidence databases is important in order to make effective criminological investigation. The aim of data mining is to extract knowledge from database and produce unambiguous and reasonable patterns. K-Nearest Neighbor (KNN) is one of the most successful data mining methods used in classification problems. Many researchers show that combining different classifiers through voting resulted in better performance than using single classifiers. This paper applies KNN to help criminological investigators in identifying the glass type. It also checks if integrating KNN with another classifier using voting can enhance its accuracy in indentifying the glass type. The results show that applying voting can enhance the KNN accuracy in the glass identification problem.
{"title":"K-Nearest Neighbor classification for glass identification problem","authors":"M. Aldayel","doi":"10.1109/ICCSII.2012.6454522","DOIUrl":"https://doi.org/10.1109/ICCSII.2012.6454522","url":null,"abstract":"The discovery of knowledge form criminal evidence databases is important in order to make effective criminological investigation. The aim of data mining is to extract knowledge from database and produce unambiguous and reasonable patterns. K-Nearest Neighbor (KNN) is one of the most successful data mining methods used in classification problems. Many researchers show that combining different classifiers through voting resulted in better performance than using single classifiers. This paper applies KNN to help criminological investigators in identifying the glass type. It also checks if integrating KNN with another classifier using voting can enhance its accuracy in indentifying the glass type. The results show that applying voting can enhance the KNN accuracy in the glass identification problem.","PeriodicalId":281140,"journal":{"name":"2012 International Conference on Computer Systems and Industrial Informatics","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130116308","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
扫码关注我们
求助内容：
应助结果提醒方式：