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 2-opt</title> <meta name="description" content="Search results for: parallel 2-opt"> <meta name="keywords" content="parallel 2-opt"> <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 2-opt" 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 2-opt"> <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> 1190</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: parallel 2-opt</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1190</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">576</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">1189</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">1188</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">1187</span> A Survey on Constraint Solving Approaches Using Parallel Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nebras%20Gharbi">Nebras Gharbi</a>, <a href="https://publications.waset.org/abstracts/search?q=Itebeddine%20Ghorbel"> Itebeddine Ghorbel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the latest years and with the advancements of the multicore computing world, the constraint programming community tried to benefit from the capacity of new machines and make the best use of them through several parallel schemes for constraint solving. In this paper, we propose a survey of the different proposed approaches to solve Constraint Satisfaction Problems using parallel architectures. These approaches use in a different way a parallel architecture: the problem itself could be solved differently by several solvers or could be split over solvers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constraint%20programming" title="constraint programming">constraint programming</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20programming" title=" parallel programming"> parallel programming</a>, <a href="https://publications.waset.org/abstracts/search?q=constraint%20satisfaction%20problem" title=" constraint satisfaction problem"> constraint satisfaction problem</a>, <a href="https://publications.waset.org/abstracts/search?q=speed-up" title=" speed-up"> speed-up</a> </p> <a href="https://publications.waset.org/abstracts/50394/a-survey-on-constraint-solving-approaches-using-parallel-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50394.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">319</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">1186</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">1185</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">221</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">1184</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">624</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">1183</span> Parallelization by Domain Decomposition for 1-D Sugarcane Equation with Message Passing Interface</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ewedafe%20Simon%20Uzezi">Ewedafe Simon Uzezi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we presented a method based on Domain Decomposition (DD) for parallelization of 1-D Sugarcane Equation on parallel platform with parallel paradigms on Master-Slave platform using Message Passing Interface (MPI). The 1-D Sugarcane Equation was discretized using explicit method of discretization requiring evaluation nof temporal and spatial distribution of temperature. This platform gives better predictions of the effects of temperature distribution of the sugarcane problem. This work presented parallel overheads with overlapping communication and communication across parallel computers with numerical results across different block sizes with scalability. However, performance improvement strategies from the DD on various mesh sizes were compared experimentally and parallel results show speedup and efficiency for the parallel algorithms design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sugarcane" title="sugarcane">sugarcane</a>, <a href="https://publications.waset.org/abstracts/search?q=parallelization" title=" parallelization"> parallelization</a>, <a href="https://publications.waset.org/abstracts/search?q=explicit%20method" title=" explicit method"> explicit method</a>, <a href="https://publications.waset.org/abstracts/search?q=domain%20decomposition" title=" domain decomposition"> domain decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=MPI" title=" MPI"> MPI</a> </p> <a href="https://publications.waset.org/abstracts/192206/parallelization-by-domain-decomposition-for-1-d-sugarcane-equation-with-message-passing-interface" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192206.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">21</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">1182</span> Dynamic Analysis of Offshore 2-HUS/U Parallel Platform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xie%20Kefeng">Xie Kefeng</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhang%20He"> Zhang He</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For the stability and control demand of offshore small floating platform, a 2-HUS/U parallel mechanism was presented as offshore platform. Inverse kinematics was obtained by institutional constraint equation, and the dynamic model of offshore 2-HUS/U parallel platform was derived based on rigid body’s Lagrangian method. The equivalent moment of inertia, damping and driving force/torque variation of offshore 2-HUS/U parallel platform were analyzed. A numerical example shows that, for parallel platform of given motion, system’s equivalent inertia changes 1.25 times maximally. During the movement of platform, they change dramatically with the system configuration and have coupling characteristics. The maximum equivalent drive torque is 800 N. At the same time, the curve of platform’s driving force/torque is smooth and has good sine features. The control system needs to be adjusted according to kinetic equation during stability and control and it provides a basis for the optimization of control system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=2-HUS%2FU%20platform" title="2-HUS/U platform">2-HUS/U platform</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamics" title=" dynamics"> dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=Lagrange" title=" Lagrange"> Lagrange</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20platform" title=" parallel platform"> parallel platform</a> </p> <a href="https://publications.waset.org/abstracts/54812/dynamic-analysis-of-offshore-2-husu-parallel-platform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54812.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">345</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">1181</span> Designing a Robust Controller for a 6 Linkage Robot </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=G.%20Khamooshian">G. Khamooshian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the main points of application of the mechanisms of the series and parallel is the subject of managing them. The control of this mechanism and similar mechanisms is one that has always been the intention of the scholars. On the other hand, modeling the behavior of the system is difficult due to the large number of its parameters, and it leads to complex equations that are difficult to solve and eventually difficult to control. In this paper, a six-linkage robot has been presented that could be used in different areas such as medical robots. Using these robots needs a robust control. In this paper, the system equations are first found, and then the system conversion function is written. A new controller has been designed for this robot which could be used in other parallel robots and could be very useful. Parallel robots are so important in robotics because of their stability, so methods for control of them are important and the robust controller, especially in parallel robots, makes a sense. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=3-RRS" title="3-RRS">3-RRS</a>, <a href="https://publications.waset.org/abstracts/search?q=6%20linkage" title=" 6 linkage"> 6 linkage</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20robot" title=" parallel robot"> parallel robot</a>, <a href="https://publications.waset.org/abstracts/search?q=control" title=" control"> control</a> </p> <a href="https://publications.waset.org/abstracts/100326/designing-a-robust-controller-for-a-6-linkage-robot" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/100326.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">158</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">1180</span> Parallel Querying of Distributed Ontologies with Shared Vocabulary</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sharjeel%20Aslam">Sharjeel Aslam</a>, <a href="https://publications.waset.org/abstracts/search?q=Vassil%20Vassilev"> Vassil Vassilev</a>, <a href="https://publications.waset.org/abstracts/search?q=Karim%20Ouazzane"> Karim Ouazzane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ontologies and various semantic repositories became a convenient approach for implementing model-driven architectures of distributed systems on the Web. SPARQL is the standard query language for querying such. However, although SPARQL is well-established standard for querying semantic repositories in RDF and OWL format and there are commonly used APIs which supports it, like Jena for Java, its parallel option is not incorporated in them. This article presents a complete framework consisting of an object algebra for parallel RDF and an index-based implementation of the parallel query engine capable of dealing with the distributed RDF ontologies which share common vocabulary. It has been implemented in Java, and for validation of the algorithms has been applied to the problem of organizing virtual exhibitions on the Web. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20ontologies" title="distributed ontologies">distributed ontologies</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20querying" title=" parallel querying"> parallel querying</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20indexing" title=" semantic indexing"> semantic indexing</a>, <a href="https://publications.waset.org/abstracts/search?q=shared%20vocabulary" title=" shared vocabulary"> shared vocabulary</a>, <a href="https://publications.waset.org/abstracts/search?q=SPARQL" title=" SPARQL"> SPARQL</a> </p> <a href="https://publications.waset.org/abstracts/105046/parallel-querying-of-distributed-ontologies-with-shared-vocabulary" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/105046.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">204</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">1179</span> Parallel Coordinates on a Spiral Surface for Visualizing High-Dimensional Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chris%20Suma">Chris Suma</a>, <a href="https://publications.waset.org/abstracts/search?q=Yingcai%20Xiao"> Yingcai Xiao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents Parallel Coordinates on a Spiral Surface (PCoSS), a parallel coordinate based interactive visualization method for high-dimensional data, and a test implementation of the method. Plots generated by the test system are compared with those generated by XDAT, a software implementing traditional parallel coordinates. Traditional parallel coordinate plots can be cluttered when the number of data points is large or when the dimensionality of the data is high. PCoSS plots display multivariate data on a 3D spiral surface and allow users to see the whole picture of high-dimensional data with less cluttering. Taking advantage of the 3D display environment in PCoSS, users can further reduce cluttering by zooming into an axis of interest for a closer view or by moving vantage points and by reorienting the viewing angle to obtain a desired view of the plots. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=human%20computer%20interaction" title="human computer interaction">human computer interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20coordinates" title=" parallel coordinates"> parallel coordinates</a>, <a href="https://publications.waset.org/abstracts/search?q=spiral%20surface" title=" spiral surface"> spiral surface</a>, <a href="https://publications.waset.org/abstracts/search?q=visualization" title=" visualization"> visualization</a> </p> <a href="https://publications.waset.org/abstracts/193466/parallel-coordinates-on-a-spiral-surface-for-visualizing-high-dimensional-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/193466.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">11</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">1178</span> Parallel Random Number Generation for the Modern Supercomputer Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Roman%20Snytsar">Roman Snytsar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Pseudo-random numbers are often used in scientific computing such as the Monte Carlo Simulations or the Quantum Inspired Optimization. Requirements for a parallel random number generator running in the modern multi-core vector environment are more stringent than those for sequential random number generators. As well as passing the usual quality tests, the output of the parallel random number generator must be verifiable and reproducible throughout the concurrent execution. We propose a family of vectorized Permuted Congruential Generators. Implementations are available for multiple modern vector modern computer architectures. Besides demonstrating good single core performance, the generators scale easily across many processor cores and multiple distributed nodes. We provide performance and parallel speedup analysis and comparisons between the implementations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pseudo-random%20numbers" title="pseudo-random numbers">pseudo-random numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20optimization" title=" quantum optimization"> quantum optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=SIMD" title=" SIMD"> SIMD</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/152951/parallel-random-number-generation-for-the-modern-supercomputer-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152951.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">120</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">1177</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">1176</span> Pushing the Boundary of Parallel Tractability for Ontology Materialization via Boolean Circuits</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhangquan%20Zhou">Zhangquan Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Guilin%20Qi"> Guilin Qi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Materialization is an important reasoning service for applications built on the Web Ontology Language (OWL). To make materialization efficient in practice, current research focuses on deciding tractability of an ontology language and designing parallel reasoning algorithms. However, some well-known large-scale ontologies, such as YAGO, have been shown to have good performance for parallel reasoning, but they are expressed in ontology languages that are not parallelly tractable, i.e., the reasoning is inherently sequential in the worst case. This motivates us to study the problem of parallel tractability of ontology materialization from a theoretical perspective. That is we aim to identify the ontologies for which materialization is parallelly tractable, i.e., in the NC complexity. Since the NC complexity is defined based on Boolean circuit that is widely used to investigate parallel computing problems, we first transform the problem of materialization to evaluation of Boolean circuits, and then study the problem of parallel tractability based on circuits. In this work, we focus on datalog rewritable ontology languages. We use Boolean circuits to identify two classes of datalog rewritable ontologies (called parallelly tractable classes) such that materialization over them is parallelly tractable. We further investigate the parallel tractability of materialization of a datalog rewritable OWL fragment DHL (Description Horn Logic). Based on the above results, we analyze real-world datasets and show that many ontologies expressed in DHL belong to the parallelly tractable classes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ontology%20materialization" title="ontology materialization">ontology materialization</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20reasoning" title=" parallel reasoning"> parallel reasoning</a>, <a href="https://publications.waset.org/abstracts/search?q=datalog" title=" datalog"> datalog</a>, <a href="https://publications.waset.org/abstracts/search?q=Boolean%20circuit" title=" Boolean circuit"> Boolean circuit</a> </p> <a href="https://publications.waset.org/abstracts/57402/pushing-the-boundary-of-parallel-tractability-for-ontology-materialization-via-boolean-circuits" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57402.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">271</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">1175</span> Comparative Analysis of Classical and Parallel Inpainting Algorithms Based on Affine Combinations of Projections on Convex Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Irina%20Maria%20Artinescu">Irina Maria Artinescu</a>, <a href="https://publications.waset.org/abstracts/search?q=Costin%20Radu%20Boldea"> Costin Radu Boldea</a>, <a href="https://publications.waset.org/abstracts/search?q=Eduard-Ionut%20Matei"> Eduard-Ionut Matei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper is a comparative study of two classical variants of parallel projection methods for solving the convex feasibility problem with their equivalents that involve variable weights in the construction of the solutions. We used a graphical representation of these methods for inpainting a convex area of an image in order to investigate their effectiveness in image reconstruction applications. We also presented a numerical analysis of the convergence of these four algorithms in terms of the average number of steps and execution time in classical CPU and, alternatively, in parallel GPU implementation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convex%20feasibility%20problem" title="convex feasibility problem">convex feasibility problem</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20analysis" title=" convergence analysis"> convergence analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=inpainting" title=" inpainting"> inpainting</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20projection%20methods" title=" parallel projection methods"> parallel projection methods</a> </p> <a href="https://publications.waset.org/abstracts/133736/comparative-analysis-of-classical-and-parallel-inpainting-algorithms-based-on-affine-combinations-of-projections-on-convex-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133736.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">174</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">1174</span> Achievable Average Secrecy Rates over Bank of Parallel Independent Fading Channels with Friendly Jamming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Munnujahan%20Ara">Munnujahan Ara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate the effect of friendly jamming power allocation strategies on the achievable average secrecy rate over a bank of parallel fading wiretap channels. We investigate the achievable average secrecy rate in parallel fading wiretap channels subject to Rayleigh and Rician fading. The achievable average secrecy rate, due to the presence of a line-of-sight component in the jammer channel is also evaluated. Moreover, we study the detrimental effect of correlation across the parallel sub-channels, and evaluate the corresponding decrease in the achievable average secrecy rate for the various fading configurations. We also investigate the tradeoff between the transmission power and the jamming power for a fixed total power budget. Our results, which are applicable to current orthogonal frequency division multiplexing (OFDM) communications systems, shed further light on the achievable average secrecy rates over a bank of parallel fading channels in the presence of friendly jammers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fading%20parallel%20channels" title="fading parallel channels">fading parallel channels</a>, <a href="https://publications.waset.org/abstracts/search?q=wire-tap%20channel" title=" wire-tap channel"> wire-tap channel</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDM" title=" OFDM"> OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=secrecy%20capacity" title=" secrecy capacity"> secrecy capacity</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20allocation" title=" power allocation"> power allocation</a> </p> <a href="https://publications.waset.org/abstracts/25080/achievable-average-secrecy-rates-over-bank-of-parallel-independent-fading-channels-with-friendly-jamming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25080.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">512</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">1173</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">1172</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">415</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">1171</span> Study of Temperature Difference and Current Distribution in Parallel-Connected Cells at Low Temperature</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sara%20Kamalisiahroudi">Sara Kamalisiahroudi</a>, <a href="https://publications.waset.org/abstracts/search?q=Jun%20Huang"> Jun Huang</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhe%20Li"> Zhe Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianbo%20Zhang"> Jianbo Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Two types of commercial cylindrical lithium ion batteries (Panasonic 3.4 Ah NCR-18650B and Samsung 2.9 Ah INR-18650), were investigated experimentally. The capacities of these samples were individually measured using constant current-constant voltage (CC-CV) method at different ambient temperatures (-10 ℃, 0 ℃, 25 ℃). Their internal resistance was determined by electrochemical impedance spectroscopy (EIS) and pulse discharge methods. The cells with different configurations of parallel connection NCR-NCR, INR-INR and NCR-INR were charged/discharged at the aforementioned ambient temperatures. The results showed that the difference of internal resistance between cells much more evident at low temperatures. Furthermore, the parallel connection of NCR-NCR exhibits the most uniform temperature distribution in cells at -10 ℃, this feature is quite favorable for the safety of the battery pack. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=batteries%20in%20parallel%20connection" title="batteries in parallel connection">batteries in parallel connection</a>, <a href="https://publications.waset.org/abstracts/search?q=internal%20resistance" title=" internal resistance"> internal resistance</a>, <a href="https://publications.waset.org/abstracts/search?q=low%20temperature" title=" low temperature"> low temperature</a>, <a href="https://publications.waset.org/abstracts/search?q=temperature%20difference" title=" temperature difference"> temperature difference</a>, <a href="https://publications.waset.org/abstracts/search?q=current%20distribution" title=" current distribution"> current distribution</a> </p> <a href="https://publications.waset.org/abstracts/14226/study-of-temperature-difference-and-current-distribution-in-parallel-connected-cells-at-low-temperature" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/14226.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">478</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">1170</span> 4-DOFs Parallel Mechanism for Minimally Invasive Robotic Surgery</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Khalil%20Ibrahim">Khalil Ibrahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Ramadan"> Ahmed Ramadan</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Fanni"> Mohamed Fanni</a>, <a href="https://publications.waset.org/abstracts/search?q=Yo%20Kobayashi"> Yo Kobayashi</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Abo-Ismail"> Ahmed Abo-Ismail</a>, <a href="https://publications.waset.org/abstracts/search?q=Masakatus%20G.%20Fujie"> Masakatus G. Fujie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the design process and the dynamic control simulation of a new type of 4-DOFs parallel mechanism that can be used as an endoscopic surgical manipulator. The proposed mechanism, 2-PUU_2-PUS, is designed based on the screw theory and the parallel virtual chain type synthesis method. Based on the structure analysis of the 4-DOF parallel mechanism, the inverse position equation is studied using the inverse analysis theory of kinematics. The design and the stress analysis of the mechanism are investigated using SolidWorks software. The virtual prototype of the parallel mechanism is constructed, and the dynamic simulation is performed using ADAMS TM software. The system model utilizing PID and PI controllers has been built using MATLAB software. A more realistic simulation in accordance with a given bending angle and point to point control is implemented by the use of both ADAMS/MATLAB software. The simulation results showed that this control method has solved the coordinate control for the 4-DOF parallel manipulator so that each output is feedback to the four driving rods. From the results, the tracking performance is achieved. Other control techniques, such as intelligent ones, are recommended to improve the tracking performance and reduce the numerical truncation error. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20mechanisms" title="parallel mechanisms">parallel mechanisms</a>, <a href="https://publications.waset.org/abstracts/search?q=medical%20robotics" title=" medical robotics"> medical robotics</a>, <a href="https://publications.waset.org/abstracts/search?q=tracjectory%20control" title=" tracjectory control"> tracjectory control</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20chain%20type%20synthesis%20method" title=" virtual chain type synthesis method"> virtual chain type synthesis method</a> </p> <a href="https://publications.waset.org/abstracts/30373/4-dofs-parallel-mechanism-for-minimally-invasive-robotic-surgery" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/30373.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">468</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">1169</span> Exploring MPI-Based Parallel Computing in Analyzing Very Large Sequences</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bilal%20Wajid">Bilal Wajid</a>, <a href="https://publications.waset.org/abstracts/search?q=Erchin%20Serpedin"> Erchin Serpedin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The health industry is aiming towards personalized medicine. If the patient’s genome needs to be sequenced it is important that the entire analysis be completed quickly. This paper explores use of parallel computing to analyze very large sequences. Two cases have been considered. In the first case, the sequence is kept constant and the effect of increasing the number of MPI-based processes is evaluated in terms of execution time, speed and efficiency. In the second case the number of MPI-based processes have been kept constant whereas, the length of the sequence was increased. <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=alignment" title=" alignment"> alignment</a>, <a href="https://publications.waset.org/abstracts/search?q=genome%20assembly" title=" genome assembly"> genome assembly</a>, <a href="https://publications.waset.org/abstracts/search?q=alignment" title=" alignment"> alignment</a> </p> <a href="https://publications.waset.org/abstracts/40924/exploring-mpi-based-parallel-computing-in-analyzing-very-large-sequences" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40924.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">274</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">1168</span> Security Over OFDM Fading Channels with Friendly Jammer</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Munnujahan%20Ara">Munnujahan Ara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate the effect of friendly jamming power allocation strategies on the achievable average secrecy rate over a bank of parallel fading wiretap channels. We investigate the achievable average secrecy rate in parallel fading wiretap channels subject to Rayleigh and Rician fading. The achievable average secrecy rate, due to the presence of a line-of-sight component in the jammer channel is also evaluated. Moreover, we study the detrimental effect of correlation across the parallel sub-channels, and evaluate the corresponding decrease in the achievable average secrecy rate for the various fading configurations. We also investigate the tradeoff between the transmission power and the jamming power for a fixed total power budget. Our results, which are applicable to current orthogonal frequency division multiplexing (OFDM) communications systems, shed further light on the achievable average secrecy rates over a bank of parallel fading channels in the presence of friendly jammers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fading%20parallel%20channels" title="fading parallel channels">fading parallel channels</a>, <a href="https://publications.waset.org/abstracts/search?q=wire-tap%20channel" title=" wire-tap channel"> wire-tap channel</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDM" title=" OFDM"> OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=secrecy%20capacity" title=" secrecy capacity"> secrecy capacity</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20allocation" title=" power allocation"> power allocation</a> </p> <a href="https://publications.waset.org/abstracts/25078/security-over-ofdm-fading-channels-with-friendly-jammer" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25078.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">503</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">1167</span> Numerical Studies for Standard Bi-Conjugate Gradient Stabilized Method and the Parallel Variants for Solving Linear Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kuniyoshi%20Abe">Kuniyoshi Abe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Bi-conjugate gradient (Bi-CG) is a well-known method for solving linear equations Ax = b, for x, where A is a given n-by-n matrix, and b is a given n-vector. Typically, the dimension of the linear equation is high and the matrix is sparse. A number of hybrid Bi-CG methods such as conjugate gradient squared (CGS), Bi-CG stabilized (Bi-CGSTAB), BiCGStab2, and BiCGstab(l) have been developed to improve the convergence of Bi-CG. Bi-CGSTAB has been most often used for efficiently solving the linear equation, but we have seen the convergence behavior with a long stagnation phase. In such cases, it is important to have Bi-CG coefficients that are as accurate as possible, and the stabilization strategy, which stabilizes the computation of the Bi-CG coefficients, has been proposed. It may avoid stagnation and lead to faster computation. Motivated by a large number of processors in present petascale high-performance computing hardware, the scalability of Krylov subspace methods on parallel computers has recently become increasingly prominent. The main bottleneck for efficient parallelization is the inner products which require a global reduction. The resulting global synchronization phases cause communication overhead on parallel computers. The parallel variants of Krylov subspace methods reducing the number of global communication phases and hiding the communication latency have been proposed. However, the numerical stability, specifically, the convergence speed of the parallel variants of Bi-CGSTAB may become worse than that of the standard Bi-CGSTAB. In this paper, therefore, we compare the convergence speed between the standard Bi-CGSTAB and the parallel variants by numerical experiments and show that the convergence speed of the standard Bi-CGSTAB is faster than the parallel variants. Moreover, we propose the stabilization strategy for the parallel variants. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bi-conjugate%20gradient%20stabilized%20method" title="bi-conjugate gradient stabilized method">bi-conjugate gradient stabilized method</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20speed" title=" convergence speed"> convergence speed</a>, <a href="https://publications.waset.org/abstracts/search?q=Krylov%20subspace%20methods" title=" Krylov subspace methods"> Krylov subspace methods</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20equations" title=" linear equations"> linear equations</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20variant" title=" parallel variant"> parallel variant</a> </p> <a href="https://publications.waset.org/abstracts/96373/numerical-studies-for-standard-bi-conjugate-gradient-stabilized-method-and-the-parallel-variants-for-solving-linear-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96373.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">164</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">1166</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">1165</span> The Characteristics of Settlement Owing to the Construction of Several Parallel Tunnels with Short Distances</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lojain%20Suliman">Lojain Suliman</a>, <a href="https://publications.waset.org/abstracts/search?q=Xinrong%20Liu"> Xinrong Liu</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiaohan%20Zhou"> Xiaohan Zhou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since most tunnels are built in crowded metropolitan settings, the excavation process must take place in highly condensed locations, including high-density cities. In this way, the tunnels are typically located close together, which leads to more interaction between the parallel existing tunnels, and this, in turn, leads to more settlement. This research presents an examination of the impact of a large-scale tunnel excavation on two forms of settlement: surface settlement and settlement surrounding the tunnel. Additionally, research has been done on the properties of interactions between two and three parallel tunnels. The settlement has been evaluated using three primary techniques: theoretical modeling, numerical simulation, and data monitoring. Additionally, a parametric investigation on how distance affects the settlement characteristic for parallel tunnels with short distances has been completed. Additionally, it has been observed that the sequence of excavation has an impact on the behavior of settlements. Nevertheless, a comparison of the model test and numerical simulation yields significant agreement in terms of settlement trend and value. Additionally, when compared to the FEM study, the suggested analytical solution exhibits reduced sensitivity in the settlement prediction. For example, the settlement of the small tunnel diameter does not appear clearly on the settlement curve, while it is notable in the FEM analysis. It is advised, however, that additional studies be conducted in the future employing analytical solutions for settlement prediction for parallel tunnels. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=settlement" title="settlement">settlement</a>, <a href="https://publications.waset.org/abstracts/search?q=FEM" title=" FEM"> FEM</a>, <a href="https://publications.waset.org/abstracts/search?q=analytical%20solution" title=" analytical solution"> analytical solution</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20tunnels" title=" parallel tunnels"> parallel tunnels</a> </p> <a href="https://publications.waset.org/abstracts/187803/the-characteristics-of-settlement-owing-to-the-construction-of-several-parallel-tunnels-with-short-distances" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/187803.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">36</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">1164</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">1163</span> GPU-Accelerated Triangle Mesh Simplification Using Parallel Vertex Removal</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Odaker">Thomas Odaker</a>, <a href="https://publications.waset.org/abstracts/search?q=Dieter%20Kranzlmueller"> Dieter Kranzlmueller</a>, <a href="https://publications.waset.org/abstracts/search?q=Jens%20Volkert"> Jens Volkert</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present an approach to triangle mesh simplification designed to be executed on the GPU. We use a quadric error metric to calculate an error value for each vertex of the mesh and order all vertices based on this value. This step is followed by the parallel removal of a number of vertices with the lowest calculated error values. To allow for the parallel removal of multiple vertices we use a set of per-vertex boundaries that prevent mesh foldovers even when simplification operations are performed on neighbouring vertices. We execute multiple iterations of the calculation of the vertex errors, ordering of the error values and removal of vertices until either a desired number of vertices remains in the mesh or a minimum error value is reached. This parallel approach is used to speed up the simplification process while maintaining mesh topology and avoiding foldovers at every step of the simplification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer%20graphics" title="computer graphics">computer graphics</a>, <a href="https://publications.waset.org/abstracts/search?q=half%20edge%20collapse" title=" half edge collapse"> half edge collapse</a>, <a href="https://publications.waset.org/abstracts/search?q=mesh%20simplification" title=" mesh simplification"> mesh simplification</a>, <a href="https://publications.waset.org/abstracts/search?q=precomputed%20simplification" title=" precomputed simplification"> precomputed simplification</a>, <a href="https://publications.waset.org/abstracts/search?q=topology%20preserving" title=" topology preserving"> topology preserving</a> </p> <a href="https://publications.waset.org/abstracts/36600/gpu-accelerated-triangle-mesh-simplification-using-parallel-vertex-removal" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36600.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">367</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">1162</span> Parallel Asynchronous Multi-Splitting Methods for Differential Algebraic Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malika%20Elkyal">Malika Elkyal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider an iterative parallel multi-splitting method for differential algebraic equations. The main feature of the proposed idea is to use the asynchronous form. We prove that the multi-splitting technique can effectively accelerate the convergent performance of the iterative process. The main characteristic of an asynchronous mode is that the local algorithm does not have to wait at predetermined messages to become available. We allow some processors to communicate more frequently than others, and we allow the communication delays to be substantial and unpredictable. Accordingly, we note that synchronous algorithms in the computer science sense are particular cases of our formulation of asynchronous one. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20methods" title="parallel methods">parallel methods</a>, <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20mode" title=" asynchronous mode"> asynchronous mode</a>, <a href="https://publications.waset.org/abstracts/search?q=multisplitting" title=" multisplitting"> multisplitting</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%20algebraic%20equations" title=" differential algebraic equations"> differential algebraic equations</a> </p> <a href="https://publications.waset.org/abstracts/20673/parallel-asynchronous-multi-splitting-methods-for-differential-algebraic-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20673.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">558</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">1161</span> Natural Convection between Two Parallel Wavy Plates</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Si%20Abdallah%20Mayouf">Si Abdallah Mayouf</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, the effects of the wavy surface on free convection heat transfer boundary layer flow between two parallel wavy plates have been studied numerically. The two plates are considered at a constant temperature. The equations and the boundary conditions are discretized by the finite difference scheme and solved numerically using the Gauss-Seidel algorithm. The important parameters in this problem are the amplitude of the wavy surfaces and the distance between the two wavy plates. Results are presented as velocity profiles, temperature profiles and local Nusselt number according to the important parameters. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=free%20convection" title="free convection">free convection</a>, <a href="https://publications.waset.org/abstracts/search?q=wavy%20surface" title=" wavy surface"> wavy surface</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20plates" title=" parallel plates"> parallel plates</a>, <a href="https://publications.waset.org/abstracts/search?q=fluid%20dynamics" title=" fluid dynamics"> fluid dynamics</a> </p> <a href="https://publications.waset.org/abstracts/8329/natural-convection-between-two-parallel-wavy-plates" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8329.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">307</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%202-opt&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%202-opt&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%202-opt&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%202-opt&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%202-opt&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%202-opt&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%202-opt&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%202-opt&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%202-opt&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%202-opt&page=39">39</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%202-opt&page=40">40</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%202-opt&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>