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: continuous slowing down approximation</title> <meta name="description" content="Search results for: continuous slowing down approximation"> <meta name="keywords" content="continuous slowing down approximation"> <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="continuous slowing down approximation" 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="continuous slowing down approximation"> <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> 2801</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: continuous slowing down approximation</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2801</span> Bivariate Generalization of q-α-Bernstein Polynomials</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tarul%20Garg">Tarul Garg</a>, <a href="https://publications.waset.org/abstracts/search?q=P.%20N.%20Agrawal"> P. N. Agrawal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose to define the q-analogue of the α-Bernstein Kantorovich operators and then introduce the q-bivariate generalization of these operators to study the approximation of functions of two variables. We obtain the rate of convergence of these bivariate operators by means of the total modulus of continuity, partial modulus of continuity and the Peetre’s K-functional for continuous functions. Further, in order to study the approximation of functions of two variables in a space bigger than the space of continuous functions, i.e. Bögel space; the GBS (Generalized Boolean Sum) of the q-bivariate operators is considered and degree of approximation is discussed for the Bögel continuous and Bögel differentiable functions with the aid of the Lipschitz class and the mixed modulus of smoothness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=B%C3%B6gel%20continuous" title="Bögel continuous">Bögel continuous</a>, <a href="https://publications.waset.org/abstracts/search?q=B%C3%B6gel%20differentiable" title=" Bögel differentiable"> Bögel differentiable</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20Boolean%20sum" title=" generalized Boolean sum"> generalized Boolean sum</a>, <a href="https://publications.waset.org/abstracts/search?q=K-functional" title=" K-functional"> K-functional</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20modulus%20of%20smoothness" title=" mixed modulus of smoothness"> mixed modulus of smoothness</a> </p> <a href="https://publications.waset.org/abstracts/79181/bivariate-generalization-of-q-a-bernstein-polynomials" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79181.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">379</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">2800</span> Approximation Property Pass to Free Product</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kankeyanathan%20Kannan">Kankeyanathan Kannan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> On approximation properties of group C* algebras is everywhere; it is powerful, important, backbone of countless breakthroughs. For a discrete group G, let A(G) denote its Fourier algebra, and let M₀A(G) denote the space of completely bounded Fourier multipliers on G. An approximate identity on G is a sequence (Φn) of finitely supported functions such that (Φn) uniformly converge to constant function 1 In this paper we prove that approximation property pass to free product. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximation%20property" title="approximation property">approximation property</a>, <a href="https://publications.waset.org/abstracts/search?q=weakly%20amenable" title=" weakly amenable"> weakly amenable</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20invariant%20approximation%20property" title=" strong invariant approximation property"> strong invariant approximation property</a>, <a href="https://publications.waset.org/abstracts/search?q=invariant%20approximation%20property" title=" invariant approximation property"> invariant approximation property</a> </p> <a href="https://publications.waset.org/abstracts/44414/approximation-property-pass-to-free-product" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44414.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">675</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">2799</span> Approximation by Generalized Lupaş-Durrmeyer Operators with Two Parameter α and β</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Preeti%20Sharma">Preeti Sharma</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the Stancu type generalization of Lupaş-Durrmeyer operators. We establish some direct results in the polynomial weighted space of continuous functions defined on the interval [0, 1]. Also, Voronovskaja type theorem is studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lupas-Durrmeyer%20operators" title="Lupas-Durrmeyer operators">Lupas-Durrmeyer operators</a>, <a href="https://publications.waset.org/abstracts/search?q=polya%20distribution" title=" polya distribution"> polya distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20approximation" title=" weighted approximation"> weighted approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=rate%20of%20convergence" title=" rate of convergence"> rate of convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=modulus%20of%20continuity" title=" modulus of continuity"> modulus of continuity</a> </p> <a href="https://publications.waset.org/abstracts/47660/approximation-by-generalized-lupas-durrmeyer-operators-with-two-parameter-a-and-v" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47660.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">346</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">2798</span> Finite Element Approximation of the Heat Equation under Axisymmetry Assumption</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Raphael%20Zanella">Raphael Zanella</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This works deals with the finite element approximation of axisymmetric problems. The weak formulation of the heat equation under the axisymmetry assumption is established for continuous finite elements. The weak formulation is implemented in a C++ solver with implicit march-in-time. The code is verified by space and time convergence tests using a manufactured solution. The solving of an example problem with an axisymmetric formulation is compared to that with a full-3D formulation. Both formulations lead to the same result, but the code based on the axisymmetric formulation is much faster due to the lower number of degrees of freedom. This confirms the correctness of our approach and the interest in using an axisymmetric formulation when it is possible. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=axisymmetric%20problem" title="axisymmetric problem">axisymmetric problem</a>, <a href="https://publications.waset.org/abstracts/search?q=continuous%20finite%20elements" title=" continuous finite elements"> continuous finite elements</a>, <a href="https://publications.waset.org/abstracts/search?q=heat%20equation" title=" heat equation"> heat equation</a>, <a href="https://publications.waset.org/abstracts/search?q=weak%20formulation" title=" weak formulation"> weak formulation</a> </p> <a href="https://publications.waset.org/abstracts/143012/finite-element-approximation-of-the-heat-equation-under-axisymmetry-assumption" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143012.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">203</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">2797</span> The Spherical Geometric Model of Absorbed Particles: Application to the Electron Transport Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Bentabet">A. Bentabet</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Aydin"> A. Aydin</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Fenineche"> N. Fenineche</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The mean penetration depth has a most important in the absorption transport phenomena. Analytical model of light ion backscattering coefficients from solid targets have been made by Vicanek and Urbassek. In the present work, we showed a mathematical expression (deterministic model) for Z1/2. In advantage, in the best of our knowledge, relatively only one analytical model exit for electron or positron mean penetration depth in solid targets. In this work, we have presented a simple geometric spherical model of absorbed particles based on CSDA scheme. In advantage, we have showed an analytical expression of the mean penetration depth by combination between our model and the Vicanek and Urbassek theory. For this, we have used the Relativistic Partial Wave Expansion Method (RPWEM) and the optical dielectric model to calculate the elastic cross sections and the ranges respectively. Good agreement was found with the experimental and theoretical data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bentabet%20spherical%20geometric%20model" title="Bentabet spherical geometric model">Bentabet spherical geometric model</a>, <a href="https://publications.waset.org/abstracts/search?q=continuous%20slowing%20down%20approximation" title=" continuous slowing down approximation"> continuous slowing down approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=stopping%20powers" title=" stopping powers"> stopping powers</a>, <a href="https://publications.waset.org/abstracts/search?q=ranges" title=" ranges"> ranges</a>, <a href="https://publications.waset.org/abstracts/search?q=mean%20penetration%20depth" title=" mean penetration depth"> mean penetration depth</a> </p> <a href="https://publications.waset.org/abstracts/21045/the-spherical-geometric-model-of-absorbed-particles-application-to-the-electron-transport-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21045.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">642</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">2796</span> Modified Approximation Methods for Finding an Optimal Solution for the Transportation Problem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Guruprasad">N. Guruprasad</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a modification of approximation method for transportation problems. The initial basic feasible solution can be computed using either Russel's or Vogel's approximation methods. Russell’s approximation method provides another excellent criterion that is still quick to implement on a computer (not manually) In most cases Russel's method yields a better initial solution, though it takes longer than Vogel's method (finding the next entering variable in Russel's method is in O(n1*n2), and in O(n1+n2) for Vogel's method). However, Russel's method normally has a lesser total running time because less pivots are required to reach the optimum for all but small problem sizes (n1+n2=~20). With this motivation behind we have incorporated a variation of the same – what we have proposed it has TMC (Total Modified Cost) to obtain fast and efficient solutions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computation" title="computation">computation</a>, <a href="https://publications.waset.org/abstracts/search?q=efficiency" title=" efficiency"> efficiency</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20cost" title=" modified cost"> modified cost</a>, <a href="https://publications.waset.org/abstracts/search?q=Russell%E2%80%99s%20approximation%20method" title=" Russell’s approximation method"> Russell’s approximation method</a>, <a href="https://publications.waset.org/abstracts/search?q=transportation" title=" transportation"> transportation</a>, <a href="https://publications.waset.org/abstracts/search?q=Vogel%E2%80%99s%20approximation%20method" title=" Vogel’s approximation method"> Vogel’s approximation method</a> </p> <a href="https://publications.waset.org/abstracts/19162/modified-approximation-methods-for-finding-an-optimal-solution-for-the-transportation-problem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/19162.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">547</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">2795</span> Durrmeyer Type Modification of q-Generalized Bernstein Operators</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ruchi">Ruchi</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20M.%20Acu"> A. M. Acu</a>, <a href="https://publications.waset.org/abstracts/search?q=Purshottam%20N.%20Agrawal"> Purshottam N. Agrawal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The purpose of this paper to introduce the Durrmeyer type modification of q-generalized-Bernstein operators which include the Bernstein polynomials in the particular α = 0. We investigate the rate of convergence by means of the Lipschitz class and the Peetre’s K-functional. Also, we define the bivariate case of Durrmeyer type modification of q-generalized-Bernstein operators and study the degree of approximation with the aid of the partial modulus of continuity and the Peetre’s K-functional. Finally, we introduce the GBS (Generalized Boolean Sum) of the Durrmeyer type modification of q- generalized-Bernstein operators and investigate the approximation of the Bögel continuous and Bögel differentiable functions with the aid of the Lipschitz class and the mixed modulus of smoothness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=B%C3%B6gel%20continuous" title="Bögel continuous">Bögel continuous</a>, <a href="https://publications.waset.org/abstracts/search?q=B%C3%B6gel%20differentiable" title=" Bögel differentiable"> Bögel differentiable</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20Boolean%20sum" title=" generalized Boolean sum"> generalized Boolean sum</a>, <a href="https://publications.waset.org/abstracts/search?q=Peetre%E2%80%99s%20K-functional" title=" Peetre’s K-functional"> Peetre’s K-functional</a>, <a href="https://publications.waset.org/abstracts/search?q=Lipschitz%20class" title=" Lipschitz class"> Lipschitz class</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20modulus%20of%20smoothness" title=" mixed modulus of smoothness"> mixed modulus of smoothness</a> </p> <a href="https://publications.waset.org/abstracts/79175/durrmeyer-type-modification-of-q-generalized-bernstein-operators" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/79175.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">213</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">2794</span> RAFU Functions in Robotics and Automation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alicia%20C.%20Sanchez">Alicia C. Sanchez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper investigates the implementation of RAFU functions (radical functions) in robotics and automation. Specifically, the main goal is to show how these functions may be useful in lane-keeping control and the lateral control of autonomous machines, vehicles, robots or the like. From the knowledge of several points of a certain route, the RAFU functions are used to achieve the lateral control purpose and maintain the lane-keeping errors within the fixed limits. The stability that these functions provide, their ease of approaching any continuous trajectory and the control of the possible error made on the approximation may be useful in practice. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automatic%20navigation%20control" title="automatic navigation control">automatic navigation control</a>, <a href="https://publications.waset.org/abstracts/search?q=lateral%20control" title=" lateral control"> lateral control</a>, <a href="https://publications.waset.org/abstracts/search?q=lane-keeping%20control" title=" lane-keeping control"> lane-keeping control</a>, <a href="https://publications.waset.org/abstracts/search?q=RAFU%20approximation" title=" RAFU approximation"> RAFU approximation</a> </p> <a href="https://publications.waset.org/abstracts/138558/rafu-functions-in-robotics-and-automation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/138558.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">302</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">2793</span> Approximation of Intersection Curves of Two Parametric Surfaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Misbah%20Irshad">Misbah Irshad</a>, <a href="https://publications.waset.org/abstracts/search?q=Faiza%20Sarfraz"> Faiza Sarfraz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The problem of approximating surface to surface intersection is considered to be very important in computer aided geometric design and computer aided manufacturing. Although it is a complex problem to handle, its continuous need in the industry makes it an active topic in research. A technique for approximating intersection curves of two parametric surfaces is proposed, which extracts boundary points and turning points from a sequence of intersection points and interpolate them with the help of rational cubic spline functions. The proposed approach is demonstrated with the help of examples and analyzed by calculating error. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximation" title="approximation">approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=parametric%20surface" title=" parametric surface"> parametric surface</a>, <a href="https://publications.waset.org/abstracts/search?q=spline%20function" title=" spline function"> spline function</a>, <a href="https://publications.waset.org/abstracts/search?q=surface%20intersection" title=" surface intersection"> surface intersection</a> </p> <a href="https://publications.waset.org/abstracts/52667/approximation-of-intersection-curves-of-two-parametric-surfaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52667.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">270</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">2792</span> Constant Factor Approximation Algorithm for p-Median Network Design Problem with Multiple Cable Types</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chaghoub%20Soraya">Chaghoub Soraya</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhang%20Xiaoyan"> Zhang Xiaoyan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This research presents the first constant approximation algorithm to the p-median network design problem with multiple cable types. This problem was addressed with a single cable type and there is a bifactor approximation algorithm for the problem. To the best of our knowledge, the algorithm proposed in this paper is the first constant approximation algorithm for the p-median network design with multiple cable types. The addressed problem is a combination of two well studied problems which are p-median problem and network design problem. The introduced algorithm is a random sampling approximation algorithm of constant factor which is conceived by using some random sampling techniques form the literature. It is based on a redistribution Lemma from the literature and a steiner tree problem as a subproblem. This algorithm is simple, and it relies on the notions of random sampling and probability. The proposed approach gives an approximation solution with one constant ratio without violating any of the constraints, in contrast to the one proposed in the literature. This paper provides a (21 + 2)-approximation algorithm for the p-median network design problem with multiple cable types using random sampling techniques. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximation%20algorithms" title="approximation algorithms">approximation algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=buy-at-bulk" title=" buy-at-bulk"> buy-at-bulk</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorial%20optimization" title=" combinatorial optimization"> combinatorial optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=network%20design" title=" network design"> network design</a>, <a href="https://publications.waset.org/abstracts/search?q=p-median" title=" p-median"> p-median</a> </p> <a href="https://publications.waset.org/abstracts/127337/constant-factor-approximation-algorithm-for-p-median-network-design-problem-with-multiple-cable-types" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/127337.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">203</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">2791</span> Approximation of the Time Series by Fractal Brownian Motion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Valeria%20Bondarenko">Valeria Bondarenko</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we propose two problems related to fractal Brownian motion. First problem is simultaneous estimation of two parameters, Hurst exponent and the volatility, that describe this random process. Numerical tests for the simulated fBm provided an efficient method. Second problem is approximation of the increments of the observed time series by a power function by increments from the fractional Brownian motion. Approximation and estimation are shown on the example of real data, daily deposit interest rates. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fractional%20Brownian%20motion" title="fractional Brownian motion">fractional Brownian motion</a>, <a href="https://publications.waset.org/abstracts/search?q=Gausssian%20processes" title=" Gausssian processes"> Gausssian processes</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation" title=" approximation"> approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20series" title=" time series"> time series</a>, <a href="https://publications.waset.org/abstracts/search?q=estimation%20of%20properties%20of%20the%20model" title=" estimation of properties of the model"> estimation of properties of the model</a> </p> <a href="https://publications.waset.org/abstracts/4285/approximation-of-the-time-series-by-fractal-brownian-motion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4285.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">376</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">2790</span> Approximation of Periodic Functions Belonging to Lipschitz Classes by Product Matrix Means of Fourier Series</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Smita%20Sonker">Smita Sonker</a>, <a href="https://publications.waset.org/abstracts/search?q=Uaday%20Singh"> Uaday Singh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Various investigators have determined the degree of approximation of functions belonging to the classes W(L r , ξ(t)), Lip(ξ(t), r), Lip(α, r), and Lipα using different summability methods with monotonocity conditions. Recently, Lal has determined the degree of approximation of the functions belonging to Lipα and W(L r , ξ(t)) classes by using Ces`aro-N¨orlund (C 1 .Np)- summability with non-increasing weights {pn}. In this paper, we shall determine the degree of approximation of 2π - periodic functions f belonging to the function classes Lipα and W(L r , ξ(t)) by C 1 .T - means of Fourier series of f. Our theorems generalize the results of Lal and we also improve these results in the light off. From our results, we also derive some corollaries. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Lipschitz%20classes" title="Lipschitz classes">Lipschitz classes</a>, <a href="https://publications.waset.org/abstracts/search?q=product%20matrix%20operator" title=" product matrix operator"> product matrix operator</a>, <a href="https://publications.waset.org/abstracts/search?q=signals" title=" signals"> signals</a>, <a href="https://publications.waset.org/abstracts/search?q=trigonometric%20Fourier%20approximation" title=" trigonometric Fourier approximation"> trigonometric Fourier approximation</a> </p> <a href="https://publications.waset.org/abstracts/4757/approximation-of-periodic-functions-belonging-to-lipschitz-classes-by-product-matrix-means-of-fourier-series" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/4757.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">477</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">2789</span> A Nonlinear Parabolic Partial Differential Equation Model for Image Enhancement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tudor%20Barbu">Tudor Barbu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present a robust nonlinear parabolic partial differential equation (PDE)-based denoising scheme in this article. Our approach is based on a second-order anisotropic diffusion model that is described first. Then, a consistent and explicit numerical approximation algorithm is constructed for this continuous model by using the finite-difference method. Finally, our restoration experiments and method comparison, which prove the effectiveness of this proposed technique, are discussed in this paper. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=anisotropic%20diffusion" title="anisotropic diffusion">anisotropic diffusion</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20differences" title=" finite differences"> finite differences</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20denoising%20and%20restoration" title=" image denoising and restoration"> image denoising and restoration</a>, <a href="https://publications.waset.org/abstracts/search?q=nonlinear%20PDE%20model" title=" nonlinear PDE model"> nonlinear PDE model</a>, <a href="https://publications.waset.org/abstracts/search?q=anisotropic%20diffusion" title=" anisotropic diffusion"> anisotropic diffusion</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20approximation%20schemes" title=" numerical approximation schemes"> numerical approximation schemes</a> </p> <a href="https://publications.waset.org/abstracts/48289/a-nonlinear-parabolic-partial-differential-equation-model-for-image-enhancement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/48289.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">313</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">2788</span> High-Pressure Calculations of the Elastic Properties of ZnSx Se 1−x Alloy in the Virtual-Crystal Approximation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Lebga">N. Lebga</a>, <a href="https://publications.waset.org/abstracts/search?q=Kh.%20Bouamama"> Kh. Bouamama</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Kassali"> K. Kassali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We report first-principles calculation results on the structural and elastic properties of ZnS x Se1−x alloy for which we employed the virtual crystal approximation provided with the ABINIT program. The calculations done using density functional theory within the local density approximation and employing the virtual-crystal approximation, we made a comparative study between the numerical results obtained from ab-initio calculation using ABINIT or Wien2k within the Density Functional Theory framework with either Local Density Approximation or Generalized Gradient approximation and the pseudo-potential plane-wave method with the Hartwigzen Goedecker Hutter scheme potentials. It is found that the lattice parameter, the phase transition pressure, and the elastic constants (and their derivative with respect to the pressure) follow a quadratic law in x. The variation of the elastic constants is also numerically studied and the phase transformations are discussed in relation to the mechanical stability criteria. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=density%20functional%20theory" title="density functional theory">density functional theory</a>, <a href="https://publications.waset.org/abstracts/search?q=elastic%20properties" title=" elastic properties"> elastic properties</a>, <a href="https://publications.waset.org/abstracts/search?q=ZnS" title=" ZnS"> ZnS</a>, <a href="https://publications.waset.org/abstracts/search?q=ZnSe" title=" ZnSe"> ZnSe</a>, <a href="https://publications.waset.org/abstracts/search?q=" title=" "> </a> </p> <a href="https://publications.waset.org/abstracts/33371/high-pressure-calculations-of-the-elastic-properties-of-znsx-se-1x-alloy-in-the-virtual-crystal-approximation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33371.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">574</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">2787</span> Approximation of Convex Set by Compactly Semidefinite Representable Set</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anusuya%20Ghosh">Anusuya Ghosh</a>, <a href="https://publications.waset.org/abstracts/search?q=Vishnu%20Narayanan"> Vishnu Narayanan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The approximation of convex set by semidefinite representable set plays an important role in semidefinite programming, especially in modern convex optimization. To optimize a linear function over a convex set is a hard problem. But optimizing the linear function over the semidefinite representable set which approximates the convex set is easy to solve as there exists numerous efficient algorithms to solve semidefinite programming problems. So, our approximation technique is significant in optimization. We develop a technique to approximate any closed convex set, say K by compactly semidefinite representable set. Further we prove that there exists a sequence of compactly semidefinite representable sets which give tighter approximation of the closed convex set, K gradually. We discuss about the convergence of the sequence of compactly semidefinite representable sets to closed convex set K. The recession cone of K and the recession cone of the compactly semidefinite representable set are equal. So, we say that the sequence of compactly semidefinite representable sets converge strongly to the closed convex set. Thus, this approximation technique is very useful development in semidefinite programming. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semidefinite%20programming" title="semidefinite programming">semidefinite programming</a>, <a href="https://publications.waset.org/abstracts/search?q=semidefinite%20representable%20set" title=" semidefinite representable set"> semidefinite representable set</a>, <a href="https://publications.waset.org/abstracts/search?q=compactly%20semidefinite%20representable%20set" title=" compactly semidefinite representable set"> compactly semidefinite representable set</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation" title=" approximation"> approximation</a> </p> <a href="https://publications.waset.org/abstracts/36914/approximation-of-convex-set-by-compactly-semidefinite-representable-set" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/36914.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">387</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">2786</span> Approximation of Analytic Functions of Several Variables by Linear K-Positive Operators in the Closed Domain</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tulin%20Coskun">Tulin Coskun</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We investigate the approximation of analytic functions of several variables in polydisc by the sequences of linear k-positive operators in Gadjiev sence. The approximation of analytic functions of complex variable by linear k-positive operators was tackled, and k-positive operators and formulated theorems of Korovkin's type for these operators in the space of analytic functions on the unit disc were introduced in the past. Recently, very general results on convergence of the sequences of linear k-positive operators on a simply connected bounded domain within the space of analytic functions were proved. In this presentation, we extend some of these results to the approximation of analytic functions of several complex variables by sequences of linear k-positive operators. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analytic%20functions" title="analytic functions">analytic functions</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation%20of%20analytic%20functions" title=" approximation of analytic functions"> approximation of analytic functions</a>, <a href="https://publications.waset.org/abstracts/search?q=Linear%20k-positive%20operators" title=" Linear k-positive operators"> Linear k-positive operators</a>, <a href="https://publications.waset.org/abstracts/search?q=Korovkin%20type%20theorems" title=" Korovkin type theorems"> Korovkin type theorems</a> </p> <a href="https://publications.waset.org/abstracts/53219/approximation-of-analytic-functions-of-several-variables-by-linear-k-positive-operators-in-the-closed-domain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53219.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">338</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">2785</span> Degree of Approximation of Functions by Product Means</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hare%20Krishna%20Nigam">Hare Krishna Nigam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, for the first time, (E,q)(C,2) product summability method is introduced and two quite new results on degree of approximation of the function f belonging to Lip (alpha,r)class and W(L(r), xi(t)) class by (E,q)(C,2) product means of Fourier series, has been obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Degree%20of%20approximation" title="Degree of approximation">Degree of approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=%28E" title=" (E"> (E</a>, <a href="https://publications.waset.org/abstracts/search?q=q%29%28C" title="q)(C">q)(C</a>, <a href="https://publications.waset.org/abstracts/search?q=2%29%20means" title="2) means">2) means</a>, <a href="https://publications.waset.org/abstracts/search?q=Fourier%20series" title=" Fourier series"> Fourier series</a>, <a href="https://publications.waset.org/abstracts/search?q=Lebesgue%20integral" title=" Lebesgue integral"> Lebesgue integral</a>, <a href="https://publications.waset.org/abstracts/search?q=Lip%20%28alpha" title=" Lip (alpha"> Lip (alpha</a>, <a href="https://publications.waset.org/abstracts/search?q=r%29class" title="r)class">r)class</a>, <a href="https://publications.waset.org/abstracts/search?q=W%28L%28r%29" title=" W(L(r)"> W(L(r)</a>, <a href="https://publications.waset.org/abstracts/search?q=xi%28t%29%29class%20of%20%20functions" title="xi(t))class of functions">xi(t))class of functions</a> </p> <a href="https://publications.waset.org/abstracts/32235/degree-of-approximation-of-functions-by-product-means" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32235.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">518</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">2784</span> Approximation to the Hardy Operator on Topological Measure Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kairat%20T.%20Mynbaev">Kairat T. Mynbaev</a>, <a href="https://publications.waset.org/abstracts/search?q=Elena%20N.%20Lomakina"> Elena N. Lomakina</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider a Hardy-type operator generated by a family of open subsets of a Hausdorff topological space. The family is indexed with non-negative real numbers and is totally ordered. For this operator, we obtain two-sided bounds of its norm, a compactness criterion, and bounds for its approximation numbers. Previously, bounds for its approximation numbers have been established only in the one-dimensional case, while we do not impose any restrictions on the dimension of the Hausdorff space. The bounds for the norm and conditions for compactness earlier have been found using different methods by G. Sinnamon and K. Mynbaev. Our approach is different in that we use domain partitions for all problems under consideration. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximation%20numbers" title="approximation numbers">approximation numbers</a>, <a href="https://publications.waset.org/abstracts/search?q=boundedness%20and%20compactness" title=" boundedness and compactness"> boundedness and compactness</a>, <a href="https://publications.waset.org/abstracts/search?q=multidimensional%20Hardy%20operator" title=" multidimensional Hardy operator"> multidimensional Hardy operator</a>, <a href="https://publications.waset.org/abstracts/search?q=Hausdorff%20topological%20space" title=" Hausdorff topological space"> Hausdorff topological space</a> </p> <a href="https://publications.waset.org/abstracts/170957/approximation-to-the-hardy-operator-on-topological-measure-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/170957.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">105</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">2783</span> Analytical Approximations of the Differential Elastic Scattering Cross-Sections for Slow Electrons and Positrons Transport in Solids: A Comparative Study</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Bentabet">A. Bentabet</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Aydin"> A. Aydin</a>, <a href="https://publications.waset.org/abstracts/search?q=N.%20Fenineche"> N. Fenineche </a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, we try to determine the best analytical approximation of differential cross sections, used generally in Monte Carlo simulation, to study the electron/positron slowing down in solid targets in the energy range up to 10 keV. Actually, our comparative study was carried out on the angular distribution of the scattering angle, the elastic total and the first transport cross sections which are the essential quantities used generally in the electron/positron transport study by using both stochastic and deterministic methods. Indeed, the obtained results using the relativistic partial wave expansion method and the backscattering coefficient experimental data are used as criteria to evaluate the used model. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=differential%20cross-section" title="differential cross-section">differential cross-section</a>, <a href="https://publications.waset.org/abstracts/search?q=backscattering%20coefficient" title=" backscattering coefficient"> backscattering coefficient</a>, <a href="https://publications.waset.org/abstracts/search?q=Rutherford%20cross-section" title=" Rutherford cross-section"> Rutherford cross-section</a>, <a href="https://publications.waset.org/abstracts/search?q=Vicanek%20and%20Urbassek%20theory" title=" Vicanek and Urbassek theory"> Vicanek and Urbassek theory</a> </p> <a href="https://publications.waset.org/abstracts/16449/analytical-approximations-of-the-differential-elastic-scattering-cross-sections-for-slow-electrons-and-positrons-transport-in-solids-a-comparative-study" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16449.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">563</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">2782</span> Theory of the Optimum Signal Approximation Clarifying the Importance in the Recognition of Parallel World and Application to Secure Signal Communication with Feedback</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Takuro%20Kida">Takuro Kida</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuichi%20Kida"> Yuichi Kida</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, it is shown a base of the new trend of algorithm mathematically that treats a historical reason of continuous discrimination in the world as well as its solution by introducing new concepts of parallel world that includes an invisible set of errors as its companion. With respect to a matrix operator-filter bank that the matrix operator-analysis-filter bank H and the matrix operator-sampling-filter bank S are given, firstly, we introduce the detail algorithm to derive the optimum matrix operator-synthesis-filter bank Z that minimizes all the worst-case measures of the matrix operator-error-signals E(ω) = F(ω) − Y(ω) between the matrix operator-input-signals F(ω) and the matrix operator-output-signals Y(ω) of the matrix operator-filter bank at the same time. Further, feedback is introduced to the above approximation theory, and it is indicated that introducing conversations with feedback do not superior automatically to the accumulation of existing knowledge of signal prediction. Secondly, the concept of category in the field of mathematics is applied to the above optimum signal approximation and is indicated that the category-based approximation theory is applied to the set-theoretic consideration of the recognition of humans. Based on this discussion, it is shown naturally why the narrow perception that tends to create isolation shows an apparent advantage in the short term and, often, why such narrow thinking becomes intimate with discriminatory action in a human group. Throughout these considerations, it is presented that, in order to abolish easy and intimate discriminatory behavior, it is important to create a parallel world of conception where we share the set of invisible error signals, including the words and the consciousness of both worlds. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=matrix%20filterbank" title="matrix filterbank">matrix filterbank</a>, <a href="https://publications.waset.org/abstracts/search?q=optimum%20signal%20approximation" title=" optimum signal approximation"> optimum signal approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=category%20theory" title=" category theory"> category theory</a>, <a href="https://publications.waset.org/abstracts/search?q=simultaneous%20minimization" title=" simultaneous minimization"> simultaneous minimization</a> </p> <a href="https://publications.waset.org/abstracts/150610/theory-of-the-optimum-signal-approximation-clarifying-the-importance-in-the-recognition-of-parallel-world-and-application-to-secure-signal-communication-with-feedback" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/150610.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">143</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">2781</span> Degree of Approximation by the (T.E^1) Means of Conjugate Fourier Series in the Hölder Metric</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Kejal%20Khatri">Kejal Khatri</a>, <a href="https://publications.waset.org/abstracts/search?q=Vishnu%20Narayan%20Mishra"> Vishnu Narayan Mishra</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We compute the degree of approximation of functions\tilde{f}\in H_w, a new Banach space using (T.E^1) summability means of conjugate Fourier series. In this paper, we extend the results of Singh and Mahajan which in turn generalizes the result of Lal and Yadav. Some corollaries have also been deduced from our main theorem and particular cases. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20Fourier%20series" title="conjugate Fourier series">conjugate Fourier series</a>, <a href="https://publications.waset.org/abstracts/search?q=degree%20of%20approximation" title=" degree of approximation"> degree of approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=H%C3%B6lder%20metric" title=" Hölder metric"> Hölder metric</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20summability" title=" matrix summability"> matrix summability</a>, <a href="https://publications.waset.org/abstracts/search?q=product%20summability" title=" product summability"> product summability</a> </p> <a href="https://publications.waset.org/abstracts/2123/degree-of-approximation-by-the-te1-means-of-conjugate-fourier-series-in-the-holder-metric" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2123.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">420</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">2780</span> An Axisymmetric Finite Element Method for Compressible Swirling Flow</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Raphael%20Zanella">Raphael Zanella</a>, <a href="https://publications.waset.org/abstracts/search?q=Todd%20A.%20Oliver"> Todd A. Oliver</a>, <a href="https://publications.waset.org/abstracts/search?q=Karl%20W.%20Schulz"> Karl W. Schulz</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This work deals with the finite element approximation of axisymmetric compressible flows with swirl velocity. We are interested in problems where the flow, while weakly dependent on the azimuthal coordinate, may have a strong azimuthal velocity component. We describe the approximation of the compressible Navier-Stokes equations with H1-conformal spaces of axisymmetric functions. The weak formulation is implemented in a C++ solver with explicit time marching. The code is first verified with a convergence test on a manufactured solution. The verification is completed by comparing the numerical and analytical solutions in a Poiseuille flow case and a Taylor-Couette flow case. The code is finally applied to the problem of a swirling subsonic air flow in a plasma torch geometry. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=axisymmetric%20problem" title="axisymmetric problem">axisymmetric problem</a>, <a href="https://publications.waset.org/abstracts/search?q=compressible%20Navier-Stokes%20equations" title=" compressible Navier-Stokes equations"> compressible Navier-Stokes equations</a>, <a href="https://publications.waset.org/abstracts/search?q=continuous%20finite%20elements" title=" continuous finite elements"> continuous finite elements</a>, <a href="https://publications.waset.org/abstracts/search?q=swirling%20flow" title=" swirling flow"> swirling flow</a> </p> <a href="https://publications.waset.org/abstracts/143638/an-axisymmetric-finite-element-method-for-compressible-swirling-flow" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/143638.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">2779</span> On Modeling Data Sets by Means of a Modified Saddlepoint Approximation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Serge%20B.%20Provost">Serge B. Provost</a>, <a href="https://publications.waset.org/abstracts/search?q=Yishan%20Zhang"> Yishan Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A moment-based adjustment to the saddlepoint approximation is introduced in the context of density estimation. First applied to univariate distributions, this methodology is extended to the bivariate case. It then entails estimating the density function associated with each marginal distribution by means of the saddlepoint approximation and applying a bivariate adjustment to the product of the resulting density estimates. The connection to the distribution of empirical copulas will be pointed out. As well, a novel approach is proposed for estimating the support of distribution. As these results solely rely on sample moments and empirical cumulant-generating functions, they are particularly well suited for modeling massive data sets. Several illustrative applications will be presented. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=empirical%20cumulant-generating%20function" title="empirical cumulant-generating function">empirical cumulant-generating function</a>, <a href="https://publications.waset.org/abstracts/search?q=endpoints%20identification" title=" endpoints identification"> endpoints identification</a>, <a href="https://publications.waset.org/abstracts/search?q=saddlepoint%20approximation" title=" saddlepoint approximation"> saddlepoint approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=sample%20moments" title=" sample moments"> sample moments</a>, <a href="https://publications.waset.org/abstracts/search?q=density%20estimation" title=" density estimation"> density estimation</a> </p> <a href="https://publications.waset.org/abstracts/144553/on-modeling-data-sets-by-means-of-a-modified-saddlepoint-approximation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144553.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">2778</span> Distributed Real-Time Range Query Approximation in a Streaming Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Simon%20Keller">Simon Keller</a>, <a href="https://publications.waset.org/abstracts/search?q=Rainer%20Mueller"> Rainer Mueller</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Continuous range queries are a common means to handle mobile clients in high-density areas. Most existing approaches focus on settings in which the range queries for location-based services are more or less static, whereas the mobile clients in the ranges move. We focus on a category called dynamic real-time range queries (DRRQ), assuming that both, clients requested by the query and the inquirers, are mobile. In consequence, the query parameters and the query results continuously change. This leads to two requirements: the ability to deal with an arbitrarily high number of mobile nodes (scalability) and the real-time delivery of range query results. In this paper, we present the highly decentralized solution adaptive quad streaming (AQS) for the requirements of DRRQs. AQS approximates the query results in favor of a controlled real-time delivery and guaranteed scalability. While prior works commonly optimize data structures on the involved servers, we use AQS to focus on a highly distributed cell structure without data structures automatically adapting to changing client distributions. Instead of the commonly used request-response approach, we apply a lightweight streaming method in which no bidirectional communication and no storage or maintenance of queries are required at all. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximation%20of%20client%20distributions" title="approximation of client distributions">approximation of client distributions</a>, <a href="https://publications.waset.org/abstracts/search?q=continuous%20spatial%20range%20queries" title=" continuous spatial range queries"> continuous spatial range queries</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20objects" title=" mobile objects"> mobile objects</a>, <a href="https://publications.waset.org/abstracts/search?q=streaming-based%20decentralization%20in%20spatial%20mobile%20environments" title=" streaming-based decentralization in spatial mobile environments"> streaming-based decentralization in spatial mobile environments</a> </p> <a href="https://publications.waset.org/abstracts/129023/distributed-real-time-range-query-approximation-in-a-streaming-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129023.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">146</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">2777</span> Degree of Approximation of Functions Conjugate to Periodic Functions Belonging to Lipschitz Classes by Product Matrix Means</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Smita%20Sonker">Smita Sonker</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Various investigators have determined the degree of approximation of conjugate signals (functions) of functions belonging to different classes Lipα, Lip(α,p), Lip(ξ(t),p), W(Lr,ξ(t), (β ≥ 0)) by matrix summability means, lower triangular matrix operator, product means (i.e. (C,1)(E,1), (C,1)(E,q), (E,q)(C,1) (N,p,q)(E,1), and (E,q)(N,pn) of their conjugate trigonometric Fourier series. In this paper, we shall determine the degree of approximation of 2π-periodic function conjugate functions of f belonging to the function classes Lipα and W(Lr; ξ(t); (β ≥ 0)) by (C1.T) -means of their conjugate trigonometric Fourier series. On the other hand, we shall review above-mentioned work in the light of Lenski. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=signals" title="signals">signals</a>, <a href="https://publications.waset.org/abstracts/search?q=trigonometric%20fourier%20approximation" title=" trigonometric fourier approximation"> trigonometric fourier approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=class%20W%28L%5Er" title=" class W(L^r"> class W(L^r</a>, <a href="https://publications.waset.org/abstracts/search?q=%5Cxi%28t%29" title="\xi(t)">\xi(t)</a>, <a href="https://publications.waset.org/abstracts/search?q=conjugate%20fourier%20series" title=" conjugate fourier series"> conjugate fourier series</a> </p> <a href="https://publications.waset.org/abstracts/20996/degree-of-approximation-of-functions-conjugate-to-periodic-functions-belonging-to-lipschitz-classes-by-product-matrix-means" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20996.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">397</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">2776</span> Orthogonal Basis Extreme Learning Algorithm and Function Approximation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ying%20Li">Ying Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Yan%20Li"> Yan Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A new algorithm for single hidden layer feedforward neural networks (SLFN), Orthogonal Basis Extreme Learning (OBEL) algorithm, is proposed and the algorithm derivation is given in the paper. The algorithm can decide both the NNs parameters and the neuron number of hidden layer(s) during training while providing extreme fast learning speed. It will provide a practical way to develop NNs. The simulation results of function approximation showed that the algorithm is effective and feasible with good accuracy and adaptability. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=neural%20network" title="neural network">neural network</a>, <a href="https://publications.waset.org/abstracts/search?q=orthogonal%20basis%20extreme%20learning" title=" orthogonal basis extreme learning"> orthogonal basis extreme learning</a>, <a href="https://publications.waset.org/abstracts/search?q=function%20approximation" title=" function approximation"> function approximation</a> </p> <a href="https://publications.waset.org/abstracts/15129/orthogonal-basis-extreme-learning-algorithm-and-function-approximation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15129.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">534</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">2775</span> Structural and Electronic Properties of the Rock-salt BaxSr1−xS Alloys</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20Bahloul">B. Bahloul</a>, <a href="https://publications.waset.org/abstracts/search?q=K.%20Babesse"> K. Babesse</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Dkhira"> A. Dkhira</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Bahloul"> Y. Bahloul</a>, <a href="https://publications.waset.org/abstracts/search?q=L.%20Amirouche"> L. Amirouche </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Structural and electronic properties of the rock-salt BaxSr1−xS are calculated using the first-principles calculations based on the density functional theory (DFT) within the generalized gradient approximation (GGA), the local density approximation (LDA) and the virtual-crystal approximation (VCA). The calculated lattice parameters at equilibrium volume for x=0 and x=1 are in good agreement with the literature data. The BaxSr1−xS alloys are found to be an indirect band gap semiconductor. Moreoever, for the composition (x) ranging between [0-1], we think that our results are well discussed and well predicted. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semiconductor" title="semiconductor">semiconductor</a>, <a href="https://publications.waset.org/abstracts/search?q=Ab%20initio%20calculations" title=" Ab initio calculations"> Ab initio calculations</a>, <a href="https://publications.waset.org/abstracts/search?q=rocksalt" title=" rocksalt"> rocksalt</a>, <a href="https://publications.waset.org/abstracts/search?q=band%20structure" title=" band structure"> band structure</a>, <a href="https://publications.waset.org/abstracts/search?q=BaxSr1%E2%88%92xS" title=" BaxSr1−xS"> BaxSr1−xS</a> </p> <a href="https://publications.waset.org/abstracts/13545/structural-and-electronic-properties-of-the-rock-salt-baxsr1xs-alloys" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13545.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> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">2774</span> An Optimized RDP Algorithm for Curve Approximation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jean-Pierre%20Lomaliza">Jean-Pierre Lomaliza</a>, <a href="https://publications.waset.org/abstracts/search?q=Kwang-Seok%20Moon"> Kwang-Seok Moon</a>, <a href="https://publications.waset.org/abstracts/search?q=Hanhoon%20Park"> Hanhoon Park</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is well-known that Ramer Douglas Peucker (RDP) algorithm greatly depends on the method of choosing starting points. Therefore, this paper focuses on finding such starting points that will optimize the results of RDP algorithm. Specifically, this paper proposes a curve approximation algorithm that finds flat points, called essential points, of an input curve, divides the curve into corner-like sub-curves using the essential points, and applies the RDP algorithm to the sub-curves. The number of essential points play a role on optimizing the approximation results by balancing the degree of shape information loss and the amount of data reduction. Through experiments with curves of various types and complexities of shape, we compared the performance of the proposed algorithm with three other methods, i.e., the RDP algorithm itself and its variants. As a result, the proposed algorithm outperformed the others in term of maintaining the original shapes of the input curve, which is important in various applications like pattern recognition. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=curve%20approximation" title="curve approximation">curve approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=essential%20point" title=" essential point"> essential point</a>, <a href="https://publications.waset.org/abstracts/search?q=RDP%20algorithm" title=" RDP algorithm"> RDP algorithm</a> </p> <a href="https://publications.waset.org/abstracts/29359/an-optimized-rdp-algorithm-for-curve-approximation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29359.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">535</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">2773</span> Polynomially Adjusted Bivariate Density Estimates Based on the Saddlepoint Approximation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20B.%20Provost">S. B. Provost</a>, <a href="https://publications.waset.org/abstracts/search?q=Susan%20Sheng"> Susan Sheng</a> </p> <p class="card-text"><strong>Abstract:</strong></p> An alternative bivariate density estimation methodology is introduced in this presentation. The proposed approach involves estimating the density function associated with the marginal distribution of each of the two variables by means of the saddlepoint approximation technique and applying a bivariate polynomial adjustment to the product of these density estimates. Since the saddlepoint approximation is utilized in the context of density estimation, such estimates are determined from empirical cumulant-generating functions. In the univariate case, the saddlepoint density estimate is itself adjusted by a polynomial. Given a set of observations, the coefficients of the polynomial adjustments are obtained from the sample moments. Several illustrative applications of the proposed methodology shall be presented. Since this approach relies essentially on a determinate number of sample moments, it is particularly well suited for modeling massive data sets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=density%20estimation" title="density estimation">density estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=empirical%20cumulant-generating%20function" title=" empirical cumulant-generating function"> empirical cumulant-generating function</a>, <a href="https://publications.waset.org/abstracts/search?q=moments" title=" moments"> moments</a>, <a href="https://publications.waset.org/abstracts/search?q=saddlepoint%20approximation" title=" saddlepoint approximation"> saddlepoint approximation</a> </p> <a href="https://publications.waset.org/abstracts/72664/polynomially-adjusted-bivariate-density-estimates-based-on-the-saddlepoint-approximation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72664.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">280</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">2772</span> Category-Base Theory of the Optimum Signal Approximation Clarifying the Importance of Parallel Worlds in the Recognition of Human and Application to Secure Signal Communication with Feedback</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Takuro%20Kida">Takuro Kida</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuichi%20Kida"> Yuichi Kida</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We show a base of the new trend of algorithm mathematically that treats a historical reason of continuous discrimination in the world as well as its solution by introducing new concepts of parallel world that includes an invisible set of errors as its companion. With respect to a matrix operator-filter bank that the matrix operator-analysis-filter bank H and the matrix operator-sampling-filter bank S are given, firstly, we introduce the detailed algorithm to derive the optimum matrix operator-synthesis-filter bank Z that minimizes all the worst-case measures of the matrix operator-error-signals E(ω) = F(ω) − Y(ω) between the matrix operator-input-signals F(ω) and the matrix operator-output signals Y(ω) of the matrix operator-filter bank at the same time. Further, feedback is introduced to the above approximation theory and it is indicated that introducing conversations with feedback does not superior automatically to the accumulation of existing knowledge of signal prediction. Secondly, the concept of category in the field of mathematics is applied to the above optimum signal approximation and is indicated that the category-based approximation theory is applied to the set-theoretic consideration of the recognition of humans. Based on this discussion, it is shown naturally why the narrow perception that tends to create isolation shows an apparent advantage in the short term and, often, why such narrow thinking becomes intimate with discriminatory action in a human group. Throughout these considerations, it is presented that, in order to abolish easy and intimate discriminatory behavior, it is important to create a parallel world of conception where we share the set of invisible error signals, including the words and the consciousness of both worlds. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=signal%20prediction" title="signal prediction">signal prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=pseudo%20inverse%20matrix" title=" pseudo inverse matrix"> pseudo inverse matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence" title=" artificial intelligence"> artificial intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=conditional%20optimization" title=" conditional optimization"> conditional optimization</a> </p> <a href="https://publications.waset.org/abstracts/144630/category-base-theory-of-the-optimum-signal-approximation-clarifying-the-importance-of-parallel-worlds-in-the-recognition-of-human-and-application-to-secure-signal-communication-with-feedback" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/144630.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">156</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=continuous%20slowing%20down%20approximation&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=continuous%20slowing%20down%20approximation&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=continuous%20slowing%20down%20approximation&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=continuous%20slowing%20down%20approximation&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=continuous%20slowing%20down%20approximation&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=continuous%20slowing%20down%20approximation&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=continuous%20slowing%20down%20approximation&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=continuous%20slowing%20down%20approximation&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=continuous%20slowing%20down%20approximation&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=continuous%20slowing%20down%20approximation&page=93">93</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=continuous%20slowing%20down%20approximation&page=94">94</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=continuous%20slowing%20down%20approximation&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>