Tetsuya Oda, Admir Barolli, Evjola Spaho, L. Barolli, F. Xhafa, M. Takizawa
{"title":"Performance Evaluation of WMN-GA System for Low Densities of Clients and Different Settings of Population Size","authors":"Tetsuya Oda, Admir Barolli, Evjola Spaho, L. Barolli, F. Xhafa, M. Takizawa","doi":"10.1109/CISIS.2012.59","DOIUrl":"https://doi.org/10.1109/CISIS.2012.59","url":null,"abstract":"Wireless Mesh Networks (WMNs) distinguish for they low cost nature that makes them very attractive for providing wireless Internet connectivity. Such infrastructures can be used to deploy community networks, metropolitan area networks, municipal and corporative networks, and to support applications for urban areas, medical, transport and surveillance systems. The main issues in WMNs are achievement of network connectivity and stability as well as QoS in terms of user coverage. In this paper, we propose a system for solving the node placement problem in WMNs. We evaluate the performance of WMN-GA for three different settings of population size 8, 64 and 512. For evaluation, we consider giant component and the number of covered users parameters. The simulation results shows that with the increasing of the population size, GA obtains better result. However, with the increase of the population size, the GA needs more computational time.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"1 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":"115376829","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
{"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}
Maiko Shichijo, Ritsuko Watanabe, Eiji Aoki, K. Utsumiya
{"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}
{"title":"Energy-Efficient Server Selection Algorithm Based on the Extended Simple Power Consumption Model","authors":"T. Enokido, M. Takizawa","doi":"10.1109/CISIS.2012.29","DOIUrl":"https://doi.org/10.1109/CISIS.2012.29","url":null,"abstract":"In information systems, a client first selects a server in a cluster of servers and issues a request to the server. The request is performed as a process in the server. In this paper, we consider a computation process which mainly consumes CPU resource. Cooling devices like fans consume the electric power in addition to CPU and other devices in a server. The rotation speed of a fan is changed in servers according to the temperature of a server. Thus, the total power consumption of a server depends on not only computational devices like CPU but also cooling devices. The extended simple power consumption (ESPC) model of a server is proposed to perform processes. In this paper, the ESPC model is improved to consider a server with a multi-core CPU. It is critical to discuss how to select a server for each request from clients in order to not only achieve performance objectives but also reduce the total power consumption of a system based on the ESPC model. The improved power consumption laxity based (IPCLB) algorithm for selecting a server is proposed in this paper, which consumes the minimum power to perform the process. We evaluate the ESPC model and the IPCLB algorithm in terms of the power consumption and elapse time in this paper.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"103 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":"123193868","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}
{"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}
{"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}
I. Arrieta-Salinas, F. Fariña, J. R. G. D. Mendívil, M. Raynal
{"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}
{"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}
F. Carrino, A. Ridi, E. Mugellini, Omar Abou Khaled, R. Ingold
{"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}
J. Polajnar, Narek Nalbandyan, Omid Alemi, D. Polajnar
{"title":"An Interaction Protocol for Mutual Assistance in Agent Teamwork","authors":"J. Polajnar, Narek Nalbandyan, Omid Alemi, D. Polajnar","doi":"10.1109/CISIS.2012.169","DOIUrl":"https://doi.org/10.1109/CISIS.2012.169","url":null,"abstract":"This paper proposes and explores an interaction protocol for incorporating helpful behavior into agent teamwork. In the proposed Mutual Assistance Protocol (MAP), an agent can directly assist a teammate who requests help, provided that the two agents jointly determine, based on their individual beliefs, that the expected outcome of the help act is in the interest of the team. This distributed decision is reached through a bidding sequence similar to the one in the Contract Net Protocol. The deliberation about help is approximate in that each agent only assesses the team impact of the change to its own individual plan. The paper introduces two versions of the protocol: Action MAP, in which the helper performs an action within a teammate's individual plan, and Resource MAP, in which one or more helpers provide resources to a teammate. Both versions include refinements for the handling of simultaneous help requests. A cooperative game simulation demonstrates the advantages of Action MAP over action help protocols that use unilateral decision mechanisms, and over teamwork scenarios without help. The experiments show how the team performance depends on: the teammates' mutual awareness of each other's abilities, dynamic disturbance in the environment, communication costs, and computation costs.","PeriodicalId":158978,"journal":{"name":"2012 Sixth International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"4 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":"129007850","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}