Pub Date : 2014-12-08DOI: 10.1109/ICNC.2014.6975958
Jianfu Wang, Lanfang Dong
As the latest coding standard, High Efficiency Video Coding (HEVC) has an obvious advantage in coding efficiency. Compared to H.264 Advanced Video Coding (H.264/AVC), HEVC can achieve about 50% bitrate reduction at the same subjective video quality. However, the enhancement in compression efficiency has been achieved at the cost of large increase in computational complexity. In this paper, to reduce the computational complexity, we propose a new coding scheme for surveillance videos using inter-frame difference to encode different image areas with different encoder options. The scheme is implemented through the proposed fast Coding Unit (CU) size decision algorithm. With using the luma component of difference image, the proposed algorithm can segment out moving objects from background, and then select proper CU size for different areas. Experimental results show that the encoding complexity can be reduced by an average of 45% with small increment in bitrate and negligible loss in Peak Signal to Noise Ratio (PSNR) compared to the High efficiency video coding test Model (HM) 9.2 reference software. Furthermore, the proposed scheme is not only applied to surveillance videos recorded by static cameras, but also applied to regular videos with excellent coding performance.
高效视频编码(High Efficiency Video coding, HEVC)作为最新的编码标准，在编码效率方面具有明显的优势。与H.264高级视频编码(H.264/AVC)相比，在相同的主观视频质量下，HEVC可以实现约50%的比特率降低。然而，压缩效率的提高是以计算复杂度的大幅增加为代价的。为了降低计算复杂度，本文提出了一种新的监控视频编码方案，利用帧间差分对不同的图像区域使用不同的编码器选项进行编码。该方案通过提出的快速编码单元(CU)大小决策算法实现。该算法利用差分图像的亮度分量，从背景中分割出运动目标，然后在不同区域选择合适的CU大小。实验结果表明，与高效视频编码测试模型(HM) 9.2参考软件相比，编码复杂度平均降低45%，比特率增量很小，峰值信噪比(PSNR)损失可以忽略。此外，该方案不仅适用于静态摄像机录制的监控视频，也适用于编码性能优异的普通视频。
{"title":"An efficient coding scheme for surveillance videos based on high efficiency video coding","authors":"Jianfu Wang, Lanfang Dong","doi":"10.1109/ICNC.2014.6975958","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975958","url":null,"abstract":"As the latest coding standard, High Efficiency Video Coding (HEVC) has an obvious advantage in coding efficiency. Compared to H.264 Advanced Video Coding (H.264/AVC), HEVC can achieve about 50% bitrate reduction at the same subjective video quality. However, the enhancement in compression efficiency has been achieved at the cost of large increase in computational complexity. In this paper, to reduce the computational complexity, we propose a new coding scheme for surveillance videos using inter-frame difference to encode different image areas with different encoder options. The scheme is implemented through the proposed fast Coding Unit (CU) size decision algorithm. With using the luma component of difference image, the proposed algorithm can segment out moving objects from background, and then select proper CU size for different areas. Experimental results show that the encoding complexity can be reduced by an average of 45% with small increment in bitrate and negligible loss in Peak Signal to Noise Ratio (PSNR) compared to the High efficiency video coding test Model (HM) 9.2 reference software. Furthermore, the proposed scheme is not only applied to surveillance videos recorded by static cameras, but also applied to regular videos with excellent coding performance.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134189351","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975906
Li Ren, Y. Diao
Matching performance of ship engine propeller and net has a significant impact on propulsion efficiency for the trawler. In this paper, an improved genetic algorithm (GA) based on the particle swarm algorithm (PSO) is developed for matching optimization of ship engine propeller and net. Based on ship theory, the matching performance of ship engine propeller and net is analyzed. Considering the angular speed, picth ratio and disk ratio of propeller, a mathematical model is constructed in which the open-water propeller efficiency is taken as the objective function for matching optimization of ship engine propeller and net. The improved GA is presented to solve it, in which the PSO operator is introduced to the GA for the diversity of populations. The effectiveness of the approach is illustrated by a matching optimization example of ship engine propeller and net for the trawler.
{"title":"Matching optimization of ship engine propeller and net for the trawler based on genetic algorithm","authors":"Li Ren, Y. Diao","doi":"10.1109/ICNC.2014.6975906","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975906","url":null,"abstract":"Matching performance of ship engine propeller and net has a significant impact on propulsion efficiency for the trawler. In this paper, an improved genetic algorithm (GA) based on the particle swarm algorithm (PSO) is developed for matching optimization of ship engine propeller and net. Based on ship theory, the matching performance of ship engine propeller and net is analyzed. Considering the angular speed, picth ratio and disk ratio of propeller, a mathematical model is constructed in which the open-water propeller efficiency is taken as the objective function for matching optimization of ship engine propeller and net. The improved GA is presented to solve it, in which the PSO operator is introduced to the GA for the diversity of populations. The effectiveness of the approach is illustrated by a matching optimization example of ship engine propeller and net for the trawler.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133047289","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975884
Y. Yuan, Yuanguo Zhu
Artificial bee colony (ABC) algorithm introduced by D. Karaboga was inspired by the behaviors of real honey bee colonies. The routes of the swarm are exploited according to the neighbor information by employed bees and onlookers in the ABC algorithm. The classic artificial bee colony algorithm as a swarm optimization method is sometimes trapped in local optima. In this paper we propose a hybrid algorithm based on ABC algorithm and genetic algorithm. In the hybrid procedure, the crossover operator and mutation operator of genetic algorithm are introduced to improve the ABC algorithm in solving complex optimization problems. In the paper, the experiments for Traveling Salesman Problem and function optimization problems show that the proposed algorithm is more efficient compared with other techniques in recent literature.
{"title":"A hybrid artificial bee colony optimization algorithm","authors":"Y. Yuan, Yuanguo Zhu","doi":"10.1109/ICNC.2014.6975884","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975884","url":null,"abstract":"Artificial bee colony (ABC) algorithm introduced by D. Karaboga was inspired by the behaviors of real honey bee colonies. The routes of the swarm are exploited according to the neighbor information by employed bees and onlookers in the ABC algorithm. The classic artificial bee colony algorithm as a swarm optimization method is sometimes trapped in local optima. In this paper we propose a hybrid algorithm based on ABC algorithm and genetic algorithm. In the hybrid procedure, the crossover operator and mutation operator of genetic algorithm are introduced to improve the ABC algorithm in solving complex optimization problems. In the paper, the experiments for Traveling Salesman Problem and function optimization problems show that the proposed algorithm is more efficient compared with other techniques in recent literature.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122690018","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975816
P. Hájek, V. Olej
This paper develops a methodology to extract concepts containing qualitative information from corporate annual reports. The concepts are extracted from the corpus of U.S. corporate annual reports using WordNet ontology and singular value decomposition, and further visualized using self-organizing maps. The methodology makes it possible to easily compare the concepts with future financial performance. The results suggest that annual reports differ in terms of the concepts emphasized reflecting future financial performance.
{"title":"Comparing corporate financial performance and qualitative information from annual reports using self-organizing maps","authors":"P. Hájek, V. Olej","doi":"10.1109/ICNC.2014.6975816","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975816","url":null,"abstract":"This paper develops a methodology to extract concepts containing qualitative information from corporate annual reports. The concepts are extracted from the corpus of U.S. corporate annual reports using WordNet ontology and singular value decomposition, and further visualized using self-organizing maps. The methodology makes it possible to easily compare the concepts with future financial performance. The results suggest that annual reports differ in terms of the concepts emphasized reflecting future financial performance.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122960513","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975859
Rong-Qiang Zeng, Ming-Sheng Shang
This paper presents a multi-objective path relinking algorithm for solving bi-objective flow shop problem, where we aim to minimize the total completion time and total tardiness. In this algorithm, we integrate path relinking techniques into hypervolume-based multi-objective optimization. We propose a method to construct a path and select a set of non-dominated solutions from the path for further improvements. Experimental results show the proposed algorithm is very effective in comparison with the original multi-objective local search algorithms.
{"title":"Solving bi-objective flow shop problem with multi-objective path relinking algorithm","authors":"Rong-Qiang Zeng, Ming-Sheng Shang","doi":"10.1109/ICNC.2014.6975859","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975859","url":null,"abstract":"This paper presents a multi-objective path relinking algorithm for solving bi-objective flow shop problem, where we aim to minimize the total completion time and total tardiness. In this algorithm, we integrate path relinking techniques into hypervolume-based multi-objective optimization. We propose a method to construct a path and select a set of non-dominated solutions from the path for further improvements. Experimental results show the proposed algorithm is very effective in comparison with the original multi-objective local search algorithms.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128750829","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975926
Yanshan He, Min Yue
Owing to the widely used of data stream, frequent itemset mining on data stream have received more attention. Data stream is fast changing, massive, and potentially infinite. Therefore, we have to establish new data structure and algorithm to mine it. On the base of our previous work, we propose a new paralleled frequent itemset mining algorithm for data stream based on sliding window, which is called PFIMSD. The algorithm compresses whole data in current window into PSD-trees on paralleled processor only by one-scan. Increment method is used to append or delete related branch on PSD-tree when window is sliding. The experiment shows PFIMSD algorithm has good performance on efficiency and expansibility.
{"title":"Parallel frequent itemset mining on streaming data","authors":"Yanshan He, Min Yue","doi":"10.1109/ICNC.2014.6975926","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975926","url":null,"abstract":"Owing to the widely used of data stream, frequent itemset mining on data stream have received more attention. Data stream is fast changing, massive, and potentially infinite. Therefore, we have to establish new data structure and algorithm to mine it. On the base of our previous work, we propose a new paralleled frequent itemset mining algorithm for data stream based on sliding window, which is called PFIMSD. The algorithm compresses whole data in current window into PSD-trees on paralleled processor only by one-scan. Increment method is used to append or delete related branch on PSD-tree when window is sliding. The experiment shows PFIMSD algorithm has good performance on efficiency and expansibility.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116886547","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975911
Xiaoxu He, C. Shao, Y. Xiong
Cluster analysis is an important and challenging subject in time series data mining. It has a very important application prospect in many areas, such as medical images, atmosphere, finance, etc. Many current clustering techniques have still many problems, for example, k-means is a very effective method in finding different shapes and tolerating noise, but its result severely depends on the suitable choice of parameters. Inspired by nuclear field in physics, we propose a new dynamic clustering method based on nuclear force and interaction. Basically, each data point in data space is considered as a material particle with a spherically symmetric field around it and the interaction of all data points forms a nuclear field. Through the interaction of nuclear force, the initial clusters are iteratively merged and a hierarchy of clusters are generated. Experimental results show that compared with the typical clustering method k-means, the proposed approach enjoys favorite clustering quality and requires no careful parameters tuning.
{"title":"A new dynamic clustering method based on nuclear field","authors":"Xiaoxu He, C. Shao, Y. Xiong","doi":"10.1109/ICNC.2014.6975911","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975911","url":null,"abstract":"Cluster analysis is an important and challenging subject in time series data mining. It has a very important application prospect in many areas, such as medical images, atmosphere, finance, etc. Many current clustering techniques have still many problems, for example, k-means is a very effective method in finding different shapes and tolerating noise, but its result severely depends on the suitable choice of parameters. Inspired by nuclear field in physics, we propose a new dynamic clustering method based on nuclear force and interaction. Basically, each data point in data space is considered as a material particle with a spherically symmetric field around it and the interaction of all data points forms a nuclear field. Through the interaction of nuclear force, the initial clusters are iteratively merged and a hierarchy of clusters are generated. Experimental results show that compared with the typical clustering method k-means, the proposed approach enjoys favorite clustering quality and requires no careful parameters tuning.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"40 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114118302","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975852
Yuxin Liu, Yuxiao Lu, Chao Gao, Z. Zhang, Li Tao
Multi-objective traveling salesman problem (MOTSP) is an important field in operations research, which has wide applications in the real world. Multi-objective ant colony optimization (MOACO) as one of the most effective algorithms has gained popularity for solving a MOTSP. However, there exists the problem of premature convergence in most of MOACO algorithms. With this observation in mind, an improved multi-objective network ant colony optimization, denoted as PM-MONACO, is proposed, which employs the unique feature of critical tubes reserved in the network evolution process of the Physarum-inspired mathematical model (PMM). By considering both pheromones deposited by ants and flowing in the Physarum network, PM-MONACO uses an optimized pheromone matrix updating strategy. Experimental results in benchmark networks show that PM-MONACO can achieve a better compromise solution than the original MOACO algorithm for solving MOTSPs.
{"title":"A multi-objective ant colony optimization algorithm based on the Physarum-inspired mathematical model","authors":"Yuxin Liu, Yuxiao Lu, Chao Gao, Z. Zhang, Li Tao","doi":"10.1109/ICNC.2014.6975852","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975852","url":null,"abstract":"Multi-objective traveling salesman problem (MOTSP) is an important field in operations research, which has wide applications in the real world. Multi-objective ant colony optimization (MOACO) as one of the most effective algorithms has gained popularity for solving a MOTSP. However, there exists the problem of premature convergence in most of MOACO algorithms. With this observation in mind, an improved multi-objective network ant colony optimization, denoted as PM-MONACO, is proposed, which employs the unique feature of critical tubes reserved in the network evolution process of the Physarum-inspired mathematical model (PMM). By considering both pheromones deposited by ants and flowing in the Physarum network, PM-MONACO uses an optimized pheromone matrix updating strategy. Experimental results in benchmark networks show that PM-MONACO can achieve a better compromise solution than the original MOACO algorithm for solving MOTSPs.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"8 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114122382","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975979
X. Ge, Lili Li, Hui Li
Epidemic spreading and immunization are influenced by network structure measured via metrics. Degree mixing is a common property of network reflecting links in regards of node degree. In this paper we study epidemics spreading and immunization on degree mixing using empirical network data, analytic models, and numerical simulation. We demonstrate that assortative (or disassortative) degree mixing indeed influence spreading and effect of immunization. In the point of epidemic spreading, assortativity decreases speed and stable infected ratio, resulting in a better result, but decrease epidemic threshold. In the point of immunization, strategy that targets hub nodes has better effect on disassortative network.
{"title":"Epidemic spreading and immunization on assortative degree mixing networks","authors":"X. Ge, Lili Li, Hui Li","doi":"10.1109/ICNC.2014.6975979","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975979","url":null,"abstract":"Epidemic spreading and immunization are influenced by network structure measured via metrics. Degree mixing is a common property of network reflecting links in regards of node degree. In this paper we study epidemics spreading and immunization on degree mixing using empirical network data, analytic models, and numerical simulation. We demonstrate that assortative (or disassortative) degree mixing indeed influence spreading and effect of immunization. In the point of epidemic spreading, assortativity decreases speed and stable infected ratio, resulting in a better result, but decrease epidemic threshold. In the point of immunization, strategy that targets hub nodes has better effect on disassortative network.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116169959","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 : 2014-12-08DOI: 10.1109/ICNC.2014.6975919
Yue Chen, Changchun Pan, Gen-ke Yang, Jie Bai
With the promotion of Early Admission (EA) among the universities in China, its prediction accuracy of the potential of the students with regard to their academic performance is highly concerned. In this study, the statistical methods and the artificial intelligence technologies were used comparatively to build the prediction models. According to our best knowledge, this is the first time that a model is established to evaluate student candidates for admission to the university. We carried out a comparison of the current EA system based on the real admission data from a reputed university with typical EA procedures. The results show that prediction capability of EA is improved significantly with the help of the models. Afterwards, the impact of predictors was discussed and presented.
{"title":"Intelligent decision system for accessing academic performance of candidates for early admission to university","authors":"Yue Chen, Changchun Pan, Gen-ke Yang, Jie Bai","doi":"10.1109/ICNC.2014.6975919","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975919","url":null,"abstract":"With the promotion of Early Admission (EA) among the universities in China, its prediction accuracy of the potential of the students with regard to their academic performance is highly concerned. In this study, the statistical methods and the artificial intelligence technologies were used comparatively to build the prediction models. According to our best knowledge, this is the first time that a model is established to evaluate student candidates for admission to the university. We carried out a comparison of the current EA system based on the real admission data from a reputed university with typical EA procedures. The results show that prediction capability of EA is improved significantly with the help of the models. Afterwards, the impact of predictors was discussed and presented.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116215991","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
扫码关注我们
求助内容：
应助结果提醒方式：