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: iterative algorithm</title> <meta name="description" content="Search results for: iterative algorithm"> <meta name="keywords" content="iterative algorithm"> <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="iterative algorithm" 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="iterative algorithm"> <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> 3862</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: iterative algorithm</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3862</span> Approximating Fixed Points by a Two-Step Iterative Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safeer%20Hussain%20Khan">Safeer Hussain Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we introduce a two-step iterative algorithm to prove a strong convergence result for approximating common fixed points of three contractive-like operators. Our algorithm basically generalizes an existing algorithm..Our iterative algorithm also contains two famous iterative algorithms: Mann iterative algorithm and Ishikawa iterative algorithm. Thus our result generalizes the corresponding results proved for the above three iterative algorithms to a class of more general operators. At the end, we remark that nothing prevents us to extend our result to the case of the iterative algorithm with error terms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contractive-like%20operator" title="contractive-like operator">contractive-like operator</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm" title=" iterative algorithm"> iterative algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a> </p> <a href="https://publications.waset.org/abstracts/10341/approximating-fixed-points-by-a-two-step-iterative-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10341.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">550</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">3861</span> Implementation of Iterative Algorithm for Earthquake Location</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hussain%20K.%20Chaiel">Hussain K. Chaiel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The development in the field of the digital signal processing (DSP) and the microelectronics technology reduces the complexity of the iterative algorithms that need large number of arithmetic operations. Virtex-Field Programmable Gate Arrays (FPGAs) are programmable silicon foundations which offer an important solution for addressing the needs of high performance DSP designer. In this work, Virtex-7 FPGA technology is used to implement an iterative algorithm to estimate the earthquake location. Simulation results show that an implementation based on block RAMB36E1 and DSP48E1 slices of Virtex-7 type reduces the number of cycles of the clock frequency. This enables the algorithm to be used for earthquake prediction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DSP" title="DSP">DSP</a>, <a href="https://publications.waset.org/abstracts/search?q=earthquake" title=" earthquake"> earthquake</a>, <a href="https://publications.waset.org/abstracts/search?q=FPGA" title=" FPGA"> FPGA</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm" title=" iterative algorithm "> iterative algorithm </a> </p> <a href="https://publications.waset.org/abstracts/28897/implementation-of-iterative-algorithm-for-earthquake-location" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28897.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">389</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">3860</span> Description of the Non-Iterative Learning Algorithm of Artificial Neuron</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20S.%20Akhmetov">B. S. Akhmetov</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20T.%20Akhmetova"> S. T. Akhmetova</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20I.%20Ivanov"> A. I. Ivanov</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20S.%20Kartbayev"> T. S. Kartbayev</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Y.%20Malygin"> A. Y. Malygin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem of training of a network of artificial neurons in biometric appendices is that this process has to be completely automatic, i.e. the person operator should not participate in it. Therefore, this article discusses the issues of training the network of artificial neurons and the description of the non-iterative learning algorithm of artificial neuron. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=artificial%20neuron" title="artificial neuron">artificial neuron</a>, <a href="https://publications.waset.org/abstracts/search?q=biometrics" title=" biometrics"> biometrics</a>, <a href="https://publications.waset.org/abstracts/search?q=biometrical%20applications" title=" biometrical applications"> biometrical applications</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20of%20neuron" title=" learning of neuron"> learning of neuron</a>, <a href="https://publications.waset.org/abstracts/search?q=non-iterative%20algorithm" title=" non-iterative algorithm"> non-iterative algorithm</a> </p> <a href="https://publications.waset.org/abstracts/19446/description-of-the-non-iterative-learning-algorithm-of-artificial-neuron" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19446.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">494</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">3859</span> Investigation of the Stability of the F* Iterative Algorithm on Strong Peudocontractive Mappings and Its Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Felix%20Damilola%20Ajibade">Felix Damilola Ajibade</a>, <a href="https://publications.waset.org/abstracts/search?q=Opeyemi%20O.%20Enoch"> Opeyemi O. Enoch</a>, <a href="https://publications.waset.org/abstracts/search?q=Taiwo%20Paul%20Fajusigbe"> Taiwo Paul Fajusigbe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is centered on conducting an inquiry into the stability of the F* iterative algorithm to the fixed point of a strongly pseudo-contractive mapping in the framework of uniformly convex Banach spaces. To achieve the desired result, certain existing inequalities in convex Banach spaces were utilized, as well as the stability criteria of Harder and Hicks. Other necessary conditions for the stability of the F* algorithm on strong pseudo-contractive mapping were also obtained. Through a numerical approach, we prove that the F* iterative algorithm is H-stable for strongly pseudo-contractive mapping. Finally, the solution of the mixed-type Volterra-Fredholm functional non-linear integral equation is estimated using our results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=stability" title="stability">stability</a>, <a href="https://publications.waset.org/abstracts/search?q=F%2A%20-iterative%20algorithm" title=" F* -iterative algorithm"> F* -iterative algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=pseudo-contractive%20mappings" title=" pseudo-contractive mappings"> pseudo-contractive mappings</a>, <a href="https://publications.waset.org/abstracts/search?q=uniformly%20convex%20Banach%20space" title=" uniformly convex Banach space"> uniformly convex Banach space</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed-type%20Volterra-Fredholm%20integral%20equation" title=" mixed-type Volterra-Fredholm integral equation"> mixed-type Volterra-Fredholm integral equation</a> </p> <a href="https://publications.waset.org/abstracts/167503/investigation-of-the-stability-of-the-f-iterative-algorithm-on-strong-peudocontractive-mappings-and-its-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167503.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">103</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">3858</span> An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Y.%20Wang">Y. Wang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is <em>O</em>(<em>CN</em><sub>max</sub><em>n</em><sup>2</sup>) where <em>C</em> is the iterations, <em>N</em><sub>max</sub> is the maximum number of frequency quadrilaterals containing each edge and <em>n</em> is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5<em>n</em> edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frequency%20quadrilateral" title="frequency quadrilateral">frequency quadrilateral</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm" title=" iterative algorithm"> iterative algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=sparse%20graph" title=" sparse graph"> sparse graph</a>, <a href="https://publications.waset.org/abstracts/search?q=traveling%20salesman%20problem" title=" traveling salesman problem"> traveling salesman problem</a> </p> <a href="https://publications.waset.org/abstracts/82737/an-improved-method-to-compute-sparse-graphs-for-traveling-salesman-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82737.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">233</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">3857</span> Optimal Relaxation Parameters for Obtaining Efficient Iterative Methods for the Solution of Electromagnetic Scattering Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nadaniela%20Egidi">Nadaniela Egidi</a>, <a href="https://publications.waset.org/abstracts/search?q=Pierluigi%20Maponi"> Pierluigi Maponi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The approximate solution of a time-harmonic electromagnetic scattering problem for inhomogeneous media is required in several application contexts, and its two-dimensional formulation is a Fredholm integral equation of the second kind. This integral equation provides a formulation for the direct scattering problem, but it has to be solved several times also in the numerical solution of the corresponding inverse scattering problem. The discretization of this Fredholm equation produces large and dense linear systems that are usually solved by iterative methods. In order to improve the efficiency of these iterative methods, we use the Symmetric SOR preconditioning, and we propose an algorithm for the evaluation of the associated relaxation parameter. We show the efficiency of the proposed algorithm by several numerical experiments, where we use two Krylov subspace methods, i.e., Bi-CGSTAB and GMRES. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fredholm%20integral%20equation" title="Fredholm integral equation">Fredholm integral equation</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20method" title=" iterative method"> iterative method</a>, <a href="https://publications.waset.org/abstracts/search?q=preconditioning" title=" preconditioning"> preconditioning</a>, <a href="https://publications.waset.org/abstracts/search?q=scattering%20problem" title=" scattering problem"> scattering problem</a> </p> <a href="https://publications.waset.org/abstracts/142902/optimal-relaxation-parameters-for-obtaining-efficient-iterative-methods-for-the-solution-of-electromagnetic-scattering-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/142902.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">103</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">3856</span> New Iterative Algorithm for Improving Depth Resolution in Ionic Analysis: Effect of Iterations Number</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Dahraoui">N. Dahraoui</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Boulakroune"> M. Boulakroune</a>, <a href="https://publications.waset.org/abstracts/search?q=D.%20Benatia"> D. Benatia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the improvement by deconvolution of the depth resolution in Secondary Ion Mass Spectrometry (SIMS) analysis is considered. Indeed, we have developed a new Tikhonov-Miller deconvolution algorithm where a priori model of the solution is included. This is a denoisy and pre-deconvoluted signal obtained from: firstly, by the application of wavelet shrinkage algorithm, secondly by the introduction of the obtained denoisy signal in an iterative deconvolution algorithm. In particular, we have focused the light on the effect of the iterations number on the evolution of the deconvoluted signals. The SIMS profiles are multilayers of Boron in Silicon matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=DRF" title="DRF">DRF</a>, <a href="https://publications.waset.org/abstracts/search?q=in-depth%20resolution" title=" in-depth resolution"> in-depth resolution</a>, <a href="https://publications.waset.org/abstracts/search?q=multiresolution%20deconvolution" title=" multiresolution deconvolution"> multiresolution deconvolution</a>, <a href="https://publications.waset.org/abstracts/search?q=SIMS" title=" SIMS"> SIMS</a>, <a href="https://publications.waset.org/abstracts/search?q=wavelet%20shrinkage" title=" wavelet shrinkage"> wavelet shrinkage</a> </p> <a href="https://publications.waset.org/abstracts/22225/new-iterative-algorithm-for-improving-depth-resolution-in-ionic-analysis-effect-of-iterations-number" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/22225.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">3855</span> Iterative Solver for Solving Large-Scale Frictional Contact Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Thierno%20Diop">Thierno Diop</a>, <a href="https://publications.waset.org/abstracts/search?q=Michel%20Fortin"> Michel Fortin</a>, <a href="https://publications.waset.org/abstracts/search?q=Jean%20Deteix"> Jean Deteix</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since the precise formulation of the elastic part is irrelevant for the description of the algorithm, we shall consider a generic case. In practice, however, we will have to deal with a non linear material (for instance a Mooney-Rivlin model). We are interested in solving a finite element approximation of the problem, leading to large-scale non linear discrete problems and, after linearization, to large linear systems and ultimately to calculations needing iterative methods. This also implies that penalty method, and therefore augmented Lagrangian method, are to be banned because of their negative effect on the condition number of the underlying discrete systems and thus on the convergence of iterative methods. This is in rupture to the mainstream of methods for contact in which augmented Lagrangian is the principal tool. We shall first present the problem and its discretization; this will lead us to describe a general solution algorithm relying on a preconditioner for saddle-point problems which we shall describe in some detail as it is not entirely standard. We will propose an iterative approach for solving three-dimensional frictional contact problems between elastic bodies, including contact with a rigid body, contact between two or more bodies and also self-contact. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=frictional%20contact" title="frictional contact">frictional contact</a>, <a href="https://publications.waset.org/abstracts/search?q=three-dimensional" title=" three-dimensional"> three-dimensional</a>, <a href="https://publications.waset.org/abstracts/search?q=large-scale" title=" large-scale"> large-scale</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20method" title=" iterative method"> iterative method</a> </p> <a href="https://publications.waset.org/abstracts/90130/iterative-solver-for-solving-large-scale-frictional-contact-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/90130.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">210</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">3854</span> Fixed Points of Contractive-Like Operators by a Faster Iterative Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safeer%20Hussain%20Khan">Safeer Hussain Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we prove a strong convergence result using a recently introduced iterative process with contractive-like operators. This improves and generalizes corresponding results in the literature in two ways: the iterative process is faster, operators are more general. In the end, we indicate that the results can also be proved with the iterative process with error terms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contractive-like%20operator" title="contractive-like operator">contractive-like operator</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20process" title=" iterative process"> iterative process</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point" title=" fixed point"> fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a> </p> <a href="https://publications.waset.org/abstracts/3818/fixed-points-of-contractive-like-operators-by-a-faster-iterative-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3818.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">432</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">3853</span> A Three-Step Iterative Process for Common Fixed Points of Three Contractive-Like Operators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Safeer%20Hussain%20Khan">Safeer Hussain Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Fukhar-ud-Din"> H. Fukhar-ud-Din</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The concept of quasi-contractive type operators was given by Berinde and extended by Imoru and Olatinwo. They named this new type as contractive-like operators. On the other hand, Xu and Noo introduced a three-step-one-mappings iterative process which can be seen as a generalization of Mann and Ishikawa iterative processes. Approximating common fixed points has its own importance as it has a direct link with minimization problem. Motivated by this, in this paper, we first extend the iterative process of Xu and Noor to the case of three-step-three-mappings and then prove a strong convergence result using contractive-like operators for this iterative process. In general, this generalizes corresponding results using Mann, Ishikawa and Xu-Noor iterative processes with quasi-contractive type operators. It is to be pointed out that our results can also be proved with iterative process involving error terms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=contractive-like%20operator" title="contractive-like operator">contractive-like operator</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20process" title=" iterative process"> iterative process</a>, <a href="https://publications.waset.org/abstracts/search?q=common%20fixed%20point" title=" common fixed point"> common fixed point</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a> </p> <a href="https://publications.waset.org/abstracts/15892/a-three-step-iterative-process-for-common-fixed-points-of-three-contractive-like-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15892.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">594</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">3852</span> Proximal Method of Solving Split System of Minimization Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anteneh%20Getachew%20Gebrie">Anteneh Getachew Gebrie</a>, <a href="https://publications.waset.org/abstracts/search?q=Rabian%20Wangkeeree"> Rabian Wangkeeree</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this paper is to introduce iterative algorithm solving split system of minimization problem given as a task of ﬁnding a common minimizer point of ﬁnite family of proper, lower semicontinuous convex functions and whose image under a bounded linear operator is also common minimizer point of another ﬁnite family of proper, lower semicontinuous convex functions. We obtain strong convergence of the sequence generated by our algorithm under some suitable conditions on the parameters. The iterative schemes are developed with a way of selecting the step sizes such that the information of operator norm is not necessary. Some applications and numerical experiment is given to analyse the eﬃciency of our algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hilbert%20Space" title="Hilbert Space">Hilbert Space</a>, <a href="https://publications.waset.org/abstracts/search?q=minimization%20problems" title=" minimization problems"> minimization problems</a>, <a href="https://publications.waset.org/abstracts/search?q=Moreau-Yosida%20approximate" title=" Moreau-Yosida approximate"> Moreau-Yosida approximate</a>, <a href="https://publications.waset.org/abstracts/search?q=split%20feasibility%20problem" title=" split feasibility problem"> split feasibility problem</a> </p> <a href="https://publications.waset.org/abstracts/119147/proximal-method-of-solving-split-system-of-minimization-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/119147.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">144</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">3851</span> Efficient Iterative V-BLAST Detection Technique in Wireless Communication System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hwan-Jun%20Choi">Hwan-Jun Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Sung-Bok%20Choi"> Sung-Bok Choi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hyoung-Kyu%20Song"> Hyoung-Kyu Song</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, among the MIMO-OFDM detection techniques, a lot of papers suggested V-BLAST scheme which can achieve high data rate. Therefore, the signal detection of MIMOOFDM system is important issue. In this paper, efficient iterative VBLAST detection technique is proposed in wireless communication system. The proposed scheme adjusts the number of candidate symbol and iterative scheme based on channel state. According to the simulation result, the proposed scheme has better BER performance than conventional schemes and similar BER performance of the QRD-M with iterative scheme. Moreover complexity of proposed scheme has 50.6 % less than complexity of QRD-M detection with iterative scheme. Therefore the proposed detection scheme can be efficiently used in wireless communication. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=MIMO-OFDM" title="MIMO-OFDM">MIMO-OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=V-BLAST" title=" V-BLAST"> V-BLAST</a>, <a href="https://publications.waset.org/abstracts/search?q=QR-decomposition" title=" QR-decomposition"> QR-decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=QRDM" title=" QRDM"> QRDM</a>, <a href="https://publications.waset.org/abstracts/search?q=DFE" title=" DFE"> DFE</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20scheme" title=" iterative scheme"> iterative scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20condition" title=" channel condition"> channel condition</a> </p> <a href="https://publications.waset.org/abstracts/3522/efficient-iterative-v-blast-detection-technique-in-wireless-communication-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/3522.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">530</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">3850</span> Kinoform Optimisation Using Gerchberg- Saxton Iterative Algorithm </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Al-Shamery">M. Al-Shamery</a>, <a href="https://publications.waset.org/abstracts/search?q=R.%20Young"> R. Young</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20Birch"> P. Birch</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Chatwin"> C. Chatwin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Computer Generated Holography (CGH) is employed to create digitally defined coherent wavefronts. A CGH can be created by using different techniques such as by using a detour-phase technique or by direct phase modulation to create a kinoform. The detour-phase technique was one of the first techniques that was used to generate holograms digitally. The disadvantage of this technique is that the reconstructed image often has poor quality due to the limited dynamic range it is possible to record using a medium with reasonable spatial resolution.. The kinoform (phase-only hologram) is an alternative technique. In this method, the phase of the original wavefront is recorded but the amplitude is constrained to be constant. The original object does not need to exist physically and so the kinoform can be used to reconstruct an almost arbitrary wavefront. However, the image reconstructed by this technique contains high levels of noise and is not identical to the reference image. To improve the reconstruction quality of the kinoform, iterative techniques such as the Gerchberg-Saxton algorithm (GS) are employed. In this paper the GS algorithm is described for the optimisation of a kinoform used for the reconstruction of a complex wavefront. Iterations of the GS algorithm are applied to determine the phase at a plane (with known amplitude distribution which is often taken as uniform), that satisfies given phase and amplitude constraints in a corresponding Fourier plane. The GS algorithm can be used in this way to enhance the reconstruction quality of the kinoform. Different images are employed as the reference object and their kinoform is synthesised using the GS algorithm. The quality of the reconstructed images is quantified to demonstrate the enhanced reconstruction quality achieved by using this method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer%20generated%20holography" title="computer generated holography">computer generated holography</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20holography" title=" digital holography"> digital holography</a>, <a href="https://publications.waset.org/abstracts/search?q=Gerchberg-Saxton%20algorithm" title=" Gerchberg-Saxton algorithm"> Gerchberg-Saxton algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=kinoform" title=" kinoform"> kinoform</a> </p> <a href="https://publications.waset.org/abstracts/35707/kinoform-optimisation-using-gerchberg-saxton-iterative-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35707.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">533</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">3849</span> Efficient Model Order Reduction of Descriptor Systems Using Iterative Rational Krylov Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Anwar">Muhammad Anwar</a>, <a href="https://publications.waset.org/abstracts/search?q=Ameen%20Ullah"> Ameen Ullah</a>, <a href="https://publications.waset.org/abstracts/search?q=Intakhab%20Alam%20Qadri"> Intakhab Alam Qadri</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study presents a technique utilizing the Iterative Rational Krylov Algorithm (IRKA) to reduce the order of large-scale descriptor systems. Descriptor systems, which incorporate differential and algebraic components, pose unique challenges in Model Order Reduction (MOR). The proposed method partitions the descriptor system into polynomial and strictly proper parts to minimize approximation errors, applying IRKA exclusively to the strictly adequate component. This approach circumvents the unbounded errors that arise when IRKA is directly applied to the entire system. A comparative analysis demonstrates the high accuracy of the reduced model and a significant reduction in computational burden. The reduced model enables more efficient simulations and streamlined controller designs. The study highlights IRKA-based MOR’s effectiveness in optimizing complex systems’ performance across various engineering applications. The proposed methodology offers a promising solution for reducing the complexity of large-scale descriptor systems while maintaining their essential characteristics and facilitating their analysis, simulation, and control design. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=model%20order%20reduction" title="model order reduction">model order reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=descriptor%20systems" title=" descriptor systems"> descriptor systems</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20rational%20Krylov%20algorithm" title=" iterative rational Krylov algorithm"> iterative rational Krylov algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=interpolatory%20model%20reduction" title=" interpolatory model reduction"> interpolatory model reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20efficiency" title=" computational efficiency"> computational efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=projection%20methods" title=" projection methods"> projection methods</a>, <a href="https://publications.waset.org/abstracts/search?q=H%E2%82%82-optimal%20model%20reduction" title=" H₂-optimal model reduction"> H₂-optimal model reduction</a> </p> <a href="https://publications.waset.org/abstracts/189198/efficient-model-order-reduction-of-descriptor-systems-using-iterative-rational-krylov-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/189198.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">31</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">3848</span> On the Algorithmic Iterative Solutions of Conjugate Gradient, Gauss-Seidel and Jacobi Methods for Solving Systems of Linear Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hussaini%20Doko%20Ibrahim">Hussaini Doko Ibrahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Hamilton%20Cyprian%20Chinwenyi"> Hamilton Cyprian Chinwenyi</a>, <a href="https://publications.waset.org/abstracts/search?q=Henrietta%20Nkem%20Ude"> Henrietta Nkem Ude</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, efforts were made to examine and compare the algorithmic iterative solutions of the conjugate gradient method as against other methods such as Gauss-Seidel and Jacobi approaches for solving systems of linear equations of the form Ax=b, where A is a real n×n symmetric and positive definite matrix. We performed algorithmic iterative steps and obtained analytical solutions of a typical 3×3 symmetric and positive definite matrix using the three methods described in this paper (Gauss-Seidel, Jacobi, and conjugate gradient methods), respectively. From the results obtained, we discovered that the conjugate gradient method converges faster to exact solutions in fewer iterative steps than the two other methods, which took many iterations, much time, and kept tending to the exact solutions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient" title="conjugate gradient">conjugate gradient</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20equations" title=" linear equations"> linear equations</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20and%20positive%20definite%20matrix" title=" symmetric and positive definite matrix"> symmetric and positive definite matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=gauss-seidel" title=" gauss-seidel"> gauss-seidel</a>, <a href="https://publications.waset.org/abstracts/search?q=Jacobi" title=" Jacobi"> Jacobi</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithm" title=" algorithm"> algorithm</a> </p> <a href="https://publications.waset.org/abstracts/138341/on-the-algorithmic-iterative-solutions-of-conjugate-gradient-gauss-seidel-and-jacobi-methods-for-solving-systems-of-linear-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138341.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">149</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">3847</span> Analysis of the Inverse Kinematics for 5 DOF Robot Arm Using D-H Parameters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Apurva%20Patil">Apurva Patil</a>, <a href="https://publications.waset.org/abstracts/search?q=Maithilee%20Kulkarni"> Maithilee Kulkarni</a>, <a href="https://publications.waset.org/abstracts/search?q=Ashay%20Aswale"> Ashay Aswale</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes an algorithm to develop the kinematic model of a 5 DOF robot arm. The formulation of the problem is based on finding the D-H parameters of the arm. Brute Force iterative method is employed to solve the system of non linear equations. The focus of the paper is to obtain the accurate solutions by reducing the root mean square error. The result obtained will be implemented to grip the objects. The trajectories followed by the end effector for the required workspace coordinates are plotted. The methodology used here can be used in solving the problem for any other kinematic chain of up to six DOF. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=5%20DOF%20robot%20arm" title="5 DOF robot arm">5 DOF robot arm</a>, <a href="https://publications.waset.org/abstracts/search?q=D-H%20parameters" title=" D-H parameters"> D-H parameters</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20kinematics" title=" inverse kinematics"> inverse kinematics</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20method" title=" iterative method"> iterative method</a>, <a href="https://publications.waset.org/abstracts/search?q=trajectories" title=" trajectories"> trajectories</a> </p> <a href="https://publications.waset.org/abstracts/70099/analysis-of-the-inverse-kinematics-for-5-dof-robot-arm-using-d-h-parameters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70099.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">3846</span> Penguins Search Optimization Algorithm for Chaotic Synchronization System</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sofiane%20Bououden">Sofiane Bououden</a>, <a href="https://publications.waset.org/abstracts/search?q=Ilyes%20Boulkaibet"> Ilyes Boulkaibet</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In terms of security of the information signal, the meta-heuristic Penguins Search Optimization Algorithm (PeSOA) is applied to synchronize chaotic encryption communications in the case of sensitive dependence on initial conditions in chaotic generator oscillator. The objective of this paper is the use of the PeSOA algorithm to exploring search space with random and iterative processes for synchronization of symmetric keys in both transmission and reception. Simulation results show the effectiveness of the PeSOA algorithm in generating symmetric keys of the encryption process and synchronizing. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic" title="meta-heuristic">meta-heuristic</a>, <a href="https://publications.waset.org/abstracts/search?q=PeSOA" title=" PeSOA"> PeSOA</a>, <a href="https://publications.waset.org/abstracts/search?q=chaotic%20systems" title=" chaotic systems"> chaotic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=encryption" title=" encryption"> encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=synchronization%20optimization" title=" synchronization optimization"> synchronization optimization</a> </p> <a href="https://publications.waset.org/abstracts/141318/penguins-search-optimization-algorithm-for-chaotic-synchronization-system" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/141318.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">195</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">3845</span> Hardware for Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Fariborz%20Ahmadi">Fariborz Ahmadi</a>, <a href="https://publications.waset.org/abstracts/search?q=Reza%20Tati"> Reza Tati</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Genetic algorithm is a soft computing method that works on set of solutions. These solutions are called chromosome and the best one is the absolute solution of the problem. The main problem of this algorithm is that after passing through some generations, it may be produced some chromosomes that had been produced in some generations ago that causes reducing the convergence speed. From another respective, most of the genetic algorithms are implemented in software and less works have been done on hardware implementation. Our work implements genetic algorithm in hardware that doesn’t produce chromosome that have been produced in previous generations. In this work, most of genetic operators are implemented without producing iterative chromosomes and genetic diversity is preserved. Genetic diversity causes that not only do not this algorithm converge to local optimum but also reaching to global optimum. Without any doubts, proposed approach is so faster than software implementations. Evaluation results also show the proposed approach is faster than hardware ones. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=hardware" title="hardware">hardware</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=computer%20science" title=" computer science"> computer science</a>, <a href="https://publications.waset.org/abstracts/search?q=engineering" title=" engineering"> engineering</a> </p> <a href="https://publications.waset.org/abstracts/5598/hardware-for-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/5598.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">3844</span> An Iterative Family for Solution of System of Nonlinear Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sonia%20Sonia">Sonia Sonia</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a family of iterative scheme for solving nonlinear systems of equations which have wide application in sciences and engineering. The proposed iterative family is based upon some parameters which generates many different iterative schemes. This family is completely derivative free and uses first of divided difference operator. Moreover some numerical experiments are performed and compared with existing methods. Analysis of convergence shows that the presented family has fourth-order of convergence. The dynamical behaviour of proposed family and local convergence have also been discussed. The numerical performance and convergence region comparison demonstrates that proposed family is efficient. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=convergence" title="convergence">convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=divided%20difference%20operator" title=" divided difference operator"> divided difference operator</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20system" title=" nonlinear system"> nonlinear system</a>, <a href="https://publications.waset.org/abstracts/search?q=Newton%27s%20method" title=" Newton's method"> Newton's method</a> </p> <a href="https://publications.waset.org/abstracts/80719/an-iterative-family-for-solution-of-system-of-nonlinear-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/80719.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">234</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">3843</span> Parallel Multisplitting Methods for DAE’s</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Machmoum">Ahmed Machmoum</a>, <a href="https://publications.waset.org/abstracts/search?q=Malika%20El%20Kyal"> Malika El Kyal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider iterative parallel multi-splitting method for differential algebraic equations. The main feature of the proposed idea is to use the asynchronous form. We prove that the multi-splitting technique can effectively accelerate the convergent performance of the iterative process. The main characteristic of an asynchronous mode is that the local algorithm not have to wait at predetermined messages to become available. We allow some processors to communicate more frequently than others, and we allow the communication delays tobe substantial and unpredictable. Note that synchronous algorithms in the computer science sense are particular cases of our formulation of asynchronous one. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer" title="computer">computer</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-splitting%20methods" title=" multi-splitting methods"> multi-splitting methods</a>, <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20mode" title=" asynchronous mode"> asynchronous mode</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%20algebraic%20systems" title=" differential algebraic systems "> differential algebraic systems </a> </p> <a href="https://publications.waset.org/abstracts/23813/parallel-multisplitting-methods-for-daes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23813.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">549</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">3842</span> Common Fixed Point Results and Stability of a Modified Jungck Iterative Scheme</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hudson%20Akewe">Hudson Akewe</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we introduce a modified Jungck (Dual Jungck) iterative scheme and use the scheme to approximate the unique common fixed point of a pair of generalized contractive-like operators in a Banach space. The iterative scheme is also shown to be stable with respect to the maps (S,T). An example is taken to justify the convergence of the scheme. Our result is a generalization and improvement of several results in the literature on single map T. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=generalized%20contractive-like%20operators" title="generalized contractive-like operators">generalized contractive-like operators</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20Jungck%20iterative%20scheme" title=" modified Jungck iterative scheme"> modified Jungck iterative scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=stability%20results" title=" stability results"> stability results</a>, <a href="https://publications.waset.org/abstracts/search?q=weakly%20compatible%20maps" title=" weakly compatible maps"> weakly compatible maps</a>, <a href="https://publications.waset.org/abstracts/search?q=unique%20common%20fixed%20point" title=" unique common fixed point"> unique common fixed point</a> </p> <a href="https://publications.waset.org/abstracts/68459/common-fixed-point-results-and-stability-of-a-modified-jungck-iterative-scheme" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68459.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">348</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">3841</span> Parallel Asynchronous Multi-Splitting Methods for Differential Algebraic Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malika%20Elkyal">Malika Elkyal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider an iterative parallel multi-splitting method for differential algebraic equations. The main feature of the proposed idea is to use the asynchronous form. We prove that the multi-splitting technique can effectively accelerate the convergent performance of the iterative process. The main characteristic of an asynchronous mode is that the local algorithm does not have to wait at predetermined messages to become available. We allow some processors to communicate more frequently than others, and we allow the communication delays to be substantial and unpredictable. Accordingly, we note that synchronous algorithms in the computer science sense are particular cases of our formulation of asynchronous one. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20methods" title="parallel methods">parallel methods</a>, <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20mode" title=" asynchronous mode"> asynchronous mode</a>, <a href="https://publications.waset.org/abstracts/search?q=multisplitting" title=" multisplitting"> multisplitting</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%20algebraic%20equations" title=" differential algebraic equations"> differential algebraic equations</a> </p> <a href="https://publications.waset.org/abstracts/20673/parallel-asynchronous-multi-splitting-methods-for-differential-algebraic-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20673.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">558</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3840</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">417</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">3839</span> Orthogonal Regression for Nonparametric Estimation of Errors-In-Variables Models</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anastasiia%20Yu.%20Timofeeva">Anastasiia Yu. Timofeeva</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Two new algorithms for nonparametric estimation of errors-in-variables models are proposed. The first algorithm is based on penalized regression spline. The spline is represented as a piecewise-linear function and for each linear portion orthogonal regression is estimated. This algorithm is iterative. The second algorithm involves locally weighted regression estimation. When the independent variable is measured with error such estimation is a complex nonlinear optimization problem. The simulation results have shown the advantage of the second algorithm under the assumption that true smoothing parameters values are known. Nevertheless the use of some indexes of fit to smoothing parameters selection gives the similar results and has an oversmoothing effect. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=grade%20point%20average" title="grade point average">grade point average</a>, <a href="https://publications.waset.org/abstracts/search?q=orthogonal%20regression" title=" orthogonal regression"> orthogonal regression</a>, <a href="https://publications.waset.org/abstracts/search?q=penalized%20regression%20spline" title=" penalized regression spline"> penalized regression spline</a>, <a href="https://publications.waset.org/abstracts/search?q=locally%20weighted%20regression" title=" locally weighted regression"> locally weighted regression</a> </p> <a href="https://publications.waset.org/abstracts/11927/orthogonal-regression-for-nonparametric-estimation-of-errors-in-variables-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11927.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">416</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">3838</span> Indexing and Incremental Approach Using Map Reduce Bipartite Graph (MRBG) for Mining Evolving Big Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adarsh%20Shroff">Adarsh Shroff</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Big data is a collection of dataset so large and complex that it becomes difficult to process using data base management tools. To perform operations like search, analysis, visualization on big data by using data mining; which is the process of extraction of patterns or knowledge from large data set. In recent years, the data mining applications become stale and obsolete over time. Incremental processing is a promising approach to refreshing mining results. It utilizes previously saved states to avoid the expense of re-computation from scratch. This project uses i2MapReduce, an incremental processing extension to Map Reduce, the most widely used framework for mining big data. I2MapReduce performs key-value pair level incremental processing rather than task level re-computation, supports not only one-step computation but also more sophisticated iterative computation, which is widely used in data mining applications, and incorporates a set of novel techniques to reduce I/O overhead for accessing preserved fine-grain computation states. To optimize the mining results, evaluate i2MapReduce using a one-step algorithm and three iterative algorithms with diverse computation characteristics for efficient mining. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=big%20data" title="big data">big data</a>, <a href="https://publications.waset.org/abstracts/search?q=map%20reduce" title=" map reduce"> map reduce</a>, <a href="https://publications.waset.org/abstracts/search?q=incremental%20processing" title=" incremental processing"> incremental processing</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20computation" title=" iterative computation"> iterative computation</a> </p> <a href="https://publications.waset.org/abstracts/46413/indexing-and-incremental-approach-using-map-reduce-bipartite-graph-mrbg-for-mining-evolving-big-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/46413.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">350</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">3837</span> A Study on the Iterative Scheme for Stratified Shields Gamma Ray Buildup Factor Using Layer-Splitting Technique in Double-Layer Shield</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sari%20F.%20Alkhatib">Sari F. Alkhatib</a>, <a href="https://publications.waset.org/abstracts/search?q=Chang%20Je%20Park"> Chang Je Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Gyuhong%20Roh"> Gyuhong Roh</a>, <a href="https://publications.waset.org/abstracts/search?q=Daeseong%20Jo"> Daeseong Jo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The iterative scheme which is used to treat buildup factors for stratified shields of three-layers or more is being investigated here using the layer-splitting technique. The second layer in a double-layer shield was split into two equivalent layers and the scheme was implemented on the new 'three-layer' shield configuration. The results of such manipulation for water-lead and water-iron shields combinations are presented here for 1 MeV photons. It was found that splitting the second layer introduces some deviation on the overall buildup factor. This expected deviation appeared to be higher in the case of low Z layer followed by high Z. However, the iterative scheme showed a great consistency and strong coherence with the introduced changes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=build-up%20factor" title="build-up factor">build-up factor</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20scheme" title=" iterative scheme"> iterative scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=stratified%20shields" title=" stratified shields"> stratified shields</a>, <a href="https://publications.waset.org/abstracts/search?q=radiation%20protection" title=" radiation protection"> radiation protection</a> </p> <a href="https://publications.waset.org/abstracts/8373/a-study-on-the-iterative-scheme-for-stratified-shields-gamma-ray-buildup-factor-using-layer-splitting-technique-in-double-layer-shield" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8373.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">576</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">3836</span> Strong Convergence of an Iterative Sequence in Real Banach Spaces with Kadec Klee Property</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Umar%20Yusuf%20Batsari">Umar Yusuf Batsari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Let E be a uniformly smooth and uniformly convex real Banach space and C be a nonempty, closed and convex subset of E. Let $V= \{S_i : C\to C, ~i=1, 2, 3\cdots N\}$ be a convex set of relatively nonexpansive mappings containing identity. In this paper, an iterative sequence obtained from CQ algorithm was shown to have strongly converge to a point $\hat{x}$ which is a common fixed point of relatively nonexpansive mappings in V and also solve the system of equilibrium problems in E. The result improve some existing results in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=relatively%20nonexpansive%20mappings" title="relatively nonexpansive mappings">relatively nonexpansive mappings</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20convergence" title=" strong convergence"> strong convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=equilibrium%20problems" title=" equilibrium problems"> equilibrium problems</a>, <a href="https://publications.waset.org/abstracts/search?q=uniformly%20smooth%20space" title=" uniformly smooth space"> uniformly smooth space</a>, <a href="https://publications.waset.org/abstracts/search?q=uniformly%20convex%20space" title=" uniformly convex space"> uniformly convex space</a>, <a href="https://publications.waset.org/abstracts/search?q=convex%20set" title=" convex set"> convex set</a>, <a href="https://publications.waset.org/abstracts/search?q=kadec%20klee%20property" title=" kadec klee property"> kadec klee property</a> </p> <a href="https://publications.waset.org/abstracts/21142/strong-convergence-of-an-iterative-sequence-in-real-banach-spaces-with-kadec-klee-property" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21142.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">422</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">3835</span> Hybridized Approach for Distance Estimation Using K-Means Clustering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ritu%20Vashistha">Ritu Vashistha</a>, <a href="https://publications.waset.org/abstracts/search?q=Jitender%20Kumar"> Jitender Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Clustering using the K-means algorithm is a very common way to understand and analyze the obtained output data. When a similar object is grouped, this is called the basis of Clustering. There is K number of objects and C number of cluster in to single cluster in which k is always supposed to be less than C having each cluster to be its own centroid but the major problem is how is identify the cluster is correct based on the data. Formulation of the cluster is not a regular task for every tuple of row record or entity but it is done by an iterative process. Each and every record, tuple, entity is checked and examined and similarity dissimilarity is examined. So this iterative process seems to be very lengthy and unable to give optimal output for the cluster and time taken to find the cluster. To overcome the drawback challenge, we are proposing a formula to find the clusters at the run time, so this approach can give us optimal results. The proposed approach uses the Euclidian distance formula as well melanosis to find the minimum distance between slots as technically we called clusters and the same approach we have also applied to Ant Colony Optimization(ACO) algorithm, which results in the production of two and multi-dimensional matrix. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ant%20colony%20optimization" title="ant colony optimization">ant colony optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20clustering" title=" data clustering"> data clustering</a>, <a href="https://publications.waset.org/abstracts/search?q=centroids" title=" centroids"> centroids</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20mining" title=" data mining"> data mining</a>, <a href="https://publications.waset.org/abstracts/search?q=k-means" title=" k-means"> k-means</a> </p> <a href="https://publications.waset.org/abstracts/147011/hybridized-approach-for-distance-estimation-using-k-means-clustering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/147011.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">3834</span> A Study on the Iterative Scheme for Stratified Shields Gamma Ray Buildup Factors Using Layer-Splitting Technique in Double-Layer Shields</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sari%20F.%20Alkhatib">Sari F. Alkhatib</a>, <a href="https://publications.waset.org/abstracts/search?q=Chang%20Je%20Park"> Chang Je Park</a>, <a href="https://publications.waset.org/abstracts/search?q=Gyuhong%20Roh"> Gyuhong Roh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The iterative scheme which is used to treat buildup factors for stratified shields is being investigated here using the layer-splitting technique. A simple suggested formalism for the scheme based on the Kalos’ formula is introduced, based on which the implementation of the testing technique is carried out. The second layer in a double-layer shield was split into two equivalent layers and the scheme (with the suggested formalism) was implemented on the new “three-layer” shield configuration. The results of such manipulation on water-lead and water-iron shields combinations are presented here for 1 MeV photons. It was found that splitting the second layer introduces some deviation on the overall buildup factor value. This expected deviation appeared to be higher in the case of low Z layer followed by high Z. However, the overall performance of the iterative scheme showed a great consistency and strong coherence even with the introduced changes. The introduced layer-splitting testing technique shows the capability to be implemented in test the iterative scheme with a wide range of formalisms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=buildup%20factor" title="buildup factor">buildup factor</a>, <a href="https://publications.waset.org/abstracts/search?q=iterative%20scheme" title=" iterative scheme"> iterative scheme</a>, <a href="https://publications.waset.org/abstracts/search?q=stratified%20shields" title=" stratified shields"> stratified shields</a>, <a href="https://publications.waset.org/abstracts/search?q=layer-splitting%20tecnique" title=" layer-splitting tecnique"> layer-splitting tecnique</a> </p> <a href="https://publications.waset.org/abstracts/8371/a-study-on-the-iterative-scheme-for-stratified-shields-gamma-ray-buildup-factors-using-layer-splitting-technique-in-double-layer-shields" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8371.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">416</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">3833</span> Sperm Flagellum Center-Line Tracing in 4D Stacks Using an Iterative Minimal Path Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Paul%20Hernandez-Herrera">Paul Hernandez-Herrera</a>, <a href="https://publications.waset.org/abstracts/search?q=Fernando%20Montoya"> Fernando Montoya</a>, <a href="https://publications.waset.org/abstracts/search?q=Juan%20Manuel%20Rendon"> Juan Manuel Rendon</a>, <a href="https://publications.waset.org/abstracts/search?q=Alberto%20Darszon"> Alberto Darszon</a>, <a href="https://publications.waset.org/abstracts/search?q=Gabriel%20Corkidi"> Gabriel Corkidi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Intracellular calcium ([Ca2+]i) regulates sperm motility. The analysis of [Ca2+]i has been traditionally achieved in two dimensions while the real movement of the cell takes place in three spatial dimensions. Due to optical limitations (high speed cell movement and low light emission) important data concerning the three dimensional movement of these flagellated cells had been neglected. Visualizing [Ca2+]i in 3D is not a simple matter since it requires complex fluorescence microscopy techniques where the resulting images have very low intensity and consequently low SNR (Signal to Noise Ratio). In 4D sequences, this problem is magnified since the flagellum oscillates (for human sperm) at least at an average frequency of 15 Hz. In this paper, a novel approach to extract the flagellum’s center-line in 4D stacks is presented. For this purpose, an iterative algorithm based on the fast-marching method is proposed to extract the flagellum’s center-line. Quantitative and qualitative results are presented in a 4D stack to demonstrate the ability of the proposed algorithm to trace the flagellum’s center-line. The method reached a precision and recall of 0.96 as compared with a semi-manual method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flagellum" title="flagellum">flagellum</a>, <a href="https://publications.waset.org/abstracts/search?q=minimal%20path" title=" minimal path"> minimal path</a>, <a href="https://publications.waset.org/abstracts/search?q=segmentation" title=" segmentation"> segmentation</a>, <a href="https://publications.waset.org/abstracts/search?q=sperm" title=" sperm"> sperm</a> </p> <a href="https://publications.waset.org/abstracts/55433/sperm-flagellum-center-line-tracing-in-4d-stacks-using-an-iterative-minimal-path-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55433.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">283</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm&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=iterative%20algorithm&page=128">128</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm&page=129">129</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=iterative%20algorithm&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>