Pub Date : 2004-09-05DOI: 10.1109/ICEEC.2004.1374420
A. Wahdan, T. A. Al-Zohary
In this paper a real time control technique for a nonlinear multivariable system is presented. The proposed technique is a hybrid approach, which combines the ability of a dynamic recurrent neural network for modeling purposes and a linear control law to design the controller, providing a bridge between the field of neural mtworks and the well known linear adaptive control methods. In this paper, we consider that the state of the system is accessible. Simulation results are presented toward the end of the paper to show the effectiveness of the proposed methodology.
{"title":"Adaptive control for nonlinear multivariable systems using a dynamic recurrent neural networks and conventional linear controller","authors":"A. Wahdan, T. A. Al-Zohary","doi":"10.1109/ICEEC.2004.1374420","DOIUrl":"https://doi.org/10.1109/ICEEC.2004.1374420","url":null,"abstract":"In this paper a real time control technique for a nonlinear multivariable system is presented. The proposed technique is a hybrid approach, which combines the ability of a dynamic recurrent neural network for modeling purposes and a linear control law to design the controller, providing a bridge between the field of neural mtworks and the well known linear adaptive control methods. In this paper, we consider that the state of the system is accessible. Simulation results are presented toward the end of the paper to show the effectiveness of the proposed methodology.","PeriodicalId":180043,"journal":{"name":"International Conference on Electrical, Electronic and Computer Engineering, 2004. ICEEC '04.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127236244","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 : 2004-09-05DOI: 10.1109/ICEEC.2004.1374527
T. Abdolkader, W. Fikry
In this paper, a model for electron distribution in the direction perpendicular to the interface (transverse direction) of a DG-MOSFET is proposed. The model is based on multiplying the classically-calculated electron density by a correction term to account for quantummechanical effects. The correction term is chosen to guarantee zero carrier density at the interface and assumes an effective bandgap widening resulting from splitting of the conduction band into subbands. The model has fitting parameters that were optimized with numerical simulation results. It has continuous derivative and works well over a wide range of gate biases and Si-film thicknesses including both volume and surface inversion regions. Index Terms Quantum correction models; double-gate MOS structures; modeling and simulation
{"title":"Semi-empirical quantum correction model for electron concentration in symmetric double gate mosfets","authors":"T. Abdolkader, W. Fikry","doi":"10.1109/ICEEC.2004.1374527","DOIUrl":"https://doi.org/10.1109/ICEEC.2004.1374527","url":null,"abstract":"In this paper, a model for electron distribution in the direction perpendicular to the interface (transverse direction) of a DG-MOSFET is proposed. The model is based on multiplying the classically-calculated electron density by a correction term to account for quantummechanical effects. The correction term is chosen to guarantee zero carrier density at the interface and assumes an effective bandgap widening resulting from splitting of the conduction band into subbands. The model has fitting parameters that were optimized with numerical simulation results. It has continuous derivative and works well over a wide range of gate biases and Si-film thicknesses including both volume and surface inversion regions. Index Terms Quantum correction models; double-gate MOS structures; modeling and simulation","PeriodicalId":180043,"journal":{"name":"International Conference on Electrical, Electronic and Computer Engineering, 2004. ICEEC '04.","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126761110","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 : 2004-09-05DOI: 10.1109/ICEEC.2004.1374415
G. Nagib, W. Gharieb
Abstract - This paper presents a new algorithm for global path planning to a goal for a mobile robot using Genetic Algorithm (GA). A genetic algorithm is used to find the optimal path for a mobile robot to move in a static environment expressed by a map with nodes and links. Locations of target and obstacles to find an optimal path are given in an environment that is a 2-D workplace. Each via point (landmark) in the net is a gene which is represented using binary code. The number of genes in one chromosome is function of the number of obstacles in the map. Therefore, we used a fixed length chromosome. The generated robot path is optimal in the sense of the shortest distance. The robot has a starting point and a target point under the assumption that the robot passes each point only once or not at all. The obtained results in simulation affirmed the potential of the proposed algorithm. I. I NTRODUCTION The path planning problem of a mobile robot can be stated as: given (starting location, goal location, 2-D map of workplace including static obstacles), plan a collision-free path between two specified points in satisfying an optimization criterion with constraints (most commonly: shortest path). The path planning problem is computationally very expensive. Although a great deal of research has been performed to further a solution to this problem, conventional approaches tend to be inflexible in response to: • Different optimization goals and changes of goals • Uncertainties in an environments and • Different constraints on computational resources. A review of the existing approaches for solving path-planning problem is provided in [1]. Many methods have been reported to generate an optimal path such: dynamic programming and distance transform methods. In the
{"title":"Path planning for a mobile robot using genetic algorithms","authors":"G. Nagib, W. Gharieb","doi":"10.1109/ICEEC.2004.1374415","DOIUrl":"https://doi.org/10.1109/ICEEC.2004.1374415","url":null,"abstract":"Abstract - This paper presents a new algorithm for global path planning to a goal for a mobile robot using Genetic Algorithm (GA). A genetic algorithm is used to find the optimal path for a mobile robot to move in a static environment expressed by a map with nodes and links. Locations of target and obstacles to find an optimal path are given in an environment that is a 2-D workplace. Each via point (landmark) in the net is a gene which is represented using binary code. The number of genes in one chromosome is function of the number of obstacles in the map. Therefore, we used a fixed length chromosome. The generated robot path is optimal in the sense of the shortest distance. The robot has a starting point and a target point under the assumption that the robot passes each point only once or not at all. The obtained results in simulation affirmed the potential of the proposed algorithm. I. I NTRODUCTION The path planning problem of a mobile robot can be stated as: given (starting location, goal location, 2-D map of workplace including static obstacles), plan a collision-free path between two specified points in satisfying an optimization criterion with constraints (most commonly: shortest path). The path planning problem is computationally very expensive. Although a great deal of research has been performed to further a solution to this problem, conventional approaches tend to be inflexible in response to: • Different optimization goals and changes of goals • Uncertainties in an environments and • Different constraints on computational resources. A review of the existing approaches for solving path-planning problem is provided in [1]. Many methods have been reported to generate an optimal path such: dynamic programming and distance transform methods. In the","PeriodicalId":180043,"journal":{"name":"International Conference on Electrical, Electronic and Computer Engineering, 2004. ICEEC '04.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116932525","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 : 2004-09-05DOI: 10.1109/ICEEC.2004.1374506
S.A. El-khalik, S. Kayed, M. El-Azab, M. Dessouky, H. Ragai
This paper presents an example of analog RF circuit synthesis, namely an LC-VCO for Bluetooth. Transistor sizing is carried out using a simulation-based genetic Optimization tool called AMIGO;. The synthesized example leads to a 2.4-GHz fully integrated LC voltage-controlled oscillator (VCO) using 0.35-μm CMOS technology. The simulated phase-noise values are found to be –112, -107, and -106 dBc/Hz at 600 kHz offset from 2.1, 2.4, and 2.7 GHz carriers, respectively. The VCO consumes 4.77 mA from a 3.3-V supply voltage. An accumulation-mode MOS varactor is used to achieve 25% of tuning range, The MOS varactor and the on-chip spiral models are taken from a standard cell library provided by the foundry.
{"title":"Automated synthesis of integrated RF CMOS LC VCOs","authors":"S.A. El-khalik, S. Kayed, M. El-Azab, M. Dessouky, H. Ragai","doi":"10.1109/ICEEC.2004.1374506","DOIUrl":"https://doi.org/10.1109/ICEEC.2004.1374506","url":null,"abstract":"This paper presents an example of analog RF circuit synthesis, namely an LC-VCO for Bluetooth. Transistor sizing is carried out using a simulation-based genetic Optimization tool called AMIGO;. The synthesized example leads to a 2.4-GHz fully integrated LC voltage-controlled oscillator (VCO) using 0.35-μm CMOS technology. The simulated phase-noise values are found to be –112, -107, and -106 dBc/Hz at 600 kHz offset from 2.1, 2.4, and 2.7 GHz carriers, respectively. The VCO consumes 4.77 mA from a 3.3-V supply voltage. An accumulation-mode MOS varactor is used to achieve 25% of tuning range, The MOS varactor and the on-chip spiral models are taken from a standard cell library provided by the foundry.","PeriodicalId":180043,"journal":{"name":"International Conference on Electrical, Electronic and Computer Engineering, 2004. ICEEC '04.","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124273337","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 : 2004-09-05DOI: 10.1109/ICEEC.2004.1374586
I. Helal, H. Fathalla, M. Mansour, S. Al-Debieky
A prototype Expert System is developed using CLIPS package considering the power system operator's heuristic together with the aid of load flow calculations. Sets of facts about system operation and rules are extracted, the goal of which is to find, very fast, all available Restoration Plans, which assist the operators in making fast judgment, to restore the power supply without overloading any transmission line. Beside system restoration rules, both topology identification rules and searching rules are included. The developed ES is applied to a part of the 66KV transmission network in Cairo, Egypt.
{"title":"Power system restoration using expert system technique","authors":"I. Helal, H. Fathalla, M. Mansour, S. Al-Debieky","doi":"10.1109/ICEEC.2004.1374586","DOIUrl":"https://doi.org/10.1109/ICEEC.2004.1374586","url":null,"abstract":"A prototype Expert System is developed using CLIPS package considering the power system operator's heuristic together with the aid of load flow calculations. Sets of facts about system operation and rules are extracted, the goal of which is to find, very fast, all available Restoration Plans, which assist the operators in making fast judgment, to restore the power supply without overloading any transmission line. Beside system restoration rules, both topology identification rules and searching rules are included. The developed ES is applied to a part of the 66KV transmission network in Cairo, Egypt.","PeriodicalId":180043,"journal":{"name":"International Conference on Electrical, Electronic and Computer Engineering, 2004. ICEEC '04.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114729117","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 : 2004-09-05DOI: 10.1109/ICEEC.2004.1374575
M. Nofal, E. Abdel Reheem, H. El Henawy, N. Abdel Kader
The paper presents an acoustic training system for building acoustic models for a medium vocabulary speaker independent continuous speech recognition system. A speech database is constructed to train the acoustic models. The acoustic models are constructed, trained. A test set database is constructed to test the accuracy of the acoustic models, also 4 language models of two main types: bigram and context free grammar were built and used in tests. Our results show a 5.26 YO and 2.72 % word error rate for 1340 and 306 words bigram based language model respectively. Our results show also 0.19 % and 0.99% for 1340 and 306 words context free grammar based language models respectively.
{"title":"The development of acoustic models for command and control arabic speech recognition system","authors":"M. Nofal, E. Abdel Reheem, H. El Henawy, N. Abdel Kader","doi":"10.1109/ICEEC.2004.1374575","DOIUrl":"https://doi.org/10.1109/ICEEC.2004.1374575","url":null,"abstract":"The paper presents an acoustic training system for building acoustic models for a medium vocabulary speaker independent continuous speech recognition system. A speech database is constructed to train the acoustic models. The acoustic models are constructed, trained. A test set database is constructed to test the accuracy of the acoustic models, also 4 language models of two main types: bigram and context free grammar were built and used in tests. Our results show a 5.26 YO and 2.72 % word error rate for 1340 and 306 words bigram based language model respectively. Our results show also 0.19 % and 0.99% for 1340 and 306 words context free grammar based language models respectively.","PeriodicalId":180043,"journal":{"name":"International Conference on Electrical, Electronic and Computer Engineering, 2004. ICEEC '04.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124425571","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 : 2004-09-05DOI: 10.1109/ICEEC.2004.1374542
S. Elramly, H. Elattar
Availability of reliable simple calculation methods provide assistance in evaluating human exposure to electromagnetic fields from base station antenna. In this paper a practical antenna model is simulated considering all its characteristics. Secondb, two approximate formulas for radiated power density calculation are compared and their accuracy and range of applicability are discussed. Finally, an attempt is made to estimate the safety distance from the antenna main beam that wiIl ensure compatibility with standard guidelines for human exposure.
{"title":"GSM base station antenna model for evaluating human exposure","authors":"S. Elramly, H. Elattar","doi":"10.1109/ICEEC.2004.1374542","DOIUrl":"https://doi.org/10.1109/ICEEC.2004.1374542","url":null,"abstract":"Availability of reliable simple calculation methods provide assistance in evaluating human exposure to electromagnetic fields from base station antenna. In this paper a practical antenna model is simulated considering all its characteristics. Secondb, two approximate formulas for radiated power density calculation are compared and their accuracy and range of applicability are discussed. Finally, an attempt is made to estimate the safety distance from the antenna main beam that wiIl ensure compatibility with standard guidelines for human exposure.","PeriodicalId":180043,"journal":{"name":"International Conference on Electrical, Electronic and Computer Engineering, 2004. ICEEC '04.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121744079","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 : 2004-09-05DOI: 10.1109/ICEEC.2004.1374444
Yu Wing Shing, R. Li, A. Fong
jHISC is an object-oriented processor for embedded system aiming at accelerating Java execution by hardware approach. Garbage collection is one of the critical tasks in a Java Virtual Machine. We have conduct a study of dynamic object allocation and garbage collection behavior of Java program based on SPECjvm 98 benchmark suite and MIDP applications for mobile phone. Life, size, and reference count distribution of Java objects are measured. The study discovered that most Java objects die very young, small in size and have small number reference count. Reference counting object cache with hardware write barrier and object allocator is proposed to provide the hardware concurrent garbage collection for small size objects in jHISC. Hardware support on write barriergreatly reduces the overhead to perform the reference count update. The reference-count collector reclaims the memory occupied by an object immediately afler it becomes garbage. The allocator provides a constant time object allocation. According the performance evaluation, over halfof Java object can be garbage collected by the object cache that make its unnecessary for these object to copy to the main memory.
{"title":"Hardware concurrent garbage collection for short-lived objects in an object-oriented processor","authors":"Yu Wing Shing, R. Li, A. Fong","doi":"10.1109/ICEEC.2004.1374444","DOIUrl":"https://doi.org/10.1109/ICEEC.2004.1374444","url":null,"abstract":"jHISC is an object-oriented processor for embedded system aiming at accelerating Java execution by hardware approach. Garbage collection is one of the critical tasks in a Java Virtual Machine. We have conduct a study of dynamic object allocation and garbage collection behavior of Java program based on SPECjvm 98 benchmark suite and MIDP applications for mobile phone. Life, size, and reference count distribution of Java objects are measured. The study discovered that most Java objects die very young, small in size and have small number reference count. Reference counting object cache with hardware write barrier and object allocator is proposed to provide the hardware concurrent garbage collection for small size objects in jHISC. Hardware support on write barriergreatly reduces the overhead to perform the reference count update. The reference-count collector reclaims the memory occupied by an object immediately afler it becomes garbage. The allocator provides a constant time object allocation. According the performance evaluation, over halfof Java object can be garbage collected by the object cache that make its unnecessary for these object to copy to the main memory.","PeriodicalId":180043,"journal":{"name":"International Conference on Electrical, Electronic and Computer Engineering, 2004. ICEEC '04.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122051906","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 : 2004-09-05DOI: 10.1109/ICEEC.2004.1374447
H. Hosny
Earlier research has shown that the Sofhare Engineering Institute s Capability Maturity Model CMMO can be tailored to suit smaller organizations. This paper summarizes a research effort which recommends a different approach in which the Software Quality Assurance (SQA) Key Process Area (KPA), as modeled within the CMM levels 2 and 3, is simplified for use by small sized organizations while maintaining the structure of the original CMM SQA KPA. The paper describes the approach for generating a Software Quality Assurance guide in which the SQA process activities and the embedded procedures within these activities (drawn from the CMM levels 2 and 3) have been collected into one set and briefed down such that they are easier to follow as a tailored practice. Additional guidelines (and sometimes templates) drawn from international standards can also be added to complement the scaled down model with essential items such as the SQA plan, risk management and mitigation strategies and commonly used measurements and metrics.
{"title":"The CMM software quality assurance process scaled down for small organizations","authors":"H. Hosny","doi":"10.1109/ICEEC.2004.1374447","DOIUrl":"https://doi.org/10.1109/ICEEC.2004.1374447","url":null,"abstract":"Earlier research has shown that the Sofhare Engineering Institute s Capability Maturity Model CMMO can be tailored to suit smaller organizations. This paper summarizes a research effort which recommends a different approach in which the Software Quality Assurance (SQA) Key Process Area (KPA), as modeled within the CMM levels 2 and 3, is simplified for use by small sized organizations while maintaining the structure of the original CMM SQA KPA. The paper describes the approach for generating a Software Quality Assurance guide in which the SQA process activities and the embedded procedures within these activities (drawn from the CMM levels 2 and 3) have been collected into one set and briefed down such that they are easier to follow as a tailored practice. Additional guidelines (and sometimes templates) drawn from international standards can also be added to complement the scaled down model with essential items such as the SQA plan, risk management and mitigation strategies and commonly used measurements and metrics.","PeriodicalId":180043,"journal":{"name":"International Conference on Electrical, Electronic and Computer Engineering, 2004. ICEEC '04.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117025863","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 : 2004-09-05DOI: 10.1109/ICEEC.2004.1374556
H. Ali, A.S. AbdelGader, R. Abdou
the DWT, less memory requirements, symmetric forward and inverse transform, etc[2,3]. Abstract In this paper a novel reconfigurable hardware accelerator for the lifting scheme algorithm is presented. The design is pipelined, scalable and can be easily configured for use of different filter. The lifting scheme has gained a special interest for efficient computation of the Discrete Wavelet Transform (DWT). The reconfigurability of hardware architectures has been a key word to meet different application requirement. Significant results were obtained in terms of throughput and area occupation.
{"title":"Reconfigurable architecture for lifting based discrete wavelet transform","authors":"H. Ali, A.S. AbdelGader, R. Abdou","doi":"10.1109/ICEEC.2004.1374556","DOIUrl":"https://doi.org/10.1109/ICEEC.2004.1374556","url":null,"abstract":"the DWT, less memory requirements, symmetric forward and inverse transform, etc[2,3]. Abstract In this paper a novel reconfigurable hardware accelerator for the lifting scheme algorithm is presented. The design is pipelined, scalable and can be easily configured for use of different filter. The lifting scheme has gained a special interest for efficient computation of the Discrete Wavelet Transform (DWT). The reconfigurability of hardware architectures has been a key word to meet different application requirement. Significant results were obtained in terms of throughput and area occupation.","PeriodicalId":180043,"journal":{"name":"International Conference on Electrical, Electronic and Computer Engineering, 2004. ICEEC '04.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117336611","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
扫码关注我们
求助内容：
应助结果提醒方式：