Juan F. R. Herrera, L. G. Casado, E. Hendrix, R. Paulavičius, J. Žilinskas
{"title":"Dynamic and hierarchical load-balancing techniques applied to parallel branch-and-bound methods","authors":"Juan F. R. Herrera, L. G. Casado, E. Hendrix, R. Paulavičius, J. Žilinskas","doi":"10.1109/3PGCIC.2013.85","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.85","url":null,"abstract":"Most Lipschitzian Global Optimization algorithms perform an exhaustive search using a branch-and-bound (B&B) scheme. The question is how to run multi-dimensional Lipschitz Global Optimization in parallel, such that the implementation depending on the used platform is efficient. Previous work shows a parallel version developed for multicore nodes with two levels of parallelism: intra-node and inter-node. On intra-node level, one can perform dynamic load balancing by generating threads dynamically. Threads end when they complete their assigned work. The inter-node level carries out a static load balancing using MPI. In general, algorithm design depends on the characteristics of problems to be solved. There are several ways to improve performance of general parallel B&B algorithms. Specifically, we are interested in how to apply them to parallel Lipschitz Global Optimization algorithms. Operations like selecting the next subproblem to be evaluated become critical in parallel B&B schemes. We study Depth and Hybrid (Best-Depth) options as selection criterion. Previous work, using only MPI or OpenMP, discard not only the broadcasting of the best found upper bound of the solution due to its high average cost/performance but also the use of dynamic load balancing. Here we check how broadcasting the upper bound affects the developed MPI-Pthreads algorithm. Additionally, we study how to perform dynamic load balancing at inter-node level. Experimental results show which designs perform better on which type of instances for the used computational architecture.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126349615","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":"Model Driven Engineering for Building Automation, a Research Agenda","authors":"Philip Luyckx, P. Hellinckx, H. Vangheluwe","doi":"10.1109/3PGCIC.2013.83","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.83","url":null,"abstract":"This paper introduces a Model Driven Engineering (MDE) development process for building automation applications. Currently, those applications are often written for Programmable Logic Controllers (PLCs) in one of the supported modeling languages such as structured text, ladder diagrams and grafcets. The consequences of this approach are that (1) PLC experts are needed to develop the application, (2) it is difficult to verify the application's correctness and (3) when introducing other technologies such as embedded micro controllers, even more experts are needed. This paper proposes an MDE development process that addresses these problems. The use of a domain specific language eliminates the need for PLC experts, and developers can concentrate on the development of the building automation application. Models of the system or a transformation of those models to Discrete Event System Specification (DEVS), State chart, or Causal Block Diagram (CBD) formalisms can be used to verify, simulate and optimize the application based on user needs. In a last step, the code for the target platforms can be generated directly from the verified and optimized models.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127995800","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":"Large-Scale Home Care Crew Scheduling with a Parallel Evolutionary Algorithm","authors":"F. Luna, Alejandro Cervantes, P. I. Viñuela","doi":"10.1109/3PGCIC.2013.102","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.102","url":null,"abstract":"As the population ages, the demand for home health care services is increasing currently, and is expecting to keep growing in the future. To cope with this increasing demand, effective planning approaches for assigning caregivers to vistis at patients' home are required. The aim of this paper is to address this planning problem with parallel a (1 + lambda) evolutionary algorithm. A master/worker parallel model has been used, but with enhanced mechanisms to enable the algorithm to efficiently involve a large number of workers in the computation. By using 4 different, large, real-world instances provided by a private company, different settings of lambda for an increasing number of workers have been evaluated. The baseline for the comparison is set by the solutions already implemented by the company. The results show, on the one hand, that the company's solutions is clearly outperformed by our algorithmic proposal and, on the other hand, that the parallelization proposed allows the algorithm to properly address instances with more than 10000 services.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"1541 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128061473","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":"A System for Semantic-Based Access Control","authors":"F. Amato, N. Mazzocca, G. Pietro, M. Esposito","doi":"10.1109/3PGCIC.2013.74","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.74","url":null,"abstract":"Security and privacy of patient's medical data has more than ever become a critical factor in healthcare and, therefore, has a strong influence on the development of Electronic Health Record (EHR) systems. One of the most challenging aspects regards the possibility of specifying fine-grained access control restrictions over EHRs, not only at a document level but also on their specific sections. In order to face this issue, the paper proposes a semantic-based system aimed at supporting the definition of fine-grained access control policies on EHRs. This system relies on a role-based authorization model, encoded in terms of a formal ontology, and a set of access control restrictions defined as \"if-then rules\", in order to assign to healthcare workers the necessary privileges to carry out a task on specific EHR sections. A prototype implementation has been realized, by offering simple and intuitive interfaces to the security administrators for writing access control policies and restrictions.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122266119","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":"The Dependence of the Period and Range of the Oscillations on the Elevator Deflection for the ADMIRE Simplified Model","authors":"A. Fortis, S. Balint, Teodor-Florin Fortiş","doi":"10.1109/3PGCIC.2013.114","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.114","url":null,"abstract":"If, during a longitudinal flight with constant forward velocity of an unmanned aerial vehicle (UAV), the automatic flight control system (AFCS) fails and the elevator deflection is not in the safe interval, then the flight becomes oscillatory. In this paper, the dependence of the period and the range of the oscillations of the pitch rate and angle of attack on the elevator deflection of the possible oscillatory flights is numerically investigated, aided by the Scala-based Akka actor system. It is numerically shown that, for a given initial data, the period of oscillations is symmetric with respect to the safe interval and, for an elevator deflection close enough to the boundary of the safe interval, the period is very large while when the value of elevator deflection is far from the boundary of the safe interval the period is small. Additionally, the boundaries of the range of the oscillations of the pitch rate and of the angle of attack decreases when the elevator deflection increases.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132639625","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":"Elastic Routing: A Distributed Variant, Implementation Issues, and Numerical Results","authors":"Yoann Foquet, D. Nace, M. Pióro, I. Shinko","doi":"10.1109/3PGCIC.2013.21","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.21","url":null,"abstract":"This study is concerned with a specific rerouting strategy in telecommunication networks named Elastic Robust Rerouting (ERR), introduced first in [8]. We recall main points on this strategy, provide mathematical formulation and discuss in details a solution method. The second question studied in this paper is concerned with its distributed version and some related implementation issues. We report a numerical study on effectiveness of both versions in terms of dimensioning cost, restoration time and management effort.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124549461","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}
Ermanno Battista, V. Casola, N. Mazzocca, Roberto Nardone, S. Marrone
{"title":"A Compositional Modelling Approach for Large Sensor Networks Design","authors":"Ermanno Battista, V. Casola, N. Mazzocca, Roberto Nardone, S. Marrone","doi":"10.1109/3PGCIC.2013.71","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.71","url":null,"abstract":"Sensor Networks are required to be properly designed in order to avoid resource waste and optimize their lifetime. Large monitoring applications require proper methodologies and tools supporting the design, when multiple solutions increase the complexity of this task. Indeed, different parameters affect the performance of a solution, as node distribution, sensing coverage, battery usage, etc. A compositional modelling approach can provide early measures, allowing to evaluate and compare different solutions since the design phase. The main contribution of the paper is the definition of a general modelling framework to integrate simple models representing the main components and features of sensor networks. A library for specific sensor devices have been developed, using the Stochastic Activity Network (SAN) formalism. This approach is shown to be compositional since the creation of complex networks can be accomplished by simple subcomponents aggregation. With this approach, obtained models can analyse the dynamic evolution of the overall network, even if complex. First experimental results are also reported and discussed.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114384996","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":"Authentication and Secured Execution for the Infrastructure-as-a-Service Layer of the Cloud Computing Model","authors":"L. Hubert, Renaud Sirdey","doi":"10.1109/3PGCIC.2013.49","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.49","url":null,"abstract":"This paper presents a full system architecture allowing the authentication and secured execution of binary files using hardware-assisted on-the-fly memory encryption/decryption. In a context of general blurring of the physical relationship between a user and the computer which which it eventually interacts, this architecture has been thought so as to achieve a certain degree of robustness against corruptions in a cloud computing IaaS software stack, including when the corruptions may come from the lowest hyper vision layer.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114871548","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}
Seyed M. Mirtaheri, Di Zou, G. Bochmann, Guy-Vincent Jourdan, Iosif-Viorel Onut
{"title":"Dist-RIA Crawler: A Distributed Crawler for Rich Internet Applications","authors":"Seyed M. Mirtaheri, Di Zou, G. Bochmann, Guy-Vincent Jourdan, Iosif-Viorel Onut","doi":"10.1109/3PGCIC.2013.22","DOIUrl":"https://doi.org/10.1109/3PGCIC.2013.22","url":null,"abstract":"Crawling web applications is important for indexing, accessibility and security assessment. Crawling traditional web applications is an old problem, as old as the web itself. Crawling Rich Internet Applications (RIA) quickly and efficiently, however, is an open problem. Technologies such as AJAX and partial Document Object Model (DOM) updates only makes the problem of crawling RIA more time consuming to the web crawler. To reduce the time to crawl a RIA, this paper presents a new distributed algorithm to crawl a RIA in parallel with multiple computers, called Dist-RIA Crawler. Dist-RIA Crawler uses the JavaScript events in the DOM structure to partition the search space. This paper illustrates a prototype implementation of Dist-RIA Crawler and inspect empirical performance measurements.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117333811","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":"A Novel Approach to Generate and Extract Audio Watermark","authors":"Chundong Wang, Guangming Bo","doi":"10.1504/IJHPSA.2014.059869","DOIUrl":"https://doi.org/10.1504/IJHPSA.2014.059869","url":null,"abstract":"The paper proposes a combination of audio watermarking algorithm based on the wavelet transform and the Fourier transform. After the binary watermark image pre-processing, wavelet transform is taken for the audio, then the discrete Fourier transform is taken for the wavelet transform approximation component coefficients. Finally the amplitude of the Fourier transform coefficients is quantized to embed the watermark. In the watermark extraction process, the original audio signal is not require. This paper describes the detailed process. At last, the simulation tests confirm the robustness and transparency.","PeriodicalId":209674,"journal":{"name":"2013 Eighth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122362196","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}