Pub Date : 2010-09-20DOI: 10.1109/ICACTE.2010.5579076
Fang Liu, Kan Wu, Jinfa Shi, CangDe Lu
This paper discussesed the necessity, the possibility and the method of introducing GIS technology into LCA database study, analyzed the database structure and data elements of LCA database that included the data of the three pillars —ecology, economics, and social equity, a more comprehensive LCA database is innovated in this study.
{"title":"Preliminary design of GIS-based LCA database","authors":"Fang Liu, Kan Wu, Jinfa Shi, CangDe Lu","doi":"10.1109/ICACTE.2010.5579076","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579076","url":null,"abstract":"This paper discussesed the necessity, the possibility and the method of introducing GIS technology into LCA database study, analyzed the database structure and data elements of LCA database that included the data of the three pillars —ecology, economics, and social equity, a more comprehensive LCA database is innovated in this study.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"67 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129870540","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-09-20DOI: 10.1109/ICACTE.2010.5579550
Qinshu He, Xin-en Liu, Shifu Xiao
The analysis of parametric probabilistic sensitivity analysis is important for reliability-based design, which shows changes of system reliability caused by the change of basic variances. In this paper, a fast approximate method of reliability analysis based on the commercial FE simulation-artificial neural network-Monte Carlo simulation is proposed, which can save the calculation cost with efficient precision. With this quick-response model, a new scaling parameter is presented here considering the global dispersity of stochastic parameters, and the parametric probabilistic sensitivity is analyzed too. The sensitivity indices can be computed by the simple and approximate formula in engineering. A numerical example is presented to validate the accuracy and efficiency in reliability and parametric probabilistic sensitivity by comparing with the analysis of ANSYS.
{"title":"A fast approximate method for parametric probabilistic sensitivity estimation","authors":"Qinshu He, Xin-en Liu, Shifu Xiao","doi":"10.1109/ICACTE.2010.5579550","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579550","url":null,"abstract":"The analysis of parametric probabilistic sensitivity analysis is important for reliability-based design, which shows changes of system reliability caused by the change of basic variances. In this paper, a fast approximate method of reliability analysis based on the commercial FE simulation-artificial neural network-Monte Carlo simulation is proposed, which can save the calculation cost with efficient precision. With this quick-response model, a new scaling parameter is presented here considering the global dispersity of stochastic parameters, and the parametric probabilistic sensitivity is analyzed too. The sensitivity indices can be computed by the simple and approximate formula in engineering. A numerical example is presented to validate the accuracy and efficiency in reliability and parametric probabilistic sensitivity by comparing with the analysis of ANSYS.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128392752","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-09-20DOI: 10.1109/ICACTE.2010.5578950
Bo Wei, Sheng Li
Focusing on using Oracle to implement the differentiation of spatial topological relations between lines and regions, an algorithm based on Oracle Spatial Topology Data Model and the 9-intersection model is designed to determine the nine elements of the 9-intersection matrix, which can be used to differentiate the 19 kinds of spatial topological relations between a line and a region. Three elements with respect to the boundary of the line can be determined by using SDO_TOPO_MAP.GET_CONTAINING_FACE0 function to test the relations between the two extreme nodes of the line and the region. Three elements about the interior of the line can be determined by using SDO_GEOM.SDO_INTERSECTION0 function to test the relations between the line and the region. The last three element with respect to the exterior of the line can be determined by using the infiniteness of the exterior of spatial lines and regions. The algorithm can be directly used to the line that contains one or more shape points and fit for differentiating the spatial topological relations under both lines/regions and regions/lines. Experiments by practice in programming showed that the algorithm was valid and reduced the use of Oracle Spatial functions so as to can run faster.
{"title":"The implementation of differentiating spatial topological relations between lines and regions based on Oracle Spatial Topology Data Model","authors":"Bo Wei, Sheng Li","doi":"10.1109/ICACTE.2010.5578950","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5578950","url":null,"abstract":"Focusing on using Oracle to implement the differentiation of spatial topological relations between lines and regions, an algorithm based on Oracle Spatial Topology Data Model and the 9-intersection model is designed to determine the nine elements of the 9-intersection matrix, which can be used to differentiate the 19 kinds of spatial topological relations between a line and a region. Three elements with respect to the boundary of the line can be determined by using SDO_TOPO_MAP.GET_CONTAINING_FACE0 function to test the relations between the two extreme nodes of the line and the region. Three elements about the interior of the line can be determined by using SDO_GEOM.SDO_INTERSECTION0 function to test the relations between the line and the region. The last three element with respect to the exterior of the line can be determined by using the infiniteness of the exterior of spatial lines and regions. The algorithm can be directly used to the line that contains one or more shape points and fit for differentiating the spatial topological relations under both lines/regions and regions/lines. Experiments by practice in programming showed that the algorithm was valid and reduced the use of Oracle Spatial functions so as to can run faster.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128393900","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-09-20DOI: 10.1109/ICACTE.2010.5578987
Y. Xiaojun, Wang Yaohui, Chen Er-rui, Zhang Sha, Lian Xuezheng
Comparing with typical closed loop PID control strategy, dynamic matrix control (DMC) strategy performs well in tracking system and could also be directly applied to plant model with time-delay, however its ability of anti-interference is much weaker than typical PID control strategy. In this paper, DMC-PID cascade control strategy is proposed combined with the advantages of these two algorithms and was simulated in a uniaxial DC servo system in order to shorten the time-delay and enhance the stability of the system. The simulated results show that this double control strategy does much better than typical PID algorithm especially in tracking property, accuracy, robustness.
{"title":"The study of DMC-PID algorithm in the application of photoelectric tracking system","authors":"Y. Xiaojun, Wang Yaohui, Chen Er-rui, Zhang Sha, Lian Xuezheng","doi":"10.1109/ICACTE.2010.5578987","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5578987","url":null,"abstract":"Comparing with typical closed loop PID control strategy, dynamic matrix control (DMC) strategy performs well in tracking system and could also be directly applied to plant model with time-delay, however its ability of anti-interference is much weaker than typical PID control strategy. In this paper, DMC-PID cascade control strategy is proposed combined with the advantages of these two algorithms and was simulated in a uniaxial DC servo system in order to shorten the time-delay and enhance the stability of the system. The simulated results show that this double control strategy does much better than typical PID algorithm especially in tracking property, accuracy, robustness.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128363994","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-09-20DOI: 10.1109/ICACTE.2010.5579699
Ding Hong, Yizhu Zhao
The resource requesters and providers often belong to different security domains in the openning network. It can be achieved through automated trust negotiation to build confidence and to ensure the security of shared resources. Speeding up subsequent negotiations between the same negotiators is a problem worth of research. This paper analyzed the automatic trust negotiation and proposed the role-based fast negotiation model RBFN. RBFN introduces the concept of role. RBFN maps the counterparty to many roles according to the credentials he disclosed during previous successful negotiation. RBFN records these roles with its credential disclosure sequence in the HIB. In the subsequent negotiation, the resource provider checks that if the requester has a role that is permitted to access the resources. If such a role exists, the negotiators can disclose credentials according to the credential disclosure sequence and then conduct a successful negotiation. RBFN model was verified to has higher safety performance in the experiment and also meet the rapid demand for automated trust negotiation.
{"title":"A role-based fast negotiation model in openning network","authors":"Ding Hong, Yizhu Zhao","doi":"10.1109/ICACTE.2010.5579699","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579699","url":null,"abstract":"The resource requesters and providers often belong to different security domains in the openning network. It can be achieved through automated trust negotiation to build confidence and to ensure the security of shared resources. Speeding up subsequent negotiations between the same negotiators is a problem worth of research. This paper analyzed the automatic trust negotiation and proposed the role-based fast negotiation model RBFN. RBFN introduces the concept of role. RBFN maps the counterparty to many roles according to the credentials he disclosed during previous successful negotiation. RBFN records these roles with its credential disclosure sequence in the HIB. In the subsequent negotiation, the resource provider checks that if the requester has a role that is permitted to access the resources. If such a role exists, the negotiators can disclose credentials according to the credential disclosure sequence and then conduct a successful negotiation. RBFN model was verified to has higher safety performance in the experiment and also meet the rapid demand for automated trust negotiation.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129003842","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-09-20DOI: 10.1109/ICACTE.2010.5579671
Li Zhiqiang, Yao Min-Li, Shen Xiaowei
The antenna of the satellite communication on-the-move (SOTM) system generally is reflector antenna. Reflector antenna can not be applied on moving vehicle widely because of restrictions on dimensions and aerodynamics. Low profile phased array antenna is a good solution to this problem. When low profile phased array antenna is applied, the reduced height of the planer antenna causes some problems such as the decrease of antenna performance. Genetic algorithm optimization is applied to adjust the subarray distances to reduce the sidelobe of the antenna beam pattern. Computer simulation results show that the sidelobe of the low profile phased array antenna is suppressed by 7.1 dB after optimization.
{"title":"Sidelobe reduction of the low profile phased array antenna for satellite communication on-the-move","authors":"Li Zhiqiang, Yao Min-Li, Shen Xiaowei","doi":"10.1109/ICACTE.2010.5579671","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579671","url":null,"abstract":"The antenna of the satellite communication on-the-move (SOTM) system generally is reflector antenna. Reflector antenna can not be applied on moving vehicle widely because of restrictions on dimensions and aerodynamics. Low profile phased array antenna is a good solution to this problem. When low profile phased array antenna is applied, the reduced height of the planer antenna causes some problems such as the decrease of antenna performance. Genetic algorithm optimization is applied to adjust the subarray distances to reduce the sidelobe of the antenna beam pattern. Computer simulation results show that the sidelobe of the low profile phased array antenna is suppressed by 7.1 dB after optimization.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129368352","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-09-20DOI: 10.1109/ICACTE.2010.5579471
Chen Chen, Yinhang Cheng
Mobile robot Simultaneous Localization and Mapping (SLAM) problem is one of the most active research areas in robotics. In the research and simulation of SLAM, MATLAB-based simulators are widely used due to their comprehensive functionalities and simple usage. In this paper, the main open source MATLAB-based simulators for SLAM and their properties are listed. Two representative ones are concretely introduced from the aspects of data creation and import, motion model and observation model, and algorithms implementation. Simulation results of these two simulators indicate that MATLAB-based simulators are convenient and helpful in the robot SLAM research when developing new algorithms and when comparing accuracy, consistency or convergence of different algorithms. The SLAM algorithms widely used in MATLAB-based simulators, including Extended Kalman Filter (EKF), Unscented Kalman Filter (UKF) based SLAM algorithm and FastSLAM algorithm, are also introduced.
{"title":"MATLAB-based simulators for mobile robot Simultaneous Localization and Mapping","authors":"Chen Chen, Yinhang Cheng","doi":"10.1109/ICACTE.2010.5579471","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579471","url":null,"abstract":"Mobile robot Simultaneous Localization and Mapping (SLAM) problem is one of the most active research areas in robotics. In the research and simulation of SLAM, MATLAB-based simulators are widely used due to their comprehensive functionalities and simple usage. In this paper, the main open source MATLAB-based simulators for SLAM and their properties are listed. Two representative ones are concretely introduced from the aspects of data creation and import, motion model and observation model, and algorithms implementation. Simulation results of these two simulators indicate that MATLAB-based simulators are convenient and helpful in the robot SLAM research when developing new algorithms and when comparing accuracy, consistency or convergence of different algorithms. The SLAM algorithms widely used in MATLAB-based simulators, including Extended Kalman Filter (EKF), Unscented Kalman Filter (UKF) based SLAM algorithm and FastSLAM algorithm, are also introduced.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124688796","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-09-20DOI: 10.1109/ICACTE.2010.5579431
Quanshui Ming, Jifeng Sun
A new rate control algorithm for H.264 based on histogram of difference is proposed in this paper to improve video distortion due to high motion or scene changes. In addition, a new frame level bits allocation method is proposed instead of equal allocation. Experimental results show that the proposed method have a better performance than the previous ones.
{"title":"A rate control algorithm for H.264/AVC based on histogram of difference","authors":"Quanshui Ming, Jifeng Sun","doi":"10.1109/ICACTE.2010.5579431","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579431","url":null,"abstract":"A new rate control algorithm for H.264 based on histogram of difference is proposed in this paper to improve video distortion due to high motion or scene changes. In addition, a new frame level bits allocation method is proposed instead of equal allocation. Experimental results show that the proposed method have a better performance than the previous ones.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124695185","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-09-20DOI: 10.1109/ICACTE.2010.5579364
Jiao Xin-quan, Chu Cheng-qun, Jia Xing-zhong, Wang Ge, Zhao Xin
According to the universal measuring device of igniter in missile flight testing, this paper proposed a designing method of cylindrical explosive container, considering from the aspects of container thickness, reflected overpressure, applied materials, container structure, explosive charge of igniter, and calculating the stress twinkling charge of cylindrical explosion container, and simulating the stress through COSMOS Works software. In the end, the result is verified, and the working state of igniter is analyzed through the recycled data of missile flight testing. The result shows that the experimental result is keeping with the theoretical analysis, which means the container designing is reasonable, so that it provides the necessary data reference and support for the driving force device of trailed igniter in missile.
{"title":"The design and verification of ignition universal measuring device in missile","authors":"Jiao Xin-quan, Chu Cheng-qun, Jia Xing-zhong, Wang Ge, Zhao Xin","doi":"10.1109/ICACTE.2010.5579364","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579364","url":null,"abstract":"According to the universal measuring device of igniter in missile flight testing, this paper proposed a designing method of cylindrical explosive container, considering from the aspects of container thickness, reflected overpressure, applied materials, container structure, explosive charge of igniter, and calculating the stress twinkling charge of cylindrical explosion container, and simulating the stress through COSMOS Works software. In the end, the result is verified, and the working state of igniter is analyzed through the recycled data of missile flight testing. The result shows that the experimental result is keeping with the theoretical analysis, which means the container designing is reasonable, so that it provides the necessary data reference and support for the driving force device of trailed igniter in missile.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129657143","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-09-20DOI: 10.1109/ICACTE.2010.5579089
M. H. Shakoor, M. Moattari
There are many methods for digital image stabilization. In this paper, a fast algorithm for the digital image stabilization is proposed that use background small area for digital image stabilization. Background areas are some parts of image that have not motion object and they are suitable for global motion estimation. by using background area most of the computations for calculation of global motion are reduced and we can used local motion vector in background area directly as global motion vector. All background area are not good for motion estimation. We must use only the non uniform background area because usually motion estimation in uniform area produces incorrect result. In our proposed method 16 block in all corners (4 block for each corner) are selected then by proposed method one of these blocks is selected as best block(non uniform block that belong to the background) then local motion vector(LMV) is calculated only for this block, and it is used as global motion vector(GMV) and it is used to stabilize that frame. in next frame at first we test conditions of previous location block for new frame and if it provide our conditions we use that block for new frames so many computations have eliminated otherwise new block location must be search that provide our conditions. until selected block has conditions of our algorithm. It is used, When it has not the conditions we search new block that provides our conditions. In proposed method full search algorithm is used for local motion estimation[1], but instead of searching points in a block for full search we use, partial distortion elimination (PDE)[2] method that was used to terminate the improper candidate blocks and reduce computation for block matching in full search method.
{"title":"A new fast method for digital image stabilization","authors":"M. H. Shakoor, M. Moattari","doi":"10.1109/ICACTE.2010.5579089","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579089","url":null,"abstract":"There are many methods for digital image stabilization. In this paper, a fast algorithm for the digital image stabilization is proposed that use background small area for digital image stabilization. Background areas are some parts of image that have not motion object and they are suitable for global motion estimation. by using background area most of the computations for calculation of global motion are reduced and we can used local motion vector in background area directly as global motion vector. All background area are not good for motion estimation. We must use only the non uniform background area because usually motion estimation in uniform area produces incorrect result. In our proposed method 16 block in all corners (4 block for each corner) are selected then by proposed method one of these blocks is selected as best block(non uniform block that belong to the background) then local motion vector(LMV) is calculated only for this block, and it is used as global motion vector(GMV) and it is used to stabilize that frame. in next frame at first we test conditions of previous location block for new frame and if it provide our conditions we use that block for new frames so many computations have eliminated otherwise new block location must be search that provide our conditions. until selected block has conditions of our algorithm. It is used, When it has not the conditions we search new block that provides our conditions. In proposed method full search algorithm is used for local motion estimation[1], but instead of searching points in a block for full search we use, partial distortion elimination (PDE)[2] method that was used to terminate the improper candidate blocks and reduce computation for block matching in full search method.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126686264","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
扫码关注我们
求助内容：
应助结果提醒方式：