Electricity has become a vital part of the modern life. Ever increasing electricity demand and inefficiency of the old electricity grid have led to the new vision which is called smart grid. Since, much work has been done to study the different aspects of the smart grid using computer and mathematical models. However little is done to combine those efforts to study the smart grid and ecodistrict in the same context. In this work we discuss the importance of the smart grid technologies in an ecodistrict development and the theoretical approaches for modeling smart grid and ecodistrict. Further more, we propose an agent-based model of ecodistricts with smart grid elements, by following a modeling approach called ASPECS. Though the simulations based on this kind of models can not be used as an exact predictive tools, it provides us with an exploratory tool to study how to integrate smart grid elements in an ecodistrict, and how different actors interact with each other.
{"title":"Agent based model of smart grids for ecodistricts","authors":"Murat Ahat, S. B. Amor, M. Bui","doi":"10.1145/2542050.2542058","DOIUrl":"https://doi.org/10.1145/2542050.2542058","url":null,"abstract":"Electricity has become a vital part of the modern life. Ever increasing electricity demand and inefficiency of the old electricity grid have led to the new vision which is called smart grid. Since, much work has been done to study the different aspects of the smart grid using computer and mathematical models. However little is done to combine those efforts to study the smart grid and ecodistrict in the same context. In this work we discuss the importance of the smart grid technologies in an ecodistrict development and the theoretical approaches for modeling smart grid and ecodistrict. Further more, we propose an agent-based model of ecodistricts with smart grid elements, by following a modeling approach called ASPECS. Though the simulations based on this kind of models can not be used as an exact predictive tools, it provides us with an exploratory tool to study how to integrate smart grid elements in an ecodistrict, and how different actors interact with each other.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124867608","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}
Designing interactive applications is a complex and error-prone activity, because of the importance of the human-computer interaction aspect. For the same reason, thoroughly testing such applications is particularly important and requires a lot of effort. Automating this activity can result to significant development cost reduction and quality improvement. This paper presents a research work aiming at defining a test modeling language for interactive applications based on task trees, called TTT. The objective of the TTT language is to provide a means for expressing abstract test scenarios for interactive applications, including non-deterministic choices and action occurrence probabilities that can be used to automate the test generation.
{"title":"A new test modeling language for interactive applications based on task trees","authors":"Le Thanh Long, N. Binh, I. Parissis","doi":"10.1145/2542050.2542081","DOIUrl":"https://doi.org/10.1145/2542050.2542081","url":null,"abstract":"Designing interactive applications is a complex and error-prone activity, because of the importance of the human-computer interaction aspect. For the same reason, thoroughly testing such applications is particularly important and requires a lot of effort. Automating this activity can result to significant development cost reduction and quality improvement. This paper presents a research work aiming at defining a test modeling language for interactive applications based on task trees, called TTT. The objective of the TTT language is to provide a means for expressing abstract test scenarios for interactive applications, including non-deterministic choices and action occurrence probabilities that can be used to automate the test generation.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130643820","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}
In this paper, we present fast approaches for object segmentation and surface restoration of indoor 3D point clouds, which are the results of 3D reconstruction methods or range scanners. These two problems are significant in constructing a augmented reality system using a range camera to build a virtual environment and provide the interaction mechanisms to the virtual model. For point-cloud segmentation, we apply a density-based clustering algorithm to extract the desired object after removing its ground planes. This low-complexity method gives stable results with high accuracy. After the segmented object has been removed, a restoration algorithm is proposed in such a case that the holes on the ground plane are revealed by removed objects. These holes are there because the corresponding surfaces are hidden by the segmented objects in the scanner phase. The process of filling the holes includes an object-ground-plane detection, a geometric restoration and a color fusion step. The newly added points are directly interpolated from the existing object points, which cover the holes in the original point clouds. Our approaches are experimented through a variety of test datasets and yield promising results.
{"title":"Restoring surfaces after removing objects in indoor 3D point clouds","authors":"N. Doan, Duy Pham, T. Dinh, T. Dinh","doi":"10.1145/2542050.2542088","DOIUrl":"https://doi.org/10.1145/2542050.2542088","url":null,"abstract":"In this paper, we present fast approaches for object segmentation and surface restoration of indoor 3D point clouds, which are the results of 3D reconstruction methods or range scanners. These two problems are significant in constructing a augmented reality system using a range camera to build a virtual environment and provide the interaction mechanisms to the virtual model. For point-cloud segmentation, we apply a density-based clustering algorithm to extract the desired object after removing its ground planes. This low-complexity method gives stable results with high accuracy. After the segmented object has been removed, a restoration algorithm is proposed in such a case that the holes on the ground plane are revealed by removed objects. These holes are there because the corresponding surfaces are hidden by the segmented objects in the scanner phase. The process of filling the holes includes an object-ground-plane detection, a geometric restoration and a color fusion step. The newly added points are directly interpolated from the existing object points, which cover the holes in the original point clouds. Our approaches are experimented through a variety of test datasets and yield promising results.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129502439","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}
In this paper, we propose a method that uses both semantic rules and machine learning to extract infectious disease events in Vietnamese electronic news, which can be used in a real-time system of monitoring the spread of diseases. Our method contains two important steps: detecting disease events from unstructured data and extracting information of the disease events. The event detection uses semantic rules and machine learning to detect a disease event; in the later step, Name Entity Recognition (NER), rules, and dictionaries are used to capture the event's information. The performance of detection step is ≈77,33% (F-score) and the precision of extraction step is ≈91,89%. These results are better that those of the experiments in which rules were not used. This indicates that our method is suitable for extracting disease events in Vietnamese text.
{"title":"Extraction of disease events for a real-time monitoring system","authors":"Minh-Tien Nguyen, Tri-Thanh Nguyen","doi":"10.1145/2542050.2542084","DOIUrl":"https://doi.org/10.1145/2542050.2542084","url":null,"abstract":"In this paper, we propose a method that uses both semantic rules and machine learning to extract infectious disease events in Vietnamese electronic news, which can be used in a real-time system of monitoring the spread of diseases. Our method contains two important steps: detecting disease events from unstructured data and extracting information of the disease events. The event detection uses semantic rules and machine learning to detect a disease event; in the later step, Name Entity Recognition (NER), rules, and dictionaries are used to capture the event's information. The performance of detection step is ≈77,33% (F-score) and the precision of extraction step is ≈91,89%. These results are better that those of the experiments in which rules were not used. This indicates that our method is suitable for extracting disease events in Vietnamese text.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128399204","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}
Keyword search is a user-friendly way to retrieve information from XML and relational database (RDB). There have been many approaches proposed for keyword search over XML and RDB. However, the existing approaches cannot fully exploit hidden semantics in XML document or RDB. This causes serious problems in processing some class of keyword queries. In this paper, we thoroughly point out mismatches between answers returned by existing approaches and the expectations of common users. Through detailed analysis of these mismatches, we show the importance of semantics in keyword search over XML and RDB and propose a semantics-based approach for processing XML and RDB keyword queries. Particularly, we propose to use Object Relationship (OR) data graph and Object Relationship Mixed (ORM) data graph, which fully capture semantics of object, relationship and attribute, to represent XML document and RDB respectively, and we develop algorithms based on the proposed data model to return more comprehensive answers.
{"title":"Semantics-based keyword search over XML and relational databases","authors":"T. Ling, T. Le, Zhong Zeng","doi":"10.1145/2542050.2542054","DOIUrl":"https://doi.org/10.1145/2542050.2542054","url":null,"abstract":"Keyword search is a user-friendly way to retrieve information from XML and relational database (RDB). There have been many approaches proposed for keyword search over XML and RDB. However, the existing approaches cannot fully exploit hidden semantics in XML document or RDB. This causes serious problems in processing some class of keyword queries. In this paper, we thoroughly point out mismatches between answers returned by existing approaches and the expectations of common users. Through detailed analysis of these mismatches, we show the importance of semantics in keyword search over XML and RDB and propose a semantics-based approach for processing XML and RDB keyword queries. Particularly, we propose to use Object Relationship (OR) data graph and Object Relationship Mixed (ORM) data graph, which fully capture semantics of object, relationship and attribute, to represent XML document and RDB respectively, and we develop algorithms based on the proposed data model to return more comprehensive answers.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121057704","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}
Trong Khanh Nguyen, N. Marilleau, Hô Tuòng Vinh, A. E. Fallah-Seghrouchni
Major researches in the domain of complex systems are interdisciplinary, collaborative/participative and geographically distributed. Therefore, the simulation of complex systems is usually a collaborative/participative work that highly demands the exchange, from distance, of participants. However, most of the actual simulators cannot support this exchange. In this paper, we will present a new method to create a participatory simulator supporting the collaboration/participation from distance in the complex system participatory simulation. The method includes: (i) a collaborative software infrastructure, named PAMS, containing common collaborative tools (videoconferencing, instant messaging, and many other communication tools) and specific tools dedicated to the simulation domain (sharing experiments, results, experience exchange and various type of manipulation tools) and (ii) a role-based meta-model facilitating the integration of actual simulators into PAMS.
{"title":"Method supporting collaboration in complex system participatory simulation","authors":"Trong Khanh Nguyen, N. Marilleau, Hô Tuòng Vinh, A. E. Fallah-Seghrouchni","doi":"10.1145/2542050.2542076","DOIUrl":"https://doi.org/10.1145/2542050.2542076","url":null,"abstract":"Major researches in the domain of complex systems are interdisciplinary, collaborative/participative and geographically distributed. Therefore, the simulation of complex systems is usually a collaborative/participative work that highly demands the exchange, from distance, of participants. However, most of the actual simulators cannot support this exchange. In this paper, we will present a new method to create a participatory simulator supporting the collaboration/participation from distance in the complex system participatory simulation. The method includes: (i) a collaborative software infrastructure, named PAMS, containing common collaborative tools (videoconferencing, instant messaging, and many other communication tools) and specific tools dedicated to the simulation domain (sharing experiments, results, experience exchange and various type of manipulation tools) and (ii) a role-based meta-model facilitating the integration of actual simulators into PAMS.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122432681","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}
Thai-Minh Truong, F. Amblard, B. Gaudou, C. Sibertin-Blanc, V. Truong, A. Drogoul, H. Huynh, M. N. Le
Integrated environmental modeling approaches, especially agent-based modeling ones, are increasingly used in large-scale decision support systems. A major consequence of this trend is the manipulation and generation of a huge amount of data in simulations, which require to be efficiently managed. In this paper, we present a Combination Framework of Business intelligence solution and Multi-agent platform (CFBM) and its implementation on the GAMA platform. CFBM is a logical framework dedicated to the management of the input and output data of simulations, as well as the corresponding empirical datasets in an integrated way and the analysis on integrated data, which we propose as a coupling of two major methodologies: Multi-Agent Simulation (MAS) on one hand and Business Intelligence (BI) solution on the other. An integrated model of a surveillance network and Brown Plant Hopper (BPH) invasion is presented. This model is used throughout the paper as a case study of CFBM regarding to the database accesses, the integration of internal and external processing, and the model validation tasks. We show how the proposed combination framework can be an appropriate choice for all decision-support systems with a huge data, hence the modelers can be also encouraged to develop the big model in a large scale.
{"title":"An implementation of framework of business intelligence for agent-based simulation","authors":"Thai-Minh Truong, F. Amblard, B. Gaudou, C. Sibertin-Blanc, V. Truong, A. Drogoul, H. Huynh, M. N. Le","doi":"10.1145/2542050.2542069","DOIUrl":"https://doi.org/10.1145/2542050.2542069","url":null,"abstract":"Integrated environmental modeling approaches, especially agent-based modeling ones, are increasingly used in large-scale decision support systems. A major consequence of this trend is the manipulation and generation of a huge amount of data in simulations, which require to be efficiently managed. In this paper, we present a Combination Framework of Business intelligence solution and Multi-agent platform (CFBM) and its implementation on the GAMA platform. CFBM is a logical framework dedicated to the management of the input and output data of simulations, as well as the corresponding empirical datasets in an integrated way and the analysis on integrated data, which we propose as a coupling of two major methodologies: Multi-Agent Simulation (MAS) on one hand and Business Intelligence (BI) solution on the other. An integrated model of a surveillance network and Brown Plant Hopper (BPH) invasion is presented. This model is used throughout the paper as a case study of CFBM regarding to the database accesses, the integration of internal and external processing, and the model validation tasks. We show how the proposed combination framework can be an appropriate choice for all decision-support systems with a huge data, hence the modelers can be also encouraged to develop the big model in a large scale.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133236635","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}
In the era of information explosion, a program is necessary to be scalable. Therefore, scalability analysis becomes very important in software verification and validation. However, current approaches to empirical scalability analysis remain limitations related to the number of supported models and performance. In this paper, we propose a runtime approach for estimating the program resource usage with two aims: evaluating the program scalability and revealing potential errors. In this approach, the resource usage of a program is first observed when it is executed on inputs with different scales, the observed results are then fitted on a model of the usage according to the program's input. Comparing to other approaches, ours supports diverse models to illustrate the resource usage, i.e., linear-log, power-law, polynomial, etc. We currently focus on the computation cost and stack frames usage as two representatives of resource usage, but the approach can be extended to other kinds of resource. The experimental result shows that our approach achieves more precise estimation and better performance than other state-of-the-art approaches.
{"title":"A runtime approach for estimating resource usage","authors":"Diep Bui Phi, Trong Khanh Nguyen, Viet-Ha Nguyen","doi":"10.1145/2542050.2542091","DOIUrl":"https://doi.org/10.1145/2542050.2542091","url":null,"abstract":"In the era of information explosion, a program is necessary to be scalable. Therefore, scalability analysis becomes very important in software verification and validation. However, current approaches to empirical scalability analysis remain limitations related to the number of supported models and performance. In this paper, we propose a runtime approach for estimating the program resource usage with two aims: evaluating the program scalability and revealing potential errors. In this approach, the resource usage of a program is first observed when it is executed on inputs with different scales, the observed results are then fitted on a model of the usage according to the program's input. Comparing to other approaches, ours supports diverse models to illustrate the resource usage, i.e., linear-log, power-law, polynomial, etc. We currently focus on the computation cost and stack frames usage as two representatives of resource usage, but the approach can be extended to other kinds of resource. The experimental result shows that our approach achieves more precise estimation and better performance than other state-of-the-art approaches.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125248417","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}
B. Quang, N. Quang, E. Medernach, V. Breton, Pham Quoc Long
Virtual screening has proven very effective on grid infrastructures where large scale deployments have led to the identification of active inhibitors for biological targets of interest against malaria, SARS or diabetes. Operating a dedicated virtual screening platform on grid resources requires optimizing the scheduling policy. The scheduling can be done at 2 levels; at site level and at platform level. Site scheduling is done at each site independently; each site is autonomous in its choice of job scheduling. Each site allocates time slots for different groups of users. Platform scheduling is done at group level: inside a time slot jobs from many users are allocated. Pilot agents are sent to sites and act as a container of actual users jobs. They pick up users jobs from a central queue where the second stage scheduling is done. In this paper, we focus on pilot-agent platform shared by many virtual screening users. They need a suitable scheduling algorithm to ensure a certain fairness between users. We have studied the scheduling of users jobs inside central queue and examined the relevance and impact of different scheduling policies (FIFO, SPT, LPT and Round Robin) on the user experience. Optimal criterion used in our research is the stretch, a measure for user experience on the platform. In a first step, we simulated the operation of virtual screening applications on the pilot-agent platform in order to compare the scheduling policies. According to simulation, SPT algorithm was shown to significantly improve scheduling performances. In a second step, the Shortest Processing Time (SPT) and Longest Processing Time (LPT) scheduling policies were implemented on a DIRAC pilot-agent platform at IFI in Hanoi and tested on EGI Biomed Virtual Organization. Experimental results are in good agreement with simulation and confirm that SPT algorithm significantly improves user experience. The relevance of our conclusions also extends to cloud computing. Indeed, cloud infrastructures are also characterized by limited machine availability.
{"title":"Stretch optimization for virtual screening on multi-user pilot-agent platforms on grid/cloud","authors":"B. Quang, N. Quang, E. Medernach, V. Breton, Pham Quoc Long","doi":"10.1145/2542050.2542063","DOIUrl":"https://doi.org/10.1145/2542050.2542063","url":null,"abstract":"Virtual screening has proven very effective on grid infrastructures where large scale deployments have led to the identification of active inhibitors for biological targets of interest against malaria, SARS or diabetes. Operating a dedicated virtual screening platform on grid resources requires optimizing the scheduling policy. The scheduling can be done at 2 levels; at site level and at platform level. Site scheduling is done at each site independently; each site is autonomous in its choice of job scheduling. Each site allocates time slots for different groups of users. Platform scheduling is done at group level: inside a time slot jobs from many users are allocated. Pilot agents are sent to sites and act as a container of actual users jobs. They pick up users jobs from a central queue where the second stage scheduling is done. In this paper, we focus on pilot-agent platform shared by many virtual screening users. They need a suitable scheduling algorithm to ensure a certain fairness between users. We have studied the scheduling of users jobs inside central queue and examined the relevance and impact of different scheduling policies (FIFO, SPT, LPT and Round Robin) on the user experience. Optimal criterion used in our research is the stretch, a measure for user experience on the platform. In a first step, we simulated the operation of virtual screening applications on the pilot-agent platform in order to compare the scheduling policies. According to simulation, SPT algorithm was shown to significantly improve scheduling performances. In a second step, the Shortest Processing Time (SPT) and Longest Processing Time (LPT) scheduling policies were implemented on a DIRAC pilot-agent platform at IFI in Hanoi and tested on EGI Biomed Virtual Organization. Experimental results are in good agreement with simulation and confirm that SPT algorithm significantly improves user experience. The relevance of our conclusions also extends to cloud computing. Indeed, cloud infrastructures are also characterized by limited machine availability.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132101077","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}
Recently, with the overwhelming growth of Cloud Computing (CC) and mobile devices, Mobile Cloud Computing (MCC) has emerged and become an attractive area of research. Unlike CC, MCC is formed from the properties of mobile devices such as hardware limitation, mobility, etc. Through MCC, the cloud resources are utilized to support mobile devices in heavy computing services and leverage mobile cloud service efficiently. In this talk, we will present an overview of MCC with our on-going deployed architecture, which involves tremendous potential mobile cloud services in future. In addition, mobile devices -based virtual desktop infrastructure (mVDI) emerges an efficient and convenient method in MCC. Relying on the current remote desktop technology to access to VMs on cloud, mobile devices can easily communicate, and utilize the cloud resources. All computational complexity is executed on the cloud servers rather than on mobile devices. Since offloading computing tasks to the cloud, we can run any services/applications regardless of capability of mobile devices. Consolidating many users into mVDI environment can significantly lower IT management expenses and enables new features such as "available-anywhere" desktops. However, there are many barriers to broad adoption including the slow performance of virtualized I/O, CPU scheduling interference problems. In this talk, we will discuss trends and issues, also the corresponding solutions and challenges in future mobile service through Cloud Computing including mobile cloud services, mobile virtualization, mobile DaaS, N-Screened mobile services and mVDI. From this talk, effective business model is also covered by connecting between mobile contents, platform, wearable devices and cloud infrastructure. Also, some implemented test results will be shared to help audiences for future mobile cloud service design.
{"title":"Data mobile cloud technology: mVDI","authors":"E. Huh","doi":"10.1145/2542050.2542052","DOIUrl":"https://doi.org/10.1145/2542050.2542052","url":null,"abstract":"Recently, with the overwhelming growth of Cloud Computing (CC) and mobile devices, Mobile Cloud Computing (MCC) has emerged and become an attractive area of research. Unlike CC, MCC is formed from the properties of mobile devices such as hardware limitation, mobility, etc. Through MCC, the cloud resources are utilized to support mobile devices in heavy computing services and leverage mobile cloud service efficiently. In this talk, we will present an overview of MCC with our on-going deployed architecture, which involves tremendous potential mobile cloud services in future. In addition, mobile devices -based virtual desktop infrastructure (mVDI) emerges an efficient and convenient method in MCC. Relying on the current remote desktop technology to access to VMs on cloud, mobile devices can easily communicate, and utilize the cloud resources. All computational complexity is executed on the cloud servers rather than on mobile devices. Since offloading computing tasks to the cloud, we can run any services/applications regardless of capability of mobile devices. Consolidating many users into mVDI environment can significantly lower IT management expenses and enables new features such as \"available-anywhere\" desktops. However, there are many barriers to broad adoption including the slow performance of virtualized I/O, CPU scheduling interference problems. In this talk, we will discuss trends and issues, also the corresponding solutions and challenges in future mobile service through Cloud Computing including mobile cloud services, mobile virtualization, mobile DaaS, N-Screened mobile services and mVDI. From this talk, effective business model is also covered by connecting between mobile contents, platform, wearable devices and cloud infrastructure. Also, some implemented test results will be shared to help audiences for future mobile cloud service design.","PeriodicalId":246033,"journal":{"name":"Proceedings of the 4th Symposium on Information and Communication Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116887430","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
扫码关注我们
求助内容：
应助结果提醒方式：