CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: parallel algorithm</title> <meta name="description" content="Search results for: parallel algorithm"> <meta name="keywords" content="parallel algorithm"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="parallel algorithm" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="parallel algorithm"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 4632</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: parallel algorithm</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4632</span> Flowing Online Vehicle GPS Data Clustering Using a New Parallel K-Means Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Orhun%20Vural">Orhun Vural</a>, <a href="https://publications.waset.org/abstracts/search?q=Oguz%20%20Bayat"> Oguz Bayat</a>, <a href="https://publications.waset.org/abstracts/search?q=Rustu%20Akay"> Rustu Akay</a>, <a href="https://publications.waset.org/abstracts/search?q=Osman%20N.%20Ucan"> Osman N. Ucan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents a new parallel approach clustering of GPS data. Evaluation has been made by comparing execution time of various clustering algorithms on GPS data. This paper aims to propose a parallel based on neighborhood K-means algorithm to make it faster. The proposed parallelization approach assumes that each GPS data represents a vehicle and to communicate between vehicles close to each other after vehicles are clustered. This parallelization approach has been examined on different sized continuously changing GPS data and compared with serial K-means algorithm and other serial clustering algorithms. The results demonstrated that proposed parallel K-means algorithm has been shown to work much faster than other clustering algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20k-means%20algorithm" title="parallel k-means algorithm">parallel k-means algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20clustering" title=" parallel clustering"> parallel clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20algorithms" title=" clustering algorithms"> clustering algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20on%20flowing%20data" title=" clustering on flowing data"> clustering on flowing data</a> </p> <a href="https://publications.waset.org/abstracts/86622/flowing-online-vehicle-gps-data-clustering-using-a-new-parallel-k-means-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86622.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">222</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4631</span> A Parallel Implementation of k-Means in MATLAB</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dimitris%20Varsamis">Dimitris Varsamis</a>, <a href="https://publications.waset.org/abstracts/search?q=Christos%20Talagkozis"> Christos Talagkozis</a>, <a href="https://publications.waset.org/abstracts/search?q=Alkiviadis%20Tsimpiris"> Alkiviadis Tsimpiris</a>, <a href="https://publications.waset.org/abstracts/search?q=Paris%20Mastorocostas"> Paris Mastorocostas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this work is the parallel implementation of k-means in MATLAB, in order to reduce the execution time. Specifically, a new function in MATLAB for serial k-means algorithm is developed, which meets all the requirements for the conversion to a function in MATLAB with parallel computations. Additionally, two different variants for the definition of initial values are presented. In the sequel, the parallel approach is presented. Finally, the performance tests for the computation times respect to the numbers of features and classes are illustrated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=K-means%20algorithm" title="K-means algorithm">K-means algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computations" title=" parallel computations"> parallel computations</a>, <a href="https://publications.waset.org/abstracts/search?q=Matlab" title=" Matlab"> Matlab</a> </p> <a href="https://publications.waset.org/abstracts/80503/a-parallel-implementation-of-k-means-in-matlab" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80503.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">385</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4630</span> Constructing the Density of States from the Parallel Wang Landau Algorithm Overlapping Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arman%20S.%20Kussainov">Arman S. Kussainov</a>, <a href="https://publications.waset.org/abstracts/search?q=Altynbek%20K.%20Beisekov"> Altynbek K. Beisekov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work focuses on building an efficient universal procedure to construct a single density of states from the multiple pieces of data provided by the parallel implementation of the Wang Landau Monte Carlo based algorithm. The Ising and Pott models were used as the examples of the two-dimensional spin lattices to construct their densities of states. Sampled energy space was distributed between the individual walkers with certain overlaps. This was made to include the latest development of the algorithm as the density of states replica exchange technique. Several factors of immediate importance for the seamless stitching process have being considered. These include but not limited to the speed and universality of the initial parallel algorithm implementation as well as the data post-processing to produce the expected smooth density of states. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=density%20of%20states" title="density of states">density of states</a>, <a href="https://publications.waset.org/abstracts/search?q=Monte%20Carlo" title=" Monte Carlo"> Monte Carlo</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm" title=" parallel algorithm"> parallel algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=Wang%20Landau%20algorithm" title=" Wang Landau algorithm"> Wang Landau algorithm</a> </p> <a href="https://publications.waset.org/abstracts/66265/constructing-the-density-of-states-from-the-parallel-wang-landau-algorithm-overlapping-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/66265.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">412</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4629</span> An Improved Many Worlds Quantum Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li%20Dan">Li Dan</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhao%20Junsuo"> Zhao Junsuo</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhang%20Wenjun"> Zhang Wenjun </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Aiming at the shortcomings of the Quantum Genetic Algorithm such as the multimodal function optimization problems easily falling into the local optimum, and vulnerable to premature convergence due to no closely relationship between individuals, the paper presents an Improved Many Worlds Quantum Genetic Algorithm (IMWQGA). The paper using the concept of Many Worlds; using the derivative way of parallel worlds’ parallel evolution; putting forward the thought which updating the population according to the main body; adopting the transition methods such as parallel transition, backtracking, travel forth. In addition, the algorithm in the paper also proposes the quantum training operator and the combinatorial optimization operator as new operators of quantum genetic algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quantum%20genetic%20algorithm" title="quantum genetic algorithm">quantum genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=many%20worlds" title=" many worlds"> many worlds</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20training%20operator" title=" quantum training operator"> quantum training operator</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization%20operator" title=" combinatorial optimization operator"> combinatorial optimization operator</a> </p> <a href="https://publications.waset.org/abstracts/16842/an-improved-many-worlds-quantum-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16842.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">745</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4628</span> The Parallelization of Algorithm Based on Partition Principle for Association Rules Discovery</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khadidja%20Belbachir">Khadidja Belbachir</a>, <a href="https://publications.waset.org/abstracts/search?q=Hafida%20Belbachir"> Hafida Belbachir</a> </p> <p class="card-text"><strong>Abstract:</strong></p> subsequently the expansion of the physical supports storage and the needs ceaseless to accumulate several data, the sequential algorithms of associations’ rules research proved to be ineffective. Thus the introduction of the new parallel versions is imperative. We propose in this paper, a parallel version of a sequential algorithm “Partition”. This last is fundamentally different from the other sequential algorithms, because it scans the data base only twice to generate the significant association rules. By consequence, the parallel approach does not require much communication between the sites. The proposed approach was implemented for an experimental study. The obtained results, shows a great reduction in execution time compared to the sequential version and Count Distributed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title="association rules">association rules</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20data%20mining" title=" distributed data mining"> distributed data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=partition" title=" partition"> partition</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20algorithms" title=" parallel algorithms"> parallel algorithms</a> </p> <a href="https://publications.waset.org/abstracts/34591/the-parallelization-of-algorithm-based-on-partition-principle-for-association-rules-discovery" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34591.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">416</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4627</span> Parallel 2-Opt Local Search on GPU</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wen-Bao%20Qiao">Wen-Bao Qiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Jean-Charles%20Cr%C3%A9put"> Jean-Charles Créput</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To accelerate the solution for large scale traveling salesman problems (TSP), a parallel 2-opt local search algorithm with simple implementation based on Graphics Processing Unit (GPU) is presented and tested in this paper. The parallel scheme is based on technique of data decomposition by dynamically assigning multiple K processors on the integral tour to treat K edges’ 2-opt local optimization simultaneously on independent sub-tours, where K can be user-defined or have a function relationship with input size N. We implement this algorithm with doubly linked list on GPU. The implementation only requires O(N) memory. We compare this parallel 2-opt local optimization against sequential exhaustive 2-opt search along integral tour on TSP instances from TSPLIB with more than 10000 cities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%202-opt" title="parallel 2-opt">parallel 2-opt</a>, <a href="https://publications.waset.org/abstracts/search?q=double%20links" title=" double links"> double links</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20scale%20TSP" title=" large scale TSP"> large scale TSP</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU" title=" GPU"> GPU</a> </p> <a href="https://publications.waset.org/abstracts/58582/parallel-2-opt-local-search-on-gpu" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58582.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">625</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4626</span> Classification Rule Discovery by Using Parallel Ant Colony Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Waseem%20Shahzad">Waseem Shahzad</a>, <a href="https://publications.waset.org/abstracts/search?q=Ayesha%20Tahir%20Khan"> Ayesha Tahir Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamid%20Hussain%20Awan"> Hamid Hussain Awan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ant-Miner algorithm that lies under ACO algorithms is used to extract knowledge from data in the form of rules. A variant of Ant-Miner algorithm named as cAnt-MinerPB is used to generate list of rules using pittsburgh approach in order to maintain the rule interaction among the rules that are generated. In this paper, we propose a parallel Ant MinerPB in which Ant colony optimization algorithm runs parallel. In this technique, a data set is divided vertically (i-e attributes) into different subsets. These subsets are created based on the correlation among attributes using Mutual Information (MI). It generates rules in a parallel manner and then merged to form a final list of rules. The results have shown that the proposed technique achieved higher accuracy when compared with original cAnt-MinerPB and also the execution time has also reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20Ant-MinerPB" title=" parallel Ant-MinerPB"> parallel Ant-MinerPB</a>, <a href="https://publications.waset.org/abstracts/search?q=vertical%20partitioning" title=" vertical partitioning"> vertical partitioning</a>, <a href="https://publications.waset.org/abstracts/search?q=classification%20rule%20discovery" title=" classification rule discovery"> classification rule discovery</a> </p> <a href="https://publications.waset.org/abstracts/43773/classification-rule-discovery-by-using-parallel-ant-colony-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43773.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">295</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4625</span> Parallel Version of Reinhard’s Color Transfer Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abhishek%20Bhardwaj">Abhishek Bhardwaj</a>, <a href="https://publications.waset.org/abstracts/search?q=Manish%20Kumar%20Bajpai"> Manish Kumar Bajpai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An image with its content and schema of colors presents an effective mode of information sharing and processing. By changing its color schema different visions and prospect are discovered by the users. This phenomenon of color transfer is being used by Social media and other channel of entertainment. Reinhard et al’s algorithm was the first one to solve this problem of color transfer. In this paper, we make this algorithm efficient by introducing domain parallelism among different processors. We also comment on the factors that affect the speedup of this problem. In the end by analyzing the experimental data we claim to propose a novel and efficient parallel Reinhard’s algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Reinhard%20et%20al%E2%80%99s%20algorithm" title="Reinhard et al’s algorithm">Reinhard et al’s algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=color%20transferring" title=" color transferring"> color transferring</a>, <a href="https://publications.waset.org/abstracts/search?q=parallelism" title=" parallelism"> parallelism</a>, <a href="https://publications.waset.org/abstracts/search?q=speedup" title=" speedup"> speedup</a> </p> <a href="https://publications.waset.org/abstracts/21874/parallel-version-of-reinhards-color-transfer-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21874.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">614</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4624</span> A Genetic Algorithm for the Load Balance of Parallel Computational Fluid Dynamics Computation with Multi-Block Structured Mesh</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chunye%20Gong">Chunye Gong</a>, <a href="https://publications.waset.org/abstracts/search?q=Ming%20Tie"> Ming Tie</a>, <a href="https://publications.waset.org/abstracts/search?q=Jie%20Liu"> Jie Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Weimin%20Bao"> Weimin Bao</a>, <a href="https://publications.waset.org/abstracts/search?q=Xinbiao%20Gan"> Xinbiao Gan</a>, <a href="https://publications.waset.org/abstracts/search?q=Shengguo%20Li"> Shengguo Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Bo%20Yang"> Bo Yang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xuguang%20Chen"> Xuguang Chen</a>, <a href="https://publications.waset.org/abstracts/search?q=Tiaojie%20Xiao"> Tiaojie Xiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Yang%20Sun"> Yang Sun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Large-scale CFD simulation relies on high-performance parallel computing, and the load balance is the key role which affects the parallel efficiency. This paper focuses on the load-balancing problem of parallel CFD simulation with structured mesh. A mathematical model for this load-balancing problem is presented. The genetic algorithm, fitness computing, two-level code are designed. Optimal selector, robust operator, and local optimization operator are designed. The properties of the presented genetic algorithm are discussed in-depth. The effects of optimal selector, robust operator, and local optimization operator are proved by experiments. The experimental results of different test sets, DLR-F4, and aircraft design applications show the presented load-balancing algorithm is robust, quickly converged, and is useful in real engineering problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=load-balancing%20algorithm" title=" load-balancing algorithm"> load-balancing algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20variation" title=" optimal variation"> optimal variation</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20optimization" title=" local optimization"> local optimization</a> </p> <a href="https://publications.waset.org/abstracts/131281/a-genetic-algorithm-for-the-load-balance-of-parallel-computational-fluid-dynamics-computation-with-multi-block-structured-mesh" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131281.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">185</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4623</span> A Parallel Algorithm for Solving the PFSP on the Grid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samia%20Kouki">Samia Kouki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Solving NP-hard combinatorial optimization problems by exact search methods, such as Branch-and-Bound, may degenerate to complete enumeration. For that reason, exact approaches limit us to solve only small or moderate size problem instances, due to the exponential increase in CPU time when problem size increases. One of the most promising ways to reduce significantly the computational burden of sequential versions of Branch-and-Bound is to design parallel versions of these algorithms which employ several processors. This paper describes a parallel Branch-and-Bound algorithm called GALB for solving the classical permutation flowshop scheduling problem as well as its implementation on a Grid computing infrastructure. The experimental study of our distributed parallel algorithm gives promising results and shows clearly the benefit of the parallel paradigm to solve large-scale instances in moderate CPU time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=grid%20computing" title="grid computing">grid computing</a>, <a href="https://publications.waset.org/abstracts/search?q=permutation%20flow%20shop%20problem" title=" permutation flow shop problem"> permutation flow shop problem</a>, <a href="https://publications.waset.org/abstracts/search?q=branch%20and%20bound" title=" branch and bound"> branch and bound</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a> </p> <a href="https://publications.waset.org/abstracts/47518/a-parallel-algorithm-for-solving-the-pfsp-on-the-grid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47518.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">283</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4622</span> An Improved Parallel Algorithm of Decision Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jiameng%20Wang">Jiameng Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yunfei%20Yin"> Yunfei Yin</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiyu%20Deng"> Xiyu Deng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Parallel optimization is one of the important research topics of data mining at this stage. Taking Classification and Regression Tree (CART) parallelization as an example, this paper proposes a parallel data mining algorithm based on SSP-OGini-PCCP. Aiming at the problem of choosing the best CART segmentation point, this paper designs an S-SP model without data association; and in order to calculate the Gini index efficiently, a parallel OGini calculation method is designed. In addition, in order to improve the efficiency of the pruning algorithm, a synchronous PCCP pruning strategy is proposed in this paper. In this paper, the optimal segmentation calculation, Gini index calculation, and pruning algorithm are studied in depth. These are important components of parallel data mining. By constructing a distributed cluster simulation system based on SPARK, data mining methods based on SSP-OGini-PCCP are tested. Experimental results show that this method can increase the search efficiency of the best segmentation point by an average of 89%, increase the search efficiency of the Gini segmentation index by 3853%, and increase the pruning efficiency by 146% on average; and as the size of the data set increases, the performance of the algorithm remains stable, which meets the requirements of contemporary massive data processing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=classification" title="classification">classification</a>, <a href="https://publications.waset.org/abstracts/search?q=Gini%20index" title=" Gini index"> Gini index</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20data%20mining" title=" parallel data mining"> parallel data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=pruning%20ahead" title=" pruning ahead"> pruning ahead</a> </p> <a href="https://publications.waset.org/abstracts/119505/an-improved-parallel-algorithm-of-decision-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/119505.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">124</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4621</span> Efficient Heuristic Algorithm to Speed Up Graphcut in Gpu for Image Stitching</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tai%20Nguyen">Tai Nguyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Minh%20Bui"> Minh Bui</a>, <a href="https://publications.waset.org/abstracts/search?q=Huong%20Ninh"> Huong Ninh</a>, <a href="https://publications.waset.org/abstracts/search?q=Tu%20Nguyen"> Tu Nguyen</a>, <a href="https://publications.waset.org/abstracts/search?q=Hai%20Tran"> Hai Tran</a> </p> <p class="card-text"><strong>Abstract:</strong></p> GraphCut algorithm has been widely utilized to solve various types of computer vision problems. Its expensive computational cost encouraged many researchers to improve the speed of the algorithm. Recent works proposed schemes that work on parallel computing platforms such as CUDA. However, the problem of low convergence speed prevents the usage of GraphCut for real time applications. In this paper, we propose global suppression heuristic to boost the conver-gence process of the algorithm. A parallel implementation of GraphCut algorithm on CUDA designed for the image stitching problem is introduced. Our method achieves up to 3× time boost on the graph of size 80 × 480 compared to the best sequential GraphCut algorithm while achieving satisfactory stitched images, suitable for panorama applications. Our source code will be soon available for further research. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CUDA" title="CUDA">CUDA</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20cut" title=" graph cut"> graph cut</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20stitching" title=" image stitching"> image stitching</a>, <a href="https://publications.waset.org/abstracts/search?q=texture%20synthesis" title=" texture synthesis"> texture synthesis</a>, <a href="https://publications.waset.org/abstracts/search?q=maxflow%2Fmincut%20algorithm" title=" maxflow/mincut algorithm"> maxflow/mincut algorithm</a> </p> <a href="https://publications.waset.org/abstracts/154120/efficient-heuristic-algorithm-to-speed-up-graphcut-in-gpu-for-image-stitching" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/154120.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">132</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4620</span> Verification & Validation of Map Reduce Program Model for Parallel K-Mediod Algorithm on Hadoop Cluster</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Trapti%20Sharma">Trapti Sharma</a>, <a href="https://publications.waset.org/abstracts/search?q=Devesh%20Kumar%20Srivastava"> Devesh Kumar Srivastava</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is basically a analysis study of above MapReduce implementation and also to verify and validate the MapReduce solution model for Parallel K-Mediod algorithm on Hadoop Cluster. MapReduce is a programming model which authorize the managing of huge amounts of data in parallel, on a large number of devices. It is specially well suited to constant or moderate changing set of data since the implementation point of a position is usually high. MapReduce has slowly become the framework of choice for “big data”. The MapReduce model authorizes for systematic and instant organizing of large scale data with a cluster of evaluate nodes. One of the primary affect in Hadoop is how to minimize the completion length (i.e. makespan) of a set of MapReduce duty. In this paper, we have verified and validated various MapReduce applications like wordcount, grep, terasort and parallel K-Mediod clustering algorithm. We have found that as the amount of nodes increases the completion time decreases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hadoop" title="hadoop">hadoop</a>, <a href="https://publications.waset.org/abstracts/search?q=mapreduce" title=" mapreduce"> mapreduce</a>, <a href="https://publications.waset.org/abstracts/search?q=k-mediod" title=" k-mediod"> k-mediod</a>, <a href="https://publications.waset.org/abstracts/search?q=validation" title=" validation"> validation</a>, <a href="https://publications.waset.org/abstracts/search?q=verification" title=" verification"> verification</a> </p> <a href="https://publications.waset.org/abstracts/31459/verification-validation-of-map-reduce-program-model-for-parallel-k-mediod-algorithm-on-hadoop-cluster" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31459.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">369</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4619</span> The Vision Baed Parallel Robot Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sun%20Lim">Sun Lim</a>, <a href="https://publications.waset.org/abstracts/search?q=Kyun%20Jung"> Kyun Jung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we describe the control strategy of high speed parallel robot system with EtherCAT network. This work deals the parallel robot system with centralized control on the real-time operating system such as window TwinCAT3. Most control scheme and algorithm is implemented master platform on the PC, the input and output interface is ported on the slave side. The data is transferred by maximum 20usecond with 1000byte. EtherCAT is very high speed and stable industrial network. The control strategy with EtherCAT is very useful and robust on Ethernet network environment. The developed parallel robot is controlled pre-design nonlinear controller for 6G/0.43 cycle time of pick and place motion tracking. The experiment shows the good design and validation of the controller. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20robot%20control" title="parallel robot control">parallel robot control</a>, <a href="https://publications.waset.org/abstracts/search?q=etherCAT" title=" etherCAT"> etherCAT</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20control" title=" nonlinear control"> nonlinear control</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20robot%20inverse%20kinematic" title=" parallel robot inverse kinematic"> parallel robot inverse kinematic</a> </p> <a href="https://publications.waset.org/abstracts/27428/the-vision-baed-parallel-robot-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27428.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">571</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4618</span> Series-Parallel Systems Reliability Optimization Using Genetic Algorithm and Statistical Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Essa%20Abrahim%20Abdulgader%20Saleem">Essa Abrahim Abdulgader Saleem</a>, <a href="https://publications.waset.org/abstracts/search?q=Thien-My%20Dao"> Thien-My Dao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The main objective of this paper is to optimize series-parallel system reliability using Genetic Algorithm (GA) and statistical analysis; considering system reliability constraints which involve the redundant numbers of selected components, total cost, and total weight. To perform this work, firstly the mathematical model which maximizes system reliability subject to maximum system cost and maximum system weight constraints is presented; secondly, a statistical analysis is used to optimize GA parameters, and thirdly GA is used to optimize series-parallel systems reliability. The objective is to determine the strategy choosing the redundancy level for each subsystem to maximize the overall system reliability subject to total cost and total weight constraints. Finally, the series-parallel system case study reliability optimization results are showed, and comparisons with the other previous results are presented to demonstrate the performance of our GA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reliability" title="reliability">reliability</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic" title=" meta-heuristic"> meta-heuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=redundancy" title=" redundancy"> redundancy</a> </p> <a href="https://publications.waset.org/abstracts/55689/series-parallel-systems-reliability-optimization-using-genetic-algorithm-and-statistical-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55689.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">337</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4617</span> Parallel Evaluation of Sommerfeld Integrals for Multilayer Dyadic Green's Function</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Duygu%20Kan">Duygu Kan</a>, <a href="https://publications.waset.org/abstracts/search?q=Mehmet%20Cayoren"> Mehmet Cayoren</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Sommerfeld-integrals (SIs) are commonly encountered in electromagnetics problems involving analysis of antennas and scatterers embedded in planar multilayered media. Generally speaking, the analytical solution of SIs is unavailable, and it is well known that numerical evaluation of SIs is very time consuming and computationally expensive due to the highly oscillating and slowly decaying nature of the integrands. Therefore, fast computation of SIs has a paramount importance. In this paper, a parallel code has been developed to speed up the computation of SI in the framework of calculation of dyadic Green’s function in multilayered media. OpenMP shared memory approach is used to parallelize the SI algorithm and resulted in significant time savings. Moreover accelerating the computation of dyadic Green’s function is discussed based on the parallel SI algorithm developed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sommerfeld-integrals" title="Sommerfeld-integrals">Sommerfeld-integrals</a>, <a href="https://publications.waset.org/abstracts/search?q=multilayer%20dyadic%20Green%E2%80%99s%20function" title=" multilayer dyadic Green’s function"> multilayer dyadic Green’s function</a>, <a href="https://publications.waset.org/abstracts/search?q=OpenMP" title=" OpenMP"> OpenMP</a>, <a href="https://publications.waset.org/abstracts/search?q=shared%20memory%20parallel%20programming" title=" shared memory parallel programming"> shared memory parallel programming</a> </p> <a href="https://publications.waset.org/abstracts/73819/parallel-evaluation-of-sommerfeld-integrals-for-multilayer-dyadic-greens-function" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73819.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">247</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4616</span> A Practical Protection Method for Parallel Transmission-Lines Based on the Fault Travelling-Waves</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Reza%20Ebrahimi">Mohammad Reza Ebrahimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In new restructured power systems, swift fault detection is very important. The parallel transmission-lines are vastly used in this kind of power systems because of high amount of energy transferring. In this paper, a method based on the comparison of two schemes, i.e., i) maximum magnitude of travelling-wave (TW) energy ii) the instants of maximum energy occurrence at the circuits of parallel transmission-line is proposed. Using the travelling-wave of fault in order to faulted line identification this method has noticeable operation time. Moreover, the algorithm can cover for identification of faults as external or internal faults. For an internal fault, the exact location of the fault can be estimated confidently. A lot of simulations have been done with PSCAD/EMTDC to verify the performance of the proposed algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=travelling-wave" title="travelling-wave">travelling-wave</a>, <a href="https://publications.waset.org/abstracts/search?q=maximum%20energy" title=" maximum energy"> maximum energy</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20transmission-line" title=" parallel transmission-line"> parallel transmission-line</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20location" title=" fault location"> fault location</a> </p> <a href="https://publications.waset.org/abstracts/102538/a-practical-protection-method-for-parallel-transmission-lines-based-on-the-fault-travelling-waves" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102538.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">186</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4615</span> Fast Prediction Unit Partition Decision and Accelerating the Algorithm Using Cudafor Intra and Inter Prediction of HEVC</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Qiang%20Zhang">Qiang Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Chun%20Yuan"> Chun Yuan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since the PU (Prediction Unit) decision process is the most time consuming part of the emerging HEVC (High Efficient Video Coding) standardin intra and inter frame coding, this paper proposes the fast PU decision algorithm and speed up the algorithm using CUDA (Compute Unified Device Architecture). In intra frame coding, the fast PU decision algorithm uses the texture features to skip intra-frame prediction or terminal the intra-frame prediction for smaller PU size. In inter frame coding of HEVC, the fast PU decision algorithm takes use of the similarity of its own two Nx2N size PU's motion vectors and the hierarchical structure of CU (Coding Unit) partition to skip some modes of PU partition, so as to reduce the motion estimation times. The accelerate algorithm using CUDA is based on the fast PU decision algorithm which uses the GPU to make the motion search and the gradient computation could be parallel computed. The proposed algorithm achieves up to 57% time saving compared to the HM 10.0 with little rate-distortion losses (0.043dB drop and 1.82% bitrate increase on average). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=HEVC" title="HEVC">HEVC</a>, <a href="https://publications.waset.org/abstracts/search?q=PU%20decision" title=" PU decision"> PU decision</a>, <a href="https://publications.waset.org/abstracts/search?q=inter%20prediction" title=" inter prediction"> inter prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=intra%20prediction" title=" intra prediction"> intra prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=CUDA" title=" CUDA"> CUDA</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel" title=" parallel"> parallel</a> </p> <a href="https://publications.waset.org/abstracts/9627/fast-prediction-unit-partition-decision-and-accelerating-the-algorithm-using-cudafor-intra-and-inter-prediction-of-hevc" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9627.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">399</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4614</span> Collision Detection Algorithm Based on Data Parallelism</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhen%20Peng">Zhen Peng</a>, <a href="https://publications.waset.org/abstracts/search?q=Baifeng%20Wu"> Baifeng Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Modern computing technology enters the era of parallel computing with the trend of sustainable and scalable parallelism. Single Instruction Multiple Data (SIMD) is an important way to go along with the trend. It is able to gather more and more computing ability by increasing the number of processor cores without the need of modifying the program. Meanwhile, in the field of scientific computing and engineering design, many computation intensive applications are facing the challenge of increasingly large amount of data. Data parallel computing will be an important way to further improve the performance of these applications. In this paper, we take the accurate collision detection in building information modeling as an example. We demonstrate a model for constructing a data parallel algorithm. According to the model, a complex object is decomposed into the sets of simple objects; collision detection among complex objects is converted into those among simple objects. The resulting algorithm is a typical SIMD algorithm, and its advantages in parallelism and scalability is unparalleled in respect to the traditional algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20parallelism" title="data parallelism">data parallelism</a>, <a href="https://publications.waset.org/abstracts/search?q=collision%20detection" title=" collision detection"> collision detection</a>, <a href="https://publications.waset.org/abstracts/search?q=single%20instruction%20multiple%20data" title=" single instruction multiple data"> single instruction multiple data</a>, <a href="https://publications.waset.org/abstracts/search?q=building%20information%20modeling" title=" building information modeling"> building information modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=continuous%20scalability" title=" continuous scalability"> continuous scalability</a> </p> <a href="https://publications.waset.org/abstracts/65675/collision-detection-algorithm-based-on-data-parallelism" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/65675.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">289</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4613</span> Damage Strain Analysis of Parallel Fiber Eutectic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jian%20Zheng">Jian Zheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Xinhua%20Ni"> Xinhua Ni</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiequan%20Liu"> Xiequan Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> According to isotropy of parallel fiber eutectic, the no- damage strain field in parallel fiber eutectic is obtained from the flexibility tensor of parallel fiber eutectic. Considering the damage behavior of parallel fiber eutectic, damage variables are introduced to determine the strain field of parallel fiber eutectic. The damage strains in the matrix, interphase, and fiber of parallel fiber eutectic are quantitatively analyzed. Results show that damage strains are not only associated with the fiber volume fraction of parallel fiber eutectic, but also with the damage degree. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=damage%20strain" title="damage strain">damage strain</a>, <a href="https://publications.waset.org/abstracts/search?q=initial%20strain" title=" initial strain"> initial strain</a>, <a href="https://publications.waset.org/abstracts/search?q=fiber%20volume%20fraction" title=" fiber volume fraction"> fiber volume fraction</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20fiber%20eutectic" title=" parallel fiber eutectic"> parallel fiber eutectic</a> </p> <a href="https://publications.waset.org/abstracts/60032/damage-strain-analysis-of-parallel-fiber-eutectic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60032.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">577</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4612</span> Comparison of Parallel CUDA and OpenMP Implementations of Memetic Algorithms for Solving Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jason%20Digalakis">Jason Digalakis</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Cotronis"> John Cotronis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Memetic algorithms (MAs) are useful for solving optimization problems. It is quite difficult to search the search space of the optimization problem with large dimensions. There is a challenge to use all the cores of the system. In this study, a sequential implementation of the memetic algorithm is converted into a concurrent version, which is executed on the cores of both CPU and GPU. For this reason, CUDA and OpenMP libraries are operated on the parallel algorithm to make a concurrent execution on CPU and GPU, respectively. The aim of this study is to compare CPU and GPU implementation of the memetic algorithm. For this purpose, fourteen benchmark functions are selected as test problems. The obtained results indicate that our approach leads to speedups up to five thousand times higher compared to one CPU thread while maintaining a reasonable results quality. This clearly shows that GPUs have the potential to acceleration of MAs and allow them to solve much more complex tasks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=memetic%20algorithm" title="memetic algorithm">memetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=CUDA" title=" CUDA"> CUDA</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU-based%20memetic%20algorithm" title=" GPU-based memetic algorithm"> GPU-based memetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=open%20multi%20processing" title=" open multi processing"> open multi processing</a>, <a href="https://publications.waset.org/abstracts/search?q=multimodal%20functions" title=" multimodal functions"> multimodal functions</a>, <a href="https://publications.waset.org/abstracts/search?q=unimodal%20functions" title=" unimodal functions"> unimodal functions</a>, <a href="https://publications.waset.org/abstracts/search?q=non-linear%20optimization%20problems" title=" non-linear optimization problems"> non-linear optimization problems</a> </p> <a href="https://publications.waset.org/abstracts/162791/comparison-of-parallel-cuda-and-openmp-implementations-of-memetic-algorithms-for-solving-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162791.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">101</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4611</span> Model and Algorithm for Dynamic Wireless Electric Vehicle Charging Network Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Trung%20Hieu%20Tran">Trung Hieu Tran</a>, <a href="https://publications.waset.org/abstracts/search?q=Jesse%20O%27Hanley"> Jesse O'Hanley</a>, <a href="https://publications.waset.org/abstracts/search?q=Russell%20Fowler"> Russell Fowler</a> </p> <p class="card-text"><strong>Abstract:</strong></p> When in-wheel wireless charging technology for electric vehicles becomes mature, a need for such integrated charging stations network development is essential. In this paper, we thus investigate the optimisation problem of in-wheel wireless electric vehicle charging network design. A mixed-integer linear programming model is formulated to solve into optimality the problem. In addition, a meta-heuristic algorithm is proposed for efficiently solving large-sized instances within a reasonable computation time. A parallel computing strategy is integrated into the algorithm to speed up its computation time. Experimental results carried out on the benchmark instances show that our model and algorithm can find the optimal solutions and their potential for practical applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electric%20vehicle" title="electric vehicle">electric vehicle</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20charging%20station" title=" wireless charging station"> wireless charging station</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20programming" title=" mathematical programming"> mathematical programming</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic%20algorithm" title=" meta-heuristic algorithm"> meta-heuristic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/abstracts/159397/model-and-algorithm-for-dynamic-wireless-electric-vehicle-charging-network-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159397.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">79</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4610</span> Task Scheduling on Parallel System Using Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jasbir%20Singh%20Gill">Jasbir Singh Gill</a>, <a href="https://publications.waset.org/abstracts/search?q=Baljit%20Singh"> Baljit Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Scheduling and mapping the application task graph on multiprocessor parallel systems is considered as the most crucial and critical NP-complete problem. Many genetic algorithms have been proposed to solve such problems. In this paper, two genetic approach based algorithms have been designed and developed with or without task duplication. The proposed algorithms work on two fitness functions. The first fitness i.e. task fitness is used to minimize the total finish time of the schedule (schedule length) while the second fitness function i.e. process fitness is concerned with allocating the tasks to the available highly efficient processor from the list of available processors (load balance). Proposed genetic-based algorithms have been experimentally implemented and evaluated with other state-of-art popular and widely used algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title="parallel computing">parallel computing</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20scheduling" title=" task scheduling"> task scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=task%20duplication" title=" task duplication"> task duplication</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a> </p> <a href="https://publications.waset.org/abstracts/75569/task-scheduling-on-parallel-system-using-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75569.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">349</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4609</span> A Fast Parallel and Distributed Type-2 Fuzzy Algorithm Based on Cooperative Mobile Agents Model for High Performance Image Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fat%C3%A9ma%20Zahra%20Benchara">Fatéma Zahra Benchara</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Youssfi"> Mohamed Youssfi</a>, <a href="https://publications.waset.org/abstracts/search?q=Omar%20Bouattane"> Omar Bouattane</a>, <a href="https://publications.waset.org/abstracts/search?q=Hassan%20Ouajji"> Hassan Ouajji</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Ouadi%20Bensalah"> Mohamed Ouadi Bensalah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this paper is to present a distributed implementation of the Type-2 Fuzzy algorithm in a parallel and distributed computing environment based on mobile agents. The proposed algorithm is assigned to be implemented on a SPMD (Single Program Multiple Data) architecture which is based on cooperative mobile agents as AVPE (Agent Virtual Processing Element) model in order to improve the processing resources needed for performing the big data image segmentation. In this work we focused on the application of this algorithm in order to process the big data MRI (Magnetic Resonance Images) image of size (n x m). It is encapsulated on the Mobile agent team leader in order to be split into (m x n) pixels one per AVPE. Each AVPE perform and exchange the segmentation results and maintain asynchronous communication with their team leader until the convergence of this algorithm. Some interesting experimental results are obtained in terms of accuracy and efficiency analysis of the proposed implementation, thanks to the mobile agents several interesting skills introduced in this distributed computational model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20type-2%20fuzzy%20algorithm" title="distributed type-2 fuzzy algorithm">distributed type-2 fuzzy algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20agents" title=" mobile agents"> mobile agents</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20and%20distributed%20computing" title=" parallel and distributed computing"> parallel and distributed computing</a> </p> <a href="https://publications.waset.org/abstracts/24162/a-fast-parallel-and-distributed-type-2-fuzzy-algorithm-based-on-cooperative-mobile-agents-model-for-high-performance-image-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24162.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">429</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4608</span> A Parallel Approach for 3D-Variational Data Assimilation on GPUs in Ocean Circulation Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rossella%20Arcucci">Rossella Arcucci</a>, <a href="https://publications.waset.org/abstracts/search?q=Luisa%20D%27Amore"> Luisa D'Amore</a>, <a href="https://publications.waset.org/abstracts/search?q=Simone%20Celestino"> Simone Celestino</a>, <a href="https://publications.waset.org/abstracts/search?q=Giuseppe%20Scotti"> Giuseppe Scotti</a>, <a href="https://publications.waset.org/abstracts/search?q=Giuliano%20Laccetti"> Giuliano Laccetti</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work is the first dowel in a rather wide research activity in collaboration with Euro Mediterranean Center for Climate Changes, aimed at introducing scalable approaches in Ocean Circulation Models. We discuss designing and implementation of a parallel algorithm for solving the Variational Data Assimilation (DA) problem on Graphics Processing Units (GPUs). The algorithm is based on the fully scalable 3DVar DA model, previously proposed by the authors, which uses a Domain Decomposition approach (we refer to this model as the DD-DA model). We proceed with an incremental porting process consisting of 3 distinct stages: requirements and source code analysis, incremental development of CUDA kernels, testing and optimization. Experiments confirm the theoretic performance analysis based on the so-called scale up factor demonstrating that the DD-DA model can be suitably mapped on GPU architectures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20assimilation" title="data assimilation">data assimilation</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU%20architectures" title=" GPU architectures"> GPU architectures</a>, <a href="https://publications.waset.org/abstracts/search?q=ocean%20models" title=" ocean models"> ocean models</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm" title=" parallel algorithm"> parallel algorithm</a> </p> <a href="https://publications.waset.org/abstracts/29397/a-parallel-approach-for-3d-variational-data-assimilation-on-gpus-in-ocean-circulation-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29397.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">412</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4607</span> Parallel PRBS Generation and Parallel BER Tester for 8-Gbps On-chip Interconnection Testing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhao%20Bin">Zhao Bin</a>, <a href="https://publications.waset.org/abstracts/search?q=Yan%20Dan%20Lei"> Yan Dan Lei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a multi-pattern parallel PRBS generator and a dedicated parallel BER tester is proposed for the 8-Gbps On-chip interconnection testing. A unique full-parallel PRBS checker is also proposed. The proposed design, together with the custom-designed high-speed parallel-to-serial and the serial-to-parallel circuit, will be used to test different on-chip interconnection transceivers. The design is implemented in TSMC 28nm CMOS technology with working voltage at 1.0 V. The serial to parallel ratio is 8:1 so the parallel PRBS generation and BER Tester can be run at lower speed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=PRBS" title="PRBS">PRBS</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20speed" title=" high speed"> high speed</a>, <a href="https://publications.waset.org/abstracts/search?q=generator" title=" generator"> generator</a> </p> <a href="https://publications.waset.org/abstracts/35064/parallel-prbs-generation-and-parallel-ber-tester-for-8-gbps-on-chip-interconnection-testing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35064.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">760</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4606</span> Improved Pattern Matching Applied to Surface Mounting Devices Components Localization on Automated Optical Inspection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pedro%20M.%20A.%20Vitoriano">Pedro M. A. Vitoriano</a>, <a href="https://publications.waset.org/abstracts/search?q=Tito.%20G.%20Amaral"> Tito. G. Amaral</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Automated Optical Inspection (AOI) Systems are commonly used on Printed Circuit Boards (PCB) manufacturing. The use of this technology has been proven as highly efficient for process improvements and quality achievements. The correct extraction of the component for posterior analysis is a critical step of the AOI process. Nowadays, the Pattern Matching Algorithm is commonly used, although this algorithm requires extensive calculations and is time consuming. This paper will present an improved algorithm for the component localization process, with the capability of implementation in a parallel execution system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=AOI" title="AOI">AOI</a>, <a href="https://publications.waset.org/abstracts/search?q=automated%20optical%20inspection" title=" automated optical inspection"> automated optical inspection</a>, <a href="https://publications.waset.org/abstracts/search?q=SMD" title=" SMD"> SMD</a>, <a href="https://publications.waset.org/abstracts/search?q=surface%20mounting%20devices" title=" surface mounting devices"> surface mounting devices</a>, <a href="https://publications.waset.org/abstracts/search?q=pattern%20matching" title=" pattern matching"> pattern matching</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20execution" title=" parallel execution"> parallel execution</a> </p> <a href="https://publications.waset.org/abstracts/59624/improved-pattern-matching-applied-to-surface-mounting-devices-components-localization-on-automated-optical-inspection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59624.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">299</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4605</span> Trajectory Tracking of a Redundant Hybrid Manipulator Using a Switching Control Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Atilla%20Bayram">Atilla Bayram</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the trajectory tracking control of a spatial redundant hybrid manipulator. This manipulator consists of two parallel manipulators which are a variable geometry truss (VGT) module. In fact, each VGT module with 3-degress of freedom (DOF) is a planar parallel manipulator and their operational planes of these VGT modules are arranged to be orthogonal to each other. Also, the manipulator contains a twist motion part attached to the top of the second VGT module to supply the missing orientation of the endeffector. These three modules constitute totally 7-DOF hybrid (parallel-parallel) redundant spatial manipulator. The forward kinematics equations of this manipulator are obtained, then, according to these equations, the inverse kinematics is solved based on an optimization with the joint limit avoidance. The dynamic equations are formed by using virtual work method. In order to test the performance of the redundant manipulator and the controllers presented, two different desired trajectories are followed by using the computed force control method and a switching control method. The switching control method is combined with the computed force control method and genetic algorithm. In the switching control method, the genetic algorithm is only used for fine tuning in the compensation of the trajectory tracking errors. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computed%20force%20method" title="computed force method">computed force method</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20manipulator" title=" hybrid manipulator"> hybrid manipulator</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20kinematics%20of%20redundant%20manipulators" title=" inverse kinematics of redundant manipulators"> inverse kinematics of redundant manipulators</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20geometry%20truss" title=" variable geometry truss"> variable geometry truss</a> </p> <a href="https://publications.waset.org/abstracts/50402/trajectory-tracking-of-a-redundant-hybrid-manipulator-using-a-switching-control-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50402.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">347</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4604</span> Resistivity Tomography Optimization Based on Parallel Electrode Linear Back Projection Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yiwei%20Huang">Yiwei Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Chunyu%20Zhao"> Chunyu Zhao</a>, <a href="https://publications.waset.org/abstracts/search?q=Jingjing%20Ding"> Jingjing Ding</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Electrical Resistivity Tomography has been widely used in the medicine and the geology, such as the imaging of the lung impedance and the analysis of the soil impedance, etc. Linear Back Projection is the core algorithm of Electrical Resistivity Tomography, but the traditional Linear Back Projection can not make full use of the information of the electric field. In this paper, an imaging method of Parallel Electrode Linear Back Projection for Electrical Resistivity Tomography is proposed, which generates the electric field distribution that is not linearly related to the traditional Linear Back Projection, captures the new information and improves the imaging accuracy without increasing the number of electrodes by changing the connection mode of the electrodes. The simulation results show that the accuracy of the image obtained by the inverse operation obtained by the Parallel Electrode Linear Back Projection can be improved by about 20%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electrical%20resistivity%20tomography" title="electrical resistivity tomography">electrical resistivity tomography</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20simulation" title=" finite element simulation"> finite element simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20optimization" title=" image optimization"> image optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20electrode%20linear%20back%20projection" title=" parallel electrode linear back projection"> parallel electrode linear back projection</a> </p> <a href="https://publications.waset.org/abstracts/112189/resistivity-tomography-optimization-based-on-parallel-electrode-linear-back-projection-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/112189.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">153</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4603</span> Optimal Design of Redundant Hybrid Manipulator for Minimum Singularity</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Arash%20Rahmani">Arash Rahmani</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Ghanbari"> Ahmad Ghanbari</a>, <a href="https://publications.waset.org/abstracts/search?q=Abbas%20Baghernezhad"> Abbas Baghernezhad</a>, <a href="https://publications.waset.org/abstracts/search?q=Babak%20Safaei"> Babak Safaei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the design of parallel manipulators, usually mean value of a dexterity measure over the workspace volume is considered as the objective function to be used in optimization algorithms. The mentioned indexes in a hybrid parallel manipulator (HPM) are quite complicated to solve thanks to infinite solutions for every point within the workspace of the redundant manipulators. In this paper, spatial isotropic design axioms are extended as a well-known method for optimum design of manipulators. An upper limit for the isotropy measure of HPM is calculated and instead of computing and minimizing isotropy measure, minimizing the obtained limit is considered. To this end, two different objective functions are suggested which are obtained from objective functions of comprising modules. Finally, by using genetic algorithm (GA), the best geometric parameters for a specific hybrid parallel robot which is composed of two modified Gough-Stewart platforms (MGSP) are achieved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hybrid%20manipulator" title="hybrid manipulator">hybrid manipulator</a>, <a href="https://publications.waset.org/abstracts/search?q=spatial%20isotropy" title=" spatial isotropy"> spatial isotropy</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20design" title=" optimum design"> optimum design</a> </p> <a href="https://publications.waset.org/abstracts/41885/optimal-design-of-redundant-hybrid-manipulator-for-minimum-singularity" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41885.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">336</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=154">154</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=155">155</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20algorithm&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>