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 computers</title> <meta name="description" content="Search results for: parallel computers"> <meta name="keywords" content="parallel computers"> <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 computers" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="parallel computers"> <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> 1500</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: parallel computers</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1500</span> Solving 94-Bit ECDLP with 70 Computers in Parallel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shunsuke%20Miyoshi">Shunsuke Miyoshi</a>, <a href="https://publications.waset.org/abstracts/search?q=Yasuyuki%20Nogami"> Yasuyuki Nogami</a>, <a href="https://publications.waset.org/abstracts/search?q=Takuya%20Kusaka"> Takuya Kusaka</a>, <a href="https://publications.waset.org/abstracts/search?q=Nariyoshi%20Yamai"> Nariyoshi Yamai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Elliptic curve discrete logarithm problem (ECDLP) is one of problems on which the security of pairing-based cryptography is based. This paper considers Pollard's rho method to evaluate the security of ECDLP on Barreto-Naehrig (BN) curve that is an efficient pairing-friendly curve. Some techniques are proposed to make the rho method efficient. Especially, the group structure on BN curve, distinguished point method, and Montgomery trick are well-known techniques. This paper applies these techniques and shows its optimization. According to the experimental results for which a large-scale parallel system with MySQL is applied, 94-bit ECDLP was solved about 28 hours by parallelizing 71 computers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pollard%27s%20rho%20method" title="Pollard's rho method">Pollard's rho method</a>, <a href="https://publications.waset.org/abstracts/search?q=BN%20curve" title=" BN curve"> BN curve</a>, <a href="https://publications.waset.org/abstracts/search?q=Montgomery%20multiplication" title=" Montgomery multiplication"> Montgomery multiplication</a> </p> <a href="https://publications.waset.org/abstracts/28038/solving-94-bit-ecdlp-with-70-computers-in-parallel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28038.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">272</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1499</span> Parallelization by Domain Decomposition for 1-D Sugarcane Equation with Message Passing Interface</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ewedafe%20Simon%20Uzezi">Ewedafe Simon Uzezi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper we presented a method based on Domain Decomposition (DD) for parallelization of 1-D Sugarcane Equation on parallel platform with parallel paradigms on Master-Slave platform using Message Passing Interface (MPI). The 1-D Sugarcane Equation was discretized using explicit method of discretization requiring evaluation nof temporal and spatial distribution of temperature. This platform gives better predictions of the effects of temperature distribution of the sugarcane problem. This work presented parallel overheads with overlapping communication and communication across parallel computers with numerical results across different block sizes with scalability. However, performance improvement strategies from the DD on various mesh sizes were compared experimentally and parallel results show speedup and efficiency for the parallel algorithms design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sugarcane" title="sugarcane">sugarcane</a>, <a href="https://publications.waset.org/abstracts/search?q=parallelization" title=" parallelization"> parallelization</a>, <a href="https://publications.waset.org/abstracts/search?q=explicit%20method" title=" explicit method"> explicit method</a>, <a href="https://publications.waset.org/abstracts/search?q=domain%20decomposition" title=" domain decomposition"> domain decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=MPI" title=" MPI"> MPI</a> </p> <a href="https://publications.waset.org/abstracts/192206/parallelization-by-domain-decomposition-for-1-d-sugarcane-equation-with-message-passing-interface" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192206.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">21</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1498</span> Algorithm Optimization to Sort in Parallel by Decreasing the Number of the Processors in SIMD (Single Instruction Multiple Data) Systems </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ali%20Hosseini">Ali Hosseini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Paralleling is a mechanism to decrease the time necessary to execute the programs. Sorting is one of the important operations to be used in different systems in a way that the proper function of many algorithms and operations depend on sorted data. CRCW_SORT algorithm executes ‘N’ elements sorting in O(1) time on SIMD (Single Instruction Multiple Data) computers with n^2/2-n/2 number of processors. In this article having presented a mechanism by dividing the input string by the hinge element into two less strings the number of the processors to be used in sorting ‘N’ elements in O(1) time has decreased to n^2/8-n/4 in the best state; by this mechanism the best state is when the hinge element is the middle one and the worst state is when it is minimum. The findings from assessing the proposed algorithm by other methods on data collection and number of the processors indicate that the proposed algorithm uses less processors to sort during execution than other methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CRCW" title="CRCW">CRCW</a>, <a href="https://publications.waset.org/abstracts/search?q=SIMD%20%28Single%20Instruction%20Multiple%20Data%29%0D%0Acomputers" title=" SIMD (Single Instruction Multiple Data) computers"> SIMD (Single Instruction Multiple Data) computers</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computers" title=" parallel computers"> parallel computers</a>, <a href="https://publications.waset.org/abstracts/search?q=number%20of%20the%0D%0Aprocessors" title=" number of the processors"> number of the processors</a> </p> <a href="https://publications.waset.org/abstracts/29094/algorithm-optimization-to-sort-in-parallel-by-decreasing-the-number-of-the-processors-in-simd-single-instruction-multiple-data-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29094.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">310</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1497</span> Numerical Studies for Standard Bi-Conjugate Gradient Stabilized Method and the Parallel Variants for Solving Linear Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kuniyoshi%20Abe">Kuniyoshi Abe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Bi-conjugate gradient (Bi-CG) is a well-known method for solving linear equations Ax = b, for x, where A is a given n-by-n matrix, and b is a given n-vector. Typically, the dimension of the linear equation is high and the matrix is sparse. A number of hybrid Bi-CG methods such as conjugate gradient squared (CGS), Bi-CG stabilized (Bi-CGSTAB), BiCGStab2, and BiCGstab(l) have been developed to improve the convergence of Bi-CG. Bi-CGSTAB has been most often used for efficiently solving the linear equation, but we have seen the convergence behavior with a long stagnation phase. In such cases, it is important to have Bi-CG coefficients that are as accurate as possible, and the stabilization strategy, which stabilizes the computation of the Bi-CG coefficients, has been proposed. It may avoid stagnation and lead to faster computation. Motivated by a large number of processors in present petascale high-performance computing hardware, the scalability of Krylov subspace methods on parallel computers has recently become increasingly prominent. The main bottleneck for efficient parallelization is the inner products which require a global reduction. The resulting global synchronization phases cause communication overhead on parallel computers. The parallel variants of Krylov subspace methods reducing the number of global communication phases and hiding the communication latency have been proposed. However, the numerical stability, specifically, the convergence speed of the parallel variants of Bi-CGSTAB may become worse than that of the standard Bi-CGSTAB. In this paper, therefore, we compare the convergence speed between the standard Bi-CGSTAB and the parallel variants by numerical experiments and show that the convergence speed of the standard Bi-CGSTAB is faster than the parallel variants. Moreover, we propose the stabilization strategy for the parallel variants. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bi-conjugate%20gradient%20stabilized%20method" title="bi-conjugate gradient stabilized method">bi-conjugate gradient stabilized method</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20speed" title=" convergence speed"> convergence speed</a>, <a href="https://publications.waset.org/abstracts/search?q=Krylov%20subspace%20methods" title=" Krylov subspace methods"> Krylov subspace methods</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20equations" title=" linear equations"> linear equations</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20variant" title=" parallel variant"> parallel variant</a> </p> <a href="https://publications.waset.org/abstracts/96373/numerical-studies-for-standard-bi-conjugate-gradient-stabilized-method-and-the-parallel-variants-for-solving-linear-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96373.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">164</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1496</span> The Attitude of High School Teachers in Saudi Arabia towards Computers: Qualitative Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manal%20O.%20Alothman">Manal O. Alothman</a>, <a href="https://publications.waset.org/abstracts/search?q=Judy%20Robertson"> Judy Robertson</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Teachers can play a huge role in encouraging students to use computers and can affect students’ attitudes towards computers. So understanding teachers’ beliefs and their use of computers is an important way to create effective motivational systems for teachers to use computers in the classroom in an effective way.A qualitative study (6 focus group) was carried out among Saudi High school teachers, both male and female, to examine their attitudes towards computers and to find out their computer skills and usage. The study showed a gender difference in that females were less likely to attend computer workshops, females also had less computer skills, and they have more negative attitudes towards computers than males. Also, the study found that low computer skills in the classroom made students unlikely to have the lessons presented using computers. Furthermore, the study found some factors that affected teachers’ attitudes towards computers. These factors were computer experience and confidence as much having skills and good experience in computer use, the role and importance of computers had become in their life and in teaching as well. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=attitude" title="attitude">attitude</a>, <a href="https://publications.waset.org/abstracts/search?q=education" title=" education"> education</a>, <a href="https://publications.waset.org/abstracts/search?q=student" title=" student"> student</a>, <a href="https://publications.waset.org/abstracts/search?q=teacher" title=" teacher"> teacher</a>, <a href="https://publications.waset.org/abstracts/search?q=technology" title=" technology"> technology</a> </p> <a href="https://publications.waset.org/abstracts/20160/the-attitude-of-high-school-teachers-in-saudi-arabia-towards-computers-qualitative-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20160.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">293</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1495</span> Assessment of the Administration and Services of Public Access Computers in Academic Libraries in Kaduna State, Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Usman%20Ahmed%20Adam">Usman Ahmed Adam</a>, <a href="https://publications.waset.org/abstracts/search?q=Umar%20Ibrahim"> Umar Ibrahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Ezra%20S.%20Gbaje"> Ezra S. Gbaje</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study is posed to explore the practice of Public Access Computers (PACs) in academic libraries in Kaduna State, Nigeria. The study aimed to determine the computers and other tools available, their services and challenges of the practices. Three questions were framed to identify number of public computers and tools available, their services and problems faced during the practice. The study used qualitative research design along with semi-constructed interview and observation as tools for data collection. Descriptive analysis was employed to analyze the data. The sample size of the study comprises 52 librarian and IT staff from the seven academic institutions in Kaduna State. The findings revealed that, PACs were provided for access to the Internet, digital resources, library catalogue and training services. The study further explored that, despite the limit number of the computers, users were not allowed to enjoy many services. The study recommends that libraries in Kaduna state should provide more public computers to be able to cover the population of their users; libraries should allow users to use the computers without limitations and restrictions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=academic%20libraries" title="academic libraries">academic libraries</a>, <a href="https://publications.waset.org/abstracts/search?q=computers%20in%20library" title=" computers in library"> computers in library</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20libraries" title=" digital libraries"> digital libraries</a>, <a href="https://publications.waset.org/abstracts/search?q=public%20computers" title=" public computers"> public computers</a> </p> <a href="https://publications.waset.org/abstracts/43705/assessment-of-the-administration-and-services-of-public-access-computers-in-academic-libraries-in-kaduna-state-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43705.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">352</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1494</span> Damage Strain Analysis of Parallel Fiber Eutectic</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jian%20Zheng">Jian Zheng</a>, <a href="https://publications.waset.org/abstracts/search?q=Xinhua%20Ni"> Xinhua Ni</a>, <a href="https://publications.waset.org/abstracts/search?q=Xiequan%20Liu"> Xiequan Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> According to isotropy of parallel fiber eutectic, the no- damage strain field in parallel fiber eutectic is obtained from the flexibility tensor of parallel fiber eutectic. Considering the damage behavior of parallel fiber eutectic, damage variables are introduced to determine the strain field of parallel fiber eutectic. The damage strains in the matrix, interphase, and fiber of parallel fiber eutectic are quantitatively analyzed. Results show that damage strains are not only associated with the fiber volume fraction of parallel fiber eutectic, but also with the damage degree. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=damage%20strain" title="damage strain">damage strain</a>, <a href="https://publications.waset.org/abstracts/search?q=initial%20strain" title=" initial strain"> initial strain</a>, <a href="https://publications.waset.org/abstracts/search?q=fiber%20volume%20fraction" title=" fiber volume fraction"> fiber volume fraction</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20fiber%20eutectic" title=" parallel fiber eutectic"> parallel fiber eutectic</a> </p> <a href="https://publications.waset.org/abstracts/60032/damage-strain-analysis-of-parallel-fiber-eutectic" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/60032.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">576</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1493</span> Parallel PRBS Generation and Parallel BER Tester for 8-Gbps On-chip Interconnection Testing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhao%20Bin">Zhao Bin</a>, <a href="https://publications.waset.org/abstracts/search?q=Yan%20Dan%20Lei"> Yan Dan Lei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, a multi-pattern parallel PRBS generator and a dedicated parallel BER tester is proposed for the 8-Gbps On-chip interconnection testing. A unique full-parallel PRBS checker is also proposed. The proposed design, together with the custom-designed high-speed parallel-to-serial and the serial-to-parallel circuit, will be used to test different on-chip interconnection transceivers. The design is implemented in TSMC 28nm CMOS technology with working voltage at 1.0 V. The serial to parallel ratio is 8:1 so the parallel PRBS generation and BER Tester can be run at lower speed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=PRBS" title="PRBS">PRBS</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20speed" title=" high speed"> high speed</a>, <a href="https://publications.waset.org/abstracts/search?q=generator" title=" generator"> generator</a> </p> <a href="https://publications.waset.org/abstracts/35064/parallel-prbs-generation-and-parallel-ber-tester-for-8-gbps-on-chip-interconnection-testing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35064.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">760</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1492</span> Numerical Study on Parallel Rear-Spoiler on Super Cars</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anshul%20Ashu">Anshul Ashu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Computers are applied to the vehicle aerodynamics in two ways. One of two is Computational Fluid Dynamics (CFD) and other is Computer Aided Flow Visualization (CAFV). Out of two CFD is chosen because it shows the result with computer graphics. The simulation of flow field around the vehicle is one of the important CFD applications. The flow field can be solved numerically using panel methods, k-ε method, and direct simulation methods. The spoiler is the tool in vehicle aerodynamics used to minimize unfavorable aerodynamic effects around the vehicle and the parallel spoiler is set of two spoilers which are designed in such a manner that it could effectively reduce the drag. In this study, the standard k-ε model of the simplified version of Bugatti Veyron, Audi R8 and Porsche 911 are used to simulate the external flow field. Flow simulation is done for variable Reynolds number. The flow simulation consists of three different levels, first over the model without a rear spoiler, second for over model with single rear spoiler, and third over the model with parallel rear-spoiler. The second and third level has following parameter: the shape of the spoiler, the angle of attack and attachment position. A thorough analysis of simulations results has been found. And a new parallel spoiler is designed. It shows a little improvement in vehicle aerodynamics with a decrease in vehicle aerodynamic drag and lift. Hence, it leads to good fuel economy and traction force of the model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=drag" title="drag">drag</a>, <a href="https://publications.waset.org/abstracts/search?q=lift" title=" lift"> lift</a>, <a href="https://publications.waset.org/abstracts/search?q=flow%20simulation" title=" flow simulation"> flow simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=spoiler" title=" spoiler"> spoiler</a> </p> <a href="https://publications.waset.org/abstracts/31545/numerical-study-on-parallel-rear-spoiler-on-super-cars" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31545.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">500</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1491</span> Discrete-Event Modeling and Simulation Methodologies: Past, Present and Future</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gabriel%20Wainer">Gabriel Wainer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Modeling and Simulation methods have been used to better analyze the behavior of complex physical systems, and it is now common to use simulation as a part of the scientific and technological discovery process. M&S advanced thanks to the improvements in computer technology, which, in many cases, resulted in the development of simulation software using ad-hoc techniques. Formal M&S appeared in order to try to improve the development task of very complex simulation systems. Some of these techniques proved to be successful in providing a sound base for the development of discrete-event simulation models, improving the ease of model definition and enhancing the application development tasks; reducing costs and favoring reuse. The DEVS formalism is one of these techniques, which proved to be successful in providing means for modeling while reducing development complexity and costs. DEVS model development is based on a sound theoretical framework. The independence of M&S tasks made possible to run DEVS models on different environments (personal computers, parallel computers, real-time equipment, and distributed simulators) and middleware. We will present a historical perspective of discrete-event M&S methodologies, showing different modeling techniques. We will introduce DEVS origins and general ideas, and compare it with some of these techniques. We will then show the current status of DEVS M&S, and we will discuss a technological perspective to solve current M&S problems (including real-time simulation, interoperability, and model-centered development techniques). We will show some examples of the current use of DEVS, including applications in different fields. We will finally show current open topics in the area, which include advanced methods for centralized, parallel or distributed simulation, the need for real-time modeling techniques, and our view in these fields. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=modeling%20and%20simulation" title="modeling and simulation">modeling and simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete-event%20simulation" title=" discrete-event simulation"> discrete-event simulation</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid%20systems%20modeling" title=" hybrid systems modeling"> hybrid systems modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20and%20distributed%20simulation" title=" parallel and distributed simulation"> parallel and distributed simulation</a> </p> <a href="https://publications.waset.org/abstracts/67045/discrete-event-modeling-and-simulation-methodologies-past-present-and-future" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67045.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">323</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1490</span> A Parallel Implementation of k-Means in MATLAB</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dimitris%20Varsamis">Dimitris Varsamis</a>, <a href="https://publications.waset.org/abstracts/search?q=Christos%20Talagkozis"> Christos Talagkozis</a>, <a href="https://publications.waset.org/abstracts/search?q=Alkiviadis%20Tsimpiris"> Alkiviadis Tsimpiris</a>, <a href="https://publications.waset.org/abstracts/search?q=Paris%20Mastorocostas"> Paris Mastorocostas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this work is the parallel implementation of k-means in MATLAB, in order to reduce the execution time. Specifically, a new function in MATLAB for serial k-means algorithm is developed, which meets all the requirements for the conversion to a function in MATLAB with parallel computations. Additionally, two different variants for the definition of initial values are presented. In the sequel, the parallel approach is presented. Finally, the performance tests for the computation times respect to the numbers of features and classes are illustrated. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=K-means%20algorithm" title="K-means algorithm">K-means algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computations" title=" parallel computations"> parallel computations</a>, <a href="https://publications.waset.org/abstracts/search?q=Matlab" title=" Matlab"> Matlab</a> </p> <a href="https://publications.waset.org/abstracts/80503/a-parallel-implementation-of-k-means-in-matlab" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80503.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">385</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1489</span> A Survey on Constraint Solving Approaches Using Parallel Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nebras%20Gharbi">Nebras Gharbi</a>, <a href="https://publications.waset.org/abstracts/search?q=Itebeddine%20Ghorbel"> Itebeddine Ghorbel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the latest years and with the advancements of the multicore computing world, the constraint programming community tried to benefit from the capacity of new machines and make the best use of them through several parallel schemes for constraint solving. In this paper, we propose a survey of the different proposed approaches to solve Constraint Satisfaction Problems using parallel architectures. These approaches use in a different way a parallel architecture: the problem itself could be solved differently by several solvers or could be split over solvers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constraint%20programming" title="constraint programming">constraint programming</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20programming" title=" parallel programming"> parallel programming</a>, <a href="https://publications.waset.org/abstracts/search?q=constraint%20satisfaction%20problem" title=" constraint satisfaction problem"> constraint satisfaction problem</a>, <a href="https://publications.waset.org/abstracts/search?q=speed-up" title=" speed-up"> speed-up</a> </p> <a href="https://publications.waset.org/abstracts/50394/a-survey-on-constraint-solving-approaches-using-parallel-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50394.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">319</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1488</span> Efficient Utilization of Commodity Computers in Academic Institutes: A Cloud Computing Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jasraj%20Meena">Jasraj Meena</a>, <a href="https://publications.waset.org/abstracts/search?q=Malay%20Kumar"> Malay Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Manu%20Vardhan"> Manu Vardhan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cloud computing is a new technology in industry and academia. The technology has grown and matured in last half decade and proven their significant role in changing environment of IT infrastructure where cloud services and resources are offered over the network. Cloud technology enables users to use services and resources without being concerned about the technical implications of technology. There are substantial research work has been performed for the usage of cloud computing in educational institutes and majority of them provides cloud services over high-end blade servers or other high-end CPUs. However, this paper proposes a new stack called “CiCKAStack” which provide cloud services over unutilized computing resources, named as commodity computers. “CiCKAStack” provides IaaS and PaaS using underlying commodity computers. This will not only increasing the utilization of existing computing resources but also provide organize file system, on demand computing resource and design and development environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=commodity%20computers" title="commodity computers">commodity computers</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud-computing" title=" cloud-computing"> cloud-computing</a>, <a href="https://publications.waset.org/abstracts/search?q=KVM" title=" KVM"> KVM</a>, <a href="https://publications.waset.org/abstracts/search?q=CloudStack" title=" CloudStack"> CloudStack</a>, <a href="https://publications.waset.org/abstracts/search?q=AppScale" title=" AppScale"> AppScale</a> </p> <a href="https://publications.waset.org/abstracts/18221/efficient-utilization-of-commodity-computers-in-academic-institutes-a-cloud-computing-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/18221.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">272</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1487</span> The Vision Baed Parallel Robot Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sun%20Lim">Sun Lim</a>, <a href="https://publications.waset.org/abstracts/search?q=Kyun%20Jung"> Kyun Jung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we describe the control strategy of high speed parallel robot system with EtherCAT network. This work deals the parallel robot system with centralized control on the real-time operating system such as window TwinCAT3. Most control scheme and algorithm is implemented master platform on the PC, the input and output interface is ported on the slave side. The data is transferred by maximum 20usecond with 1000byte. EtherCAT is very high speed and stable industrial network. The control strategy with EtherCAT is very useful and robust on Ethernet network environment. The developed parallel robot is controlled pre-design nonlinear controller for 6G/0.43 cycle time of pick and place motion tracking. The experiment shows the good design and validation of the controller. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20robot%20control" title="parallel robot control">parallel robot control</a>, <a href="https://publications.waset.org/abstracts/search?q=etherCAT" title=" etherCAT"> etherCAT</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20control" title=" nonlinear control"> nonlinear control</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20robot%20inverse%20kinematic" title=" parallel robot inverse kinematic"> parallel robot inverse kinematic</a> </p> <a href="https://publications.waset.org/abstracts/27428/the-vision-baed-parallel-robot-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27428.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">571</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1486</span> Flowing Online Vehicle GPS Data Clustering Using a New Parallel K-Means Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Orhun%20Vural">Orhun Vural</a>, <a href="https://publications.waset.org/abstracts/search?q=Oguz%20%20Bayat"> Oguz Bayat</a>, <a href="https://publications.waset.org/abstracts/search?q=Rustu%20Akay"> Rustu Akay</a>, <a href="https://publications.waset.org/abstracts/search?q=Osman%20N.%20Ucan"> Osman N. Ucan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents a new parallel approach clustering of GPS data. Evaluation has been made by comparing execution time of various clustering algorithms on GPS data. This paper aims to propose a parallel based on neighborhood K-means algorithm to make it faster. The proposed parallelization approach assumes that each GPS data represents a vehicle and to communicate between vehicles close to each other after vehicles are clustered. This parallelization approach has been examined on different sized continuously changing GPS data and compared with serial K-means algorithm and other serial clustering algorithms. The results demonstrated that proposed parallel K-means algorithm has been shown to work much faster than other clustering algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20k-means%20algorithm" title="parallel k-means algorithm">parallel k-means algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20clustering" title=" parallel clustering"> parallel clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20algorithms" title=" clustering algorithms"> clustering algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering%20on%20flowing%20data" title=" clustering on flowing data"> clustering on flowing data</a> </p> <a href="https://publications.waset.org/abstracts/86622/flowing-online-vehicle-gps-data-clustering-using-a-new-parallel-k-means-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86622.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">221</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1485</span> Parallel 2-Opt Local Search on GPU</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wen-Bao%20Qiao">Wen-Bao Qiao</a>, <a href="https://publications.waset.org/abstracts/search?q=Jean-Charles%20Cr%C3%A9put"> Jean-Charles Créput</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To accelerate the solution for large scale traveling salesman problems (TSP), a parallel 2-opt local search algorithm with simple implementation based on Graphics Processing Unit (GPU) is presented and tested in this paper. The parallel scheme is based on technique of data decomposition by dynamically assigning multiple K processors on the integral tour to treat K edges’ 2-opt local optimization simultaneously on independent sub-tours, where K can be user-defined or have a function relationship with input size N. We implement this algorithm with doubly linked list on GPU. The implementation only requires O(N) memory. We compare this parallel 2-opt local optimization against sequential exhaustive 2-opt search along integral tour on TSP instances from TSPLIB with more than 10000 cities. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%202-opt" title="parallel 2-opt">parallel 2-opt</a>, <a href="https://publications.waset.org/abstracts/search?q=double%20links" title=" double links"> double links</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20scale%20TSP" title=" large scale TSP"> large scale TSP</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU" title=" GPU"> GPU</a> </p> <a href="https://publications.waset.org/abstracts/58582/parallel-2-opt-local-search-on-gpu" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58582.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">624</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1484</span> Dynamic Analysis of Offshore 2-HUS/U Parallel Platform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Xie%20Kefeng">Xie Kefeng</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhang%20He"> Zhang He</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For the stability and control demand of offshore small floating platform, a 2-HUS/U parallel mechanism was presented as offshore platform. Inverse kinematics was obtained by institutional constraint equation, and the dynamic model of offshore 2-HUS/U parallel platform was derived based on rigid body’s Lagrangian method. The equivalent moment of inertia, damping and driving force/torque variation of offshore 2-HUS/U parallel platform were analyzed. A numerical example shows that, for parallel platform of given motion, system’s equivalent inertia changes 1.25 times maximally. During the movement of platform, they change dramatically with the system configuration and have coupling characteristics. The maximum equivalent drive torque is 800 N. At the same time, the curve of platform’s driving force/torque is smooth and has good sine features. The control system needs to be adjusted according to kinetic equation during stability and control and it provides a basis for the optimization of control system. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=2-HUS%2FU%20platform" title="2-HUS/U platform">2-HUS/U platform</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamics" title=" dynamics"> dynamics</a>, <a href="https://publications.waset.org/abstracts/search?q=Lagrange" title=" Lagrange"> Lagrange</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20platform" title=" parallel platform"> parallel platform</a> </p> <a href="https://publications.waset.org/abstracts/54812/dynamic-analysis-of-offshore-2-husu-parallel-platform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54812.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">345</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1483</span> Designing a Robust Controller for a 6 Linkage Robot </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=G.%20Khamooshian">G. Khamooshian</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the main points of application of the mechanisms of the series and parallel is the subject of managing them. The control of this mechanism and similar mechanisms is one that has always been the intention of the scholars. On the other hand, modeling the behavior of the system is difficult due to the large number of its parameters, and it leads to complex equations that are difficult to solve and eventually difficult to control. In this paper, a six-linkage robot has been presented that could be used in different areas such as medical robots. Using these robots needs a robust control. In this paper, the system equations are first found, and then the system conversion function is written. A new controller has been designed for this robot which could be used in other parallel robots and could be very useful. Parallel robots are so important in robotics because of their stability, so methods for control of them are important and the robust controller, especially in parallel robots, makes a sense. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=3-RRS" title="3-RRS">3-RRS</a>, <a href="https://publications.waset.org/abstracts/search?q=6%20linkage" title=" 6 linkage"> 6 linkage</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20robot" title=" parallel robot"> parallel robot</a>, <a href="https://publications.waset.org/abstracts/search?q=control" title=" control"> control</a> </p> <a href="https://publications.waset.org/abstracts/100326/designing-a-robust-controller-for-a-6-linkage-robot" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/100326.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">159</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1482</span> Parallel Querying of Distributed Ontologies with Shared Vocabulary</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sharjeel%20Aslam">Sharjeel Aslam</a>, <a href="https://publications.waset.org/abstracts/search?q=Vassil%20Vassilev"> Vassil Vassilev</a>, <a href="https://publications.waset.org/abstracts/search?q=Karim%20Ouazzane"> Karim Ouazzane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ontologies and various semantic repositories became a convenient approach for implementing model-driven architectures of distributed systems on the Web. SPARQL is the standard query language for querying such. However, although SPARQL is well-established standard for querying semantic repositories in RDF and OWL format and there are commonly used APIs which supports it, like Jena for Java, its parallel option is not incorporated in them. This article presents a complete framework consisting of an object algebra for parallel RDF and an index-based implementation of the parallel query engine capable of dealing with the distributed RDF ontologies which share common vocabulary. It has been implemented in Java, and for validation of the algorithms has been applied to the problem of organizing virtual exhibitions on the Web. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20ontologies" title="distributed ontologies">distributed ontologies</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20querying" title=" parallel querying"> parallel querying</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20indexing" title=" semantic indexing"> semantic indexing</a>, <a href="https://publications.waset.org/abstracts/search?q=shared%20vocabulary" title=" shared vocabulary"> shared vocabulary</a>, <a href="https://publications.waset.org/abstracts/search?q=SPARQL" title=" SPARQL"> SPARQL</a> </p> <a href="https://publications.waset.org/abstracts/105046/parallel-querying-of-distributed-ontologies-with-shared-vocabulary" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/105046.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">204</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1481</span> Parallel Coordinates on a Spiral Surface for Visualizing High-Dimensional Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chris%20Suma">Chris Suma</a>, <a href="https://publications.waset.org/abstracts/search?q=Yingcai%20Xiao"> Yingcai Xiao</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents Parallel Coordinates on a Spiral Surface (PCoSS), a parallel coordinate based interactive visualization method for high-dimensional data, and a test implementation of the method. Plots generated by the test system are compared with those generated by XDAT, a software implementing traditional parallel coordinates. Traditional parallel coordinate plots can be cluttered when the number of data points is large or when the dimensionality of the data is high. PCoSS plots display multivariate data on a 3D spiral surface and allow users to see the whole picture of high-dimensional data with less cluttering. Taking advantage of the 3D display environment in PCoSS, users can further reduce cluttering by zooming into an axis of interest for a closer view or by moving vantage points and by reorienting the viewing angle to obtain a desired view of the plots. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=human%20computer%20interaction" title="human computer interaction">human computer interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20coordinates" title=" parallel coordinates"> parallel coordinates</a>, <a href="https://publications.waset.org/abstracts/search?q=spiral%20surface" title=" spiral surface"> spiral surface</a>, <a href="https://publications.waset.org/abstracts/search?q=visualization" title=" visualization"> visualization</a> </p> <a href="https://publications.waset.org/abstracts/193466/parallel-coordinates-on-a-spiral-surface-for-visualizing-high-dimensional-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/193466.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">11</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1480</span> Parallel Random Number Generation for the Modern Supercomputer Architectures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Roman%20Snytsar">Roman Snytsar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Pseudo-random numbers are often used in scientific computing such as the Monte Carlo Simulations or the Quantum Inspired Optimization. Requirements for a parallel random number generator running in the modern multi-core vector environment are more stringent than those for sequential random number generators. As well as passing the usual quality tests, the output of the parallel random number generator must be verifiable and reproducible throughout the concurrent execution. We propose a family of vectorized Permuted Congruential Generators. Implementations are available for multiple modern vector modern computer architectures. Besides demonstrating good single core performance, the generators scale easily across many processor cores and multiple distributed nodes. We provide performance and parallel speedup analysis and comparisons between the implementations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pseudo-random%20numbers" title="pseudo-random numbers">pseudo-random numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20optimization" title=" quantum optimization"> quantum optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=SIMD" title=" SIMD"> SIMD</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/abstracts/152951/parallel-random-number-generation-for-the-modern-supercomputer-architectures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/152951.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">120</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1479</span> Machine Learning Approach for Mutation Testing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michael%20Stewart">Michael Stewart</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mutation testing is a type of software testing proposed in the 1970s where program statements are deliberately changed to introduce simple errors so that test cases can be validated to determine if they can detect the errors. Test cases are executed against the mutant code to determine if one fails, detects the error and ensures the program is correct. One major issue with this type of testing was it became intensive computationally to generate and test all possible mutations for complex programs. This paper used reinforcement learning and parallel processing within the context of mutation testing for the selection of mutation operators and test cases that reduced the computational cost of testing and improved test suite effectiveness. Experiments were conducted using sample programs to determine how well the reinforcement learning-based algorithm performed with one live mutation, multiple live mutations and no live mutations. The experiments, measured by mutation score, were used to update the algorithm and improved accuracy for predictions. The performance was then evaluated on multiple processor computers. With reinforcement learning, the mutation operators utilized were reduced by 50 – 100%. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automated-testing" title="automated-testing">automated-testing</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20learning" title=" machine learning"> machine learning</a>, <a href="https://publications.waset.org/abstracts/search?q=mutation%20testing" title=" mutation testing"> mutation testing</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20processing" title=" parallel processing"> parallel processing</a>, <a href="https://publications.waset.org/abstracts/search?q=reinforcement%20learning" title=" reinforcement learning"> reinforcement learning</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20engineering" title=" software engineering"> software engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=software%20testing" title=" software testing"> software testing</a> </p> <a href="https://publications.waset.org/abstracts/141195/machine-learning-approach-for-mutation-testing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141195.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">198</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1478</span> Classification Rule Discovery by Using Parallel Ant Colony Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Waseem%20Shahzad">Waseem Shahzad</a>, <a href="https://publications.waset.org/abstracts/search?q=Ayesha%20Tahir%20Khan"> Ayesha Tahir Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamid%20Hussain%20Awan"> Hamid Hussain Awan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ant-Miner algorithm that lies under ACO algorithms is used to extract knowledge from data in the form of rules. A variant of Ant-Miner algorithm named as cAnt-MinerPB is used to generate list of rules using pittsburgh approach in order to maintain the rule interaction among the rules that are generated. In this paper, we propose a parallel Ant MinerPB in which Ant colony optimization algorithm runs parallel. In this technique, a data set is divided vertically (i-e attributes) into different subsets. These subsets are created based on the correlation among attributes using Mutual Information (MI). It generates rules in a parallel manner and then merged to form a final list of rules. The results have shown that the proposed technique achieved higher accuracy when compared with original cAnt-MinerPB and also the execution time has also reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20Ant-MinerPB" title=" parallel Ant-MinerPB"> parallel Ant-MinerPB</a>, <a href="https://publications.waset.org/abstracts/search?q=vertical%20partitioning" title=" vertical partitioning"> vertical partitioning</a>, <a href="https://publications.waset.org/abstracts/search?q=classification%20rule%20discovery" title=" classification rule discovery"> classification rule discovery</a> </p> <a href="https://publications.waset.org/abstracts/43773/classification-rule-discovery-by-using-parallel-ant-colony-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43773.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">295</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1477</span> Towards the Management of Cybersecurity Threats in Organisations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=O.%20A.%20Ajigini">O. A. Ajigini</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20N.%20Mwim"> E. N. Mwim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Cybersecurity is the protection of computers, programs, networks, and data from attack, damage, unauthorised, unintended access, change, or destruction. Organisations collect, process and store their confidential and sensitive information on computers and transmit this data across networks to other computers. Moreover, the advent of internet technologies has led to various cyberattacks resulting in dangerous consequences for organisations. Therefore, with the increase in the volume and sophistication of cyberattacks, there is a need to develop models and make recommendations for the management of cybersecurity threats in organisations. This paper reports on various threats that cause malicious damage to organisations in cyberspace and provides measures on how these threats can be eliminated or reduced. The paper explores various aspects of protection measures against cybersecurity threats such as handling of sensitive data, network security, protection of information assets and cybersecurity awareness. The paper posits a model and recommendations on how to manage cybersecurity threats in organisations effectively. The model and the recommendations can then be utilised by organisations to manage the threats affecting their cyberspace. The paper provides valuable information to assist organisations in managing their cybersecurity threats and hence protect their computers, programs, networks and data in cyberspace. The paper aims to assist organisations to protect their information assets and data from cyberthreats as part of the contributions toward community engagement. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=confidential%20information" title="confidential information">confidential information</a>, <a href="https://publications.waset.org/abstracts/search?q=cyberattacks" title=" cyberattacks"> cyberattacks</a>, <a href="https://publications.waset.org/abstracts/search?q=cybersecurity" title=" cybersecurity"> cybersecurity</a>, <a href="https://publications.waset.org/abstracts/search?q=cyberspace" title=" cyberspace"> cyberspace</a>, <a href="https://publications.waset.org/abstracts/search?q=sensitive%20information" title=" sensitive information"> sensitive information</a> </p> <a href="https://publications.waset.org/abstracts/62869/towards-the-management-of-cybersecurity-threats-in-organisations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62869.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">259</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1476</span> On the Framework of Contemporary Intelligent Mathematics Underpinning Intelligent Science, Autonomous AI, and Cognitive Computers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yingxu%20Wang">Yingxu Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianhua%20Lu"> Jianhua Lu</a>, <a href="https://publications.waset.org/abstracts/search?q=Jun%20Peng"> Jun Peng</a>, <a href="https://publications.waset.org/abstracts/search?q=Jiawei%20Zhang"> Jiawei Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The fundamental demand in contemporary intelligent science towards Autonomous AI (AI*) is the creation of unprecedented formal means of Intelligent Mathematics (IM). It is discovered that natural intelligence is inductively created rather than exhaustively trained. Therefore, IM is a family of algebraic and denotational mathematics encompassing Inference Algebra, Real-Time Process Algebra, Concept Algebra, Semantic Algebra, Visual Frame Algebra, etc., developed in our labs. IM plays indispensable roles in training-free AI* theories and systems beyond traditional empirical data-driven technologies. A set of applications of IM-driven AI* systems will be demonstrated in contemporary intelligence science, AI*, and cognitive computers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=intelligence%20mathematics" title="intelligence mathematics">intelligence mathematics</a>, <a href="https://publications.waset.org/abstracts/search?q=foundations%20of%20intelligent%20science" title=" foundations of intelligent science"> foundations of intelligent science</a>, <a href="https://publications.waset.org/abstracts/search?q=autonomous%20AI" title=" autonomous AI"> autonomous AI</a>, <a href="https://publications.waset.org/abstracts/search?q=cognitive%20computers" title=" cognitive computers"> cognitive computers</a>, <a href="https://publications.waset.org/abstracts/search?q=inference%20algebra" title=" inference algebra"> inference algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=real-time%20process%20algebra" title=" real-time process algebra"> real-time process algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=concept%20algebra" title=" concept algebra"> concept algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20algebra" title=" semantic algebra"> semantic algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=applications" title=" applications"> applications</a> </p> <a href="https://publications.waset.org/abstracts/182399/on-the-framework-of-contemporary-intelligent-mathematics-underpinning-intelligent-science-autonomous-ai-and-cognitive-computers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/182399.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">61</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1475</span> Pushing the Boundary of Parallel Tractability for Ontology Materialization via Boolean Circuits</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zhangquan%20Zhou">Zhangquan Zhou</a>, <a href="https://publications.waset.org/abstracts/search?q=Guilin%20Qi"> Guilin Qi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Materialization is an important reasoning service for applications built on the Web Ontology Language (OWL). To make materialization efficient in practice, current research focuses on deciding tractability of an ontology language and designing parallel reasoning algorithms. However, some well-known large-scale ontologies, such as YAGO, have been shown to have good performance for parallel reasoning, but they are expressed in ontology languages that are not parallelly tractable, i.e., the reasoning is inherently sequential in the worst case. This motivates us to study the problem of parallel tractability of ontology materialization from a theoretical perspective. That is we aim to identify the ontologies for which materialization is parallelly tractable, i.e., in the NC complexity. Since the NC complexity is defined based on Boolean circuit that is widely used to investigate parallel computing problems, we first transform the problem of materialization to evaluation of Boolean circuits, and then study the problem of parallel tractability based on circuits. In this work, we focus on datalog rewritable ontology languages. We use Boolean circuits to identify two classes of datalog rewritable ontologies (called parallelly tractable classes) such that materialization over them is parallelly tractable. We further investigate the parallel tractability of materialization of a datalog rewritable OWL fragment DHL (Description Horn Logic). Based on the above results, we analyze real-world datasets and show that many ontologies expressed in DHL belong to the parallelly tractable classes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ontology%20materialization" title="ontology materialization">ontology materialization</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20reasoning" title=" parallel reasoning"> parallel reasoning</a>, <a href="https://publications.waset.org/abstracts/search?q=datalog" title=" datalog"> datalog</a>, <a href="https://publications.waset.org/abstracts/search?q=Boolean%20circuit" title=" Boolean circuit"> Boolean circuit</a> </p> <a href="https://publications.waset.org/abstracts/57402/pushing-the-boundary-of-parallel-tractability-for-ontology-materialization-via-boolean-circuits" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57402.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">271</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1474</span> Comparative Analysis of Classical and Parallel Inpainting Algorithms Based on Affine Combinations of Projections on Convex Sets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Irina%20Maria%20Artinescu">Irina Maria Artinescu</a>, <a href="https://publications.waset.org/abstracts/search?q=Costin%20Radu%20Boldea"> Costin Radu Boldea</a>, <a href="https://publications.waset.org/abstracts/search?q=Eduard-Ionut%20Matei"> Eduard-Ionut Matei</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper is a comparative study of two classical variants of parallel projection methods for solving the convex feasibility problem with their equivalents that involve variable weights in the construction of the solutions. We used a graphical representation of these methods for inpainting a convex area of an image in order to investigate their effectiveness in image reconstruction applications. We also presented a numerical analysis of the convergence of these four algorithms in terms of the average number of steps and execution time in classical CPU and, alternatively, in parallel GPU implementation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convex%20feasibility%20problem" title="convex feasibility problem">convex feasibility problem</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence%20analysis" title=" convergence analysis"> convergence analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=inpainting" title=" inpainting"> inpainting</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20projection%20methods" title=" parallel projection methods"> parallel projection methods</a> </p> <a href="https://publications.waset.org/abstracts/133736/comparative-analysis-of-classical-and-parallel-inpainting-algorithms-based-on-affine-combinations-of-projections-on-convex-sets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/133736.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">174</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1473</span> Achievable Average Secrecy Rates over Bank of Parallel Independent Fading Channels with Friendly Jamming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Munnujahan%20Ara">Munnujahan Ara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we investigate the effect of friendly jamming power allocation strategies on the achievable average secrecy rate over a bank of parallel fading wiretap channels. We investigate the achievable average secrecy rate in parallel fading wiretap channels subject to Rayleigh and Rician fading. The achievable average secrecy rate, due to the presence of a line-of-sight component in the jammer channel is also evaluated. Moreover, we study the detrimental effect of correlation across the parallel sub-channels, and evaluate the corresponding decrease in the achievable average secrecy rate for the various fading configurations. We also investigate the tradeoff between the transmission power and the jamming power for a fixed total power budget. Our results, which are applicable to current orthogonal frequency division multiplexing (OFDM) communications systems, shed further light on the achievable average secrecy rates over a bank of parallel fading channels in the presence of friendly jammers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fading%20parallel%20channels" title="fading parallel channels">fading parallel channels</a>, <a href="https://publications.waset.org/abstracts/search?q=wire-tap%20channel" title=" wire-tap channel"> wire-tap channel</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDM" title=" OFDM"> OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=secrecy%20capacity" title=" secrecy capacity"> secrecy capacity</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20allocation" title=" power allocation"> power allocation</a> </p> <a href="https://publications.waset.org/abstracts/25080/achievable-average-secrecy-rates-over-bank-of-parallel-independent-fading-channels-with-friendly-jamming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25080.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">512</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1472</span> Human-Computer Interaction: Strategies for Ensuring the Design of User-Centered Web Interfaces for Smartphones</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Byron%20Joseph%20A.%20Hallar">Byron Joseph A. Hallar</a>, <a href="https://publications.waset.org/abstracts/search?q=Annjeannette%20Alain%20D.%20Galang"> Annjeannette Alain D. Galang</a>, <a href="https://publications.waset.org/abstracts/search?q=Maria%20Visitacion%20N.%20Gumabay"> Maria Visitacion N. Gumabay</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The widespread adoption and increasing proliferation of smartphones that started during the first decade of the twenty-first century have enabled their users to communicate and access information in ways that were merely thought of as possibilities in the few years before the smartphone revolution. A product of the convergence of the cellular phone and portable computer, the smartphone provides an additional important function that used to be the exclusive domain of desktop-bound computers and portable computers: Web Browsing. For increasing numbers of users, the smartphone and allied devices such as tablet computers have become their first and often their only means of accessing the World Wide Web. This has led to the development of websites that cater to the needs of the new breed of smartphone-carrying web users. The smaller size of smartphones as compared with conventional computers has provided unique challenges to web interface designers. The smaller screen size and touchscreen interface have made it much more difficult to read and navigate through web pages that were in most part designed for traditional desktop and portable computers. Although increasing numbers of websites now provide an alternate website formatted for smartphones, problems with ease of use, reliability and usability still remain. This study focuses on the identification of the problems associated with smartphone web interfaces, the compliance with accepted standards of user-oriented web interface design, the strategies that could be utilized to ensure the design of user-centric web interfaces for smartphones, and the identification of the current trends and developments related to user-centric web interface design intended for the consumption of smartphone users. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=human-computer%20interaction" title="human-computer interaction">human-computer interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=user-centered%20design" title=" user-centered design"> user-centered design</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20interface" title=" web interface"> web interface</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile" title=" mobile"> mobile</a>, <a href="https://publications.waset.org/abstracts/search?q=smartphone" title=" smartphone "> smartphone </a> </p> <a href="https://publications.waset.org/abstracts/46032/human-computer-interaction-strategies-for-ensuring-the-design-of-user-centered-web-interfaces-for-smartphones" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46032.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">356</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">1471</span> A Parallel Algorithm for Solving the PFSP on the Grid</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Samia%20Kouki">Samia Kouki</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Solving NP-hard combinatorial optimization problems by exact search methods, such as Branch-and-Bound, may degenerate to complete enumeration. For that reason, exact approaches limit us to solve only small or moderate size problem instances, due to the exponential increase in CPU time when problem size increases. One of the most promising ways to reduce significantly the computational burden of sequential versions of Branch-and-Bound is to design parallel versions of these algorithms which employ several processors. This paper describes a parallel Branch-and-Bound algorithm called GALB for solving the classical permutation flowshop scheduling problem as well as its implementation on a Grid computing infrastructure. The experimental study of our distributed parallel algorithm gives promising results and shows clearly the benefit of the parallel paradigm to solve large-scale instances in moderate CPU time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=grid%20computing" title="grid computing">grid computing</a>, <a href="https://publications.waset.org/abstracts/search?q=permutation%20flow%20shop%20problem" title=" permutation flow shop problem"> permutation flow shop problem</a>, <a href="https://publications.waset.org/abstracts/search?q=branch%20and%20bound" title=" branch and bound"> branch and bound</a>, <a href="https://publications.waset.org/abstracts/search?q=load%20balancing" title=" load balancing"> load balancing</a> </p> <a href="https://publications.waset.org/abstracts/47518/a-parallel-algorithm-for-solving-the-pfsp-on-the-grid" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47518.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">283</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&page=49">49</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&page=50">50</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=parallel%20computers&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>