In DNA computing, the design of DNA sequences is one of the most important practical and important research topics. Since DNA sequence design need meet simultaneously several physical, chemical and logical constraints, it is difficult to be solved by the traditional optimization methods. In this paper, the gravitational search algorithm is implemented to solve the DNA sequence design problem. The results of simulation experiments show that the improved algorithm is valid and outperforms other evolutionary algorithms.
{"title":"DNA Sequences Optimization Based on Gravitational Search Algorithm for Reliable DNA Computing","authors":"Jian-hua Xiao, Zhen Cheng","doi":"10.1109/BIC-TA.2011.12","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.12","url":null,"abstract":"In DNA computing, the design of DNA sequences is one of the most important practical and important research topics. Since DNA sequence design need meet simultaneously several physical, chemical and logical constraints, it is difficult to be solved by the traditional optimization methods. In this paper, the gravitational search algorithm is implemented to solve the DNA sequence design problem. The results of simulation experiments show that the improved algorithm is valid and outperforms other evolutionary algorithms.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121732438","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}
U. K. Yusof, R. Budiarto, Ibrahim Venkat, S. Deris
Manufacturing industries are facing mere challenges in handling product competitiveness, shorter product cycle time and product varieties. The situation poses a need to improve the effectiveness and efficiency of capacity planning and resource optimization while still maintaining their flexibilities. Machine loading - one of the important components of capacity planning is known for its complexity that encompasses various types of flexibilities pertaining to part selection, machine and operation assignment along with constraints. Various studies are done to balance the productivity and flexibility in flexible manufacturing system (FMS). From the literature, the researchers have developed many approaches to reach a suitable balance of exploration (global improvement) and exploitation (local improvement). We adopt hybrid of population approaches, Hybrid Genetic Algorithm and Harmony Search algorithm (H-GaHs), to solve this problem that aims on mapping the feasible solution to the domain problem. The objectives are to minimize the system unbalance as well as increase throughput while satisfying the technological constraints such as machine time availability and tool slots. The proposed algorithm is tested for its performance on 10 sample problems available in FMS literature and compared with existing solution approaches.
{"title":"Machine Loading Optimization in Flexible Manufacturing System Using a Hybrid of Bio-inspired and Musical-Composition Approach","authors":"U. K. Yusof, R. Budiarto, Ibrahim Venkat, S. Deris","doi":"10.1109/BIC-TA.2011.10","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.10","url":null,"abstract":"Manufacturing industries are facing mere challenges in handling product competitiveness, shorter product cycle time and product varieties. The situation poses a need to improve the effectiveness and efficiency of capacity planning and resource optimization while still maintaining their flexibilities. Machine loading - one of the important components of capacity planning is known for its complexity that encompasses various types of flexibilities pertaining to part selection, machine and operation assignment along with constraints. Various studies are done to balance the productivity and flexibility in flexible manufacturing system (FMS). From the literature, the researchers have developed many approaches to reach a suitable balance of exploration (global improvement) and exploitation (local improvement). We adopt hybrid of population approaches, Hybrid Genetic Algorithm and Harmony Search algorithm (H-GaHs), to solve this problem that aims on mapping the feasible solution to the domain problem. The objectives are to minimize the system unbalance as well as increase throughput while satisfying the technological constraints such as machine time availability and tool slots. The proposed algorithm is tested for its performance on 10 sample problems available in FMS literature and compared with existing solution approaches.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133288882","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}
Many physiological system in humans and animals are complex systems. Hemodynamic is a branch of physiology and is a complex system which deals with the study of blood flow in arteries. We study the complex physical system of blood flow in a narrow artery with asymmetric stenos is in the presence of external magnetic field, treating blood as Herschel-Bulkey fluid model. Finite difference scheme is applied to solve the resulting system of nonlinear partial differential equations with appropriate initial and boundary conditions. The finite difference schemes for the velocity distribution, skin friction, flow rate and longitudinal impedance to flow are obtained. It is found that the velocity decreases with the increase of the magnetic field and pressure gradient reverse behavior is noticed when the yield stress and depth of the stenos is increase. It is also observed that the flow rate decreases with the increase of the stenos is shape parameter, power law index and yield stress. Also, it is noted that the presence of external magnetic field influences the mean velocity by increasing its magnitude significantly in arteries of different radii.
{"title":"Mathematical Modeling of a Complex System for MHD Flow in Hemodynamics","authors":"D. Sankar, Nurul Aini Jaffar, A. Ismail, A. Nagar","doi":"10.1109/BIC-TA.2011.47","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.47","url":null,"abstract":"Many physiological system in humans and animals are complex systems. Hemodynamic is a branch of physiology and is a complex system which deals with the study of blood flow in arteries. We study the complex physical system of blood flow in a narrow artery with asymmetric stenos is in the presence of external magnetic field, treating blood as Herschel-Bulkey fluid model. Finite difference scheme is applied to solve the resulting system of nonlinear partial differential equations with appropriate initial and boundary conditions. The finite difference schemes for the velocity distribution, skin friction, flow rate and longitudinal impedance to flow are obtained. It is found that the velocity decreases with the increase of the magnetic field and pressure gradient reverse behavior is noticed when the yield stress and depth of the stenos is increase. It is also observed that the flow rate decreases with the increase of the stenos is shape parameter, power law index and yield stress. Also, it is noted that the presence of external magnetic field influences the mean velocity by increasing its magnitude significantly in arteries of different radii.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114780337","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}
Self-assembly is a process in which simple objects autonomously combine themselves into larger objects. It is considered as a promising technique in nano-technology. Two simple graphs G1 and G2 with a clique of same size overlap and a new self-assembled graph is formed. Besides studying the properties of self assembled graphs on cliques, we answer the question: Can a given set of graphs be generated through the self-assembly of cliques? If so, how to find the generator that could generate the given set of graphs by the process of clique-self-assembly. The question of the existence of minimal generator is also discussed. The necessary and sufficient condition for a graph H to be obtained by the iterated clique-self-assembly of the graph G is also answered. We also conclude that the problem of finding the generator is decidable. We note the importance of our work with respect to several closely related clique finding problem.
{"title":"Clique-Detection Algorithm Using Clique-Self-Assembly","authors":"R. Rama, Suresh Badarla, K. Krithivasan","doi":"10.1109/BIC-TA.2011.32","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.32","url":null,"abstract":"Self-assembly is a process in which simple objects autonomously combine themselves into larger objects. It is considered as a promising technique in nano-technology. Two simple graphs G1 and G2 with a clique of same size overlap and a new self-assembled graph is formed. Besides studying the properties of self assembled graphs on cliques, we answer the question: Can a given set of graphs be generated through the self-assembly of cliques? If so, how to find the generator that could generate the given set of graphs by the process of clique-self-assembly. The question of the existence of minimal generator is also discussed. The necessary and sufficient condition for a graph H to be obtained by the iterated clique-self-assembly of the graph G is also answered. We also conclude that the problem of finding the generator is decidable. We note the importance of our work with respect to several closely related clique finding problem.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116840498","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}
Sindhu J. Kumaar, P. Abisha, Durairaj Gnanaraj Thomas
Dassow, Paun and Salomaa (1993) defined a generative device called pattern grammar. Abisha, Subramanian and Thomas (2000) introduced a new type of grammar called Pure Pattern grammar, in which they examined parallel communicating grammar systems with all components different from the master being pure pattern grammar. Dersanambika, Krithivasan and Subramanian (2004) introduced a new type of grammar system called simple splicing grammar system (SSGS) in which four types of splicing rules namely, and are discussed. In this paper we consider simple splicing rules in parallel communicating pure pattern grammar and pattern grammar systems. In these grammar systems the master component is regular or context free and the other component is pattern or pure pattern grammar. We also have discussed here a system with only pattern grammars.
{"title":"Simple Splicing Pattern and Pure Pattern Grammar Systems","authors":"Sindhu J. Kumaar, P. Abisha, Durairaj Gnanaraj Thomas","doi":"10.1109/BIC-TA.2011.31","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.31","url":null,"abstract":"Dassow, Paun and Salomaa (1993) defined a generative device called pattern grammar. Abisha, Subramanian and Thomas (2000) introduced a new type of grammar called Pure Pattern grammar, in which they examined parallel communicating grammar systems with all components different from the master being pure pattern grammar. Dersanambika, Krithivasan and Subramanian (2004) introduced a new type of grammar system called simple splicing grammar system (SSGS) in which four types of splicing rules namely, and are discussed. In this paper we consider simple splicing rules in parallel communicating pure pattern grammar and pattern grammar systems. In these grammar systems the master component is regular or context free and the other component is pattern or pure pattern grammar. We also have discussed here a system with only pattern grammars.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130982556","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 formal language theory of two-dimensions, 2D picture grammars are powerful tools to generate picture languages. In this work, we incorporate the idea of membrane systems (also called P systems) into 2D picture grammars, thus introducing a new kind of picture language generating devices, named P systems with 2D picture grammars. Inspired by the structure and functioning of living cells, such a system has a hierarchical membrane structure, symbol array objects and evolution rules of 2D picture grammars. In each region delimited by the membrane structure, array objects can evolve in a parallel manner according to evolution rules present in the region, like the way biochemical objects evolve in living cells or organisms. The computational result of P system with 2D picture grammars is the set of pictures (rectangular arrays) present in a specific output membrane when the system halts. We obtain several comparison results, which show that with the membrane structure, the generating power of Siromoney matrix grammar, 2D context-free grammar and basic puzzle grammar can be enlarged.
{"title":"P Systems with 2D Picture Grammars","authors":"Tao Song, Xiangxiang Zeng","doi":"10.1109/BIC-TA.2011.41","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.41","url":null,"abstract":"In formal language theory of two-dimensions, 2D picture grammars are powerful tools to generate picture languages. In this work, we incorporate the idea of membrane systems (also called P systems) into 2D picture grammars, thus introducing a new kind of picture language generating devices, named P systems with 2D picture grammars. Inspired by the structure and functioning of living cells, such a system has a hierarchical membrane structure, symbol array objects and evolution rules of 2D picture grammars. In each region delimited by the membrane structure, array objects can evolve in a parallel manner according to evolution rules present in the region, like the way biochemical objects evolve in living cells or organisms. The computational result of P system with 2D picture grammars is the set of pictures (rectangular arrays) present in a specific output membrane when the system halts. We obtain several comparison results, which show that with the membrane structure, the generating power of Siromoney matrix grammar, 2D context-free grammar and basic puzzle grammar can be enlarged.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114127444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The maximum independent set problem is a classic combinational optimization problem. Recently, algorithmic tile self-assembly is considered as a promising technique in nanotechnology. In this work, we show how the tile self-assembly process is used to implement the maximum independent set problem including three small systems: nondeterministic guess system, AND operation system and comparing system. Our method can be successfully performed this problem in ¦¨(mn) steps parallely and at very low cost, here n and m is the number of vertices and edges of the given graph.
{"title":"Implementation of Maximum Independent Set Problem by Algorithmic Tile Self-Assembly","authors":"Zhen Cheng, Jian-hua Xiao","doi":"10.1109/BIC-TA.2011.36","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.36","url":null,"abstract":"The maximum independent set problem is a classic combinational optimization problem. Recently, algorithmic tile self-assembly is considered as a promising technique in nanotechnology. In this work, we show how the tile self-assembly process is used to implement the maximum independent set problem including three small systems: nondeterministic guess system, AND operation system and comparing system. Our method can be successfully performed this problem in ¦¨(mn) steps parallely and at very low cost, here n and m is the number of vertices and edges of the given graph.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127779876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The implementation of Artificial Intelligence (AI)in 3-Dimensional (3D) First Person Shooter (FPS) game is quite general nowadays. Most of the conventional AI bots created are mostly from hard coded AI bots. Hence, it has limited the dynamicity of the AI bots and therefore it brings to a fixed strategy for gaming. The main focus of this paper is to discuss the methodologies used in generating the AI bots that is competitive in the FPS gaming. In this paper, a decision making structure is proposed. It has been combined with the Evolutionary Programming in generating the required AI controllers. Hence, there are two methodology discussions involved: (1) the proposed decision making structure and (2)the Evolutionary Programming used. The experiments show highly promising testing results after the generated AI bots have been tested and compared with the conventional ruled based AI bots. It proves that the generated AI bots using the combination of Evolutionary Programming and decision making structure performed better than those AI bots generated using conventional ruled based strategy which is hard coded and time consuming to develop.
{"title":"The Evolution of Gamebots for 3D First Person Shooter (FPS)","authors":"Chang Kee Tong, Ong Jia Hui, J. Teo, C. K. On","doi":"10.1109/BIC-TA.2011.71","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.71","url":null,"abstract":"The implementation of Artificial Intelligence (AI)in 3-Dimensional (3D) First Person Shooter (FPS) game is quite general nowadays. Most of the conventional AI bots created are mostly from hard coded AI bots. Hence, it has limited the dynamicity of the AI bots and therefore it brings to a fixed strategy for gaming. The main focus of this paper is to discuss the methodologies used in generating the AI bots that is competitive in the FPS gaming. In this paper, a decision making structure is proposed. It has been combined with the Evolutionary Programming in generating the required AI controllers. Hence, there are two methodology discussions involved: (1) the proposed decision making structure and (2)the Evolutionary Programming used. The experiments show highly promising testing results after the generated AI bots have been tested and compared with the conventional ruled based AI bots. It proves that the generated AI bots using the combination of Evolutionary Programming and decision making structure performed better than those AI bots generated using conventional ruled based strategy which is hard coded and time consuming to develop.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132351894","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}
A. Widodo, D. Satrijo, Muhammad Huda, Gang-Min Lim, Bo-Suk Yang
This paper concerns with implementation of self organizing map (SOM) for intelligent machine fault diagnostics. The present study employs infrared images acquired by thermography camera as data base of machine diagnostics system. Image processing is carried out using thresholding for image segmentation and clustering by means of k-means algorithm. Feature extraction of images is conducted by calculating area, perimeter and central moment of region of interest (ROI). All data of this work was acquired by capturing the images of rolling element bearings from rotating machine fault simulator (MFS). The simulator is able to experiment a normal and seeded fault conditions such as outer and inner race defects of rolling element bearing, unbalance, misalignment and looseness. Pattern recognition technique is then employed to diagnose the machine conditions by mapping the image features through SOM. The result shows that SOM based infrared thermography image can perform intelligent machine fault diagnostics with plausible accuracy.
{"title":"Application of Self Organizing Map for Intelligent Machine Fault Diagnostics Based on Infrared Thermography Images","authors":"A. Widodo, D. Satrijo, Muhammad Huda, Gang-Min Lim, Bo-Suk Yang","doi":"10.1109/BIC-TA.2011.15","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.15","url":null,"abstract":"This paper concerns with implementation of self organizing map (SOM) for intelligent machine fault diagnostics. The present study employs infrared images acquired by thermography camera as data base of machine diagnostics system. Image processing is carried out using thresholding for image segmentation and clustering by means of k-means algorithm. Feature extraction of images is conducted by calculating area, perimeter and central moment of region of interest (ROI). All data of this work was acquired by capturing the images of rolling element bearings from rotating machine fault simulator (MFS). The simulator is able to experiment a normal and seeded fault conditions such as outer and inner race defects of rolling element bearing, unbalance, misalignment and looseness. Pattern recognition technique is then employed to diagnose the machine conditions by mapping the image features through SOM. The result shows that SOM based infrared thermography image can perform intelligent machine fault diagnostics with plausible accuracy.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133373293","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}
By the introduction of the notion of splicing system by Head in 1987, a new approach for bio-inspired problems was made. This mathematical model helps to interpret the behavior of restriction enzymes on DNA molecules when they are cut and pasted. The theoretical skeleton of this model was based on formal language theory. Several types of splicing systems have been defined by different mathematicians. One of those is the persistent splicing system in which the property of being crossing of a site is preserved. In this paper, we introduced two new concepts, namely self-closed and crossing-preserved splicing patterns. The connection of these concepts with the persistent splicing systems is investigated. Some examples are provided to illustrate the relations.
{"title":"Crossing-Preserved and Persistent Splicing Systems","authors":"F. Karimi, N. Sarmin, W. Fong","doi":"10.1109/BIC-TA.2011.23","DOIUrl":"https://doi.org/10.1109/BIC-TA.2011.23","url":null,"abstract":"By the introduction of the notion of splicing system by Head in 1987, a new approach for bio-inspired problems was made. This mathematical model helps to interpret the behavior of restriction enzymes on DNA molecules when they are cut and pasted. The theoretical skeleton of this model was based on formal language theory. Several types of splicing systems have been defined by different mathematicians. One of those is the persistent splicing system in which the property of being crossing of a site is preserved. In this paper, we introduced two new concepts, namely self-closed and crossing-preserved splicing patterns. The connection of these concepts with the persistent splicing systems is investigated. Some examples are provided to illustrate the relations.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133873829","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
扫码关注我们
求助内容：
应助结果提醒方式：