The construction of large-scale engineering project usually relies on the development of many new software systems, whereas it would be very expensive and time consuming if these new software systems are completely developed anew. In order to solve the problem, a model of legacy software reuse is proposed in this paper. The model is based on code clone detection. Firstly, code clone in source code of legacy software is detected by means of code clone detection tool. Secondly, abstract syntax trees of the functions which contain code clone are created. Thirdly, the degree of variation between the functions which contain the code clone belongs to the same clone set is calculated according to their abstract syntax trees, and then some functions whose similarities of abstract syntax trees are in the allowed range are combined. Finally, the combined functions and other frequently invoked functions are refactored into new functions or encapsulated into new classes, and all of these functions or classes can be reused as components in the development of new software systems. The test result shows that the reuse method based on this model can shrink the scope for searching the reusable component in legacy software systems, and thus improve the efficiency of legacy software reuse.
{"title":"Research on the Model of Legacy Software Reuse Based on Code Clone Detection","authors":"Meng Fanqi, Kan Yunqi","doi":"10.1109/CICN.2013.107","DOIUrl":"https://doi.org/10.1109/CICN.2013.107","url":null,"abstract":"The construction of large-scale engineering project usually relies on the development of many new software systems, whereas it would be very expensive and time consuming if these new software systems are completely developed anew. In order to solve the problem, a model of legacy software reuse is proposed in this paper. The model is based on code clone detection. Firstly, code clone in source code of legacy software is detected by means of code clone detection tool. Secondly, abstract syntax trees of the functions which contain code clone are created. Thirdly, the degree of variation between the functions which contain the code clone belongs to the same clone set is calculated according to their abstract syntax trees, and then some functions whose similarities of abstract syntax trees are in the allowed range are combined. Finally, the combined functions and other frequently invoked functions are refactored into new functions or encapsulated into new classes, and all of these functions or classes can be reused as components in the development of new software systems. The test result shows that the reuse method based on this model can shrink the scope for searching the reusable component in legacy software systems, and thus improve the efficiency of legacy software reuse.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"128 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113985553","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}
This paper presents a new approach for identifying birds automatically from their sounds, which first converts the bird songs into spectrograms and then extracts texture features from this visual time-frequency representation. The approach is inspired by the finding that spectrograms of different birds present distinct textures and can be easily distinguished from one another. In particular, we perform a local texture feature extraction by segmenting the bird songs into a series of syllables, which has been proved to be quite effective due to the high variability found in bird vocalizations. Finally, Random Forests, an ensemble classifier based on decision tree, is used to classify bird species. The average recognition rate is 96.5% for 10 kinds of bird species, outperforming the well-known MFCC features.
{"title":"Automatic Recognition of Bird Songs Using Time-Frequency Texture","authors":"Sha-Sha Chen, Ying Li","doi":"10.1109/CICN.2013.62","DOIUrl":"https://doi.org/10.1109/CICN.2013.62","url":null,"abstract":"This paper presents a new approach for identifying birds automatically from their sounds, which first converts the bird songs into spectrograms and then extracts texture features from this visual time-frequency representation. The approach is inspired by the finding that spectrograms of different birds present distinct textures and can be easily distinguished from one another. In particular, we perform a local texture feature extraction by segmenting the bird songs into a series of syllables, which has been proved to be quite effective due to the high variability found in bird vocalizations. Finally, Random Forests, an ensemble classifier based on decision tree, is used to classify bird species. The average recognition rate is 96.5% for 10 kinds of bird species, outperforming the well-known MFCC features.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128711030","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}
Deepa Singh, B. Pandey, G. Tomar, Bimal Kumar Sarkar
In this paper the effect of back off factor on exponential algorithm is analyzed and binary exponential algorithm is implemented in Mat lab. Binary Exponential Algorithm is widely used as a network congestion avoidance or collision resolution protocol. The detailed analysis of saturation throughput is done in this work. This work also covers packet's medium access delay for a given number of node N. Binary exponential is a special case of exponential back off when r =2, where r is a back off factor and we basically analyse the effect of back off factor r =1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9, 2.0 on exponential back off algorithm. All the result is obtained through Matlab (Matrix Laboratory) simulation language.
{"title":"Performance Evaluation of Backoff Method -- Effect of Backoff Factor on Exponential Backoff Algorithm","authors":"Deepa Singh, B. Pandey, G. Tomar, Bimal Kumar Sarkar","doi":"10.1109/CICN.2013.27","DOIUrl":"https://doi.org/10.1109/CICN.2013.27","url":null,"abstract":"In this paper the effect of back off factor on exponential algorithm is analyzed and binary exponential algorithm is implemented in Mat lab. Binary Exponential Algorithm is widely used as a network congestion avoidance or collision resolution protocol. The detailed analysis of saturation throughput is done in this work. This work also covers packet's medium access delay for a given number of node N. Binary exponential is a special case of exponential back off when r =2, where r is a back off factor and we basically analyse the effect of back off factor r =1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9, 2.0 on exponential back off algorithm. All the result is obtained through Matlab (Matrix Laboratory) simulation language.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130131191","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}
Microwave cavity with complicated structure and rubidium gas is studied by mode matching method. By calculating resonant frequencies of TE011 mode, main factors that influence resonant frequency is studied. In addition, the resonant frequency of TE011 mode is compared with commercial software (CST) results. The computed results show good agreement with CST simulations. It can be seen that this method is of high credibility and efficiency. This paper is of great significance for cavity design and theoretical perfection.
{"title":"Study on Resonant Properties of Complicated Microwave Cavity in Rubidium Frequency Standard","authors":"Xiaoxiao Li, Fan Yang","doi":"10.1109/CICN.2013.26","DOIUrl":"https://doi.org/10.1109/CICN.2013.26","url":null,"abstract":"Microwave cavity with complicated structure and rubidium gas is studied by mode matching method. By calculating resonant frequencies of TE011 mode, main factors that influence resonant frequency is studied. In addition, the resonant frequency of TE011 mode is compared with commercial software (CST) results. The computed results show good agreement with CST simulations. It can be seen that this method is of high credibility and efficiency. This paper is of great significance for cavity design and theoretical perfection.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128109282","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we apply clock gating technique in Global Reset ALU design on 28nm Artix7 FPGA to save dynamic and clock power both. This technique is simulated in Xilinx14.3 tool and implemented on 28nm Artix7 XC7A200T FFG1156-1 FPGA. When clock gating technique is not applied clock power contributes 32.25%, 4.24%, 3.06%, 3.09%, and 3.09% of overall dynamic power on 100 MHz, 1 GHz, 10 GHz, 100GHz and1 THz device frequency respectively. When clock gating technique is applied clock power contributes 0%, 1.02%, 1.06%, 1.06%, and 1.06% of overall dynamic power on 100 MHz, 1 GHz, 10 GHz, and 100GHz and1 THz device frequency respectively. With clock gating, there is 100%, 76.92%, 66.30%, 66.55% and 66.58% reduction in clock power in compare to clock power consumption without clock gate on 100 MHz, 1 GHz, 10 GHz, 100 GHz and 1 THz respectively operating frequency. Clock gating is more effective on 28nm in compare to 40nm and 90nm technology file.
{"title":"Clock Gating Aware Low Power Global Reset ALU and Implementation on 28nm FPGA","authors":"B. Pandey, J. Yadav, J. Kumar, Ravi Kumar","doi":"10.1109/CICN.2013.91","DOIUrl":"https://doi.org/10.1109/CICN.2013.91","url":null,"abstract":"In this paper, we apply clock gating technique in Global Reset ALU design on 28nm Artix7 FPGA to save dynamic and clock power both. This technique is simulated in Xilinx14.3 tool and implemented on 28nm Artix7 XC7A200T FFG1156-1 FPGA. When clock gating technique is not applied clock power contributes 32.25%, 4.24%, 3.06%, 3.09%, and 3.09% of overall dynamic power on 100 MHz, 1 GHz, 10 GHz, 100GHz and1 THz device frequency respectively. When clock gating technique is applied clock power contributes 0%, 1.02%, 1.06%, 1.06%, and 1.06% of overall dynamic power on 100 MHz, 1 GHz, 10 GHz, and 100GHz and1 THz device frequency respectively. With clock gating, there is 100%, 76.92%, 66.30%, 66.55% and 66.58% reduction in clock power in compare to clock power consumption without clock gate on 100 MHz, 1 GHz, 10 GHz, 100 GHz and 1 THz respectively operating frequency. Clock gating is more effective on 28nm in compare to 40nm and 90nm technology file.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"101 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132186067","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 micro strip patch antenna is the most preferred for low cost and compact design. The proposed antenna design is simulated using FR-4 substrate with dielectric constant of 4.54 and thickness of 1.60mm on electromagnetic (EM) simulation software. The antenna designed has a compact structure with a total size of 60x60mm square. The bandwidth of micro strip patch antenna is enhanced by replacing a conducting ground plane by a high impedance EBG layer. The circular unit cells are placed in a circular pattern and it is found that on increasing the radius of each circular EBG cell, the bandwidth is increased. It is also observed that on increasing the radii of vias, there is a slight decrement in the bandwidth of micro strip patch antennas. The bandwidth of micro strip patch antenna is increased from 13.41% to 18.68% when radius of EBG patches is increased from 2.5mm to 3.5mm which is much wider than the bandwidth of conventional antenna that is calculated to be 4.28%. The simulated results of the integrated antenna for wireless applications shows the good agreement with the proposed scheme.
{"title":"Bandwidth Enhancement of Microstrip Patch Antennas by Implementing Circular Unit Cells in Circular Pattern","authors":"Ruchika Gupta, Mithilesh Kumar","doi":"10.1109/CICN.2013.11","DOIUrl":"https://doi.org/10.1109/CICN.2013.11","url":null,"abstract":"The micro strip patch antenna is the most preferred for low cost and compact design. The proposed antenna design is simulated using FR-4 substrate with dielectric constant of 4.54 and thickness of 1.60mm on electromagnetic (EM) simulation software. The antenna designed has a compact structure with a total size of 60x60mm square. The bandwidth of micro strip patch antenna is enhanced by replacing a conducting ground plane by a high impedance EBG layer. The circular unit cells are placed in a circular pattern and it is found that on increasing the radius of each circular EBG cell, the bandwidth is increased. It is also observed that on increasing the radii of vias, there is a slight decrement in the bandwidth of micro strip patch antennas. The bandwidth of micro strip patch antenna is increased from 13.41% to 18.68% when radius of EBG patches is increased from 2.5mm to 3.5mm which is much wider than the bandwidth of conventional antenna that is calculated to be 4.28%. The simulated results of the integrated antenna for wireless applications shows the good agreement with the proposed scheme.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125034188","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}
This work is concerned with implementing Steganography for images, with an improvement in both security and image quality. The one that is implemented here is a variation of plain LSB (Least Significant Bit) algorithm. The stego-image quality is improved by using bit-inversion technique. In this technique, certain least significant bits of cover image are inverted after LSB steganography that co-occur with some pattern of other bits and that reduces the number of modified LSBs. Thus, less number of least significant bits of cover image is altered in comparison to plain LSB method, improving the PSNR of stegoimage. By storing the bit patterns for which LSBs are inverted, message image can be obtained correctly. To improve the robustness of steganography, RC4 algorithm has been used to achieve the randomization in hiding message image bits into cover image pixels instead of storing them sequentially. This process randomly disperses the bits of the message in the cover image and thus, making it harder for unauthorized people to extract the original message. The proposed method shows good enhancement to Least Significant Bit technique in consideration to security as well as image quality.
{"title":"Enhancing the Security and Quality of LSB Based Image Steganography","authors":"N. Akhtar, Pragati Johri, Shahbaaz Khan","doi":"10.1109/CICN.2013.85","DOIUrl":"https://doi.org/10.1109/CICN.2013.85","url":null,"abstract":"This work is concerned with implementing Steganography for images, with an improvement in both security and image quality. The one that is implemented here is a variation of plain LSB (Least Significant Bit) algorithm. The stego-image quality is improved by using bit-inversion technique. In this technique, certain least significant bits of cover image are inverted after LSB steganography that co-occur with some pattern of other bits and that reduces the number of modified LSBs. Thus, less number of least significant bits of cover image is altered in comparison to plain LSB method, improving the PSNR of stegoimage. By storing the bit patterns for which LSBs are inverted, message image can be obtained correctly. To improve the robustness of steganography, RC4 algorithm has been used to achieve the randomization in hiding message image bits into cover image pixels instead of storing them sequentially. This process randomly disperses the bits of the message in the cover image and thus, making it harder for unauthorized people to extract the original message. The proposed method shows good enhancement to Least Significant Bit technique in consideration to security as well as image quality.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128999670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, graph coloring has been done using artificial bee colony (ABC) optimization algorithm. Graph coloring deals with the challenge of coloring the nodes of any graph by least possible number of colors while ensuring on same time that two adjacent nodes does not gain same color. That least possible count of colors used denotes the chromatic number of a graph and to determine this number for any graph is an NP-complete problem hence no existing polynomial time algorithm can solve it. To find the best coloring sequence, a large search space has to be explored. Graph coloring deals with the challenge of coloring the nodes of any graph by least possible number of colors while ensuring on same time that two adjacent nodes does not gain same color and proposed a novel artificial bee colony (ABC) optimization algorithm for graph coloring. In this paper, we analyzed the proposed algorithm and compared it with three other graph coloring algorithms i.e. first fit, largest degree based ordering (LDO) and saturation degree based ordering (SDO). These results also indicate that ABC algorithm converges in a few iterations and is able to optimally allocate colors to vertices of a graph.
{"title":"A Novel ABC Optimization Algorithm for Graph Coloring Problem","authors":"R. S. Tomar, Sonali Singh, S. Verma, G. Tomar","doi":"10.1109/CICN.2013.61","DOIUrl":"https://doi.org/10.1109/CICN.2013.61","url":null,"abstract":"In this paper, graph coloring has been done using artificial bee colony (ABC) optimization algorithm. Graph coloring deals with the challenge of coloring the nodes of any graph by least possible number of colors while ensuring on same time that two adjacent nodes does not gain same color. That least possible count of colors used denotes the chromatic number of a graph and to determine this number for any graph is an NP-complete problem hence no existing polynomial time algorithm can solve it. To find the best coloring sequence, a large search space has to be explored. Graph coloring deals with the challenge of coloring the nodes of any graph by least possible number of colors while ensuring on same time that two adjacent nodes does not gain same color and proposed a novel artificial bee colony (ABC) optimization algorithm for graph coloring. In this paper, we analyzed the proposed algorithm and compared it with three other graph coloring algorithms i.e. first fit, largest degree based ordering (LDO) and saturation degree based ordering (SDO). These results also indicate that ABC algorithm converges in a few iterations and is able to optimally allocate colors to vertices of a graph.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129429794","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}
This paper introduces method for implementing NFS protocol for larger block/network packets transfer over to NAS [Network Attached Storage] from Highly Available clients. NAS storage scalability is habitually inadequate to the volume of the appliance. Addition of an appliance is reasonably easy, but access to the pooled contents as a mono entity is not. In this approach, NAS supports file sharing between multiple peer clients serving on highly available cluster services, NAS clients can potentially access file shares from anywhere in the organization. Because file access is, typically low volume and less sensitive to response times, predictable performance and distance are less of a concern in NAS implementations.
{"title":"Implementing Network File System Protocol for Highly Available Clustered Applications on Network Attached Storage","authors":"K. Kumar","doi":"10.1109/CICN.2013.108","DOIUrl":"https://doi.org/10.1109/CICN.2013.108","url":null,"abstract":"This paper introduces method for implementing NFS protocol for larger block/network packets transfer over to NAS [Network Attached Storage] from Highly Available clients. NAS storage scalability is habitually inadequate to the volume of the appliance. Addition of an appliance is reasonably easy, but access to the pooled contents as a mono entity is not. In this approach, NAS supports file sharing between multiple peer clients serving on highly available cluster services, NAS clients can potentially access file shares from anywhere in the organization. Because file access is, typically low volume and less sensitive to response times, predictable performance and distance are less of a concern in NAS implementations.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125663080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, a dual-band band stop filter is designed based on a modified stepped impedance hairpin resonator in which, two open stubs are embedded in the structure. There are two transmission zeros in each one of the stop bands. The center frequencies of the stop bands are placed at 2 and 5.92 GHz and their widths are 0.94 and 0.55 GHz, respectively. These stop bands can be adjusted by changing the dimensions of the embedded open stubs. This filter is then transferred to another substrate, fabricated and measured and the results for the two substrates are compared.
{"title":"Dual-Band Bandstop Filter Using Modified Stepped-Impedance Hairpin Resonators","authors":"S. Majidifar, S. Makki, S. Alirezaee, A. Ahmadi","doi":"10.1109/CICN.2013.22","DOIUrl":"https://doi.org/10.1109/CICN.2013.22","url":null,"abstract":"In this paper, a dual-band band stop filter is designed based on a modified stepped impedance hairpin resonator in which, two open stubs are embedded in the structure. There are two transmission zeros in each one of the stop bands. The center frequencies of the stop bands are placed at 2 and 5.92 GHz and their widths are 0.94 and 0.55 GHz, respectively. These stop bands can be adjusted by changing the dimensions of the embedded open stubs. This filter is then transferred to another substrate, fabricated and measured and the results for the two substrates are compared.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"46 47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122068788","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
扫码关注我们
求助内容：
应助结果提醒方式：