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 interface</title> <meta name="description" content="Search results for: parallel interface"> <meta name="keywords" content="parallel interface"> <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 interface" 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 interface"> <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> 1197</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: parallel interface</h1> <div class="card publication-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1197</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">3170</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">1196</span> A High Performance MPI for Parallel and Distributed Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Prabu%20D.">Prabu D.</a>, <a href="https://publications.waset.org/search?q=Vanamala%20V."> Vanamala V.</a>, <a href="https://publications.waset.org/search?q=Sanjeeb%20Kumar%20Deka"> Sanjeeb Kumar Deka</a>, <a href="https://publications.waset.org/search?q=Sridharan%20R."> Sridharan R.</a>, <a href="https://publications.waset.org/search?q=Prahlada%20Rao%20B.%20B."> Prahlada Rao B. B.</a>, <a href="https://publications.waset.org/search?q=Mohanram%20N."> Mohanram N.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Message Passing Interface is widely used for Parallel and Distributed Computing. MPICH and LAM are popular open source MPIs available to the parallel computing community also there are commercial MPIs, which performs better than MPICH etc. In this paper, we discuss a commercial Message Passing Interface, CMPI (C-DAC Message Passing Interface). C-MPI is an optimized MPI for CLUMPS. It is found to be faster and more robust compared to MPICH. We have compared performance of C-MPI and MPICH on Gigabit Ethernet network. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=C-MPI" title="C-MPI">C-MPI</a>, <a href="https://publications.waset.org/search?q=C-VIA" title=" C-VIA"> C-VIA</a>, <a href="https://publications.waset.org/search?q=HPC" title=" HPC"> HPC</a>, <a href="https://publications.waset.org/search?q=MPICH" title=" MPICH"> MPICH</a>, <a href="https://publications.waset.org/search?q=P-COMS" title=" P-COMS"> P-COMS</a>, <a href="https://publications.waset.org/search?q=PMB" title=" PMB"> PMB</a> </p> <a href="https://publications.waset.org/1213/a-high-performance-mpi-for-parallel-and-distributed-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/1213/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/1213/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/1213/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/1213/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/1213/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/1213/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/1213/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/1213/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/1213/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/1213/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/1213.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">1557</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">1195</span> Isotropic Stress Distribution in Cu/(001) Fe Two Sheets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=A.%20Derardja">A. Derardja</a>, <a href="https://publications.waset.org/search?q=L.%20Baroura"> L. Baroura</a>, <a href="https://publications.waset.org/search?q=M.%20Brioua"> M. Brioua</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The nanotechnology based on epitaxial systems includes single or arranged misfit dislocations. In general, whatever is the type of dislocation or the geometry of the array formed by the dislocations; it is important for experimental studies to know exactly the stress distribution for which there is no analytical expression [1, 2]. This work, using a numerical analysis, deals with relaxation of epitaxial layers having at their interface a periodic network of edge misfit dislocations. The stress distribution is estimated by using isotropic elasticity. The results show that the thickness of the two sheets is a crucial parameter in the stress distributions and then in the profile of the two sheets. A comparative study between the case of single dislocation and the case of parallel network shows that the layers relaxed better when the interface is covered by a parallel arrangement of misfit. Consequently, a single dislocation at the interface produces an important stress field which can be reduced by inserting a parallel network of dislocations with suitable periodicity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Parallel%20array%20of%20misfit" title="Parallel array of misfit">Parallel array of misfit</a>, <a href="https://publications.waset.org/search?q=interface" title=" interface"> interface</a>, <a href="https://publications.waset.org/search?q=isotropic%20elasticity" title=" isotropic elasticity"> isotropic elasticity</a>, <a href="https://publications.waset.org/search?q=single%20crystalline%20substrates" title="single crystalline substrates">single crystalline substrates</a>, <a href="https://publications.waset.org/search?q=coherent%20interface" title=" coherent interface"> coherent interface</a> </p> <a href="https://publications.waset.org/13663/isotropic-stress-distribution-in-cu001-fe-two-sheets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13663/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13663/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13663/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13663/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13663/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13663/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13663/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13663/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13663/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13663/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13663.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">1571</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">1194</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">1193</span> A Parallel Algorithm for 2-D Cylindrical Geometry Transport Equation with Interface Corrections</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Wei%20Jun-xia">Wei Jun-xia</a>, <a href="https://publications.waset.org/search?q=Yuan%20Guang-wei"> Yuan Guang-wei</a>, <a href="https://publications.waset.org/search?q=Yang%20Shu-lin"> Yang Shu-lin</a>, <a href="https://publications.waset.org/search?q=Shen%20Wei-dong"> Shen Wei-dong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In order to make conventional implicit algorithm to be applicable in large scale parallel computers , an interface prediction and correction of discontinuous finite element method is presented to solve time-dependent neutron transport equations under 2-D cylindrical geometry. Domain decomposition is adopted in the computational domain.The numerical experiments show that our parallel algorithm with explicit prediction and implicit correction has good precision, parallelism and simplicity. Especially, it can reach perfect speedup even on hundreds of processors for large-scale problems.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Transport%20Equation" title="Transport Equation">Transport Equation</a>, <a href="https://publications.waset.org/search?q=Discontinuous%20Finite%20Element" title=" Discontinuous Finite Element"> Discontinuous Finite Element</a>, <a href="https://publications.waset.org/search?q=Domain%20Decomposition" title=" Domain Decomposition"> Domain Decomposition</a>, <a href="https://publications.waset.org/search?q=Interface%20Prediction%20And%20Correction" title=" Interface Prediction And Correction"> Interface Prediction And Correction</a> </p> <a href="https://publications.waset.org/8326/a-parallel-algorithm-for-2-d-cylindrical-geometry-transport-equation-with-interface-corrections" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/8326/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/8326/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/8326/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/8326/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/8326/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/8326/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/8326/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/8326/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/8326/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/8326/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/8326.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">1665</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">1192</span> An Efficient Run Time Interface for Heterogeneous Architecture of Large Scale Supercomputing System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Prabu%20D.">Prabu D.</a>, <a href="https://publications.waset.org/search?q=Andrew%20Aaron%20James"> Andrew Aaron James</a>, <a href="https://publications.waset.org/search?q=Vanamala%20V."> Vanamala V.</a>, <a href="https://publications.waset.org/search?q=Vineeth%20Simon"> Vineeth Simon</a>, <a href="https://publications.waset.org/search?q=Sanjeeb%20Kumar%20Deka"> Sanjeeb Kumar Deka</a>, <a href="https://publications.waset.org/search?q=Sridharan%20R."> Sridharan R.</a>, <a href="https://publications.waset.org/search?q=Prahlada%20Rao%20B.B."> Prahlada Rao B.B.</a>, <a href="https://publications.waset.org/search?q=Mohanram%20N."> Mohanram N.</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we propose a novel Run Time Interface (RTI) technique to provide an efficient environment for MPI jobs on the heterogeneous architecture of PARAM Padma. It suggests an innovative, unified framework for the job management interface system in parallel and distributed computing. This approach employs proxy scheme. The implementation shows that the proposed RTI is highly scalable and stable. Moreover RTI provides the storage access for the MPI jobs in various operating system platforms and improve the data access performance through high performance C-DAC Parallel File System (C-PFS). The performance of the RTI is evaluated by using the standard HPC benchmark suites and the simulation results show that the proposed RTI gives good performance on large scale supercomputing system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=RTI" title="RTI">RTI</a>, <a href="https://publications.waset.org/search?q=C-MPI" title=" C-MPI"> C-MPI</a>, <a href="https://publications.waset.org/search?q=C-PFS" title=" C-PFS"> C-PFS</a>, <a href="https://publications.waset.org/search?q=Scheduler%20Interface." title=" Scheduler Interface."> Scheduler Interface.</a> </p> <a href="https://publications.waset.org/14772/an-efficient-run-time-interface-for-heterogeneous-architecture-of-large-scale-supercomputing-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/14772/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/14772/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/14772/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/14772/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/14772/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/14772/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/14772/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/14772/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/14772/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/14772/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/14772.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">1441</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">1191</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">1669</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">1190</span> Detecting the Edge of Multiple Images in Parallel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Prakash%20K.%20Aithal">Prakash K. Aithal</a>, <a href="https://publications.waset.org/search?q=U.%20Dinesh%20Acharya"> U. Dinesh Acharya</a>, <a href="https://publications.waset.org/search?q=Rajesh%20Gopakumar"> Rajesh Gopakumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Edge is variation of brightness in an image. Edge detection is useful in many application areas such as finding forests, rivers from a satellite image, detecting broken bone in a medical image etc. The paper discusses about finding edge of multiple aerial images in parallel. The proposed work tested on 38 images 37 colored and one monochrome image. The time taken to process N images in parallel is equivalent to time taken to process 1 image in sequential. Message Passing Interface (MPI) and Open Computing Language (OpenCL) is used to achieve task and pixel level parallelism respectively. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Edge%20detection" title="Edge detection">Edge detection</a>, <a href="https://publications.waset.org/search?q=multicore" title=" multicore"> multicore</a>, <a href="https://publications.waset.org/search?q=GPU" title=" GPU"> GPU</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> </p> <a href="https://publications.waset.org/10001497/detecting-the-edge-of-multiple-images-in-parallel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10001497/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10001497/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10001497/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10001497/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10001497/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10001497/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10001497/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10001497/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10001497/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10001497/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10001497.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">2339</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">1189</span> Solving Facility Location Problem on Cluster Computing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Ei%20Phyo%20Wai">Ei Phyo Wai</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> Computation of facility location problem for every location in the country is not easy simultaneously. Solving the problem is described by using cluster computing. A technique is to design parallel algorithm by using local search with single swap method in order to solve that problem on clusters. Parallel implementation is done by the use of portable parallel programming, Message Passing Interface (MPI), on Microsoft Windows Compute Cluster. In this paper, it presents the algorithm that used local search with single swap method and implementation of the system of a facility to be opened by using MPI on cluster. If large datasets are considered, the process of calculating a reasonable cost for a facility becomes time consuming. The result shows parallel computation of facility location problem on cluster speedups and scales well as problem size increases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=cluster" title="cluster">cluster</a>, <a href="https://publications.waset.org/search?q=cost" title=" cost"> cost</a>, <a href="https://publications.waset.org/search?q=demand" title=" demand"> demand</a>, <a href="https://publications.waset.org/search?q=facility%20location" title=" facility location"> facility location</a> </p> <a href="https://publications.waset.org/999/solving-facility-location-problem-on-cluster-computing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/999/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/999/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/999/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/999/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/999/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/999/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/999/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/999/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/999/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/999/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/999.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">1486</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">1188</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">1187</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">1186</span> Some Computational Results on MPI Parallel Implementation of Dense Simplex Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=El-Said%20Badr">El-Said Badr</a>, <a href="https://publications.waset.org/search?q=Mahmoud%20Moussa"> Mahmoud Moussa</a>, <a href="https://publications.waset.org/search?q=Konstantinos%20Paparrizos"> Konstantinos Paparrizos</a>, <a href="https://publications.waset.org/search?q=Nikolaos%20Samaras"> Nikolaos Samaras</a>, <a href="https://publications.waset.org/search?q=Angelo%20Sifaleras"> Angelo Sifaleras</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are two major variants of the Simplex Algorithm: the revised method and the standard, or tableau method. Today, all serious implementations are based on the revised method because it is more efficient for sparse linear programming problems. Moreover, there are a number of applications that lead to dense linear problems so our aim in this paper is to present some computational results on parallel implementation of dense Simplex Method. Our implementation is implemented on a SMP cluster using C programming language and the Message Passing Interface MPI. Preliminary computational results on randomly generated dense linear programs support our results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Linear%20Programming" title="Linear Programming">Linear Programming</a>, <a href="https://publications.waset.org/search?q=MPI" title=" MPI"> MPI</a>, <a href="https://publications.waset.org/search?q=Parallel%20Implementation" title=" Parallel Implementation"> Parallel Implementation</a>, <a href="https://publications.waset.org/search?q=Simplex%20Algorithm." title=" Simplex Algorithm."> Simplex Algorithm.</a> </p> <a href="https://publications.waset.org/12236/some-computational-results-on-mpi-parallel-implementation-of-dense-simplex-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12236/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12236/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12236/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12236/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12236/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12236/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12236/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12236/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12236/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12236/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12236.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">2050</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">1185</span> Numerical Analysis of Laminar Reflux Condensation from Gas-Vapour Mixtures in Vertical Parallel Plate Channels</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Foad%20Hassaninejadafarahani">Foad Hassaninejadafarahani</a>, <a href="https://publications.waset.org/search?q=Scott%20Ormiston"> Scott Ormiston</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>Reflux condensation occurs in vertical channels and tubes when there is an upward core flow of vapour (or gas-vapour mixture) and a downward flow of the liquid film. The understanding of this condensation configuration is crucial in the design of reflux condensers, distillation columns, and in loss-of-coolant safety analyses in nuclear power plant steam generators. The unique feature of this flow is the upward flow of the vapour-gas mixture (or pure vapour) that retards the liquid flow via shear at the liquid-mixture interface. The present model solves the full, elliptic governing equations in both the film and the gas-vapour core flow. The computational mesh is non-orthogonal and adapts dynamically the phase interface, thus produces a sharp and accurate interface. Shear forces and heat and mass transfer at the interface are accounted for fundamentally. This modeling is a big step ahead of current capabilities by removing the limitations of previous reflux condensation models which inherently cannot account for the detailed local balances of shear, mass, and heat transfer at the interface. Discretisation has been done based on finite volume method and co-located variable storage scheme. An in-house computer code was developed to implement the numerical solution scheme. Detailed results are presented for laminar reflux condensation from steam-air mixtures flowing in vertical parallel plate channels. The results include velocity and gas mass fraction profiles, as well as axial variations of film thickness.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Reflux%20Condensation" title="Reflux Condensation">Reflux Condensation</a>, <a href="https://publications.waset.org/search?q=Heat%20Transfer" title=" Heat Transfer"> Heat Transfer</a>, <a href="https://publications.waset.org/search?q=Channel" title=" Channel"> Channel</a>, <a href="https://publications.waset.org/search?q=Laminar%0D%0AFlow" title=" Laminar Flow"> Laminar Flow</a> </p> <a href="https://publications.waset.org/10001309/numerical-analysis-of-laminar-reflux-condensation-from-gas-vapour-mixtures-in-vertical-parallel-plate-channels" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10001309/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10001309/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10001309/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10001309/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10001309/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10001309/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10001309/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10001309/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10001309/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10001309/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10001309.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">1853</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">1184</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">1183</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">1182</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">1181</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">1180</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">1906</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">1179</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">1104</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">1178</span> Implementation of ADETRAN Language Using Message Passing Interface</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Akiyoshi%20Wakatani">Akiyoshi Wakatani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper describes the Message Passing Interface (MPI) implementation of ADETRAN language, and its evaluation on SX-ACE supercomputers. ADETRAN language includes pdo statement that specifies the data distribution and parallel computations and pass statement that specifies the redistribution of arrays. Two methods for implementation of pass statement are discussed and the performance evaluation using Splitting-Up CG method is presented. The effectiveness of the parallelization is evaluated and the advantage of one dimensional distribution is empirically confirmed by using the results of experiments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Iterative%20methods" title="Iterative methods">Iterative methods</a>, <a href="https://publications.waset.org/search?q=array%20redistribution" title=" array redistribution"> array redistribution</a>, <a href="https://publications.waset.org/search?q=translator" title=" translator"> translator</a>, <a href="https://publications.waset.org/search?q=distributed%20memory." title=" distributed memory."> distributed memory.</a> </p> <a href="https://publications.waset.org/10003958/implementation-of-adetran-language-using-message-passing-interface" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10003958/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10003958/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10003958/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10003958/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10003958/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10003958/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10003958/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10003958/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10003958/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10003958/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10003958.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">1199</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">1177</span> WAF: an Interface Web Agent Framework </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Xizhi%20Li">Xizhi Li</a>, <a href="https://publications.waset.org/search?q=Qinming%20He"> Qinming He</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A trend in agent community or enterprises is that they are shifting from closed to open architectures composed of a large number of autonomous agents. One of its implications could be that interface agent framework is getting more important in multi-agent system (MAS); so that systems constructed for different application domains could share a common understanding in human computer interface (HCI) methods, as well as human-agent and agent-agent interfaces. However, interface agent framework usually receives less attention than other aspects of MAS. In this paper, we will propose an interface web agent framework which is based on our former project called WAF and a Distributed HCI template. A group of new functionalities and implications will be discussed, such as web agent presentation, off-line agent reference, reconfigurable activation map of agents, etc. Their enabling techniques and current standards (e.g. existing ontological framework) are also suggested and shown by examples from our own implementation in WAF. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=HCI" title="HCI">HCI</a>, <a href="https://publications.waset.org/search?q=Interface%20agent" title=" Interface agent"> Interface agent</a>, <a href="https://publications.waset.org/search?q=MAS." title=" MAS."> MAS.</a> </p> <a href="https://publications.waset.org/3484/waf-an-interface-web-agent-framework" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/3484/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/3484/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/3484/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/3484/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/3484/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/3484/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/3484/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/3484/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/3484/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/3484/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/3484.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">1659</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">1176</span> A Study on Cancer-Cell Invasion Based On the Diffuse Interface Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Zhang%20Linan">Zhang Linan</a>, <a href="https://publications.waset.org/search?q=Jihwan%20Song"> Jihwan Song</a>, <a href="https://publications.waset.org/search?q=Dongchoul%20Kim"> Dongchoul Kim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this study, a three-dimensional haptotaxis model to simulate the migration of a population of cancer cells has been proposed. The invasion of cancer cells is related with the hapto-attractant and the effect of the interface energies between the cells and the ECM. The diffuse interface model, which incorporates the haptotaxis mechanism and interface energies, is employed. The semi-implicit Fourier spectral scheme is adopted for efficient evaluation of the simulation. The simulation results thoroughly reveal the dynamics of cancer-cell migration.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Haptotaxis" title="Haptotaxis">Haptotaxis</a>, <a href="https://publications.waset.org/search?q=Cancer%20Cells" title=" Cancer Cells"> Cancer Cells</a>, <a href="https://publications.waset.org/search?q=Cell%20Migration" title=" Cell Migration"> Cell Migration</a>, <a href="https://publications.waset.org/search?q=Interface%20Energy" title=" Interface Energy"> Interface Energy</a>, <a href="https://publications.waset.org/search?q=Diffuse%20Interface%20Model" title=" Diffuse Interface Model"> Diffuse Interface Model</a> </p> <a href="https://publications.waset.org/13944/a-study-on-cancer-cell-invasion-based-on-the-diffuse-interface-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/13944/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/13944/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/13944/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/13944/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/13944/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/13944/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/13944/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/13944/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/13944/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/13944/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/13944.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">1425</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">1175</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">2025</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">1174</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">1173</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">1172</span> Interface Location in Single Phase Stirred Tanks </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=I.%20Mahdavi">I. Mahdavi</a>, <a href="https://publications.waset.org/search?q=R.%20Janamiri"> R. Janamiri</a>, <a href="https://publications.waset.org/search?q=A.%20Sinkakarimi"> A. Sinkakarimi</a>, <a href="https://publications.waset.org/search?q=M.%20Safdari"> M. Safdari</a>, <a href="https://publications.waset.org/search?q=M.%20H.%20Sedaghat"> M. H. Sedaghat</a>, <a href="https://publications.waset.org/search?q=A.%20Zamani"> A. Zamani</a>, <a href="https://publications.waset.org/search?q=A.%20Hoseini"> A. Hoseini</a>, <a href="https://publications.waset.org/search?q=M.%20Karimi"> M. Karimi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> <p>In this work, study the location of interface in a stirred vessel with Rushton impeller by computational fluid dynamic was presented. To modeling rotating the impeller, sliding mesh (SM) technique was used and standard k-ε model was selected for turbulence closure. Mean tangential, radial and axial velocities and also turbulent kinetic energy (k) and turbulent dissipation rate (ε) in various points of tank was investigated. Results show sensitivity of system to location of interface and radius of 7 to 10cm for interface in the vessel with existence characteristics cause to increase the accuracy of simulation.</p> <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=CFD" title="CFD">CFD</a>, <a href="https://publications.waset.org/search?q=Interface" title=" Interface"> Interface</a>, <a href="https://publications.waset.org/search?q=Rushton%20impeller" title=" Rushton impeller"> Rushton impeller</a>, <a href="https://publications.waset.org/search?q=Turbulence%20model." title=" Turbulence model."> Turbulence model.</a> </p> <a href="https://publications.waset.org/16632/interface-location-in-single-phase-stirred-tanks" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/16632/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/16632/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/16632/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/16632/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/16632/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/16632/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/16632/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/16632/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/16632/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/16632/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/16632.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">1725</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">1171</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">1170</span> Development of Optimized User Interface of Public Transit Navigator for a Smartphone</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Masahiro%20Taketa">Masahiro Taketa</a>, <a href="https://publications.waset.org/search?q=Masaki%20Ito"> Masaki Ito</a>, <a href="https://publications.waset.org/search?q=Takao%20Kawamura"> Takao Kawamura</a>, <a href="https://publications.waset.org/search?q=Kazunori%20Sugahara"> Kazunori Sugahara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We develop a new interface for Bus-Net which is optimized for a smartphone. We are continuing to develop the shortest path planning system of public transportation called "Bus-Net" in Tottori prefecture as web application to improve the usability of public transportation. Recent trend of computing platform, however has shifted to an advanced mobile device called a smartphone such as iPhone and Android in Japan. A smartphone has different characters with existing feature phone in terms of OS, large touche panel, and several other features. We derive a guideline to design the new interface for a smartphone to full use of the functionality. The guideline is about simplicity of user-s operation, location awareness and usability. We developed the new interface for 鈥淏us-Net" on iPhone referring to the guideline. Due to the evaluation, the application interface we developed is better than the existing web-based interface in terms of the usability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Path%20Planning" title="Path Planning">Path Planning</a>, <a href="https://publications.waset.org/search?q=Public%20Transportation" title=" Public Transportation"> Public Transportation</a>, <a href="https://publications.waset.org/search?q=Smartphone" title=" Smartphone"> Smartphone</a>, <a href="https://publications.waset.org/search?q=User%20Interface" title="User Interface">User Interface</a> </p> <a href="https://publications.waset.org/12777/development-of-optimized-user-interface-of-public-transit-navigator-for-a-smartphone" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/12777/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/12777/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/12777/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/12777/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/12777/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/12777/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/12777/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/12777/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/12777/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/12777/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/12777.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">1805</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">1169</span> A Two-Phase Flow Interface Tracking Algorithm Using a Fully Coupled Pressure-Based Finite Volume Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Shidvash%20Vakilipour">Shidvash Vakilipour</a>, <a href="https://publications.waset.org/search?q=Scott%20Ormiston"> Scott Ormiston</a>, <a href="https://publications.waset.org/search?q=Masoud%20Mohammadi"> Masoud Mohammadi</a>, <a href="https://publications.waset.org/search?q=Rouzbeh%20Riazi"> Rouzbeh Riazi</a>, <a href="https://publications.waset.org/search?q=Kimia%20Amiri"> Kimia Amiri</a>, <a href="https://publications.waset.org/search?q=Sahar%20Barati"> Sahar Barati</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Two-phase and multi-phase flows are common flow types in fluid mechanics engineering. Among the basic and applied problems of these flow types, two-phase parallel flow is the one that two immiscible fluids flow in the vicinity of each other. In this type of flow, fluid properties (e.g. density, viscosity, and temperature) are different at the two sides of the interface of the two fluids. The most challenging part of the numerical simulation of two-phase flow is to determine the location of interface accurately. In the present work, a coupled interface tracking algorithm is developed based on Arbitrary Lagrangian-Eulerian (ALE) approach using a cell-centered, pressure-based, coupled solver. To validate this algorithm, an analytical solution for fully developed two-phase flow in presence of gravity is derived, and then, the results of the numerical simulation of this flow are compared with analytical solution at various flow conditions. The results of the simulations show good accuracy of the algorithm despite using a nearly coarse and uniform grid. Temporal variations of interface profile toward the steady-state solution show that a greater difference between fluids properties (especially dynamic viscosity) will result in larger traveling waves. Gravity effect studies also show that favorable gravity will result in a reduction of heavier fluid thickness and adverse gravity leads to increasing it with respect to the zero gravity condition. However, the magnitude of variation in favorable gravity is much more than adverse gravity. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Coupled%20solver" title="Coupled solver">Coupled solver</a>, <a href="https://publications.waset.org/search?q=gravitational%20force" title=" gravitational force"> gravitational force</a>, <a href="https://publications.waset.org/search?q=interface%20tracking" title=" interface tracking"> interface tracking</a>, <a href="https://publications.waset.org/search?q=Reynolds%20number%20to%20Froude%20number" title=" Reynolds number to Froude number"> Reynolds number to Froude number</a>, <a href="https://publications.waset.org/search?q=two-phase%20flow." title=" two-phase flow. "> two-phase flow. </a> </p> <a href="https://publications.waset.org/10007759/a-two-phase-flow-interface-tracking-algorithm-using-a-fully-coupled-pressure-based-finite-volume-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/10007759/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/10007759/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/10007759/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/10007759/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/10007759/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/10007759/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/10007759/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/10007759/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/10007759/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/10007759/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/10007759.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">1013</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">1168</span> Development of User Interface for Multiple Devices Connecting Path Planning System for Bus Network</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/search?q=Takahiro%20Takayama">Takahiro Takayama</a>, <a href="https://publications.waset.org/search?q=Takao%20Kawamura"> Takao Kawamura</a>, <a href="https://publications.waset.org/search?q=Toshihiko%20Sasama"> Toshihiko Sasama</a>, <a href="https://publications.waset.org/search?q=Kazunori%20Sugahara"> Kazunori Sugahara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, web services to access from many type devices are often used. We have developed the shortest path planning system called "Bus-Net" in Tottori prefecture as a web application to sustain the public transport. And it used the same user interface for both devices. To support both devices, the interface cannot use JavaScript and so on. Thus, we developed the method that use individual user interface for each device type to improve its convenience. To be concrete, we defined formats of condition input to the path planning system and result output from it and separate the system into the request processing part and user interface parts that depend on device types. By this method, we have also developed special device for Bus-Net named "Intelligent-Bus-Stop". <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/search?q=Bus" title="Bus">Bus</a>, <a href="https://publications.waset.org/search?q=Path%20planning" title=" Path planning"> Path planning</a>, <a href="https://publications.waset.org/search?q=Public%20transport" title=" Public transport"> Public transport</a>, <a href="https://publications.waset.org/search?q=User%20interface" title=" User interface"> User interface</a> </p> <a href="https://publications.waset.org/15096/development-of-user-interface-for-multiple-devices-connecting-path-planning-system-for-bus-network" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/15096/apa" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">APA</a> <a href="https://publications.waset.org/15096/bibtex" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">BibTeX</a> <a href="https://publications.waset.org/15096/chicago" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Chicago</a> <a href="https://publications.waset.org/15096/endnote" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">EndNote</a> <a href="https://publications.waset.org/15096/harvard" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">Harvard</a> <a href="https://publications.waset.org/15096/json" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">JSON</a> <a href="https://publications.waset.org/15096/mla" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">MLA</a> <a href="https://publications.waset.org/15096/ris" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">RIS</a> <a href="https://publications.waset.org/15096/xml" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">XML</a> <a href="https://publications.waset.org/15096/iso690" target="_blank" rel="nofollow" class="btn btn-primary btn-sm">ISO 690</a> <a href="https://publications.waset.org/15096.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">1483</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%20interface&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20interface&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20interface&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20interface&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20interface&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20interface&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20interface&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20interface&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20interface&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%20interface&page=39">39</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20interface&page=40">40</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/search?q=parallel%20interface&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>