Pub Date : 2010-11-01DOI: 10.1109/ICCIT.2010.5711200
Mino Ku, D. Min, Eunmi Choi
Cluster computing has been widely used in various fields from academics to industry because of its technical advantages. Recently, cloud computing become more attractive, as cluster computing is one of the core basements of cloud computing. However, the development of cluster-based system is hard without relative knowledge such as networking, workload distribution, fault tolerant, etc. Thus, various implementations for cluster computing have been introduced to help the development of cluster-based system. However, these implementations also have the limitation for developing cluster-based system because of high performance in specified application fields. In this paper, we present the SCAREX framework which supports scalability, reliability, extendibility, and easy for implementing cluster-based system. This framework employs a fault-tolerant mechanism for the failure of workload processing, and facilitates dynamic module distribution and loading for the work module which works on the worker node. The SCAREX also provides a simple programming interface for easy development. Since the SCAREX has flexible architecture, the developer can implement various cluster architecture and extend cluster architecture by combining the SCAREX-based cluster with other packages of the SCAREX or other frameworks.
{"title":"SCAREX: A framework for scalable, reliable, and extendable cluster computing","authors":"Mino Ku, D. Min, Eunmi Choi","doi":"10.1109/ICCIT.2010.5711200","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711200","url":null,"abstract":"Cluster computing has been widely used in various fields from academics to industry because of its technical advantages. Recently, cloud computing become more attractive, as cluster computing is one of the core basements of cloud computing. However, the development of cluster-based system is hard without relative knowledge such as networking, workload distribution, fault tolerant, etc. Thus, various implementations for cluster computing have been introduced to help the development of cluster-based system. However, these implementations also have the limitation for developing cluster-based system because of high performance in specified application fields. In this paper, we present the SCAREX framework which supports scalability, reliability, extendibility, and easy for implementing cluster-based system. This framework employs a fault-tolerant mechanism for the failure of workload processing, and facilitates dynamic module distribution and loading for the work module which works on the worker node. The SCAREX also provides a simple programming interface for easy development. Since the SCAREX has flexible architecture, the developer can implement various cluster architecture and extend cluster architecture by combining the SCAREX-based cluster with other packages of the SCAREX or other frameworks.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121301400","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711147
Liangliang Sun, W. Liu, Baoxing Xu, T. Chai
The steel-making and continuous casting process is the connection between the iron process and the rolling process; it is the bottleneck in the iron and steel production. A better scheduling of this process is the key factor to ensure the whole production in a well-organized rhythm for iron and steel production manufacturing productivity. The branch and cut method in the standard commercial solver CPLEX is introduced to solve the scheduling problem. The linearization methods for the linear conversion are highlighted. Due to the limited calculation time requirement about the scheduling results and the scale of the problem, special methods for the efficiency tuning are applied according to the characters of the problem. Numerical testing supported by Shanghai Bashan steel plant demonstrated that the computational results show significant improvement compared to the traditional manual scheduling results.
{"title":"The scheduling of steel-making and continuous casting process using branch and cut method via CPLEX optimization","authors":"Liangliang Sun, W. Liu, Baoxing Xu, T. Chai","doi":"10.1109/ICCIT.2010.5711147","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711147","url":null,"abstract":"The steel-making and continuous casting process is the connection between the iron process and the rolling process; it is the bottleneck in the iron and steel production. A better scheduling of this process is the key factor to ensure the whole production in a well-organized rhythm for iron and steel production manufacturing productivity. The branch and cut method in the standard commercial solver CPLEX is introduced to solve the scheduling problem. The linearization methods for the linear conversion are highlighted. Due to the limited calculation time requirement about the scheduling results and the scale of the problem, special methods for the efficiency tuning are applied according to the characters of the problem. Numerical testing supported by Shanghai Bashan steel plant demonstrated that the computational results show significant improvement compared to the traditional manual scheduling results.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116599764","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711225
C. Teng, Y. Shiau, C. Chen
Steganography, a technique of data hiding, is becoming more and more significant with expansion of the Internet communication. As a result, various steganographic algorithms have been proposed in recent years, for example, Ni et al. have carried out a lossless data-hiding algorithm based on the histogram modification. In order to reinforce more security and more data embedding capacity, this paper extends the Ni's algorithm with a random permutation and a histogram re-quantization. To begin with, applying a random permutation, the security is not easy to be broken by a brute-force attack. In addition, the embedding capacity is able to be strengthened approximately 3 times by adopting a histogram re-quantization. As to our approach, it is visually indistinguishable between a cover image and a stegoimage with a large embedding capacity.
{"title":"A data hiding algorithm based on histogram re-quantization","authors":"C. Teng, Y. Shiau, C. Chen","doi":"10.1109/ICCIT.2010.5711225","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711225","url":null,"abstract":"Steganography, a technique of data hiding, is becoming more and more significant with expansion of the Internet communication. As a result, various steganographic algorithms have been proposed in recent years, for example, Ni et al. have carried out a lossless data-hiding algorithm based on the histogram modification. In order to reinforce more security and more data embedding capacity, this paper extends the Ni's algorithm with a random permutation and a histogram re-quantization. To begin with, applying a random permutation, the security is not easy to be broken by a brute-force attack. In addition, the embedding capacity is able to be strengthened approximately 3 times by adopting a histogram re-quantization. As to our approach, it is visually indistinguishable between a cover image and a stegoimage with a large embedding capacity.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125428902","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711048
A. Sang, Xin Zhao, Hexin Chen, Silin Mang
Three-dimensional vector matrix discrete cosine transform coding (3DVMDCT) deals with each component of color image in a unified model, fully eliminates the correlation between them and gets an obvious advantage. But its block-size of image segmentation is fixed and does not fully take into account that there are different statistical properties in different regions. In this paper, we take gradient as the image measure activity (IAM), propose a new method—variable matrix-size three-dimensional vector matrix image segmentation (VMS-3DVMDCT), and implement the corresponding multi-dimensional vector matrix discrete cosine transform coding, experimental results show that, compared with the fixed block partition, the proposed algorithm improves PSNR at most 1dB, and the quality of the reconstructed image is improved in subject evaluation, much better than JPEG.
{"title":"Color image transform coding based on three dimensional variable vector matrix size segmentation","authors":"A. Sang, Xin Zhao, Hexin Chen, Silin Mang","doi":"10.1109/ICCIT.2010.5711048","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711048","url":null,"abstract":"Three-dimensional vector matrix discrete cosine transform coding (3DVMDCT) deals with each component of color image in a unified model, fully eliminates the correlation between them and gets an obvious advantage. But its block-size of image segmentation is fixed and does not fully take into account that there are different statistical properties in different regions. In this paper, we take gradient as the image measure activity (IAM), propose a new method—variable matrix-size three-dimensional vector matrix image segmentation (VMS-3DVMDCT), and implement the corresponding multi-dimensional vector matrix discrete cosine transform coding, experimental results show that, compared with the fixed block partition, the proposed algorithm improves PSNR at most 1dB, and the quality of the reconstructed image is improved in subject evaluation, much better than JPEG.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128778431","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711210
Chen Tianye, Liu Ning, Yi Ping, Wu Yue, Zhai Qiang
In a practical ad hoc network scene where routing attacks are deployed, attackers are likely to be located in specific geographical region, which is likely to cause different influence on network performance. Though many simulations works has been done on sorting out different kinds of attacks, little work has been focused on the potential link between the severity of attack and the deployment of attackers. In this paper, we pay specific attention to two common attacks in ad hoc network - flooding and active black-hole attack. We established several network scenery to illustrate possible unbalanced network in realistic occasions. And through extensive simulation work on those scenes, we study the connection between the locations of the malicious attackers and influence on network performance. We evaluate both long-term influence and transient impact of flooding attack. We also study active black hole's victim range in both random scene and internet-connected gateway node scene. By comparing attack severity of differently located attackers, we propose theories for attackers to achieve maximized performance influence by strategically placing the malicious nodes. We also provide guidelines for defenders to figure out key zones of defensive importance as well as possible locations of attackers.
{"title":"Performance evaluation of ad hoc network under location-based attacks","authors":"Chen Tianye, Liu Ning, Yi Ping, Wu Yue, Zhai Qiang","doi":"10.1109/ICCIT.2010.5711210","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711210","url":null,"abstract":"In a practical ad hoc network scene where routing attacks are deployed, attackers are likely to be located in specific geographical region, which is likely to cause different influence on network performance. Though many simulations works has been done on sorting out different kinds of attacks, little work has been focused on the potential link between the severity of attack and the deployment of attackers. In this paper, we pay specific attention to two common attacks in ad hoc network - flooding and active black-hole attack. We established several network scenery to illustrate possible unbalanced network in realistic occasions. And through extensive simulation work on those scenes, we study the connection between the locations of the malicious attackers and influence on network performance. We evaluate both long-term influence and transient impact of flooding attack. We also study active black hole's victim range in both random scene and internet-connected gateway node scene. By comparing attack severity of differently located attackers, we propose theories for attackers to achieve maximized performance influence by strategically placing the malicious nodes. We also provide guidelines for defenders to figure out key zones of defensive importance as well as possible locations of attackers.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129395038","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711154
Zhao Shide, X. Xue
In order to achieve effective cooperation of the engineering project team, this paper constructed the cooperation model of the engineering project team and analyzed the cultural regulating, profit regulating and institution regulating in the engineering project team form the viewing angle of system theory based on existing research results. Furthermore, this paper proposed four kinds of management methods of engineering project team cooperation, such as team reliance management, team conflict management, team study management and team encouragement management.
{"title":"An framework for team cooperation in engineering project management","authors":"Zhao Shide, X. Xue","doi":"10.1109/ICCIT.2010.5711154","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711154","url":null,"abstract":"In order to achieve effective cooperation of the engineering project team, this paper constructed the cooperation model of the engineering project team and analyzed the cultural regulating, profit regulating and institution regulating in the engineering project team form the viewing angle of system theory based on existing research results. Furthermore, this paper proposed four kinds of management methods of engineering project team cooperation, such as team reliance management, team conflict management, team study management and team encouragement management.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130993675","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711130
Iman Omidvar Tehrani, S. Ibrahim
Protecting images against illegal duplications is an important fact and recently many watermarking algorithms have been published. In this paper an enhanced SVD-based watermarking algorithm is proposed. In the proposed method U component is explored for embedding the watermark. Experimental results show that imperceptibility and robustness of the algorithm is good.
{"title":"An enhanced SVD based watermarking using U matrix","authors":"Iman Omidvar Tehrani, S. Ibrahim","doi":"10.1109/ICCIT.2010.5711130","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711130","url":null,"abstract":"Protecting images against illegal duplications is an important fact and recently many watermarking algorithms have been published. In this paper an enhanced SVD-based watermarking algorithm is proposed. In the proposed method U component is explored for embedding the watermark. Experimental results show that imperceptibility and robustness of the algorithm is good.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124410073","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711135
Md. Iftekhar Salam, Hoonjae Lee
A wireless sensor network (WSN) is formed of low powered, battery driven electromechanical devices called sensor nodes which communicate with each other through the wireless medium. Secure data communication is a major concern for many sensor network applications. To ensure the confidentiality, it is necessary to establish a secure communication link among sensor nodes by means of cryptographic keys. However, due to the sensor network deployment scenario and several other constraints it is not an easy task to establish a security mechanism for WSN. Recently Haque et. al. proposed a PKC based security architecture to achieve secure data communication in WSN. In this paper, we point out some weaknesses in the PKC based scheme and propose an enhanced scheme to withstand these weaknesses. It is shown that the PKC based security scheme is susceptible to selective node capture attack. Moreover, this scheme requires contacting with the base station for each and every single communication which will add extra communication overhead. In our enhanced scheme, a sensor node establishes unique link key with its neighboring nodes once they are deployed which in turn increases the resiliency against nodes capture attack. Compared to the original scheme our modified scheme reduces the complexity and communication cost of the system while achieving a sufficient level of security.
{"title":"A review on the PKC-based security architecture for wireless sensor networks","authors":"Md. Iftekhar Salam, Hoonjae Lee","doi":"10.1109/ICCIT.2010.5711135","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711135","url":null,"abstract":"A wireless sensor network (WSN) is formed of low powered, battery driven electromechanical devices called sensor nodes which communicate with each other through the wireless medium. Secure data communication is a major concern for many sensor network applications. To ensure the confidentiality, it is necessary to establish a secure communication link among sensor nodes by means of cryptographic keys. However, due to the sensor network deployment scenario and several other constraints it is not an easy task to establish a security mechanism for WSN. Recently Haque et. al. proposed a PKC based security architecture to achieve secure data communication in WSN. In this paper, we point out some weaknesses in the PKC based scheme and propose an enhanced scheme to withstand these weaknesses. It is shown that the PKC based security scheme is susceptible to selective node capture attack. Moreover, this scheme requires contacting with the base station for each and every single communication which will add extra communication overhead. In our enhanced scheme, a sensor node establishes unique link key with its neighboring nodes once they are deployed which in turn increases the resiliency against nodes capture attack. Compared to the original scheme our modified scheme reduces the complexity and communication cost of the system while achieving a sufficient level of security.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128002720","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711165
Wang Xuetong
20 factors are selected to frame a primary factor set from 38 factors obtained through literature study. The methods of Mean Score and Ranking Agreement Factor are applied to calculate the sorting order and analyze the consistency of market survey data. The results show that 17 factors concerning owner's engineering capabilities, owner's preferences to project construction, project properties, and lump-sum contracting market conditions exert a profound influence on the decision-making of lump-sum contracting project delivery methods. Finally, countermeasures and suggestions are proposed to promote a rapid and sound development of lump-sum contracting system in Chinese construction industry.
{"title":"Key factors influencing the decision-making of lump-sum contracting project delivery methods in China","authors":"Wang Xuetong","doi":"10.1109/ICCIT.2010.5711165","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711165","url":null,"abstract":"20 factors are selected to frame a primary factor set from 38 factors obtained through literature study. The methods of Mean Score and Ranking Agreement Factor are applied to calculate the sorting order and analyze the consistency of market survey data. The results show that 17 factors concerning owner's engineering capabilities, owner's preferences to project construction, project properties, and lump-sum contracting market conditions exert a profound influence on the decision-making of lump-sum contracting project delivery methods. Finally, countermeasures and suggestions are proposed to promote a rapid and sound development of lump-sum contracting system in Chinese construction industry.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128459794","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 : 2010-11-01DOI: 10.1109/ICCIT.2010.5711151
Aihui Wang, M. Deng
The human arm performs a variety of skillful movements by adjusting dynamic characteristics of musculoskeletal system. Such characteristics of musculoskeletal system can be mainly described as viscoelasticity of human multi-joint arm. Many biomedical applications of robotics require knowledge of the viscoelasticity of human multi-joint arm in order to make motion appear more natural and accurately. Till now, the real time viscoelasticity of human multi-joint arm has not finally been used absolutely in robot control. This paper reviews a robust estimation method of the human multi-joint arm viscoelasticity during natural movement. A human arm-like robot control scheme using the real time measuring viscoelasticity of human multi-joint arm is proposed. An improved forward gaze model is used in order to study how to adjust the human multi-joint arm viscoelasticity by central nervous system according to external environment. The effectiveness of the proposed method is confirmed by the simulation and experimental results.
{"title":"Human arm-like robot control using the viscoelasticity of human multi-joint arm","authors":"Aihui Wang, M. Deng","doi":"10.1109/ICCIT.2010.5711151","DOIUrl":"https://doi.org/10.1109/ICCIT.2010.5711151","url":null,"abstract":"The human arm performs a variety of skillful movements by adjusting dynamic characteristics of musculoskeletal system. Such characteristics of musculoskeletal system can be mainly described as viscoelasticity of human multi-joint arm. Many biomedical applications of robotics require knowledge of the viscoelasticity of human multi-joint arm in order to make motion appear more natural and accurately. Till now, the real time viscoelasticity of human multi-joint arm has not finally been used absolutely in robot control. This paper reviews a robust estimation method of the human multi-joint arm viscoelasticity during natural movement. A human arm-like robot control scheme using the real time measuring viscoelasticity of human multi-joint arm is proposed. An improved forward gaze model is used in order to study how to adjust the human multi-joint arm viscoelasticity by central nervous system according to external environment. The effectiveness of the proposed method is confirmed by the simulation and experimental results.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125560941","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
扫码关注我们
求助内容：
应助结果提醒方式：