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: recursive least squares</title> <meta name="description" content="Search results for: recursive least squares"> <meta name="keywords" content="recursive least squares"> <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="recursive least squares" 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="recursive least squares"> <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> 405</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: recursive least squares</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">405</span> Online Estimation of Clutch Drag Torque in Wet Dual Clutch Transmission Based on Recursive Least Squares</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hongkui%20Li">Hongkui Li</a>, <a href="https://publications.waset.org/abstracts/search?q=Tongli%20Lu"> Tongli Lu </a>, <a href="https://publications.waset.org/abstracts/search?q=Jianwu%20Zhang"> Jianwu Zhang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper focuses on developing an estimation method of clutch drag torque in wet DCT. The modelling of clutch drag torque is investigated. As the main factor affecting the clutch drag torque, dynamic viscosity of oil is discussed. The paper proposes an estimation method of clutch drag torque based on recursive least squares by utilizing the dynamic equations of gear shifting synchronization process. The results demonstrate that the estimation method has good accuracy and efficiency. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=clutch%20drag%20torque" title="clutch drag torque">clutch drag torque</a>, <a href="https://publications.waset.org/abstracts/search?q=wet%20DCT" title=" wet DCT"> wet DCT</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20viscosity" title=" dynamic viscosity"> dynamic viscosity</a>, <a href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares" title=" recursive least squares"> recursive least squares</a> </p> <a href="https://publications.waset.org/abstracts/51881/online-estimation-of-clutch-drag-torque-in-wet-dual-clutch-transmission-based-on-recursive-least-squares" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/51881.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">318</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">404</span> Recursive Doubly Complementary Filter Design Using Particle Swarm Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ding-Chen%20Chung"> Ding-Chen Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the optimal design of recursive doubly complementary (DC) digital filter design using a metaheuristic based optimization technique. Based on the theory of DC digital filters using two recursive digital all-pass filters (DAFs), the design problem is appropriately formulated to result in an objective function which is a weighted sum of the phase response errors of the designed DAFs. To deal with the stability of the recursive DC filters during the design process, we can either impose some necessary constraints on the phases of the recursive DAFs. Through a frequency sampling and a weighted least squares approach, the optimization problem of the objective function can be solved by utilizing a population based stochastic optimization approach. The resulting DC digital filters can possess satisfactory frequency response. Simulation results are presented for illustration and comparison. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=doubly%20complementary" title="doubly complementary">doubly complementary</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20all-pass%20filter" title=" digital all-pass filter"> digital all-pass filter</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20least%20squares%20algorithm" title=" weighted least squares algorithm"> weighted least squares algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a> </p> <a href="https://publications.waset.org/abstracts/12469/recursive-doubly-complementary-filter-design-using-particle-swarm-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/12469.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">688</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">403</span> Recursive Parametric Identification of a Doubly Fed Induction Generator-Based Wind Turbine</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20El%20Kachani">A. El Kachani</a>, <a href="https://publications.waset.org/abstracts/search?q=E.%20Chakir"> E. Chakir</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Ait%20Laachir"> A. Ait Laachir</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Niaaniaa"> A. Niaaniaa</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20Zerouaoui"> J. Zerouaoui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This document presents an adaptive controller based on recursive parametric identification applied to a wind turbine based on the doubly-fed induction machine (DFIG), to compensate the faults and guarantee efficient of the DFIG. The proposed adaptive controller is based on the recursive least square algorithm which considers that the best estimator for the vector parameter is the vector x minimizing a quadratic criterion. Furthermore, this method can improve the rapidity and precision of the controller based on a model. The proposed controller is validated via simulation on a 5.5 kW DFIG-based wind turbine. The results obtained seem to be good. In addition, they show the advantages of an adaptive controller based on recursive least square algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20controller" title="adaptive controller">adaptive controller</a>, <a href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares%20algorithm" title=" recursive least squares algorithm"> recursive least squares algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=wind%20turbine" title=" wind turbine"> wind turbine</a>, <a href="https://publications.waset.org/abstracts/search?q=doubly%20fed%20induction%20generator" title=" doubly fed induction generator"> doubly fed induction generator</a> </p> <a href="https://publications.waset.org/abstracts/47239/recursive-parametric-identification-of-a-doubly-fed-induction-generator-based-wind-turbine" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/47239.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">288</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">402</span> Two-Dimensional Symmetric Half-Plane Recursive Doubly Complementary Digital Lattice Filters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Chong-Jia%20Ciou"> Chong-Jia Ciou</a>, <a href="https://publications.waset.org/abstracts/search?q=Yuan-Hau%20Yang"> Yuan-Hau Yang</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the problem of two-dimensional (2-D) recursive doubly complementary (DC) digital filter design. We present a structure of 2-D recursive DC filters by using 2-D symmetric half-plane (SHP) recursive digital all-pass lattice filters (DALFs). The novelty of using 2-D SHP recursive DALFs to construct a 2-D recursive DC digital lattice filter is that the resulting 2-D SHP recursive DC digital lattice filter provides better performance than the existing 2-D SHP recursive DC digital filter. Moreover, the proposed structure possesses a favorable 2-D DC half-band (DC-HB) property that allows about half of the 2-D SHP recursive DALF’s coefficients to be zero. This leads to considerable savings in computational burden for implementation. To ensure the stability of a designed 2-D SHP recursive DC digital lattice filter, some necessary constraints on the phase of the 2-D SHP recursive DALF during the design process are presented. Design of a 2-D diamond-shape decimation/interpolation filter is presented for illustration and comparison. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=all-pass%20digital%20filter" title="all-pass digital filter">all-pass digital filter</a>, <a href="https://publications.waset.org/abstracts/search?q=doubly%20complementary" title=" doubly complementary"> doubly complementary</a>, <a href="https://publications.waset.org/abstracts/search?q=lattice%20structure" title=" lattice structure"> lattice structure</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter" title=" symmetric half-plane digital filter"> symmetric half-plane digital filter</a>, <a href="https://publications.waset.org/abstracts/search?q=sampling%20rate%20conversion" title=" sampling rate conversion"> sampling rate conversion</a> </p> <a href="https://publications.waset.org/abstracts/40663/two-dimensional-symmetric-half-plane-recursive-doubly-complementary-digital-lattice-filters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40663.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">437</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">401</span> Design of Two-Channel Quincunx Quadrature Mirror Filter Banks Using Digital All-Pass Lattice Filters</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Chong-Jia%20Ciou"> Chong-Jia Ciou</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the problem of two-dimensional (2-D) recursive two-channel quincunx quadrature mirror filter (QQMF) banks design. The analysis and synthesis filters of the 2-D recursive QQMF bank are composed of 2-D recursive digital allpass lattice filters (DALFs) with symmetric half-plane (SHP) support regions. Using the 2-D doubly complementary half-band (DC-HB) property possessed by the analysis and synthesis filters, we facilitate the design of the proposed QQMF bank. For finding the coefficients of the 2-D recursive SHP DALFs, we present a structure of 2-D recursive digital allpass filters by using 2-D SHP recursive digital all-pass lattice filters (DALFs). The novelty of using 2-D SHP recursive DALFs to construct a 2-D recursive QQMF bank is that the resulting 2-D recursive QQMF bank provides better performance than the existing 2-D recursive QQMF banks. Simulation results are also presented for illustration and comparison. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=all-pass%20digital%20filter" title="all-pass digital filter">all-pass digital filter</a>, <a href="https://publications.waset.org/abstracts/search?q=lattice%20structure" title=" lattice structure"> lattice structure</a>, <a href="https://publications.waset.org/abstracts/search?q=quincunx%20QMF%20bank" title=" quincunx QMF bank"> quincunx QMF bank</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetric%20half-plane%20digital%20filter" title=" symmetric half-plane digital filter"> symmetric half-plane digital filter</a> </p> <a href="https://publications.waset.org/abstracts/58323/design-of-two-channel-quincunx-quadrature-mirror-filter-banks-using-digital-all-pass-lattice-filters" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/58323.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">359</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">400</span> Dynamic Process Monitoring of an Ammonia Synthesis Fixed-Bed Reactor</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Bothinah%20Altaf">Bothinah Altaf</a>, <a href="https://publications.waset.org/abstracts/search?q=Gary%20Montague"> Gary Montague</a>, <a href="https://publications.waset.org/abstracts/search?q=Elaine%20B.%20Martin"> Elaine B. Martin</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study involves the modeling and monitoring of an ammonia synthesis fixed-bed reactor using partial least squares (PLS) and its variants. The process exhibits complex dynamic behavior due to the presence of heat recycling and feed quench. One limitation of static PLS model in this situation is that it does not take account of the process dynamics and hence dynamic PLS was used. Although it showed, superior performance to static PLS in terms of prediction, the monitoring scheme was inappropriate hence adaptive PLS was considered. A limitation of adaptive PLS is that non-conforming observations also contribute to the model, therefore, a new adaptive approach was developed, robust adaptive dynamic PLS. This approach updates a dynamic PLS model and is robust to non-representative data. The developed methodology showed a clear improvement over existing approaches in terms of the modeling of the reactor and the detection of faults. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ammonia%20synthesis%20fixed-bed%20reactor" title="ammonia synthesis fixed-bed reactor">ammonia synthesis fixed-bed reactor</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20partial%20least%20squares%20modeling" title=" dynamic partial least squares modeling"> dynamic partial least squares modeling</a>, <a href="https://publications.waset.org/abstracts/search?q=recursive%20partial%20least%20squares" title=" recursive partial least squares"> recursive partial least squares</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20modeling" title=" robust modeling"> robust modeling</a> </p> <a href="https://publications.waset.org/abstracts/37994/dynamic-process-monitoring-of-an-ammonia-synthesis-fixed-bed-reactor" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/37994.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">393</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">399</span> Genetic Algorithm to Construct and Enumerate 4×4 Pan-Magic Squares</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Younis%20R.%20Elhaddad">Younis R. Elhaddad</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20A.%20Alshaari"> Mohamed A. Alshaari</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Since 2700 B.C the problem of constructing magic squares attracts many researchers. Magic squares one of most difficult challenges for mathematicians. In this work, we describe how to construct and enumerate Pan- magic squares using genetic algorithm, using new chromosome encoding technique. The results were promising within reasonable time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=magic%20square" title=" magic square"> magic square</a>, <a href="https://publications.waset.org/abstracts/search?q=pan-magic%20square" title=" pan-magic square"> pan-magic square</a>, <a href="https://publications.waset.org/abstracts/search?q=computational%20intelligence" title=" computational intelligence"> computational intelligence</a> </p> <a href="https://publications.waset.org/abstracts/2917/genetic-algorithm-to-construct-and-enumerate-44-pan-magic-squares" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/2917.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">576</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">398</span> Channel Estimation for LTE Downlink</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rashi%20Jain">Rashi Jain</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The LTE systems employ Orthogonal Frequency Division Multiplexing (OFDM) as the multiple access technology for the Downlink channels. For enhanced performance, accurate channel estimation is required. Various algorithms such as Least Squares (LS), Minimum Mean Square Error (MMSE) and Recursive Least Squares (RLS) can be employed for the purpose. The paper proposes channel estimation algorithm based on Kalman Filter for LTE-Downlink system. Using the frequency domain pilots, the initial channel response is obtained using the LS criterion. Then Kalman Filter is employed to track the channel variations in time-domain. To suppress the noise within a symbol, threshold processing is employed. The paper draws comparison between the LS, MMSE, RLS and Kalman filter for channel estimation. The parameters for evaluation are Bit Error Rate (BER), Mean Square Error (MSE) and run-time. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=LTE" title="LTE">LTE</a>, <a href="https://publications.waset.org/abstracts/search?q=channel%20estimation" title=" channel estimation"> channel estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=OFDM" title=" OFDM"> OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=RLS" title=" RLS"> RLS</a>, <a href="https://publications.waset.org/abstracts/search?q=Kalman%20filter" title=" Kalman filter"> Kalman filter</a>, <a href="https://publications.waset.org/abstracts/search?q=threshold" title=" threshold"> threshold</a> </p> <a href="https://publications.waset.org/abstracts/9169/channel-estimation-for-lte-downlink" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9169.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">356</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">397</span> Equity Risk Premiums and Risk Free Rates in Modelling and Prediction of Financial Markets</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Ghavami">Mohammad Ghavami</a>, <a href="https://publications.waset.org/abstracts/search?q=Reza%20S.%20Dilmaghani"> Reza S. Dilmaghani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents an adaptive framework for modelling financial markets using equity risk premiums, risk free rates and volatilities. The recorded economic factors are initially used to train four adaptive filters for a certain limited period of time in the past. Once the systems are trained, the adjusted coefficients are used for modelling and prediction of an important financial market index. Two different approaches based on least mean squares (LMS) and recursive least squares (RLS) algorithms are investigated. Performance analysis of each method in terms of the mean squared error (MSE) is presented and the results are discussed. Computer simulations carried out using recorded data show MSEs of 4% and 3.4% for the next month prediction using LMS and RLS adaptive algorithms, respectively. In terms of twelve months prediction, RLS method shows a better tendency estimation compared to the LMS algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20methods" title="adaptive methods">adaptive methods</a>, <a href="https://publications.waset.org/abstracts/search?q=LSE" title=" LSE"> LSE</a>, <a href="https://publications.waset.org/abstracts/search?q=MSE" title=" MSE"> MSE</a>, <a href="https://publications.waset.org/abstracts/search?q=prediction%20of%20financial%20Markets" title=" prediction of financial Markets"> prediction of financial Markets</a> </p> <a href="https://publications.waset.org/abstracts/72693/equity-risk-premiums-and-risk-free-rates-in-modelling-and-prediction-of-financial-markets" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/72693.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">336</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">396</span> Least Squares Method Identification of Corona Current-Voltage Characteristics and Electromagnetic Field in Electrostatic Precipitator</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=H.%20Nouri">H. Nouri</a>, <a href="https://publications.waset.org/abstracts/search?q=I.%20E.%20Achouri"> I. E. Achouri</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Grimes"> A. Grimes</a>, <a href="https://publications.waset.org/abstracts/search?q=H.%20Ait%20Said"> H. Ait Said</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Aissou"> M. Aissou</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Zebboudj"> Y. Zebboudj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper aims to analysis the behaviour of DC corona discharge in wire-to-plate electrostatic precipitators (ESP). Current-voltage curves are particularly analysed. Experimental results show that discharge current is strongly affected by the applied voltage. The proposed method of current identification is to use the method of least squares. Least squares problems that of into two categories: linear or ordinary least squares and non-linear least squares, depending on whether or not the residuals are linear in all unknowns. The linear least-squares problem occurs in statistical regression analysis; it has a closed-form solution. A closed-form solution (or closed form expression) is any formula that can be evaluated in a finite number of standard operations. The non-linear problem has no closed-form solution and is usually solved by iterative. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=electrostatic%20precipitator" title="electrostatic precipitator">electrostatic precipitator</a>, <a href="https://publications.waset.org/abstracts/search?q=current-voltage%20characteristics" title=" current-voltage characteristics"> current-voltage characteristics</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20squares%20method" title=" least squares method"> least squares method</a>, <a href="https://publications.waset.org/abstracts/search?q=electric%20field" title=" electric field"> electric field</a>, <a href="https://publications.waset.org/abstracts/search?q=magnetic%20field" title=" magnetic field"> magnetic field</a> </p> <a href="https://publications.waset.org/abstracts/39751/least-squares-method-identification-of-corona-current-voltage-characteristics-and-electromagnetic-field-in-electrostatic-precipitator" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/39751.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">431</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">395</span> Online Prediction of Nonlinear Signal Processing Problems Based Kernel Adaptive Filtering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hamza%20Nejib">Hamza Nejib</a>, <a href="https://publications.waset.org/abstracts/search?q=Okba%20Taouali"> Okba Taouali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents two of the most knowing kernel adaptive filtering (KAF) approaches, the kernel least mean squares and the kernel recursive least squares, in order to predict a new output of nonlinear signal processing. Both of these methods implement a nonlinear transfer function using kernel methods in a particular space named reproducing kernel Hilbert space (RKHS) where the model is a linear combination of kernel functions applied to transform the observed data from the input space to a high dimensional feature space of vectors, this idea known as the kernel trick. Then KAF is the developing filters in RKHS. We use two nonlinear signal processing problems, Mackey Glass chaotic time series prediction and nonlinear channel equalization to figure the performance of the approaches presented and finally to result which of them is the adapted one. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=online%20prediction" title="online prediction">online prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=KAF" title=" KAF"> KAF</a>, <a href="https://publications.waset.org/abstracts/search?q=signal%20processing" title=" signal processing"> signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=RKHS" title=" RKHS"> RKHS</a>, <a href="https://publications.waset.org/abstracts/search?q=Kernel%20methods" title=" Kernel methods"> Kernel methods</a>, <a href="https://publications.waset.org/abstracts/search?q=KRLS" title=" KRLS"> KRLS</a>, <a href="https://publications.waset.org/abstracts/search?q=KLMS" title=" KLMS"> KLMS</a> </p> <a href="https://publications.waset.org/abstracts/63627/online-prediction-of-nonlinear-signal-processing-problems-based-kernel-adaptive-filtering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/63627.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">399</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">394</span> Nonuniformity Correction Technique in Infrared Video Using Feedback Recursive Least Square Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Flavio%20O.%20Torres">Flavio O. Torres</a>, <a href="https://publications.waset.org/abstracts/search?q=Maria%20J.%20Castilla"> Maria J. Castilla</a>, <a href="https://publications.waset.org/abstracts/search?q=Rodrigo%20A.%20Augsburger"> Rodrigo A. Augsburger</a>, <a href="https://publications.waset.org/abstracts/search?q=Pedro%20I.%20Cachana"> Pedro I. Cachana</a>, <a href="https://publications.waset.org/abstracts/search?q=Katherine%20S.%20Reyes"> Katherine S. Reyes</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present a scene-based nonuniformity correction method using a modified recursive least square algorithm with a feedback system on the updates. The feedback is designed to remove impulsive noise contamination images produced by a recursive least square algorithm by measuring the output of the proposed algorithm. The key advantage of the method is based on its capacity to estimate detectors parameters and then compensate for impulsive noise contamination image in a frame by frame basics. We define the algorithm and present several experimental results to demonstrate the efficacy of the proposed method in comparison to several previously published recursive least square-based methods. We show that the proposed method removes impulsive noise contamination image. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=infrared%20focal%20plane%20arrays" title="infrared focal plane arrays">infrared focal plane arrays</a>, <a href="https://publications.waset.org/abstracts/search?q=infrared%20imaging" title=" infrared imaging"> infrared imaging</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20mean%20square" title=" least mean square"> least mean square</a>, <a href="https://publications.waset.org/abstracts/search?q=nonuniformity%20correction" title=" nonuniformity correction"> nonuniformity correction</a> </p> <a href="https://publications.waset.org/abstracts/131681/nonuniformity-correction-technique-in-infrared-video-using-feedback-recursive-least-square-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/131681.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">393</span> Capital Mobility in Savings and Investment across China and the ASEAN-5: Evidence from Recursive Cointegration</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chang%20Lee%20Shu-Jung">Chang Lee Shu-Jung</a>, <a href="https://publications.waset.org/abstracts/search?q=Mei-Se%20Chien"> Mei-Se Chien</a>, <a href="https://publications.waset.org/abstracts/search?q=Chien-Chiang%20Lee"> Chien-Chiang Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Hui-Ting%20Hu"> Hui-Ting Hu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper applies recursive cointegration analysis to examine the dynamic changes in Feldstein-Horioka saving-investment (S-I) coefficients across China and the ASEAN-5 countries over time. To the extent that the S-I coefficients measure international capital mobility, the main empirical results are as follows. The recursive trace statistics show that the investment- savings nexus varies in these six countries. There is no cointegration between investment and savings in three countries (China, Malaysia, and Singapore), which means that the mobility of the capital markets in the three is high and that domestic investment in them will be financed by the global pool of capital. As to the other three countries (Indonesia, Thailand, and Philippines), there is cointegration between investment and savings for part of the sample period in the three, including before 2002 for Thailand, before 2001 for Indonesia, and before 2002 for Philippines. This shows these three countries achieved highly mobile and open capital markets later. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=investment" title="investment">investment</a>, <a href="https://publications.waset.org/abstracts/search?q=savings" title=" savings"> savings</a>, <a href="https://publications.waset.org/abstracts/search?q=recursive%20cointegration%20test" title=" recursive cointegration test"> recursive cointegration test</a>, <a href="https://publications.waset.org/abstracts/search?q=ASEAN" title=" ASEAN"> ASEAN</a>, <a href="https://publications.waset.org/abstracts/search?q=China" title=" China "> China </a> </p> <a href="https://publications.waset.org/abstracts/7538/capital-mobility-in-savings-and-investment-across-china-and-the-asean-5-evidence-from-recursive-cointegration" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7538.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">552</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">392</span> Implementation of the Recursive Formula for Evaluation of the Strength of Daniels' Bundle</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vaclav%20Sadilek">Vaclav Sadilek</a>, <a href="https://publications.waset.org/abstracts/search?q=Miroslav%20Vorechovsky"> Miroslav Vorechovsky</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper deals with the classical fiber bundle model of equal load sharing, sometimes referred to as the Daniels' bundle or the democratic bundle. Daniels formulated a multidimensional integral and also a recursive formula for evaluation of the strength cumulative distribution function. This paper describes three algorithms for evaluation of the recursive formula and also their implementations with source codes in high-level programming language Python. A comparison of the algorithms are provided with respect to execution time. Analysis of orders of magnitudes of addends in the recursion is also provided. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=equal%20load%20sharing" title="equal load sharing">equal load sharing</a>, <a href="https://publications.waset.org/abstracts/search?q=mpmath" title=" mpmath"> mpmath</a>, <a href="https://publications.waset.org/abstracts/search?q=python" title=" python"> python</a>, <a href="https://publications.waset.org/abstracts/search?q=strength%20of%20Daniels%27%20bundle" title=" strength of Daniels' bundle"> strength of Daniels' bundle</a> </p> <a href="https://publications.waset.org/abstracts/27514/implementation-of-the-recursive-formula-for-evaluation-of-the-strength-of-daniels-bundle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27514.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">404</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">391</span> Evolution of Multimodulus Algorithm Blind Equalization Based on Recursive Least Square Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sardar%20Ameer%20Akram%20Khan">Sardar Ameer Akram Khan</a>, <a href="https://publications.waset.org/abstracts/search?q=Shahzad%20Amin%20Sheikh"> Shahzad Amin Sheikh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Blind equalization is an important technique amongst equalization family. Multimodulus algorithms based on blind equalization removes the undesirable effects of ISI and cater ups the phase issues, saving the cost of rotator at the receiver end. In this paper a new algorithm combination of recursive least square and Multimodulus algorithm named as RLSMMA is proposed by providing few assumption, fast convergence and minimum Mean Square Error (MSE) is achieved. The excellence of this technique is shown in the simulations presenting MSE plots and the resulting filter results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=blind%20equalizations" title="blind equalizations">blind equalizations</a>, <a href="https://publications.waset.org/abstracts/search?q=constant%20modulus%20algorithm" title=" constant modulus algorithm"> constant modulus algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-modulus%20algorithm" title=" multi-modulus algorithm"> multi-modulus algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=recursive%20%20least%20square%20algorithm" title=" recursive least square algorithm"> recursive least square algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=quadrature%20amplitude%20modulation%20%28QAM%29" title=" quadrature amplitude modulation (QAM)"> quadrature amplitude modulation (QAM)</a> </p> <a href="https://publications.waset.org/abstracts/24704/evolution-of-multimodulus-algorithm-blind-equalization-based-on-recursive-least-square-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24704.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">644</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">390</span> Quadrature Mirror Filter Bank Design Using Population Based Stochastic Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ju-Hong%20Lee">Ju-Hong Lee</a>, <a href="https://publications.waset.org/abstracts/search?q=Ding-Chen%20Chung"> Ding-Chen Chung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper deals with the optimal design of two-channel linear-phase (LP) quadrature mirror filter (QMF) banks using a metaheuristic based optimization technique. Based on the theory of two-channel QMF banks using two recursive digital all-pass filters (DAFs), the design problem is appropriately formulated to result in an objective function which is a weighted sum of the group delay error of the designed QMF bank and the magnitude response error of the designed low-pass analysis filter. Through a frequency sampling and a weighted least squares approach, the optimization problem of the objective function can be solved by utilizing a particle swarm optimization algorithm. The resulting two-channel QMF banks can possess approximately LP response without magnitude distortion. Simulation results are presented for illustration and comparison. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=quadrature%20mirror%20filter%20bank" title="quadrature mirror filter bank">quadrature mirror filter bank</a>, <a href="https://publications.waset.org/abstracts/search?q=digital%20all-pass%20filter" title=" digital all-pass filter"> digital all-pass filter</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20least%20squares%20algorithm" title=" weighted least squares algorithm"> weighted least squares algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a> </p> <a href="https://publications.waset.org/abstracts/6051/quadrature-mirror-filter-bank-design-using-population-based-stochastic-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6051.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">521</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">389</span> Ultracapacitor State-of-Energy Monitoring System with On-Line Parameter Identification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=N.%20Reichbach">N. Reichbach</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20Kuperman"> A. Kuperman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper describes a design of a monitoring system for super capacitor packs in propulsion systems, allowing determining the instantaneous energy capacity under power loading. The system contains real-time recursive-least-squares identification mechanism, estimating the values of pack capacitance and equivalent series resistance. These values are required for accurate calculation of the state-of-energy. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=real-time%20monitoring" title="real-time monitoring">real-time monitoring</a>, <a href="https://publications.waset.org/abstracts/search?q=RLS%20identification%20algorithm" title=" RLS identification algorithm"> RLS identification algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=state-of-energy" title=" state-of-energy"> state-of-energy</a>, <a href="https://publications.waset.org/abstracts/search?q=super%20capacitor" title=" super capacitor"> super capacitor</a> </p> <a href="https://publications.waset.org/abstracts/13043/ultracapacitor-state-of-energy-monitoring-system-with-on-line-parameter-identification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13043.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">388</span> Public Squares and Their Potential for Social Interactions: A Case Study of Historical Public Squares in Tehran</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Asma%20Mehan">Asma Mehan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Under the thrust of technological changes, population growth and vehicular traffic, Iranian historical squares have lost their significance and they are no longer the main social nodes of the society. This research focuses on how historical public squares can inspire designers to enhance social interactions among citizens in Iranian urban context. Moreover, the recent master plan of Tehran demonstrates the lack of public spaces designed for the purpose of people’s social gatherings. For filling this gap, first the current situation of 7 selected primary historical public squares in Tehran including Sabze Meydan, Arg, Topkhaneh, Baherstan, Mokhber-al-dole, Rah Ahan and Hassan Abad have been compared. Later, the influencing elements on social interactions of the public squares such as subjective factors (human relationships and memories) and objective factors (natural and built environment) have been investigated. As a conclusion, some strategies are proposed for improving social interactions in historical public squares like; holding cultural, national, athletic and religious events, defining different and new functions in public squares’ surrounding, increasing pedestrian routs, reviving the collective memory, demonstrating the historical importance of square, eliminating visual obstacles across the square, organization the natural elements of the square, appropriate pavement for social activities. Finally, it is argued that the combination of all influencing factors which are: human interactions, natural elements and built environment criteria will lead to enhance the historical public squares’ potential for social interaction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=historical%20square" title="historical square">historical square</a>, <a href="https://publications.waset.org/abstracts/search?q=Iranian%20public%20square" title=" Iranian public square"> Iranian public square</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20interaction" title=" social interaction"> social interaction</a>, <a href="https://publications.waset.org/abstracts/search?q=Tehran" title=" Tehran"> Tehran</a> </p> <a href="https://publications.waset.org/abstracts/45172/public-squares-and-their-potential-for-social-interactions-a-case-study-of-historical-public-squares-in-tehran" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/45172.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">405</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">387</span> Suboptimal Retiree Allocations with Housing </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Asiye%20Aydilek">Asiye Aydilek</a>, <a href="https://publications.waset.org/abstracts/search?q=Harun%20Aydilek"> Harun Aydilek</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We investigate the costs of various suboptimal allocations in housing, consumption, bond and stock holdings of a retiree in a setting with recursive utility, considering the extensive empirical evidence that investors make suboptimal decisions in different ways. We find that suboptimal stock holdings impose only modest costs on the retiree. This may have a merit in explaining the limited stock investment in the data. The cost of suboptimal bond holdings is higher than that of stocks, but still small. This may partially explain why many more people hold bonds compared to stocks. We find that positive deviations from the optimal level are less costly relative to the negative ones in suboptimal housing allocations. This may help us to clarify why the elderly are over consuming housing, as seen in the housing data. The cost of suboptimal consumption is quite high and the highest of all. Our paper suggests that, in terms of welfare, the decisions of how much of liquid wealth to use for consumption and for saving are more important than the decision about the composition of liquid savings. Suboptimal stock holdings are twice more costly in power utility and suboptimal bond holdings are twenty times more costly in recursive utility. Recursive utility is superior to power utility in terms of rationalizing many people's preference for bonds instead of stocks in investment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=housing" title="housing">housing</a>, <a href="https://publications.waset.org/abstracts/search?q=recursive%20utility" title=" recursive utility"> recursive utility</a>, <a href="https://publications.waset.org/abstracts/search?q=retirement" title=" retirement"> retirement</a>, <a href="https://publications.waset.org/abstracts/search?q=suboptimal%20decisions" title=" suboptimal decisions"> suboptimal decisions</a>, <a href="https://publications.waset.org/abstracts/search?q=welfare%20cost" title=" welfare cost"> welfare cost</a> </p> <a href="https://publications.waset.org/abstracts/29920/suboptimal-retiree-allocations-with-housing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/29920.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">317</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">386</span> Identification and Control the Yaw Motion Dynamics of Open Frame Underwater Vehicle </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mirza%20Mohibulla%20Baig">Mirza Mohibulla Baig</a>, <a href="https://publications.waset.org/abstracts/search?q=Imil%20Hamda%20Imran"> Imil Hamda Imran</a>, <a href="https://publications.waset.org/abstracts/search?q=Tri%20Bagus%20Susilo"> Tri Bagus Susilo</a>, <a href="https://publications.waset.org/abstracts/search?q=Sami%20El%20Ferik"> Sami El Ferik</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The paper deals with system identification and control a nonlinear model of semi-autonomous underwater vehicle (UUV). The input-output data is first generated using the experimental values of the model parameters and then this data is used to compute the estimated parameter values. In this study, we use the semi-autonomous UUV LAURS model, which is developed by the Sensors and Actuators Laboratory in University of Sao Paolo. We applied three methods to identify the parameters: integral method, which is a classical least square method, recursive least square, and weighted recursive least square. In this paper, we also apply three different inputs (step input, sine wave input and random input) to each identification method. After the identification stage, we investigate the control performance of yaw motion of nonlinear semi-autonomous Unmanned Underwater Vehicle (UUV) using feedback linearization-based controller. In addition, we compare the performance of the control with an integral and a non-integral part along with state feedback. Finally, disturbance rejection and resilience of the controller is tested. The results demonstrate the ability of the system to recover from such fault. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=system%20identification" title="system identification">system identification</a>, <a href="https://publications.waset.org/abstracts/search?q=underwater%20vehicle" title=" underwater vehicle"> underwater vehicle</a>, <a href="https://publications.waset.org/abstracts/search?q=integral%20method" title=" integral method"> integral method</a>, <a href="https://publications.waset.org/abstracts/search?q=recursive%20least%20square" title=" recursive least square"> recursive least square</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20recursive%20least%20square" title=" weighted recursive least square"> weighted recursive least square</a>, <a href="https://publications.waset.org/abstracts/search?q=feedback%20linearization" title=" feedback linearization"> feedback linearization</a>, <a href="https://publications.waset.org/abstracts/search?q=integral%20error" title=" integral error"> integral error</a> </p> <a href="https://publications.waset.org/abstracts/21830/identification-and-control-the-yaw-motion-dynamics-of-open-frame-underwater-vehicle" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/21830.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">385</span> Variogram Fitting Based on the Wilcoxon Norm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Hazem%20Al-Mofleh">Hazem Al-Mofleh</a>, <a href="https://publications.waset.org/abstracts/search?q=John%20Daniels"> John Daniels</a>, <a href="https://publications.waset.org/abstracts/search?q=Joseph%20McKean"> Joseph McKean</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Within geostatistics research, effective estimation of the variogram points has been examined, particularly in developing robust alternatives. The parametric fit of these variogram points which eventually defines the kriging weights, however, has not received the same attention from a robust perspective. This paper proposes the use of the non-linear Wilcoxon norm over weighted non-linear least squares as a robust variogram fitting alternative. First, we introduce the concept of variogram estimation and fitting. Then, as an alternative to non-linear weighted least squares, we discuss the non-linear Wilcoxon estimator. Next, the robustness properties of the non-linear Wilcoxon are demonstrated using a contaminated spatial data set. Finally, under simulated conditions, increasing levels of contaminated spatial processes have their variograms points estimated and fit. In the fitting of these variogram points, both non-linear Weighted Least Squares and non-linear Wilcoxon fits are examined for efficiency. At all levels of contamination (including 0%), using a robust estimation and robust fitting procedure, the non-weighted Wilcoxon outperforms weighted Least Squares. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non-linear%20wilcoxon" title="non-linear wilcoxon">non-linear wilcoxon</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20estimation" title=" robust estimation"> robust estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=variogram%20estimation" title=" variogram estimation"> variogram estimation</a>, <a href="https://publications.waset.org/abstracts/search?q=wilcoxon%20norm" title=" wilcoxon norm"> wilcoxon norm</a> </p> <a href="https://publications.waset.org/abstracts/50377/variogram-fitting-based-on-the-wilcoxon-norm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50377.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">458</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">384</span> Genetic Algorithms for Parameter Identification of DC Motor ARMAX Model and Optimal Control</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=A.%20Mansouri">A. Mansouri</a>, <a href="https://publications.waset.org/abstracts/search?q=F.%20Krim"> F. Krim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents two techniques for DC motor parameters identification. We propose a numerical method using the adaptive extensive recursive least squares (AERLS) algorithm for real time parameters estimation. This algorithm, based on minimization of quadratic criterion, is realized in simulation for parameters identification of DC motor autoregressive moving average with extra inputs (ARMAX). As advanced technique, we use genetic algorithms (GA) identification with biased estimation for high dynamic performance speed regulation. DC motors are extensively used in variable speed drives, for robot and solar panel trajectory control. GA effectiveness is derived through comparison of the two approaches. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=ARMAX%20model" title="ARMAX model">ARMAX model</a>, <a href="https://publications.waset.org/abstracts/search?q=DC%20motor" title=" DC motor"> DC motor</a>, <a href="https://publications.waset.org/abstracts/search?q=AERLS" title=" AERLS"> AERLS</a>, <a href="https://publications.waset.org/abstracts/search?q=GA" title=" GA"> GA</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=parameter%20identification" title=" parameter identification"> parameter identification</a>, <a href="https://publications.waset.org/abstracts/search?q=PID%20speed%20regulation" title=" PID speed regulation"> PID speed regulation</a> </p> <a href="https://publications.waset.org/abstracts/9107/genetic-algorithms-for-parameter-identification-of-dc-motor-armax-model-and-optimal-control" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/9107.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">383</span> Hybrid Artificial Bee Colony and Least Squares Method for Rule-Based Systems Learning</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahcene%20Habbi">Ahcene Habbi</a>, <a href="https://publications.waset.org/abstracts/search?q=Yassine%20Boudouaoui"> Yassine Boudouaoui</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with the problem of automatic rule generation for fuzzy systems design. The proposed approach is based on hybrid artificial bee colony (ABC) optimization and weighted least squares (LS) method and aims to find the structure and parameters of fuzzy systems simultaneously. More precisely, two ABC based fuzzy modeling strategies are presented and compared. The first strategy uses global optimization to learn fuzzy models, the second one hybridizes ABC and weighted least squares estimate method. The performances of the proposed ABC and ABC-LS fuzzy modeling strategies are evaluated on complex modeling problems and compared to other advanced modeling methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=automatic%20design" title="automatic design">automatic design</a>, <a href="https://publications.waset.org/abstracts/search?q=learning" title=" learning"> learning</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20rules" title=" fuzzy rules"> fuzzy rules</a>, <a href="https://publications.waset.org/abstracts/search?q=hybrid" title=" hybrid"> hybrid</a>, <a href="https://publications.waset.org/abstracts/search?q=swarm%20optimization" title=" swarm optimization"> swarm optimization</a> </p> <a href="https://publications.waset.org/abstracts/15603/hybrid-artificial-bee-colony-and-least-squares-method-for-rule-based-systems-learning" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15603.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">437</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">382</span> Digital Twin of Real Electrical Distribution System with Real Time Recursive Load Flow Calculation and State Estimation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Anosh%20Arshad%20Sundhu">Anosh Arshad Sundhu</a>, <a href="https://publications.waset.org/abstracts/search?q=Francesco%20Giordano"> Francesco Giordano</a>, <a href="https://publications.waset.org/abstracts/search?q=Giacomo%20Della%20Croce"> Giacomo Della Croce</a>, <a href="https://publications.waset.org/abstracts/search?q=Maurizio%20Arnone"> Maurizio Arnone</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Digital Twin (DT) is a technology that generates a virtual representation of a physical system or process, enabling real-time monitoring, analysis, and simulation. DT of an Electrical Distribution System (EDS) can perform online analysis by integrating the static and real-time data in order to show the current grid status and predictions about the future status to the Distribution System Operator (DSO), producers and consumers. DT technology for EDS also offers the opportunity to DSO to test hypothetical scenarios. This paper discusses the development of a DT of an EDS by Smart Grid Controller (SGC) application, which is developed using open-source libraries and languages. The developed application can be integrated with Supervisory Control and Data Acquisition System (SCADA) of any EDS for creating the DT. The paper shows the performance of developed tools inside the application, tested on real EDS for grid observability, Smart Recursive Load Flow (SRLF) calculation and state estimation of loads in MV feeders. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=digital%20twin" title="digital twin">digital twin</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20energy%20resources" title=" distributed energy resources"> distributed energy resources</a>, <a href="https://publications.waset.org/abstracts/search?q=remote%20terminal%20units" title=" remote terminal units"> remote terminal units</a>, <a href="https://publications.waset.org/abstracts/search?q=supervisory%20control%20and%20data%20acquisition%20system" title=" supervisory control and data acquisition system"> supervisory control and data acquisition system</a>, <a href="https://publications.waset.org/abstracts/search?q=smart%20recursive%20load%20flow" title=" smart recursive load flow"> smart recursive load flow</a> </p> <a href="https://publications.waset.org/abstracts/166498/digital-twin-of-real-electrical-distribution-system-with-real-time-recursive-load-flow-calculation-and-state-estimation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/166498.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">110</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">381</span> Reduction of Impulsive Noise in OFDM System using Adaptive Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Alina%20Mirza">Alina Mirza</a>, <a href="https://publications.waset.org/abstracts/search?q=Sumrin%20M.%20Kabir"> Sumrin M. Kabir</a>, <a href="https://publications.waset.org/abstracts/search?q=Shahzad%20A.%20Sheikh"> Shahzad A. Sheikh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Orthogonal Frequency Division Multiplexing (OFDM) with high data rate, high spectral efficiency and its ability to mitigate the effects of multipath makes them most suitable in wireless application. Impulsive noise distorts the OFDM transmission and therefore methods must be investigated to suppress this noise. In this paper, a State Space Recursive Least Square (SSRLS) algorithm based adaptive impulsive noise suppressor for OFDM communication system is proposed. And a comparison with another adaptive algorithm is conducted. The state space model-dependent recursive parameters of proposed scheme enables to achieve steady state mean squared error (MSE), low bit error rate (BER), and faster convergence than that of some of existing algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=OFDM" title="OFDM">OFDM</a>, <a href="https://publications.waset.org/abstracts/search?q=impulsive%20noise" title=" impulsive noise"> impulsive noise</a>, <a href="https://publications.waset.org/abstracts/search?q=SSRLS" title=" SSRLS"> SSRLS</a>, <a href="https://publications.waset.org/abstracts/search?q=BER" title=" BER"> BER</a> </p> <a href="https://publications.waset.org/abstracts/31478/reduction-of-impulsive-noise-in-ofdm-system-using-adaptive-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/31478.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">457</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">380</span> A Simple Recursive Framework to Generate Gray Codes for Weak Orders in Constant Amortized Time </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marsden%20Jacques">Marsden Jacques</a>, <a href="https://publications.waset.org/abstracts/search?q=Dennis%20Wong"> Dennis Wong</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A weak order is a way to rank n objects where ties are allowed. In this talk, we present a recursive framework to generate Gray codes for weak orders. We then describe a simple algorithm based on the framework that generates 2-Gray codes for weak orders in constant amortized time per string. This framework can easily be modified to generate other Gray codes for weak orders. We provide an example on using the framework to generate the first Shift Gray code for weak orders, also in constant amortized time, where consecutive strings differ by a shift or a symbol change. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=weak%20order" title="weak order">weak order</a>, <a href="https://publications.waset.org/abstracts/search?q=Cayley%20permutation" title=" Cayley permutation"> Cayley permutation</a>, <a href="https://publications.waset.org/abstracts/search?q=Gray%20code" title=" Gray code"> Gray code</a>, <a href="https://publications.waset.org/abstracts/search?q=shift%20Gray%20code" title=" shift Gray code"> shift Gray code</a> </p> <a href="https://publications.waset.org/abstracts/118752/a-simple-recursive-framework-to-generate-gray-codes-for-weak-orders-in-constant-amortized-time" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118752.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">178</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">379</span> A Novel RLS Based Adaptive Filtering Method for Speech Enhancement</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pogula%20Rakesh">Pogula Rakesh</a>, <a href="https://publications.waset.org/abstracts/search?q=T.%20Kishore%20Kumar"> T. Kishore Kumar</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Speech enhancement is a long standing problem with numerous applications like teleconferencing, VoIP, hearing aids, and speech recognition. The motivation behind this research work is to obtain a clean speech signal of higher quality by applying the optimal noise cancellation technique. Real-time adaptive filtering algorithms seem to be the best candidate among all categories of the speech enhancement methods. In this paper, we propose a speech enhancement method based on Recursive Least Squares (RLS) adaptive filter of speech signals. Experiments were performed on noisy data which was prepared by adding AWGN, Babble and Pink noise to clean speech samples at -5dB, 0dB, 5dB, and 10dB SNR levels. We then compare the noise cancellation performance of proposed RLS algorithm with existing NLMS algorithm in terms of Mean Squared Error (MSE), Signal to Noise ratio (SNR), and SNR loss. Based on the performance evaluation, the proposed RLS algorithm was found to be a better optimal noise cancellation technique for speech signals. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=adaptive%20filter" title="adaptive filter">adaptive filter</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20noise%20canceller" title=" adaptive noise canceller"> adaptive noise canceller</a>, <a href="https://publications.waset.org/abstracts/search?q=mean%20squared%20error" title=" mean squared error"> mean squared error</a>, <a href="https://publications.waset.org/abstracts/search?q=noise%20reduction" title=" noise reduction"> noise reduction</a>, <a href="https://publications.waset.org/abstracts/search?q=NLMS" title=" NLMS"> NLMS</a>, <a href="https://publications.waset.org/abstracts/search?q=RLS" title=" RLS"> RLS</a>, <a href="https://publications.waset.org/abstracts/search?q=SNR" title=" SNR"> SNR</a>, <a href="https://publications.waset.org/abstracts/search?q=SNR%20loss" title=" SNR loss"> SNR loss</a> </p> <a href="https://publications.waset.org/abstracts/16212/a-novel-rls-based-adaptive-filtering-method-for-speech-enhancement" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/16212.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">378</span> Application of the Least Squares Method in the Adjustment of Chlorodifluoromethane (HCFC-142b) Regression Models </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=L.%20J.%20de%20Bessa%20Neto">L. J. de Bessa Neto</a>, <a href="https://publications.waset.org/abstracts/search?q=V.%20S.%20Filho"> V. S. Filho</a>, <a href="https://publications.waset.org/abstracts/search?q=J.%20V.%20Ferreira%20Nunes"> J. V. Ferreira Nunes</a>, <a href="https://publications.waset.org/abstracts/search?q=G.%20C.%20Bergamo"> G. C. Bergamo</a> </p> <p class="card-text"><strong>Abstract:</strong></p> There are many situations in which human activities have significant effects on the environment. Damage to the ozone layer is one of them. The objective of this work is to use the Least Squares Method, considering the linear, exponential, logarithmic, power and polynomial models of the second degree, to analyze through the coefficient of determination (R²), which model best fits the behavior of the chlorodifluoromethane (HCFC-142b) in parts per trillion between 1992 and 2018, as well as estimates of future concentrations between 5 and 10 periods, i.e. the concentration of this pollutant in the years 2023 and 2028 in each of the adjustments. A total of 809 observations of the concentration of HCFC-142b in one of the monitoring stations of gases precursors of the deterioration of the ozone layer during the period of time studied were selected and, using these data, the statistical software Excel was used for make the scatter plots of each of the adjustment models. With the development of the present study, it was observed that the logarithmic fit was the model that best fit the data set, since besides having a significant R² its adjusted curve was compatible with the natural trend curve of the phenomenon. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chlorodifluoromethane%20%28HCFC-142b%29" title="chlorodifluoromethane (HCFC-142b)">chlorodifluoromethane (HCFC-142b)</a>, <a href="https://publications.waset.org/abstracts/search?q=ozone" title=" ozone"> ozone</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20squares%20method" title=" least squares method"> least squares method</a>, <a href="https://publications.waset.org/abstracts/search?q=regression%20models" title=" regression models"> regression models</a> </p> <a href="https://publications.waset.org/abstracts/104490/application-of-the-least-squares-method-in-the-adjustment-of-chlorodifluoromethane-hcfc-142b-regression-models" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/104490.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">123</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">377</span> From the Recursive Definition of Refutability to the Invalidity of Gödel’s 1931 Incompleteness</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Paola%20Cattabriga">Paola Cattabriga</a> </p> <p class="card-text"><strong>Abstract:</strong></p> According to Gödel’s first incompleteness argument it is possible to construct a formally undecidable proposition in Principia mathematica, a statement that, although true, turns out to be neither provable nor refutable for the system, making therefore incomplete any formal system suitable for the arithmetic of integers. Its features and limitation effects are today widespread basics throughout whole scientific thought. This article brings Gödel’s achievement into question by the definition of the refutability predicate as a number-theoretical statement. We develop proof of invalidity of Theorem VI in Gödel’s 1931, the so-called Gödel’s first incompleteness theorem, in two steps: defining refutability within the same recursive status as provability and showing that as a consequence propositions (15) and (16), derived from definition 8.1 in Gödel’s 1931, are false and unacceptable for the system. The achievement of their falsity blocks the derivation of Theorem VI, which turns out to be therefore invalid, together with all the depending theorems. This article opens up thus new perspectives for mathematical research and for the overall scientific reasoning. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=G%C3%B6del%20numbering" title="Gödel numbering">Gödel numbering</a>, <a href="https://publications.waset.org/abstracts/search?q=incompleteness" title=" incompleteness"> incompleteness</a>, <a href="https://publications.waset.org/abstracts/search?q=provability%20predicate" title=" provability predicate"> provability predicate</a>, <a href="https://publications.waset.org/abstracts/search?q=refutability%20predicate" title=" refutability predicate"> refutability predicate</a> </p> <a href="https://publications.waset.org/abstracts/55179/from-the-recursive-definition-of-refutability-to-the-invalidity-of-godels-1931-incompleteness" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55179.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">188</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">376</span> Voltage Problem Location Classification Using Performance of Least Squares Support Vector Machine LS-SVM and Learning Vector Quantization LVQ</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=M.%20Khaled%20Abduesslam">M. Khaled Abduesslam</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Ali"> Mohammed Ali</a>, <a href="https://publications.waset.org/abstracts/search?q=Basher%20H.%20Alsdai"> Basher H. Alsdai</a>, <a href="https://publications.waset.org/abstracts/search?q=Muhammad%20Nizam%20Inayati"> Muhammad Nizam Inayati</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the voltage problem location classification using performance of Least Squares Support Vector Machine (LS-SVM) and Learning Vector Quantization (LVQ) in electrical power system for proper voltage problem location implemented by IEEE 39 bus New-England. The data was collected from the time domain simulation by using Power System Analysis Toolbox (PSAT). Outputs from simulation data such as voltage, phase angle, real power and reactive power were taken as input to estimate voltage stability at particular buses based on Power Transfer Stability Index (PTSI).The simulation data was carried out on the IEEE 39 bus test system by considering load bus increased on the system. To verify of the proposed LS-SVM its performance was compared to Learning Vector Quantization (LVQ). The results showed that LS-SVM is faster and better as compared to LVQ. The results also demonstrated that the LS-SVM was estimated by 0% misclassification whereas LVQ had 7.69% misclassification. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=IEEE%2039%20bus" title="IEEE 39 bus">IEEE 39 bus</a>, <a href="https://publications.waset.org/abstracts/search?q=least%20squares%20support%20vector%20machine" title=" least squares support vector machine"> least squares support vector machine</a>, <a href="https://publications.waset.org/abstracts/search?q=learning%20vector%20quantization" title=" learning vector quantization"> learning vector quantization</a>, <a href="https://publications.waset.org/abstracts/search?q=voltage%20collapse" title=" voltage collapse"> voltage collapse</a> </p> <a href="https://publications.waset.org/abstracts/11211/voltage-problem-location-classification-using-performance-of-least-squares-support-vector-machine-ls-svm-and-learning-vector-quantization-lvq" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11211.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">441</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=recursive%20least%20squares&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares&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=recursive%20least%20squares&page=13">13</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares&page=14">14</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=recursive%20least%20squares&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>