Pub Date : 2010-11-29DOI: 10.1109/ICMWI.2010.5647906
Karima Amrouche, Yassine Ait Ali Yahia
The document classification is one of the classical task of information retrieval and it has involved numerous studies. In this paper, we are presenting a learning model for XML document classification based on Bayesian networks. This latter is a probabilistical reasoning formalism. It permits to represent depending relationships between the random variables in order to describe a problem or a phenomenon. In this article, we are proposing a model which simplifies the arborescent representation of the XML document that we have, named coupled model and we will see that this approach improves the response time and keeps the same performances of the classification.
{"title":"Nodes coupling in a Bayesian network for the automatic classification of XML documents","authors":"Karima Amrouche, Yassine Ait Ali Yahia","doi":"10.1109/ICMWI.2010.5647906","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5647906","url":null,"abstract":"The document classification is one of the classical task of information retrieval and it has involved numerous studies. In this paper, we are presenting a learning model for XML document classification based on Bayesian networks. This latter is a probabilistical reasoning formalism. It permits to represent depending relationships between the random variables in order to describe a problem or a phenomenon. In this article, we are proposing a model which simplifies the arborescent representation of the XML document that we have, named coupled model and we will see that this approach improves the response time and keeps the same performances of the classification.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129034945","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5648171
Tayeb Kenaza, Abdelhalim Zaidi
Behavioral intrusion detection systems are known by their high false alerts rates. In this paper, we propose to combine a behavioral intrusion detection approach with a clustering approach in order to obtain a set of clusters with different false alerts rates. The order of these clusters with respect to their false alerts rates will be considered as an alerts prioritization. Hence, new alerts will be classified to the closest cluster and processed according to their cluster priority. Experimental results, using a simulated IDS, show that our approach is able to reduce the false alerts rate produced by behavioral intrusion detection systems.
{"title":"Clustering approach for false alerts reducing in behavioral based intrusion detection systems","authors":"Tayeb Kenaza, Abdelhalim Zaidi","doi":"10.1109/ICMWI.2010.5648171","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5648171","url":null,"abstract":"Behavioral intrusion detection systems are known by their high false alerts rates. In this paper, we propose to combine a behavioral intrusion detection approach with a clustering approach in order to obtain a set of clusters with different false alerts rates. The order of these clusters with respect to their false alerts rates will be considered as an alerts prioritization. Hence, new alerts will be classified to the closest cluster and processed according to their cluster priority. Experimental results, using a simulated IDS, show that our approach is able to reduce the false alerts rate produced by behavioral intrusion detection systems.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114545598","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5648107
C. Díaz-Hernández, J. L. Muñoz-Lozano, J. López-Coronado
This paper is concerned with the visual servoing of a mobile robot in dynamic environments. We assume a target with maneuvering capabilities, and thus it can be hidden from the camera by the obstacles in the scene. These two problems must be taken into account in the control law to ensure correct servoing. The control law must consider the target movement to reduce tracking error as small as possible. Moreover, the control law should consider visual loss management (reconstruction of the visual signal in case of occultation), and collision avoidance, estimating the obstacle motion. We present a strategy to avoid the tracking error due to the movement of the target itself.
{"title":"Using estimation techniques for visual servoing in dynamic environments","authors":"C. Díaz-Hernández, J. L. Muñoz-Lozano, J. López-Coronado","doi":"10.1109/ICMWI.2010.5648107","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5648107","url":null,"abstract":"This paper is concerned with the visual servoing of a mobile robot in dynamic environments. We assume a target with maneuvering capabilities, and thus it can be hidden from the camera by the obstacles in the scene. These two problems must be taken into account in the control law to ensure correct servoing. The control law must consider the target movement to reduce tracking error as small as possible. Moreover, the control law should consider visual loss management (reconstruction of the visual signal in case of occultation), and collision avoidance, estimating the obstacle motion. We present a strategy to avoid the tracking error due to the movement of the target itself.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127105184","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5647944
A. R. Maouche, M. Attari
This paper describes a hybrid approach to the problem of controlling flexible link manipulators in the face of both structured and unstructured uncertainties. First, a nonlinear controller based on the equations of motion of the robot is elaborated. Its aim is to produce a stable control. Then, an adaptive RBF neural controller is implemented to compensate structured and unstructured uncertainties. Efficiency of the new controller obtained by combining the two control laws is tested facing an important variation of the dynamic parameters of the flexible manipulator and compared to a classical nonlinear controller. Simulation results show the effectiveness of the proposed control strategy.
{"title":"Nonlinear adaptive RBFNN control of a one-link flexible manipulator","authors":"A. R. Maouche, M. Attari","doi":"10.1109/ICMWI.2010.5647944","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5647944","url":null,"abstract":"This paper describes a hybrid approach to the problem of controlling flexible link manipulators in the face of both structured and unstructured uncertainties. First, a nonlinear controller based on the equations of motion of the robot is elaborated. Its aim is to produce a stable control. Then, an adaptive RBF neural controller is implemented to compensate structured and unstructured uncertainties. Efficiency of the new controller obtained by combining the two control laws is tested facing an important variation of the dynamic parameters of the flexible manipulator and compared to a classical nonlinear controller. Simulation results show the effectiveness of the proposed control strategy.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121781593","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5647939
Belkacem Mostefai, F. Azouaou, Amar Balla
This article proposes a new approach called PAML (Personal Annotation Memory for Learner) which aims to help learners in their learning process using the annotation activity. With our approach, the learner can build his own external memory, which is the set of whole annotations he creates on his pedagogical documents. We use also the annotation activity, within the context of our SQAR (Survey, Question, Annotation and Review) process, to improve the learning efficiency at learners. We start with defining the concept of learner's external memory, and the learner's personal annotation. Then we present the learner's personal annotation formalism, and we show PAML architecture. Finally, we describe WebAnnot annotation tool that is the first prototype of our model; afterwards, we compare it with other related tools.
本文提出了一种新的方法PAML (Personal Annotation Memory for Learner)，旨在帮助学习者在学习过程中使用标注活动。通过我们的方法，学习者可以建立自己的外部记忆，这是他在教学文档上创建的一组完整的注释。我们还在SQAR(调查、提问、注释和复习)过程中使用注释活动来提高学习者的学习效率。我们从定义学习者的外部记忆和学习者的个人注释的概念开始。然后给出了学习者的个人标注形式，并给出了PAML体系结构。最后，我们描述了WebAnnot注释工具，这是我们模型的第一个原型;然后，我们将其与其他相关工具进行了比较。
{"title":"An annotation-based pedagogical memory model for learner","authors":"Belkacem Mostefai, F. Azouaou, Amar Balla","doi":"10.1109/ICMWI.2010.5647939","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5647939","url":null,"abstract":"This article proposes a new approach called PAML (Personal Annotation Memory for Learner) which aims to help learners in their learning process using the annotation activity. With our approach, the learner can build his own external memory, which is the set of whole annotations he creates on his pedagogical documents. We use also the annotation activity, within the context of our SQAR (Survey, Question, Annotation and Review) process, to improve the learning efficiency at learners. We start with defining the concept of learner's external memory, and the learner's personal annotation. Then we present the learner's personal annotation formalism, and we show PAML architecture. Finally, we describe WebAnnot annotation tool that is the first prototype of our model; afterwards, we compare it with other related tools.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123302745","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5647976
Asma Insaf Djebbar, Ghalem Belalem
The mobile Ad hoc networks are distributed environments characterized by a high mobility and limited battery resources. In these networks, mobiles nodes are subject to many errors. In this paper, we present our approach of modeling by groups for faults tolerance based in MAS, which predicts a problem and provide decisions in relation to critical nodes. Our work contributes to the resolution of two points. First, we propose an algorithm for modeling by groups in wireless network Ad hoc. Secondly, we study the fault tolerance by prediction of disconnection and partition in network; therefore we provide an approach which distributes efficiently the information in the network by selecting some objects of the network to be duplicates of information.
{"title":"Modeling by groups for faults tolerance based on multi agent systems","authors":"Asma Insaf Djebbar, Ghalem Belalem","doi":"10.1109/ICMWI.2010.5647976","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5647976","url":null,"abstract":"The mobile Ad hoc networks are distributed environments characterized by a high mobility and limited battery resources. In these networks, mobiles nodes are subject to many errors. In this paper, we present our approach of modeling by groups for faults tolerance based in MAS, which predicts a problem and provide decisions in relation to critical nodes. Our work contributes to the resolution of two points. First, we propose an algorithm for modeling by groups in wireless network Ad hoc. Secondly, we study the fault tolerance by prediction of disconnection and partition in network; therefore we provide an approach which distributes efficiently the information in the network by selecting some objects of the network to be duplicates of information.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128379110","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5648048
Saroj Kaushik, Deepak Kollipalli
A digital repository is a digital archive for depositing and providing access to digital contents. It harvests metadata for providing an access framework of digital content to multiple users. In existing systems, query and retrieval is done on centralized basis and do not consider semantics of the query. Since the repositories are distributed, distinct and autonomous, there is a need for a framework which is capable of providing an efficient integrated and semantically enriched query retrieval mechanism over multiple repositories. We have proposed and implemented a multi-agent based framework for querying multiple disjoint repositories that is equipped with well defined semantic web technologies such as ontology [7, 8]. The system has been implemented using Jena framework for semantic web, Jade for agents and Java Swing for user interfaces.
{"title":"Multi-agent based architecture for querying disjoint data repositories","authors":"Saroj Kaushik, Deepak Kollipalli","doi":"10.1109/ICMWI.2010.5648048","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5648048","url":null,"abstract":"A digital repository is a digital archive for depositing and providing access to digital contents. It harvests metadata for providing an access framework of digital content to multiple users. In existing systems, query and retrieval is done on centralized basis and do not consider semantics of the query. Since the repositories are distributed, distinct and autonomous, there is a need for a framework which is capable of providing an efficient integrated and semantically enriched query retrieval mechanism over multiple repositories. We have proposed and implemented a multi-agent based framework for querying multiple disjoint repositories that is equipped with well defined semantic web technologies such as ontology [7, 8]. The system has been implemented using Jena framework for semantic web, Jade for agents and Java Swing for user interfaces.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131251547","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5648174
A. Belbachir, F. Ingrand, S. Lacroix
In this paper, we describe a cooperative architecture in which multiple Autonomous Underwater Vehicles (AUVs) cooperate to locate underwater targets. Each AUV is endowed with a sensor that estimates its distance with respect to targets, and cooperate with others to explore an area with the help of an autonomous surface vehicle (ASV) that stores the gathered information map and acts as a communication hub between the AUVs. The communication constraints associated to this context preclude the re-use or adaptation of most of the existing approaches, and require dedicated strategies. In particular, rendezvous are required to exchange information between AUVs and the ASV and to monitor the mission execution. To provide the required autonomy to these vehicles, we build upon an existing system (T-REX), which provides an embedded planning and execution control framework. Simulation results are carried out to evaluate the proposed architecture and adaptive exploration strategy.
{"title":"Localizing underwater targets using a cooperative AUV architecture","authors":"A. Belbachir, F. Ingrand, S. Lacroix","doi":"10.1109/ICMWI.2010.5648174","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5648174","url":null,"abstract":"In this paper, we describe a cooperative architecture in which multiple Autonomous Underwater Vehicles (AUVs) cooperate to locate underwater targets. Each AUV is endowed with a sensor that estimates its distance with respect to targets, and cooperate with others to explore an area with the help of an autonomous surface vehicle (ASV) that stores the gathered information map and acts as a communication hub between the AUVs. The communication constraints associated to this context preclude the re-use or adaptation of most of the existing approaches, and require dedicated strategies. In particular, rendezvous are required to exchange information between AUVs and the ASV and to monitor the mission execution. To provide the required autonomy to these vehicles, we build upon an existing system (T-REX), which provides an embedded planning and execution control framework. Simulation results are carried out to evaluate the proposed architecture and adaptive exploration strategy.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":" 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132040579","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5648057
D. Bouchiha, M. Malki
Semantic Web Services (SWS) are enriching Web services with machine processable semantics. To be implemented with less effort, SWS can reuse syntactic and semantic descriptions hidden under the source code of Web applications already developed. For this end, we propose a framework for reengineering Web applications, possibly already including some semantic technology, into WSMO-based SWS. The proposed framework consists in reverse engineering Web applications towards conceptual models specified with a proposed UML profile, from what syntactic and semantic descriptions of new SWS are generated. A set of tools have been developed and some experiments have been carried out to evaluate and validate the proposed framework.
{"title":"Towards re-engineering Web applications into Semantic Web Services","authors":"D. Bouchiha, M. Malki","doi":"10.1109/ICMWI.2010.5648057","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5648057","url":null,"abstract":"Semantic Web Services (SWS) are enriching Web services with machine processable semantics. To be implemented with less effort, SWS can reuse syntactic and semantic descriptions hidden under the source code of Web applications already developed. For this end, we propose a framework for reengineering Web applications, possibly already including some semantic technology, into WSMO-based SWS. The proposed framework consists in reverse engineering Web applications towards conceptual models specified with a proposed UML profile, from what syntactic and semantic descriptions of new SWS are generated. A set of tools have been developed and some experiments have been carried out to evaluate and validate the proposed framework.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114574005","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 : 2010-11-29DOI: 10.1109/ICMWI.2010.5647973
Sid Ahmed Makhlouf, Belabbas Yagoubi
Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids and gives a certain Quality of Service (QoS) for grid users is the efficient co-allocation of jobs. Due to the lack of centralized control and the dynamic nature of resource availability, any successful co-allocation mechanism should be highly distributed and robust to the changes in the Grid environment. Moreover, it is desirable to have an co-allocation mechanism that does not rely on the availability of coherent global information. This work addresses those problems by describing and evaluating a grid distributed resources co-allocation mechanism using resources providers offers and the advance reservations. In our policy, a set of co-allocators agents receives and schedule a job to one or more resources agents based on a offers/demand mechanism. Offers act as a mechanism in which resources agents expose their interest in executing an entire job or only part of it. Each co-allocator agent selects computational resources based on best offers provided by the resources agents and distributes a job among various resources agents in order to speed up the job execution. The resources agents offers and use advance reservation mechanism to reserves the offers. We have introduced a regulator agent that intervenes to solve the conflicts of offers between one or more co-allocators agents. The main aims of our policy is to minimize the total time to execute all jobs (Makespen), minimize the waiting time of the users and maximize the resources utilization rate. The proposed policy has been verified through an extension of GridSim simulation toolkit and the simulation results confirm that the proposed approach allow us to achieve the most of our goals.
{"title":"Distributed resources co-allocation in grid computing","authors":"Sid Ahmed Makhlouf, Belabbas Yagoubi","doi":"10.1109/ICMWI.2010.5647973","DOIUrl":"https://doi.org/10.1109/ICMWI.2010.5647973","url":null,"abstract":"Computational grids have the potential for solving large-scale scientific problems using heterogeneous and geographically distributed resources. However, a number of major technical hurdles must overcome before this potential can be realized. One problem that is critical to effective utilization of computational grids and gives a certain Quality of Service (QoS) for grid users is the efficient co-allocation of jobs. Due to the lack of centralized control and the dynamic nature of resource availability, any successful co-allocation mechanism should be highly distributed and robust to the changes in the Grid environment. Moreover, it is desirable to have an co-allocation mechanism that does not rely on the availability of coherent global information. This work addresses those problems by describing and evaluating a grid distributed resources co-allocation mechanism using resources providers offers and the advance reservations. In our policy, a set of co-allocators agents receives and schedule a job to one or more resources agents based on a offers/demand mechanism. Offers act as a mechanism in which resources agents expose their interest in executing an entire job or only part of it. Each co-allocator agent selects computational resources based on best offers provided by the resources agents and distributes a job among various resources agents in order to speed up the job execution. The resources agents offers and use advance reservation mechanism to reserves the offers. We have introduced a regulator agent that intervenes to solve the conflicts of offers between one or more co-allocators agents. The main aims of our policy is to minimize the total time to execute all jobs (Makespen), minimize the waiting time of the users and maximize the resources utilization rate. The proposed policy has been verified through an extension of GridSim simulation toolkit and the simulation results confirm that the proposed approach allow us to achieve the most of our goals.","PeriodicalId":404577,"journal":{"name":"2010 International Conference on Machine and Web Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114609575","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
扫码关注我们
求助内容：
应助结果提醒方式：