Pub Date : 2017-07-27DOI: 10.1109/CWIT.2017.7994829
Mayank Amencherla, L. Varshney
Social media platforms provide rich signal sets to understand the nature of social life, and sentiment analysis techniques have been developed to understand the emotional content of text from sites like Twitter and Facebook. Beyond text however, most social media platforms have images at their core, and communication of images may require quantization. Here, we develop methods and present results on understanding the association between the visual content features of images on the popular social media platform Instagram and the psycholinguistic sentiment of their hashtag descriptors. In particular, we collect several thousand images and analyze several aspects of color to predict image sentiment. These results affirm and clarify several psychological theories on the relationship between color and mood/emotion, such as colorfulness being associated with happiness. The data-driven psychovisual insights into sentiment developed herein can be used to define novel fidelity criteria for designing color quantization schemes.
{"title":"Color-based visual sentiment for social communication","authors":"Mayank Amencherla, L. Varshney","doi":"10.1109/CWIT.2017.7994829","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994829","url":null,"abstract":"Social media platforms provide rich signal sets to understand the nature of social life, and sentiment analysis techniques have been developed to understand the emotional content of text from sites like Twitter and Facebook. Beyond text however, most social media platforms have images at their core, and communication of images may require quantization. Here, we develop methods and present results on understanding the association between the visual content features of images on the popular social media platform Instagram and the psycholinguistic sentiment of their hashtag descriptors. In particular, we collect several thousand images and analyze several aspects of color to predict image sentiment. These results affirm and clarify several psychological theories on the relationship between color and mood/emotion, such as colorfulness being associated with happiness. The data-driven psychovisual insights into sentiment developed herein can be used to define novel fidelity criteria for designing color quantization schemes.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"39 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121281158","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 : 2017-06-11DOI: 10.1109/CWIT.2017.7994832
Linchen Wang, A. Eckford
Code division multiple access (CDMA) is a widelyused multiple-access scheme in conventional communication systems. In this paper, we consider code division multiple access in molecular communication: since molecular communication has a non-negativity constraint, we consider a nonnegative variant of CDMA that was developed for optical communication. Our results include an information transmission scheme, and an algorithm to decode molecular information signals. We also analyze the system based on realistic propagation models obtained from experimental apparatus. Finally, we demonstrate reliable communication with multiple access by using this scheme.
{"title":"Nonnegative code division multiple access techniques in molecular communication","authors":"Linchen Wang, A. Eckford","doi":"10.1109/CWIT.2017.7994832","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994832","url":null,"abstract":"Code division multiple access (CDMA) is a widelyused multiple-access scheme in conventional communication systems. In this paper, we consider code division multiple access in molecular communication: since molecular communication has a non-negativity constraint, we consider a nonnegative variant of CDMA that was developed for optical communication. Our results include an information transmission scheme, and an algorithm to decode molecular information signals. We also analyze the system based on realistic propagation models obtained from experimental apparatus. Finally, we demonstrate reliable communication with multiple access by using this scheme.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114244173","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 : 2017-06-11DOI: 10.1109/CWIT.2017.7994817
Hassan Hamad, G. Kraidy
This paper investigates the performance of convolutional codes with quadrature amplitude modulation transmitted over the Bernoulli-Gaussian impulsive noise channel. First, the performance superiority of blanking over clipping of the symbols affected by noise pulses is proved through the computation of a lower bound on the bit error rate. Next, lower and upper bounds on the bit error rate performance are derived. Finally, bit error rate curves based on Monte Carlo simulations are shown together with the proposed bounds.
{"title":"Performance analysis of convolutional codes over the Bernoulli-Gaussian impulsive noise channel","authors":"Hassan Hamad, G. Kraidy","doi":"10.1109/CWIT.2017.7994817","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994817","url":null,"abstract":"This paper investigates the performance of convolutional codes with quadrature amplitude modulation transmitted over the Bernoulli-Gaussian impulsive noise channel. First, the performance superiority of blanking over clipping of the symbols affected by noise pulses is proved through the computation of a lower bound on the bit error rate. Next, lower and upper bounds on the bit error rate performance are derived. Finally, bit error rate curves based on Monte Carlo simulations are shown together with the proposed bounds.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133508082","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 : 2017-06-11DOI: 10.1109/CWIT.2017.7994818
Toritseju Okpotse, S. Yousefi
We focus on the design of an encoded symbol degree distribution for Systematic Rateless Codes to be used for achieving fault tolerance in distributed storage systems. Major performance metrics for distributed storage codes are low repair locality, low encoding/decoding complexity and systematic encoding. In this work, we first evaluate the role of different encoded symbol degrees in ensuring low decoding overhead and low edge complexity. Then we propose the Truncated Poisson Distribution (TPD) to satisfy most of the identified distribution characteristics. To improve the overall symbol connectivity and hence achieve better decoding performance, we suggest a degree supplement to the TPD. The simulation results show that the proposed degree distribution achieves improved decoding performance when compared to using the well-known Robust Soliton Distribution (RSD) for generating encoded symbols in a systematic encoding scenario.
{"title":"Truncated poisson distribution for encoding of systematic rateless codes in massive distributed storage systems","authors":"Toritseju Okpotse, S. Yousefi","doi":"10.1109/CWIT.2017.7994818","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994818","url":null,"abstract":"We focus on the design of an encoded symbol degree distribution for Systematic Rateless Codes to be used for achieving fault tolerance in distributed storage systems. Major performance metrics for distributed storage codes are low repair locality, low encoding/decoding complexity and systematic encoding. In this work, we first evaluate the role of different encoded symbol degrees in ensuring low decoding overhead and low edge complexity. Then we propose the Truncated Poisson Distribution (TPD) to satisfy most of the identified distribution characteristics. To improve the overall symbol connectivity and hence achieve better decoding performance, we suggest a degree supplement to the TPD. The simulation results show that the proposed degree distribution achieves improved decoding performance when compared to using the well-known Robust Soliton Distribution (RSD) for generating encoded symbols in a systematic encoding scenario.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127578384","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 : 2017-06-11DOI: 10.1109/CWIT.2017.7994813
Hao Li, Yunlong Cai, B. Champagne
In this paper, we investigate the physical-layer network coding (PNC) scheme based on successive interference cancellation (SIC) in multi-way relay channels (MWRC). We consider a scenario where all users simultaneously transmit signals to the relay in the up-link stage while the relay broadcasts a coded message in the down-link stage. In order to extract the network codes from superimposed signals and guarantee a low decoding complexity, we propose a novel SIC scheme at the relay node to iteratively estimate the signals from all users. A Max-Min strategy is introduced as an optimal solution to power allocation among users to ensure accurate estimation in the SIC process. In addition, to further improve the system performance, an optimal strategy that decides the coding rule is developed by considering the error probability of the SIC process. Simulation results demonstrate the performance improvement of the proposed SIC aided PNC technique when used in conjunction with the optimal power allocation and coding rule in multi-way relay channels.
{"title":"SIC aided physical-layer network coding for multi-way relay channels","authors":"Hao Li, Yunlong Cai, B. Champagne","doi":"10.1109/CWIT.2017.7994813","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994813","url":null,"abstract":"In this paper, we investigate the physical-layer network coding (PNC) scheme based on successive interference cancellation (SIC) in multi-way relay channels (MWRC). We consider a scenario where all users simultaneously transmit signals to the relay in the up-link stage while the relay broadcasts a coded message in the down-link stage. In order to extract the network codes from superimposed signals and guarantee a low decoding complexity, we propose a novel SIC scheme at the relay node to iteratively estimate the signals from all users. A Max-Min strategy is introduced as an optimal solution to power allocation among users to ensure accurate estimation in the SIC process. In addition, to further improve the system performance, an optimal strategy that decides the coding rule is developed by considering the error probability of the SIC process. Simulation results demonstrate the performance improvement of the proposed SIC aided PNC technique when used in conjunction with the optimal power allocation and coding rule in multi-way relay channels.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127658937","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994836
M. Ammari, P. Fortier
This paper presents a performance analysis of adaptive modulation (AM) schemes in multiple-input multiple-output (MIMO) orthogonal space-time block code (OSTBC) systems over Nakagami-M keyhole channels. We consider a constantpower variable discrete-rate AM strategy and assume that the maximum ratio combining (MRC) technique is used at the receiver. Analytical expressions for the average spectral efficiency (SE), the bit error rate (BER), and the outage probability (OP), are derived and compared to the Monte Carlo (MC) simulation results. Numerical results illustrate the impact of the keyhole on the AM scheme performance and show a good agreement between the theoretical analysis and the MC simulations.
{"title":"Adaptive modulation analysis in MIMO-OSTBC systems over nakagami-M keyhole channels","authors":"M. Ammari, P. Fortier","doi":"10.1109/CWIT.2017.7994836","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994836","url":null,"abstract":"This paper presents a performance analysis of adaptive modulation (AM) schemes in multiple-input multiple-output (MIMO) orthogonal space-time block code (OSTBC) systems over Nakagami-M keyhole channels. We consider a constantpower variable discrete-rate AM strategy and assume that the maximum ratio combining (MRC) technique is used at the receiver. Analytical expressions for the average spectral efficiency (SE), the bit error rate (BER), and the outage probability (OP), are derived and compared to the Monte Carlo (MC) simulation results. Numerical results illustrate the impact of the keyhole on the AM scheme performance and show a good agreement between the theoretical analysis and the MC simulations.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114259416","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994830
P. Yahampath
Robust linear analog block coding of a correlated Gaussian source over a Rayleigh fading channel, without encoderside channel-state information (CSI) is investigated. The encoder which minimizes the minimum mean square error, averaged over an ensemble of decoders whose channel gains are drawn from an exponential distribution is derived. This encoder does not require CSI. It is compared with a CSI-adaptive, separate sourcechannel coding system based on transform source coding, as well as, with a non-adaptive vector quantization-based hybrid digital-analog (HDA) system optimized to the decoder ensemble. Numerical results show that optimal linear analog block coding system substantially outperforms the HDA system as the source correlation and channel-noise correlation increases.
{"title":"On linear analog coding of sources with memory over fading and broadcast channels with correlated noise","authors":"P. Yahampath","doi":"10.1109/CWIT.2017.7994830","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994830","url":null,"abstract":"Robust linear analog block coding of a correlated Gaussian source over a Rayleigh fading channel, without encoderside channel-state information (CSI) is investigated. The encoder which minimizes the minimum mean square error, averaged over an ensemble of decoders whose channel gains are drawn from an exponential distribution is derived. This encoder does not require CSI. It is compared with a CSI-adaptive, separate sourcechannel coding system based on transform source coding, as well as, with a non-adaptive vector quantization-based hybrid digital-analog (HDA) system optimized to the decoder ensemble. Numerical results show that optimal linear analog block coding system substantially outperforms the HDA system as the source correlation and channel-noise correlation increases.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133639769","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994827
Nicolò Michelusi
Microbial communities regulate various collective functions using a system of cell-cell communication known as quorum sensing. Quorum sensing allows bacteria to estimate the density of their local population, and coordinate gene expression accordingly. Understanding and modeling of quorum sensing regulation can pave the way to the design of nano-networks and, in particular, of communication and coordination schemes among large numbers of nano-machines that need to perform collective decisions based on their local density. In this paper, the performance of population density estimation via quorum sensing is investigated. The distribution of local autoinducers within each cell is derived in closed form, for an asymptotic scenario of large cell population. Based on it, the maximum likelihood estimator is derived, and is compared numerically to a low-complexity estimator. It is shown that the mean squared error of the low-complexity estimator closely approaches that of the maximum-likelihood estimator, and is thus suitable in computationally constrained nano-machines.
{"title":"On population density estimation via quorum sensing","authors":"Nicolò Michelusi","doi":"10.1109/CWIT.2017.7994827","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994827","url":null,"abstract":"Microbial communities regulate various collective functions using a system of cell-cell communication known as quorum sensing. Quorum sensing allows bacteria to estimate the density of their local population, and coordinate gene expression accordingly. Understanding and modeling of quorum sensing regulation can pave the way to the design of nano-networks and, in particular, of communication and coordination schemes among large numbers of nano-machines that need to perform collective decisions based on their local density. In this paper, the performance of population density estimation via quorum sensing is investigated. The distribution of local autoinducers within each cell is derived in closed form, for an asymptotic scenario of large cell population. Based on it, the maximum likelihood estimator is derived, and is compared numerically to a low-complexity estimator. It is shown that the mean squared error of the low-complexity estimator closely approaches that of the maximum-likelihood estimator, and is thus suitable in computationally constrained nano-machines.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133016476","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994833
Jun Yan, Bingcheng Zhu, Genfa Zhang, Julian Cheng
Optimal node placement is studied for multi-hop free-space optical communications where any node can be a user. The lognormal weak turbulence channel is assumed. First, the problem of node placement is formulated as a constrained multi-objective optimization problem. Then, according to the priority of each user, the multi-objective problem is simplified to a constrained single-objective problem where the objective function is the sum of the weighted outage probabilities of all the users. Iteration is applied to obtain the optimal node placement solution. More importantly, as a generalization of prior results, we deduce that the optimal node placement in high signal-to-noise ratio scenario is irrelevant to the number of users or the priority of users. Simulation results agree with the proposed analytical results.
{"title":"Optimal user node placement for multi-hop FSO broadcasting communications under weak turbulence conditions","authors":"Jun Yan, Bingcheng Zhu, Genfa Zhang, Julian Cheng","doi":"10.1109/CWIT.2017.7994833","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994833","url":null,"abstract":"Optimal node placement is studied for multi-hop free-space optical communications where any node can be a user. The lognormal weak turbulence channel is assumed. First, the problem of node placement is formulated as a constrained multi-objective optimization problem. Then, according to the priority of each user, the multi-objective problem is simplified to a constrained single-objective problem where the objective function is the sum of the weighted outage probabilities of all the users. Iteration is applied to obtain the optimal node placement solution. More importantly, as a generalization of prior results, we deduce that the optimal node placement in high signal-to-noise ratio scenario is irrelevant to the number of users or the priority of users. Simulation results agree with the proposed analytical results.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123240834","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994828
Simon Brodeur, J. Rouat
Hierarchical approaches for representation learning have the ability to encode relevant features at multiple scales or levels of abstraction. However, most hierarchical approaches exploit only the last level in the hierarchy, or provide a multiscale representation that holds a significant amount of redundancy. We argue that removing redundancy across the multiple levels of abstraction is important for an efficient representation of compositionality in object-based representations. With the perspective of feature learning as a data compression operation, we propose a new greedy inference algorithm for hierarchical sparse coding. Convolutional matching pursuit with a L0-norm constraint was used to encode the input signal into compact and non-redundant codes distributed across levels of the hierarchy. Simple and complex synthetic datasets of temporal signals were created to evaluate the encoding efficiency and compare with the theoretical lower bounds on the information rate for those signals. Empirical evidence have shown that the algorithm is able to infer near-optimal codes for simple signals. However, it failed for complex signals with strong overlapping between objects. We explain the inefficiency of convolutional matching pursuit that occurred in such case. This brings new insights about the NP-hard optimization problem related to using L0-norm constraint in inferring optimally compact and distributed object-based representations.
{"title":"Optimality of inference in hierarchical coding for distributed object-based representations","authors":"Simon Brodeur, J. Rouat","doi":"10.1109/CWIT.2017.7994828","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994828","url":null,"abstract":"Hierarchical approaches for representation learning have the ability to encode relevant features at multiple scales or levels of abstraction. However, most hierarchical approaches exploit only the last level in the hierarchy, or provide a multiscale representation that holds a significant amount of redundancy. We argue that removing redundancy across the multiple levels of abstraction is important for an efficient representation of compositionality in object-based representations. With the perspective of feature learning as a data compression operation, we propose a new greedy inference algorithm for hierarchical sparse coding. Convolutional matching pursuit with a L0-norm constraint was used to encode the input signal into compact and non-redundant codes distributed across levels of the hierarchy. Simple and complex synthetic datasets of temporal signals were created to evaluate the encoding efficiency and compare with the theoretical lower bounds on the information rate for those signals. Empirical evidence have shown that the algorithm is able to infer near-optimal codes for simple signals. However, it failed for complex signals with strong overlapping between objects. We explain the inefficiency of convolutional matching pursuit that occurred in such case. This brings new insights about the NP-hard optimization problem related to using L0-norm constraint in inferring optimally compact and distributed object-based representations.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133285035","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
扫码关注我们
求助内容：
应助结果提醒方式：