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>   <script> var _paq = window._paq = window._paq || []; /* tracker methods like "setCustomDimension" should be called before "trackPageView" */ _paq.push(['trackPageView']); _paq.push(['enableLinkTracking']); (function() { var u="//matomo.waset.org/"; _paq.push(['setTrackerUrl', u+'matomo.php']); _paq.push(['setSiteId', '2']); var d=document, g=d.createElement('script'), s=d.getElementsByTagName('script')[0]; g.async=true; g.src=u+'matomo.js'; s.parentNode.insertBefore(g,s); })(); </script>  <title>Search results for: multiple time scale approximation</title> <meta name="description" content="Search results for: multiple time scale approximation"> <meta name="keywords" content="multiple time scale 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="multiple time scale 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 2025/2026/2027">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="multiple time scale 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> 26729</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: multiple time scale approximation</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26729</span> Fault Tolerant Control System Using a Multiple Time Scale SMC Technique and a Geometric Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ghodbane%20Azeddine">Ghodbane Azeddine</a>, <a href="https://publications.waset.org/abstracts/search?q=Saad%20Maarouf"> Saad Maarouf</a>, <a href="https://publications.waset.org/abstracts/search?q=Boland%20Jean-Francois"> Boland Jean-Francois</a>, <a href="https://publications.waset.org/abstracts/search?q=Thibeault%20Claude"> Thibeault Claude</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper proposes a new design of an active fault-tolerant flight control system against abrupt actuator faults. This overall system combines a multiple time scale sliding mode controller for fault compensation and a geometric approach for fault detection and diagnosis. The proposed control system is able to accommodate several kinds of partial and total actuator failures, by using available healthy redundancy actuators. The overall system first estimates the correct fault information using the geometric approach. Then, and based on that, a new reconfigurable control law is designed based on the multiple time scale sliding mode technique for on-line compensating the effect of such faults. This approach takes advantages of the fact that there are significant difference between the time scales of aircraft states that have a slow dynamics and those that have a fast dynamics. The closed-loop stability of the overall system is proved using Lyapunov technique. A case study of the non-linear model of the F16 fighter, subject to the rudder total loss of control confirms the effectiveness of the proposed approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=actuator%20faults" title="actuator faults">actuator faults</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20detection%20and%20diagnosis" title=" fault detection and diagnosis"> fault detection and diagnosis</a>, <a href="https://publications.waset.org/abstracts/search?q=fault%20tolerant%20flight%20control" title=" fault tolerant flight control"> fault tolerant flight control</a>, <a href="https://publications.waset.org/abstracts/search?q=sliding%20mode%20control" title=" sliding mode control"> sliding mode control</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20time%20scale%20approximation" title=" multiple time scale approximation"> multiple time scale approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=geometric%20approach%20for%20fault%20reconstruction" title=" geometric approach for fault reconstruction"> geometric approach for fault reconstruction</a>, <a href="https://publications.waset.org/abstracts/search?q=lyapunov%20stability" title=" lyapunov stability"> lyapunov stability</a> </p> <a href="https://publications.waset.org/abstracts/50753/fault-tolerant-control-system-using-a-multiple-time-scale-smc-technique-and-a-geometric-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50753.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">375</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">26728</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">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">26727</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">381</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">26726</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">678</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">26725</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">556</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">26724</span> The Modelling of Real Time Series Data</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> We proposed algorithms for: estimation of parameters fBm (volatility and Hurst exponent) and for the approximation of random time series by functional of fBm. We proved the consistency of the estimators, which constitute the above algorithms, and proved the optimal forecast of approximated time series. The adequacy of estimation algorithms, approximation, and forecasting is proved by numerical experiment. During the process of creating software, the system has been created, which is displayed by the hierarchical structure. The comparative analysis of proposed algorithms with the other methods gives evidence of the advantage of approximation method. The results can be used to develop methods for the analysis and modeling of time series describing the economic, physical, biological and other processes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=mathematical%20model" title="mathematical model">mathematical model</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20process" title=" random process"> random process</a>, <a href="https://publications.waset.org/abstracts/search?q=Wiener%20process" title=" Wiener process"> Wiener process</a>, <a href="https://publications.waset.org/abstracts/search?q=fractional%20Brownian%20motion" title=" fractional Brownian motion"> fractional Brownian motion</a> </p> <a href="https://publications.waset.org/abstracts/49210/the-modelling-of-real-time-series-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/49210.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">361</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">26723</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">523</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">26722</span> A Study of Using Multiple Subproblems in Dantzig-Wolfe Decomposition of Linear Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=William%20Chung">William Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper is to study the use of multiple subproblems in Dantzig-Wolfe decomposition of linear programming (DW-LP). Traditionally, the decomposed LP consists of one LP master problem and one LP subproblem. The master problem and the subproblem is solved alternatively by exchanging the dual prices of the master problem and the proposals of the subproblem until the LP is solved. It is well known that convergence is slow with a long tail of near-optimal solutions (asymptotic convergence). Hence, the performance of DW-LP highly depends upon the number of decomposition steps. If the decomposition steps can be greatly reduced, the performance of DW-LP can be improved significantly. To reduce the number of decomposition steps, one of the methods is to increase the number of proposals from the subproblem to the master problem. To do so, we propose to add a quadratic approximation function to the LP subproblem in order to develop a set of approximate-LP subproblems (multiple subproblems). Consequently, in each decomposition step, multiple subproblems are solved for providing multiple proposals to the master problem. The number of decomposition steps can be reduced greatly. Note that each approximate-LP subproblem is nonlinear programming, and solving the LP subproblem must faster than solving the nonlinear multiple subproblems. Hence, using multiple subproblems in DW-LP is the tradeoff between the number of approximate-LP subproblems being formed and the decomposition steps. In this paper, we derive the corresponding algorithms and provide some simple computational results. Some properties of the resulting algorithms are also given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximate%20subproblem" title="approximate subproblem">approximate subproblem</a>, <a href="https://publications.waset.org/abstracts/search?q=Dantzig-Wolfe%20decomposition" title=" Dantzig-Wolfe decomposition"> Dantzig-Wolfe decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=large-scale%20models" title=" large-scale models"> large-scale models</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20subproblems" title=" multiple subproblems"> multiple subproblems</a> </p> <a href="https://publications.waset.org/abstracts/110435/a-study-of-using-multiple-subproblems-in-dantzig-wolfe-decomposition-of-linear-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/110435.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">171</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">26721</span> Multiple Images Stitching Based on Gradually Changing Matrix</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shangdong%20Zhu">Shangdong Zhu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yunzhou%20Zhang"> Yunzhou Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Jie%20Zhang"> Jie Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Hang%20Hu"> Hang Hu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yazhou%20Zhang"> Yazhou Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Image stitching is a very important branch in the field of computer vision, especially for panoramic map. In order to eliminate shape distortion, a novel stitching method is proposed based on gradually changing matrix when images are horizontal. For images captured horizontally, this paper assumes that there is only translational operation in image stitching. By analyzing each parameter of the homography matrix, the global homography matrix is gradually transferred to translation matrix so as to eliminate the effects of scaling, rotation, etc. in the image transformation. This paper adopts matrix approximation to get the minimum value of the energy function so that the shape distortion at those regions corresponding to the homography can be minimized. The proposed method can avoid multiple horizontal images stitching failure caused by accumulated shape distortion. At the same time, it can be combined with As-Projective-As-Possible algorithm to ensure precise alignment of overlapping area. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=image%20stitching" title="image stitching">image stitching</a>, <a href="https://publications.waset.org/abstracts/search?q=gradually%20changing%20matrix" title=" gradually changing matrix"> gradually changing matrix</a>, <a href="https://publications.waset.org/abstracts/search?q=horizontal%20direction" title=" horizontal direction"> horizontal direction</a>, <a href="https://publications.waset.org/abstracts/search?q=matrix%20approximation" title=" matrix approximation"> matrix approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=homography%20matrix" title=" homography matrix"> homography matrix</a> </p> <a href="https://publications.waset.org/abstracts/85912/multiple-images-stitching-based-on-gradually-changing-matrix" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/85912.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">324</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">26720</span> An Improved Prediction Model of Ozone Concentration Time Series Based on Chaotic Approach </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nor%20Zila%20Abd%20Hamid">Nor Zila Abd Hamid</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohd%20Salmi%20M.%20Noorani"> Mohd Salmi M. Noorani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study is focused on the development of prediction models of the Ozone concentration time series. Prediction model is built based on chaotic approach. Firstly, the chaotic nature of the time series is detected by means of phase space plot and the Cao method. Then, the prediction model is built and the local linear approximation method is used for the forecasting purposes. Traditional prediction of autoregressive linear model is also built. Moreover, an improvement in local linear approximation method is also performed. Prediction models are applied to the hourly ozone time series observed at the benchmark station in Malaysia. Comparison of all models through the calculation of mean absolute error, root mean squared error and correlation coefficient shows that the one with improved prediction method is the best. Thus, chaotic approach is a good approach to be used to develop a prediction model for the Ozone concentration time series. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chaotic%20approach" title="chaotic approach">chaotic approach</a>, <a href="https://publications.waset.org/abstracts/search?q=phase%20space" title=" phase space"> phase space</a>, <a href="https://publications.waset.org/abstracts/search?q=Cao%20method" title=" Cao method"> Cao method</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20linear%20approximation%20method" title=" local linear approximation method"> local linear approximation method</a> </p> <a href="https://publications.waset.org/abstracts/2015/an-improved-prediction-model-of-ozone-concentration-time-series-based-on-chaotic-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2015.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">337</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">26719</span> Grating Scale Thermal Expansion Error Compensation for Large Machine Tools Based on Multiple Temperature Detection</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wenlong%20Feng">Wenlong Feng</a>, <a href="https://publications.waset.org/abstracts/search?q=Zhenchun%20Du"> Zhenchun Du</a>, <a href="https://publications.waset.org/abstracts/search?q=Jianguo%20Yang"> Jianguo Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> To decrease the grating scale thermal expansion error, a novel method which based on multiple temperature detections is proposed. Several temperature sensors are installed on the grating scale and the temperatures of these sensors are recorded. The temperatures of every point on the grating scale are calculated by interpolating between adjacent sensors. According to the thermal expansion principle, the grating scale thermal expansion error model can be established by doing the integral for the variations of position and temperature. A novel compensation method is proposed in this paper. By applying the established error model, the grating scale thermal expansion error is decreased by 90% compared with no compensation. The residual positioning error of the grating scale is less than 15um/10m and the accuracy of the machine tool is significant improved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=thermal%20expansion%20error%20of%20grating%20scale" title="thermal expansion error of grating scale">thermal expansion error of grating scale</a>, <a href="https://publications.waset.org/abstracts/search?q=error%20compensation" title=" error compensation"> error compensation</a>, <a href="https://publications.waset.org/abstracts/search?q=machine%20tools" title=" machine tools"> machine tools</a>, <a href="https://publications.waset.org/abstracts/search?q=integral%20method" title=" integral method"> integral method</a> </p> <a href="https://publications.waset.org/abstracts/34355/grating-scale-thermal-expansion-error-compensation-for-large-machine-tools-based-on-multiple-temperature-detection" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/34355.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">26718</span> The Construction of the Semigroup Which Is Chernoff Equivalent to Statistical Mixture of Quantizations for the Case of the Harmonic Oscillator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Leonid%20Borisov">Leonid Borisov</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuri%20Orlov"> Yuri Orlov</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We obtain explicit formulas of finitely multiple approximations of the equilibrium density matrix for the case of the harmonic oscillator using Chernoff's theorem and the notion of semigroup which is Chernoff equivalent to average semigroup. Also we found explicit formulas for the corresponding approximate Wigner functions and average values of the observable. We consider a superposition of τ -quantizations representing a wide class of linear quantizations. We show that the convergence of the approximations of the average values of the observable is not uniform with respect to the Gibbs parameter. This does not allow to represent approximate expression as the sum of the exact limits and small deviations evenly throughout the temperature range with a given order of approximation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chernoff%20theorem" title="Chernoff theorem">Chernoff theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=Feynman%20formulas" title=" Feynman formulas"> Feynman formulas</a>, <a href="https://publications.waset.org/abstracts/search?q=finitely%20multiple%20approximation" title=" finitely multiple approximation"> finitely multiple approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=harmonic%20oscillator" title=" harmonic oscillator"> harmonic oscillator</a>, <a href="https://publications.waset.org/abstracts/search?q=Wigner%20function" title=" Wigner function"> Wigner function</a> </p> <a href="https://publications.waset.org/abstracts/23625/the-construction-of-the-semigroup-which-is-chernoff-equivalent-to-statistical-mixture-of-quantizations-for-the-case-of-the-harmonic-oscillator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23625.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">443</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">26717</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">481</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">26716</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">578</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">26715</span> Numerical Analysis of a Reaction Diffusion System of Lambda-Omega Type</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hassan%20J.%20Al%20Salman">Hassan J. Al Salman</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20A.%20Al%20Ghafli"> Ahmed A. Al Ghafli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study, we consider a nonlinear in time finite element approximation of a reaction diffusion system of lambda-omega type. We use a fixed-point theorem to prove existence of the approximations at each time level. Then, we derive some essential stability estimates and discuss the uniqueness of the approximations. In addition, we employ Nochetto mathematical framework to prove an optimal error bound in time for d= 1, 2 and 3 space dimensions. Finally, we present some numerical experiments to verify the obtained theoretical results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reaction%20diffusion%20system" title="reaction diffusion system">reaction diffusion system</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20approximation" title=" finite element approximation"> finite element approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=stability%20estimates" title=" stability estimates"> stability estimates</a>, <a href="https://publications.waset.org/abstracts/search?q=error%20bound" title=" error bound"> error bound</a> </p> <a href="https://publications.waset.org/abstracts/40027/numerical-analysis-of-a-reaction-diffusion-system-of-lambda-omega-type" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40027.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">435</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">26714</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">392</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">26713</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">344</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">26712</span> Oscillatory Electroosmotic Flow of Power-Law Fluids in a Microchannel</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rub%C3%A9n%20B%C3%A3nos">Rubén Bãnos</a>, <a href="https://publications.waset.org/abstracts/search?q=Jos%C3%A9%20Arcos"> José Arcos</a>, <a href="https://publications.waset.org/abstracts/search?q=Oscar%20Bautista"> Oscar Bautista</a>, <a href="https://publications.waset.org/abstracts/search?q=Federico%20M%C3%A9ndez"> Federico Méndez</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Oscillatory electroosmotic flow (OEOF) in power law fluids through a microchannel is studied numerically. A time-dependent external electric field (AC) is suddenly imposed at the ends of the microchannel which induces the fluid motion. The continuity and momentum equations in the x and y direction for the flow field were simplified in the limit of the lubrication approximation theory (LAT), and then solved using a numerical scheme. The solution of the electric potential is based on the Debye-H¨uckel approximation which suggest that the surface potential is small,say, smaller than 0.025V and for a symmetric (z : z) electrolyte. Our results suggest that the velocity profiles across the channel-width are controlled by the following dimensionless parameters: the angular Reynolds number, Reω, the electrokinetic parameter, ¯κ, defined as the ratio of the characteristic length scale to the Debye length, the parameter λ which represents the ratio of the Helmholtz-Smoluchowski velocity to the characteristic length scale and the flow behavior index, n. Also, the results reveal that the velocity profiles become more and more non-uniform across the channel-width as the Reω and ¯κ are increased, so oscillatory OEOF can be really useful in micro-fluidic devices such as micro-mixers. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=low%20zeta%20potentials" title="low zeta potentials">low zeta potentials</a>, <a href="https://publications.waset.org/abstracts/search?q=non-newtonian" title=" non-newtonian"> non-newtonian</a>, <a href="https://publications.waset.org/abstracts/search?q=oscillatory%20electroosmotic%20flow" title=" oscillatory electroosmotic flow"> oscillatory electroosmotic flow</a>, <a href="https://publications.waset.org/abstracts/search?q=power-law%20model" title=" power-law model"> power-law model</a> </p> <a href="https://publications.waset.org/abstracts/95010/oscillatory-electroosmotic-flow-of-power-law-fluids-in-a-microchannel" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/95010.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">176</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">26711</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">115</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">26710</span> Heroin Withdrawal, Prison and Multiple Temporalities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ian%20Walmsley">Ian Walmsley</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of this paper is to explore the influence of time and temporality on the experience of coming off heroin in prison. The presentation draws on qualitative data collected during a small-scale pilot study of the role of self-care in the process of coming off drugs in prison. Time and temporality emerged as a key theme in the interview transcripts. Drug dependent prisoners experience of time in prison has not been recognized in the research literature. Instead, the literature on prison time typically views prisoners as a homogenous group or tends to focus on the influence of aging and gender on prison time. Furthermore, there is a tendency in the literature on prison drug treatment and recovery to conceptualize drug dependent prisoners as passive recipients of prison healthcare, rather than active agents. In building on these gaps, this paper argues that drug dependent prisoners experience multiple temporalities which involve an interaction between the body-times of the drug dependent prisoner and the economy of time in prison. One consequence of this interaction is the feeling that they are doing, at this point in their prison sentence, double prison time. The second part of the argument is that time and temporality were a means through which they governed their withdrawing bodies. In addition, this paper will comment on the challenges of prison research in England. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=heroin%20withdrawal" title="heroin withdrawal">heroin withdrawal</a>, <a href="https://publications.waset.org/abstracts/search?q=time%20and%20temporality" title=" time and temporality"> time and temporality</a>, <a href="https://publications.waset.org/abstracts/search?q=prison" title=" prison"> prison</a>, <a href="https://publications.waset.org/abstracts/search?q=body" title=" body"> body</a> </p> <a href="https://publications.waset.org/abstracts/55856/heroin-withdrawal-prison-and-multiple-temporalities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55856.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">282</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">26709</span> Approximation Algorithms for Peak-Demand Reduction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Zaid%20Jamal%20Saeed%20Almahmoud">Zaid Jamal Saeed Almahmoud</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Smart grid is emerging as the future power grid, with smart techniques to optimize power consumption and electricity generation. Minimizing peak power consumption under a fixed delay requirement is a significant problem in the smart grid.For this problem, all appliances must be scheduled within a given finite time duration. We consider the problem of minimizing the peak demand under appliances constraints by scheduling power jobs with uniform release dates and deadlines. As the problem is known to be NP-hard, we analyze the performance of a version of the natural greedy heuristic for solving this problem. Our theoretical analysis and experimental results show that the proposed heuristic outperforms existing methods by providing a better approximation to the optimal solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=peak%20demand%20scheduling" title="peak demand scheduling">peak demand scheduling</a>, <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=smart%20grid" title=" smart grid"> smart grid</a>, <a href="https://publications.waset.org/abstracts/search?q=heuristics" title=" heuristics"> heuristics</a> </p> <a href="https://publications.waset.org/abstracts/157964/approximation-algorithms-for-peak-demand-reduction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/157964.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">101</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">26708</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">424</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">26707</span> An Approximation of Daily Rainfall by Using a Pixel Value Data Approach </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sarisa%20Pinkham">Sarisa Pinkham</a>, <a href="https://publications.waset.org/abstracts/search?q=Kanyarat%20Bussaban"> Kanyarat Bussaban</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The research aims to approximate the amount of daily rainfall by using a pixel value data approach. The daily rainfall maps from the Thailand Meteorological Department in period of time from January to December 2013 were the data used in this study. The results showed that this approach can approximate the amount of daily rainfall with RMSE=3.343. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=daily%20rainfall" title="daily rainfall">daily rainfall</a>, <a href="https://publications.waset.org/abstracts/search?q=image%20processing" title=" image processing"> image processing</a>, <a href="https://publications.waset.org/abstracts/search?q=approximation" title=" approximation"> approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=pixel%20value%20data" title=" pixel value data"> pixel value data</a> </p> <a href="https://publications.waset.org/abstracts/9889/an-approximation-of-daily-rainfall-by-using-a-pixel-value-data-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9889.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">391</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">26706</span> Conjunctive Management of Surface and Groundwater Resources under Uncertainty: A Retrospective Optimization Approach</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Julius%20M.%20Ndambuki">Julius M. Ndambuki</a>, <a href="https://publications.waset.org/abstracts/search?q=Gislar%20E.%20Kifanyi"> Gislar E. Kifanyi</a>, <a href="https://publications.waset.org/abstracts/search?q=Samuel%20N.%20Odai"> Samuel N. Odai</a>, <a href="https://publications.waset.org/abstracts/search?q=Charles%20Gyamfi"> Charles Gyamfi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conjunctive management of surface and groundwater resources is a challenging task due to the spatial and temporal variability nature of hydrology as well as hydrogeology of the water storage systems. Surface water-groundwater hydrogeology is highly uncertain; thus it is imperative that this uncertainty is explicitly accounted for, when managing water resources. Various methodologies have been developed and applied by researchers in an attempt to account for the uncertainty. For example, simulation-optimization models are often used for conjunctive water resources management. However, direct application of such an approach in which all realizations are considered at each iteration of the optimization process leads to a very expensive optimization in terms of computational time, particularly when the number of realizations is large. The aim of this paper, therefore, is to introduce and apply an efficient approach referred to as Retrospective Optimization Approximation (ROA) that can be used for optimizing conjunctive use of surface water and groundwater over a multiple hydrogeological model simulations. This work is based on stochastic simulation-optimization framework using a recently emerged technique of sample average approximation (SAA) which is a sampling based method implemented within the Retrospective Optimization Approximation (ROA) approach. The ROA approach solves and evaluates a sequence of generated optimization sub-problems in an increasing number of realizations (sample size). Response matrix technique was used for linking simulation model with optimization procedure. The k-means clustering sampling technique was used to map the realizations. The methodology is demonstrated through the application to a hypothetical example. In the example, the optimization sub-problems generated were solved and analysed using “Active-Set” core optimizer implemented under MATLAB 2014a environment. Through k-means clustering sampling technique, the ROA – Active Set procedure was able to arrive at a (nearly) converged maximum expected total optimal conjunctive water use withdrawal rate within a relatively few number of iterations (6 to 7 iterations). Results indicate that the ROA approach is a promising technique for optimizing conjunctive water use of surface water and groundwater withdrawal rates under hydrogeological uncertainty. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjunctive%20water%20management" title="conjunctive water management">conjunctive water management</a>, <a href="https://publications.waset.org/abstracts/search?q=retrospective%20optimization%20approximation%20approach" title=" retrospective optimization approximation approach"> retrospective optimization approximation approach</a>, <a href="https://publications.waset.org/abstracts/search?q=sample%20average%20approximation" title=" sample average approximation"> sample average approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=uncertainty" title=" uncertainty"> uncertainty</a> </p> <a href="https://publications.waset.org/abstracts/96298/conjunctive-management-of-surface-and-groundwater-resources-under-uncertainty-a-retrospective-optimization-approach" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/96298.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">235</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">26705</span> Correlates of Cost Effectiveness Analysis of Rating Scale and Psycho-Productive Multiple Choice Test for Assessing Students' Performance in Rice Production in Secondary Schools in Ebonyi State, Nigeria</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ogbonnaya%20%20Elom">Ogbonnaya Elom</a>, <a href="https://publications.waset.org/abstracts/search?q=Francis%20N.%20Azunku"> Francis N. Azunku</a>, <a href="https://publications.waset.org/abstracts/search?q=Ogochukwu%20%20Onah"> Ogochukwu Onah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study was carried out to determine the correlates of cost effectiveness analysis of rating scale and psycho-productive multiple choice test for assessing students’ performance in rice production. Four research questions were developed and answered, while one hypothesis was formulated and tested. Survey and correlation designs were adopted. The population of the study was 20,783 made up of 20,511 senior secondary (SSII) students and 272 teachers of agricultural science from 221 public secondary schools. Two schools with one intact class of 30 students each was purposely selected as sample based on certain criteria. Four sets of instruments were used for data collection. One of the instruments-the rating scale, was subjected to face and content validation while the other three were subjected to face validation only. Cronbach alpha technique was utilized to determine the internal consistency of the rating scale items which yielded a coefficient of 0.82 while the Kudder-Richardson (K-R 20) formula was involved in determining the stability of the psycho-productive multiple choice test items which yielded a coefficient of 0.80. Method of data collection involved a step-by-step approach in collecting data. Data collected were analyzed using percentage, weighted mean and sign test to answer the research questions while the hypothesis was tested using Spearman rank-order of correlation and t-test statistic. Findings of the study revealed among others, that psycho-productive multiple choice test is more effective than rating scale when the former is applied on the two groups of students. It was recommended among others, that the external examination bodies should integrate the use of psycho- productive multiple choice test into their examination policy and direct secondary schools to comply with it. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=correlates" title="correlates">correlates</a>, <a href="https://publications.waset.org/abstracts/search?q=cost-effectiveness" title=" cost-effectiveness"> cost-effectiveness</a>, <a href="https://publications.waset.org/abstracts/search?q=psycho-productive%20multiple-choice%20scale" title=" psycho-productive multiple-choice scale"> psycho-productive multiple-choice scale</a>, <a href="https://publications.waset.org/abstracts/search?q=rating%20scale" title=" rating scale"> rating scale</a> </p> <a href="https://publications.waset.org/abstracts/122334/correlates-of-cost-effectiveness-analysis-of-rating-scale-and-psycho-productive-multiple-choice-test-for-assessing-students-performance-in-rice-production-in-secondary-schools-in-ebonyi-state-nigeria" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/122334.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">147</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">26704</span> Mathematical and Numerical Analysis of a Reaction Diffusion System of Lambda-Omega Type</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hassan%20Al%20Salman">Hassan Al Salman</a>, <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Al%20Ghafli"> Ahmed Al Ghafli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this study we consider a nonlinear in time finite element approximation of a reaction diffusion system of lambda-omega type. We use a fixed point theorem to prove existence of the approximations. Then, we derive some essential stability estimates and discuss the uniqueness of the approximations. Also, we prove an optimal error bound in time for d=1, 2 and 3 space dimensions. Finally, we present some numerical experiments to verify the theoretical results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=reaction%20diffusion%20system" title="reaction diffusion system">reaction diffusion system</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20approximation" title=" finite element approximation"> finite element approximation</a>, <a href="https://publications.waset.org/abstracts/search?q=fixed%20point%20theorem" title=" fixed point theorem"> fixed point theorem</a>, <a href="https://publications.waset.org/abstracts/search?q=an%20optimal%20error%20bound" title=" an optimal error bound"> an optimal error bound</a> </p> <a href="https://publications.waset.org/abstracts/28731/mathematical-and-numerical-analysis-of-a-reaction-diffusion-system-of-lambda-omega-type" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28731.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">538</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">26703</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">206</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">26702</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">167</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">26701</span> Bayesian Using Markov Chain Monte Carlo and Lindley's Approximation Based on Type-I Censored Data</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Al%20Omari%20Moahmmed%20Ahmed">Al Omari Moahmmed Ahmed</a> </p> <p class="card-text"><strong>Abstract:</strong></p> These papers describe the Bayesian Estimator using Markov Chain Monte Carlo and Lindley’s approximation and the maximum likelihood estimation of the Weibull distribution with Type-I censored data. The maximum likelihood method can’t estimate the shape parameter in closed forms, although it can be solved by numerical methods. Moreover, the Bayesian estimates of the parameters, the survival and hazard functions cannot be solved analytically. Hence Markov Chain Monte Carlo method and Lindley’s approximation are used, where the full conditional distribution for the parameters of Weibull distribution are obtained via Gibbs sampling and Metropolis-Hastings algorithm (HM) followed by estimate the survival and hazard functions. The methods are compared to Maximum Likelihood counterparts and the comparisons are made with respect to the Mean Square Error (MSE) and absolute bias to determine the better method in scale and shape parameters, the survival and hazard functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=weibull%20distribution" title="weibull distribution">weibull distribution</a>, <a href="https://publications.waset.org/abstracts/search?q=bayesian%20method" title=" bayesian method"> bayesian method</a>, <a href="https://publications.waset.org/abstracts/search?q=markov%20chain%20mote%20carlo" title=" markov chain mote carlo"> markov chain mote carlo</a>, <a href="https://publications.waset.org/abstracts/search?q=survival%20and%20hazard%20functions" title=" survival and hazard functions"> survival and hazard functions</a> </p> <a href="https://publications.waset.org/abstracts/31291/bayesian-using-markov-chain-monte-carlo-and-lindleys-approximation-based-on-type-i-censored-data" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31291.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">486</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">26700</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">403</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=multiple%20time%20scale%20approximation&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiple%20time%20scale%20approximation&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiple%20time%20scale%20approximation&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiple%20time%20scale%20approximation&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiple%20time%20scale%20approximation&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiple%20time%20scale%20approximation&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiple%20time%20scale%20approximation&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiple%20time%20scale%20approximation&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiple%20time%20scale%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=multiple%20time%20scale%20approximation&page=890">890</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiple%20time%20scale%20approximation&page=891">891</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=multiple%20time%20scale%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">© 2025 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>