Pub Date : 2011-05-11DOI: 10.1109/JCSSE.2011.5930089
Suparerk Manitpornsut
It is well known that WLAN based on the IEEE 802.11 standard suffers from interference and scalability problems due to the limited number of non-overlapping channels. In order to mitigate the interference problem, channel assignment algorithms have been a popular research topic in recent years. It has been shown that such algorithms can greatly reduce the interference among wireless access points. However, in this paper we present our findings that traditional channel assignment algorithm can introduce a high hidden node index in high network density, thus greatly reducing the WLAN performance. We show that careful consideration needs to be taken when assigning channels using such algorithms. In addition, we propose a novel algorithm, called Cluster Channel Assignment (CCA), which is presented in the form of a state diagram. From our simulation results, we show that CCA can outperform traditional channel assignment in densely deployed scenarios, and is therefore a better alternative in such settings.
{"title":"Novel radio resource management for high density chaotic wireless LANs","authors":"Suparerk Manitpornsut","doi":"10.1109/JCSSE.2011.5930089","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930089","url":null,"abstract":"It is well known that WLAN based on the IEEE 802.11 standard suffers from interference and scalability problems due to the limited number of non-overlapping channels. In order to mitigate the interference problem, channel assignment algorithms have been a popular research topic in recent years. It has been shown that such algorithms can greatly reduce the interference among wireless access points. However, in this paper we present our findings that traditional channel assignment algorithm can introduce a high hidden node index in high network density, thus greatly reducing the WLAN performance. We show that careful consideration needs to be taken when assigning channels using such algorithms. In addition, we propose a novel algorithm, called Cluster Channel Assignment (CCA), which is presented in the form of a state diagram. From our simulation results, we show that CCA can outperform traditional channel assignment in densely deployed scenarios, and is therefore a better alternative in such settings.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124271601","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930082
L. Charoenwatana, Sunya Rattanabung
SCTP will co-exist with TCP on the Internet in a near future as its maturity progresses. Self-similarity is long known as an inherent characteristic of the IP network in which performance of SCTP under such environment is yet to be investigated. This paper reports behaviors and throughput of SCTP and TCP streams when co-existed together in the same channel under self-similar traffic environment. Simulation tests on several TCP variants including New-Reno, Reno, Tahoe, Vegas, and SACK using ns2 simulator are conducted. Results reveal that SCTP acquires averagely only 50% throughput when competing with TCP. Although found that self-similarity does not extensively distort SCTP-TCP performance, it, nevertheless, offers indirect advantage to SCTP in gaining throughput proportion against TCP.
{"title":"Coexistence of SCTP and TCP variants under self-similar network","authors":"L. Charoenwatana, Sunya Rattanabung","doi":"10.1109/JCSSE.2011.5930082","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930082","url":null,"abstract":"SCTP will co-exist with TCP on the Internet in a near future as its maturity progresses. Self-similarity is long known as an inherent characteristic of the IP network in which performance of SCTP under such environment is yet to be investigated. This paper reports behaviors and throughput of SCTP and TCP streams when co-existed together in the same channel under self-similar traffic environment. Simulation tests on several TCP variants including New-Reno, Reno, Tahoe, Vegas, and SACK using ns2 simulator are conducted. Results reveal that SCTP acquires averagely only 50% throughput when competing with TCP. Although found that self-similarity does not extensively distort SCTP-TCP performance, it, nevertheless, offers indirect advantage to SCTP in gaining throughput proportion against TCP.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126487021","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930099
Thitiphob Pangjitt, T. Sunetnanta
An electronic issue management system, alternatively known as a help desk system, refers to a computer application that can be used to electronically automate the process of managing business issues, including problems, defects, tasks, changes or new requests. The difficulties found in using such a system are often from the lack of expertise to resolve the issues that are stored by the system. This paper proposes to use ontology and case-based reasoning to better provide structured information and enable the capturing of tacit knowledge of experts for issue management.
{"title":"A model of ontology driven case-based reasoning for electronic issue management systems","authors":"Thitiphob Pangjitt, T. Sunetnanta","doi":"10.1109/JCSSE.2011.5930099","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930099","url":null,"abstract":"An electronic issue management system, alternatively known as a help desk system, refers to a computer application that can be used to electronically automate the process of managing business issues, including problems, defects, tasks, changes or new requests. The difficulties found in using such a system are often from the lack of expertise to resolve the issues that are stored by the system. This paper proposes to use ontology and case-based reasoning to better provide structured information and enable the capturing of tacit knowledge of experts for issue management.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131933351","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930122
Jirapat Simathamanand, K. Piromsopa
Using Thai virtual keyboard for social network function on a tablet-based device has proven to be inefficient. In this paper, we design a new layout for Thai virtual keyboard by applying constraints to genetic algorithm. Our experiment is validated with data collected from social network website. With Fitts' law as our performance model, the result shows that the new Thai keyboard layout performs better than traditional layouts.
{"title":"Performance optimization of Thai virtual keyboard for social networking","authors":"Jirapat Simathamanand, K. Piromsopa","doi":"10.1109/JCSSE.2011.5930122","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930122","url":null,"abstract":"Using Thai virtual keyboard for social network function on a tablet-based device has proven to be inefficient. In this paper, we design a new layout for Thai virtual keyboard by applying constraints to genetic algorithm. Our experiment is validated with data collected from social network website. With Fitts' law as our performance model, the result shows that the new Thai keyboard layout performs better than traditional layouts.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132865430","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930133
Thawee Thaisongsuwan, T. Senivongse
WS-BPEL is a standard language for orchestrating business processes of Web services. During service invocation, errors may occur from latent faults, e.g. partner services may not be available or not respond within time. Fault tolerance patterns, such as those for architectural design, error detection, and error recovery, can be used to handle partner service faults. This paper proposes an approach to applying patterns for fault tolerant software to WS-BPEL. Templates of WS-BPEL constructs to implement fault handling logic according to the patterns will be presented. With this approach, business processes can be made to execute in a fault tolerant manner within standard WS-BPEL execution environment.
{"title":"Applying software fault tolerance patterns to WS-BPEL processes","authors":"Thawee Thaisongsuwan, T. Senivongse","doi":"10.1109/JCSSE.2011.5930133","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930133","url":null,"abstract":"WS-BPEL is a standard language for orchestrating business processes of Web services. During service invocation, errors may occur from latent faults, e.g. partner services may not be available or not respond within time. Fault tolerance patterns, such as those for architectural design, error detection, and error recovery, can be used to handle partner service faults. This paper proposes an approach to applying patterns for fault tolerant software to WS-BPEL. Templates of WS-BPEL constructs to implement fault handling logic according to the patterns will be presented. With this approach, business processes can be made to execute in a fault tolerant manner within standard WS-BPEL execution environment.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129011435","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930116
Theeraphat Sajjawiso, P. Kanongchaiyos
Hand pose modeling is one of the most challenging research areas in Computer Animation due to the difficulty of hand model, which consist of more than 20 degrees of freedom and require the construction of a large high-dimensional database of poses. In this paper, we propose a method of 3D hand pose modeling based on a new set of constraints and optimization framework to reduce the ambignity between 2D joint location and 3D hand poses. Our method does not need prior knowledge of the bone length and camera parameters. Furthermore, a large high-dimension database used for searching is not needed to be constructed. An experiment was performed on the real data set captured from a webcam. the results shows that the proposed set of constraints are sufficient to reconstruct the hand poses with desirable accuracy.
{"title":"3D Hand pose modeling from uncalibrate monocular images","authors":"Theeraphat Sajjawiso, P. Kanongchaiyos","doi":"10.1109/JCSSE.2011.5930116","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930116","url":null,"abstract":"Hand pose modeling is one of the most challenging research areas in Computer Animation due to the difficulty of hand model, which consist of more than 20 degrees of freedom and require the construction of a large high-dimensional database of poses. In this paper, we propose a method of 3D hand pose modeling based on a new set of constraints and optimization framework to reduce the ambignity between 2D joint location and 3D hand poses. Our method does not need prior knowledge of the bone length and camera parameters. Furthermore, a large high-dimension database used for searching is not needed to be constructed. An experiment was performed on the real data set captured from a webcam. the results shows that the proposed set of constraints are sufficient to reconstruct the hand poses with desirable accuracy.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129220833","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930135
Aekkachai Sumetanupap, T. Senivongse
In service selection, service consumers usually consider service functionalities and use technical quality of service (QoS) or price to differentiate between services of the same functionalities. That alone, in practice, is not adequate since the quality of servce providers can also have infuence on selection decisions. This paper applies a concept of interpersonal trust, especially trusting beliefs, to devise a quality of provider model. The model is based on competence, benevolence, and integrity of service providers, and trust score can be computed using the fuzzy set theory. Service consumers can then use the trust scores, in addition to technical QoS and price, in service selection.
{"title":"Enhancing service selection with a provider trustworthiness model","authors":"Aekkachai Sumetanupap, T. Senivongse","doi":"10.1109/JCSSE.2011.5930135","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930135","url":null,"abstract":"In service selection, service consumers usually consider service functionalities and use technical quality of service (QoS) or price to differentiate between services of the same functionalities. That alone, in practice, is not adequate since the quality of servce providers can also have infuence on selection decisions. This paper applies a concept of interpersonal trust, especially trusting beliefs, to devise a quality of provider model. The model is based on competence, benevolence, and integrity of service providers, and trust score can be computed using the fuzzy set theory. Service consumers can then use the trust scores, in addition to technical QoS and price, in service selection.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127485753","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930105
Kunthawat Suthambut, Jumpol Polvichai
A soccer robot is a cooperative robot agent system on a soccer game. Robot controllers in this project must react to different environments on each robot to achieve the goal while the optimal solution of controller configuration is hard to define. The Artificial Neural Networks (ANNs) and Genetic Algorithms (GAs) give us a key to solve these problems. An ANN develops itself to process complex problem while a GA finds acceptable solutions with the ability of randomness. The project shows that these hybrid methods used in soccer league simulation yield a promising result.
{"title":"Evolutionary Artificial Neural Networks on simulated soccer robots","authors":"Kunthawat Suthambut, Jumpol Polvichai","doi":"10.1109/JCSSE.2011.5930105","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930105","url":null,"abstract":"A soccer robot is a cooperative robot agent system on a soccer game. Robot controllers in this project must react to different environments on each robot to achieve the goal while the optimal solution of controller configuration is hard to define. The Artificial Neural Networks (ANNs) and Genetic Algorithms (GAs) give us a key to solve these problems. An ANN develops itself to process complex problem while a GA finds acceptable solutions with the ability of randomness. The project shows that these hybrid methods used in soccer league simulation yield a promising result.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126792944","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930104
R. Sukhahuta, Chadchai Sukanun
In this paper we present an approach to extracting significant events from digital documents. OpenNLP syntactical parser for English is used for generating parse trees from the sentences, followed by the extraction of events from the parse trees using tree traversal algorithms. The extraction system is developed and tested on 50 sentences from terrorism documents of The Federation of American Scientists (FAS). The results showed that with this technique we can achieve high recall and precision yielding accuracy of 89.68 recall and 78.44 precision with an overall performance of 83.66 in term of F-measure.
{"title":"Event recognition from information-linkage based using phrase tree traversal","authors":"R. Sukhahuta, Chadchai Sukanun","doi":"10.1109/JCSSE.2011.5930104","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930104","url":null,"abstract":"In this paper we present an approach to extracting significant events from digital documents. OpenNLP syntactical parser for English is used for generating parse trees from the sentences, followed by the extraction of events from the parse trees using tree traversal algorithms. The extraction system is developed and tested on 50 sentences from terrorism documents of The Federation of American Scientists (FAS). The results showed that with this technique we can achieve high recall and precision yielding accuracy of 89.68 recall and 78.44 precision with an overall performance of 83.66 in term of F-measure.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114799471","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 : 2011-05-11DOI: 10.1109/JCSSE.2011.5930125
Napat Luevisadpaibul, Salita Sombatsiri, K. Piromsopa
Each business and organization owns an excessive amount of corporate data. Therefore, Storage Area Network (SAN) is built to support the need of data storage over the network. However, it is not worthy for Small Office, Home Office (SOHO) and small businesses to invest on the high-cost SAN system. Therefore, the implementation of Advanced Technology Attachment (ATA) Device Host Controller to support internet Advanced Technology Attachment (iATA) Protocol for ATA Network Attached Storage (NAS) is introduced to enable the capability to read data from and write data to ATA Device over the existing network. In this paper, we have implemented ATA Device Host Controller which supports a iATA application layer protocol on Field Programmable Gate Arrays (FPGA) to enable the data transfer over the internet. On the FPGA, we have implemented a module for each of the internet layer protocol, which are 1) 10/100 Ethernet MAC Module for the Physical and the Data Link Layer 2) IP header de/encapsulation Module for the Network Layer 3) TCP header de/encapsulation Module for the Transport Layer 4) iATA Controller Module for the Application Layer, and a Disk Controller Module for the read/write operations to a hard disk. These modules operate sequentially. As a result of the implementation, the experiment shows that our prototype systems can operate the read operation with the average speed of 1250 KB/sec and the write operation with the average speed of 1170 KB/sec. The experiment also shows that there is a clock frequency limitation in the implementation.
每个企业和组织都拥有大量的公司数据。因此，存储区域网络SAN (Storage Area Network)应运而生，以满足网络上数据存储的需求。然而，对于小型办公室、家庭办公室(SOHO)和小型企业来说，投资于高成本的SAN系统是不值得的。因此，引入了支持internet Advanced Technology Attachment (ATA) Protocol for ATA Network Attached Storage (NAS)的Advanced Technology Attachment (ATA) Device Host Controller的实现，以实现通过现有网络从ATA Device读取数据和向其写入数据的能力。在本文中，我们在现场可编程门阵列(FPGA)上实现了支持iATA应用层协议的ATA设备主机控制器，以实现互联网上的数据传输。在FPGA上，我们为每个互联网层协议实现了一个模块，它们是1)用于物理层和数据链路层的10/100以太网MAC模块2)用于网络层的IP头解码/封装模块3)用于传输层的TCP头解码/封装模块4)用于应用层的iATA控制器模块，以及用于硬盘读写操作的磁盘控制器模块。这些模块按顺序运行。实验结果表明，我们的原型系统能够以平均1250 KB/sec的速度进行读操作，以平均1170 KB/sec的速度进行写操作。实验还表明，在实现中存在时钟频率限制。
{"title":"An FPGA implementation of ATA Host Controller toward scalable iATA NAS","authors":"Napat Luevisadpaibul, Salita Sombatsiri, K. Piromsopa","doi":"10.1109/JCSSE.2011.5930125","DOIUrl":"https://doi.org/10.1109/JCSSE.2011.5930125","url":null,"abstract":"Each business and organization owns an excessive amount of corporate data. Therefore, Storage Area Network (SAN) is built to support the need of data storage over the network. However, it is not worthy for Small Office, Home Office (SOHO) and small businesses to invest on the high-cost SAN system. Therefore, the implementation of Advanced Technology Attachment (ATA) Device Host Controller to support internet Advanced Technology Attachment (iATA) Protocol for ATA Network Attached Storage (NAS) is introduced to enable the capability to read data from and write data to ATA Device over the existing network. In this paper, we have implemented ATA Device Host Controller which supports a iATA application layer protocol on Field Programmable Gate Arrays (FPGA) to enable the data transfer over the internet. On the FPGA, we have implemented a module for each of the internet layer protocol, which are 1) 10/100 Ethernet MAC Module for the Physical and the Data Link Layer 2) IP header de/encapsulation Module for the Network Layer 3) TCP header de/encapsulation Module for the Transport Layer 4) iATA Controller Module for the Application Layer, and a Disk Controller Module for the read/write operations to a hard disk. These modules operate sequentially. As a result of the implementation, the experiment shows that our prototype systems can operate the read operation with the average speed of 1250 KB/sec and the write operation with the average speed of 1170 KB/sec. The experiment also shows that there is a clock frequency limitation in the implementation.","PeriodicalId":287775,"journal":{"name":"2011 Eighth International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123245931","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
扫码关注我们
求助内容：
应助结果提醒方式：