Pub Date : 2014-06-04DOI: 10.1109/I4CS.2014.6860555
Sebastien Linck, E. Perrin, Dimitry Zekrouf
AlgoPath is an entertainment program to help students with no classical computer science background understand the main concepts of algorithmics. It looks like a serious game in which the player builds a world of concrete, paths and grass. We show in this paper that the inner model of AlgoPath is based on the Model-View-Controller architecture (MVC). We intend to add a virtual teacher in this architecture, who oversees the players' interactions and intervenes when the interactions do not correspond to what is expected by a real teacher. We explain how the model of the virtual teacher interacts with the Controller component of the architecture. We describe the model that lets a real teacher add his particular comments for the various mistakes that can be made by a player. We explore the solutions to implement two multiplayer gameplay types: a competitive one, in which two or several players fight against one another to be the first to find the best algorithm, and a collaborative one, in which they have to find the best algorithm as a team. Finally, we explain our choice to develop the distributed version of AlgoPath with Unity.
{"title":"About including a virtual teacher in a competitive or collaborative context in AlgoPath","authors":"Sebastien Linck, E. Perrin, Dimitry Zekrouf","doi":"10.1109/I4CS.2014.6860555","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860555","url":null,"abstract":"AlgoPath is an entertainment program to help students with no classical computer science background understand the main concepts of algorithmics. It looks like a serious game in which the player builds a world of concrete, paths and grass. We show in this paper that the inner model of AlgoPath is based on the Model-View-Controller architecture (MVC). We intend to add a virtual teacher in this architecture, who oversees the players' interactions and intervenes when the interactions do not correspond to what is expected by a real teacher. We explain how the model of the virtual teacher interacts with the Controller component of the architecture. We describe the model that lets a real teacher add his particular comments for the various mistakes that can be made by a player. We explore the solutions to implement two multiplayer gameplay types: a competitive one, in which two or several players fight against one another to be the first to find the best algorithm, and a collaborative one, in which they have to find the best algorithm as a team. Finally, we explain our choice to develop the distributed version of AlgoPath with Unity.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126078629","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 : 2014-06-04DOI: 10.1109/I4CS.2014.6860561
Frédéric Blanchard, A. A. Younes, M. Herbin
This contribution addresses the problem of extracting some representative data from complex datasets and connecting them in a directed forest. First we define a degree of representativeness (DoR) based on the Borda aggregation procedure. Secondly we present a method to connect pairwise data using neighborhoods and the DoR as an objective function. We then present three case studies as a proof of concept: unsupervised grouping of binary images, analysis of co-authorships in a research team and structuration of a medical patient-oriented database for a case-based reasoning use.
{"title":"Structuring complex data using representativeness graphs","authors":"Frédéric Blanchard, A. A. Younes, M. Herbin","doi":"10.1109/I4CS.2014.6860561","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860561","url":null,"abstract":"This contribution addresses the problem of extracting some representative data from complex datasets and connecting them in a directed forest. First we define a degree of representativeness (DoR) based on the Borda aggregation procedure. Secondly we present a method to connect pairwise data using neighborhoods and the DoR as an objective function. We then present three case studies as a proof of concept: unsupervised grouping of binary images, analysis of co-authorships in a research team and structuration of a medical patient-oriented database for a case-based reasoning use.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128394805","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 : 2014-06-04DOI: 10.1109/I4CS.2014.6860551
Leendert W. M. Wienhofen, C. Lindkvist, M. Noebels
CoSSMic (Collaborating Smart Solar powered Micro-grids) is an EU funded project aimed at developing a system for smart management and control of solar energy. The system must be relevant to a community of end-users and other stakeholders. Two processes are described here to contribute in meeting this aim, user-centered design and lean startup product design. We describe an iterative approach to the design of the system which incorporates these two processes and the impact it has had on results.
{"title":"User-centered design for smart solar-powered micro-grid communities","authors":"Leendert W. M. Wienhofen, C. Lindkvist, M. Noebels","doi":"10.1109/I4CS.2014.6860551","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860551","url":null,"abstract":"CoSSMic (Collaborating Smart Solar powered Micro-grids) is an EU funded project aimed at developing a system for smart management and control of solar energy. The system must be relevant to a community of end-users and other stakeholders. Two processes are described here to contribute in meeting this aim, user-centered design and lean startup product design. We describe an iterative approach to the design of the system which incorporates these two processes and the impact it has had on results.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122584565","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 : 2014-06-04DOI: 10.1109/I4CS.2014.6860546
Rejaul Chowdhury, A. Shami, K. Almustafa
Due to the emergence of numerous bandwidth-hungry applications, we are motivated to investigate cheaper and faster Internet access solutions to serve in a neighborhood. We concentrate on the convergence of optical and wireless networks for the deployment of Internet access networks so that we can exploit the opportunities of both technologies. We focus on network dimensioning and placement of equipment in hybrid optical-wireless access networks. A number of integrated optical-wireless architectures have been investigated for the greenfield deployment of future access networks. A novel hybrid network infrastructure, namely PON-LTE-WiFi, has been proposed where fiber will be deployed as deeply as affordable/practical and then, wireless systems will be used to extend this connectivity to a large number of locations and ultimately connect the wireless end users. We propose a 3-phase network design optimization scheme for greenfield deployment of PON-LTE-WiFi access network infrastructure. Finally, we propose an ILP model which optimizes the greenfield deployment of LTE network based on the static distribution of mobile user equipment (MUE). The proposed model takes into account various physical layer constraints of LTE network and determines the optimal clustering of MUEs as well as the location of eNBs in a neighborhood. Computational experiments have been conducted on three different data sets consisting of 128, 256 and 512 mobile user equipment in order to evaluate the performance of the proposed scheme.
{"title":"Designing of next-generation hybrid optical-wireless access network","authors":"Rejaul Chowdhury, A. Shami, K. Almustafa","doi":"10.1109/I4CS.2014.6860546","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860546","url":null,"abstract":"Due to the emergence of numerous bandwidth-hungry applications, we are motivated to investigate cheaper and faster Internet access solutions to serve in a neighborhood. We concentrate on the convergence of optical and wireless networks for the deployment of Internet access networks so that we can exploit the opportunities of both technologies. We focus on network dimensioning and placement of equipment in hybrid optical-wireless access networks. A number of integrated optical-wireless architectures have been investigated for the greenfield deployment of future access networks. A novel hybrid network infrastructure, namely PON-LTE-WiFi, has been proposed where fiber will be deployed as deeply as affordable/practical and then, wireless systems will be used to extend this connectivity to a large number of locations and ultimately connect the wireless end users. We propose a 3-phase network design optimization scheme for greenfield deployment of PON-LTE-WiFi access network infrastructure. Finally, we propose an ILP model which optimizes the greenfield deployment of LTE network based on the static distribution of mobile user equipment (MUE). The proposed model takes into account various physical layer constraints of LTE network and determines the optimal clustering of MUEs as well as the location of eNBs in a neighborhood. Computational experiments have been conducted on three different data sets consisting of 128, 256 and 512 mobile user equipment in order to evaluate the performance of the proposed scheme.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133122289","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 : 2014-06-04DOI: 10.1109/I4CS.2014.6860562
G. Blot, P. Saurel, F. Rousseaux
“For what else is this collection but a disorder to which habit has accommodated itself to such an extent that it can appear as order?”. Unpacking his library, Walter Benjamin describes how a collection is singular [2]. Collections are not unified wholes, but rather chains of undefined objects. Classify, search, arrange or browse collections are personal processes influenced by internal reflexions. Working on figural and non-figural collections, Piaget and Inhelder explain how space and time influence the way a collector looks to his collection [13]. As a result, representing collections is an issue for computer scientists. Here, we propose a time-based method, which consideres chronological events and draws a time-weighted graph defining patterns of items. We therefore show how this graph outputs different results depending on when it is requested. This work is based on an architecture, designed by Openrendezvous.com, a collaborative web-based application helping to make appointments. Our goal is to adapt a social graph used to define the perfect moment for two people to meet, to the collection case. We discuss how we can build a structure that helps to compute the ideal moment for an item to meet a collector.
{"title":"Time-weighted Social Network: Predict when an item will meet a collector","authors":"G. Blot, P. Saurel, F. Rousseaux","doi":"10.1109/I4CS.2014.6860562","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860562","url":null,"abstract":"“For what else is this collection but a disorder to which habit has accommodated itself to such an extent that it can appear as order?”. Unpacking his library, Walter Benjamin describes how a collection is singular [2]. Collections are not unified wholes, but rather chains of undefined objects. Classify, search, arrange or browse collections are personal processes influenced by internal reflexions. Working on figural and non-figural collections, Piaget and Inhelder explain how space and time influence the way a collector looks to his collection [13]. As a result, representing collections is an issue for computer scientists. Here, we propose a time-based method, which consideres chronological events and draws a time-weighted graph defining patterns of items. We therefore show how this graph outputs different results depending on when it is requested. This work is based on an architecture, designed by Openrendezvous.com, a collaborative web-based application helping to make appointments. Our goal is to adapt a social graph used to define the perfect moment for two people to meet, to the collection case. We discuss how we can build a structure that helps to compute the ideal moment for an item to meet a collector.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125430744","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 : 2014-06-04DOI: 10.1109/I4CS.2014.6860548
R. Haraty, Mirna Zbib
With the advancement of Internet technology, securing information systems from electronic attacks has become a significant concern. With all the preventive methods, malicious users still find new ways to overcome the system security and access and modify sensitive information. To make the process of damage assessment and recovery fast and effective (not scanning the entire log), researchers have proposed different methods for segmenting the log file, and accordingly presented different damage assessment and recovery algorithms. In this work we present efficient damage assessment and recovery algorithms to recover from malicious transactions in a database based on the concept of the matrix. We also compare the various approaches and present the performance results.
{"title":"A matrix-based damage assessment and recovery algorithm","authors":"R. Haraty, Mirna Zbib","doi":"10.1109/I4CS.2014.6860548","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860548","url":null,"abstract":"With the advancement of Internet technology, securing information systems from electronic attacks has become a significant concern. With all the preventive methods, malicious users still find new ways to overcome the system security and access and modify sensitive information. To make the process of damage assessment and recovery fast and effective (not scanning the entire log), researchers have proposed different methods for segmenting the log file, and accordingly presented different damage assessment and recovery algorithms. In this work we present efficient damage assessment and recovery algorithms to recover from malicious transactions in a database based on the concept of the matrix. We also compare the various approaches and present the performance results.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122473126","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 : 2014-06-04DOI: 10.1109/I4CS.2014.6860554
J. Roth
In this paper we present an approach to predict a target of a mobile user on the move. After observing the movement from a starting point, we are able to create possible extrapolations of routes. Our basic assumption: a mobile user tries to move efficiently, thus only a certain set of destinations is reasonable. We use a road network that contains information about movement costs to detect reasonable movements, but we do not expect theoretical optimal paths. We are able to model different efficiency goals and different degrees of optimality. We present an efficient algorithm to actually compute the set of reasonable targets that avoids brute force computation. In contrast to existing work to predict route destinations, we do not require a learning phase to collect an archive of former routes.
{"title":"Predicting route targets based on optimality considerations","authors":"J. Roth","doi":"10.1109/I4CS.2014.6860554","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860554","url":null,"abstract":"In this paper we present an approach to predict a target of a mobile user on the move. After observing the movement from a starting point, we are able to create possible extrapolations of routes. Our basic assumption: a mobile user tries to move efficiently, thus only a certain set of destinations is reasonable. We use a road network that contains information about movement costs to detect reasonable movements, but we do not expect theoretical optimal paths. We are able to model different efficiency goals and different degrees of optimality. We present an efficient algorithm to actually compute the set of reasonable targets that avoids brute force computation. In contrast to existing work to predict route destinations, we do not require a learning phase to collect an archive of former routes.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133572379","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 : 2014-06-04DOI: 10.1109/I4CS.2014.6860559
Jose M. Lopez, T. Rübsamen, D. Westhoff
In this paper, we provide privacy enhancements for a software agent-based audit system for clouds. We also propose a general privacy enhancing cloud audit concept which, we do present based on a recently proposed framework. This framework introduces the use of audit agents for collecting digital evidence from different sources in cloud environments. Obviously, the elicitation and storage of such evidence leads to new privacy concerns of cloud customers, since it may reveal sensitive information about the utilization of cloud services. We remedy this by applying Somewhat Homomorphic Encryption (SHE) and Public-Key Searchable Encryption (PEKS) to the collection of digital evidence. By considering prominent audit event use cases we show that the amount of cleartext information provided to an evidence storing entity and subsequently to a third-party auditor can be shaped in a good balance taking into account both, i) the customers' privacy and ii) the fact that stored information may need to have probative value. We believe that the administrative domain responsible for an evidence storing database falls under the adversary model "honest-but-curious" and thus should perform query responses from the auditor with respect to a given cloud audit use case by purely performing operations on encrypted digital evidence data.
{"title":"Privacy-friendly cloud audits with Somewhat Homomorphic and Searchable Encryption","authors":"Jose M. Lopez, T. Rübsamen, D. Westhoff","doi":"10.1109/I4CS.2014.6860559","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860559","url":null,"abstract":"In this paper, we provide privacy enhancements for a software agent-based audit system for clouds. We also propose a general privacy enhancing cloud audit concept which, we do present based on a recently proposed framework. This framework introduces the use of audit agents for collecting digital evidence from different sources in cloud environments. Obviously, the elicitation and storage of such evidence leads to new privacy concerns of cloud customers, since it may reveal sensitive information about the utilization of cloud services. We remedy this by applying Somewhat Homomorphic Encryption (SHE) and Public-Key Searchable Encryption (PEKS) to the collection of digital evidence. By considering prominent audit event use cases we show that the amount of cleartext information provided to an evidence storing entity and subsequently to a third-party auditor can be shaped in a good balance taking into account both, i) the customers' privacy and ii) the fact that stored information may need to have probative value. We believe that the administrative domain responsible for an evidence storing database falls under the adversary model \"honest-but-curious\" and thus should perform query responses from the auditor with respect to a given cloud audit use case by purely performing operations on encrypted digital evidence data.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130352970","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 : 2014-06-04DOI: 10.1109/I4CS.2014.6860547
Y. Gourhant, E. Lukashova, Malla Reddy Sama, S. Wahed, Djamal-Eddine Meddour, D. Venmani
The emergence of Internet access and advanced wireless technologies has its limitations across the globe, i.e. today there exist several rural regions, especially in developing countries, that do not afford Internet connectivity. In this paper, we present a design of a cost-effective wireless network architecture that aims at providing Internet in fix-usage within those countries. We claim that with few design changes to the 3GPP architecture, it is possible to extend Internet connectivity within suburban and rural areas by deploying numerous hotspots based on sharing tasks and revenues with local actors.
{"title":"Low-cost wireless network architecture for developing countries","authors":"Y. Gourhant, E. Lukashova, Malla Reddy Sama, S. Wahed, Djamal-Eddine Meddour, D. Venmani","doi":"10.1109/I4CS.2014.6860547","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860547","url":null,"abstract":"The emergence of Internet access and advanced wireless technologies has its limitations across the globe, i.e. today there exist several rural regions, especially in developing countries, that do not afford Internet connectivity. In this paper, we present a design of a cost-effective wireless network architecture that aims at providing Internet in fix-usage within those countries. We claim that with few design changes to the 3GPP architecture, it is possible to extend Internet connectivity within suburban and rural areas by deploying numerous hotspots based on sharing tasks and revenues with local actors.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128797294","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 : 2014-06-04DOI: 10.1109/I4CS.2014.6860545
Damien Le Quéré, C. Betoule, R. Clavier, G. Thouénon, Y. H. Aoul, A. Ksentini
This paper proposes LOCARN: an alternative network architecture providing a packet connectivity layer, which is able to self-adapt its routing paths to both the effective traffics fluctuations and network resources changes. Moving close to a global maximization of available resources usage and assuming high resiliency under failures, this radical architecture focuses on architectural components coupling simplicity and plug-and-play guidance. Through analysis and computer simulation, several performance metrics focusing on scalability are evaluated.
{"title":"Scalability & performances evaluation of LOCARN: Low Opex and Capex Architecture for Resilient Networks","authors":"Damien Le Quéré, C. Betoule, R. Clavier, G. Thouénon, Y. H. Aoul, A. Ksentini","doi":"10.1109/I4CS.2014.6860545","DOIUrl":"https://doi.org/10.1109/I4CS.2014.6860545","url":null,"abstract":"This paper proposes LOCARN: an alternative network architecture providing a packet connectivity layer, which is able to self-adapt its routing paths to both the effective traffics fluctuations and network resources changes. Moving close to a global maximization of available resources usage and assuming high resiliency under failures, this radical architecture focuses on architectural components coupling simplicity and plug-and-play guidance. Through analysis and computer simulation, several performance metrics focusing on scalability are evaluated.","PeriodicalId":226884,"journal":{"name":"2014 14th International Conference on Innovations for Community Services (I4CS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131456578","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
扫码关注我们
求助内容：
应助结果提醒方式：