Pub Date : 2018-06-01DOI: 10.1109/CCDC.2018.8408111
Yujie Fu, Tong Jia, Zhaozhan Song, Bo Peng
Commodity display is very important in online shopping. In this paper, a method of reconstructing the commodity 3D model is proposed. Firstly, this paper accepts point clouds of a commodity from different angles. Secondly, before initial alignment, this paper compresses point clouds based on octree. Thirdly, this paper aligns all point clouds. At last, we reconstruct the commodity surface. In this step, a point cloud smoothing algorithm based on MLS and a Delaunay growth projection algorithm are proposed. Experimental results demonstrate that the computation time consumed by our improved registration algorithm is only one sixth of that of traditional one. And the quality only decreases slightly. The commodity 3D model has been successfully and efficiently reconstructed.
{"title":"Commodity 3D display based on point cloud reconstruction","authors":"Yujie Fu, Tong Jia, Zhaozhan Song, Bo Peng","doi":"10.1109/CCDC.2018.8408111","DOIUrl":"https://doi.org/10.1109/CCDC.2018.8408111","url":null,"abstract":"Commodity display is very important in online shopping. In this paper, a method of reconstructing the commodity 3D model is proposed. Firstly, this paper accepts point clouds of a commodity from different angles. Secondly, before initial alignment, this paper compresses point clouds based on octree. Thirdly, this paper aligns all point clouds. At last, we reconstruct the commodity surface. In this step, a point cloud smoothing algorithm based on MLS and a Delaunay growth projection algorithm are proposed. Experimental results demonstrate that the computation time consumed by our improved registration algorithm is only one sixth of that of traditional one. And the quality only decreases slightly. The commodity 3D model has been successfully and efficiently reconstructed.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123792496","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 : 2018-06-01DOI: 10.1109/CCDC.2018.8407121
Li Yongfang, Zhao Yu
This paper studies the formation-containment problem for multi-agent systems. By using motion-planning approaches, a new class of distributed formation-containment protocols are designed for multi-agent systems such that the states of followers asymptotically converge to the convex hull formed by the states of leaders. Then, by selecting a special sampling time sequence, the finite-time formation-containment problem are solved for multi-agent systems. Finally, a numerical simulation is shown to verify the theory results in this paper.
{"title":"Motion-planning-based formation-containment control for multi-agent systems","authors":"Li Yongfang, Zhao Yu","doi":"10.1109/CCDC.2018.8407121","DOIUrl":"https://doi.org/10.1109/CCDC.2018.8407121","url":null,"abstract":"This paper studies the formation-containment problem for multi-agent systems. By using motion-planning approaches, a new class of distributed formation-containment protocols are designed for multi-agent systems such that the states of followers asymptotically converge to the convex hull formed by the states of leaders. Then, by selecting a special sampling time sequence, the finite-time formation-containment problem are solved for multi-agent systems. Finally, a numerical simulation is shown to verify the theory results in this paper.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123214644","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 order to solve the excessive consumption in space and time of standard support vector machine (SVM) and local SVM, a novel classification model called global and local SVM (GLSVM) is proposed. This new model obtains the global SVM by training non-boundary samples set. It obtains local SVM by training k-nearest neighbors in boundary samples set for each testing sample. In testing stage, the class of some testing samples is determined directly through global decision boundary. And the class of the others is determined with local SVM. Experiments prove that our proposed classification model has perfect performance in accuracy and efficiency.
{"title":"Classification method based on global and local support vector machine","authors":"Liming Liu, Mao-xiang Chu, Rongfen Gong, Dapeng Xu","doi":"10.1109/CCDC.2018.8407280","DOIUrl":"https://doi.org/10.1109/CCDC.2018.8407280","url":null,"abstract":"In order to solve the excessive consumption in space and time of standard support vector machine (SVM) and local SVM, a novel classification model called global and local SVM (GLSVM) is proposed. This new model obtains the global SVM by training non-boundary samples set. It obtains local SVM by training k-nearest neighbors in boundary samples set for each testing sample. In testing stage, the class of some testing samples is determined directly through global decision boundary. And the class of the others is determined with local SVM. Experiments prove that our proposed classification model has perfect performance in accuracy and efficiency.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116158623","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 : 2018-06-01DOI: 10.1109/CCDC.2018.8408088
Baoqi Huang, Jian Song, Bing Jia, Long Zhao
In order to reduce the overheads of constructing a dense radio map as well as to prevent the accuracy degradation, various crowdsourcing-based methods have been developed to automatically collect WiFi RSS measurements to build the radio map. Unlike existing studies focusing on crowdsourcing techniques, this paper deals with how to efficiently and accurately produce the radio map based on crowdsourcing RSS measurements which suffer from noisy location labels. In the literature, gaussian process regression (GPR) is commonly adopted to construct radio maps by sufficiently making use of the spatial correlation among received signal strength (RSS) measurements at nearby locations. However, the standard GPR does not take into account the uncertainties in the location labels attached to the crowdsourcing RSS measurements, which consequently deteriorates the performance of localization systems relying on the corresponding radio maps. Hence, the standard GPR is extended to mitigate the influences of noisy location labels. Experiments are carried out based on practical RSS measurements, and confirm the feasibility and superiority of the proposed method.
{"title":"On the crowdsourcing-based radio map construction with noisy location labels","authors":"Baoqi Huang, Jian Song, Bing Jia, Long Zhao","doi":"10.1109/CCDC.2018.8408088","DOIUrl":"https://doi.org/10.1109/CCDC.2018.8408088","url":null,"abstract":"In order to reduce the overheads of constructing a dense radio map as well as to prevent the accuracy degradation, various crowdsourcing-based methods have been developed to automatically collect WiFi RSS measurements to build the radio map. Unlike existing studies focusing on crowdsourcing techniques, this paper deals with how to efficiently and accurately produce the radio map based on crowdsourcing RSS measurements which suffer from noisy location labels. In the literature, gaussian process regression (GPR) is commonly adopted to construct radio maps by sufficiently making use of the spatial correlation among received signal strength (RSS) measurements at nearby locations. However, the standard GPR does not take into account the uncertainties in the location labels attached to the crowdsourcing RSS measurements, which consequently deteriorates the performance of localization systems relying on the corresponding radio maps. Hence, the standard GPR is extended to mitigate the influences of noisy location labels. Experiments are carried out based on practical RSS measurements, and confirm the feasibility and superiority of the proposed method.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116274507","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 : 2018-06-01DOI: 10.1109/CCDC.2018.8407981
Hong He, Yunhui Jia, Lei Sun
Solving the problem of simultaneous location and map construction (SLAM) is the core of robot autonomous navigation. At present, most algorithms usually only consider the odometer information of mobile robot, therefor, there exists some problems of increasing computation amount caused by a large number of sampling particles and the complexity. So, this paper developed a scheme of map construction and positioning based on RBPF-SLAM algorithm. The hardware and software platform is set up on the ROS, and it merge the odometer information of the robot into the distance information collected by the laser sensor, which effectively reduces the number of required particles and the uncertainty of the robot's pose estimates in filter prediction phase. Through the experimental, get the conclusion: simultaneous positioning based on RBPF-SLAM algorithm and map construction system can create high-precision online raster map in real time, and it is more consistent with the actual map.
{"title":"Simultaneous Location and Map Construction Based on RBPF-SLAM Algorithm","authors":"Hong He, Yunhui Jia, Lei Sun","doi":"10.1109/CCDC.2018.8407981","DOIUrl":"https://doi.org/10.1109/CCDC.2018.8407981","url":null,"abstract":"Solving the problem of simultaneous location and map construction (SLAM) is the core of robot autonomous navigation. At present, most algorithms usually only consider the odometer information of mobile robot, therefor, there exists some problems of increasing computation amount caused by a large number of sampling particles and the complexity. So, this paper developed a scheme of map construction and positioning based on RBPF-SLAM algorithm. The hardware and software platform is set up on the ROS, and it merge the odometer information of the robot into the distance information collected by the laser sensor, which effectively reduces the number of required particles and the uncertainty of the robot's pose estimates in filter prediction phase. Through the experimental, get the conclusion: simultaneous positioning based on RBPF-SLAM algorithm and map construction system can create high-precision online raster map in real time, and it is more consistent with the actual map.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116280770","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 : 2018-06-01DOI: 10.1109/CCDC.2018.8407488
Chunling Chang, Yuanwei Jing, B. Zhu
This paper is concerned the bifurcation and chaos robust control of a descriptor epidemic system with nonlinear incidence rate based on T-S fuzzy model. To do this, the dynamic behavior of the epidemic system is analyzed by numerical simulation, the parameter variations leading to the bifurcation behavior and chaos of the epidemic system is verified by Lyapunov exponent. In order ameliorate the exiting results, a T-S fuzzy model is adopted to describe the infectious disease, under this way the solution to control problem of nonlinear system is changed into solution to the control problem of the linear system. Then a controller for this T-S fuzzy system is designed by using linear matrix inequalities (LMIs). The proposed controller approaches successfully eliminate the chaos appeared in the system. The effectiveness is verified by some numerical simulation results.
{"title":"Modeling and control for a descriptor epidemic system with nonlinear incidence rates","authors":"Chunling Chang, Yuanwei Jing, B. Zhu","doi":"10.1109/CCDC.2018.8407488","DOIUrl":"https://doi.org/10.1109/CCDC.2018.8407488","url":null,"abstract":"This paper is concerned the bifurcation and chaos robust control of a descriptor epidemic system with nonlinear incidence rate based on T-S fuzzy model. To do this, the dynamic behavior of the epidemic system is analyzed by numerical simulation, the parameter variations leading to the bifurcation behavior and chaos of the epidemic system is verified by Lyapunov exponent. In order ameliorate the exiting results, a T-S fuzzy model is adopted to describe the infectious disease, under this way the solution to control problem of nonlinear system is changed into solution to the control problem of the linear system. Then a controller for this T-S fuzzy system is designed by using linear matrix inequalities (LMIs). The proposed controller approaches successfully eliminate the chaos appeared in the system. The effectiveness is verified by some numerical simulation results.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116343843","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 : 2018-06-01DOI: 10.1109/CCDC.2018.8407306
Xinning Li, Zhiping Zhou
In view of the increasing demand for privacy protection, traditional data mining process has to be optimized when the data owners are usually unwilling to release their original data for analysis. Aiming at the data classification in data mining, we have proposed CI-SVM (Condensed Information-Support Vector Machine) algorithm to achieve safe and efficient data classification. In this paper, the RCI-SVM (Random Linear Transformation with Condensed Information-Support Vector Machine) algorithm is proposed to use random linear transformation to convert the condensed information to another random vector space. The compressed information in CI-SVM are obtained by clustering the original data, although it is possible to ensure that the accurate original information will not be exposed, to some extent they may still carry some characteristics of the original datasets. Unlike most of the existing data perturbations, due to the early information enrichment processing, RCI-SVM will not preserve the dot product and Euclidean distance relationship between the original datasets and the transformed datasets, which means it's stronger than existing methods in security. Our experiment results on datasets show that the proposed RCI-SVM algorithm can performs well on classification efficiency and security.
随着人们对隐私保护的要求越来越高，在数据所有者不愿意公开其原始数据进行分析的情况下，传统的数据挖掘过程不得不进行优化。针对数据挖掘中的数据分类问题，提出了CI-SVM (Condensed Information-Support Vector Machine，浓缩信息支持向量机)算法来实现安全高效的数据分类。本文提出了RCI-SVM (Random Linear Transformation with Condensed information - support Vector Machine)算法，利用随机线性变换将压缩后的信息转换为另一个随机向量空间。CI-SVM中的压缩信息是通过对原始数据进行聚类得到的，虽然可以保证不暴露准确的原始信息，但在一定程度上仍然可能带有原始数据集的一些特征。与现有的大多数数据扰动不同，RCI-SVM由于进行了早期的信息充实处理，因此不会保留原始数据集与变换后数据集之间的点积和欧氏距离关系，这意味着它在安全性方面比现有方法更强。在数据集上的实验结果表明，本文提出的RCI-SVM算法在分类效率和安全性上都有较好的表现。
{"title":"Secure support vector machines with data perturbation","authors":"Xinning Li, Zhiping Zhou","doi":"10.1109/CCDC.2018.8407306","DOIUrl":"https://doi.org/10.1109/CCDC.2018.8407306","url":null,"abstract":"In view of the increasing demand for privacy protection, traditional data mining process has to be optimized when the data owners are usually unwilling to release their original data for analysis. Aiming at the data classification in data mining, we have proposed CI-SVM (Condensed Information-Support Vector Machine) algorithm to achieve safe and efficient data classification. In this paper, the RCI-SVM (Random Linear Transformation with Condensed Information-Support Vector Machine) algorithm is proposed to use random linear transformation to convert the condensed information to another random vector space. The compressed information in CI-SVM are obtained by clustering the original data, although it is possible to ensure that the accurate original information will not be exposed, to some extent they may still carry some characteristics of the original datasets. Unlike most of the existing data perturbations, due to the early information enrichment processing, RCI-SVM will not preserve the dot product and Euclidean distance relationship between the original datasets and the transformed datasets, which means it's stronger than existing methods in security. Our experiment results on datasets show that the proposed RCI-SVM algorithm can performs well on classification efficiency and security.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116351689","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 : 2018-06-01DOI: 10.1109/CCDC.2018.8407227
Tan Jiansheng, Pan Wei, Sun Jian, Xu Shaolin
The micro variation chaos genetic algorithm designed as a general optimization method was applied to the ambiguity resolution of pulse Doppler (PD) radar. The fitness, based on squared error for multi-PRF (pulse repeat frequency) consecutive ordered ranges, was designed. The crossover operator and the conditions of ending in GA were discussed. The relations among the probability of ambiguity resolution of this algorithm, the measurement error and the computational efficiency were analyzed. Simulation results show the ambiguity resolution algorithm does better than the sliding window algorithm on the probability of ambiguity resolution.
{"title":"Pulse Doppler radar based on micro variation chaos genetic algorithm","authors":"Tan Jiansheng, Pan Wei, Sun Jian, Xu Shaolin","doi":"10.1109/CCDC.2018.8407227","DOIUrl":"https://doi.org/10.1109/CCDC.2018.8407227","url":null,"abstract":"The micro variation chaos genetic algorithm designed as a general optimization method was applied to the ambiguity resolution of pulse Doppler (PD) radar. The fitness, based on squared error for multi-PRF (pulse repeat frequency) consecutive ordered ranges, was designed. The crossover operator and the conditions of ending in GA were discussed. The relations among the probability of ambiguity resolution of this algorithm, the measurement error and the computational efficiency were analyzed. Simulation results show the ambiguity resolution algorithm does better than the sliding window algorithm on the probability of ambiguity resolution.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121747299","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 : 2018-06-01DOI: 10.1109/CCDC.2018.8408131
Yubin Wang, Wenyong Li, J. van Schuppen, J. Vrancken
This paper presents a Multilevel Control framework which offers a scalable approach to network-level traffic management, in short: Network Management (NM), which is the coherent management of traffic in large road networks. The framework distributes the complexity of NM among different levels and, per level, among a number of subnetworks, such that each management instance has only a limited amount of complexity to cope with. In this way, NM becomes feasible and scalable, such that it can be applied to heterogeneous networks of arbitrary size.
{"title":"Multilevel control of traffic flow in a motorway network","authors":"Yubin Wang, Wenyong Li, J. van Schuppen, J. Vrancken","doi":"10.1109/CCDC.2018.8408131","DOIUrl":"https://doi.org/10.1109/CCDC.2018.8408131","url":null,"abstract":"This paper presents a Multilevel Control framework which offers a scalable approach to network-level traffic management, in short: Network Management (NM), which is the coherent management of traffic in large road networks. The framework distributes the complexity of NM among different levels and, per level, among a number of subnetworks, such that each management instance has only a limited amount of complexity to cope with. In this way, NM becomes feasible and scalable, such that it can be applied to heterogeneous networks of arbitrary size.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124489175","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 : 2018-06-01DOI: 10.1109/CCDC.2018.8407169
Gu Qiaolun, Gao Tiegang
In reverse supply chain under our study, IERs and UIC are the inspection-error-rates and the unit inspection cost respectively. This reverse supply chain consists of two members: remanufacturer and collector. The collector is responsible for collecting the used-products from the used-product market and inspecting the collected used-products. In order to reduce the IERs, the collector increases investment, namely, the unit inspecting cost increases. In this paper, considering IERs and UIC, we focus on the price decisions for reverse supply chain by game theory. We present the optimal price decisions, and analyze the impacts of IERs and UIC on the optimal results by numerical example. The research results can help the remanufacturer and the collector make their optimal price decisions for reverse supply chain considering both IERs and UIC.
{"title":"Price decisions for reverse supply chain considering IERs and UIC","authors":"Gu Qiaolun, Gao Tiegang","doi":"10.1109/CCDC.2018.8407169","DOIUrl":"https://doi.org/10.1109/CCDC.2018.8407169","url":null,"abstract":"In reverse supply chain under our study, IERs and UIC are the inspection-error-rates and the unit inspection cost respectively. This reverse supply chain consists of two members: remanufacturer and collector. The collector is responsible for collecting the used-products from the used-product market and inspecting the collected used-products. In order to reduce the IERs, the collector increases investment, namely, the unit inspecting cost increases. In this paper, considering IERs and UIC, we focus on the price decisions for reverse supply chain by game theory. We present the optimal price decisions, and analyze the impacts of IERs and UIC on the optimal results by numerical example. The research results can help the remanufacturer and the collector make their optimal price decisions for reverse supply chain considering both IERs and UIC.","PeriodicalId":409960,"journal":{"name":"2018 Chinese Control And Decision Conference (CCDC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124507320","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
扫码关注我们
求助内容：
应助结果提醒方式：