Based on three OpenMP program models, the technology of parallel region reconstruction is mainly discussed to implement the improved loop level OpenMP program. Parallel region reconstruction is to expand and merge parallel regions. When reconstructing parallel regions, there are two things should be noted, that is to keep data attribute and data dependence before and after optimization. Experimental results of PPOPP show that after parallel region reconstruction, the improvement of lu1k is maximally up to 28.1%, and the improvement of erle64 is the lowest about 1.87%. The reason of lu1k's highest improvement is that a parallel region is expanded outside a loop of 1024 iterations, which reduce 1023 times of the parallel region creation. The experimental results indicate the technology of parallel region reconstruction reduces the creation of parallel region, and improves the performance of the OpenMP program.
{"title":"Implement Improved Loop Level OpenMP Program Based on Parallel Region Reconstruction","authors":"Shi'an Hu, Aixian Dong, Hongtu Ma","doi":"10.1109/SNPD.2012.24","DOIUrl":"https://doi.org/10.1109/SNPD.2012.24","url":null,"abstract":"Based on three OpenMP program models, the technology of parallel region reconstruction is mainly discussed to implement the improved loop level OpenMP program. Parallel region reconstruction is to expand and merge parallel regions. When reconstructing parallel regions, there are two things should be noted, that is to keep data attribute and data dependence before and after optimization. Experimental results of PPOPP show that after parallel region reconstruction, the improvement of lu1k is maximally up to 28.1%, and the improvement of erle64 is the lowest about 1.87%. The reason of lu1k's highest improvement is that a parallel region is expanded outside a loop of 1024 iterations, which reduce 1023 times of the parallel region creation. The experimental results indicate the technology of parallel region reconstruction reduces the creation of parallel region, and improves the performance of the OpenMP program.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126796617","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}
S. Nakano, A. Inoue, K. Otsuka, T. Kurosawa, M. Iwashita, K. Nishimatsu
The Japanese mobile phone market is in the matured stage. Under competitive conditions, the most important objective of a mobile-carrier is to increase the market share. The aim of this research is to understand mobile-carrier choice behavior under assumed market conditions. We propose the binary choice models of which alternatives are change to other carrier or not. Three models are constructed based on survey data for three mobile-carriers: NTT docomo, au by KDDI, and Soft Bank. Each model has eight factors expressed by the satisfaction levels for mobile-service characteristics. It is shown that important decision-making factors vary from carrier to carrier. It implies that a mobile carrier should keep and improve the satisfaction level of the important factors in order to increase the market share.
日本手机市场正处于成熟阶段。在竞争条件下，移动运营商最重要的目标是增加市场份额。本研究的目的是了解假定市场条件下的移动运营商选择行为。提出了备选方案是否更换其他载体的二元选择模型。基于NTT docomo、au by KDDI和softbank三家移动运营商的调查数据，构建了三个模型。每个模型有8个因素，用对移动服务特征的满意程度来表示。研究表明，不同载体的重要决策因素是不同的。这意味着移动运营商要想增加市场份额，就必须保持和提高重要因素的满意度。
{"title":"Mobile-Carrier Churning Behavior Modeling Based on Customer Satisfaction","authors":"S. Nakano, A. Inoue, K. Otsuka, T. Kurosawa, M. Iwashita, K. Nishimatsu","doi":"10.1109/SNPD.2012.70","DOIUrl":"https://doi.org/10.1109/SNPD.2012.70","url":null,"abstract":"The Japanese mobile phone market is in the matured stage. Under competitive conditions, the most important objective of a mobile-carrier is to increase the market share. The aim of this research is to understand mobile-carrier choice behavior under assumed market conditions. We propose the binary choice models of which alternatives are change to other carrier or not. Three models are constructed based on survey data for three mobile-carriers: NTT docomo, au by KDDI, and Soft Bank. Each model has eight factors expressed by the satisfaction levels for mobile-service characteristics. It is shown that important decision-making factors vary from carrier to carrier. It implies that a mobile carrier should keep and improve the satisfaction level of the important factors in order to increase the market share.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122644187","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}
Data request task scheduling is one of the important issues for P2P VoD systems. However the existing data scheduling strategies in P2P VoD system is not fair enough. They make many nodes, which upload data actively, bear very heavy load, while those selfish nodes providing no resource sit idle. This paper presents an admission control strategy on serving nodes combining with the incentive mechanism. The serving peers respond the requesting peers that contribute more data to systems with priority and reject some requests which can not be processed in time. The experiments show that this strategy improves the performance of the system and decreases the users' wait time for watching.
{"title":"Admission Control Strategy of Serving Peers in P2P VoD Systems","authors":"Yanqin Zhu, Jianjun Bian, Qijin Ji, Haojun Zhang","doi":"10.1109/SNPD.2012.95","DOIUrl":"https://doi.org/10.1109/SNPD.2012.95","url":null,"abstract":"Data request task scheduling is one of the important issues for P2P VoD systems. However the existing data scheduling strategies in P2P VoD system is not fair enough. They make many nodes, which upload data actively, bear very heavy load, while those selfish nodes providing no resource sit idle. This paper presents an admission control strategy on serving nodes combining with the incentive mechanism. The serving peers respond the requesting peers that contribute more data to systems with priority and reject some requests which can not be processed in time. The experiments show that this strategy improves the performance of the system and decreases the users' wait time for watching.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127684193","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}
We digitally archived festival music signals (“Ohayashi”) in the Yamahoko parades of Gion festival in Kyoto, Japan. Besides, the festival music, which consists of Japanese traditional drums, flutes, bells, ambient noise and in-float driving noise are needed to reproduce the authentic atmosphere of this festival. To reproduce a high-quality sound field, we recorded the festival music in the presence of ambient noise and float noise by using multi-channel recording. We reproduced the sound field of one of the parades with the recorded sound sources. We employed point-source loudspeakers for reproducing Japanese traditional drums, flutes, and bells with omni-directional radiation characteristics. After that, we built a web-based system linked to a map of the parade route that would produce an acoustic sound field with realistic sensations at different points along the route. This system reproduces the Ohayashi at particular positions along the route when the user clicks circular buttons on the map.
{"title":"Digital Archive for Japanese Intangible Cultural Heritage Based on Reproduction of High-Fidelity Sound Field in Yamahoko Parade of Gion Festival","authors":"Takahiro Fukumori, T. Nishiura, Y. Yamashita","doi":"10.1109/SNPD.2012.105","DOIUrl":"https://doi.org/10.1109/SNPD.2012.105","url":null,"abstract":"We digitally archived festival music signals (“Ohayashi”) in the Yamahoko parades of Gion festival in Kyoto, Japan. Besides, the festival music, which consists of Japanese traditional drums, flutes, bells, ambient noise and in-float driving noise are needed to reproduce the authentic atmosphere of this festival. To reproduce a high-quality sound field, we recorded the festival music in the presence of ambient noise and float noise by using multi-channel recording. We reproduced the sound field of one of the parades with the recorded sound sources. We employed point-source loudspeakers for reproducing Japanese traditional drums, flutes, and bells with omni-directional radiation characteristics. After that, we built a web-based system linked to a map of the parade route that would produce an acoustic sound field with realistic sensations at different points along the route. This system reproduces the Ohayashi at particular positions along the route when the user clicks circular buttons on the map.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134124270","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}
Ryohei Azuma, T. Hochin, Hiroki Nomiya, H. Nakanishi, M. Kojima
This paper uses Postgre SQL, a database management system, in the data management of the similarity retrieval of subsequences of waveforms. By using Postgre SQL, the management of data could become easy, and a multi-dimensional index structure named the R tree could be used. This paper examines the parallel processing of the similarity retrieval by dividing a table into several tables. It is shown that high retrieval performance can easily be obtained by using a high performance computer. It is shown that using Postgre SQL could make the division of a table easy because R tree indexes are automatically constructed.
{"title":"Towards Parallel Processing of Similarity Retrieval System of Time Series","authors":"Ryohei Azuma, T. Hochin, Hiroki Nomiya, H. Nakanishi, M. Kojima","doi":"10.1109/SNPD.2012.86","DOIUrl":"https://doi.org/10.1109/SNPD.2012.86","url":null,"abstract":"This paper uses Postgre SQL, a database management system, in the data management of the similarity retrieval of subsequences of waveforms. By using Postgre SQL, the management of data could become easy, and a multi-dimensional index structure named the R tree could be used. This paper examines the parallel processing of the similarity retrieval by dividing a table into several tables. It is shown that high retrieval performance can easily be obtained by using a high performance computer. It is shown that using Postgre SQL could make the division of a table easy because R tree indexes are automatically constructed.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134092686","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 paper outlines a method for modelling largescale commercial, social, socio-technological and engineering problems. The method is derived from twelve years of experience in designing and implementing large complex systems for real-time scheduling of taxis, air taxis, car rentals, seagoing tankers, trucks, space crafts; dynamic data mining; dynamic knowledge discovery and semantic search. The same approach has been also used for designing adaptive engineering systems and for research into social issues such as eradication of poverty.
{"title":"Modelling Large Complex Systems Using Multi-agent Technology","authors":"G. Rzevski","doi":"10.1109/SNPD.2012.138","DOIUrl":"https://doi.org/10.1109/SNPD.2012.138","url":null,"abstract":"The paper outlines a method for modelling largescale commercial, social, socio-technological and engineering problems. The method is derived from twelve years of experience in designing and implementing large complex systems for real-time scheduling of taxis, air taxis, car rentals, seagoing tankers, trucks, space crafts; dynamic data mining; dynamic knowledge discovery and semantic search. The same approach has been also used for designing adaptive engineering systems and for research into social issues such as eradication of poverty.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132882367","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 feedback Group Method of Data Handling (GMDH) -type neural network algorithm is applied to the medical image diagnosis of lung cancer. In this feedback GMDH-type neural network algorithm, the structural parameters such as the number of feedback loops, the number of neurons in the hidden layers and the relevant input variables are automatically selected so as to minimize the prediction error criterion defined as Akaike's Information Criterion (AIC) or Prediction Sum of Squares (PSS). The identification results show that the feedback GMDH-type neural network algorithm is useful for the medical image diagnosis of lung cancer since the optimum neural network architecture is automatically organized so as to fit the complexity of the medical images.
{"title":"Feedback GMDH-type Neural Network Self-Selecting Various Functions and Its Application to Medical Image Diagnosis of Lung Cancer","authors":"T. Kondo, J. Ueno, S. Takao","doi":"10.1109/SNPD.2012.94","DOIUrl":"https://doi.org/10.1109/SNPD.2012.94","url":null,"abstract":"The feedback Group Method of Data Handling (GMDH) -type neural network algorithm is applied to the medical image diagnosis of lung cancer. In this feedback GMDH-type neural network algorithm, the structural parameters such as the number of feedback loops, the number of neurons in the hidden layers and the relevant input variables are automatically selected so as to minimize the prediction error criterion defined as Akaike's Information Criterion (AIC) or Prediction Sum of Squares (PSS). The identification results show that the feedback GMDH-type neural network algorithm is useful for the medical image diagnosis of lung cancer since the optimum neural network architecture is automatically organized so as to fit the complexity of the medical images.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121456090","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}
Interactive Evolutionary Computation (IEC) is well known as an effective method to create media contents suited to user's preference and objectives to use. As one of the methods, we have applied Differential Evolution, which is recent evolutionary algorithm to IEC. Concretely, we have already presented a method that creates sign sounds with Interactive Differential Evolution (IDE). This study aims to investigate fundamentally the efficacy of the IDE method in comparison with Interactive Genetic Algorithm (IGA). Two listening experiments were conducted: experiment 1 as a creation experiment with IDE and IGA, experiment 2 as a re-evaluation experiment. Target of the creation was warning sign sounds. In the experiment 2, representative five sign sounds created in both of IDE and IGA were evaluated. Sixteen males participated as subjects in the experiments. In the result of the experiment 1, IDE overcame IGA in subjective fitness value. Drastic shrink of searching space was observed in IGA, and larger time cost was observed in IDE. In the result of the experiment 2, higher fitness value in average was observed in IDE, however, the difference was not significant.
{"title":"The Efficiency of Interactive Differential Evolution in Creation of Sound Contents: In Comparison with Interactive Genetic Algorithm","authors":"M. Fukumoto, Ryota Yamamoto, Shintarou Ogawa","doi":"10.4018/ijsi.2013040102","DOIUrl":"https://doi.org/10.4018/ijsi.2013040102","url":null,"abstract":"Interactive Evolutionary Computation (IEC) is well known as an effective method to create media contents suited to user's preference and objectives to use. As one of the methods, we have applied Differential Evolution, which is recent evolutionary algorithm to IEC. Concretely, we have already presented a method that creates sign sounds with Interactive Differential Evolution (IDE). This study aims to investigate fundamentally the efficacy of the IDE method in comparison with Interactive Genetic Algorithm (IGA). Two listening experiments were conducted: experiment 1 as a creation experiment with IDE and IGA, experiment 2 as a re-evaluation experiment. Target of the creation was warning sign sounds. In the experiment 2, representative five sign sounds created in both of IDE and IGA were evaluated. Sixteen males participated as subjects in the experiments. In the result of the experiment 1, IDE overcame IGA in subjective fitness value. Drastic shrink of searching space was observed in IGA, and larger time cost was observed in IDE. In the result of the experiment 2, higher fitness value in average was observed in IDE, however, the difference was not significant.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114982633","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}
R. Ayed, Ibrahim Bounhas, Bilel Elayeb, F. Evrard, Narjès Bellamine Ben Saoud
This paper presents a new approach for Arabic non-vocalized texts disambiguation based on a possibilistic classifier. A morphological analyzer provides all the possible solutions and the values of the morphological features of words. When texts are vocalized, the number of solutions is reduced and in many cases, we can identify the correct analysis of the input word. The main idea of this paper is to exploit this type of texts in order to learn contextual dependencies between the different values of morphological features modeled as a possibilistic network. This knowledge is used later to disambiguate non-vocalized texts. In order to evaluate our approach, we perform experiments on a corpus of arabic stories. In this paper, we present results concerning the Part-Of-Speech (POS) which is the main morphological feature. Our results are compared to the SVM-based system called MADA.
{"title":"A Possibilistic Approach for the Automatic Morphological Disambiguation of Arabic Texts","authors":"R. Ayed, Ibrahim Bounhas, Bilel Elayeb, F. Evrard, Narjès Bellamine Ben Saoud","doi":"10.1109/SNPD.2012.21","DOIUrl":"https://doi.org/10.1109/SNPD.2012.21","url":null,"abstract":"This paper presents a new approach for Arabic non-vocalized texts disambiguation based on a possibilistic classifier. A morphological analyzer provides all the possible solutions and the values of the morphological features of words. When texts are vocalized, the number of solutions is reduced and in many cases, we can identify the correct analysis of the input word. The main idea of this paper is to exploit this type of texts in order to learn contextual dependencies between the different values of morphological features modeled as a possibilistic network. This knowledge is used later to disambiguate non-vocalized texts. In order to evaluate our approach, we perform experiments on a corpus of arabic stories. In this paper, we present results concerning the Part-Of-Speech (POS) which is the main morphological feature. Our results are compared to the SVM-based system called MADA.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129295005","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}
Word sense disambiguation (WSD) problem asks to assign a meaning to a word according to a context in which it occurs. Many solutions exist for WSD in natural languages, such as English, but research work on Arabic WSD (AWSD) remains limited. AWSD is a more exigent task because Arabic has an intrinsic complexity in its writing structure and ambiguity, such as syntactic, semantic, and anaphoric ambiguity levels. Genetic algorithms (GAs) can be effective to solve this problem since they have been successfully used for many NP-hard optimization problems. In this paper, we propose a new approach to solve AWSD problem based on a GA. We describe a prototype of AWSD system in which we test the performance of our algorithm by carrying out experiments on Arabic sample text, and compare it with a naïve Bayes classifier for AWSD. We show the benefit of the proposed approach and its advantage over naïve Bayes classifier.
{"title":"Genetic Algorithm for Arabic Word Sense Disambiguation","authors":"M. Menai, Wojdan Alsaeedan","doi":"10.1109/SNPD.2012.38","DOIUrl":"https://doi.org/10.1109/SNPD.2012.38","url":null,"abstract":"Word sense disambiguation (WSD) problem asks to assign a meaning to a word according to a context in which it occurs. Many solutions exist for WSD in natural languages, such as English, but research work on Arabic WSD (AWSD) remains limited. AWSD is a more exigent task because Arabic has an intrinsic complexity in its writing structure and ambiguity, such as syntactic, semantic, and anaphoric ambiguity levels. Genetic algorithms (GAs) can be effective to solve this problem since they have been successfully used for many NP-hard optimization problems. In this paper, we propose a new approach to solve AWSD problem based on a GA. We describe a prototype of AWSD system in which we test the performance of our algorithm by carrying out experiments on Arabic sample text, and compare it with a naïve Bayes classifier for AWSD. We show the benefit of the proposed approach and its advantage over naïve Bayes classifier.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129703396","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
扫码关注我们
求助内容：
应助结果提醒方式：