Pub Date : 2007-12-01DOI: 10.1109/ISSPIT.2007.4458215
A. Keshk, A. Ibrahim
As Web sites becoming a fundamental component of businesses, quality of service will be one of the top management concerns. Users, normally, does not care about site failures, traffic jams, network bandwidth [1], or other indicators of system failures. To an online customer, quality of service means fast, predictable response service, level of a Web site noted in a real time. User measures the quality by response time, availability, reliability, predictability, and cost. Poor quality implies that the customer will no longer visit the site and hence the organization may loose business. The issues that affect the quality are broken pages and faulty images, CGI-bin error messages, complex colour combinations, no back link, multiple and frequent links, etc. So we try to build a good program that can scan Web site for broken links, broken images, broken pages and other common Web site faults. As Web site cannot test as a whole in one attempt we rely on decomposing the behavior of the Web site into testable components and mapping these components onto testable objects. Moreover we verify our method by using Jmeter tool [2] to measure the performance of Web, which indicate that broken components on a Web site has a bad effect in its performance.
{"title":"Ensuring the Quality Testing of Web Using a New Methodology","authors":"A. Keshk, A. Ibrahim","doi":"10.1109/ISSPIT.2007.4458215","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458215","url":null,"abstract":"As Web sites becoming a fundamental component of businesses, quality of service will be one of the top management concerns. Users, normally, does not care about site failures, traffic jams, network bandwidth [1], or other indicators of system failures. To an online customer, quality of service means fast, predictable response service, level of a Web site noted in a real time. User measures the quality by response time, availability, reliability, predictability, and cost. Poor quality implies that the customer will no longer visit the site and hence the organization may loose business. The issues that affect the quality are broken pages and faulty images, CGI-bin error messages, complex colour combinations, no back link, multiple and frequent links, etc. So we try to build a good program that can scan Web site for broken links, broken images, broken pages and other common Web site faults. As Web site cannot test as a whole in one attempt we rely on decomposing the behavior of the Web site into testable components and mapping these components onto testable objects. Moreover we verify our method by using Jmeter tool [2] to measure the performance of Web, which indicate that broken components on a Web site has a bad effect in its performance.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128932376","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 : 2007-12-01DOI: 10.1109/ISSPIT.2007.4458050
S. Patnaik, Anamika Upadhyay
Linear receiver structures for DS-CDMA systems are amongst the most promising techniques for interference suppression in the downlink since they offer an attractive trade off between performance, complexity and the need for side information. In this paper we investigated a code-constrained constant modulus RAKE receiver for direct sequence code division multiple access (DS-CDMA) channels. We propose a closed loop solution for linear receiver based on constrained optimisation technique that combines multipath signals using multiple constraints which are treated as variables and are jointly optimised with the receiver. The proposed algorithm jointly estimates the parameters of the channel and the receiver in order to suppress multi-access and intersymbol interference.
{"title":"Blind Adaptive Constant Modulus RAKE Receiver for Downlink CDMA","authors":"S. Patnaik, Anamika Upadhyay","doi":"10.1109/ISSPIT.2007.4458050","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458050","url":null,"abstract":"Linear receiver structures for DS-CDMA systems are amongst the most promising techniques for interference suppression in the downlink since they offer an attractive trade off between performance, complexity and the need for side information. In this paper we investigated a code-constrained constant modulus RAKE receiver for direct sequence code division multiple access (DS-CDMA) channels. We propose a closed loop solution for linear receiver based on constrained optimisation technique that combines multipath signals using multiple constraints which are treated as variables and are jointly optimised with the receiver. The proposed algorithm jointly estimates the parameters of the channel and the receiver in order to suppress multi-access and intersymbol interference.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131579350","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 : 2007-12-01DOI: 10.1109/ISSPIT.2007.4458015
Li Li, Zhengxin Hou, Chang Sun
In recent years, there has been an increasing interest in generating free-viewpoint images of a scene from multiple camera views. This will provide viewers with more vivid visual entertainment as well as interactivity. But with the huge amount of date taken by multiple cameras, much higher compression rates are needed to transmit multiview information in acceptable times, e.g. over the Internet or wireless media. In this paper, disparity compensation is incorporated into wavelet coding elegantly by lifting scheme. By this approach, both inter-view and intra-view spatial coherence is fully exploited so as to achieve superior compression efficiency as well as scalability. A scheme that facilitates optimal allocation of bit rates to the different components of a lifted scheme (the L/H images and the disparity vectors) is also proposed.
{"title":"Wavelet Compression of Multiview Video with Disparity-Compensated Lifting","authors":"Li Li, Zhengxin Hou, Chang Sun","doi":"10.1109/ISSPIT.2007.4458015","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458015","url":null,"abstract":"In recent years, there has been an increasing interest in generating free-viewpoint images of a scene from multiple camera views. This will provide viewers with more vivid visual entertainment as well as interactivity. But with the huge amount of date taken by multiple cameras, much higher compression rates are needed to transmit multiview information in acceptable times, e.g. over the Internet or wireless media. In this paper, disparity compensation is incorporated into wavelet coding elegantly by lifting scheme. By this approach, both inter-view and intra-view spatial coherence is fully exploited so as to achieve superior compression efficiency as well as scalability. A scheme that facilitates optimal allocation of bit rates to the different components of a lifted scheme (the L/H images and the disparity vectors) is also proposed.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131049391","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 : 2007-12-01DOI: 10.1109/ISSPIT.2007.4458182
I. Kontaxakis, M. Sangriotis, R. Angelopoulou, K. Plastira, N. Sgouros, S. Mavroudi
A computer method for the automatic analysis of specific fluorescence microscopy images, collected with a TUNEL assay procedure applied on human spermatozoa cells, has been developed in this work. In each image, the cells are shown in blue color while in the interior of every cell an area proportional to the degree of the cell DNA fragmentation has been stained in reddish color by the assay procedure. The proposed digital image analysis technique suggests a segmentation method based on the Primary Component Analysis (PCA) applied to the 3-D color space. In this way the shapes in every image are isolated and then a classification technique is used to obtain only the shapes representing solitary spermatozoa, to ignore those presenting cell overlapping and dispose small shapes-scraps belonging to fragments of useless material created during the assay procedure. Finally, for each solitary cell the ratio of the reddish area over the total cell area is estimated.
{"title":"Automatic Analysis of TUNEL assay Microscopy Images","authors":"I. Kontaxakis, M. Sangriotis, R. Angelopoulou, K. Plastira, N. Sgouros, S. Mavroudi","doi":"10.1109/ISSPIT.2007.4458182","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458182","url":null,"abstract":"A computer method for the automatic analysis of specific fluorescence microscopy images, collected with a TUNEL assay procedure applied on human spermatozoa cells, has been developed in this work. In each image, the cells are shown in blue color while in the interior of every cell an area proportional to the degree of the cell DNA fragmentation has been stained in reddish color by the assay procedure. The proposed digital image analysis technique suggests a segmentation method based on the Primary Component Analysis (PCA) applied to the 3-D color space. In this way the shapes in every image are isolated and then a classification technique is used to obtain only the shapes representing solitary spermatozoa, to ignore those presenting cell overlapping and dispose small shapes-scraps belonging to fragments of useless material created during the assay procedure. Finally, for each solitary cell the ratio of the reddish area over the total cell area is estimated.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130673867","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 : 2007-12-01DOI: 10.1109/ISSPIT.2007.4458189
Ben Belgacem, Youssef, Jim Bizzocchi
In this paper, we compare three motion compensated interpolation (MCI) algorithms: adjacent-frame motion compensated interpolation (AFI), wide-span motion compensated interpolation (WS-TH), and wide-span motion compensated interpolation with spatial hinting (WS-TH+SH). The latter represents an extension to WS-TH by adding spatial hinting to the generation of motion vectors. The methods are quantitatively compared with the objective of optimizing interpolated frame quality relative to control interpolated frames. This is important because for high-resolution large flat-panel displays, frame transition coherence becomes a critical factor in assessing the quality of the user's viewing experience. To enhance MCI, the encoder should attempt to exploit long-term statistical dependencies, precisely estimate motion by modeling the motion vector field, and superimpose efficient prediction/interpolation algorithms. Computer simulations using artificially generated video sequences demonstrate the consistent advantage of both WS- TH and WS-TH+SH over AFI under increasingly complex source scenes and chaotic occlusion conditions.
{"title":"Enhanced Pixel-Based Video Frame Interpolation Algorithms","authors":"Ben Belgacem, Youssef, Jim Bizzocchi","doi":"10.1109/ISSPIT.2007.4458189","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458189","url":null,"abstract":"In this paper, we compare three motion compensated interpolation (MCI) algorithms: adjacent-frame motion compensated interpolation (AFI), wide-span motion compensated interpolation (WS-TH), and wide-span motion compensated interpolation with spatial hinting (WS-TH+SH). The latter represents an extension to WS-TH by adding spatial hinting to the generation of motion vectors. The methods are quantitatively compared with the objective of optimizing interpolated frame quality relative to control interpolated frames. This is important because for high-resolution large flat-panel displays, frame transition coherence becomes a critical factor in assessing the quality of the user's viewing experience. To enhance MCI, the encoder should attempt to exploit long-term statistical dependencies, precisely estimate motion by modeling the motion vector field, and superimpose efficient prediction/interpolation algorithms. Computer simulations using artificially generated video sequences demonstrate the consistent advantage of both WS- TH and WS-TH+SH over AFI under increasingly complex source scenes and chaotic occlusion conditions.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125596397","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 : 2007-12-01DOI: 10.1109/ISSPIT.2007.4458155
W. Xia, Zishu He, Yuyu Liao
The concept of multiple-input-multiple-output (MIMO) radar is recently proposed inspired by recent advances in MIMO communications. The subspace-based method for multiple-target localization is proposed in this paper. It is shown that the "effective source" covariance matrix is almost always nonsingular under mild conditions in the MIMO radar configuration. The performance of the proposed method is validated by numerical simulations.
{"title":"Subspace-Based Method for Multiple-Target Localization Using MIMO Radars","authors":"W. Xia, Zishu He, Yuyu Liao","doi":"10.1109/ISSPIT.2007.4458155","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458155","url":null,"abstract":"The concept of multiple-input-multiple-output (MIMO) radar is recently proposed inspired by recent advances in MIMO communications. The subspace-based method for multiple-target localization is proposed in this paper. It is shown that the \"effective source\" covariance matrix is almost always nonsingular under mild conditions in the MIMO radar configuration. The performance of the proposed method is validated by numerical simulations.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125299434","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 : 2007-12-01DOI: 10.1109/ISSPIT.2007.4458000
H.S. Wang, G. Zeng
Security has been one of the most significant problems surrounding wireless communications, in large part due to the openness of wireless medium where eavesdropping can be easily accomplished. In this work, the prior results on secrecy capacity is extended to the Gaussian MIMO wire-tap channel, where the transmitter, the receiver and illegal wire-tapper all employ multiple antenna technique. A reasonable security criterion is firstly defined for the MIMO wire-tap channel in this paper. Next the secrecy capacity and the achievable rate-equivocation (R, d) region in this multiple antenna scenario are derived. Finally, the analyzed results are validated by the numerical simulations.
{"title":"Asymptotic analysis of large MIMO wire-tap channel via replica method","authors":"H.S. Wang, G. Zeng","doi":"10.1109/ISSPIT.2007.4458000","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458000","url":null,"abstract":"Security has been one of the most significant problems surrounding wireless communications, in large part due to the openness of wireless medium where eavesdropping can be easily accomplished. In this work, the prior results on secrecy capacity is extended to the Gaussian MIMO wire-tap channel, where the transmitter, the receiver and illegal wire-tapper all employ multiple antenna technique. A reasonable security criterion is firstly defined for the MIMO wire-tap channel in this paper. Next the secrecy capacity and the achievable rate-equivocation (R, d) region in this multiple antenna scenario are derived. Finally, the analyzed results are validated by the numerical simulations.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116026142","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 : 2007-12-01DOI: 10.1109/ISSPIT.2007.4458031
Tien Due Nguyen, T. Fujino, X. Tran
This paper aims at improving bit error rate (BER) performance of lattice reduction aided (LRA) linear detectors for multiple input multiple output (MIMO) wireless systems. Specifically, we present an improved quantization scheme for LRA detectors which can generate a set of candidate symbols from the original LRA estimated symbol. From these symbols, decisions are made in term of the minimum Euclidean distance. It is shown by simulation that the method provides significant BER performance improvement at the cost of small additional complexity.
{"title":"A Quantization Scheme for Lattice-Reduction Aided MIMO Detection","authors":"Tien Due Nguyen, T. Fujino, X. Tran","doi":"10.1109/ISSPIT.2007.4458031","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458031","url":null,"abstract":"This paper aims at improving bit error rate (BER) performance of lattice reduction aided (LRA) linear detectors for multiple input multiple output (MIMO) wireless systems. Specifically, we present an improved quantization scheme for LRA detectors which can generate a set of candidate symbols from the original LRA estimated symbol. From these symbols, decisions are made in term of the minimum Euclidean distance. It is shown by simulation that the method provides significant BER performance improvement at the cost of small additional complexity.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117152404","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 : 2007-12-01DOI: 10.1109/ISSPIT.2007.4458046
M.M.I. Taha, Y.M.Y. Hasan
This paper proposes a novel protocol for reliable broadcasting of life safety messages in Vehicular Ad-hoc Networks (VANETs) simulating reactions of car drivers. In case of any dramatic change of speed or moving direction, the vehicle is considered abnormal and hence it transmits an emergency warning message over the control channel of the Dedicated Short-Range Communication Protocol (DSRC). The proposed protocol gives the vehicle in the most dangerous situation the highest priority to transmit the acknowledgement signal. The choice of that vehicle is done locally based on the location, direction, and speed of the receiving vehicle. The superiority of the proposed protocol over existing protocols is highlighted conceptually and with simulations.
{"title":"VANET-DSRC Protocol for Reliable Broadcasting of Life Safety Messages","authors":"M.M.I. Taha, Y.M.Y. Hasan","doi":"10.1109/ISSPIT.2007.4458046","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458046","url":null,"abstract":"This paper proposes a novel protocol for reliable broadcasting of life safety messages in Vehicular Ad-hoc Networks (VANETs) simulating reactions of car drivers. In case of any dramatic change of speed or moving direction, the vehicle is considered abnormal and hence it transmits an emergency warning message over the control channel of the Dedicated Short-Range Communication Protocol (DSRC). The proposed protocol gives the vehicle in the most dangerous situation the highest priority to transmit the acknowledgement signal. The choice of that vehicle is done locally based on the location, direction, and speed of the receiving vehicle. The superiority of the proposed protocol over existing protocols is highlighted conceptually and with simulations.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128862094","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 : 2007-12-01DOI: 10.1109/ISSPIT.2007.4458079
S. Behbahani, Saeed Asadi, M. Ashtiyani, K. Maghooli
Diagnostic techniques in cardiology require complex image analysis of single images and image sequences obtained by a variety of medical imaging modalities such as ECG gated MR, CT, and ultrasound. In particular, useful information about the cardiac function can be extracted from motion analysis of a beating heart. Accurate quantitative of heart motion and deformation are more important for evaluating normal and abnormal cardiac physiology and mechanics. Optical Flow algorithms attempt to estimate the vector field, which describes spatial movements of every image point over time, and provides important information for motion analysis. While feature-based and correlation-based optical flow methods attempt to locate features or simply track similar objects between frames, gradient -based methods calculate spatial and temporal derivatives for every position in the image and use those for estimation of the optical flow vector field. As the optical flow techniques are the most known approaches in estimating of wall motion, we decided to compare the practical algorithm based on this technique.
{"title":"Analysing Optical Flow Based Methods","authors":"S. Behbahani, Saeed Asadi, M. Ashtiyani, K. Maghooli","doi":"10.1109/ISSPIT.2007.4458079","DOIUrl":"https://doi.org/10.1109/ISSPIT.2007.4458079","url":null,"abstract":"Diagnostic techniques in cardiology require complex image analysis of single images and image sequences obtained by a variety of medical imaging modalities such as ECG gated MR, CT, and ultrasound. In particular, useful information about the cardiac function can be extracted from motion analysis of a beating heart. Accurate quantitative of heart motion and deformation are more important for evaluating normal and abnormal cardiac physiology and mechanics. Optical Flow algorithms attempt to estimate the vector field, which describes spatial movements of every image point over time, and provides important information for motion analysis. While feature-based and correlation-based optical flow methods attempt to locate features or simply track similar objects between frames, gradient -based methods calculate spatial and temporal derivatives for every position in the image and use those for estimation of the optical flow vector field. As the optical flow techniques are the most known approaches in estimating of wall motion, we decided to compare the practical algorithm based on this technique.","PeriodicalId":299267,"journal":{"name":"2007 IEEE International Symposium on Signal Processing and Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126394174","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
扫码关注我们
求助内容：
应助结果提醒方式：