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: bio-inspired computation</title> <meta name="description" content="Search results for: bio-inspired computation"> <meta name="keywords" content="bio-inspired computation"> <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="bio-inspired computation" 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="bio-inspired computation"> <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> 557</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: bio-inspired computation</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">527</span> A Comparison of Methods for Neural Network Aggregation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=John%20Pomerat">John Pomerat</a>, <a href="https://publications.waset.org/abstracts/search?q=Aviv%20Segev"> Aviv Segev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, deep learning has had many theoretical breakthroughs. For deep learning to be successful in the industry, however, there need to be practical algorithms capable of handling many real-world hiccups preventing the immediate application of a learning algorithm. Although AI promises to revolutionize the healthcare industry, getting access to patient data in order to train learning algorithms has not been easy. One proposed solution to this is data- sharing. In this paper, we propose an alternative protocol, based on multi-party computation, to train deep learning models while maintaining both the privacy and security of training data. We examine three methods of training neural networks in this way: Transfer learning, average ensemble learning, and series network learning. We compare these methods to the equivalent model obtained through data-sharing across two different experiments. Additionally, we address the security concerns of this protocol. While the motivating example is healthcare, our findings regarding multi-party computation of neural network training are purely theoretical and have use-cases outside the domain of healthcare. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=neural%20network%20aggregation" title="neural network aggregation">neural network aggregation</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-party%20computation" title=" multi-party computation"> multi-party computation</a>, <a href="https://publications.waset.org/abstracts/search?q=transfer%20learning" title=" transfer learning"> transfer learning</a>, <a href="https://publications.waset.org/abstracts/search?q=average%20ensemble%20learning" title=" average ensemble learning"> average ensemble learning</a> </p> <a href="https://publications.waset.org/abstracts/128037/a-comparison-of-methods-for-neural-network-aggregation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/128037.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">162</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">526</span> A Bioinspired Anti-Fouling Coating for Implantable Medical Devices</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Natalie%20Riley">Natalie Riley</a>, <a href="https://publications.waset.org/abstracts/search?q=Anita%20Quigley"> Anita Quigley</a>, <a href="https://publications.waset.org/abstracts/search?q=Robert%20M.%20I.%20Kapsa"> Robert M. I. Kapsa</a>, <a href="https://publications.waset.org/abstracts/search?q=George%20W.%20Greene"> George W. Greene</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As the fields of medicine and bionics grow rapidly in technological advancement, the future and success of it depends on the ability to effectively interface between the artificial and the biological worlds. The biggest obstacle when it comes to implantable, electronic medical devices, is maintaining a ‘clean’, low noise electrical connection that allows for efficient sharing of electrical information between the artificial and biological systems. Implant fouling occurs with the adhesion and accumulation of proteins and various cell types as a result of the immune response to protect itself from the foreign object, essentially forming an electrical insulation barrier that often leads to implant failure over time. Lubricin (LUB) functions as a major boundary lubricant in articular joints, a unique glycoprotein with impressive anti-adhesive properties that self-assembles to virtually any substrate to form a highly ordered, ‘telechelic’ polymer brush. LUB does not passivate electroactive surfaces which makes it ideal, along with its innate biocompatibility, as a coating for implantable bionic electrodes. It is the aim of the study to investigate LUB’s anti-fouling properties and its potential as a safe, bioinspired material for coating applications to enhance the performance and longevity of implantable medical devices as well as reducing the frequency of implant replacement surgeries. Native, bovine-derived LUB (N-LUB) and recombinant LUB (R-LUB) were applied to gold-coated mylar surfaces. Fibroblast, chondrocyte and neural cell types were cultured and grown on the coatings under both passive and electrically stimulated conditions to test the stability and anti-adhesive property of the LUB coating in the presence of an electric field. Lactate dehydrogenase (LDH) assays were conducted as a directly proportional cell population count on each surface along with immunofluorescent microscopy to visualize cells. One-way analysis of variance (ANOVA) with post-hoc Tukey’s test was used to test for statistical significance. Under both passive and electrically stimulated conditions, LUB significantly reduced cell attachment compared to bare gold. Comparing the two coating types, R-LUB reduced cell attachment significantly compared to its native counterpart. Immunofluorescent micrographs visually confirmed LUB’s antiadhesive property, R-LUB consistently demonstrating significantly less attached cells for both fibroblasts and chondrocytes. Preliminary results investigating neural cells have so far demonstrated that R-LUB has little effect on reducing neural cell attachment; the study is ongoing. Recombinant LUB coatings demonstrated impressive anti-adhesive properties, reducing cell attachment in fibroblasts and chondrocytes. These findings and the availability of recombinant LUB brings into question the results of previous experiments conducted using native-derived LUB, its potential not adequately represented nor realized due to unknown factors and impurities that warrant further study. R-LUB is stable and maintains its anti-fouling property under electrical stimulation, making it suitable for electroactive surfaces. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=anti-fouling" title="anti-fouling">anti-fouling</a>, <a href="https://publications.waset.org/abstracts/search?q=bioinspired" title=" bioinspired"> bioinspired</a>, <a href="https://publications.waset.org/abstracts/search?q=cell%20attachment" title=" cell attachment"> cell attachment</a>, <a href="https://publications.waset.org/abstracts/search?q=lubricin" title=" lubricin"> lubricin</a> </p> <a href="https://publications.waset.org/abstracts/111652/a-bioinspired-anti-fouling-coating-for-implantable-medical-devices" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/111652.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">124</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">525</span> Graphic Procession Unit-Based Parallel Processing for Inverse Computation of Full-Field Material Properties Based on Quantitative Laser Ultrasound Visualization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sheng-Po%20Tseng">Sheng-Po Tseng</a>, <a href="https://publications.waset.org/abstracts/search?q=Che-Hua%20Yang"> Che-Hua Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Motivation and Objective: Ultrasonic guided waves become an important tool for nondestructive evaluation of structures and components. Guided waves are used for the purpose of identifying defects or evaluating material properties in a nondestructive way. While guided waves are applied for evaluating material properties, instead of knowing the properties directly, preliminary signals such as time domain signals or frequency domain spectra are first revealed. With the measured ultrasound data, inversion calculation can be further employed to obtain the desired mechanical properties. Methods: This research is development of high speed inversion calculation technique for obtaining full-field mechanical properties from the quantitative laser ultrasound visualization system (QLUVS). The quantitative laser ultrasound visualization system (QLUVS) employs a mirror-controlled scanning pulsed laser to generate guided acoustic waves traveling in a two-dimensional target. Guided waves are detected with a piezoelectric transducer located at a fixed location. With a gyro-scanning of the generation source, the QLUVS has the advantage of fast, full-field, and quantitative inspection. Results and Discussions: This research introduces two important tools to improve the computation efficiency. Firstly, graphic procession unit (GPU) with large amount of cores are introduced. Furthermore, combining the CPU and GPU cores, parallel procession scheme is developed for the inversion of full-field mechanical properties based on the QLUVS data. The newly developed inversion scheme is applied to investigate the computation efficiency for single-layered and double-layered plate-like samples. The computation efficiency is shown to be 80 times faster than unparalleled computation scheme. Conclusions: This research demonstrates a high-speed inversion technique for the characterization of full-field material properties based on quantitative laser ultrasound visualization system. Significant computation efficiency is shown, however not reaching the limit yet. Further improvement can be reached by improving the parallel computation. Utilizing the development of the full-field mechanical property inspection technology, full-field mechanical property measured by non-destructive, high-speed and high-precision measurements can be obtained in qualitative and quantitative results. The developed high speed computation scheme is ready for applications where full-field mechanical properties are needed in a nondestructive and nearly real-time way. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=guided%20waves" title="guided waves">guided waves</a>, <a href="https://publications.waset.org/abstracts/search?q=material%20characterization" title=" material characterization"> material characterization</a>, <a href="https://publications.waset.org/abstracts/search?q=nondestructive%20evaluation" title=" nondestructive evaluation"> nondestructive evaluation</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20processing" title=" parallel processing"> parallel processing</a> </p> <a href="https://publications.waset.org/abstracts/92173/graphic-procession-unit-based-parallel-processing-for-inverse-computation-of-full-field-material-properties-based-on-quantitative-laser-ultrasound-visualization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92173.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">202</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">524</span> Speed up Vector Median Filtering by Quasi Euclidean Norm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vinai%20K.%20Singh">Vinai K. Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> For reducing impulsive noise without degrading image contours, median filtering is a powerful tool. In multiband images as for example colour images or vector fields obtained by optic flow computation, a vector median filter can be used. Vector median filters are defined on the basis of a suitable distance, the best performing distance being the Euclidean. Euclidean distance is evaluated by using the Euclidean norms which is quite demanding from the point of view of computation given that a square root is required. In this paper an optimal piece-wise linear approximation of the Euclidean norm is presented which is applied to vector median filtering. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=euclidean%20norm" title="euclidean norm">euclidean norm</a>, <a href="https://publications.waset.org/abstracts/search?q=quasi%20euclidean%20norm" title=" quasi euclidean norm"> quasi euclidean norm</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20median%20filtering" title=" vector median filtering"> vector median filtering</a>, <a href="https://publications.waset.org/abstracts/search?q=applied%20mathematics" title=" applied mathematics"> applied mathematics</a> </p> <a href="https://publications.waset.org/abstracts/21942/speed-up-vector-median-filtering-by-quasi-euclidean-norm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21942.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">474</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">523</span> Cloud-Based Mobile-to-Mobile Computation Offloading</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ebrahim%20Alrashed">Ebrahim Alrashed</a>, <a href="https://publications.waset.org/abstracts/search?q=Yousef%20Rafique"> Yousef Rafique</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Mobile devices have drastically changed the way we do things on the move. They are being extremely relied on to perform tasks that are analogous to desktop computer capability. There has been a rapid increase of computational power on these devices; however, battery technology is still the bottleneck of evolution. The primary modern approach day approach to tackle this issue is offloading computation to the cloud, proving to be latency expensive and requiring high network bandwidth. In this paper, we explore efforts to perform barter-based mobile-to-mobile offloading. We present define a protocol and present an architecture to facilitate the development of such a system. We further highlight the deployment and security challenges. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computational%20offloading" title="computational offloading">computational offloading</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20conservation" title=" power conservation"> power conservation</a>, <a href="https://publications.waset.org/abstracts/search?q=cloud" title=" cloud"> cloud</a>, <a href="https://publications.waset.org/abstracts/search?q=sandboxing" title=" sandboxing"> sandboxing</a> </p> <a href="https://publications.waset.org/abstracts/33107/cloud-based-mobile-to-mobile-computation-offloading" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33107.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">388</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">522</span> Programming with Grammars</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Peter%20M.%20Maurer%20Maurer">Peter M. Maurer Maurer</a> </p> <p class="card-text"><strong>Abstract:</strong></p> DGL is a context free grammar-based tool for generating random data. Many types of simulator input data require some computation to be placed in the proper format. For example, it might be necessary to generate ordered triples in which the third element is the sum of the first two elements, or it might be necessary to generate random numbers in some sorted order. Although DGL is universal in computational power, generating these types of data is extremely difficult. To overcome this problem, we have enhanced DGL to include features that permit direct computation within the structure of a context free grammar. The features have been implemented as special types of productions, preserving the context free flavor of DGL specifications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DGL" title="DGL">DGL</a>, <a href="https://publications.waset.org/abstracts/search?q=Enhanced%20Context%20Free%20Grammars" title=" Enhanced Context Free Grammars"> Enhanced Context Free Grammars</a>, <a href="https://publications.waset.org/abstracts/search?q=Programming%20Constructs" title=" Programming Constructs"> Programming Constructs</a>, <a href="https://publications.waset.org/abstracts/search?q=Random%20Data%20Generation" title=" Random Data Generation"> Random Data Generation</a> </p> <a href="https://publications.waset.org/abstracts/129615/programming-with-grammars" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129615.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">147</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">521</span> Algorithms for Fast Computation of Pan Matrix Profiles of Time Series Under Unnormalized Euclidean Distances</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jing%20Zhang">Jing Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Daniel%20Nikovski"> Daniel Nikovski</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose an approximation algorithm called LINKUMP to compute the Pan Matrix Profile (PMP) under the unnormalized l∞ distance (useful for value-based similarity search) using double-ended queue and linear interpolation. The algorithm has comparable time/space complexities as the state-of-the-art algorithm for typical PMP computation under the normalized l₂ distance (useful for shape-based similarity search). We validate its efficiency and effectiveness through extensive numerical experiments and a real-world anomaly detection application. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pan%20matrix%20profile" title="pan matrix profile">pan matrix profile</a>, <a href="https://publications.waset.org/abstracts/search?q=unnormalized%20euclidean%20distance" title=" unnormalized euclidean distance"> unnormalized euclidean distance</a>, <a href="https://publications.waset.org/abstracts/search?q=double-ended%20queue" title=" double-ended queue"> double-ended queue</a>, <a href="https://publications.waset.org/abstracts/search?q=discord%20discovery" title=" discord discovery"> discord discovery</a>, <a href="https://publications.waset.org/abstracts/search?q=anomaly%20detection" title=" anomaly detection"> anomaly detection</a> </p> <a href="https://publications.waset.org/abstracts/144363/algorithms-for-fast-computation-of-pan-matrix-profiles-of-time-series-under-unnormalized-euclidean-distances" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144363.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">247</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">520</span> Symbolic Computation for the Multi-Soliton Solutions of a Class of Fifth-Order Evolution Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rafat%20Alshorman">Rafat Alshorman</a>, <a href="https://publications.waset.org/abstracts/search?q=Fadi%20Awawdeh"> Fadi Awawdeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> By employing a simplified bilinear method, a class of generalized fifth-order KdV (gfKdV) equations which arise in nonlinear lattice, plasma physics and ocean dynamics are investigated. With the aid of symbolic computation, both solitary wave solutions and multiple-soliton solutions are obtained. These new exact solutions will extend previous results and help us explain the properties of nonlinear solitary waves in many physical models in shallow water. Parametric analysis is carried out in order to illustrate that the soliton amplitude, width and velocity are affected by the coefficient parameters in the equation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=multiple%20soliton%20solutions" title="multiple soliton solutions">multiple soliton solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=fifth-order%20evolution%20equations" title=" fifth-order evolution equations"> fifth-order evolution equations</a>, <a href="https://publications.waset.org/abstracts/search?q=Cole-Hopf%20transformation" title=" Cole-Hopf transformation"> Cole-Hopf transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=Hirota%20bilinear%20method" title=" Hirota bilinear method"> Hirota bilinear method</a> </p> <a href="https://publications.waset.org/abstracts/9376/symbolic-computation-for-the-multi-soliton-solutions-of-a-class-of-fifth-order-evolution-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9376.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">320</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">519</span> Development of Anti-Fouling Surface Features Bioinspired by the Patterned Micro-Textures of the Scophthalmus rhombus (Brill)</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ivan%20Maguire">Ivan Maguire</a>, <a href="https://publications.waset.org/abstracts/search?q=Alan%20Barrett"> Alan Barrett</a>, <a href="https://publications.waset.org/abstracts/search?q=Alex%20Forte"> Alex Forte</a>, <a href="https://publications.waset.org/abstracts/search?q=Sandra%20Kwiatkowska"> Sandra Kwiatkowska</a>, <a href="https://publications.waset.org/abstracts/search?q=Rohit%20Mishra"> Rohit Mishra</a>, <a href="https://publications.waset.org/abstracts/search?q=Jens%20Ducr%C3%A8e"> Jens Ducrèe</a>, <a href="https://publications.waset.org/abstracts/search?q=Fiona%20Regan"> Fiona Regan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Biofouling is defined as the gradual accumulation of Biomimetics refers to the use and imitation of principles copied from nature. Biomimetics has found interest across many commercial disciplines. Among many biological objects and their functions, aquatic animals deserve a special attention due to their antimicrobial capabilities resulting from chemical composition, surface topography or other behavioural defences, which can be used as an inspiration for antifouling technology. Marine biofouling has detrimental effects on seagoing vessels, both commercial and leisure, as well as on oceanographic sensors, offshore drilling rigs, and aquaculture installations. Sensor optics, membranes, housings and platforms can become fouled leading to problems with sensor performance and data integrity. While many anti-fouling solutions are currently being investigated as a cost-cutting measure, biofouling settlement may also be prevented by creating a surface that does not satisfy the settlement conditions. Brill (Scophthalmus rhombus) is a small flatfish occurring in marine waters of Mediterranean as well as Norway and Iceland. It inhabits sandy and muddy coastal waters from 5 to 80 meters. Its skin colour changes depending on environment, but generally is brownish with light and dark freckles, with creamy underside. Brill is oval in shape and its flesh is white. The aim of this study is to translate the unique micro-topography of the brill scale, to design marine inspired biomimetic surface coating and test it against a typical fouling organism. Following extensive study of scale topography of the brill fish (Scophthalmus rhombus) and the settlement behaviour of the diatom species Psammodictyon sp. via SEM, two state-of-the-art antifouling surface solutions were designed and investigated; A brill fish scale bioinspired surface pattern platform (BFD), and generic and uniformly-arrayed, circular micropillar platform (MPD), with offsets based on diatom species settlement behaviour. The BFD approach consists of different ~5 μm by ~90 μm Brill-replica patterns, grown to a 5 μm height, in a linear array pattern. The MPD approach utilises hexagonal-packed cylindrical pillars 10.6 μm in diameter, grown to a height of 5 μm, with vertical offset of 15 μm and horizontal offset of 26.6 μm. Photolithography was employed for microstructure growth, with a polydimethylsiloxane (PDMS) chip-based used as a testbed for diatom adhesion on both platforms. Settlement and adhesion tests were performed using this PDMS microfluidic chip through subjugation to centrifugal force via an in-house developed ‘spin-stand’ which features a motor, in combination with a high-resolution camera, for real-time observing diatom release from PDMS material. Diatom adhesion strength can therefore be determined based on the centrifugal force generated at varying rotational speeds. It is hoped that both the replica and bio-inspired solutions will give comparable anti-fouling results to these synthetic surfaces, whilst also assisting in determining whether anti-fouling solutions should predominantly be investigating either fully bioreplica-based, or a bioinspired, synthetically-based design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=anti-fouling%20applications" title="anti-fouling applications">anti-fouling applications</a>, <a href="https://publications.waset.org/abstracts/search?q=bio-inspired%20microstructures" title=" bio-inspired microstructures"> bio-inspired microstructures</a>, <a href="https://publications.waset.org/abstracts/search?q=centrifugal%20microfluidics" title=" centrifugal microfluidics"> centrifugal microfluidics</a>, <a href="https://publications.waset.org/abstracts/search?q=surface%20modification" title=" surface modification"> surface modification</a> </p> <a href="https://publications.waset.org/abstracts/69114/development-of-anti-fouling-surface-features-bioinspired-by-the-patterned-micro-textures-of-the-scophthalmus-rhombus-brill" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/69114.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">317</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">518</span> Multi-Objective Evolutionary Computation Based Feature Selection Applied to Behaviour Assessment of Children</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=F.%20Jim%C3%A9nez">F. Jiménez</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20J%C3%B3dar"> R. Jódar</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Mart%C3%ADn"> M. Martín</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20S%C3%A1nchez"> G. Sánchez</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20Sciavicco"> G. Sciavicco</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Abstract—Attribute or feature selection is one of the basic strategies to improve the performances of data classification tasks, and, at the same time, to reduce the complexity of classifiers, and it is a particularly fundamental one when the number of attributes is relatively high. Its application to unsupervised classification is restricted to a limited number of experiments in the literature. Evolutionary computation has already proven itself to be a very effective choice to consistently reduce the number of attributes towards a better classification rate and a simpler semantic interpretation of the inferred classifiers. We present a feature selection wrapper model composed by a multi-objective evolutionary algorithm, the clustering method Expectation-Maximization (EM), and the classifier C4.5 for the unsupervised classification of data extracted from a psychological test named BASC-II (Behavior Assessment System for Children - II ed.) with two objectives: Maximizing the likelihood of the clustering model and maximizing the accuracy of the obtained classifier. We present a methodology to integrate feature selection for unsupervised classification, model evaluation, decision making (to choose the most satisfactory model according to a a posteriori process in a multi-objective context), and testing. We compare the performance of the classifier obtained by the multi-objective evolutionary algorithms ENORA and NSGA-II, and the best solution is then validated by the psychologists that collected the data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20computation" title="evolutionary computation">evolutionary computation</a>, <a href="https://publications.waset.org/abstracts/search?q=feature%20selection" title=" feature selection"> feature selection</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification"> classification</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a> </p> <a href="https://publications.waset.org/abstracts/44594/multi-objective-evolutionary-computation-based-feature-selection-applied-to-behaviour-assessment-of-children" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44594.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">371</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">517</span> Low Complexity Deblocking Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jagroop%20Singh%20Sidhu">Jagroop Singh Sidhu</a>, <a href="https://publications.waset.org/abstracts/search?q=Buta%20Singh"> Buta Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A low computational deblocking filter including three frequency related modes (smooth mode, intermediate mode, and non-smooth mode for low-frequency, mid-frequency, and high frequency regions, respectively) is proposed. The suggested approach requires zero additions, zero subtractions, zero multiplications (for intermediate region), no divisions (for non-smooth region) and no comparison. The suggested method thus keeps the computation lower and thus suitable for image coding systems based on blocks. Comparison of average number of operations for smooth, non-smooth, intermediate (per pixel vector for each block) using filter suggested by Chen and the proposed method filter suggests that the proposed filter keeps the computation lower and is thus suitable for fast processing algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=blocking%20artifacts" title="blocking artifacts">blocking artifacts</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20complexity" title=" computational complexity"> computational complexity</a>, <a href="https://publications.waset.org/abstracts/search?q=non-smooth" title=" non-smooth"> non-smooth</a>, <a href="https://publications.waset.org/abstracts/search?q=intermediate" title=" intermediate"> intermediate</a>, <a href="https://publications.waset.org/abstracts/search?q=smooth" title=" smooth"> smooth</a> </p> <a href="https://publications.waset.org/abstracts/47157/low-complexity-deblocking-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47157.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">462</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">516</span> Measuring Development through Extreme Observations: An Archetypal Analysis Approach to Index Construction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Claudeline%20D.%20Cellan">Claudeline D. Cellan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Development is multifaceted, and efforts to hasten growth in all these facets have been gaining traction in recent years. Thus, producing a composite index that is reflective of these multidimensional impacts captures the interests of policymakers. The problem lies in going through a mixture of theoretical, methodological and empirical decisions and complexities which, when done carelessly, can lead to inconsistent and unreliable results. This study looks into index computation from a different and less complex perspective. Borrowing the idea of archetypes or ‘pure types’, archetypal analysis looks for points in the convex hull of the multivariate data set that captures as much information in the data as possible. The archetypes or 'pure types' are estimated such that they are convex combinations of all the observations, which in turn are convex combinations of the archetypes. This ensures that the archetypes are realistically observable, therefore achievable. In the sense of composite indices, we look for the best among these archetypes and use this as a benchmark for index computation. Its straightforward and simplistic approach does away with aggregation and substitutability problems which are commonly encountered in index computation. As an example of the application of archetypal analysis in index construction, the country data for the Human Development Index (HDI 2017) of the United Nations Development Programme (UNDP) is used. The goal of this exercise is not to replicate the result of the UNDP-computed HDI, but to illustrate the usability of archetypal analysis in index construction. Here best is defined in the context of life, education and gross national income sub-indices. Results show that the HDI from the archetypal analysis has a linear relationship with the UNDP-computed HDI. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=archetypes" title="archetypes">archetypes</a>, <a href="https://publications.waset.org/abstracts/search?q=composite%20index" title=" composite index"> composite index</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20combination" title=" convex combination"> convex combination</a>, <a href="https://publications.waset.org/abstracts/search?q=development" title=" development"> development</a> </p> <a href="https://publications.waset.org/abstracts/107237/measuring-development-through-extreme-observations-an-archetypal-analysis-approach-to-index-construction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/107237.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">128</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">515</span> A Fast Calculation Approach for Position Identification in a Distance Space</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dawei%20Cai">Dawei Cai</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuya%20Tokuda"> Yuya Tokuda</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The market of localization based service (LBS) is expanding. The acquisition of physical location is the fundamental basis for LBS. GPS, the de facto standard for outdoor localization, does not work well in indoor environment due to the blocking of signals by walls and ceiling. To acquire high accurate localization in an indoor environment, many techniques have been developed. Triangulation approach is often used for identifying the location, but a heavy and complex computation is necessary to calculate the location of the distances between the object and several source points. This computation is also time and power consumption, and not favorable to a mobile device that needs a long action life with battery. To provide a low power consumption approach for a mobile device, this paper presents a fast calculation approach to identify the location of the object without online solving solutions to simultaneous quadratic equations. In our approach, we divide the location identification into two parts, one is offline, and other is online. In offline mode, we make a mapping process that maps the location area to distance space and find a simple formula that can be used to identify the location of the object online with very light computation. The characteristic of the approach is a good tradeoff between the accuracy and computational amount. Therefore, this approach can be used in smartphone and other mobile devices that need a long work time. To show the performance, some simulation experimental results are provided also in the paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=indoor%20localization" title="indoor localization">indoor localization</a>, <a href="https://publications.waset.org/abstracts/search?q=location%20based%20service" title=" location based service"> location based service</a>, <a href="https://publications.waset.org/abstracts/search?q=triangulation" title=" triangulation"> triangulation</a>, <a href="https://publications.waset.org/abstracts/search?q=fast%20calculation" title=" fast calculation"> fast calculation</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20device" title=" mobile device"> mobile device</a> </p> <a href="https://publications.waset.org/abstracts/86046/a-fast-calculation-approach-for-position-identification-in-a-distance-space" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86046.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">514</span> Forward Stable Computation of Roots of Real Polynomials with Only Real Distinct Roots</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nevena%20Jakov%C4%8Devi%C4%87%20Stor">Nevena Jakovčević Stor</a>, <a href="https://publications.waset.org/abstracts/search?q=Ivan%20Slapni%C4%8Dar"> Ivan Slapničar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be chosen as real. By using accurate forward stable algorithm for computing eigen values of real symmetric arrowhead matrices we derive a forward stable algorithm for computation of roots of such polynomials in O(n^2 ) operations. The algorithm computes each root to almost full accuracy. In some cases, the algorithm invokes extended precision routines, but only in the non-iterative part. Our examples include numerically difficult problems, like the well-known Wilkinson’s polynomials. Our algorithm compares favorably to other method for polynomial root-finding, like MPSolve or Newton’s method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=roots%20of%20polynomials" title="roots of polynomials">roots of polynomials</a>, <a href="https://publications.waset.org/abstracts/search?q=eigenvalue%20decomposition" title=" eigenvalue decomposition"> eigenvalue decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=arrowhead%20matrix" title=" arrowhead matrix"> arrowhead matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20relative%20accuracy" title=" high relative accuracy"> high relative accuracy</a> </p> <a href="https://publications.waset.org/abstracts/40100/forward-stable-computation-of-roots-of-real-polynomials-with-only-real-distinct-roots" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40100.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">418</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">513</span> Stochastic Control of Decentralized Singularly Perturbed Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Walid%20S.%20Alfuhaid">Walid S. Alfuhaid</a>, <a href="https://publications.waset.org/abstracts/search?q=Saud%20A.%20Alghamdi"> Saud A. Alghamdi</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20M.%20Watkins"> John M. Watkins</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Edwin%20Sawan"> M. Edwin Sawan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Designing a controller for stochastic decentralized interconnected large scale systems usually involves a high degree of complexity and computation ability. Noise, observability, and controllability of all system states, connectivity, and channel bandwidth are other constraints to design procedures for distributed large scale systems. The quasi-steady state model investigated in this paper is a reduced order model of the original system using singular perturbation techniques. This paper results in an optimal control synthesis to design an observer based feedback controller by standard stochastic control theory techniques using Linear Quadratic Gaussian (LQG) approach and Kalman filter design with less complexity and computation requirements. Numerical example is given at the end to demonstrate the efficiency of the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=decentralized" title="decentralized">decentralized</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title=" optimal control"> optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=output" title=" output"> output</a>, <a href="https://publications.waset.org/abstracts/search?q=singular%20perturb" title=" singular perturb"> singular perturb</a> </p> <a href="https://publications.waset.org/abstracts/45093/stochastic-control-of-decentralized-singularly-perturbed-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45093.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">370</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">512</span> Gaussian Mixture Model Based Identification of Arterial Wall Movement for Computation of Distension Waveform</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ravindra%20B.%20Patil">Ravindra B. Patil</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Krishnamoorthy"> P. Krishnamoorthy</a>, <a href="https://publications.waset.org/abstracts/search?q=Shriram%20Sethuraman"> Shriram Sethuraman </a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work proposes a novel Gaussian Mixture Model (GMM) based approach for accurate tracking of the arterial wall and subsequent computation of the distension waveform using Radio Frequency (RF) ultrasound signal. The approach was evaluated on ultrasound RF data acquired using a prototype ultrasound system from an artery mimicking flow phantom. The effectiveness of the proposed algorithm is demonstrated by comparing with existing wall tracking algorithms. The experimental results show that the proposed method provides 20% reduction in the error margin compared to the existing approaches in tracking the arterial wall movement. This approach coupled with ultrasound system can be used to estimate the arterial compliance parameters required for screening of cardiovascular related disorders. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distension%20waveform" title="distension waveform">distension waveform</a>, <a href="https://publications.waset.org/abstracts/search?q=Gaussian%20Mixture%20Model" title=" Gaussian Mixture Model"> Gaussian Mixture Model</a>, <a href="https://publications.waset.org/abstracts/search?q=RF%20ultrasound" title=" RF ultrasound"> RF ultrasound</a>, <a href="https://publications.waset.org/abstracts/search?q=arterial%20wall%20movement" title=" arterial wall movement"> arterial wall movement</a> </p> <a href="https://publications.waset.org/abstracts/22974/gaussian-mixture-model-based-identification-of-arterial-wall-movement-for-computation-of-distension-waveform" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22974.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">506</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">511</span> Numerical Computation of Sturm-Liouville Problem with Robin Boundary Condition</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Theddeus%20T.%20Akano">Theddeus T. Akano</a>, <a href="https://publications.waset.org/abstracts/search?q=Omotayo%20A.%20Fakinlede"> Omotayo A. Fakinlede</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The modelling of physical phenomena, such as the earth’s free oscillations, the vibration of strings, the interaction of atomic particles, or the steady state flow in a bar give rise to Sturm-Liouville (SL) eigenvalue problems. The boundary applications of some systems like the convection-diffusion equation, electromagnetic and heat transfer problems requires the combination of Dirichlet and Neumann boundary conditions. Hence, the incorporation of Robin boundary condition in the analyses of Sturm-Liouville problem. This paper deals with the computation of the eigenvalues and eigenfunction of generalized Sturm-Liouville problems with Robin boundary condition using the finite element method. Numerical solutions of classical Sturm–Liouville problems are presented. The results show an agreement with the exact solution. High results precision is achieved with higher number of elements. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sturm-Liouville%20problem" title="Sturm-Liouville problem">Sturm-Liouville problem</a>, <a href="https://publications.waset.org/abstracts/search?q=Robin%20boundary%20condition" title=" Robin boundary condition"> Robin boundary condition</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20method" title=" finite element method"> finite element method</a>, <a href="https://publications.waset.org/abstracts/search?q=eigenvalue%20problems" title=" eigenvalue problems"> eigenvalue problems</a> </p> <a href="https://publications.waset.org/abstracts/37320/numerical-computation-of-sturm-liouville-problem-with-robin-boundary-condition" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37320.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">362</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">510</span> Efficient DNN Training on Heterogeneous Clusters with Pipeline Parallelism</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lizhi%20Ma">Lizhi Ma</a>, <a href="https://publications.waset.org/abstracts/search?q=Dan%20Liu"> Dan Liu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Pipeline parallelism has been widely used to accelerate distributed deep learning to alleviate GPU memory bottlenecks and to ensure that models can be trained and deployed smoothly under limited graphics memory conditions. However, in highly heterogeneous distributed clusters, traditional model partitioning methods are not able to achieve load balancing. The overlap of communication and computation is also a big challenge. In this paper, HePipe is proposed, an efficient pipeline parallel training method for highly heterogeneous clusters. According to the characteristics of the neural network model pipeline training task, oriented to the 2-level heterogeneous cluster computing topology, a training method based on the 2-level stage division of neural network modeling and partitioning is designed to improve the parallelism. Additionally, a multi-forward 1F1B scheduling strategy is designed to accelerate the training time of each stage by executing the computation units in advance to maximize the overlap between the forward propagation communication and backward propagation computation. Finally, a dynamic recomputation strategy based on task memory requirement prediction is proposed to improve the fitness ratio of task and memory, which improves the throughput of the cluster and solves the memory shortfall problem caused by memory differences in heterogeneous clusters. The empirical results show that HePipe improves the training speed by 1.6×−2.2× over the existing asynchronous pipeline baselines. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pipeline%20parallelism" title="pipeline parallelism">pipeline parallelism</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20cluster" title=" heterogeneous cluster"> heterogeneous cluster</a>, <a href="https://publications.waset.org/abstracts/search?q=model%20training" title=" model training"> model training</a>, <a href="https://publications.waset.org/abstracts/search?q=2-level%20stage%20partitioning" title=" 2-level stage partitioning"> 2-level stage partitioning</a> </p> <a href="https://publications.waset.org/abstracts/191050/efficient-dnn-training-on-heterogeneous-clusters-with-pipeline-parallelism" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/191050.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">18</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">509</span> Scheduling Algorithm Based on Load-Aware Queue Partitioning in Heterogeneous Multi-Core Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hong%20Kai">Hong Kai</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhong%20Jun%20Jie"> Zhong Jun Jie</a>, <a href="https://publications.waset.org/abstracts/search?q=Chen%20Lin%20Qi"> Chen Lin Qi</a>, <a href="https://publications.waset.org/abstracts/search?q=Wang%20Chen%20Guang"> Wang Chen Guang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are inefficient global scheduling parallelism and local scheduling parallelism prone to processor starvation in current scheduling algorithms. Regarding this issue, this paper proposed a load-aware queue partitioning scheduling strategy by first allocating the queues according to the number of processor cores, calculating the load factor to specify the load queue capacity, and it assigned the awaiting nodes to the appropriate perceptual queues through the precursor nodes and the communication computation overhead. At the same time, real-time computation of the load factor could effectively prevent the processor from being starved for a long time. Experimental comparison with two classical algorithms shows that there is a certain improvement in both performance metrics of scheduling length and task speedup ratio. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=load-aware" title="load-aware">load-aware</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling%20algorithm" title=" scheduling algorithm"> scheduling algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=perceptual%20queue" title=" perceptual queue"> perceptual queue</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20multi-core" title=" heterogeneous multi-core"> heterogeneous multi-core</a> </p> <a href="https://publications.waset.org/abstracts/162110/scheduling-algorithm-based-on-load-aware-queue-partitioning-in-heterogeneous-multi-core-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/162110.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">145</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">508</span> Core Number Optimization Based Scheduler to Order/Mapp Simulink Application</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Asma%20Rebaya">Asma Rebaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Imen%20Amari"> Imen Amari</a>, <a href="https://publications.waset.org/abstracts/search?q=Kaouther%20Gasmi"> Kaouther Gasmi</a>, <a href="https://publications.waset.org/abstracts/search?q=Salem%20Hasnaoui"> Salem Hasnaoui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Over these last years, the number of cores witnessed a spectacular increase in digital signal and general use processors. Concurrently, significant researches are done to get benefit from the high degree of parallelism. Indeed, these researches are focused to provide an efficient scheduling from hardware/software systems to multicores architecture. The scheduling process consists on statically choose one core to execute one task and to specify an execution order for the application tasks. In this paper, we describe an efficient scheduler that calculates the optimal number of cores required to schedule an application, gives a heuristic scheduling solution and evaluates its cost. Our proposal results are evaluated and compared with Preesm scheduler results and we prove that ours allows better scheduling in terms of latency, computation time and number of cores. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computation%20time" title="computation time">computation time</a>, <a href="https://publications.waset.org/abstracts/search?q=hardware%2Fsoftware%20system" title=" hardware/software system"> hardware/software system</a>, <a href="https://publications.waset.org/abstracts/search?q=latency" title=" latency"> latency</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title="optimization">optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-cores%20platform" title=" multi-cores platform"> multi-cores platform</a>, <a href="https://publications.waset.org/abstracts/search?q=scheduling" title=" scheduling"> scheduling</a> </p> <a href="https://publications.waset.org/abstracts/67853/core-number-optimization-based-scheduler-to-ordermapp-simulink-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/67853.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">283</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">507</span> Model and Algorithm for Dynamic Wireless Electric Vehicle Charging Network Design</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Trung%20Hieu%20Tran">Trung Hieu Tran</a>, <a href="https://publications.waset.org/abstracts/search?q=Jesse%20O%27Hanley"> Jesse O'Hanley</a>, <a href="https://publications.waset.org/abstracts/search?q=Russell%20Fowler"> Russell Fowler</a> </p> <p class="card-text"><strong>Abstract:</strong></p> When in-wheel wireless charging technology for electric vehicles becomes mature, a need for such integrated charging stations network development is essential. In this paper, we thus investigate the optimisation problem of in-wheel wireless electric vehicle charging network design. A mixed-integer linear programming model is formulated to solve into optimality the problem. In addition, a meta-heuristic algorithm is proposed for efficiently solving large-sized instances within a reasonable computation time. A parallel computing strategy is integrated into the algorithm to speed up its computation time. Experimental results carried out on the benchmark instances show that our model and algorithm can find the optimal solutions and their potential for practical applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electric%20vehicle" title="electric vehicle">electric vehicle</a>, <a href="https://publications.waset.org/abstracts/search?q=wireless%20charging%20station" title=" wireless charging station"> wireless charging station</a>, <a href="https://publications.waset.org/abstracts/search?q=mathematical%20programming" title=" mathematical programming"> mathematical programming</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic%20algorithm" title=" meta-heuristic algorithm"> meta-heuristic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20computing" title=" parallel computing"> parallel computing</a> </p> <a href="https://publications.waset.org/abstracts/159397/model-and-algorithm-for-dynamic-wireless-electric-vehicle-charging-network-design" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/159397.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">79</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">506</span> A Deterministic Large Deviation Model Based on Complex N-Body Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=David%20C.%20Ni">David C. Ni</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In the previous efforts, we constructed N-Body Systems by an extended Blaschke product (EBP), which represents a non-temporal and nonlinear extension of Lorentz transformation. In this construction, we rely only on two parameters, nonlinear degree, and relative momentum to characterize the systems. We further explored root computation via iteration with an algorithm extended from Jenkins-Traub method. The solution sets demonstrate a form of σ+ i [-t, t], where σ and t are the real numbers, and the [-t, t] shows various canonical distributions. In this paper, we correlate the convergent sets in the original domain with solution sets, which demonstrating large-deviation distributions in the codomain. We proceed to compare our approach with the formula or principles, such as Donsker-Varadhan and Wentzell-Freidlin theories. The deterministic model based on this construction allows us to explore applications in the areas of finance and statistical mechanics. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20Lorentz%20transformation" title="nonlinear Lorentz transformation">nonlinear Lorentz transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=Blaschke%20equation" title=" Blaschke equation"> Blaschke equation</a>, <a href="https://publications.waset.org/abstracts/search?q=iteration%20solutions" title=" iteration solutions"> iteration solutions</a>, <a href="https://publications.waset.org/abstracts/search?q=root%20computation" title=" root computation"> root computation</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20deviation%20distribution" title=" large deviation distribution"> large deviation distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=deterministic%20model" title=" deterministic model"> deterministic model</a> </p> <a href="https://publications.waset.org/abstracts/45844/a-deterministic-large-deviation-model-based-on-complex-n-body-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45844.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">393</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">505</span> Extracting Opinions from Big Data of Indonesian Customer Reviews Using Hadoop MapReduce</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Veronica%20S.%20Moertini">Veronica S. Moertini</a>, <a href="https://publications.waset.org/abstracts/search?q=Vinsensius%20Kevin"> Vinsensius Kevin</a>, <a href="https://publications.waset.org/abstracts/search?q=Gede%20Karya"> Gede Karya </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Customer reviews have been collected by many kinds of e-commerce websites selling products, services, hotel rooms, tickets and so on. Each website collects its own customer reviews. The reviews can be crawled, collected from those websites and stored as big data. Text analysis techniques can be used to analyze that data to produce summarized information, such as customer opinions. Then, these opinions can be published by independent service provider websites and used to help customers in choosing the most suitable products or services. As the opinions are analyzed from big data of reviews originated from many websites, it is expected that the results are more trusted and accurate. Indonesian customers write reviews in Indonesian language, which comes with its own structures and uniqueness. We found that most of the reviews are expressed with “daily language”, which is informal, do not follow the correct grammar, have many abbreviations and slangs or non-formal words. Hadoop is an emerging platform aimed for storing and analyzing big data in distributed systems. A Hadoop cluster consists of master and slave nodes/computers operated in a network. Hadoop comes with distributed file system (HDFS) and MapReduce framework for supporting parallel computation. However, MapReduce has weakness (i.e. inefficient) for iterative computations, specifically, the cost of reading/writing data (I/O cost) is high. Given this fact, we conclude that MapReduce function is best adapted for “one-pass” computation. In this research, we develop an efficient technique for extracting or mining opinions from big data of Indonesian reviews, which is based on MapReduce with one-pass computation. In designing the algorithm, we avoid iterative computation and instead adopt a “look up table” technique. The stages of the proposed technique are: (1) Crawling the data reviews from websites; (2) cleaning and finding root words from the raw reviews; (3) computing the frequency of the meaningful opinion words; (4) analyzing customers sentiments towards defined objects. The experiments for evaluating the performance of the technique were conducted on a Hadoop cluster with 14 slave nodes. The results show that the proposed technique (stage 2 to 4) discovers useful opinions, is capable of processing big data efficiently and scalable. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20data%20analysis" title="big data analysis">big data analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=Hadoop%20MapReduce" title=" Hadoop MapReduce"> Hadoop MapReduce</a>, <a href="https://publications.waset.org/abstracts/search?q=analyzing%20text%20data" title=" analyzing text data"> analyzing text data</a>, <a href="https://publications.waset.org/abstracts/search?q=mining%20Indonesian%20reviews" title=" mining Indonesian reviews"> mining Indonesian reviews</a> </p> <a href="https://publications.waset.org/abstracts/76663/extracting-opinions-from-big-data-of-indonesian-customer-reviews-using-hadoop-mapreduce" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76663.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">201</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">504</span> Cognitive Science Based Scheduling in Grid Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20D.%20Iswarya">N. D. Iswarya</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20A.%20Maluk%20Mohamed"> M. A. Maluk Mohamed</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Vijaya"> N. Vijaya</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Grid is infrastructure that allows the deployment of distributed data in large size from multiple locations to reach a common goal. Scheduling data intensive applications becomes challenging as the size of data sets are very huge in size. Only two solutions exist in order to tackle this challenging issue. First, computation which requires huge data sets to be processed can be transferred to the data site. Second, the required data sets can be transferred to the computation site. In the former scenario, the computation cannot be transferred since the servers are storage/data servers with little or no computational capability. Hence, the second scenario can be considered for further exploration. During scheduling, transferring huge data sets from one site to another site requires more network bandwidth. In order to mitigate this issue, this work focuses on incorporating cognitive science in scheduling. Cognitive Science is the study of human brain and its related activities. Current researches are mainly focused on to incorporate cognitive science in various computational modeling techniques. In this work, the problem solving approach of human brain is studied and incorporated during the data intensive scheduling in grid environments. Here, a cognitive engine is designed and deployed in various grid sites. The intelligent agents present in CE will help in analyzing the request and creating the knowledge base. Depending upon the link capacity, decision will be taken whether to transfer data sets or to partition the data sets. Prediction of next request is made by the agents to serve the requesting site with data sets in advance. This will reduce the data availability time and data transfer time. Replica catalog and Meta data catalog created by the agents assist in decision making process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20grid" title="data grid">data grid</a>, <a href="https://publications.waset.org/abstracts/search?q=grid%20workflow%20scheduling" title=" grid workflow scheduling"> grid workflow scheduling</a>, <a href="https://publications.waset.org/abstracts/search?q=cognitive%20artificial%20intelligence" title=" cognitive artificial intelligence"> cognitive artificial intelligence</a> </p> <a href="https://publications.waset.org/abstracts/10177/cognitive-science-based-scheduling-in-grid-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10177.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">394</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">503</span> FISCEAPP: FIsh Skin Color Evaluation APPlication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Urban">J. Urban</a>, <a href="https://publications.waset.org/abstracts/search?q=%C3%81.%20S.%20Botella"> Á. S. Botella</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20E.%20Robaina"> L. E. Robaina</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20B%C3%A1rta"> A. Bárta</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Sou%C4%8Dek"> P. Souček</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20C%C3%ADsa%C5%99"> P. Císař</a>, <a href="https://publications.waset.org/abstracts/search?q=%C5%A0.%20Pap%C3%A1%C4%8Dek"> Š. Papáček</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20M.%20Dom%C3%ADnguez"> L. M. Domínguez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Skin coloration in fish is of great physiological, behavioral and ecological importance and can be considered as an index of animal welfare in aquaculture as well as an important quality factor in the retail value. Currently, in order to compare color in animals fed on different diets, biochemical analysis, and colorimetry of fished, mildly anesthetized or dead body, are very accurate and meaningful measurements. The noninvasive method using digital images of the fish body was developed as a standalone application. This application deals with the computation burden and memory consumption of large input files, optimizing piece wise processing and analysis with the memory/computation time ratio. For the comparison of color distributions of various experiments and different color spaces (RGB, CIE L*a*b*) the comparable semi-equidistant binning of multi channels representation is introduced. It is derived from the knowledge of quantization levels and Freedman-Diaconis rule. The color calibrations and camera responsivity function were necessary part of the measurement process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=color%20distribution" title="color distribution">color distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=fish%20skin%20color" title=" fish skin color"> fish skin color</a>, <a href="https://publications.waset.org/abstracts/search?q=piecewise%20transformation" title=" piecewise transformation"> piecewise transformation</a>, <a href="https://publications.waset.org/abstracts/search?q=object%20to%20background%20segmentation" title=" object to background segmentation"> object to background segmentation</a> </p> <a href="https://publications.waset.org/abstracts/15406/fisceapp-fish-skin-color-evaluation-application" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15406.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">262</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">502</span> Electromagnetic Wave Propagation Equations in 2D by Finite Difference Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Fusun%20Oyman%20Serteller">N. Fusun Oyman Serteller</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the techniques to solve time dependent electromagnetic wave propagation equations based on the Finite Difference Method (FDM) are proposed by comparing the results with Finite Element Method (FEM) in 2D while discussing some special simulation examples.  Here, 2D dynamical wave equations for lossy media, even with a constant source, are discussed for establishing symbolic manipulation of wave propagation problems. The main objective of this contribution is to introduce a comparative study of two suitable numerical methods and to show that both methods can be applied effectively and efficiently to all types of wave propagation problems, both linear and nonlinear cases, by using symbolic computation. However, the results show that the FDM is more appropriate for solving the nonlinear cases in the symbolic solution. Furthermore, some specific complex domain examples of the comparison of electromagnetic waves equations are considered. Calculations are performed through Mathematica software by making some useful contribution to the programme and leveraging symbolic evaluations of FEM and FDM. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=finite%20difference%20method" title="finite difference method">finite difference method</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20method" title=" finite element method"> finite element method</a>, <a href="https://publications.waset.org/abstracts/search?q=linear-nonlinear%20PDEs" title=" linear-nonlinear PDEs"> linear-nonlinear PDEs</a>, <a href="https://publications.waset.org/abstracts/search?q=symbolic%20computation" title=" symbolic computation"> symbolic computation</a>, <a href="https://publications.waset.org/abstracts/search?q=wave%20propagation%20equations" title=" wave propagation equations"> wave propagation equations</a> </p> <a href="https://publications.waset.org/abstracts/107982/electromagnetic-wave-propagation-equations-in-2d-by-finite-difference-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/107982.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">147</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">501</span> Artificial Reproduction System and Imbalanced Dataset: A Mendelian Classification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anita%20Kushwaha">Anita Kushwaha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a new evolutionary computational model called Artificial Reproduction System which is based on the complex process of meiotic reproduction occurring between male and female cells of the living organisms. Artificial Reproduction System is an attempt towards a new computational intelligence approach inspired by the theoretical reproduction mechanism, observed reproduction functions, principles and mechanisms. A reproductive organism is programmed by genes and can be viewed as an automaton, mapping and reducing so as to create copies of those genes in its off springs. In Artificial Reproduction System, the binding mechanism between male and female cells is studied, parameters are chosen and a network is constructed also a feedback system for self regularization is established. The model then applies Mendel’s law of inheritance, allele-allele associations and can be used to perform data analysis of imbalanced data, multivariate, multiclass and big data. In the experimental study Artificial Reproduction System is compared with other state of the art classifiers like SVM, Radial Basis Function, neural networks, K-Nearest Neighbor for some benchmark datasets and comparison results indicates a good performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation" title="bio-inspired computation">bio-inspired computation</a>, <a href="https://publications.waset.org/abstracts/search?q=nature-%20inspired%20computation" title=" nature- inspired computation"> nature- inspired computation</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20computing" title=" natural computing"> natural computing</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a> </p> <a href="https://publications.waset.org/abstracts/54679/artificial-reproduction-system-and-imbalanced-dataset-a-mendelian-classification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54679.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">500</span> Towards a Distributed Computation Platform Tailored for Educational Process Discovery and Analysis</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Awatef%20Hicheur%20Cairns">Awatef Hicheur Cairns</a>, <a href="https://publications.waset.org/abstracts/search?q=Billel%20Gueni"> Billel Gueni</a>, <a href="https://publications.waset.org/abstracts/search?q=Hind%20Hafdi"> Hind Hafdi</a>, <a href="https://publications.waset.org/abstracts/search?q=Christian%20Joubert"> Christian Joubert</a>, <a href="https://publications.waset.org/abstracts/search?q=Nasser%20Khelifa"> Nasser Khelifa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Given the ever changing needs of the job markets, education and training centers are increasingly held accountable for student success. Therefore, education and training centers have to focus on ways to streamline their offers and educational processes in order to achieve the highest level of quality in curriculum contents and managerial decisions. Educational process mining is an emerging field in the educational data mining (EDM) discipline, concerned with developing methods to discover, analyze and provide a visual representation of complete educational processes. In this paper, we present our distributed computation platform which allows different education centers and institutions to load their data and access to advanced data mining and process mining services. To achieve this, we present also a comparative study of the different clustering techniques developed in the context of process mining to partition efficiently educational traces. Our goal is to find the best strategy for distributing heavy analysis computations on many processing nodes of our platform. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=educational%20process%20mining" title="educational process mining">educational process mining</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20process%20mining" title=" distributed process mining"> distributed process mining</a>, <a href="https://publications.waset.org/abstracts/search?q=clustering" title=" clustering"> clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20platform" title=" distributed platform"> distributed platform</a>, <a href="https://publications.waset.org/abstracts/search?q=educational%20data%20mining" title=" educational data mining"> educational data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=ProM" title=" ProM"> ProM</a> </p> <a href="https://publications.waset.org/abstracts/27675/towards-a-distributed-computation-platform-tailored-for-educational-process-discovery-and-analysis" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27675.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">454</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">499</span> Quantum Dots Incorporated in Biomembrane Models for Cancer Marker</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thiago%20E.%20Goto">Thiago E. Goto</a>, <a href="https://publications.waset.org/abstracts/search?q=Carla%20C.%20Lopes"> Carla C. Lopes</a>, <a href="https://publications.waset.org/abstracts/search?q=Helena%20B.%20Nader"> Helena B. Nader</a>, <a href="https://publications.waset.org/abstracts/search?q=Anielle%20C.%20A.%20Silva"> Anielle C. A. Silva</a>, <a href="https://publications.waset.org/abstracts/search?q=Noelio%20O.%20Dantas"> Noelio O. Dantas</a>, <a href="https://publications.waset.org/abstracts/search?q=Jos%C3%A9%20R.%20Siqueira%20Jr."> José R. Siqueira Jr.</a>, <a href="https://publications.waset.org/abstracts/search?q=Luciano%20Caseli"> Luciano Caseli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quantum dots (QD) are semiconductor nanocrystals that can be employed in biological research as a tool for fluorescence imagings, having the potential to expand in vivo and in vitro analysis as cancerous cell biomarkers. Particularly, cadmium selenide (CdSe) magic-sized quantum dots (MSQDs) exhibit stable luminescence that is feasible for biological applications, especially for imaging of tumor cells. For these facts, it is interesting to know the mechanisms of action of how such QDs mark biological cells. For that, simplified models are a suitable strategy. Among these models, Langmuir films of lipids formed at the air-water interface seem to be adequate since they can mimic half a membrane. They are monomolecular films formed at liquid-gas interfaces that can spontaneously form when organic solutions of amphiphilic compounds are spread on the liquid-gas interface. After solvent evaporation, the monomolecular film is formed, and a variety of techniques, including tensiometric, spectroscopic and optic can be applied. When the monolayer is formed by membrane lipids at the air-water interface, a model for half a membrane can be inferred where the aqueous subphase serve as a model for external or internal compartment of the cell. These films can be transferred to solid supports forming the so-called Langmuir-Blodgett (LB) films, and an ampler variety of techniques can be additionally used to characterize the film, allowing for the formation of devices and sensors. With these ideas in mind, the objective of this work was to investigate the specific interactions of CdSe MSQDs with tumorigenic and non-tumorigenic cells using Langmuir monolayers and LB films of lipids and specific cell extracts as membrane models for diagnosis of cancerous cells. Surface pressure-area isotherms and polarization modulation reflection-absorption spectroscopy (PM-IRRAS) showed an intrinsic interaction between the quantum dots, inserted in the aqueous subphase, and Langmuir monolayers, constructed either of selected lipids or of non-tumorigenic and tumorigenic cells extracts. The quantum dots expanded the monolayers and changed the PM-IRRAS spectra for the lipid monolayers. The mixed films were then compressed to high surface pressures and transferred from the floating monolayer to solid supports by using the LB technique. Images of the films were then obtained with atomic force microscopy (AFM) and confocal microscopy, which provided information about the morphology of the films. Similarities and differences between films with different composition representing cell membranes, with or without CdSe MSQDs, was analyzed. The results indicated that the interaction of quantum dots with the bioinspired films is modulated by the lipid composition. The properties of the normal cell monolayer were not significantly altered, whereas for the tumorigenic cell monolayer models, the films presented significant alteration. The images therefore exhibited a stronger effect of CdSe MSQDs on the models representing cancerous cells. As important implication of these findings, one may envisage for new bioinspired surfaces based on molecular recognition for biomedical applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=biomembrane" title="biomembrane">biomembrane</a>, <a href="https://publications.waset.org/abstracts/search?q=langmuir%20monolayers" title=" langmuir monolayers"> langmuir monolayers</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20dots" title=" quantum dots"> quantum dots</a>, <a href="https://publications.waset.org/abstracts/search?q=surfaces" title=" surfaces"> surfaces</a> </p> <a href="https://publications.waset.org/abstracts/55263/quantum-dots-incorporated-in-biomembrane-models-for-cancer-marker" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55263.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">196</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">498</span> An Application of Sinc Function to Approximate Quadrature Integrals in Generalized Linear Mixed Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Altaf%20H.%20Khan">Altaf H. Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Frank%20Stenger"> Frank Stenger</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20A.%20Hussein"> Mohammed A. Hussein</a>, <a href="https://publications.waset.org/abstracts/search?q=Reaz%20A.%20Chaudhuri"> Reaz A. Chaudhuri</a>, <a href="https://publications.waset.org/abstracts/search?q=Sameera%20Asif"> Sameera Asif</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper discusses a novel approach to approximate quadrature integrals that arise in the estimation of likelihood parameters for the generalized linear mixed models (GLMM) as well as Bayesian methodology also requires computation of multidimensional integrals with respect to the posterior distributions in which computation are not only tedious and cumbersome rather in some situations impossible to find solutions because of singularities, irregular domains, etc. An attempt has been made in this work to apply Sinc function based quadrature rules to approximate intractable integrals, as there are several advantages of using Sinc based methods, for example: order of convergence is exponential, works very well in the neighborhood of singularities, in general quite stable and provide high accurate and double precisions estimates. The Sinc function based approach seems to be utilized first time in statistical domain to our knowledge, and it's viability and future scopes have been discussed to apply in the estimation of parameters for GLMM models as well as some other statistical areas. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20linear%20mixed%20model" title="generalized linear mixed model">generalized linear mixed model</a>, <a href="https://publications.waset.org/abstracts/search?q=likelihood%20parameters" title=" likelihood parameters"> likelihood parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=qudarature" title=" qudarature"> qudarature</a>, <a href="https://publications.waset.org/abstracts/search?q=Sinc%20function" title=" Sinc function"> Sinc function</a> </p> <a href="https://publications.waset.org/abstracts/39637/an-application-of-sinc-function-to-approximate-quadrature-integrals-in-generalized-linear-mixed-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39637.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">395</span> </span> </div> </div> <ul class="pagination"> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&page=1" rel="prev">&lsaquo;</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&page=1">1</a></li> <li class="page-item active"><span class="page-link">2</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&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=bio-inspired%20computation&page=18">18</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&page=19">19</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=bio-inspired%20computation&page=3" 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>