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 jet interaction</title> <meta name="description" content="Search results for: parallel jet interaction"> <meta name="keywords" content="parallel jet interaction"> <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 jet interaction" 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/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 jet interaction"> <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> 1621</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: parallel jet interaction</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1621</span> Performance Comparison of Parallel Sorting Algorithms on the Cluster of Workstations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Lai%20Lai%20Win%20Kyi">Lai Lai Win Kyi</a>, <a href="https://publications.waset.org/search?q=Nay%20Min%20Tun"> Nay Min Tun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Sorting appears the most attention among all computational tasks over the past years because sorted data is at the heart of many computations. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. Many parallel sorting algorithms have been investigated for a variety of parallel computer architectures. In this paper, three parallel sorting algorithms have been implemented and compared in terms of their overall execution time. The algorithms implemented are the odd-even transposition sort, parallel merge sort and parallel rank sort. Cluster of Workstations or Windows Compute Cluster has been used to compare the algorithms implemented. The C# programming language is used to develop the sorting algorithms. The MPI (Message Passing Interface) library has been selected to establish the communication and synchronization between processors. The time complexity for each parallel sorting algorithm will also be mentioned and analyzed.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Cluster%20of%20Workstations" title="Cluster of Workstations">Cluster of Workstations</a>, <a href="https://publications.waset.org/search?q=Parallel%20sorting%20algorithms" title=" Parallel sorting algorithms"> Parallel sorting algorithms</a>, <a href="https://publications.waset.org/search?q=performance%20analysis" title=" performance analysis"> performance analysis</a>, <a href="https://publications.waset.org/search?q=parallel%20computing%20and%20MPI." title=" parallel computing and MPI."> parallel computing and MPI.</a> </p> <a href="https://publications.waset.org/4652/performance-comparison-of-parallel-sorting-algorithms-on-the-cluster-of-workstations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4652/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4652/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4652/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4652/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4652/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4652/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4652/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4652/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4652/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4652/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4652.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">1482</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1620</span> Coupling Concept of two Parallel Research Codes for Two and Three Dimensional Fluid Structure Interaction Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Luciano%20Garelli">Luciano Garelli</a>, <a href="https://publications.waset.org/search?q=Marco%20Schauer"> Marco Schauer</a>, <a href="https://publications.waset.org/search?q=Jorge%20D%E2%80%99Elia"> Jorge D鈥橢lia</a>, <a href="https://publications.waset.org/search?q=Mario%20A.%20Storti"> Mario A. Storti</a>, <a href="https://publications.waset.org/search?q=Sabine%20C.%20Langer"> Sabine C. Langer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper discuss a coupling strategy of two different software packages to provide fluid structure interaction (FSI) analysis. The basic idea is to combine the advantages of the two codes to create a powerful FSI solver for two and three dimensional analysis. The fluid part is computed by a program called PETSc-FEM a software developed at Centro de Investigaci´on de M´etodos Computacionales –CIMEC. The structural part of the coupled process is computed by the research code elementary Parallel Solver – (ELPASO) of the Technische Universit¨at Braunschweig, Institut f¨ur Konstruktionstechnik (IK).</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Computational%20Fluid%20Dynamics%20%28CFD%29" title="Computational Fluid Dynamics (CFD)">Computational Fluid Dynamics (CFD)</a>, <a href="https://publications.waset.org/search?q=Fluid%20Structure%0D%0AInteraction%20%28FSI%29" title=" Fluid Structure Interaction (FSI)"> Fluid Structure Interaction (FSI)</a>, <a href="https://publications.waset.org/search?q=Finite%20Element%20Method%20%28FEM%29." title=" Finite Element Method (FEM)."> Finite Element Method (FEM).</a> </p> <a href="https://publications.waset.org/9998236/coupling-concept-of-two-parallel-research-codes-for-two-and-three-dimensional-fluid-structure-interaction-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9998236/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9998236/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9998236/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9998236/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9998236/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9998236/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9998236/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9998236/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9998236/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9998236/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9998236.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">1943</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1619</span> Concurrent Approach to Data Parallel Model using Java</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Bala%20Dhandayuthapani%20Veerasamy">Bala Dhandayuthapani Veerasamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Parallel programming models exist as an abstraction of hardware and memory architectures. There are several parallel programming models in commonly use; they are shared memory model, thread model, message passing model, data parallel model, hybrid model, Flynn-s models, embarrassingly parallel computations model, pipelined computations model. These models are not specific to a particular type of machine or memory architecture. This paper expresses the model program for concurrent approach to data parallel model through java programming. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Concurrent" title="Concurrent">Concurrent</a>, <a href="https://publications.waset.org/search?q=Data%20Parallel" title=" Data Parallel"> Data Parallel</a>, <a href="https://publications.waset.org/search?q=JDK" title=" JDK"> JDK</a>, <a href="https://publications.waset.org/search?q=Parallel" title=" Parallel"> Parallel</a>, <a href="https://publications.waset.org/search?q=Thread" title=" Thread"> Thread</a> </p> <a href="https://publications.waset.org/5751/concurrent-approach-to-data-parallel-model-using-java" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5751/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5751/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5751/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5751/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5751/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5751/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5751/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5751/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5751/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5751/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5751.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">2097</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1618</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/search?q=Jian%20Zheng">Jian Zheng</a>, <a href="https://publications.waset.org/search?q=Xinhua%20Ni"> Xinhua Ni</a>, <a href="https://publications.waset.org/search?q=Xiequan%20Liu"> Xiequan Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <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> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parallel%20fiber%20eutectic" title="Parallel fiber eutectic">Parallel fiber eutectic</a>, <a href="https://publications.waset.org/search?q=no-damage%20strain" title=" no-damage strain"> no-damage strain</a>, <a href="https://publications.waset.org/search?q=damage%20strain" title=" damage strain"> damage strain</a>, <a href="https://publications.waset.org/search?q=fiber%20volume%20fraction" title=" fiber volume fraction"> fiber volume fraction</a>, <a href="https://publications.waset.org/search?q=damage%20degree." title=" damage degree. "> damage degree. </a> </p> <a href="https://publications.waset.org/10007215/damage-strain-analysis-of-parallel-fiber-eutectic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007215/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007215/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007215/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007215/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007215/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007215/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007215/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007215/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007215/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007215/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007215.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">954</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1617</span> Method of Moments for Analysis of Multiple Crack Interaction in an Isotropic Elastic Solid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Weifeng%20Wang">Weifeng Wang</a>, <a href="https://publications.waset.org/search?q=Xianwei%20Zeng"> Xianwei Zeng</a>, <a href="https://publications.waset.org/search?q=Jianping%20Ding"> Jianping Ding</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem of N cracks interaction in an isotropic elastic solid is decomposed into a subproblem of a homogeneous solid without crack and N subproblems with each having a single crack subjected to unknown tractions on the two crack faces. The unknown tractions, namely pseudo tractions on each crack are expanded into polynomials with unknown coefficients, which have to be determined by the consistency condition, i.e. by the equivalence of the original multiple cracks interaction problem and the superposition of the N+1 subproblems. In this paper, Kachanov-s approach of average tractions is extended into the method of moments to approximately impose the consistence condition. Hence Kachanov-s method can be viewed as the zero-order method of moments. Numerical results of the stress intensity factors are presented for interactions of two collinear cracks, three collinear cracks, two parallel cracks, and three parallel cracks. As the order of moment increases, the accuracy of the method of moments improves. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Crack%20interaction" title="Crack interaction">Crack interaction</a>, <a href="https://publications.waset.org/search?q=stress%20intensity%20factor" title=" stress intensity factor"> stress intensity factor</a>, <a href="https://publications.waset.org/search?q=multiplecracks" title=" multiplecracks"> multiplecracks</a>, <a href="https://publications.waset.org/search?q=method%20of%20moments." title=" method of moments."> method of moments.</a> </p> <a href="https://publications.waset.org/15686/method-of-moments-for-analysis-of-multiple-crack-interaction-in-an-isotropic-elastic-solid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15686/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15686/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15686/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15686/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15686/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15686/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15686/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15686/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15686/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15686/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15686.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">1584</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1616</span> Implementation of Parallel Interface for Microprocessor Trainer</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Moe%20Moe%20Htun">Moe Moe Htun</a>, <a href="https://publications.waset.org/search?q=Khin%20Htar%20Nwe"> Khin Htar Nwe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, parallel interface for microprocessor trainer was implemented. A programmable parallel鈥損ort device such as the IC 8255A is initialized for simple input or output and for handshake input or output by choosing kinds of modes. The hardware connections and the programs can be used to interface microprocessor trainer and a personal computer by using IC 8255A. The assembly programs edited on PC-s editor can be downloaded to the trainer. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parallel%20I%2FO%20ports" title="Parallel I/O ports">Parallel I/O ports</a>, <a href="https://publications.waset.org/search?q=parallel%20interface" title=" parallel interface"> parallel interface</a>, <a href="https://publications.waset.org/search?q=trainer" title=" trainer"> trainer</a>, <a href="https://publications.waset.org/search?q=two%0A8255%20ICs." title=" two 8255 ICs."> two 8255 ICs.</a> </p> <a href="https://publications.waset.org/5447/implementation-of-parallel-interface-for-microprocessor-trainer" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5447/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5447/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5447/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5447/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5447/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5447/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5447/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5447/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5447/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5447/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5447.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">3169</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1615</span> Performance Analysis of Parallel Client-Server Model Versus Parallel Mobile Agent Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=K.%20B.%20Manwade">K. B. Manwade</a>, <a href="https://publications.waset.org/search?q=G.%20A.%20Patil"> G. A. Patil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile agent has motivated the creation of a new methodology for parallel computing. We introduce a methodology for the creation of parallel applications on the network. The proposed Mobile-Agent parallel processing framework uses multiple Javamobile Agents. Each mobile agent can travel to the specified machine in the network to perform its tasks. We also introduce the concept of master agent, which is Java object capable of implementing a particular task of the target application. Master agent is dynamically assigns the task to mobile agents. We have developed and tested a prototype application: Mobile Agent Based Parallel Computing. Boosted by the inherited benefits of using Java and Mobile Agents, our proposed methodology breaks the barriers between the environments, and could potentially exploit in a parallel manner all the available computational resources on the network. This paper elaborates performance issues of a mobile agent for parallel computing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parallel%20Computing" title="Parallel Computing">Parallel Computing</a>, <a href="https://publications.waset.org/search?q=Mobile%20Agent." title=" Mobile Agent."> Mobile Agent.</a> </p> <a href="https://publications.waset.org/4948/performance-analysis-of-parallel-client-server-model-versus-parallel-mobile-agent-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/4948/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/4948/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/4948/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/4948/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/4948/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/4948/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/4948/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/4948/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/4948/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/4948/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/4948.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">1653</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1614</span> A Technique for Reachability Graph Generation for the Petri Net Models of Parallel Processes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Farooq%20Ahmad">Farooq Ahmad</a>, <a href="https://publications.waset.org/search?q=Hejiao%20Huang"> Hejiao Huang</a>, <a href="https://publications.waset.org/search?q=Xiaolong%20Wang"> Xiaolong Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Reachability graph (RG) generation suffers from the problem of exponential space and time complexity. To alleviate the more critical problem of time complexity, this paper presents the new approach for RG generation for the Petri net (PN) models of parallel processes. Independent RGs for each parallel process in the PN structure are generated in parallel and cross-product of these RGs turns into the exhaustive state space from which the RG of given parallel system is determined. The complexity analysis of the presented algorithm illuminates significant decrease in the time complexity cost of RG generation. The proposed technique is applicable to parallel programs having multiple threads with the synchronization problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parallel%20processes" title="Parallel processes">Parallel processes</a>, <a href="https://publications.waset.org/search?q=Petri%20net" title=" Petri net"> Petri net</a>, <a href="https://publications.waset.org/search?q=reachability%20graph" title=" reachability graph"> reachability graph</a>, <a href="https://publications.waset.org/search?q=time%0Acomplexity." title=" time complexity."> time complexity.</a> </p> <a href="https://publications.waset.org/14513/a-technique-for-reachability-graph-generation-for-the-petri-net-models-of-parallel-processes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14513/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14513/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14513/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14513/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14513/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14513/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14513/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14513/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14513/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14513/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14513.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">2014</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1613</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/search?q=Dimitris%20Varsamis">Dimitris Varsamis</a>, <a href="https://publications.waset.org/search?q=Christos%20Talagkozis"> Christos Talagkozis</a>, <a href="https://publications.waset.org/search?q=Alkiviadis%20Tsimpiris"> Alkiviadis Tsimpiris</a>, <a href="https://publications.waset.org/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/search?q=K-means%20algorithm" title="K-means algorithm">K-means algorithm</a>, <a href="https://publications.waset.org/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/search?q=parallel%20computations" title=" parallel computations"> parallel computations</a>, <a href="https://publications.waset.org/search?q=MATLAB." title=" MATLAB."> MATLAB.</a> </p> <a href="https://publications.waset.org/10008128/a-parallel-implementation-of-k-means-in-matlab" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10008128/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10008128/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10008128/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10008128/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10008128/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10008128/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10008128/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10008128/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10008128/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10008128/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10008128.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">1157</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1612</span> Harmonic Reduction In Three-Phase Parallel Connected Inverter</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=M.A.A.%20Younis">M.A.A. Younis</a>, <a href="https://publications.waset.org/search?q=N.%20A.%20Rahim"> N. A. Rahim</a>, <a href="https://publications.waset.org/search?q=S.%20Mekhilef"> S. Mekhilef</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the design and analysis of a parallel connected inverter configuration of. The configuration consists of parallel connected three-phase dc/ac inverter. Series resistors added to the inverter output to maintain same current in each inverter of the two parallel inverters, and to reduce the circulating current in the parallel inverters to the minimum. High frequency third harmonic injection PWM (THIPWM) employed to reduce the total harmonic distortion and to make maximum use of the voltage source. DSP was used to generate the THIPWM and the control algorithm for the converter. Selected experimental results have been shown to validate the proposed system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Three-phase%20inverter" title="Three-phase inverter">Three-phase inverter</a>, <a href="https://publications.waset.org/search?q=Third%20harmonic%20injection%20PWM" title=" Third harmonic injection PWM"> Third harmonic injection PWM</a>, <a href="https://publications.waset.org/search?q=inverters%20parallel%20connection." title="inverters parallel connection.">inverters parallel connection.</a> </p> <a href="https://publications.waset.org/6565/harmonic-reduction-in-three-phase-parallel-connected-inverter" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/6565/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/6565/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/6565/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/6565/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/6565/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/6565/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/6565/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/6565/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/6565/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/6565/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/6565.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">3775</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1611</span> Network Based High Performance Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Karanjeet%20Singh%20Kahlon">Karanjeet Singh Kahlon</a>, <a href="https://publications.waset.org/search?q=Gurvinder%20Singh"> Gurvinder Singh</a>, <a href="https://publications.waset.org/search?q=Arjan%20Singh"> Arjan Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In the past few years there is a change in the view of high performance applications and parallel computing. Initially such applications were targeted towards dedicated parallel machines. Recently trend is changing towards building meta-applications composed of several modules that exploit heterogeneous platforms and employ hybrid forms of parallelism. The aim of this paper is to propose a model of virtual parallel computing. Virtual parallel computing system provides a flexible object oriented software framework that makes it easy for programmers to write various parallel applications.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Applet" title="Applet">Applet</a>, <a href="https://publications.waset.org/search?q=Efficiency" title=" Efficiency"> Efficiency</a>, <a href="https://publications.waset.org/search?q=Java" title=" Java"> Java</a>, <a href="https://publications.waset.org/search?q=LAN" title=" LAN"> LAN</a> </p> <a href="https://publications.waset.org/2595/network-based-high-performance-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2595/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2595/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2595/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2595/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2595/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2595/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2595/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2595/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2595/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2595/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2595.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">1905</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1610</span> Some Results on Parallel Alternating Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Guangbin%20Wang">Guangbin Wang</a>, <a href="https://publications.waset.org/search?q=Fuping%20Tan"> Fuping Tan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we investigate two parallel alternating methods for solving the system of linear equations Ax = b and give convergence theorems for the parallel alternating methods when the coefficient matrix is a nonsingular H-matrix. Furthermore, we give one example to show our results.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Nonsingular%20H-matrix" title="Nonsingular H-matrix">Nonsingular H-matrix</a>, <a href="https://publications.waset.org/search?q=parallel%20alternating%20method" title=" parallel alternating method"> parallel alternating method</a>, <a href="https://publications.waset.org/search?q=convergence." title=" convergence."> convergence.</a> </p> <a href="https://publications.waset.org/2676/some-results-on-parallel-alternating-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2676/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2676/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2676/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2676/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2676/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2676/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2676/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2676/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2676/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2676/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2676.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">1103</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1609</span> A Parallel Quadtree Approach for Image Compression using Wavelets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hamed%20Vahdat%20Nejad">Hamed Vahdat Nejad</a>, <a href="https://publications.waset.org/search?q=Hossein%20Deldari"> Hossein Deldari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Wavelet transforms are multiresolution decompositions that can be used to analyze signals and images. Image compression is one of major applications of wavelet transforms in image processing. It is considered as one of the most powerful methods that provides a high compression ratio. However, its implementation is very time-consuming. At the other hand, parallel computing technologies are an efficient method for image compression using wavelets. In this paper, we propose a parallel wavelet compression algorithm based on quadtrees. We implement the algorithm using MatlabMPI (a parallel, message passing version of Matlab), and compute its isoefficiency function, and show that it is scalable. Our experimental results confirm the efficiency of the algorithm also. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Image%20compression" title="Image compression">Image compression</a>, <a href="https://publications.waset.org/search?q=MPI" title=" MPI"> MPI</a>, <a href="https://publications.waset.org/search?q=Parallel%20computing" title=" Parallel computing"> Parallel computing</a>, <a href="https://publications.waset.org/search?q=Wavelets." title=" Wavelets."> Wavelets.</a> </p> <a href="https://publications.waset.org/10464/a-parallel-quadtree-approach-for-image-compression-using-wavelets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10464/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10464/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10464/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10464/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10464/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10464/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10464/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10464/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10464/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10464/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10464.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">2024</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1608</span> A Constitutive Model of Ligaments and Tendons Accounting for Fiber-Matrix Interaction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ratchada%20Sopakayang">Ratchada Sopakayang</a>, <a href="https://publications.waset.org/search?q=Gerhard%20A.%20Holzapfel"> Gerhard A. Holzapfel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, a new constitutive model is developed to describe the hyperelastic behavior of collagenous tissues with a parallel arrangement of collagen fibers such as ligaments and tendons. The model is formulated using a continuum approach incorporating the structural changes of the main tissue components: collagen fibers, proteoglycan-rich matrix and fiber-matrix interaction. The mechanical contribution of the interaction between the fibers and the matrix is simply expressed by a coupling term. The structural change of the collagen fibers is incorporated in the constitutive model to describe the activation of the fibers under tissue straining. Finally, the constitutive model can easily describe the stress-stretch nonlinearity which occurs when a ligament/tendon is axially stretched. This study shows that the interaction between the fibers and the matrix contributes to the mechanical tissue response. Therefore, the model may lead to a better understanding of the physiological mechanisms of ligaments and tendons under axial loading. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Hyperelasticity" title="Hyperelasticity">Hyperelasticity</a>, <a href="https://publications.waset.org/search?q=constitutive%20model" title=" constitutive model"> constitutive model</a>, <a href="https://publications.waset.org/search?q=fiber-matrix%0D%0Ainteraction" title=" fiber-matrix interaction"> fiber-matrix interaction</a>, <a href="https://publications.waset.org/search?q=ligament" title=" ligament"> ligament</a>, <a href="https://publications.waset.org/search?q=tendon." title=" tendon."> tendon.</a> </p> <a href="https://publications.waset.org/10007100/a-constitutive-model-of-ligaments-and-tendons-accounting-for-fiber-matrix-interaction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007100/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007100/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007100/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007100/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007100/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007100/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007100/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007100/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007100/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007100/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007100.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">880</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1607</span> A Consideration of the Achievement of Productive Level Parallel Programming Skills</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Tadayoshi%20Horita">Tadayoshi Horita</a>, <a href="https://publications.waset.org/search?q=Masakazu%20Akiba"> Masakazu Akiba</a>, <a href="https://publications.waset.org/search?q=Mina%20Terauchi"> Mina Terauchi</a>, <a href="https://publications.waset.org/search?q=Tsuneo%20Kanno"> Tsuneo Kanno</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>This paper gives a consideration of the achievement of productive level parallel programming skills, based on the data of the graduation studies in the Polytechnic University of Japan. The data show that most students can achieve only parallel programming skills during the graduation study (about 600 to 700 hours), if the programming environment is limited to GPGPUs. However, the data also show that it is a very high level task that a student achieves productive level parallel programming skills during only the graduation study. In addition, it shows that the parallel programming environments for GPGPU, such as CUDA and OpenCL, may be more suitable for parallel computing education than other environments such as MPI on a cluster system and Cell.B.E. These results must be useful for the areas of not only software developments, but also hardware product developments using computer technologies.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parallel%20computing" title="Parallel computing">Parallel computing</a>, <a href="https://publications.waset.org/search?q=programming%20education" title=" programming education"> programming education</a>, <a href="https://publications.waset.org/search?q=GPU" title=" GPU"> GPU</a>, <a href="https://publications.waset.org/search?q=GPGPU" title=" GPGPU"> GPGPU</a>, <a href="https://publications.waset.org/search?q=CUDA" title=" CUDA"> CUDA</a>, <a href="https://publications.waset.org/search?q=OpenCL" title=" OpenCL"> OpenCL</a>, <a href="https://publications.waset.org/search?q=MPI" title=" MPI"> MPI</a>, <a href="https://publications.waset.org/search?q=Cell.B.E." title=" Cell.B.E."> Cell.B.E.</a> </p> <a href="https://publications.waset.org/17075/a-consideration-of-the-achievement-of-productive-level-parallel-programming-skills" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/17075/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/17075/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/17075/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/17075/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/17075/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/17075/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/17075/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/17075/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/17075/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/17075/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/17075.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">1687</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1606</span> Development of Heterogeneous Parallel Genetic Simulated Annealing Using Multi-Niche Crowding</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Z.%20G.%20Wang">Z. G. Wang</a>, <a href="https://publications.waset.org/search?q=M.%20Rahman"> M. Rahman</a>, <a href="https://publications.waset.org/search?q=Y.%20S.%20Wong"> Y. S. Wong</a>, <a href="https://publications.waset.org/search?q=K.%20S.%20Neo"> K. S. Neo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a new hybrid of genetic algorithm (GA) and simulated annealing (SA), referred to as GSA, is presented. In this algorithm, SA is incorporated into GA to escape from local optima. The concept of hierarchical parallel GA is employed to parallelize GSA for the optimization of multimodal functions. In addition, multi-niche crowding is used to maintain the diversity in the population of the parallel GSA (PGSA). The performance of the proposed algorithms is evaluated against a standard set of multimodal benchmark functions. The multi-niche crowding PGSA and normal PGSA show some remarkable improvement in comparison with the conventional parallel genetic algorithm and the breeder genetic algorithm (BGA). <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Crowding" title="Crowding">Crowding</a>, <a href="https://publications.waset.org/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/search?q=parallel%20geneticalgorithm" title=" parallel geneticalgorithm"> parallel geneticalgorithm</a>, <a href="https://publications.waset.org/search?q=simulated%20annealing." title=" simulated annealing."> simulated annealing.</a> </p> <a href="https://publications.waset.org/5118/development-of-heterogeneous-parallel-genetic-simulated-annealing-using-multi-niche-crowding" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5118/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5118/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5118/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5118/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5118/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5118/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5118/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5118/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5118/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5118/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5118.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">1587</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1605</span> A Parallel Architecture for the Real Time Correction of Stereoscopic Images</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zohir%20Irki">Zohir Irki</a>, <a href="https://publications.waset.org/search?q=Michel%20Devy"> Michel Devy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we will present an architecture for the implementation of a real time stereoscopic images correction's approach. This architecture is parallel and makes use of several memory blocs in which are memorized pre calculated data relating to the cameras used for the acquisition of images. The use of reduced images proves to be essential in the proposed approach; the suggested architecture must so be able to carry out the real time reduction of original images. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Image%20reduction" title="Image reduction">Image reduction</a>, <a href="https://publications.waset.org/search?q=Real-time%20correction" title=" Real-time correction"> Real-time correction</a>, <a href="https://publications.waset.org/search?q=Parallel%0Aarchitecture" title=" Parallel architecture"> Parallel architecture</a>, <a href="https://publications.waset.org/search?q=Parallel%20treatment." title=" Parallel treatment."> Parallel treatment.</a> </p> <a href="https://publications.waset.org/2084/a-parallel-architecture-for-the-real-time-correction-of-stereoscopic-images" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/2084/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/2084/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/2084/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/2084/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/2084/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/2084/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/2084/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/2084/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/2084/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/2084/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/2084.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">1107</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1604</span> Parallel Block Backward Differentiation Formulas For Solving Large Systems of Ordinary Differential Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zarina%20Bibi">Zarina Bibi</a>, <a href="https://publications.waset.org/search?q=I."> I.</a>, <a href="https://publications.waset.org/search?q=Khairil%20Iskandar"> Khairil Iskandar</a>, <a href="https://publications.waset.org/search?q=O."> O.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, parallelism in the solution of Ordinary Differential Equations (ODEs) to increase the computational speed is studied. The focus is the development of parallel algorithm of the two point Block Backward Differentiation Formulas (PBBDF) that can take advantage of the parallel architecture in computer technology. Parallelism is obtained by using Message Passing Interface (MPI). Numerical results are given to validate the efficiency of the PBBDF implementation as compared to the sequential implementation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Ordinary%20differential%20equations" title="Ordinary differential equations">Ordinary differential equations</a>, <a href="https://publications.waset.org/search?q=parallel." title=" parallel."> parallel.</a> </p> <a href="https://publications.waset.org/3114/parallel-block-backward-differentiation-formulas-for-solving-large-systems-of-ordinary-differential-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3114/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3114/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3114/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3114/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3114/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3114/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3114/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3114/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3114/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3114/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3114.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">1668</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1603</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/search?q=Wen-Bao%20Qiao">Wen-Bao Qiao</a>, <a href="https://publications.waset.org/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/search?q=Doubly%20linked%20list" title="Doubly linked list">Doubly linked list</a>, <a href="https://publications.waset.org/search?q=parallel%202-opt" title=" parallel 2-opt"> parallel 2-opt</a>, <a href="https://publications.waset.org/search?q=tour%20division" title=" tour division"> tour division</a>, <a href="https://publications.waset.org/search?q=GPU." title=" GPU."> GPU.</a> </p> <a href="https://publications.waset.org/10006699/parallel-2-opt-local-search-on-gpu" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006699/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006699/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006699/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006699/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006699/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006699/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006699/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006699/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006699/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006699/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006699.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">1223</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1602</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/search?q=G.%20Khamooshian">G. Khamooshian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <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> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=3-RRS" title="3-RRS">3-RRS</a>, <a href="https://publications.waset.org/search?q=6%20linkage" title=" 6 linkage"> 6 linkage</a>, <a href="https://publications.waset.org/search?q=parallel%20robot" title=" parallel robot"> parallel robot</a>, <a href="https://publications.waset.org/search?q=control." title=" control."> control.</a> </p> <a href="https://publications.waset.org/10009798/designing-a-robust-controller-for-a-6-linkage-robot" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10009798/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10009798/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10009798/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10009798/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10009798/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10009798/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10009798/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10009798/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10009798/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10009798/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10009798.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">669</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1601</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/search?q=Xie%20Kefeng">Xie Kefeng</a>, <a href="https://publications.waset.org/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/search?q=2-HUS%2FU%20platform" title="2-HUS/U platform">2-HUS/U platform</a>, <a href="https://publications.waset.org/search?q=Dynamics" title=" Dynamics"> Dynamics</a>, <a href="https://publications.waset.org/search?q=Lagrange" title=" Lagrange"> Lagrange</a>, <a href="https://publications.waset.org/search?q=Parallel%20platform." title=" Parallel platform."> Parallel platform.</a> </p> <a href="https://publications.waset.org/10006236/dynamic-analysis-of-offshore-2-husu-parallel-platform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10006236/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10006236/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10006236/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10006236/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10006236/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10006236/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10006236/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10006236/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10006236/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10006236/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10006236.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">972</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1600</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/search?q=Sharjeel%20Aslam">Sharjeel Aslam</a>, <a href="https://publications.waset.org/search?q=Vassil%20Vassilev"> Vassil Vassilev</a>, <a href="https://publications.waset.org/search?q=Karim%20Ouazzane"> Karim Ouazzane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <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> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Distributed%20ontologies" title="Distributed ontologies">Distributed ontologies</a>, <a href="https://publications.waset.org/search?q=parallel%20querying" title=" parallel querying"> parallel querying</a>, <a href="https://publications.waset.org/search?q=semantic%20indexing" title=" semantic indexing"> semantic indexing</a>, <a href="https://publications.waset.org/search?q=shared%20vocabulary" title=" shared vocabulary"> shared vocabulary</a>, <a href="https://publications.waset.org/search?q=SPARQL." title=" SPARQL."> SPARQL.</a> </p> <a href="https://publications.waset.org/10010391/parallel-querying-of-distributed-ontologies-with-shared-vocabulary" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10010391/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10010391/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10010391/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10010391/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10010391/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10010391/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10010391/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10010391/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10010391/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10010391/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10010391.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">659</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1599</span> Parallel Hybrid Honeypot and IDS Architecture to Detect Network Attacks</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Hafiz%20Gulfam%20Ahmad">Hafiz Gulfam Ahmad</a>, <a href="https://publications.waset.org/search?q=Chuangdong%20Li"> Chuangdong Li</a>, <a href="https://publications.waset.org/search?q=Zeeshan%20Ahmad"> Zeeshan Ahmad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this paper, we have proposed a parallel IDS and honeypot based approach to detect and analyze the unknown and known attack taxonomy for improving the IDS performance and protecting the network from intruders. The main theme of our approach is to record and analyze the intruder activities by using both the low and high interaction honeypots. Our architecture aims to achieve the required goals by combing signature based IDS, honeypots and generate the new signatures. The paper describes the basic component, design and implementation of this approach and also demonstrates the effectiveness of this approach to reduce the probability of network attacks.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Network%20security" title="Network security">Network security</a>, <a href="https://publications.waset.org/search?q=Intrusion%20detection" title=" Intrusion detection"> Intrusion detection</a>, <a href="https://publications.waset.org/search?q=Honeypot" title=" Honeypot"> Honeypot</a>, <a href="https://publications.waset.org/search?q=Snort" title=" Snort"> Snort</a>, <a href="https://publications.waset.org/search?q=Nmap." title=" Nmap."> Nmap.</a> </p> <a href="https://publications.waset.org/9999878/parallel-hybrid-honeypot-and-ids-architecture-to-detect-network-attacks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/9999878/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/9999878/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/9999878/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/9999878/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/9999878/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/9999878/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/9999878/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/9999878/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/9999878/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/9999878/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/9999878.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">2529</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1598</span> JConqurr - A Multi-Core Programming Toolkit for Java</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=G.A.C.P.%20Ganegoda">G.A.C.P. Ganegoda</a>, <a href="https://publications.waset.org/search?q=D.M.A.%20Samaranayake"> D.M.A. Samaranayake</a>, <a href="https://publications.waset.org/search?q=L.S.%20Bandara"> L.S. Bandara</a>, <a href="https://publications.waset.org/search?q=K.A.D.N.K.%20Wimalawarne"> K.A.D.N.K. Wimalawarne</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>With the popularity of the multi-core and many-core architectures there is a great requirement for software frameworks which can support parallel programming methodologies. In this paper we introduce an Eclipse toolkit, JConqurr which is easy to use and provides robust support for flexible parallel progrmaming. JConqurr is a multi-core and many-core programming toolkit for Java which is capable of providing support for common parallel programming patterns which include task, data, divide and conquer and pipeline parallelism. The toolkit uses an annotation and a directive mechanism to convert the sequential code into parallel code. In addition to that we have proposed a novel mechanism to achieve the parallelism using graphical processing units (GPU). Experiments with common parallelizable algorithms have shown that our toolkit can be easily and efficiently used to convert sequential code to parallel code and significant performance gains can be achieved.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Multi-core" title="Multi-core">Multi-core</a>, <a href="https://publications.waset.org/search?q=parallel%20programming%20patterns" title=" parallel programming patterns"> parallel programming patterns</a>, <a href="https://publications.waset.org/search?q=GPU" title=" GPU"> GPU</a>, <a href="https://publications.waset.org/search?q=Java" title=" Java"> Java</a>, <a href="https://publications.waset.org/search?q=Eclipse%20plugin" title=" Eclipse plugin"> Eclipse plugin</a>, <a href="https://publications.waset.org/search?q=toolkit" title=" toolkit"> toolkit</a>, <a href="https://publications.waset.org/search?q=" title=""></a> </p> <a href="https://publications.waset.org/14475/jconqurr-a-multi-core-programming-toolkit-for-java" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14475/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14475/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14475/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14475/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14475/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14475/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14475/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14475/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14475/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14475/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14475.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">2111</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1597</span> A Message Passing Implementation of a New Parallel Arrangement Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ezequiel%20Herruzo">Ezequiel Herruzo</a>, <a href="https://publications.waset.org/search?q=Juan%20Jos%C3%A9%20Cruz"> Juan Jos茅 Cruz</a>, <a href="https://publications.waset.org/search?q=Jos%C3%A9%20Ignacio%20Benavides"> Jos茅 Ignacio Benavides</a>, <a href="https://publications.waset.org/search?q=Oscar%20Plata"> Oscar Plata</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes a new algorithm of arrangement in parallel, based on Odd-Even Mergesort, called division and concurrent mixes. The main idea of the algorithm is to achieve that each processor uses a sequential algorithm for ordering a part of the vector, and after that, for making the processors work in pairs in order to mix two of these sections ordered in a greater one, also ordered; after several iterations, the vector will be completely ordered. The paper describes the implementation of the new algorithm on a Message Passing environment (such as MPI). Besides, it compares the obtained experimental results with the quicksort sequential algorithm and with the parallel implementations (also on MPI) of the algorithms quicksort and bitonic sort. The comparison has been realized in an 8 processors cluster under GNU/Linux which is running on a unique PC processor. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parallel%20algorithm" title="Parallel algorithm">Parallel algorithm</a>, <a href="https://publications.waset.org/search?q=arrangement" title=" arrangement"> arrangement</a>, <a href="https://publications.waset.org/search?q=MPI" title=" MPI"> MPI</a>, <a href="https://publications.waset.org/search?q=sorting" title=" sorting"> sorting</a>, <a href="https://publications.waset.org/search?q=parallel%20program." title=" parallel program."> parallel program.</a> </p> <a href="https://publications.waset.org/13070/a-message-passing-implementation-of-a-new-parallel-arrangement-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13070/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13070/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13070/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13070/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13070/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13070/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13070/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13070/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13070/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13070/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13070.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">1692</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1596</span> Using Multi-Thread Technology Realize Most Short-Path Parallel Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Chang-le%20Lu">Chang-le Lu</a>, <a href="https://publications.waset.org/search?q=Yong%20Chen"> Yong Chen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The shortest path question is in a graph theory model question, and it is applied in many fields. The most short-path question may divide into two kinds: Single sources most short-path, all apexes to most short-path. This article mainly introduces the problem of all apexes to most short-path, and gives a new parallel algorithm of all apexes to most short-path according to the Dijkstra algorithm. At last this paper realizes the parallel algorithms in the technology of C # multithreading. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Dijkstra%20algorithm" title="Dijkstra algorithm">Dijkstra algorithm</a>, <a href="https://publications.waset.org/search?q=parallel%20algorithms" title=" parallel algorithms"> parallel algorithms</a>, <a href="https://publications.waset.org/search?q=multi-thread%0Atechnology" title=" multi-thread technology"> multi-thread technology</a>, <a href="https://publications.waset.org/search?q=most%20short-path" title=" most short-path"> most short-path</a>, <a href="https://publications.waset.org/search?q=ratio." title=" ratio."> ratio.</a> </p> <a href="https://publications.waset.org/5208/using-multi-thread-technology-realize-most-short-path-parallel-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/5208/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/5208/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/5208/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/5208/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/5208/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/5208/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/5208/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/5208/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/5208/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/5208/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/5208.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">2111</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1595</span> Hybrid Honeypot System for Network Security</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Kyi%20Lin%20Lin%20Kyaw">Kyi Lin Lin Kyaw</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Nowadays, we are facing with network threats that cause enormous damage to the Internet community day by day. In this situation, more and more people try to prevent their network security using some traditional mechanisms including firewall, Intrusion Detection System, etc. Among them honeypot is a versatile tool for a security practitioner, of course, they are tools that are meant to be attacked or interacted with to more information about attackers, their motives and tools. In this paper, we will describe usefulness of low-interaction honeypot and high-interaction honeypot and comparison between them. And then we propose hybrid honeypot architecture that combines low and high -interaction honeypot to mitigate the drawback. In this architecture, low-interaction honeypot is used as a traffic filter. Activities like port scanning can be effectively detected by low-interaction honeypot and stop there. Traffic that cannot be handled by low-interaction honeypot is handed over to high-interaction honeypot. In this case, low-interaction honeypot is used as proxy whereas high-interaction honeypot offers the optimal level realism. To prevent the high-interaction honeypot from infections, containment environment (VMware) is used. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Low-interaction%20honeypot" title="Low-interaction honeypot">Low-interaction honeypot</a>, <a href="https://publications.waset.org/search?q=High-interactionhoneypot" title=" High-interactionhoneypot"> High-interactionhoneypot</a>, <a href="https://publications.waset.org/search?q=VMware" title=" VMware"> VMware</a>, <a href="https://publications.waset.org/search?q=Proxy" title=" Proxy"> Proxy</a> </p> <a href="https://publications.waset.org/14105/hybrid-honeypot-system-for-network-security" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14105/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14105/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14105/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14105/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14105/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14105/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14105/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14105/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14105/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14105/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14105.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">2953</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1594</span> Concurrency without Locking in Parallel Hash Structures used for Data Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=%C3%81kos%20Dud%C3%A1s">脕kos Dud谩s</a>, <a href="https://publications.waset.org/search?q=S%C3%A1ndor%20Juh%C3%A1sz"> S谩ndor Juh谩sz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Various mechanisms providing mutual exclusion and thread synchronization can be used to support parallel processing within a single computer. Instead of using locks, semaphores, barriers or other traditional approaches in this paper we focus on alternative ways for making better use of modern multithreaded architectures and preparing hash tables for concurrent accesses. Hash structures will be used to demonstrate and compare two entirely different approaches (rule based cooperation and hardware synchronization support) to an efficient parallel implementation using traditional locks. Comparison includes implementation details, performance ranking and scalability issues. We aim at understanding the effects the parallelization schemes have on the execution environment with special focus on the memory system and memory access characteristics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Lock-free%20synchronization" title="Lock-free synchronization">Lock-free synchronization</a>, <a href="https://publications.waset.org/search?q=mutual%20exclusion" title=" mutual exclusion"> mutual exclusion</a>, <a href="https://publications.waset.org/search?q=parallel%20hash%20tables" title=" parallel hash tables"> parallel hash tables</a>, <a href="https://publications.waset.org/search?q=parallel%20performance" title=" parallel performance"> parallel performance</a> </p> <a href="https://publications.waset.org/1443/concurrency-without-locking-in-parallel-hash-structures-used-for-data-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1443/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1443/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1443/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1443/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1443/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1443/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1443/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1443/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1443/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1443/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1443.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">1821</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1593</span> Statistical Reliability Based Modeling of Series and Parallel Operating Systems using Extreme Value Theory</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Mohamad%20Mahdavi">Mohamad Mahdavi</a>, <a href="https://publications.waset.org/search?q=Mojtaba%20Mahdavi"> Mojtaba Mahdavi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper tries to represent a new method for computing the reliability of a system which is arranged in series or parallel model. In this method we estimate life distribution function of whole structure using the asymptotic Extreme Value (EV) distribution of Type I, or Gumbel theory. We use EV distribution in minimal mode, for estimate the life distribution function of series structure and maximal mode for parallel system. All parameters also are estimated by Moments method. Reliability function and failure (hazard) rate and p-th percentile point of each function are determined. Other important indexes such as Mean Time to Failure (MTTF), Mean Time to repair (MTTR), for non-repairable and renewal systems in both of series and parallel structure will be computed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Reliability" title="Reliability">Reliability</a>, <a href="https://publications.waset.org/search?q=extreme%20value" title=" extreme value"> extreme value</a>, <a href="https://publications.waset.org/search?q=parallel" title=" parallel"> parallel</a>, <a href="https://publications.waset.org/search?q=series" title=" series"> series</a>, <a href="https://publications.waset.org/search?q=lifedistribution" title=" lifedistribution"> lifedistribution</a> </p> <a href="https://publications.waset.org/7254/statistical-reliability-based-modeling-of-series-and-parallel-operating-systems-using-extreme-value-theory" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/7254/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/7254/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/7254/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/7254/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/7254/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/7254/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/7254/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/7254/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/7254/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/7254/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/7254.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">2089</span> </span> </div> </div> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1592</span> Parallel Joint Channel Coding and Cryptography</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Nata%C5%A1a%20%C5%BDivi%C4%87">Nata拧a 沤ivi膰</a>, <a href="https://publications.waset.org/search?q=Christoph%20Ruland"> Christoph Ruland</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Method of Parallel Joint Channel Coding and Cryptography has been analyzed and simulated in this paper. The method is an extension of Soft Input Decryption with feedback, which is used for improvement of channel decoding of secured messages. Parallel Joint Channel Coding and Cryptography results in improved coding gain of channel decoding, which achieves more than 2 dB. Such results are an implication of a combination of receiver components and their interoperability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Block%20length" title="Block length">Block length</a>, <a href="https://publications.waset.org/search?q=Coding%20gain" title=" Coding gain"> Coding gain</a>, <a href="https://publications.waset.org/search?q=Feedback" title=" Feedback"> Feedback</a>, <a href="https://publications.waset.org/search?q=L-values" title=" L-values"> L-values</a>, <a href="https://publications.waset.org/search?q=Parallel%20Joint%20Channel%20Coding%20and%20Cryptography" title=" Parallel Joint Channel Coding and Cryptography"> Parallel Joint Channel Coding and Cryptography</a>, <a href="https://publications.waset.org/search?q=Soft%20Input%0ADecryption." title=" Soft Input Decryption."> Soft Input Decryption.</a> </p> <a href="https://publications.waset.org/8203/parallel-joint-channel-coding-and-cryptography" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8203/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8203/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8203/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8203/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8203/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8203/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8203/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8203/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8203/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8203/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8203.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">1585</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/search?q=parallel%20jet%20interaction&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20jet%20interaction&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20jet%20interaction&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20jet%20interaction&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20jet%20interaction&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20jet%20interaction&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20jet%20interaction&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20jet%20interaction&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20jet%20interaction&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/search?q=parallel%20jet%20interaction&page=54">54</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20jet%20interaction&page=55">55</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20jet%20interaction&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>