Cloud computing has reached a high level of acceptance, both in academia and in industry. The maturity of the technology, along with the considerable business opportunity that has been promised, is the main responsible for its success. Nevertheless, today only few, very big players dominate the commercial panorama and take over market shares. From that position, they impose rigid pricing policies and quite inflexible negotiation schemes. When the ongoing cloud standardization process will complete, and thus full interoperability among clouds will be accomplished, new players will come into play. A real competition among cloud providers will then start based on key factors like the capability of providing flexible services tailored to specific, fine-grained customers' requirements. In this market scenario a mechanism must be devised to support the matchmaking between what providers offer and what customers demand. In this work we define a semantic model to help customers and providers to characterize their demands/offers, and propose the use of semantic tools to perform the matchmaking in such a way to maximize both the provider's and the customer's satisfaction.
{"title":"A Semantic Model for Utility Driven Discovery of Cloud Resources","authors":"G. Modica, O. Tomarchio","doi":"10.1109/CISIS.2012.78","DOIUrl":"https://doi.org/10.1109/CISIS.2012.78","url":null,"abstract":"Cloud computing has reached a high level of acceptance, both in academia and in industry. The maturity of the technology, along with the considerable business opportunity that has been promised, is the main responsible for its success. Nevertheless, today only few, very big players dominate the commercial panorama and take over market shares. From that position, they impose rigid pricing policies and quite inflexible negotiation schemes. When the ongoing cloud standardization process will complete, and thus full interoperability among clouds will be accomplished, new players will come into play. A real competition among cloud providers will then start based on key factors like the capability of providing flexible services tailored to specific, fine-grained customers' requirements. In this market scenario a mechanism must be devised to support the matchmaking between what providers offer and what customers demand. In this work we define a semantic model to help customers and providers to characterize their demands/offers, and propose the use of semantic tools to perform the matchmaking in such a way to maximize both the provider's and the customer's satisfaction.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115811220","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}
F. Carrino, A. Ridi, E. Mugellini, Omar Abou Khaled, R. Ingold
In this paper we propose an approach to address the gesture segmentation issue, an important concern strongly related to the gesture recognition field. Gesture segmentation has two main goals: first, detecting when a gesture begins and ends, second, understanding whether a gesture is meant to be meaningful for the machine or is a non-command gesture (such as gesticulation). This work proposes a novel hands-free, always-available approach for the gesture segmentation and recognition in which the user can communicate directly to the system through a wearable and "intimate" interface based on electromyography signals (EMG). The system addresses the well-known "gorilla-arm" problem recognizing subtle gestures and segmenting them through motionless gestures. We report experimental results indicating that the system is able to reliably detect and recognize subtle gestures, with minimal training across users with different muscle volumes, representing a consistent gesture segmentation approach. Finally, the usability tests showed that the system is easy to use and the subjects felt quickly confident with its utilization.
{"title":"Gesture Segmentation and Recognition with an EMG-Based Intimate Approach - An Accuracy and Usability Study","authors":"F. Carrino, A. Ridi, E. Mugellini, Omar Abou Khaled, R. Ingold","doi":"10.1109/CISIS.2012.173","DOIUrl":"https://doi.org/10.1109/CISIS.2012.173","url":null,"abstract":"In this paper we propose an approach to address the gesture segmentation issue, an important concern strongly related to the gesture recognition field. Gesture segmentation has two main goals: first, detecting when a gesture begins and ends, second, understanding whether a gesture is meant to be meaningful for the machine or is a non-command gesture (such as gesticulation). This work proposes a novel hands-free, always-available approach for the gesture segmentation and recognition in which the user can communicate directly to the system through a wearable and \"intimate\" interface based on electromyography signals (EMG). The system addresses the well-known \"gorilla-arm\" problem recognizing subtle gestures and segmenting them through motionless gestures. We report experimental results indicating that the system is able to reliably detect and recognize subtle gestures, with minimal training across users with different muscle volumes, representing a consistent gesture segmentation approach. Finally, the usability tests showed that the system is easy to use and the subjects felt quickly confident with its utilization.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124465113","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}
Due to the large number of protein structures whose functions are unknown, it becomes increasing important to study the structural characteristics of catalytic residues. Here, we use a novel method to calculate the local structural rigidity (LSR) of protein. Based on a dataset of 760 proteins, the results show that catalytic residues have distinct structural properties. They are shown to be extremely rigid based on the calculation of LSR. Finally, we present a machine-learning based method to predict catalytic residues from protein structure using LSR as primary input feature. The prediction sensitivity and specificity are 0.86 and 0.86, respectively, and the Matthew's correlation coefficient is 0.72.
{"title":"Prediction of Protein Catalytic Residues by Local Structural Rigidity","authors":"Yu-Tung Chien, Shao-Wei Huang","doi":"10.1109/CISIS.2012.99","DOIUrl":"https://doi.org/10.1109/CISIS.2012.99","url":null,"abstract":"Due to the large number of protein structures whose functions are unknown, it becomes increasing important to study the structural characteristics of catalytic residues. Here, we use a novel method to calculate the local structural rigidity (LSR) of protein. Based on a dataset of 760 proteins, the results show that catalytic residues have distinct structural properties. They are shown to be extremely rigid based on the calculation of LSR. Finally, we present a machine-learning based method to predict catalytic residues from protein structure using LSR as primary input feature. The prediction sensitivity and specificity are 0.86 and 0.86, respectively, and the Matthew's correlation coefficient is 0.72.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114281978","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}
Our research focuses on the identification and quantification of the impact that multi-core parallelization strategies have on the stability of the result of spiking neural networks simulations. We investigated Open MP-based implementations of the Spike Response Model and Spike Time-Dependent Plasticity for studying behaviors of biological neurons and synapses. The underlying neural microcircuits have small-world topologies. The simulation strategy is a synchronous one. The software development methodology we follow makes use of systematic unit testing and continuous integration, giving us a way to verify various perturbations of simulation results. We carried out investigations on systems having different multi-core processors. The processing speed (spikes/second) of our simulator scales well with the number of cores, but the parallel efficiency is moderate when all cores of the system are used in the simulation (0.57 for 12 cores e.g.). The primary outcomes of this work are twofold: One the one hand, the proposed parallel simulation strategies show a dynamic behavior unaltered by the use of multi-core specific technologies. On the other hand, we analyze issues met in our approach to multi-core simulations.
{"title":"Simulation of Biological Neural Microcircuits on Multi-core Systems","authors":"I. Muntean, M. Joldos","doi":"10.1109/CISIS.2012.196","DOIUrl":"https://doi.org/10.1109/CISIS.2012.196","url":null,"abstract":"Our research focuses on the identification and quantification of the impact that multi-core parallelization strategies have on the stability of the result of spiking neural networks simulations. We investigated Open MP-based implementations of the Spike Response Model and Spike Time-Dependent Plasticity for studying behaviors of biological neurons and synapses. The underlying neural microcircuits have small-world topologies. The simulation strategy is a synchronous one. The software development methodology we follow makes use of systematic unit testing and continuous integration, giving us a way to verify various perturbations of simulation results. We carried out investigations on systems having different multi-core processors. The processing speed (spikes/second) of our simulator scales well with the number of cores, but the parallel efficiency is moderate when all cores of the system are used in the simulation (0.57 for 12 cores e.g.). The primary outcomes of this work are twofold: One the one hand, the proposed parallel simulation strategies show a dynamic behavior unaltered by the use of multi-core specific technologies. On the other hand, we analyze issues met in our approach to multi-core simulations.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114822715","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}
Changwoo Ha, Ung Hwang, Gwanggil Jeon, Joong-Hwee Cho, Jechang Jeong
Recently automatic video surveillance in the digital video recording CCTV system is rapidly becoming one of the most accepted security system. The dangerous situations such as forest fire, flood, and terrorism are increasing, and cause serious casualty and property loss. In this paper, we particularly focus on the fire detection system in video. The proposed block-based fire detection algorithm consists of three basic steps. In the first step, we find motion vector utilizing optical flow and distinguish the suspect as fire region. In the second step, we conduct chromatic detection based on Lab color space. In the final step, we employ motion information for detecting the correct fire block by using the characteristics that fire goes almost upward. Experimental results show that the proposed method yields good performance for fire detection.
{"title":"Vision-Based Fire Detection Algorithm Using Optical Flow","authors":"Changwoo Ha, Ung Hwang, Gwanggil Jeon, Joong-Hwee Cho, Jechang Jeong","doi":"10.1109/CISIS.2012.25","DOIUrl":"https://doi.org/10.1109/CISIS.2012.25","url":null,"abstract":"Recently automatic video surveillance in the digital video recording CCTV system is rapidly becoming one of the most accepted security system. The dangerous situations such as forest fire, flood, and terrorism are increasing, and cause serious casualty and property loss. In this paper, we particularly focus on the fire detection system in video. The proposed block-based fire detection algorithm consists of three basic steps. In the first step, we find motion vector utilizing optical flow and distinguish the suspect as fire region. In the second step, we conduct chromatic detection based on Lab color space. In the final step, we employ motion information for detecting the correct fire block by using the characteristics that fire goes almost upward. Experimental results show that the proposed method yields good performance for fire detection.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115344190","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}
It is essential to get disabled people involved and connected to each other and to the rest of the society. Games can be used for this purpose as well as encouraging them to be active physically. However, many of the current interactive games interact with users through voice commands which could be a problem for the deaf/mute people. Microsoft Kinect opens a new aspect for the gaming industry. This hardware can interact with players through a 3D vision and sound detector. This means players can use their body movements as well as their voice commands to control the game environment. The aim of this paper is to develop a Kinect gesture-based game suitable for deaf/mute people. The Microsoft Kinect SDK for Windows is used to develop a game which recognize the gesture command and convert the sign to the text commands in the game (in this instance Microsoft Shape game). Therefore, the deaf/mute player can enjoy taking part in this interactive game. Conclusions are drawn on how researchers can adapt and develop the new game environment which is understandable and compatible with deaf/mute peoples' abilities.
让残疾人参与进来，相互联系，与社会其他部分联系起来，这是至关重要的。游戏可以用于这一目的，并鼓励他们进行身体活动。然而，目前许多互动游戏都是通过语音命令与用户互动，这对于聋哑人来说可能是个问题。微软Kinect为游戏行业开辟了一个新的领域。这种硬件可以通过3D视觉和声音探测器与玩家互动。这意味着玩家可以使用他们的身体动作和语音命令来控制游戏环境。本文的目的是开发一款适合聋哑人的基于Kinect手势的游戏。Microsoft Kinect SDK for Windows用于开发一款能够识别手势命令并将手势转换为游戏中的文本命令的游戏(在本例中为Microsoft Shape游戏)。因此，聋哑玩家可以享受参与这个互动游戏。结论是关于研究人员如何适应和开发新的游戏环境，使其易于理解并与聋哑人的能力相兼容。
{"title":"Developing a Gesture-Based Game for Deaf/Mute People Using Microsoft Kinect","authors":"Fakhteh Soltani, Fatemeh Eskandari, Shadan Golestan","doi":"10.1109/CISIS.2012.55","DOIUrl":"https://doi.org/10.1109/CISIS.2012.55","url":null,"abstract":"It is essential to get disabled people involved and connected to each other and to the rest of the society. Games can be used for this purpose as well as encouraging them to be active physically. However, many of the current interactive games interact with users through voice commands which could be a problem for the deaf/mute people. Microsoft Kinect opens a new aspect for the gaming industry. This hardware can interact with players through a 3D vision and sound detector. This means players can use their body movements as well as their voice commands to control the game environment. The aim of this paper is to develop a Kinect gesture-based game suitable for deaf/mute people. The Microsoft Kinect SDK for Windows is used to develop a game which recognize the gesture command and convert the sign to the text commands in the game (in this instance Microsoft Shape game). Therefore, the deaf/mute player can enjoy taking part in this interactive game. Conclusions are drawn on how researchers can adapt and develop the new game environment which is understandable and compatible with deaf/mute peoples' abilities.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123079587","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}
Maiko Shichijo, Ritsuko Watanabe, Eiji Aoki, K. Utsumiya
In this paper, we analyzed requests for consultation about the Internet troubles given to a regional network security center called Net An shin Center(NAC), discussing how to rescue victims involved in the troubles and what kind of educational and enlightenment activities about information moral not to become such victims should be performed.
{"title":"A Case Study on Consulting Services and Their Development in a Regional Network Security Center","authors":"Maiko Shichijo, Ritsuko Watanabe, Eiji Aoki, K. Utsumiya","doi":"10.1109/CISIS.2012.150","DOIUrl":"https://doi.org/10.1109/CISIS.2012.150","url":null,"abstract":"In this paper, we analyzed requests for consultation about the Internet troubles given to a regional network security center called Net An shin Center(NAC), discussing how to rescue victims involved in the troubles and what kind of educational and enlightenment activities about information moral not to become such victims should be performed.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122943043","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}
Increasingly, distributed systems have to deal with highly dynamic and hardly predictable environments. This trend, in conjunction with rising demands for sophisticated non-functional system requirements, challenges both the development and operation (i.e. management) of traditional distributed systems. One promising approach to cope with these challenges are self-adaptive distributed systems that are characterized by the capability to configure and maintain themselves. However, the inherent dynamic of self-adaptive systems requires intensive evaluation and benchmarking efforts in order to ensure the intended system behaviour. In order to support that, this paper presents a framework that aims at supporting the nominal-actual comparison of self-adaptive distributed systems as well as the comparison of different self-adaptive solutions with respect to a specific software implementation task. The underlying approach consists of (i) a declarative definition language and (ii) a software component that is capable of conducting evaluations and benchmarks on different software implementations.
{"title":"Benchmarking and Evaluation Support for Self-Adaptive Distributed Systems","authors":"A. Vilenica, W. Lamersdorf","doi":"10.1109/CISIS.2012.115","DOIUrl":"https://doi.org/10.1109/CISIS.2012.115","url":null,"abstract":"Increasingly, distributed systems have to deal with highly dynamic and hardly predictable environments. This trend, in conjunction with rising demands for sophisticated non-functional system requirements, challenges both the development and operation (i.e. management) of traditional distributed systems. One promising approach to cope with these challenges are self-adaptive distributed systems that are characterized by the capability to configure and maintain themselves. However, the inherent dynamic of self-adaptive systems requires intensive evaluation and benchmarking efforts in order to ensure the intended system behaviour. In order to support that, this paper presents a framework that aims at supporting the nominal-actual comparison of self-adaptive distributed systems as well as the comparison of different self-adaptive solutions with respect to a specific software implementation task. The underlying approach consists of (i) a declarative definition language and (ii) a software component that is capable of conducting evaluations and benchmarks on different software implementations.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126089457","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}
I. Arrieta-Salinas, F. Fariña, J. R. G. D. Mendívil, M. Raynal
The leader election problem consists in selecting a process (called leader) in a group of processes. Several leader election algorithms have been proposed in the past for ring networks, tree networks, fully connected networks or regular networks (such as tori and hypercubes). As far as ring networks are concerned, it has been shown that the number of messages that processes have to exchange to elect a leader is Ω(n log n). The algorithm proposed by Higham and Przytycka is the best leader algorithm known so far for ring networks in terms of message complexity, which is 1.271 n log n + O(n). This algorithm uses round numbers and assumes that all processes start with the same round number. More precisely, when round numbers are not initially equal, the algorithm has runs that do not terminate. This paper presents an algorithm, based on Higham-Przytycka's technique, which allows processes to start with different round numbers. This extension is motivated by fault-tolerance with respect to initial values. While the algorithm always terminates, its message complexity is optimal, i.e., O(n log n), when the processes start with the same round number and increases up to O(n2) when all processes start with different round number values. We call graceful degradation this additional property that combines fault-tolerance (with respect to initial values) and efficiency.
leader选举问题包括在一组进程中选择一个进程(称为leader)。对于环形网络、树形网络、全连接网络或规则网络(如环面和超立方体)，过去已经提出了几种leader选举算法。就环形网络而言，已有研究表明，进程为选举领导者而交换的消息数为Ω(n log n)。highham和Przytycka提出的算法是目前已知环形网络中消息复杂度最高的领导者算法，其消息复杂度为1.271 n log n + O(n)。该算法使用整数，并假设所有进程都以相同的整数开始。更准确地说，当整数初始值不相等时，算法的运行不会终止。本文提出了一种基于Higham-Przytycka技术的算法，该算法允许进程从不同的整数开始。这个扩展的动机是相对于初始值的容错性。虽然算法总是终止，但当进程以相同的整数开始时，其消息复杂度是最优的，即O(n log n);当所有进程以不同的整数开始时，其消息复杂度增加到O(n2)。我们将这种结合了容错性(相对于初始值)和效率的附加属性称为优雅降级。
{"title":"Leader Election: From Higham-Przytycka's Algorithm to a Gracefully Degrading Algorithm","authors":"I. Arrieta-Salinas, F. Fariña, J. R. G. D. Mendívil, M. Raynal","doi":"10.1109/cisis.2012.65","DOIUrl":"https://doi.org/10.1109/cisis.2012.65","url":null,"abstract":"The leader election problem consists in selecting a process (called leader) in a group of processes. Several leader election algorithms have been proposed in the past for ring networks, tree networks, fully connected networks or regular networks (such as tori and hypercubes). As far as ring networks are concerned, it has been shown that the number of messages that processes have to exchange to elect a leader is Ω(n log n). The algorithm proposed by Higham and Przytycka is the best leader algorithm known so far for ring networks in terms of message complexity, which is 1.271 n log n + O(n). This algorithm uses round numbers and assumes that all processes start with the same round number. More precisely, when round numbers are not initially equal, the algorithm has runs that do not terminate. This paper presents an algorithm, based on Higham-Przytycka's technique, which allows processes to start with different round numbers. This extension is motivated by fault-tolerance with respect to initial values. While the algorithm always terminates, its message complexity is optimal, i.e., O(n log n), when the processes start with the same round number and increases up to O(n2) when all processes start with different round number values. We call graceful degradation this additional property that combines fault-tolerance (with respect to initial values) and efficiency.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114188320","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}
G. Caragnano, Klodiana Goga, D. Brevi, H. A. Cozzetti, O. Terzo, R. Scopigno
Cloud computing is becoming increasingly popular for the provisioning of computing resources, in particular, through scientific tools that perform modeling or simulations. Vehicular Ad-Hoc Networks (VANETs) are mobile ad hoc networks which are meant to support primarily safety warnings and to manage challenging conditions to improve our transportation experience. This is a challenging context where large amounts of data need to be elaborated and analyzed in order to fully understand protocol and phenomena behaviors. In fact, VANET simulations are typically computationally intensive problems, and lend themselves for execution on distributed systems. A new hybrid cloud infrastructure is here presented to help and support the simulation science. This architecture optimizes the scheduling and execution of a batch of simulations, increasing the overall performance, in terms of simulation time and costs. Results clearly highlight the potentiality of this technology, proving as a valuable tool for network simulations.
{"title":"A Hybrid Cloud Infrastructure for the Optimization of VANET Simulations","authors":"G. Caragnano, Klodiana Goga, D. Brevi, H. A. Cozzetti, O. Terzo, R. Scopigno","doi":"10.1109/CISIS.2012.151","DOIUrl":"https://doi.org/10.1109/CISIS.2012.151","url":null,"abstract":"Cloud computing is becoming increasingly popular for the provisioning of computing resources, in particular, through scientific tools that perform modeling or simulations. Vehicular Ad-Hoc Networks (VANETs) are mobile ad hoc networks which are meant to support primarily safety warnings and to manage challenging conditions to improve our transportation experience. This is a challenging context where large amounts of data need to be elaborated and analyzed in order to fully understand protocol and phenomena behaviors. In fact, VANET simulations are typically computationally intensive problems, and lend themselves for execution on distributed systems. A new hybrid cloud infrastructure is here presented to help and support the simulation science. This architecture optimizes the scheduling and execution of a batch of simulations, increasing the overall performance, in terms of simulation time and costs. Results clearly highlight the potentiality of this technology, proving as a valuable tool for network simulations.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123238002","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
扫码关注我们
求助内容：
应助结果提醒方式：